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

Traffic-Aware Two-Stage Queueing Communication Networks: Queue Analysis and Energy Saving

学校读者我要写书评

暂无评论

Traffic-Aware Two-Stage Queueing Communication Networks: Que...

作者： Qi, Nan Miridakis, Nikolaos I. Xiao, Ming Tsiftsis, Theodoros A. Yao, Rugui Jin, Shi Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics Nanjing210016 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Institute of Physical Internet School of Intelligent Systems Science & Engineering Jinan University Zhuhai Campus Zhuhai519070 China Department of Informatics and Computer Engineering University of West Attica Aegaleo12243 Greece School of Electrical Engineering of KTH Royal Institute of Technology Stockholm11428 Sweden School of Electronics and Information Northwestern Polytechnical University Xi'an710072 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

To boost energy saving for the general delay-tolerant IoT networks, a two-stage, and single-relay queueing communication scheme is investigated. Concretely, a traffic-aware $N$-threshold and gated-service policy are applied at the relay. As two fundamental and significant performance metrics, the mean waiting time and long-term expected power consumption are explicitly derived and related with the queueing and service parameters, such as packet arrival rate, service threshold and channel statistics. Besides, we take into account the electrical circuit energy consumptions when the relay server and access point (AP) are in different modes and energy costs for mode transitions, whereby the power consumption model is more practical. The expected power minimization problem under the mean waiting time constraint is formulated. Tight closed-form bounds are adopted to obtain tractable analytical formulae with less computational complexity. The optimal energy-saving service threshold that can flexibly adjust to packet arrival rate is determined. In addition, numerical results reveal that: 1) sacrificing the mean waiting time not necessarily facilitates power savings;2) a higher arrival rate leads to a greater optimal service threshold;and 3) our policy performs better than the current state-of-the-art. © 2020 IEEE.

关键词： Energy conservation

Driver Hazard Response When Processing On-road and In-vehicle Messaging of Non-Safety-Related Information

学校读者我要写书评

暂无评论

Driver Hazard Response When Processing On-road and In-vehicl...

IEEE International Conference on Human-Machine systems

作者： Yulin Deng Stephen J. Cauffman Mei Ying Lau Ebony Johnson Azhagan Avr Christopher Cunningham David Kaber Jing Feng Edward P. Fitts Department of Industrial and Systems Engineering North Carolina State University Raleigh NC USA Department of Psuychology North Carolina State University Raleigh NC USA Department of Industrial and Systems Engineering University of Florida Gainesville FL USA Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA M.C.E. Institute of Transportation Research and Education North Carolina State University Raleigh NC USA

ISBN: (数字)9781728158716

ISBN: (纸本)9781728158723

With advances in vehicle technologies, more information can be communicated in real-time to drivers via in-vehicle interfaces. In-vehicle messaging can be used for safety related information, such as warnings, as well as non-safety related information, such as upcoming gas stations. While much research has focused on the design of messaging safety-related information, little is known about the best practice for in-vehicle messaging non-safety-related information. The current study aimed to examine how drivers process service logos - as an example of non-safety-related information - and respond to road hazards when logos are presented on: (1) an on-road sign panel, (2) an in-vehicle display, or (3) a combination of both. It was found that drivers generally identified logos with high accuracy and low workload across the presentation conditions. Driver reactions to road hazards were slower when logos were present for processing, although the number of collisions did not increase. Although the majority of drivers self-reported a preference for the on-road presentation, the simultaneous presentation of logos on-road and in-vehicle showed a benefit on driver hazard negotiation (fewer collisions). Older drivers were less accurate in identifying logos but also had fewer collisions, likely due to them being more cautious and allocating more attention to the driving task. Findings of this study provide support for use of in-vehicle presentation of non-safety-related information in addition to existing on-road signage.

关键词： Vehicles Hazards Roads Visualization Task analysis Navigation

Optimize Student Learning via Random Forest-Based Adaptive Narrative Game

学校读者我要写书评

暂无评论

Optimize Student Learning via Random Forest-Based Adaptive N...

IEEE International Conference on Automation Science and engineering (CASE)

作者： Ryan Hare Ying Tang Wei Cui Joleen Liang Department of Electrical and Computer Engineering Rowan University Glassboro USA State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Institute of Smart Education Qingdao Academy of Intelligent Industries Qingdao China Squirrel AI Learning Shanghai China

ISBN: (数字)9781728169040

ISBN: (纸本)9781728169057

This paper presents an adaptive narrative game system that focuses on sequential logic design. The system adapts a random forest machine learning model to estimate a student's current level of domain knowledge relative to the problem presented to him through his game-playing behavior data, such as time taken to find solutions, errors in solutions, and emotional indicators. Hints, prompts, and/or individualized lessons are then offered to the player to guide their learning in a positive and productive direction. Our preliminary pilot study demonstrates that the model can make accurate classifications, from which proper assistance can then be provided to individual students as they play.

关键词： Games Databases Forestry Education Problem-solving Presses Artificial intelligence

Bearing-only formation control under persistence of excitation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tang, Zhiqi Cunha, Rita Hamel, Tarek Silvestre, Carlos Institute for Systems and Robotics Instituto Superior Técnico Universidade de Lisboa Portugal I3S-CNRS Université Côte d'Azur Nice-Sophia Antipolis France I3S-CNRS Institut Universitaire de France Nice-Sophia Antipolis France Department of Electrical and Computer Engineering The Faculty of Science and Technology The University of Macau China

This paper addresses the problem of bearing-only formation control in d (d ≥ 2)-dimensional space by exploring persistence of excitation (PE) of the desired bearing reference. By defining a desired formation that is bearing PE, distributed bearing-only control laws are proposed, which guarantee exponential stabilization of the desired formation only up to a translation vector. The key outcome of this approach relies in exploiting the bearing PE to significantly relax the conditions imposed on the graph topology to ensure exponential stabilization, when compared to the bearing rigidity conditions, and to remove the scale ambiguity introduced by bearing vectors. Simulation results are provided to illustrate the performance of the proposed control method. Copyright © 2020, The Authors. All rights reserved.

关键词： Stabilization

Analysis of a generalized expectation-maximization algorithm for Gaussian mixture models: A control systems perspective

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Chatterjee, Sarthak Romero, Orlando Pequito, Sérgio Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute TroyNY12180 United States Department of Industrial and Systems Engineering Rensselaer Polytechnic Institute TroyNY12180 United States

The Expectation-Maximization (EM) algorithm is one of the most popular methods used to solve the problem of parametric distribution-based clustering in unsupervised learning. In this paper, we propose to analyze a generalized EM (GEM) algorithm in the context of Gaussian mixture models, where the maximization step in the EM is replaced by an increasing step. We show that this GEM algorithm can be understood as a linear time-invariant (LTI) system with a feedback nonlinearity. Therefore, we explore some of its convergence properties by leveraging tools from robust control theory. Lastly, we explain how the proposed GEM can be designed, and present a pedagogical example to understand the advantages of the proposed approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Maximum principle

Multitaper Spectral Analysis of Neuronal Spiking Activity Driven by Latent Stationary Processes

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Das, Proloy Babadi, Behtash Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland College ParkMD20742 United States

Investigating the spectral properties of the neural covariates that underlie spiking activity is an important problem in systems neuroscience, as it allows to study the role of brain rhythms in cognitive functions. While the spectral estimation of continuous time-series is a well-established domain, computing the spectral representation of these neural covariates from spiking data sets forth various challenges due to the intrinsic non-linearities involved. In this paper, we address this problem by proposing a variant of the multitaper method specifically tailored for point process data. To this end, we construct auxiliary spiking statistics from which the eigen-spectra of the underlying latent process can be directly inferred using maximum likelihood estimation, and thereby the multitaper estimate can be efficiently computed. Comparison of our proposed technique to existing methods using simulated data reveals significant gains in terms of the bias-variance trade-off. Copyright © 2019, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

Node isolation in large homogeneous binary multiplicative attribute graph models

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Qu, Sikai Makowski, Armand M. Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland College ParkMD20742 United States

The multiplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model of certain classes of real-world networks. It is an instance of hidden graph models, and implements the plausible idea that network structure is collectively shaped by attributes individually associated with nodes. These authors have studied several aspects of this model, including its connectivity, the existence of a giant component, its diameter and the degree distribution. This was done in the asymptotic regime when the number of nodes and the number of node attributes both grow unboundedly large, the latter scaling with the former under a natural admissibility condition. In the same setting, we explore the existence (or equivalently, absence) of isolated nodes, a property not discussed in the original paper. The main result of the paper is a zero-one law for the absence of isolated nodes;this zero-one law coincides with that obtained by Kim and Leskovec for graph connectivity (although under slightly weaker assumptions). We prove these results by applying the method of first and second moments in a non-standard way to multiple sets of counting random variables associated with the number of isolated nodes. Copyright © 2019, The Authors. All rights reserved.

关键词： Graph theory

Model-Free Non-Stationary RL: Near-Optimal Regret and Applications in Multi-Agent RL and Inventory Control

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Mao, Weichao Zhang, Kaiqing Zhu, Ruihao Simchi-Levi, David Başar, Tamer Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois Urbana-Champaign UrbanaIL61801 United States Laboratory for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Cornell SC Johnson College of Business IthacaNY14853 United States Institute for Data Systems and Society Department of Civil and Environmental Engineering Operations Research Center Massachusetts Institute of Technology CambridgeMA02139 United States

We consider model-free reinforcement learning (RL) in non-stationary Markov decision processes. Both the reward functions and the state transition functions are allowed to vary arbitrarily over time as long as their cumulative variations do not exceed certain variation budgets. We propose Restarted Q-Learning with Upper Confidence Bounds (RestartQ-UCB), the first model-free algorithm for non-stationary RL, and show that it outperforms existing solutions in terms of dynamic regret. Specifically, RestartQ-UCB with Freedman-type bonus terms achieves a dynamic regret bound of (formula presented ), where S and A are the numbers of states and actions, respectively, ∆ > 0 is the variation budget, H is the number of time steps per episode, and T is the total number of time steps. We further present a parameter-free algorithm named Double-Restart Q-UCB that does not require prior knowledge of the variation budget. We show that our algorithms are nearly optimal by establishing an information-theoretical lower bound of (formula presented ), the first lower bound in non-stationary RL. Numerical experiments validate the advantages of RestartQ-UCB in terms of both cumulative rewards and computational efficiency. We demonstrate the power of our results in examples of multi-agent RL and inventory control across related products. Copyright © 2020, The Authors. All rights reserved.

关键词： Reinforcement learning

Drone-assisted communications for remote areas and disaster relief

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Gholami, Anousheh Fiaz, Usman A. Baras, John S. Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland College ParkMD20742 United States

Recent years have seen a great deal of interest in deploying unmanned aerial vehicles (UAVs), also known as drones, for applications such as aerial transport of goods, search and rescue, precision agriculture, wildlife conservation, realtime monitoring, security and surveillance. Besides this wide range of conventional applications of drones, UAV-assisted communication systems have emerged as one of the key technologies for the development and expansion of fifth generation (5G) networks, and have therefore attracted a lot of interest from both academia and industry [1]. Copyright © 2019, The Authors. All rights reserved.

关键词： Antennas