Institution
Xidian University
Education•Xi'an, China•
About: Xidian University is a education organization based out in Xi'an, China. It is known for research contribution in the topics: Antenna (radio) & Synthetic aperture radar. The organization has 32099 authors who have published 38961 publications receiving 431820 citations. The organization is also known as: University of Electronic Science and Technology at Xi'an & Xīān Diànzǐ Kējì Dàxué.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper offers a detailed introduction to the background of data fusion and machine learning in terms of definitions, applications, architectures, processes, and typical techniques, and proposes a number of requirements to review and evaluate the performance of existing fusion methods based on machine learning.
309 citations
••
TL;DR: Zhang et al. as mentioned in this paper proposed a deep learning-based approach, called ST-ResNet, to collectively forecast two types of crowd flows (i.e. inflow and outflow) in each and every region of a city.
308 citations
••
TL;DR: This paper proposes an efficient public auditing protocol with global and sampling blockless verification as well as batch auditing, where data dynamics are substantially more efficiently supported than is the case with the state of the art.
Abstract: With the rapid development of cloud computing, cloud storage has been accepted by an increasing number of organizations and individuals, therein serving as a convenient and on-demand outsourcing application However, upon losing local control of data, it becomes an urgent need for users to verify whether cloud service providers have stored their data securely Hence, many researchers have devoted themselves to the design of auditing protocols directed at outsourced data In this paper, we propose an efficient public auditing protocol with global and sampling blockless verification as well as batch auditing, where data dynamics are substantially more efficiently supported than is the case with the state of the art Note that, the novel dynamic structure in our protocol consists of a doubly linked info table and a location array Moreover, with such a structure, computational and communication overheads can be reduced substantially Security analysis indicates that our protocol can achieve the desired properties Moreover, numerical analysis and real-world experimental results demonstrate that the proposed protocol achieves a given efficiency in practice
305 citations
••
TL;DR: This paper proposes a secure multi-owner data sharing scheme, named Mona, for dynamic groups in the cloud, leveraging group signature and dynamic broadcast encryption techniques, so that any cloud user can anonymously share data with others.
Abstract: With the character of low maintenance, cloud computing provides an economical and efficient solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while preserving data and identity privacy from an untrusted cloud is still a challenging issue, due to the frequent change of the membership. In this paper, we propose a secure multi-owner data sharing scheme, named Mona, for dynamic groups in the cloud. By leveraging group signature and dynamic broadcast encryption techniques, any cloud user can anonymously share data with others. Meanwhile, the storage overhead and encryption computation cost of our scheme are independent with the number of revoked users. In addition, we analyze the security of our scheme with rigorous proofs, and demonstrate the efficiency of our scheme in experiments.
302 citations
••
TL;DR: An MOEA based on decision variable analyses (DVAs) is proposed and control variable analysis is used to recognize the conflicts among objective functions.
Abstract: State-of-the-art multiobjective evolutionary algorithms (MOEAs) treat all the decision variables as a whole to optimize performance. Inspired by the cooperative coevolution and linkage learning methods in the field of single objective optimization, it is interesting to decompose a difficult high-dimensional problem into a set of simpler and low-dimensional subproblems that are easier to solve. However, with no prior knowledge about the objective function, it is not clear how to decompose the objective function. Moreover, it is difficult to use such a decomposition method to solve multiobjective optimization problems (MOPs) because their objective functions are commonly conflicting with one another. That is to say, changing decision variables will generate incomparable solutions. This paper introduces interdependence variable analysis and control variable analysis to deal with the above two difficulties. Thereby, an MOEA based on decision variable analyses (DVAs) is proposed in this paper. Control variable analysis is used to recognize the conflicts among objective functions. More specifically, which variables affect the diversity of generated solutions and which variables play an important role in the convergence of population. Based on learned variable linkages, interdependence variable analysis decomposes decision variables into a set of low-dimensional subcomponents. The empirical studies show that DVA can improve the solution quality on most difficult MOPs. The code and supplementary material of the proposed algorithm are available at http://web.xidian.edu.cn/fliu/paper.html .
301 citations
Authors
Showing all 32362 results
Name | H-index | Papers | Citations |
---|---|---|---|
Zhong Lin Wang | 245 | 2529 | 259003 |
Jie Zhang | 178 | 4857 | 221720 |
Bin Wang | 126 | 2226 | 74364 |
Huijun Gao | 121 | 685 | 44399 |
Hong Wang | 110 | 1633 | 51811 |
Jian Zhang | 107 | 3064 | 69715 |
Guozhong Cao | 104 | 694 | 41625 |
Lajos Hanzo | 101 | 2040 | 54380 |
Witold Pedrycz | 101 | 1766 | 58203 |
Lei Liu | 98 | 2041 | 51163 |
Qi Tian | 96 | 1030 | 41010 |
Wei Liu | 96 | 1538 | 42459 |
MengChu Zhou | 96 | 1124 | 36969 |
Chunying Chen | 94 | 508 | 30110 |
Daniel W. C. Ho | 85 | 360 | 21429 |