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

11th ACM International Conference on Underwater networks and Systems, WUWNet 2016

作者： Xie, Yan-Xin Liu, Jun Hu, Cheng-Quan Cui, Jun-Hong Xu, Hongli State Key Laboratory of Robotics CAS No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University Changchun China Underwater Sensor Network Lab. University of Connecticut StorrsCT06269 United States Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

ISBN: (纸本)9781450346375

The accuracy of the Autonomous Underwater Vehicles (AUVs) navigation system determines whether they can safely operate and return. Traditional Dead-reckoning (DR) relies on the inertial sensors such as gyroscope and accelerometer. A major challenge for DR navigation is from measurement error of the inertial sensors (gyroscope, accelerometer, etc.), especially when the AUV is near or at the ocean surface. The AUV's motion is affected by ocean waves, and its pitch angle changes rapidly with the waves. This rapid change and the measurement errors will cause great noise to the direction measured by gyroscopes, and then lead to a large error to the DR navigation. To address this problem, a novel DR method based on neural network (DR-N) is proposed to explore the time-varying relationship between acceleration measurement and orientation measurement, which leverages acoustic localization and neural network estimate timely pitch angle through the explored time-varying relationship. This method enables AUV's DR navigation with a single acceleration, without relying on both acceleration and gyroscope. Most importantly, we can improve the accuracy of AUV navigation through avoiding DR errors caused by gyroscope noise at the sea surface. Simulations show DR-N significantly improves navigation accuracy.

关键词： Accelerometers

来源：评论

学校读者我要写书评

暂无评论

A delay guaranteed and services differentiated MAC protocol based on location and reservation in near-space

引用

Journal of Convergence information Technology 2011年第2期6卷 120-130页

作者： Chen, Chen Gao, Xinbo Pei, Qingqi National Key Lab. of Integrated Service Networks Xidian Univ Xi'an 710071 China School of Electronic Engineering Xidian Univ Xi'an 710071 China Ministry of Edu. Key Lab. of Computer Network and Information Security Xidian Univ Xi'an 710071 China

With an ever-increasing interests and demands in Near-Space, more and more researchers have put their attentions on this field, leading to an emerging needs for modeling the 20-100km altitude space especially for broadband communications. Among the lots of works, Media Access Control (MAC) undoubtedly has chief importance and urgency with which communicating objects or nodes can effectively access to Near-Space. However, previous MAC designs mainly focus their attentions on service differentiation by application purposes without considering nodal mobility. In fact, access control for nodes with different mobility levels has significantly influences to MAC performance and is complex and difficult to be implemented together with present MAC protocols. In this paper, we first presented a location method for Near-Space vehicles such as airships and unmanned planes and then modeled the mobile networks infrastructure with mobility considered. For determining the vehicles joining/leaving events locally, we quantify the communication range with Received Signal Strength Indicator (RSSI) aid. Then, for better managing the nodes access to the Near-Space with aforementioned works, we designed a TDMA based reservation MAC protocol to guarantee the servicedelay and networks coverage with best efforts. Simulation results showed that our proposed model better fit for Near-Space mobile communication environments and presented a lower delay and higher coverage regarding to different mobility levels.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

Gradient sparsification for efficient wireless federated learning with differential privacy

引用

Science China(information Sciences) 2024年第4期67卷 272-288页

作者： Kang WEI Jun LI Chuan MA Ming DING Feng SHU Haitao ZHAO Wen CHEN Hongbo ZHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education Data61 Commonwealth Scientific and Industrial Research Organisation School of Information and Communication Engineering Hainan University School of Communications and Information Engineering Nanjing University of Posts and Telecommunications School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Federated learning(FL) enables distributed clients to collab.ratively train a machine learning model without sharing raw data with each other. However, it suffers from the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to the limited transmission bandwidth and model performance degradation while using differential privacy(DP)protection. In this paper, we propose a gradient sparsification empowered FL framework with DP over wireless channels, to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client's local model, thereby mitigating the performance degradation induced by DP and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client's DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real-life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin, and delay-minimization algorithms.

关键词： federated learning differential privacy gradient sparsification Lyapunov drift convergence analysis

来源：评论

学校读者我要写书评

暂无评论

Improvement on Ahn et al.'s RSA P-homomorphic signature scheme

Improvement on Ahn et al.'s RSA P-homomorphic signature sche...

引用

8th International ICST Conference on Security and Privacy in Communication networks, SecureComm 2012

作者： Wang, Zhiwei College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100190 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642368820

P-homomorphic signature is a general framework for computing on authenticated data, which is recently proposed by Ahn et al. With P-homomorphic signature, any third party can derive a signature on the object message m′ from a signature of m, if m′ and m satisfy P(m,m′) = 1 for some predicate P which denotes the authenticatable relationship between m′ and m. Ahn et al. proposed a RSA P-homomorphic signature scheme by using a RSA accumulator, which is very efficient in space. However, the computational cost of verification and derivation is very heavy. We present an improved P-homomorphic signature scheme based on factoring problem. In our construction, the time efficiency of both verification and derivation are much better than Ahn's scheme. © 2013 ICST Institute for computer Science, Social Informatics and Telecommunications Engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Graphic-based theory proof of compliance algorithm

引用

Jisuanji Gongcheng/computer Engineering 2006年第21期32卷 175-176页

作者： Rao, Yixuan Yang, Bo Key Lab. of Computer Network and Information Security Xi'an 710071 China

The paper puts forward a new proof of compliance algorithm in PolicyMaker, the algorithm applies graphic theory's DFS notion and the dynamic character, in the face of withdrawing the delegation, deletes the delegation side, then newly searches, finds other chain discovery until the end. It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.

关键词： Graphic Negative credential Trust management

来源：评论

学校读者我要写书评

暂无评论

A Lightening Fine-grained Access Control Scheme Supporting Full Policy Hiding in Cloud Storage 29

A Lightening Fine-grained Access Control Scheme Supporting F...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Shi, Jiaoli Hu, Chao Yao, Shimao Mei, Zhuolin Wu, Bin Li, Hui Jiujiang Univ. School of Computer and Big Data Jiujiang China Jiangxi Univ. of Finance and Economics School of Software IoT Engineering Nanchang China Jiujiang Key Lab. of Network and Information Security Jiujiang China Jiujiang University School of Computer and Big Data Jiujiang China Peking University School of Elec. and Comp. Engineering Shenzhen China

ISBN: (纸本)9798350330717

Efficiency, security, and flexibility are difficult to balance in a full policy hiding CP-ABE scheme. This paper creatively converts the privacy matching problem of access policy and a user's private key to the privacy three-party set computation problem. Then the new privacy set computation problem is resolved by a message driven key generation method. Additionally, the ROBDD (Reduced Ordered Binary Decision Diagrams) is utilized to rich access structure expression and convert access policies into feasible path sets. Each feasible path is composed of attributes and these attributes are bound to the ciphertext using CP-ABE. Based on the innovative ideas mentioned above, we present a Lighten Fine-grained Access Control scheme supporting Full Policy Hidden (LFAC-FPH) that integrates data confidentiality protection, access policy rich expression but complete hiding, fine-grained access control, and lightweight terminal computing. Our scheme has three advantages: 1) High Efficiency. The proposed scheme can achieve fast privacy matching of access policies during user decryption. 2) Full Policy Hiding. The access policy bound by an owner on the ciphertext does not leak any information. Moreover, a user cannot know attributes they do not own. 3) High Flexibility. The decryption process does not require online from owners or KGC, and system attributes can be added at any time. © 2023 IEEE.

关键词： CP-ABE full policy hiding lighten computation Private-Preserving

来源：评论

学校读者我要写书评

暂无评论

A Control Task Assignment Algorithm based on sub-graph isomorphism

A Control Task Assignment Algorithm based on sub-graph isomo...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Xixian Li Huimin Zhang Li-e Wang College of computer science Guangxi Normal University Guilin China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Guangxi Key Lab of Multi-source Information Mining & Security Guilin China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China

To enhance the controllab.lity and trustworthiness of the Internet, a new network control architecture has been presented with control task extracted to the intra-domain control node and executed in distributed multi-domain cooperative style. The study on control task assigning approach plays a central role in this network control pattern and shares some features with virtual network mapping problem. Different from the previous heuristics-based algorithms, we designs a baseline assigning algorithm which tests if the control task request can be mapped to a sub-graph of substrate control network or not without control task migration. Subsequently, an extend version is described under task migration considered. Our experiment evaluations show the impact of parameters on the runtime and assigning accuracy rate.

关键词： Cloud computing Backtracking Runtime Heuristic algorithms Process control Big Data Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Collosion detection research based on capsule bounding volume

引用

Journal of Computational information Systems 2014年第7期10卷 2743-2750页

作者： Kong, Dehan Liu, Yongshan Cui, Na Department of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China The Data Industry Research Lab. Qinhuangdao 066004 China

A collision detection algorithm based on capsule bounding volume (CBV for short) is presented improve the efficiency of Collision detection in three-dimensional scene. This algorithm use CBV to encircle roles and achieve collision detection between the virtual characters and static objects and dynamic objects in the scene. It includes collision detection between CBV and AABB, triangular and capsule. Theoretical analysis and experimental results show that this algorithm can improve real time for collision detection. © 2014 Binary information Press.

关键词： information systems

来源：评论

学校读者我要写书评

暂无评论

Secure Data Propagation in Edge-Cloud Orchestrated Computing Paradigms: Statistcs and Taxonomy

Secure Data Propagation in Edge-Cloud Orchestrated Computing...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Xixian Li Huimin Zhang Li-e Wang College of computer science Guangxi Normal University Guilin China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Guangxi Key Lab of Multi-source Information Mining &Security Guilin China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China

Despite the importance of the secure data propagation in the edge-cloud orchestrated computing paradigms, to the best of our knowledge, there is lack of systematic and comprehensive review on this research topic. The purpose of this article is to provide a systematic literature survey on secure data propagation in edge-cloud orchestrated computing environment to examine the current technical achievements published between 2010 and February 2020. The brief contributions of the paper are as follows: (1)providing a comprehensive literature review of the secure data propagation approaches in the edge-cloud orchestrated computing paradigms, (2) designing a methodology for document retrieval and selection, (3) presenting analysis and comparison for main technique methods of secure data propagation in hybrid edge-cloud environment.

关键词： Systematics Bibliographies Taxonomy Big Data

来源：评论

学校读者我要写书评

暂无评论

Random Access for a Cognitive Radio Transmitter with RF Energy Harvesting

Random Access for a Cognitive Radio Transmitter with RF Ener...

引用

IEEE Global Communications Conference

作者： Yue Lu Wei Wang Zhaoyang Zhang Aiping Huang Vincent K. N. Lau Dept. of Information Science and Electronic Engineering Zhejiang Key Lab. of Information Network Technology Zhejiang University Dept. of Electronic and Computer Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781479935130

In this paper, we investigate the random access for an energy harvesting secondary user (SU) in a cognitive radio system, in which the SU harvests energy from radio frequency (RF) radiation of the primary user (PU). With multipacket reception channel model, the SU can increase its throughput through not only utilizing the idle periods of the PU, but also opportunistically sharing the PU spectrum with some probability when the PU is active. By choosing the appropriate random access probability, we maximize the throughput of the SU under the constraint of the primary queue stability. We also define the energy-limited region and spectrum-limited region to specify the tradeoff between the SU performance and the PU activity. Furthermore, we investigate the effect of the primary queueing delay constraint on the throughput performance of the SU.

关键词： cognitive radio energy harvesting probability queueing theory radio spectrum management radio transmitters radiowave propagation wireless channels RF energy harvesting SU performance cognitive radio transmitter energy limited region multipacket reception channel model opportunistic PU spectrum sharing primary queue stability primary queueing delay constraint primary user radio frequency radiation random access random access probability secondary user spectrum limited region throughput performance Approximation methods Cognitive radio Energy harvesting Queueing analysis Radio frequency Stability analysis Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：