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

第九届中国卫星导航学术年会

作者： Huijun Dai Jie Dong Xiaolin Gui Min Zhu Zhaosheng Dai School of Electronics and Communication Engineering Xi'an Jiaotong University Shaanxi Key lab of Computer Networks Xi'an Jiaotong University

The trade-off among individual privacy, data utility and data feature of service has been a great concern when designing and evaluating privacy preserving schemes in trajectories publishing. The trajectories data is spatial and temporal correlated strongly. So, Privacy-preserving over them should take the human behaviors and their status into account. In this paper, we develop a novel method to investigate and analyze users' behaviors as well as the crowd density after abstracting users' ROIs. Finally, we evaluate the privacy stress via a well-designed indictor combing the trajectories visualization and analyzation. Experiments show that the method is capable of effectively finding both crowd living patterns and distribution, and the proposed indictor can quantize the mobility data utility precisely in grid.

关键词： Trajectory privacy preserving privacy evaluation ROI POI crowd density matrix heat map

来源：评论

学校读者我要写书评

暂无评论

Targeted Attack for Deep Hashing Based Retrieval 16th

Targeted Attack for Deep Hashing Based Retrieval

引用

16th European Conference on computer Vision, ECCV 2020

作者： Bai, Jiawang Chen, Bin Li, Yiming Wu, Dongxian Guo, Weiwei Xia, Shu-Tao Yang, En-Hui Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen China Peng Cheng Laboratory PCL Research Center of Networks and Communications Shenzhen China vivo AI Lab Shenzhen China Department of Electrical and Computer Engineering University of Waterloo Waterloo Canada

ISBN: (纸本)9783030584511

The deep hashing based retrieval method is widely adopted in large-scale image and video retrieval. However, there is little investigation on its security. In this paper, we propose a novel method, dubbed deep hashing targeted attack (DHTA), to study the targeted attack on such retrieval. Specifically, we first formulate the targeted attack as a point-to-set optimization, which minimizes the average distance between the hash code of an adversarial example and those of a set of objects with the target label. Then we design a novel component-voting scheme to obtain an anchor code as the representative of the set of hash codes of objects with the target label, whose optimality guarantee is also theoretically derived. To balance the performance and perceptibility, we propose to minimize the Hamming distance between the hash code of the adversarial example and the anchor code under the (Formula Presented) restriction on the perturbation. Extensive experiments verify that DHTA is effective in attacking both deep hashing based image retrieval and video retrieval. © 2020, Springer Nature Switzerland AG.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

The power consumption of Bluetooth scatternets

The power consumption of Bluetooth scatternets

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： L. Negri J. Beutel M. Dyer Department of Electrical Eng. and Computer Science Politecnico di Milano Milano Italy Computer Engineering and Networks Lab ETH Zurich Zurich Switzerland

来源：评论

学校读者我要写书评

暂无评论

Integration of unicast and multicast scheduling with low complexity

引用

Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University 2013年第4期40卷 42-47页

作者： Jiang, Yongbo Yang, Chun Gao, Ya Qiu, Zhiliang State Key Lab. of Integrated Service Networks Xidian Univ. Xi'an 710071 China School of Electronic Engineering and Computer Science Peking Univ. Beijing 100871 China

This study focuses on the scalability problems for very large, high-speed switches, and presents a two-stage integrated scheduling algorithm named UMCSA (Unicast and Multicast Concurrent Scheduling Algorithm) which supports both unicast and multicast traffic simultaneously. The first stage of the switching fabric performs switching for unicast traffic and load-balancing for multicast traffic, while the second stage performs switching for load-balanced multicast traffic. With a two-phase (request-grant) scheme, the proposed algorithm performs without iteration, and at the same time reduces the scheduling overhead to O(logN) significantly. By using the VOQ (Virtual Output Queuing) technique for unicast and multicast traffic separately at different stages, the HoL (Head-of-Line) blocking is eliminated and therefore a good throughput performance could be achieved. UMCSA performs scheduling for unicast and multicast traffic in parallel at different stages with simple Round-Robin arbitration, which is more suitable for high-speed applications. Simulation results show that the proposed integrated algorithm exhibits a good performance in terms of throughput and average delay, at different traffic compositions under various traffic patterns.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning-Based State Estimation for Automated Lane-Changing 27

Learning-Based State Estimation for Automated Lane-Changing

引用

27th IEEE International Conference on Intelligent Transportation Systems, ITSC 2024

作者： Ha, Won Yong Chakraborty, Sayan Lin, Xiaoyi Ozbay, Kaan Jiang, Zhong-Ping New York University Control and Networks Lab Department of Electrical and Computer Engineering 370 Jay Street BrooklynNY11201 United States C2SMARTER Center New York University Department of Civil and Urban Engineering 6 MetroTech Center BrooklynNY11201 United States

ISBN: (纸本)9798331505929

This paper introduces a learning-based optimal control strategy enhanced with nonmodel-based state estimation to manage the complexities of lane-changing maneuvers in autonomous vehicles. Traditional approaches often depend on comprehensive system state information, which may not always be accessible or accurate due to dynamic traffic environments and sensor limitations. Our methodology dynamically adapts to these uncertainties and sensor noise by iteratively refining its control policy based on real-time sensor data and reconstructed states. We implemented an experimental setup featuring a scaled vehicle equipped with GPS, IMUs, and cameras, all processed through an Nvidia Jetson AGX Xavier board. This approach is pivotal as it addresses the limitations of simulations, which often fail to capture the complexity of dynamic real-world conditions. The results from real-world experiments demon-strate that our learning-based control system achieves smoother and more consistent lane-changing behavior compared to traditional direct measurement approaches. This paper underscores the effectiveness of integrating Adaptive Dynamic Program-ming (ADP) with state estimation techniques, as demonstrated through small-scale experiments. These experiments are crucial as they provide a practical validation platform that simulates real-world complexities, representing a significant advancement in the control systems used for autonomous driving. © 2024 IEEE.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

Learning-Based Adaptive Optimal Control of Linear Time-Delay Systems: A Policy Iteration Approach

arXiv

引用

arXiv 2022年

作者： Cui, Leilei Pang, Bo Jiang, Zhong-Ping The Control and Networks Lab Department of Electrical and Computer Engineering Tandon School of Engineering New York University BrooklynNY11201 United States

This paper studies the adaptive optimal control problem for a class of linear time-delay systems described by delay differential equations (DDEs). A crucial strategy is to take advantage of recent developments in reinforcement learning and adaptive dynamic programming and develop novel methods to learn adaptive optimal controllers from finite samples of input and state data. In this paper, the data-driven policy iteration (PI) is proposed to solve the infinite-dimensional algebraic Riccati equation (ARE) iteratively in the absence of exact model knowledge. Interestingly, the proposed recursive PI algorithm is new in the present context of continuous-time time-delay systems, even when the model knowledge is assumed known. The efficacy of the proposed learning-based control methods is validated by means of practical applications arising from metal cutting and autonomous driving. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Linear formulation for the design of elastic optical networks with squeezing protection and shared risk link group: Invited Paper 22

Linear formulation for the design of elastic optical network...

引用

22nd International Conference on Transparent Optical networks, ICTON 2020

作者： Assis, K.D.R. Almeida, Jr. Waldman, H. Reed, M.J. Jaumard, B. Simeonidou, D. Universidade Federal da Bahia UFBA Electrical Engineering Department Brazil Universidade Federal de Pernambuco UFPE Electronic Engineering Department Brazil Universidade Estadual de Campinas UNICAMP Communications Department Brazil School of Computer Science and Electronic Engineering University of Essex United Kingdom Concordia University Computer Science and Software Engineering Department CA United States High Performance Networks Group and Smart Internet Lab University of Bristol United Kingdom

ISBN: (纸本)9781728184234

Survivability is an important component in the requirements in elastic optical networks (EONs). We examine here the significance of network survivability design against multiple-link failures under dedicated protection, shared risk link group (SRLG) and bandwidth squeezing schemes. The proposed mixed integer linear programming (MILP) formulation seeks to derive some different types of protection considering routing, spectrum assignment, grooming, modulation format as well as shared risk link group constraints. The proposed MILP provides efficient survivability results and resource savings (in terms of spectrum) for a full design of modern EONs. © 2020 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Parallel coprocessor architectures for molecular dynamics simulation: a case study in design space exploration

Parallel coprocessor architectures for molecular dynamics si...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M. Gerber T. Gossi Computer Engineering and Networks Lab Swiss Federal Institute of Technology Zurich Switzerland Electronics Lab Swiss Federal Institute of Technology Zurich Switzerland

The purpose of the paper is to describe a new semi-automated design space exploration method based on genetic programming. A new control/dataflow specification method is proposed as well as appropriate models for hardware parts and algorithms. With this method we are able to test many different hardware architectures and algorithms against cost, speed, computation time and other constraints within a very short time. The remaining manual work is to exploit the model parameters of the components of the architecture and the algorithm. In contrast to other approaches our method is suited for embedded and distributed systems. The method, models and application are explained in detail by means of a comprehensive case study.

关键词： Coprocessors computer aided software engineering Hardware computer architecture Computational modeling Intelligent networks Space technology Space exploration Acceleration Pipelines

来源：评论

学校读者我要写书评

暂无评论

Hybrid Deep Learning based Attack Detection and Classification Model on IoT Environment 5

Hybrid Deep Learning based Attack Detection and Classificati...

引用

5th IEEE International Conference on Electrical, computer and Communication Technologies, ICECCT 2023

作者： Lal, Jaya Dipti Ayoub, Shahnawaz Hakim, Prashant D. Prabagar, S. Dwivedi, Vijay Kumar Tiwari, Mohit Shri G S Institute of Technology and Science Department of Electronics and Communication Engineering Madhya Pradesh Indore India Shri Venkateshwara University Department of Computer Science Uttar PradeshGujrala Amroha India Thakur College of Science and Commerce Department of Information Technology Maharashtra Mumbai India School of Computer Science and Engineering & Information Science Presidency University Networks and IoT Lab Department of Information Science Engineering Karnataka Bengaluru India Vishwavidyalaya Engineering College Department of Mathematics Chhattisgarh Ambikapur India Bharati Vidyapeeth's College of Engineering Department of Computer Science and Engineering Delhi India

ISBN: (纸本)9781665493604

The Internet of Things (IoT) is becoming an active research area because of its largescale challenges and implementation. But security is the major concern while seeing the dramatic expansion in its applications and size. It is challenging to independently put security mechanism in all the IoT devices and upgrade it according to newer threats. Furthermore, machine learning (ML) techniques could better apply the massive quantity of data produced by IoT devices. Thus, several Deep Learning (DL) based algorithms were introduced for detecting attacks in IoT. Therefore, this study develops a galactic swarm optimization with Deep Learning based Attack Detection and Classification (GSODL-ADC) Model in IoT Environment. The presented GSODL-ADC technique concentrates on the identification of attacks in the IoT environment. The presented GSODL-ADC technique utilizes deep autoencoder (DAE) as a classifier model which properly recognizes the attacks in the IoT environment. Followed by this, the GSO approach is utilized for the optimum hyperparameter adjustments of the DAE model, which leads to enhanced attack detection efficacy. The experimental evaluation of the GSODL-ADC algorithm is tested against benchmark dataset. The obtained experimental values signify the betterment of the GSODL-ADC technique for attack recognition purposes. © 2023 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Democratic Group Signatures with Threshold Traceability

引用

Journal of Shanghai Jiaotong university(Science) 2009年第1期14卷 98-101页

作者：李祥学钱海峰李建华 School of Information Security Engineering Shanghai Jiaotong UniversityShanghai 200240China State Key Lab of Information Security Graduate School of Chinese Academy of SciencesBeijing 100039China State Key Laboratory of Integrated Service Networks Xidian UniversityXi'an 710071China Computer Science and Technology Department East China Normal UniversityShanghai 200241China

This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such that any subset with more than t members can jointly reconstruct a secret and reveal the identity of the signer. Any active adversary cannot do this even if he can corrupt up to t - 1 group members.

关键词： democratic group signature （DGS） anonymity traceability threshold traceability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：