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

作者： Lin, Peng Ren, Wei Song, Yongduan School of Electronic and Information Engineering Xi'An Jiaotong University China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering University of California Riverside United States Key Laboratory of Dependable Service Computing Cyber Physical Society Ministry of Education Chongqing University China School of Automation Chongqing University China

In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints and communication delays under local communication. Here the agents capable of communicating with their local neighbors are constrained to remain in possibly different closed convex sets and optimize a global objective function composed of a sum of local objective functions, each of which is known to only one agent. First, we consider the case of fixed graphs and show that distributed optimization might not be achieved on general strongly connected directed graphs. Instead, the agents optimize a weighted sum of the local objective functions. Then we consider the case of switching graphs and show that distributed optimization can be achieved when the adjacency matrices are doubly stochastic and the union of the directed graphs is strongly connected among each time interval of a certain bounded length. Furthermore, we consider the case of communication delays, where the delays are mutually independent. It is shown that the distributed optimization problem can be solved by introducing additional delays to the subgradient projection algorithm and the communication delays can be arbitrarily bounded. Finally, numerical examples are included to show the obtained theoretical results. © 2015 Elsevier Ltd. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Electrolyte‐Gated Transistors: Ink‐Jet Printable, Self‐Assembled, and Chemically Crosslinked Ion‐Gel as Electrolyte for Thin Film, Printable Transistors (Adv. Mater. Interfaces 21/2019)

引用

Advanced Materials Interfaces 2019年第21期6卷

作者： Jaehoon Jeong Gabriel Cadilha Marques Xiaowei Feng Dominic Boll Surya Abhishek Singaraju Jasmin Aghassi‐Hagmann Horst Hahn Ben Breitung Institute of Nanotechnology (INT) Karlsruhe Institute of Technology (KIT) 76344 Eggenstein‐Leopoldshafen Germany Joint Research Laboratory Nanomaterials ‐ Technische Universität Darmstadt and Karlsruhe Institute of Technology (KIT) Otto‐Berndt‐Str. 3 64206 Darmstadt Germany Chair of Dependable Nano Computing (CDNC) Department of Computer Science (ITEC) Karlsruhe Institute of Technology (KIT) 76131 Karlsruhe Germany Department of Electrical Engineering and Information Technology Offenburg University of Applied Sciences 77652 Offenburg Germany Helmholtz Institute Ulm for Electrochemical Energy Storage Helmholtzstr. 11 89081 Ulm Germany Karlsruhe Nano Micro Facility Karlsruhe Institute of Technology Hermann‐von‐Helmholtz‐Platz 1 76344 Eggenstein‐Leopoldshafen Germany

来源：评论

学校读者我要写书评

暂无评论

Fully distributed flocking with a moving leader for Lagrange networks with parametric uncertainties

Fully distributed flocking with a moving leader for Lagrange...

引用

作者： Ghapani, Sheida Mei, Jie Ren, Wei Song, Yongduan Department of Electrical and Computer Engineering University of California Riverside United States School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Key Laboratory of Dependable Service Computing Cyber Physical Society Ministry of Education Chongqing University China School of Automation Chongqing University China

This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to maintain connectivity and avoid collisions for all time and also eventually achieve velocity matching. In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents. Each follower is able to obtain information from only the neighbors in its proximity, involving only local interaction. We consider two cases: (i) the leader moves with a constant velocity, and (ii) the leader moves with a varying velocity. In the first case, a distributed continuous adaptive control algorithm accounting for unknown parameters is proposed in combination with a distributed continuous estimator for each follower. In the second case, a distributed discontinuous adaptive control algorithm and estimator are proposed. Then the algorithm is extended to be fully distributed with the introduction of gain adaptation laws. In all proposed algorithms, only one-hop neighbors' information (e.g., the relative position and velocity measurements between the neighbors and the absolute position and velocity measurements) is required, and flocking is achieved as long as the connectivity and collision avoidance are ensured at the initial time and the control gains are designed properly. Numerical simulations are presented to illustrate the theoretical results. © 2016 Elsevier Ltd. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Decentralized Context Sharing in Vehicular Delay Tolerant Networks with Compressive Sensing

Decentralized Context Sharing in Vehicular Delay Tolerant Ne...

引用

International Conference on Distributed computing Systems

作者： Kun Xie Wang Luo Xin Wang Dongliang Xie Jiannong Cao Jigang Wen Gaogang Xie College of Computer Science and Electronics Engineering Hunan University Changsha China Department of Electrical and Computer Engineering State University of New York Stony Brook USA State key Laboratory of Networking and Switching Technology Beijing Univ. of Posts and Telecomm. China Department of Computing The Hong Kong Polytechnic University Hong Kong Institute of Computing Technology Chinese Academy of Sciences Beijing China

Vehicles equipped with various types of sensors can act as mobile sensors to monitor the road conditions. To speed up the information collection process, the monitoring data can be shared among vehicles upon their encounters to facilitate drivers to find a good route. The vehicular network experiences intermittent connectivity as a result of the mobility, which makes the inter-vehicle contact duration a scarce resource for data transmissions and the support of monitoring applications over vehicular networks a challenge. We propose a novel compressive sensing (CS)-based scheme to enable efficient decentralized context sharing in vehicular delay tolerant networks, called CS-Sharing. To greatly reduce the data transmission overhead and speed up the monitoring processing, CS-sharing exploits two techniques: sending an aggregate message in each vehicle encounter, and quick collection of information taking advantage of data sharing and the sparsity of events in vehicle networks to significantly reduce the number of measurements needed for global information recovery. We propose a novel data structure, and an aggregation method that can take advantage of the random and opportunistic vehicle encounters to form the measurement matrix. We prove that the measurement matrix satisfies the Restricted Isometry Property (RIP) property required by the CS technique. Our results from extensive simulations demonstrate that CS-Sharing allows vehicles in a large network to quickly obtain the full context data with the successful recovery ratio larger than 90%.

关键词： Vehicles Context Sensors Roads Monitoring Compressed sensing Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Scan-Based Attack on Stream Ciphers: A Case Study on eSTREAM Finalists

引用

Journal of computer Science & Technology 2014年第4期29卷 646-655页

作者：邹敏辉马坤吴剀劼沙行勉 College of Computer Science Chongqing University Department of Electrical and Computer Engineering University of Illinois at Chicago Chicago IL 60607 U.S.A. IEEE Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing UniversityMinistry of Education

Scan-based design for test （DFT） is a powerful and the most popular testing technique. However, while scan-based DFT improves test efficiency, it also leaves a side channel to the privacy information stored in the chip. This paper investigates the side channel and proposes a simple but powerful scan-based attack that can reveal the key and/or state stored in the chips that implement the state-of-the-art stream ciphers with less than 85 scan-out vectors.

关键词： scan-based attack stream cipher linear and non-linear feedback shift register scan-based design for test

来源：评论

学校读者我要写书评

暂无评论

An efficient privacy-preserving compressive data gathering scheme in WSNs 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Xie, Kun Ning, Xueping Wang, Xin Wen, Jigang Liu, Xiaoxiao He, Shiming Zhang, Daqiang College of Computer Science and Electronics Engineering Hunan University Changsha410082 China The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommmunications Beijing100876 China Department of Electrical and Computer Engineering State University of New York at Stony Brook New York11790 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China State Grid HuNan Electric Power Company Research Insitute Changsha410000 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China School of Software Engineering Tongji University Shanghai201804 China

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

Due to the strict energy limitation and the common vulnerability of WSNs, providing efficient and security data gathering in WSNs becomes an essential problem. Compressive data gathering, which is based on the recent breakthroughs in compressive sensing theory, has been proposed as a viable approach for data gathering in WSNs at low communication overhead. Nevertheless, compressive data gathering is susceptible to various attacks due to the open wireless medium. To thwart traffic analysis/flow tracing and realize privacy preservation, this paper proposes a novel Efficient Privacy-Preserving Compressive Data Gathering Scheme which exploits homomorphic encryption functions in compressive data gathering. With homomorphic encryption on the compressive sensing encoded sensory reading messages, the proposed scheme offers two significant privacy-preserving features, message flow untraceability and message content confidentiality, for efficiently thwarting the traffic analysis attacks. Extensive performance evaluations and security analysis demonstrate the validity and efficiency of the proposed scheme. © Springer International Publishing Switzerland 2015.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Efficient protection and grooming architectures for future optical networks

Efficient protection and grooming architectures for future o...

引用

Network Architectures, Management, and Applications VII

作者： Somani, Arun K. Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA 50011 United States

ISBN: (纸本)9780819480354

Today networks are too cumbersome due to the incoherent integration of various technologies developed over time. Convergence of data, voice and video has caused the retro-fitting of a network to support non-native traffic types and this has led to sub-par performance for every traffic type. Fundamental changes are warranted to support high bandwidth traffic. The network must guarantee end-to-end delivery and provide inherent protection within the physical structure. We propose that the main traffic types of today's applications should be carried using the following features: connection-oriented service, traffic grooming to fill those connection oriented pipes, and forward error recovery with protection provided in the physical, layer. We present some of our research results. © 2009 SPIE-OSA-IEEE.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

EW-PESQ: A quality assessment method for speech signals sampled at 48 kHz

引用

AES: Journal of the Audio engineering Society 2010年第4期58卷 251-268页

作者： Bispo, Bruno C. Esquef, Paulo A.A. Biscainho, Luiz W.P. De Lima, Amaro A. Freeland, Fabio P. De Jesus, Rafael A. Said, Amir Lee, Bowon Schafer, Ronald W. Kalker, Ton Department of Electrical and Computer Engineering University of Porto Porto Portugal Coordination of Systems and Control National Laboratory for Scientific Computing LNCC/MCT Petrópolis RJ Brazil LPS-PEE/COPPE Federal University of Rio de Janeiro Rio de Janeiro RJ Brazil Nova Iguaçu RJ Brazil Rio de Janeiro RJ Brazil PETROBRAS/E and P Rio de Janeiro RJ Brazil Multimedia Communications and Networking Lab Hewlett-Packard Laboratories Palo Alto CA United States

Extended models of the W-PESQ method are presented which are capable of assessing the subjective quality of noisy speech signals sampled at 48 kHz. Two methods are proposed: a version backward compatible with the W-PESQ standard, called EW-PESQ(E), and another, called EW-PESQ(R), in which the original psychoacoustic models are entirely replaced with alternative formulations available in the literature. Performance figures of both the EW-PESQ(E) and the EW-PESQ(R) in predicting the subjective quality of extrawide-band speech (sampled at 48 kHz) corrupted with broad-band and environmental noise are reported. In both cases the results obtained reveal a strong correlation (approximately 97%) with mean opinion scores.

关键词： Speech communication

来源：评论

学校读者我要写书评

暂无评论

Efficient protection and grooming architectures for future optical networks

Efficient protection and grooming architectures for future o...

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Arun K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

Today networks are too cumbersome due to the incoherent integration of various technologies developed over time. Convergence of data, voice, and video has caused the retro-fitting of a network to support non-native traffic types and this has led to sub-par performance for every traffic type. Fundamental changes are warranted to support high bandwidth traffic. The network must guarantee end-to-end delivery and provide inherent protection within the physical structure. We propose that the main traffic types of today's applications should be carried using the following features: connection-oriented service, traffic grooming to fill those connection oriented pipes, and forward error recovery with protection provided in the physical layer. We present some of our research results.

关键词： Protection Optical fiber networks Telecommunication traffic Wavelength division multiplexing Optical packet switching WDM networks Bandwidth SONET Peer to peer computing Packet switching

来源：评论

学校读者我要写书评

暂无评论

Editorial: Dependability and security

引用

IEEE Transactions on dependable and Secure computing 2008年第1期5卷 1-3页

作者： Iyer, Ravishankar K. Gligor, Virgil D. Kalbarczyk, Zbigniew T. Kanoun, Karama Katzenbeisser, Stefan Mukherjee, Shubu Shieh, Shiuhpyng Zorian, Yervant Department of Electrical and Computer Engineering Carnegie Mellon University Microsoft's Trusted Computing Academic Advisory Board Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign United States IEEE IEEE Computer Society LAAS CNRS IFIP Working Group 10.4 on Dependable Computing and Fault Tolerance Special Interest Group on Dependability Benchmarking IFIP Working Group 10.4 French SEE Technical Committee on Trustworthy Computer Systems SEE Working Group Design and Validation for Dependability Technical University Munich Germany Darmstadt University of Technology ACM IACR Intel's SER Tech Council Intel's Architecture Patent Committee Taiwan Information Security Center NCTU IEEE Reliability Society Taipei and Tainan IACR United States Virage Logic Corp. AT and T Bell Laboratories Logic Vision Inc. University of British Columbia IEEE Test Technology Technical Council

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：