A5052957076- Caching and Content Delivery
- Peer-to-Peer Network Technologies
- Advanced Data Storage Technologies
- Cloud Computing and Resource Management
- Spam and Phishing Detection
- Conducting polymers and applications
- Cloud Data Security Solutions
- Network Security and Intrusion Detection
- Distributed systems and fault tolerance
- Graph Theory and Algorithms
- Internet Traffic Analysis and Secure E-voting
- Organic Electronics and Photovoltaics
- Complex Network Analysis Techniques
- Opportunistic and Delay-Tolerant Networks
- Parallel Computing and Optimization Techniques
- Access Control and Trust
- Network Traffic and Congestion Control
- Heusler alloys: electronic and magnetic properties
- Recommender Systems and Techniques
- Advanced Graph Neural Networks
- Web Data Mining and Analysis
- Distributed and Parallel Computing Systems
- MXene and MAX Phase Materials
- Transition Metal Oxide Nanomaterials
- Nonlinear Optical Materials Research
Yunnan University
2024
National Natural Science Foundation of China
2024
Peking University
2011-2020
Nanjing Normal University
2012-2019
Beijing Institute of Big Data Research
2017
George Mason University
2008-2012
Sybil accounts are fake identities created to unfairly increase the power or resources of a single user. Researchers have long known about existence in online communities such as file-sharing systems, but not been able perform large scale measurements detect them measure their activities. In this paper, we describe our efforts detect, characterize and understand account activity Renren social network (OSN). We use ground truth provided by Inc. build measurement based detectors, deploy on...
Peer-to-peer networks often use incentive policies to encourage cooperation between nodes. Such systems are generally susceptible collusion by groups of users in order gain unfair advantages over others. While techniques have been proposed combat Web spam collusion, there few measurements real deployed systems. In this paper, we report analysis and measurement results user Maze, a large-scale peer-to-peer file sharing system with non-net-zero point-based policy. We search for colluding...
GraM is an efficient and scalable graph engine for a large class of widely used algorithms. It designed to scale up multicores on single server, as well out multiple servers in cluster, offering significant, often over order-of-magnitude, improvement existing distributed engines evaluated also capable processing graphs that are significantly larger than previously reported. In particular, using 64 (1,024 physical cores), it performs PageRank iteration 140 seconds synthetic with one trillion...
Despite the increasing popularity, Internet video streaming to mobile devices is still challenging. In particular, there has been a format and resolution "gap" between videos devices, so users have high demand on transcoding facilitate their specific devices. However, as computation-intensive work, greatly challenged by limited battery capacity of this paper we propose implement "Cloud Transcoder", which utilizes an intermediate cloud platform bridge via its special practical designs....
Cloud storage services such as Dropbox, Google Drive, and Microsoft OneDrive provide users with a convenient reliable way to store share data from anywhere, on any device, at time. The cornerstone of these is the synchronization (sync) operation which automatically maps changes in users' local filesystems cloud via series network communications timely manner. If not designed properly, however, tremendous amount sync traffic can potentially cause (financial) pains both service providers users.
Online social networks (OSNs) suffer from the creation of fake accounts that introduce product reviews, malware and spam. Existing defenses focus on using graph structure to isolate fakes. However, our work shows Sybils could befriend a large number real users, invalidating assumption behind social-graph-based detection. In this paper, we present VoteTrust, scalable defense system further leverages user-level activities. VoteTrust models friend invitation interactions among users as...
Finding top-k items in data streams is a fundamental problem mining. Existing algorithms that can achieve unbiased estimation suffer from poor accuracy. In this paper, we propose new sketch, WavingSketch, which much more accurate than existing algorithms. WavingSketch generic, and show how it be applied to four applications: finding frequent items, heavy changes, persistent Super-Spreaders. We theoretically prove provide estimation, then give an error bound of our algorithm. Our experimental...
Online social networks (OSNs) currently face a significant challenge by the existence and continuous creation of fake user accounts (Sybils), which can undermine quality network service introducing spam manipulating online rating. Recently, there has been much excitement in research community over exploiting structure to detect Sybils. However, they rely on assumption that Sybils form tight-knit community, may not hold real OSNs. In this paper, we present VoteTrust, Sybil detection system...
Abstract First‐principles calculations are used to investigate the electronic properties of negatively charged n ‐pyrrole oligomers with = 2–18. Chains neutral bent, whereas become almost planar due accumulation negative charge at end monomers. Isomers short ( < 6) display electron affinity although corresponding anions energetically stable. For longer ≥ 6, is small and positive, slowly increasing oligopyrrole length. Doping 12‐pyrrole lithium atoms shows that oxidation states possible...
Graph processing systems have been widely used in enterprises like online social networks to process their daily jobs. With the fast growing of applications, they efficiently handle massive concurrent However, due inherent design for single job, existing incur great inefficiency memory use and fault tolerance. Motivated by this, this paper we introduce Seraph, a graph system that enables efficient job-level parallelism. Seraph is designed based on decoupled data model, which allows multiple...
Background and aims Root-knot nematodes (RKN; Meloidogyne spp.) are among the highly prevalent significantly detrimental pathogens that cause severe economic yield losses in crops. Currently, control of RKN primarily relies on application chemical nematicides but it has environmental public health concerns, which open new doors for alternative methods form biological control. Methods In this study, we investigated nematicidal attractive activities an endophytic strain WF01 against incognita...
Reputation systems are playing critical roles in securing today's distributed computing and communication systems. Similar to other security mechanisms, reputation can be under attack. In this paper, we report the discovery of a new attack, named RepTrap(Reputation Trap), against feedback-based systems, such as those used P2P file-sharing E-commerce websites(e.g. Amazon.com). We conduct an in-depth investigation on including analysis, case study, performance evaluation based real data...
Abstract Much work has been done to address the need for incentive models in real deployed peer‐to‐peer networks. In this paper, we discuss problems found with model a large, network, Maze. We evaluate several alternatives, and propose an system that generates preferences well‐behaved nodes while correctly punishing colluders. our proposal as hybrid between Tit‐for‐Tat EigenTrust, show its effectiveness through simulation of traces Maze system. Copyright © 2007 John Wiley & Sons, Ltd.
Graph processing systems have been widely used in enterprises like online social networks to process their daily jobs. With the fast growing of applications, they efficiently handle massive concurrent However, due inherent design for a single job, existing incur great inefficiency terms memory usage, execution and fault tolerance. Motivated by this issue, paper we introduce Seraph, graph system that enables efficient job-level parallelism. Seraph is designed based on decoupled computation...
First-principles calculations are used to investigate the electronic properties of neutral and negatively charged n-pyrrole oligomers with n= 2-18. Chains bent while become almost flat due accumulation negative charge at end monomers. Several isomers short (n < 5) display electron affinity, although they energetically stable. For longer n > 5, affinity turns positive, increasing oligomer length. The doping 12-pyrrole lithium atoms is studied, showing that oxidation states possible...
Energetics and vibrational analysis study of six isomers methyl salicylate in their singlet ground state first excited triple is put forward this work at the density functional theory level large basis sets. The ketoB isomer lowest energy isomer, followed by its rotamer ketoA. For both ketoA enolized tautomers are found to be stable as well open forms that lack internal hydrogen bond. calculated spectra excellent agreement with IR experiments vapor phase. It demonstrated solvent effects have...