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

27th International Conference on Information Technology, IT 2023

作者： Lakovic, Luka Kara, Peter A. Ognjanovic, Ivana Bokor, Laszlo Sendelj, Ramo Reich, Christoph Roganovic, Milovan Zoulias, Emmanouil Erakovic, Jevto Radusinovic, Tanja Rakocevic, Nada Simon, Aniko University of Donja Gorica Faculty for Information Systems and Technologies Podgorica81000 Montenegro Budapest University of Technology and Economics Faculty of Electrical Engineering and Informatics Department of Networked Systems and Services Budapest1111 Hungary Faculty of Science Engineering and Computing Kingston University Wireless Multimedia and Networking Research Group Department of Computer Science School of Computer Science and Mathematics LondonKT1 2EE United Kingdom University of Donja Gorica Humanistic Studies Podgorica81000 Montenegro Furtwangen University Institute of Data Science Cloud Computing and It Security Furtwangen78120 Germany Clinical Centre of Montenegro Clinic for Neurology Podgorica81000 Montenegro National and Kapodistrian University of Athens Faculty of Nursing School of Health Sciences Goudi 11527 Greece Chamber of Economy of Montenegro Podgorica81000 Montenegro Sigma Technology Budapest1093 Hungary

ISBN: (纸本)9798350397512

In the era of global digitalization, digital innovation hubs have become essential, as they function as transforming forces. In this paper, we provide an analysis of the Montenegrin Academic Digital Innovation Hub by applying multi-criteria qualitative evaluation over several criteria: process flow of fully digitized operations of the Hub (with aspects of the innovation life-cycle, ethics, and security), resource management, strategic goals, and feasibility. The paper also proposes a model of comprehensive resource management via the perspective of smart specialization priorities of Montenegro. © 2023 IEEE.

关键词： Life cycle

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence for Climate Smart Forestry: A Forward Looking Vision 5

Artificial Intelligence for Climate Smart Forestry: A Forwar...

引用

5th IEEE International Conference on Cognitive Machine Intelligence, CogMI 2023

作者： Luo, Feng Liu, Ling Wang, G. Geoff Kumar, Vijay Ashton, Mark S. Abernethy, Jacob Afghah, Fatemeh Browning, Matthew H. E. M Coyle, David Dames, Philip O'Halloran, Tom Hays, James Heisl, Patrick Jiang, Chenfanfu Khanal, Puskar Krovi, Venkat Narayan Kuebbing, Sara Li, Nianyi Liang, JingJing Liu, Ninghao McNulty, Steve Oswalt, Christopher M. Pederson, Neil Terzopoulos, Demetri Woodall, Christopher W. Wu, Yongkai Yang, Jian Yang, Yin Zhao, Liang School of Computing Clemson University ClemsonSC United States College of Computing Georgia Institute of Technology AtlantaGA United States Clemson University Department of Forestry and Environmental Conservation ClemsonSC United States School of Engineering and Applied Science University of Pennsylvania PhiladelphiaPA United States The Forest School Yale University New HavenCT United States Clemson University Department of Electrical and Computer Engineering ClemsonSC United States Clemson University Department of Parks Recreation and Tourism Management ClemsonSC United States Temple University Department of Mechanical Engineering PhiladelphiaPA United States University of California Department of Mathematics Los AngelesCA United States Clemson University Department of Automotive Engineering ClemsonSC United States Purdue University Department of Forestry and Natural Resources West LafayetteIN United States School of Computing University of Georgia AthensGA United States Northern Research Station Usda Forestry Service DurhamNH United States South Research Station Usda Forestry Service KnoxvilleTN United States Harvard University The Harvard Forest PetershamMA United States University of California Computer Science Department Los AngelesCA United States University of Kentucky Department of Forestry and Natural Resources LexingtonKY United States School of Computing University of Utah Salt Lake CityUT United States Emory University Department of Computer Science AtlantaGA United States

ISBN: (纸本)9798350323832

Forests and forest ecosystems are vital to our social, economic, and environmental well-being. However, climate change and climate-driven disturbances (CDDs) are undermining the health and resilience of forests worldwide and pose significant uncertainty to sustainable forest management. Climate-smart forestry (CSF) remains a grand challenge in practice due to our limited knowledge of how forests respond to climate change and our abilities to collect related information to empower decision making. Rapid advances in artificial intelligence (AI) can offer a timely opportunity to address the challenges in CSF. We argue that the AI-enabled, next-generation CSF can be achievable through synergistically coordinated and transdisciplinary efforts that develop and advance foundational and use-inspired AI technologies that can lead to building next-generation forest decision support systems. © 2023 IEEE.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

An Authenticated Method for a Secure Changing Password

An Authenticated Method for a Secure Changing Password

引用

Electronic engineering, Information Technology & Education (EEITE), International Conference in

作者： Mostefa Kara Konstantinos Karampidis Laid Kenioua Manolis Karampidis Muath AlShaikh Giorgos Papadourakis Abdelkader Laouid Scientific and Technology Hub of Sidi Abdellah National Higher School of Mathematics Algiers Algeria Department of Electrical and Computer Engineering Hellenic Mediterranean University Crete Greece LIAP Laboratory El Oued University El Oued Algeria Computer Science Department College of Computing and Informatics Saudi Electronic University Riyadh Kingdom of Saudi Arabia

ISBN: (数字)9798350372878

ISBN: (纸本)9798350372885

Despite their age, passwords are still widely used more than ever. In many cases, it is the solution that best fits the usage scenario. researchers are proposing innovative designs and methods to support these scenarios. Many systems, especially sensitive ones, need to change the password. Classic systems rely on changing passwords in two stages, the first i s authentication, which usually consists of two or three rounds, and the second is creating a new password (PW), which also consists of two or three rounds. In this paper, a hidden transmission of a new random PW using the previous one is presented, we talk about an authenticated changing of PW. The verifier g enerates half of the new password and sends it to the prover, the prover authenticates the sent message using the old PW and then returns the authentication proof. After checking it, the verifier creates the second half of the PW. The proposed method combines the authentication and change PW processes into one process consisting of 3 rounds. Therefore, the proposal facilitates the process of automatic periodic change of PW between two entities (user, app, system, etc). Analysis and experiments show that our technique is robust, lightweight, and reduces many potential risks in the field.

关键词： Design methodology Education Authentication Passwords Proposals

来源：评论

学校读者我要写书评

暂无评论

A Survey of Recent Advances in Optimization Methods for Wireless Communications

arXiv

引用

arXiv 2024年

作者： Liu, Ya-Feng Chang, Tsung-Hui Hong, Mingyi Wu, Zheyu So, Anthony Man-Cho Jorswieck, Eduard A. Yu, Wei The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China The Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States The Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong The Institute for Communication Technology Technische Universitat Braunschweig Germany The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recently developed optimization techniques in areas ranging from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing or developing suitable algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Learning Perceptual Hallucination for Multi-Robot Navigation in Narrow Hallways

Learning Perceptual Hallucination for Multi-Robot Navigation...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Jin-Soo Park Xuesu Xiao Garrett Warnell Harel Yedidsion Peter Stone Department of Electrical and Computer Engineering The University of Texas at Austin United States Department of Computer Science George Mason University United States Everyday Robots United States Department of Computer Science The University of Texas at Austin United States Army Research Laboratory United States Sony AI Japan

While current systems for autonomous robot navigation can produce safe and efficient motion plans in static environments, they usually generate suboptimal behaviors when multiple robots must navigate together in confined spaces. For example, when two robots meet each other in a narrow hallway, they may either turn around to find an alternative route or collide with each other. This paper presents a new approach to navigation that allows two robots to pass each other in a narrow hallway without colliding, stopping, or waiting. Our approach, Perceptual Hallucination for Hallway Passing (PHHP), learns to synthetically generate virtual obstacles (i.e., perceptual hallucination) to facilitate passing in narrow hallways by multiple robots that utilize otherwise standard autonomous navigation systems. Our experiments on physical robots in a variety of hallways show improved performance compared to multiple baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sum Rate Maximization for Movable Antenna Enhanced Multiuser Covert Communications

arXiv

引用

arXiv 2024年

作者： Mao, Haobin Pi, Xiangyu Zhu, Lipeng Xiao, Zhenyu Xia, Xiang-Gen Zhang, Rui The School of Electronic and Information Engineering The State Key Laboratory of CNS/ATM Beihang University Beijing100191 China The Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore The Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Guangdong Shenzhen518172 China

In this letter, we propose to employ movable antenna (MA) to enhance covert communications with noise uncertainty, where the confidential data is transmitted from an MA-aided access point (AP) to multiple users with a warden attempting to detect the existence of the legal transmission. To maximize the sum rate of users under covertness constraint, we formulate an optimization problem to jointly design the transmit beamforming and the positions of MAs at the AP. To solve the formulated non-convex optimization problem, we develop a block successive upper-bound minimization (BSUM) based algorithm, where the proximal distance algorithm (PDA) and the successive convex approximation (SCA) are employed to optimize the transmit beamforming and the MAs' positions, respectively. Simulation results show that the proposed MAs-aided system can significantly increase the covert sum rate via antenna position optimization as compared to conventional systems with fixed-position antennas (FPAs). Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Transmit Power and Trajectory for UAV-Enabled Data Collection With Dynamic Constraints

引用

IEEE Transactions on Communications 2025年

作者： Zhang, Hongyun Li, Bin Rong, Yue Zeng, Yong Zhang, Rui School of Aeronautics and Astronautics Sichuan University Sichuan Chengdu610065 China The School of Electrical Engineering Computing and Mathematical Sciences Curtin University GPO Box U1987 PerthWA6845 Australia National Mobile Communications Research Laboratory Southeast University Jiangsu Nanjing210096 China The Purple Mountain Laboratories Nanjing211111 China School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hon g Kong Guangdong Shenzhen518172 China The Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

The unmanned aerial vehicle (UAV)-enabled data collection system with a rotary-wing UAV and multiple ground nodes (GNs) is investigated in this paper. The average transmission data rate is maximized through the coordinated optimization of the GNs’ transmit power and the UAV’s trajectory. In particular, the UAV dynamic constraints and physical constraints are imposed. The UAV dynamics, which are governed by a group of differential equations, are usually ignored in existing works. As a consequence, the planned trajectory cannot be fully tracked by the controller in real world applications, which could lead to severe performance degradation. Thus, a control-based method is devised to address this issue. Specifically, by adopting the state-space model from control theory, the data collection problem is established as a dynamic optimization problem subject to state constraints, in which both of the decision variables and constraints are infinite-dimensional in nature. The key idea of the solution method is to convert the infinite-dimensional dynamic program into a finite-dimensional static nonlinear problem. This is achieved by deriving the required gradients of the dynamic optimization problem based on the control parametrization scheme and an exact penalty function method. The effectiveness and superiority of the proposed design are validated via numerical experiments. © 1972-2012 IEEE.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

Optimal Evasion from a Sensing-Limited Pursuer

Optimal Evasion from a Sensing-Limited Pursuer

引用

American Control Conference (ACC)

作者： Dipankar Maity Alexander Von Moll Daigo Shishika Michael Dorothy Department of Electrical and Computer Engineering North Carolina Battery Complexity Autonomous Vehicle and Electrification Research Center (BATT CAVE) University of North Carolina Charlotte NC USA Air Force Research Laboratory WPAFB Control Science Center OH USA Army Research Directorate DEVCOM Army Research Laboratory APG MD USA

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

This paper investigates a partial-information pursuit evasion game in which the Pursuer has a limited-range sensor to detect the Evader. Given a fixed final time, we derive the optimal evasion strategy for the Evader to maximize its distance from the pursuer at the end. Our analysis reveals that in certain parametric regimes, the optimal Evasion strategy involves a ‘risky’ maneuver, where the Evader's trajectory comes extremely close to the pursuer's sensing boundary before moving behind the Pursuer. Additionally, we explore a special case in which the Pursuer can choose the final time. In this scenario, we determine a (Nash) equilibrium pair for both the final time and the evasion strategy.

关键词： Games Nash equilibrium Sensors Trajectory

来源：评论

学校读者我要写书评

暂无评论

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

arXiv

引用

arXiv 2025年

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China affiliated with the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510641 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025, CC0.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

RSRP Measurement Based Channel Autocorrelation Estimation for IRS-Aided Wideband Communication

RSRP Measurement Based Channel Autocorrelation Estimation fo...

引用

2025 IEEE Wireless Communications and Networking Conference, WCNC 2025

作者： Sun, He Zhu, Lipeng Mei, Weidong Zhang, Rui University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications 611731 China School of Science and Engineering Shenzhen Research Institute of Big Data China Chinese University of HongKong Guangdong Shenzhen518172 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore

ISBN: (纸本)9798350368369

The passive and frequency-flat reflection of IRS, as well as the high-dimensional IRS-reflected channels, have posed significant challenges for efficient IRS channel estimation, especially in wideband communication systems with significant multi-path channel delay spread. To address these challenges, we propose a novel neural network (NN)-empowered framework for IRS channel autocorrelation matrix estimation in wideband orthogonal frequency division multiplexing (OFDM) systems. This framework relies only on the easily accessible reference signal received power (RSRP) measurements at users in existing wideband communication systems, without requiring additional pilot transmission. Based on the estimates of channel autocorrelation matrix, the passive reflection of IRS is optimized to maximize the average user received signal-to-noise ratio (SNR) over all subcarriers in the OFDM system. Numerical results verify that the proposed algorithm significantly outperforms existing power-measurement-based IRS reflection designs in wideband channels. © 2025 IEEE.

关键词： Signaling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：