Institution
Chongqing University of Posts and Telecommunications
Education•Chongqing, China•
About: Chongqing University of Posts and Telecommunications is a education organization based out in Chongqing, China. It is known for research contribution in the topics: Wireless sensor network & Cluster analysis. The organization has 11007 authors who have published 9177 publications receiving 79458 citations.
Topics: Wireless sensor network, Cluster analysis, Node (networking), Wireless network, Feature extraction
Papers published on a yearly basis
Papers
More filters
TL;DR: iProX will facilitate worldwide data analysis and sharing of proteomics experiments, and is based on a high availability architecture and has been deployed as part of the proteomics infrastructure of China, ensuring long-term and stable resource support.
Abstract: Sharing of research data in public repositories has become best practice in academia. With the accumulation of massive data, network bandwidth and storage requirements are rapidly increasing. The ProteomeXchange (PX) consortium implements a mode of centralized metadata and distributed raw data management, which promotes effective data sharing. To facilitate open access of proteome data worldwide, we have developed the integrated proteome resource iProX (http://www.iprox.org) as a public platform for collecting and sharing raw data, analysis results and metadata obtained from proteomics experiments. The iProX repository employs a web-based proteome data submission process and open sharing of mass spectrometry-based proteomics datasets. Also, it deploys extensive controlled vocabularies and ontologies to annotate proteomics datasets. Users can use a GUI to provide and access data through a fast Aspera-based transfer tool. iProX is a full member of the PX consortium; all released datasets are freely accessible to the public. iProX is based on a high availability architecture and has been deployed as part of the proteomics infrastructure of China, ensuring long-term and stable resource support. iProX will facilitate worldwide data analysis and sharing of proteomics experiments.
740 citations
TL;DR: In this paper, a model of holographic dark energy with an interaction with matter fields has been investigated, and it has been shown that the ratio of energy densities can vary with time.
Abstract: A model of holographic dark energy with an interaction with matter fields has been investigated. Choosing the future event horizon as an IR cutoff, we have shown that the ratio of energy densities can vary with time. With the interaction between the two different constituents of the universe, we observed the evolution of the universe, from early deceleration to late time acceleration. In addition, we have found that such an interacting dark energy model can accommodate a transition of the dark energy from a normal state where w D > − 1 to w D − 1 phantom regimes. Implications of interacting dark energy model for the observation of dark energy transition has been discussed.
693 citations
TL;DR: This work forms the computation offloading decision, resource allocation and content caching strategy as an optimization problem, considering the total revenue of the network, and develops an alternating direction method of multipliers-based algorithm to solve the optimization problem.
Abstract: Mobile edge computing has risen as a promising technology for augmenting the computational capabilities of mobile devices Meanwhile, in-network caching has become a natural trend of the solution of handling exponentially increasing Internet traffic The important issues in these two networking paradigms are computation offloading and content caching strategies, respectively In order to jointly tackle these issues in wireless cellular networks with mobile edge computing, we formulate the computation offloading decision, resource allocation and content caching strategy as an optimization problem, considering the total revenue of the network Furthermore, we transform the original problem into a convex problem and then decompose it in order to solve it in a distributed and efficient way Finally, with recent advances in distributed convex optimization, we develop an alternating direction method of multipliers-based algorithm to solve the optimization problem The effectiveness of the proposed scheme is demonstrated by simulation results with different system parameters
611 citations
TL;DR: The advantage of the event-based strategy is the significant decrease of the number of controller updates for cooperative tasks of multi-agent systems involving embedded microprocessors with limited on-board resources.
Abstract: In this paper, the event-based consensus problem of general linear multi-agent systems is considered. Two sufficient conditions with or without continuous communication between neighboring agents are presented to guarantee the consensus. The advantage of the event-based strategy is the significant decrease of the number of controller updates for cooperative tasks of multi-agent systems involving embedded microprocessors with limited on-board resources. The controller updates of each agent are driven by properly defined events, which depend on the measurement error, the states of its neighboring agents and an arbitrarily small threshold. It is shown that the controller updates for each agent only trigger at its own event time instants. A simulation example is presented to illustrate the theoretical results.
565 citations
01 Jan 2011
TL;DR: A fast image encryption algorithm with combined permutation and diffusion is proposed and an efficient method for generating pseudorandom numbers from spatiotemporal chaos is suggested, which further increases the encryption speed.
Abstract: In recent years, various image encryption algorithms based on the permutation-diffusion architecture have been proposed where, however, permutation and diffusion are considered as two separate stages, both requiring image-scanning to obtain pixel values. If these two stages are combined, the duplicated scanning effort can be reduced and the encryption can be accelerated. In this paper, a fast image encryption algorithm with combined permutation and diffusion is proposed. First, the image is partitioned into blocks of pixels. Then, spatiotemporal chaos is employed to shuffle the blocks and, at the same time, to change the pixel values. Meanwhile, an efficient method for generating pseudorandom numbers from spatiotemporal chaos is suggested, which further increases the encryption speed. Theoretical analyses and computer simulations both confirm that the new algorithm has high security and is very fast for practical image encryption.
528 citations
Authors
Showing all 11091 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jie Zhang | 178 | 4857 | 221720 |
Bin Liu | 138 | 2181 | 87085 |
Wei Zhang | 96 | 1404 | 43392 |
Jing Zhou | 84 | 533 | 37101 |
Emmanuel N. Saridakis | 84 | 373 | 21326 |
Lei Guo | 75 | 1589 | 27943 |
Peng Xu | 75 | 1151 | 25005 |
Rong-Gen Cai | 72 | 310 | 18028 |
Alan Tennant | 70 | 433 | 16870 |
Xinbo Gao | 68 | 734 | 18127 |
Xiaofeng Liao | 67 | 457 | 16381 |
Bin Wang | 59 | 340 | 13224 |
Song Guo | 55 | 578 | 12454 |
Pan Zheng | 55 | 209 | 12059 |
Jun Ma | 52 | 455 | 14964 |