检索结果-内蒙古大学图书馆

A review on the churn character of P2P networks

Jisuanji Xuebao/Chinese Journal of Computers 2011年第9期34卷 1563-1577页

作者： Fu, Zhi-Peng Wang, Huai-Min Shi, Dian-Xi Zou, Peng School of Computer Science National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

P2P application is one of the most popular applications in the Internet, but its performance is badly influenced by the churn character-the nodes continuous arrival and departure. On the basis of introducing the origin of the churn, the definition of it and its influences to the P2P system performance, we minutely describe the research on the statistical properties, and discover some dynamic law including nodes' session time generally obey the heavy-tailed distribution. Then we detail the measurement methods. For passive monitoring, active monitoring, sample and so on, we present the advantages and disadvantages of each method, and explain the corresponding improving method to enhance the accuracy of the measurement. After that we elaborate the resilience strategies to the churn. Towards the neighbor selection, failure recovery, replica maintenance, link lifetime maintenance and so on, we present also the advantage and disadvantage of each strategy, and present our view to each of aspects. Finally, the summary and prospect of the future research are given.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

RLLL: Accurate Relative Localization of RFID Tags with Low Latency

RLLL: Accurate Relative Localization of RFID Tags with Low L...

引用

International Workshop on Quality of Service

作者： Xuan Liu Quan Yang Shigeng Zhang Bin Xiao The Science and Technology on Parallel and Distributed Processing Laboratory (PDL) P. R. China College of Computer Science and Electronic Engineering Hunan University P. R. China School of Computer Science and Engineering Central South University P. R. China The Hong Kong Polytechnic University Hong Kong

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

Radio frequency identification (RFID) has been widely used in many smart applications. In many scenarios, it is essential to know the ordering of a set of RFID tags. For example, to quickly detect misplaced books in smart libraries, we need to know the relative ordering of the tags attached to the books. Although several relative RFID localization algorithms have been proposed, they usually suffer from large localization latency and cannot support applications that require real-time detection of tag (product) positions like automatic manufacturing on an assembly line. Moreover, existing approaches face significant degradation in ordering accuracy when the tags are close to each other. In this paper, we propose RLLL, an accurate Relative Localization algorithm for RFID tags with Low Latency. RLLL reduces localization latency by proposing a novel geometry-based approach to identifying the V-zone in the phase reading sequence of each tag. Moreover, RLLL uses only the data in the V-zone to calculate relative positions of tags and thus avoids the negative effects of low-quality data collected when the tag is far from the antenna. Experimental results with commercial RFID devices show that RLLL achieves an ordering accuracy of higher than 0.986 with latency less than 0.8 seconds even when the tags are spaced only 7 mm from adjacent tags, in which case the state-of-the-art solutions only achieve ordering accuracy of lower than 0.8 with localization latency larger than 3 seconds.

关键词： RFID tags Manufacturing Antenna arrays Quality of service Libraries

来源：评论

学校读者我要写书评

暂无评论

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Symmetric Encryption for Cloud Storage

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Sy...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Panyu Wu Zhenfu Cao Jiachen Shen Xiaolei Dong Yihao Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan

Since data outsourcing poses privacy concerns with data leakage, searchable symmetric encryption (SSE) has emerged as a powerful solution that enables clients to perform query operations on encrypted data while preserving their privacy. Dynamic SSE schemes have been proposed to handle update operations. However, it is shown that updates might increase the risk of information leakage. Meanwhile, to meet the requirement of real-world applications, it is desirable to have the searchable encryption scheme which supports both multiple clients and multi-keyword queries. To address these issues, this paper proposes MMDSSE, a multi-client forward secure dynamic SSE scheme that supports multi-keyword queries. MMDSSE allows the clients narrow down the results by providing an arbitrary subset of the entire archive, and thus suitable for cloud storage environment. Security analysis and experimental evaluations show that MMDSSE is secure and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A GPU-based parallel WFST decoder on nnet3

引用

AIP Conference Proceedings 2019年第1期2073卷

作者： Yong Wang Jie Liu Chen Zhou Zhengbin Pang Shengguo Li Chunye Gong Xinbiao Gan Yurong Li 1Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

One performance-intensive part of automatic speech recognition is the weighted finite-state transducer (WFST) decoding. To solve the problem, we expand parallel Graphics processing Units (GPU) computing to the decoding period. We describe extension work based on Kaldi toolkit for speech recognition research. Our work can support weighted finite-state transducer decoding on Kaldi neural nets with CUDA toolkit. Our paper also expands an efficient parallel Viterbi beam decoding algorithm to decrease the speech recognition Real Time Factor (RTF) value. Together with our optimization algorithm, we have reached 2.3x speed up on the AISHELL corpus decoding. We also implement nnet3 decoder that improves real-time speed up with no word error rate raise.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved conjugate residual algorithm for large symmetric linear systems

引用

Jisuanji Xuebao/Chinese Journal of Computers 2006年第3期29卷 495-499页

作者： Liu, Jie Liu, Xing-Ping Chi, Li-Hua Hu, Qing-Feng National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Institute of Applied Physics and Computation Mathematics Beijing 100088 China

The conjugate residual (CR) algorithm is a Krylov subspace algorithm that can be used to obtain fast solutions for symmetric linear systems with very large and very sparse coefficient matrices. By changing the computation sequence in the CR algorithm, this paper proposes an improved Conjugate Residual (ICR) algorithm. The numerical stability of ICR algorithm is same as CR algorithm, but the synchronization overhead that represents the bottleneck of the parallel performance is effectively reduced by a factor of two. And all inner products of a single iteration step are independent and communication time required for inner product can be over lapped efficiently with computation time of vector updates. From the theoretical and experimental analysis it is found that ICR algorithm is faster than CR algorithm as the number of processors in creases. The experiments performed on a 64-processor cluster indicate that ICR is approximately 30% faster than CR.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimization approaches of organizing streams on imagine processor

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第7期31卷 1092-1100页

作者： Yang, Xue-Jun Zeng, Li-Fang Deng, Yu Tang, Yu-Hua National Key Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Jiangnan Remote Sensing Institute Shanghai 200072 China

Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This paper presents two means, stream partition (SP) and stream compression (SC), to optimize streams on Imagine. The results of simulation show that SP and SC can make stream applications take full advantage of the parallel clusters, pipelines and three-level memory hierarchy of the Imagine processor, and then reduce the execution time of stream programs.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MixedCache: Enabling Flow Directed Rule-Caching Scheme based on Heterogeneous Cache for OpenFlow

引用

Journal of Physics: Conference Series 2020年第1期1693卷

作者： Jialun Yang Yi Yang Jiahao Liu Rulin Liu Peng Qiao Baosheng Wang College of Computer Science and Technology National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Risk-Averse Just-In-Time Scheme for Learning-Based Operation of Microgrids with Coupled Electricity-Hydrogen-Ammonia under Uncertainties

arXiv

引用

arXiv 2024年

作者： Li, Longyan Ning, Chao Pan, Guangsheng Zhang, Leiqi Gu, Wei Zhao, Liang Du, Wenli Shahidehpour, Mohammad Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China School of Electrical Engineering Southeast University Nanjing210096 China Zhejiang Key Laboratory of Distributed Generations and Microgrid Technology State Grid Zhejiang Electric Power Research Institute Hangzhou310014 China Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology China Department of Electrical and Computer Engineering Illinois Institute of Technology ChicagoIL60616 United States

This paper proposes a Risk-Averse Just-In-Time (RAJIT) operation scheme for Ammonia-Hydrogen-based Micro-Grids (AHMGs) to boost electricity-hydrogen-ammonia coupling under uncertainties. First, an off-grid AHMG model is developed, featuring a novel multi-mode ammonia synthesis process and a hydrogen-ammonia dual gas turbine with tunable feed-in ratios. Subsequently, a state-behavior mapping strategy linking hydrogen storage levels with the operation modes of ammonia synthesis is established to prevent cost-ineffective shutdowns. The proposed model substantially improves operational flexibility but results in a challenging nonlinear fractional program. Based upon this model, a data-driven RAJIT scheme is developed for the real-time rolling optimization of AHMGs. Unlike conventional one-size-fits-all schemes using one optimization method throughout, the data-driven RAJIT intelligently switches between cost-effective deterministic optimization and risk-averse online-learning distributionally robust optimization depending on actual risk profiles, thus capitalizing on the respective strengths of these two optimization methods. To facilitate the solution of the resulting nonlinear program, we develop an equivalent-reformulation-based solution methodology by leveraging a constraint-tightening technique. Numerical simulations demonstrate that the proposed scheme guarantees safety and yields an overall cost reduction up to 14.6% compared with several state-of-the-art methods. © 2024, CC BY.

关键词： Ammonia

来源：评论

学校读者我要写书评

暂无评论

Operando Selenium Treatment Towards Enhanced Cyclic Stability for Single-Crystal Ni-Rich Cathode at Ultra-High Voltage of 4.7 V

SSRN

引用

SSRN 2023年

作者： Zhang, Zhi Ding, Xiang He, Xinyou Gong, Yang Xiao, Biaobiao Shen, Jixue Ou, Xing Engineering Research Center The Ministry of Education for Advanced Battery Materials School of Metallurgy and Environment Central South University Changsha410083 China Hunan Provincial Key Laboratory of Water Treatment Functional Materials Hunan Provincial Key Laboratory for Control Technology of Distributed Electric Propulsion Aircraf College of Chemistry and Materials Engineering Hunan University of Arts and Science Changde415000 China Institute of Advanced Battery Materials and Devices Faculty of Materials and Manufacturing Beijing University of Technology Beijing100124 China Tianmu Lake Institute of Advanced Energy Storage Technologies Co. Ltd Liyang213300 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Wuhan University of Technology Wuhan430070 China

Developing high-voltage (≥4.3 V vs Li/Li+) single-crystal Ni-rich LiNixCoyMn1-x-yO2 offers an enticing strategy to achieve high energy density for lithium-ion batteries. However, at high-voltage operation, the cathod... 详细信息

关键词： Single crystals

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：