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

arXiv 2020年

作者： Lu, Huabing Xie, Xianzhong Shi, Zhaoyuan Lei, Hongjiang Yang, Helin Cai, Jun The Key Laboratory of Intelligent Control and Optimization for Industrial Equipment Ministry of Education Dalian University of Technology Dalian116024 China The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University Anqing246011 China The School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China The Department of Information and Communication Engineering School of Informatics Xiamen University Xiamen361005 China Department of Electrical and Computer Engineering Concordia University MontrealQCH3G 1M8 Canada

Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission has recently received significant research attention due to its outstanding ability of serving grant-free (GF) users with grant-based (GB) users' spectrum, which greatly improves the spectrum efficiency and effectively relieves the massive access problem of 5G and beyond networks. In this paper, we first study the outage performance of the greedy best user scheduling SGF scheme (BU-SGF) by considering the impacts of Rayleigh fading, path loss, and random user locations. In order to tackle the admission fairness problem of the BU-SGF scheme, we propose a fair SGF scheme by applying cumulative distribution function (CDF)-based scheduling (CS-SGF), in which the GF user with the best channel relative to its own statistics will be admitted. Moreover, by employing the theories of order statistics and stochastic geometry, the outage performances of both BU-SGF and CS-SGF schemes are analyzed. Theoretical results show that both schemes can achieve full diversity orders only when the served users' data rate is capped, which severely limits the rate performance of SGF schemes. To further address this issue, we propose a distributed power control strategy to relax such data rate constraint, and derive analytical expressions of the two schemes' outage performances under this strategy. Finally, simulation results validate the fairness performance of the proposed CS-SGF scheme, the effectiveness of the power control strategy, and the accuracy of the theoretical analyses. Copyright © 2020, The Authors. All rights reserved.

关键词： Spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

Ai driven heterogeneous MEC system for dynamic environment - Challenges and solutions

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Xu, Wei Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom NCRL Southeast University Nanjing China School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

—By taking full advantage of computing, Communication and Caching (3C) resources at the network edge, Mobile Edge computing (MEC) is envisioned as one of the key enablers for the next generation network and services. However, current fixed-location MEC architecture may not be able to make real-time decision in dynamic environment, especially in large-scale scenarios. To address this issue, in this paper, a Heterogeneous MEC (H-MEC) architecture is proposed, which is composed of fixed unit, i.e., Ground Stations (GSs) as well as moving nodes, i.e., Ground Vehicles (GVs) and Unmanned Aerial Vehicles (UAVs), all with 3C resource enabled. The key challenges in H-MEC, e.g., mobile edge node management, real-time decision making, user association and resource allocation along with the possible Artificial Intelligence (AI)-based solutions are discussed in this paper. In addition, an AI-based joint Resource schEduling (ARE) framework is proposed, with simulation results shown to verify the efficiency of our proposed framework. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantum neural networks with data re-uploading for urban traffic time series forecasting

引用

Scientific reports 2025年第1期15卷 19400页

作者： Nikolaos Schetakis Paolo Bonfini Negin Alisoltani Konstantinos Blazakis Symeon I Tsintzos Alexis Askitopoulos Davit Aghamalyan Panagiotis Fafoutellis Eleni I Vlahogianni Computational Mechanics and Optimization Laboratory School of Production Engineering and Management Technical University of Crete Chania 73100 Greece. nischetakis@tuc.gr. Quantum Innovation Pc Chania 73100 Greece. nischetakis@tuc.gr. Alma-Sistemi Srl Guidonia 00012 Italy. Univ Gustave Eiffel COSYS GRETTIA Paris F-77454 France. Department of Electrical and Computer Engineering Hellenic Mediterranean University Heraklion 71410 Greece. QUBITECH Pc Athens 15231 Greece. Institute of High Performance Computing A*STAR (Agency for Science Technology and Research) 1 Fusionopolis Way #16-16 Connexis Singapore 138632 Singapore. Department of Transportation Planning and Engineering School of Civil Engineering National Technical University of Athens 5 Iroon Polytechniou Str Zografou Campus 157 73 Athens Greece.

Accurate traffic forecasting plays a crucial role in modern Intelligent Transportation Systems (ITS), as it enables real-time traffic flow management, reduces congestion, and improves the overall efficiency of urban transportation networks. With the rise of Quantum Machine Learning (QML), it has emerged a new paradigm possessing the potential to enhance predictive capabilities beyond what classical machine learning models can achieve. In the present work we pursue a heuristic approach to explore the potential of QML, and focus on a specific transport issue. In particular, as a case study we investigate a traffic forecast task for a major urban area in Athens (Greece), for which we possess high-resolution data. In this endeavor we explore the application of Quantum Neural Networks (QNN), and, notably, we present the first application of quantum data re-uploading in the context of transport forecasting. This technique allows quantum models to better capture complex patterns, such as traffic dynamics, by repeatedly encoding classical data into a quantum state. Aside from providing a prediction model, we spend considerable effort in comparing the performance of our hybrid quantum-classical neural networks with classical deep learning approaches. We observe that, in fully connected network settings, hybrid quantum-classical models consistently underperform, with median scores approximately 10% worse than their purely classical counterparts across different configurations. In contrast, recursive architectures with data re-uploading show the opposite trend: hybrid models achieved up to 5% better median scores under comparable complexity settings. Additionally, these hybrid models converged in fewer training epochs, indicating improved training efficiency. Our results show that hybrid models achieve competitive accuracy with state-of-the-art classical methods, especially when the number of qubits and re-uploading blocks is increased. While the classical models demonstrate l

关键词：

来源：评论

学校读者我要写书评

暂无评论

Perspectives on adaptive dynamical systems

arXiv

引用

arXiv 2023年

作者： Sawicki, Jakub Berner, Rico Loos, Sarah A.M. Anvari, Mehrnaz Bader, Rolf Barfuss, Wolfram Botta, Nicola Brede, Nuria Franović, Igor Gauthier, Daniel J. Goldt, Sebastian Hajizadeh, Aida Hövel, Philipp Karin, Omer Lorenz-Spreen, Philipp Miehl, Christoph Mölter, Jan Olmi, Simona Schöll, Eckehard Seif, Alireza Tass, Peter A. Volpe, Giovanni Yanchuk, Serhiy Kurths, Jürgen Potsdam Institute for Climate Impact Research Telegrafenberg Potsdam14473 Germany Fachhochschule Nordwestschweiz FHNW Leonhardsstrasse 6 Basel4009 Switzerland Department of Physics Humboldt-Universität zu Berlin Newtonstraße 15 Berlin12489 Germany DAMTP University of Cambridge Wilberforce Road CambridgeCB3 0WA United Kingdom Fraunhofer Institute for Algorithms and Scientific Computing Schloss Birlinghoven Sankt-Augustin53757 Germany Institute of Systematic Musicology University of Hamburg Germany Transdisciplinary Research Area: Sustainable Futures University of Bonn Bonn53113 Germany University of Bonn Bonn53113 Germany Department of Computer Science and Engineering Chalmers University of Technology Göteborg412 96 Sweden Department of Computer Science University of Potsdam An der Bahn 2 Potsdam14476 Germany Scientific Computing Laboratory Center for the Study of Complex Systems Institute of Physics Belgrade University of Belgrade Pregrevica 118 Belgrade11080 Serbia The Ohio State University Department of Physics and Electrical and Computer Engineering 191 West Woodruff Ave ColumbusOH43210 United States ResCon Technologies LLC 1275 Kinnear Rd. Suite 239 ColumbusOH43212 United States Trieste Italy Research Group Comparative Neuroscience Leibniz Institute for Neurobiology Magdeburg Germany Theoretical Physics Saarland University Saarbrücken66123 Germany Center for Biophysics Saarland University Saarbrücken66123 Germany Department of Mathematics Imperial College London United Kingdom Center for Adaptive Rationality Max Planck Institute for Human Development Lentzeallee 94 Berlin14195 Germany Max Planck Institute for Brain Research Max-von-Laue-Straße 4 Frankfurt am Main60438 Germany Technical University of Munich School of Life Sciences Alte Akademie 8 Freising85354 Germany Department of Mathematics School of Computation Information and Technology Technical University of Munich Boltzmannstraße 3 Garching bei München8574

Adaptivity is a dynamical feature that is omnipresent in nature, socio-economics, and technology. For example, adaptive couplings appear in various real-world systems like the power grid, social, and neural networks, and they form the backbone of closed-loop control strategies and machine learning algorithms. In this article, we provide an interdisciplinary perspective on adaptive systems. We reflect on the notion and terminology of adaptivity in different disciplines and discuss which role adaptivity plays for various fields. We highlight common open challenges, and give perspectives on future research directions, looking to inspire interdisciplinary approaches. Copyright © 2023, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Codebook-Based Beam Tracking for Conformal Array-Enabled UAV MmWave Networks

arXiv

引用

arXiv 2020年

作者： Zhang, Jinglin Xu, Wenjun Gao, Hui Pan, Miao Han, Zhu Zhang, Ping Key Lab of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering University of Houston HoustonTX77204 United States University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China

Millimeter wave (mmWave) communications can potentially meet the high data-rate requirements of unmanned aerial vehicle (UAV) networks. However, as the prerequisite of mmWave communications, the narrow directional beam tracking is very challenging because of the three-dimensional (3D) mobility and attitude variation of UAVs. Aiming to address the beam tracking difficulties, we propose to integrate the conformal array (CA) with the surface of each UAV, which enables the full spatial coverage and the agile beam tracking in highly dynamic UAV mmWave networks. More specifically, the key contributions of our work are three-fold. 1) A new mmWave beam tracking framework is established for the CA-enabled UAV mmWave network. 2) A specialized hierarchical codebook is constructed to drive the directional radiating element (DRE)-covered cylindrical conformal array (CCA), which contains both the angular beam pattern and the subarray pattern to fully utilize the potential of the CA. 3) A codebook-based multiuser beam tracking scheme is proposed, where the Gaussian process machine learning enabled UAV position/attitude predication is developed to improve the beam tracking efficiency in conjunction with the tracking-error aware adaptive beamwidth control. Simulation results validate the effectiveness of the proposed codebook-based beam tracking scheme in the CA-enabled UAV mmWave network, and demonstrate the advantages of CA over the conventional planner array in terms of spectrum efficiency and outage probability in the highly dynamic scenarios. Copyright © 2020, The Authors. All rights reserved.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Quick and Accurate False Data Detection in Mobile Crowd Sensing

Quick and Accurate False Data Detection in Mobile Crowd Sens...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Kun Xie Xiaocan Li Xin Wang Gaogang Xie Dongliang Xie Zhenyu Li Jigang Wen Zulong Diao College of Computer Science and Electronics Engineering Hunan University Changsha China Department of Electrical and Computer Engineering State University of New York at Stony Brook State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences State key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

With the proliferation of smartphones, a novel sensing paradigm called Mobile Crowd Sensing (MCS) has emerged very recently. However, the attacks and faults in MCS cause a serious false data problem. Observing the intrinsic low dimensionality of general monitoring data and the sparsity of false data, false data detection can be performed based on the separation of normal data and anomalies. Although the existing separation algorithm based on Direct Robust Matrix Factorization (DRMF) is proven to be effective, requiring iteratively performing Singular Value Decomposition (SVD) for low-rank matrix approximation would result in a prohibitively high accumulated computation cost when the data matrix is large. In this work, we observe the quick false data location feature from our empirical study of DRMF, based on which we propose an intelligent Light weight Low Rank and False Matrix Separation algorithm (LightLRFMS) that can reuse the previous result of the matrix decomposition to deduce the one for the current iteration step. Our algorithm can largely speed up the whole iteration process. From a theoretical perspective, we validate that LightLRFMS only requires one round of SVD computation and thus has very low computation cost. We have done extensive experiments using a PM 2.5 air condition trace and a road traffic trace. Our results demonstrate that LightLRFMS can achieve very good false data detection performance with the same highest detection accuracy as DRMF but with up to 10 times faster speed thanks to its lower computation cost.

关键词： Sparse matrices Sensors Matrix decomposition Monitoring Matrix converters Roads Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Challenges in cybersecurity: Lessons from biological defense systems

arXiv

引用

arXiv 2021年

作者： Schrom, Edward Kinzig, Ann Forrest, Stephanie Graham, Andrea L. Levin, Simon A. Bergstrom, Carl T. Castillo-Chavez, Carlos Collins, James P. De Boer, Rob J. Doupé, Adam Ensafi, Roya Feldman, Stuart Grenfell, Bryan T. Halderman, J. Alex Huijben, Silvie Maley, Carlo Moses, Melanie Perelson, Alan S. Perrings, Charles Plotkin, Joshua Rexford, Jennifer Tiwari, Mohit Department of Ecology and Evolutionary Biology Princeton University 106A Guyot Hall PrincetonNJ08544 United States School of Life Sciences Arizona State University TempeAZ85287 United States Julie Ann Wrigley Global Institute of Sustainability Arizona State University TempeAZ85287 United States Biodesign Center for Biocomputation Security and Society Arizona State University TempeAZ85287 United States School of Computing Informatics and Decision Sciences Engineering Arizona State University TempeAZ85287 United States Santa Fe Institute Santa FeNM87501 United States Department of Biology University of Washington SeattleWA98195 United States Arizona State University TempeAZ85287 United States Theoretical Biology and Bioinformatics Utrecht University Utrecht3584 CH Netherlands Center for Cybersecurity and Digital Forensics Global Security Initiative Arizona State University TempeAZ85287 United States Department of Electrical Engineering and Computer Science Computer Science and Engineering Division University of Michigan Ann ArborMI48109 United States Schmidt Futures New YorkNY10011 United States Princeton School of Public and International Affairs Princeton University PrincetonNJ08544 United States Center for Computer Security and Society University of Michigan Ann ArborMI48109 United States Center for Evolution and Medicine School of Life Sciences Arizona State University TempeAZ85287 United States Arizona Cancer Evolution Center Arizona State University TempeAZ85287 United States Department of Computer Science University of New Mexico AlbuquerqueNM87131 United States University of New Mexico Department of Computer Science AlbuquerqueNM87131 United States Department of Biology University of New Mexico AlbuquerqueNM87131 United States Theoretical Biology and Biophysics Group Los Alamos National Laboratory Los AlamosNM87545 United States Department of Biology University of Pennsylvania PhiladelphiaPA19104 Unite

We explore the commonalities between methods for assuring the security of computer systems (cybersecurity) and the mechanisms that have evolved through natural selection to protect vertebrates against pathogens, and how insights derived from studying the evolution of natural defenses can inform the design of more effective cybersecurity systems. More generally, security challenges are crucial for the maintenance of a wide range of complex adaptive systems, including financial systems, and again lessons learned from the study of the evolution of natural defenses can provide guidance for the protection of such *** Codes A.0. Copyright © 2021, The Authors. All rights reserved.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Supervised Online Hashing via Similarity Distribution Learning

arXiv

引用

arXiv 2019年

作者： Lin, Mingbao Ji, Rongrong Chen, Shen Zheng, Feng Sun, Xiaoshuai Zhang, Baochang Cao, Liujuan Guo, Guodong Huang, Feiyue Fujian Key Laboratory of Sensing and Computing for Smart City School of Information Science and Engineering Xiamen University China Peng Cheng Laboratory China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China School of Automation Science and Electrical Engineering Beihang University China Baidu Research Institute of Deep Learning Co. Ltd China

Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in largescale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relationship in the produced Hamming space. Specifically, we first transform the discrete similarity matrix into a probability matrix via a Gaussianbased normalization to address the extremely imbalanced distribution issue. And then, we introduce a scaling Student t-distribution to solve the challenging initialization problem, and efficiently bridge the gap between the known and unknown distributions. Lastly, we align the two distributions via minimizing the Kullback-Leibler divergence (KL-diverence) with stochastic gradient descent (SGD), by which an intuitive similarity constraint is imposed to update hashing model on the new streaming data with a powerful generalizing ability to the past data. Extensive experiments on three widely-used benchmarks validate the superiority of the proposed SDOH over the state-of-the-art methods in the online retrieval task. Copyright © 2019, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Quantum advantage for differential equation analysis

arXiv

引用

arXiv 2020年

作者： Kiani, Bobak Toussi De Palma, Giacomo Englund, Dirk Kaminsky, William Marvian, Milad Lloyd, Seth Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Research Laboratory of Electronics Massachusetts Institute of Technology CambridgeMA02139 United States Scuola Normale Superiore Pisa56126 Italy QuEra Computing BostonMA02143 United States Cambridge MA02139 United States University of New Mexico AlbuquerqueNM87131 United States Department of Mechanical Engineering Massachusetts Institute of Technology CambridgeMA02139 United States

Quantum algorithms for differential equation solving, data processing, and machine learning potentially offer an exponential speedup over all known classical algorithms. However, there also exist obstacles to obtaining this potential speedup in useful problem instances. The essential obstacle for quantum differential equation solving is that outputting useful information may require difficult post-processing, and the essential obstacle for quantum data processing and machine learning is that inputting the data is a difficult task just by itself. In this study, we demonstrate, when combined, these difficulties solve one another. We show how the output of quantum differential equation solving can serve as the input for quantum data processing and machine learning, allowing dynamical analysis in terms of principal components, power spectra, and wavelet decompositions. To illustrate this, we consider continuous time Markov processes on epidemiological and social networks. These quantum algorithms provide an exponential advantage over existing classical Monte Carlo methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain

arXiv

引用

arXiv 2021年

作者： Tennant, Daniel M. Dai, Xi Martinez, Antonio J. Trappen, Robbyn Melanson, Denis Yurtalan, M.A. Tang, Yongchao Bedkihal, Salil Yang, Rui Novikov, Sergei Grover, Jeffery A. Disseler, Steven M. Basham, James I. Das, Rabindra Kim, David K. Melville, Alexander J. Niedzielski, Bethany M. Weber, Steven J. Yoder, Jonilyn L. Kerman, Andrew J. Mozgunov, Evgeny Lidar, Daniel A. Lupascu, Adrian Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Northrop Grumman Corporation LinthicumMD21090 United States MIT Lincoln Laboratory LexingtonMA02421 United States Center for Quantum Information Science & Technology University of Southern California Los AngelesCA90089 United States Departments of Electrical & Computer Engineering Chemistry and Physics Waterloo Institute for Nanotechnology University of Waterloo WaterlooONN2L 3G1 Canada

Spin chains have long been considered an effective medium for long-range interactions, entanglement generation, and quantum state transfer. In this work, we explore the properties of a spin chain implemented with superconducting flux circuits, designed to act as a connectivity medium between two superconducting qubits. The susceptibility of the chain is probed and shown to support long-range, cross chain correlations. In addition, interactions between the two end qubits, mediated by the coupler chain, are demonstrated. This work has direct applicability in near term quantum annealing processors as a means of generating long-range, coherent coupling between qubits. © 2021, CC BY.

关键词： Spin dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：