Institution
National University of Defense Technology
Education•Changsha, China•
About: National University of Defense Technology is a education organization based out in Changsha, China. It is known for research contribution in the topics: Radar & Synthetic aperture radar. The organization has 39430 authors who have published 40181 publications receiving 358979 citations. The organization is also known as: Guófáng Kēxuéjìshù Dàxué & NUDT.
Topics: Radar, Synthetic aperture radar, Laser, Fiber laser, Radar imaging
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper presents a general trust model, called RLM, for a more comprehensive and robust reputation evaluation, and demonstrates the robustness of the RLM design against adulating and defaming attacks, two popular types of feedback attacks.
Abstract: Reputation-based trust systems provide important capability in open and service-oriented computing environments. Most existing trust models fail to assess the variance of a reputation prediction. Moreover, the summation method, widely used for reputation feedback aggregation, is vulnerable to malicious feedbacks. This paper presents a general trust model, called RLM, for a more comprehensive and robust reputation evaluation. Concretely, we define a comprehensive reputation evaluation method based on two attributes: reputation value and reputation prediction variance. The reputation predication variance serves as a quality measure of the reputation value computed based on aggregation of feedbacks. For feedback aggregation, we propose the novel Kalman aggregation method, which can inherently support robust trust evaluation. To defend against malicious and coordinated feedbacks, we design the Expectation Maximization algorithm to autonomously mitigate the influence of a malicious feedback, and further apply the hypothesis test method to resist malicious feedbacks precisely. Through theoretical analysis, we demonstrate the robustness of the RLM design against adulating and defaming attacks, two popular types of feedback attacks. Our experiments show that the RLM model can effectively capture the reputation's evolution and outperform the popular summation-based trust models in terms of both accuracy and attack resilience. Concretely, under the attack of collusive malicious feedbacks, RLM offers higher robustness for the reputation prediction and a lower false positive rate for the malicious feedback detection.
92 citations
••
21 May 2018TL;DR: This work presents a reputation-based consensus protocol called Proof of Reputation (PoR), which guarantees the reliability and integrity of transaction outcomes in an efficient way and lets reputation serves as the incentive for both good behavior and block publication instead of digital coins, therefore no miners are needed.
Abstract: The advent of blockchain sheds light on addressing trust issues of peer-to-peer networks by providing a distributed tamper-resistant ledger. Beyond cryptocurrencies, it is believed that blockchain can also be used to protect other properties such as reputation. Most of the existing studies of enhancing reputation systems using blockchains are built on top of the bitcoin-like blockchains, so they are inherently constrained by the low-efficiency and high-consumption of the underlying blockchain. To fill this gap, we present a reputation-based consensus protocol called Proof of Reputation (PoR), which guarantees the reliability and integrity of transaction outcomes in an efficient way. In PoR, we let reputation serves as the incentive for both good behavior and block publication instead of digital coins, therefore no miners are needed. We also implement a prototype and our scalability experiments show that our protocol can scale to over a thousand participants in a peer-to-peer network with throughput of hundreds of transactions per second.
92 citations
••
TL;DR: In this article, a deep-subwavelength absorber based on the concept of coiled-up space was investigated and it was found that the resonance frequency of the absorber is easily tuned and near-total absorption is acquired under a fixed deep subwavelength thickness.
Abstract: This paper presents a theoretical, numerical, and experimental investigation of a deep-subwavelength absorber based on the concept of coiled-up space. By adjusting a partition panel in the cavity to form an unequal-section channel, it is found that the resonance frequency of the absorber is easily tuned and near-total absorption is acquired under a fixed deep-subwavelength thickness. The absorption mechanism induced by nearly critical coupling is revealed by graphically analyzing the reflection coefficient in the complex plane. In contrast to conventional techniques, near-total absorption can be adjusted over a wider frequency range. To further enhance the absorption, we demonstrate a broadband absorber with a relative bandwidth up to 33.3%.
92 citations
••
TL;DR: This work proposes a scheme to implement MDI-QKD, but with continuous variables instead of discrete ones, i.e., with the source of Gaussian-modulated coherent states, based on the principle of continuous-variable entanglement swapping, which will be highly compatible with quantum networks.
Abstract: Measurement-device-independent quantum key distribution (MDI-QKD), leaving the detection procedure to the third partner and thus being immune to all detector side-channel attacks, is very promising for the construction of high-security quantum information networks. We propose a scheme to implement MDI-QKD, but with continuous variables instead of discrete ones, i.e., with the source of Gaussian-modulated coherent states, based on the principle of continuous-variable entanglement swapping. This protocol not only can be implemented with current telecom components but also has high key rates compared to its discrete counterpart; thus it will be highly compatible with quantum networks.
92 citations
••
10 May 2009TL;DR: This work proposes a technique for analyzing communication delay bounds for individual flows in wormhole networks using the network contention tree model in the buffer-sharing analysis network, and derives their delay bounds using network calculus.
Abstract: In packet-switched network-on-chip, computing worst-case delay bounds is crucial for designing predictable and cost-effective communication systems but yet an intractable problem due to complicated resource sharing scenarios. For wormhole networks with credit-based flow control, the existence of cyclic dependency between flit delivery and credit generation further complicates the problem. Based on network calculus, we propose a technique for analyzing communication delay bounds for individual flows in wormhole networks. We first propose router service analysis models for flow control, link and buffer sharing. Based on these analysis models, we obtain a buffering-sharing analysis network, which is open-ended and captures both flow control and link sharing. Furthermore, we compute equivalent service curves for individual flows using the network contention tree model in the buffer-sharing analysis network, and then derive their delay bounds. Our experimental results verify that the theoretical bounds are correct and tight.
92 citations
Authors
Showing all 39659 results
Name | H-index | Papers | Citations |
---|---|---|---|
Rui Zhang | 151 | 2625 | 107917 |
Jian Li | 133 | 2863 | 87131 |
Chi Lin | 125 | 1313 | 102710 |
Wei Xu | 103 | 1492 | 49624 |
Lei Liu | 98 | 2041 | 51163 |
Xiang Li | 97 | 1472 | 42301 |
Chang Liu | 97 | 1099 | 39573 |
Jian Huang | 97 | 1189 | 40362 |
Tao Wang | 97 | 2720 | 55280 |
Wei Liu | 96 | 1538 | 42459 |
Jian Chen | 96 | 1718 | 52917 |
Wei Wang | 95 | 3544 | 59660 |
Peng Li | 95 | 1548 | 45198 |
Jianhong Wu | 93 | 726 | 36427 |
Jianhua Zhang | 92 | 415 | 28085 |