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

Bridge the Present and Future: A Cross-Layer Matching Game in Dynamic Cloud-Aided Mobile Edge Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Qi, Houyi Liwang, Minghui Wang, Xianbin Li, Li Gong, Wei Jin, Jian Jiao, Zhenzhen The School of Informatics Xiamen University Fujian China The Department of Electrical and Computer Engineering Western University ON Canada The Department of Control Science and Engineering Tongji University Shanghai China The Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China The Research Institute of Industrial Internet of Things CAICT China The iF-Labs Beijing Teleinfo Technology Co. Ltd. CAICT China

Cloud-aided mobile edge networks (CAMENs) allow edge servers (ESs) to purchase resources from remote cloud servers (CSs), while overcoming resource shortage when handling computation-intensive tasks of mobile users (MUs). Conventional trading mechanisms (e.g., onsite trading) confront many challenges, including decision-making overhead (e.g., latency) and potential trading failures. This paper investigates a series of cross-layer matching mechanisms to achieve stable and cost-effective resource provisioning across different layers (i.e., MUs, ESs, CSs), seamlessly integrated into a novel hybrid paradigm that incorporates futures and spot trading. In futures trading, we explore an overbooking-driven aforehand cross-layer matching (OA-CLM) mechanism, facilitating two future contract types: contract between MUs and ESs, and contract between ESs and CSs, while assessing potential risks under historical statistical analysis. In spot trading, we design two backup plans respond to current network/market conditions: determination on contractual MUs that should switch to local processing from edge/cloud services;and an onsite cross-layer matching (OS-CLM) mechanism that engages participants in real-time practical transactions. We next show that our matching mechanisms theoretically satisfy stability, individual rationality, competitive equilibrium, and weak Pareto optimality. Comprehensive simulations in real-world and numerical network settings confirm the corresponding efficacy, while revealing remarkable improvements in time/energy efficiency and social welfare. Copyright © 2023, The Authors. All rights reserved.

关键词： decision making

Opportunistic Wiretapping/Jamming: A New Attack Model in Millimeter-Wave Wireless Networks

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2022年

作者： Zhang, Yuanyu Zheng, Zhumeng He, Ji Zhao, Shuangrui Qu, Qianyue Shen, Yulong Jiang, Xiaohong School of Computer Science and Technology Xidian University Shaanxi Xi’an China Shannxi Key Laboratory of Network and System Security China The Beijing Sunwise Information Technology Ltd Beijing Institute of Control Engineering Beijing China The Division of Information Science Graduate School of Science and Technology Nara Institute of Science and Technology Nara Ikoma Japan School of Systems Information Science Future University Hakodate Hokkaido Hakodate Japan

While the millimeter-wave (mmWave) communication is robust against the conventional wiretapping attack due to its short transmission range and directivity, this paper proposes a new opportunistic wiretapping and jamming (OWJ) attack model in mmWave wireless networks. With OWJ, an eavesdropper can opportunistically conduct wiretapping or jamming to initiate a more hazardous attack based on the instantaneous costs of wiretapping and jamming. We also provide three realizations of the OWJ attack, which are mainly determined by the cost models relevant to distance, path loss and received power, respectively. To understand the impact of the new attack on mmWave network security, we first develop novel approximation techniques to characterize the irregular distributions of wiretappers, jammers and interferers under three OWJ realizations. With the help of the results of node distributions, we then derive analytical expressions for the secrecy transmission capacity to depict the network security performance under OWJ. Finally, we provide extensive numerical results to illustrate the effect of OWJ and to demonstrate that the new attack can more significantly degrade the network security performance than the pure wiretapping or jamming attack. © 2022, CC BY.

关键词： Millimeter waves

Opportunistic Wiretapping/Jamming: A New Attack Model in Millimeter-Wave Wireless Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Yuanyu Zheng, Zhumeng He, Ji Zhao, Shuangrui Qu, Qianyue Shen, Yulong Jiang, Xiaohong School of Computer Science and Technology Xidian University Shaanxi Xi’an China Shannxi Key Laboratory of Network and System Security China Beijing Sunwise Information Technology Ltd Beijing Institute of Control Engineering Beijing China Division of Information Science Graduate School of Science and Technology Nara Institute of Science and Technology Nara Ikoma Japan School of Systems Information Science Future University Hakodate Hokkaido Hakodate Japan

关键词： Millimeter waves

Distributed Online Convex Optimization with an Aggregative Variable

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Xiuxian Yi, Xinlei Xie, Lihua School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

This paper investigates distributed online convex optimization in the presence of an aggregative variable without any global/central coordinators over a multi-agent network, where each individual agent is only able to access partial information of time-varying global loss functions, thus requiring local information exchanges between neighboring agents. Motivated by many applications in reality, the considered local loss functions depend not only on their own decision variables, but also on an aggregative variable, such as the average of all decision variables. To handle this problem, an Online Distributed Gradient Tracking algorithm (O-DGT) is proposed with exact gradient information and it is shown that the dynamic regret is upper bounded by three terms: a sublinear term, a path variation term, and a gradient variation term. Meanwhile, the O-DGT algorithm is also analyzed with stochastic/noisy gradients, showing that the expected dynamic regret has the same upper bound as the exact gradient case. To our best knowledge, this paper is the first to study online convex optimization in the presence of an aggregative variable, which enjoys new characteristics in comparison with the conventional scenario without the aggregative variable. Finally, a numerical experiment is provided to corroborate the obtained theoretical results. Copyright © 2020, The Authors. All rights reserved.

关键词： decision making

Temporal Logic Trees for Model Checking and control Synthesis of Uncertain Discrete-time systems

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Gao, Yulong Abate, Alessandro Jiang, Frank J. Giacobbe, Mirco Xie, Lihua Johansson, Karl H. Division of Decision and Control Systems Royal Institute of Technology Stockholm Sweden Department of Computer Science University of Oxford United Kingdom School of Electrical and Electronic Engineering Nanyang Technological University Singapore

We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability analysis. In contrast to automaton-based methods, the construction of the TLT is abstraction-free for infinite systems, that is, we do not construct discrete abstractions of the infinite systems. Moreover, for a given transition system and an LTL formula, we prove that there exist both a universal TLT and an existential TLT via minimal and maximal reachability analysis, respectively. We show that the universal TLT is an underapproximation for the LTL formula and the existential TLT is an overapproximation. We provide sufficient conditions and necessary conditions to verify whether a transition system satisfies an LTL formula by using the TLT approximations. As a major contribution of this work, for a controlled transition system and an LTL formula, we prove that a controlled TLT can be constructed from the LTL formula via control-dependent reachability analysis. Based on the controlled TLT, we design an online control synthesis algorithm, under which a set of feasible control inputs can be generated at each time step. We also prove that this algorithm is recursively feasible. We illustrate the proposed methods for both finite and infinite systems and highlight the generality and online scalability with two simulated examples. Copyright © 2020, The Authors. All rights reserved.

关键词： Temporal logic

Overcoming the Fear of the Dark: Occlusion-Aware Model-Predictive Planning for Automated Vehicles Using Risk Fields

学校读者我要写书评

暂无评论

arXiv 2023年

作者： van der Ploeg, Chris Nyberg, Truls Sánchez, José Manuel Gaspar Silvas, Emilia van de Wouw, Nathan Netherlands Organisation for Applied Scientific Research Integrated Vehicle Safety Group Helmond5700 AT Netherlands Eindhoven University of Technology Dynamics and Control Group Mechanical Engineering Dept. P.O. Box 513 Eindhoven5600 MB Netherlands Eindhoven University of Technology Control Systems Technology Group Mechanical Engineering Dept. P.O. Box 513 Eindhoven5600 MB Netherlands KTH Royal Institute of Technology Division of Robotics Perception and Learning School of Electrical Engineering and Computer Science Stockholm100 44 Sweden Scania CV AB Södertälje151 87 Sweden

As vehicle automation advances, motion planning algorithms face escalating challenges in achieving safe and efficient navigation. Existing Advanced Driver Assistance systems (ADAS) primarily focus on basic tasks, leaving unexpected scenarios for human intervention, which can be error-prone. Motion planning approaches for higher levels of automation in the state-of-the-art are primarily oriented toward the use of risk- or anti-collision constraints, using over-approximates of the shapes and sizes of other road users to prevent collisions. These methods however suffer from conservative behavior and the risk of infeasibility in high-risk initial conditions. In contrast, our work introduces a novel multi-objective trajectory generation approach. We propose an innovative method for constructing risk fields that accommodates diverse entity shapes and sizes, which allows us to also account for the presence of potentially occluded objects. This methodology is integrated into an occlusion-aware trajectory generator, enabling dynamic and safe maneuvering through intricate environments while anticipating (potentially hidden) road users and traveling along the infrastructure toward a specific goal. Through theoretical underpinnings and simulations, we validate the effectiveness of our approach. This paper bridges crucial gaps in motion planning for automated vehicles, offering a pathway toward safer and more adaptable autonomous navigation in complex urban contexts. Copyright © 2023, The Authors. All rights reserved.

关键词： Motion planning

Dimensionality Reduction of Volterra Kernels by Tensor Decomposition using Higher-Order SVD

学校读者我要写书评

暂无评论

Dimensionality Reduction of Volterra Kernels by Tensor Decom...

IEEE Conference on decision and control

作者： Urszula Libal John S. Baras Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Wroclaw University of Science and Technology Wroclaw Poland University of Maryland College Park MD USA

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

The paper proposes a practical method for a significant dimensionality reduction of Volterra kernels, defining a discrete nonlinear model of a signal by Volterra series of higher order. In system identification of Volterra series, the Volterra kernels and nonlinear inputs of the system can be described by super-symmetrical tensors. The reduction of their dimensionality is obtained by a tensor decomposition technique called Higher Order Singular Value Decomposition (HOSVD). The main contribution of the paper is a cascade learning algorithm for the system identification based on residuals of least squares minimization. Numerical examples for Volterra system of order four are used to illustrate the approach.

关键词： Tensors Kernel Indexes Singular value decomposition Nonlinear systems Taylor series Matrix decomposition

Transition Metal Ion Ensembles in Crystals as Solid-State Coherent Spin-Photon Interfaces: The Case of Nickel in Magnesium Oxide

学校读者我要写书评

暂无评论

PRX Quantum 2023年第3期4卷 030329-030329页

作者： E. Poem S. Gupta I. Morris K. Klink L. Singh T. Zhong S.S. Nicley J.N. Becker O. Firstenberg Department of Physics of Complex Systems Weizmann Institute of Science Rehovot 7610001 Israel Prizker School of Molecular Engineering The University of Chicago Chicago Illinois 60637 USA Department of Physics and Astronomy Michigan State University 567 Wilson Road East Lansing Michigan 48824 USA Department of Electrical and Computer Engineering Michigan State University 428S. Shaw Lane Room 2120 East Lansing Michigan 48824 USA Coatings and Diamond Technologies Division Center Midwest (CMW) Fraunhofer USA Inc. 1449 Engineering Research Court East Lansing Michigan 48824 USA

We present general guidelines for finding solid-state systems that could serve as coherent electron-spin–photon interfaces even at relatively high temperatures, where phonons are abundant but cooling is easier, and show that transition-metal ions in various crystals could comply with these guidelines. As an illustrative example, we focus on divalent nickel ions in magnesium oxide. We perform electron-spin-resonance spectroscopy and polarization-sensitive magneto-optical fluorescence spectroscopy of a dense ensemble of these ions and find that (i) the ground-state electron spin stays coherent at liquid-helium temperatures for several microseconds and (ii) there exist energetically well-isolated excited states that can couple to two ground-state spin sublevels via optical transitions of orthogonal polarizations. The latter implies that fast coherent optical control over the electron spin is possible. We then propose schemes for optical initialization and control of the ground-state electron spin using polarized optical pulses, as well as two schemes for implementing a noise-free broadband quantum optical memory at near-telecom wavelengths in this material system.

关键词： Quantum control Quantum information with solid state qubits Crystalline systems Insulators Ions Polarization Crystal-field theory Electron spin resonance Fluorescence spectroscopy Infrared spectroscopy Optical spectroscopy Photoluminescence Symmetries in condensed matter

Joint beamforming and reflecting design in reconfigurable intelligent surface-aided multi-user communication systems

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Xiaoyan Guo, Shuaishuai Zhang, Haixia Fang, Yuguang Yuan, Dongfeng Shandong Provincial Key Laboratory of Wireless Communication Technologies School of Information Science and Engineering Shandong University Qingdao266237 China Shandong Provincial Key Laboratory of Wireless Communication Technologies School of Control Science and Engineering Shandong University Jinan250061 China Computer Electrical and Mathematical Science and Engineering Division Department of Electrical and Computer Engineering University of Florida GainesvilleFL United States

Reconfigurable intelligent surface (RIS) provides a promising way to build the programmable wireless transmission environments in the future. Owing to the large number of reflecting elements used at the RIS, joint optimization for the active beamforming at the transmitter and the passive reflector at the RIS is usually complicated and time-consuming. To address this problem, this paper proposes a low-complexity joint beamforming and reflecting algorithm based on fractional programing (FP). Specifically, we first consider a RIS-aided multi-user communication system with perfect channel state information (CSI) and formulate an optimization problem to maximize the sum rate of all users. Since the problem is nonconvex, we decompose the original problem into three disjoint subproblems. By introducing favorable auxiliary variables, we derive the closed-form expressions of the beamforming vectors and reflecting matrix in each subproblem, leading to a joint beamforming and reflecting algorithm with low complexity. We then extend our approach to handle the case when transmitter-RIS and RIS-receiver channels are not perfect and develop corresponding low-complexity joint beamforming and reflecting algorithm with practical channel estimation. Simulation results have verified the effectiveness of the proposed algorithms as compared to various benchmark schemes. © 2021, CC BY.

关键词： Channel state information