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

Catalyzing Random Access at Physical Layer for Internet of Things:An Intelligence Enabled User Signature Code Acquisition Approach

引用

China Communications 2021年第10期18卷 181-192页

作者： Xiaojie Fang Xinyu Yin Xuejun Sha Jinghui Qiu Hongli Zhang School of Electronic and Information Engineering Harbin Institute of TechnologyHarbin 1500001China Science and Technology on Communication Networks Laboratory Shijiazhuang 050050China School of Computer Science and Technology Harbin Institute of TechnologyHarbin 150001China

Exploiting random access for the underlying connectivity provisioning has great potential to incorporate massive machine-type communication(MTC)devices in an Internet of Things(Io T)***,massive access attempts from versatile MTC devices may bring congestion to the IIo T network,thereby hindering service increasing of IIo T *** this paper,an intelligence enabled physical(PHY-)layer user signature code acquisition(USCA)algorithm is proposed to overcome the random access congestion problem with reduced signaling and control *** the proposed scheme,the detector aims at approximating the optimal observation on both active user detection and user data reception by iteratively learning and predicting the convergence of the user signature codes that are in *** crossentropy based low-complexity iterative updating rule is present to guarantee that the proposed USCA algorithm is computational feasible.A closed-form bit error rate(BER)performance analysis is carried out to show the efficiency of the proposed intelligence USCA *** results confirm that the proposed USCA algorithm provides an inherent tradeoff between performance and complexity and allows the detector achieves an approximate optimal performance with a reasonable computational complexity.

关键词： Internet of Things(IoT) artificial intelligence physical layer cross-entropy random access

来源：评论

学校读者我要写书评

暂无评论

Data Collection and Trajectory Planning for Energy-constrained UAV Swarm:A Q-Learning Based Approach

Data Collection and Trajectory Planning for Energy-constrain...

引用

第42届中国控制会议

作者： Yuan Gao Heng Zhang Jianwei Sun Xin Wang Ming Yang Xueli Wang Shandong Provincial Key Laboratory of Computer Networks Shandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences) School of Computer Engineering Jiangsu Ocean University School of Electronic Engineering Jiangsu Ocean University

This paper studies the energy-constrained path planning of multiple unmanned aerial vehicles(UAVs) based on the data collection of ground sensors in large-scale farms to achieve crop data *** reduce the energy consumption of the UAV swarm and improve the task completion rate,when all nodes are connected,the relay UAV is dynamically allocated according to the location information of the UAV *** relay UAV collects all data and flies to the base station for data *** to this scenario,a multi-UAV trajectory optimization problem including task time,energy consumption and node access constraints is ***,an optimization algorithm for UAV swarm trajectory design is *** algorithm is based on Q-learning and takes the changes in the distance between the UAV and the node,the UAV's flight angle,and the safe distance as the reward *** Q table is updated according to the awards to guide the flight route of the *** analysis shows that the proposed algorithm can effectively improve the completion rate of data collection tasks and reduce the overall energy consumption of the UAV swarm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Realization and Performance Tests of a Dual-Polarization Fiber Optic Gyroscope 8

Realization and Performance Tests of a Dual-Polarization Fib...

引用

8th Symposium on Novel Photoelectronic Detection Technology and Applications

作者： Zhou, Tong Zhu, Lanxin Cao, Yuwen Chen, Yanjun Huang, Huimin Li, Zhengbin School of Software and Microelectronics Peking University Beijing102600 China State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University Beijing100871 China

ISBN: (数字)9781510653122

ISBN: (纸本)9781510653115

Interferometric fiber optical gyroscopes (IFOGs) have become one of the widely used sensors of inertial technology and rotational seismology, owing to their high precision and stability. In recent years, the dual-polarization IFOG, which allows two orthogonal polarization to work simultaneously, has been proved to achieve better measurement performance than the conventional minimum configuration through mutual compensation. In this work, a prototype of dual-polarization fiber-optic gyroscope is designed and realized. laboratory tests show the self-noise has reached 9 nrad/s/sqrt(Hz) over the frequency from 0.01 to 125 Hz and the angular random walk has achieved 2.6×10-5 deg/sqrt(hr). For an Open-loop IFOG, which does not need a confiscated feedback control system, it avoids the dead-zone of closed-loop IFOG. However, limited by the measurement range, as a result of the periodic and nonlinear response of open-loop demodulation, the scale factor of open-loop IFOG varies around 100~1000 parts per million (ppm) conventionally, which hinders its detection accuracy. In this work, with new measurement extension and linearity compensation methods, the prototype achieves an outstanding precision with scale factor nonlinearity up to 5 ppm within ±10 deg/s, and shows the potential of dual-polarization IFOGs for rotational seismology. © 2022 SPIE

关键词： Seismology

来源：评论

学校读者我要写书评

暂无评论

Neighbor Load Rank Based Load Balancing Routing in LEO Satellite networks

Neighbor Load Rank Based Load Balancing Routing in LEO Satel...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Xueyu Lu Wenting Wei Kun Wang Liying Fu Chenxi Li Celimuge Wu State Key Laboratory of Integrated Service Networks Xidian University Xi’an China National Key Laboratory of Advanced Communication Networks Shijiazhuang China School of Computer Science and Technology Xidian University Xi’an China Graduate School of Informatics and Engineering University of Electro-Communications Tokyo Japan

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

The emerging space-terrestrial integrated networks (STIN) are envisioned to provide seamless connectivity for global coverage. As a promising key component for STIN, the Low Earth Orbiting (LEO) satellite network still faces significant technological challenges in routing for ensuring both reachability and efficiency, due to frequent topology changes and uneven load distribution. Load-balancing routing is a feasible solution to improve efficiency by alleviating regional overload, however, it may encounter either slow convergences or local perceptions. In this paper, we propose a Neighbor Load Rank (NLR) based load-balancing routing for LEO satellite networks, where potential congestion at the queue buffer of a satellite node is characterized by load scores of its neighboring satellites, so as to reduce the perspective limitation of local load-balancing routing. To accelerate routing convergence and reduce computational complexity, we design region delineation, boundary penalty and directional incentive strategies to obtain the approximate minimum hop count path. Meanwhile, we employ the topology-stabilizing model (TSM) to convert the frequent satellite-ground interconnection changes into traffic fluctuations. Simulations demonstrate that NLR can maintain low-latency capacity with lower transmission overhead and effectively balance the overloaded traffic.

关键词： Satellites Network topology Computational modeling Simulation Low earth orbit satellites Routing Load management Topology Load modeling Propagation delay

来源：评论

学校读者我要写书评

暂无评论

Class-specific image encryption using a diffractive optical processor

Class-specific image encryption using a diffractive optical ...

引用

CLEO: Fundamental Science, CLEO:FS 2024 - Part of Conference on Lasers and Electro-Optics, CLEO 2024

作者： Bai, Bijie Wei, Heming Yang, Xilin Gan, Tianyi Mengu, Deniz Jarrahi, Mona Ozcan, Aydogan Electrical and Computer Engineering Department University of California Los AngelesCA90095 United States Bioengineering Department University of California Los Angeles90095 United States Key Laboratory of Specialty Fiber Optics and Optical Access Networks Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication Shanghai University Shanghai200444 China University of California Los AngelesCA United States

We present a framework for all-optical image encryption that is class-specific, performing a distinct image transformation function for each data class. Experimental validation of this method was conducted using both ... 详细信息

ISBN: (纸本)9781957171395

关键词： Optical depth

来源：评论

学校读者我要写书评

暂无评论

PathReasoner: Modeling Reasoning Path with Equivalent Extension for Logical Question Answering

arXiv

引用

arXiv 2024年

作者： Xu, Fangzhi Lin, Qika Zhao, Tianzhe Han, Jiawei Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China

Logical reasoning task has attracted great interest since it was proposed. Faced with such a task, current competitive models, even large language models (e.g., ChatGPT and PaLM 2), still perform badly. Previous promising LMs struggle in logical consistency modeling and logical structure perception. To this end, we model the logical reasoning task by transforming each logical sample into reasoning paths and propose an architecture PathReasoner. It addresses the task from the views of both data and model. To expand the diversity of the logical samples, we propose an atom extension strategy supported by equivalent logical formulas, to form new reasoning paths. From the model perspective, we design a stack of transformer-style blocks. In particular, we propose a path-attention module to joint model in-atom and cross-atom relations with the high-order diffusion strategy. Experiments show that PathReasoner achieves competitive performances on two logical reasoning benchmarks and great generalization abilities. © 2024, CC BY.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Coalition game-based clustering algorithm for LEO satellite networks

Coalition game-based clustering algorithm for LEO satellite ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Peixin Zhang Wenting Wei Kun Wang Lizhe Liu Liang Qin Celimuge Wu State Key Laboratory of Integrated Service Networks Xidian University Xi’an China National Key Laboratory of Advanced Communication Networks Shijiazhuang China School of Computer Science and Technology Xidian University Xian China Graduate School of Informatics and Engineering University of Electro-Communications Tokyo Japan

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Low Earth Orbit (LEO) satellites are gradually developing towards to a large scale, in order to achieve a desired vision of ubiquitous connectivity and broadband access at anytime and anywhere. However, the increasing scale and highly dynamic nature of LEO constellation pose challenges to network management on its flexibility and scalability. Clustering is introduced as an effective approach to manage LEO satellite networks in a flexible manner. Unfortunately, satellite clusters encounter instability and high communication load due to frequent topology changes and traffic growth. In this paper, we design LEO satellites clustering models that jointly optimize cluster reliability and network communication load in the GEO/LEO network architecture. The coalition game framework is introduced to obtain a stable cluster structure by adopting an automated and centralized approach. A coalition formation algorithm based on the optimization of reliability and communication load is developed for the clustering problem. Finally, numerical simulations are carried out to evaluate the superiority and effectiveness of the proposed grouping and clustering scheme.

关键词： Satellites Heuristic algorithms Low earth orbit satellites Clustering algorithms Games Reliability engineering Throughput Topology Delays Optimization

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Proximal Policy Optimization Empowered Adaptive Task Scheduling Leveraging Cloud-Edge Collaboration for Consumer Electronics

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Li, Peisong Yi, Meng Iqbal, Muddesar Wang, Xinheng Xiao, Ziren Xi'an Jiaotong-Liverpool University School of Advanced Technology Suzhou215123 China Southeast University School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing211189 China Prince Sultan University Renewable Energy Laboratory Communications and Networks Engineering Department College of Engineering Riyadh11586 Saudi Arabia CIP Technology ltd United Kingdom

The rapid advancement of IoT, AI, and edge computing has led to a significant increase in consumer devices and computation tasks, with new electronics incorporating these technologies to enhance services like VR/AR and autonomous driving, requiring real-time processing for safety and efficiency. However, recent research has focused on optimizing IoT task scheduling and resource allocation through various methods, yet overlooks the dynamic nature of IoT environments, fails to adapt to changing device counts and movements, and often ignores task completion rate in favor of minimizing latency and energy cost. In this context, an adaptive task scheduling and resource allocation strategy is proposed for Edge IoT systems, based on the designed Graph-based Proximal Policy Optimization (GPPO) algorithm. Firstly, the GPPO algorithm enhances PPO for adaptive task scheduling in the fluctuating MEC scenarios, adjusting for the varying number of nearby edge servers. Secondly, it accounts for consumer mobility by opting for local task execution if the consumer risks moving outside the edge server's range, ensuring result reception. Thirdly, it prioritizes task completion rate to increase the number of tasks finished within their acceptable duration. Experimental results demonstrated that the proposed method outperforms traditional methods. © 1975-2011 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

JAX-CNV:A Whole-genome Sequencing-based Algorithm for Copy Number Detection at Clinical Grade Level

引用

Genomics, Proteomics & Bioinformatics 2022年第6期20卷 1197-1206页

作者： Wan-Ping Lee Qihui Zhu Xiaofei Yang Silvia Liu Eliza Cerveira Mallory Ryan Adam Mil-Homens Lauren Bellfy Kai Ye Charles Lee Chengsheng Zhang Precision Medicine Center The First Affiliated Hospital of Xi’an Jiaotong UniversityXi’an 710061China The Jackson Laboratory for Genomic Medicine FarmingtonCT 06032USA School of Cyber Science and Engineering Xi’an Jiaotong UniversityXi’an 710049China Department of Pathology and Laboratory Medicine Perelman School of MedicineUniversity of PennsylvaniaPhiladelphiaPA 19104USA School of Computer Science and Technology Faculty of Electronic and Information EngineeringXi’an Jiaotong UniversityXi’an 710049China MOE Key Lab for Intelligent Networks&Networks Security Faculty of Electronic and Information EngineeringXi’an Jiaotong UniversityXi’an 710049China Department of Life Sciences Ewha Womans UniversitySeoul 03760South Korea

We aimed to develop a whole-genome sequencing(WGS)-based copy number variant(CNV)calling algorithm with the potential of replacing chromosomal microarray assay(CMA)for clinical ***-CNV is thus developed for CNV detection from WGS *** performance of this CNV calling algorithm was evaluated in a blinded manner on 31 samples and compared to the 112 CNVs reported by clinically validated CMAs for these 31 *** result showed that JAX-CNV recalled 100%of these ***,JAX-CNV identified an average of 30 CNVs per individual,representing an approximately seven-fold increase compared to calls of clinically validated *** validation of 24 randomly selected CNVs showed one false positive,i.e.,a false discovery rate(FDR)of 4.17%.A robustness test on lowercoverage data revealed a 100%sensitivity for CNVs larger than 300 kb(the current threshold for College of American Pathologists)down to 10×*** CNVs larger than 50 kb,sensitivities were 100%for coverages deeper than 20×,97%for 15×,and 95%for 10×.We developed a WGS-based CNV pipeline,including this newly developed CNV caller JAX-CNV,and found it capable of detecting CMA-reported CNVs at a sensitivity of 100%with about a FDR of 4%.We propose that JAX-CNV could be further examined in a multi-institutional study to justify the transition of first-tier genetic testing from CMAs to ***-CNV is available at https://***/TheJacksonlaboratory/JAX-CNV.

关键词： Copy number variant Chromosomal microarray assay Whole-genome sequencing JAX-CNV Genetic testing

来源：评论

学校读者我要写书评

暂无评论

Towards Evidence-Based Cybersecurity Assessment of Programmable Systems to Ensure the Protection of Critical IT Infrastructure 12

Towards Evidence-Based Cybersecurity Assessment of Programma...

引用

12th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2023

作者： Illiashenko, Oleg Kharchenko, Vyacheslav Odarushchenko, Oleg National Aerospace University 'KhAI' Department of Computer Systems and Networks Kharkiv61070 Ukraine Institute of Information Science and Technologies 'Alessandro Faedo' - Isti Cnr Software Engineering & Dependable Computing Laboratory Pisa56124 Italy Research and Production Enterprise Rpc Radics Llc Kropyvnytskyi25009 Ukraine

ISBN: (纸本)9798350358056

The paper is devoted to developing scientific principles, methods, means, and information technology of model-oriented verification and evidence-based assessment using functional safety and cybersecurity cases for programmable systems of critical applications (PSCA). In particular, information and control systems important for the safety of nuclear power plants (NPPs), aerospace systems, railway domains, etc., developed using Field Programmable Gate Arrays (FPGAs) and hardware platforms are reviewed. The goal is to ensure the guaranteed completeness and reliability of its functional safety and cybersecurity assessment by developing and implementing a set of formal and semi-formal methods and tools that consider defects of different nature - physical, design, trojans, and vulnerabilities that can be attacked and lead to a fatal system failure, which results in damaging the critical IT infrastructure. The methods shown are based on integrating algebraic, tabular, graph models, and case assessment methodology. The methods are implemented as appropriate technologies for evidence-based verification and evaluation of PSCA. For formal methods, a prototype of a translator of Very High-Speed Integrated Circuits Hardware Description Language (VHDL) code is developed into an algebra of behaviors. It provides evidence-based verification and a framework and tools to design reports on assessing the cybersecurity and functional safety of programmable systems. © 2023 IEEE.

关键词： critical IT infrastructure cybersecurity FPGA functional safety programmable systems of critical applications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：