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

The Journal of Machine Learning Research 2022年第1期23卷 3302-3336页

作者： Madeline Navarro Yuhao Wang Antonio G. Marques Caroline Uhler Santiago Segarra Department of Electrical and Computer Engineering Rice University Houston TX Institute for Interdisciplinary Information Sciences Tsinghua University and Shanghai Qi Zhi Institute Haidian District Beijing China Department of Signal Theory and Communications King Juan Carlos University Madrid Spain Department of Electrical Engineering & Computer Science Department of Institute for Data Systems and Society Massachusetts Institute of Technology Cambridge MA

Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph, we study the problem of jointly inferring multiple graphs from the observation of signals at their nodes (graph signals), which are assumed to be stationary in the sought graphs. Graph stationarity implies that the mapping between the covariance of the signals and the sparse matrix representing the underlying graph is given by a matrix polynomial. A prominent example is that of Markov random fields, where the inverse of the covariance yields the sparse matrix of interest. From a modeling perspective, stationary graph signals can be used to model linear network processes evolving on a set of (not necessarily known) networks. Leveraging that matrix polynomials commute, a convex optimization method along with sufficient conditions that guarantee the recovery of the true graphs are provided when perfect covariance information is available. Particularly important from an empirical viewpoint, we provide high-probability bounds on the recovery error as a function of the number of signals observed and other key problem parameters. Numerical experiments demonstrate the effectiveness of the proposed method with perfect covariance information as well as its robustness in the noisy regime.

关键词： network topology inference graph signal processing spectral graph theory multi-layer graphs network diffusion processes

来源：评论

学校读者我要写书评

暂无评论

Agile Meets Quantum: A Novel Genetic Algorithm Model for Predicting the Success of Quantum Software Development Project

arXiv

引用

arXiv 2024年

作者： Khan, Arif Ali Akbar, Muhammad Azeem Lahtinen, Valtteri Paavola, Marko Niazi, Mahmood Alatawi, Mohammed Naif Alotaibi, Shoayee Dlaim M3S Empirical Software Engineering Research Unit University of Oulu Oulu90014 Finland Software Engineering Department Lappeenranta-Lahti University of Technology Lappeenranta53851 Finland Quanscient Oy Tampere Finland VTT Technical Research Ctr of Finland Ltd Oulu Finland Department of Information and Computer Science King Fahd University of Petroleum and Minerals Saudi Arabia Interdisciplinary Research Centre for Intelligent Secure Systems King Fahd University of Petroleum and Minerals Saudi Arabia Information Technology Department Faculty of Computers and Information Technology University of Tabuk Saudi Arabia Department of Artificial Intelligence and Data Science College of Computer Science and Engineering University of Hail Hail Saudi Arabia

Context: Quantum software systems represent a new realm in software engineering, utilizing quantum bits (Qubits) and quantum gates (Qgates) to solve the complex problems more efficiently than classical counterparts. Agile software development approaches are considered to address many inherent challenges in quantum software development, but their effective integration remains unexplored. Objective: This study investigates key causes of challenges that could hinders the adoption of traditional agile approaches in quantum software projects and develop an Agile-Quantum Software Project Success Prediction Model (AQSSPM). Methodology: Firstly, we identified 19 causes of challenging factors discussed in our previous study, which are potentially impacting agile-quantum project success. Secondly, a survey was conducted to collect expert opinions on these causes and applied Genetic Algorithm (GA) with Naive Bayes Classifier (NBC) and Logistic Regression (LR) to develop the AQSSPM. Results: Utilizing GA with NBC, project success probability improved from 53.17% to 99.68%, with cost reductions from 0.463% to 0.403%. Similarly, GA with LR increased success rates from 55.52% to 98.99%, and costs decreased from 0.496% to 0.409% after 100 iterations. Both methods result showed a strong positive correlation (rs=0.955) in causes ranking, with no significant difference between them (t=1.195, p=0.240>0.05). Conclusion: The AQSSPM highlights critical focus areas for efficiently and successfully implementing agile-quantum projects considering the cost factor of a particular project. © 2024, CC BY.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Recording Architecture for Three-Dimensional Magnetic Recording

arXiv

引用

arXiv 2025年

作者： Jian, Yugen Luo, Ke Chen, Jincai Fong, Xuanyao Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore School of Computer of Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan430074 China

Three-dimensional magnetic recording (3DMR) is a highly promising approach to achieving ultra-large data storage capacity in hard disk drives. One of the greatest challenges for 3DMR lies in performing sequential and correct writing of bits into the multi-layer recording medium. In this work, we have proposed a hierarchical recording architecture based on layered heat-assisted writing with a multi-head array. The feasibility of the architecture is validated in a dual-layer 3DMR system with FePt-based thin films via micromagnetic simulation. Our results reveal the magnetization reversal mechanism of the grains, ultimately attaining appreciable switching probability and medium signal-to-noise ratio (SNR) for each layer. In particular, an optimal head-to-head distance is identified as the one that maximizes the medium SNR. Optimizing the system’s noise resistance will improve the overall SNR and allow for a smaller optimal head-to-head distance, which can pave the way for scaling 3DMR to more recording layers. Copyright © 2025, The Authors. All rights reserved.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

Countering Eavesdroppers with Meta-learning-based Cooperative Ambient Backscatter Communications

arXiv

引用

arXiv 2023年

作者： Chu, Nam H. Van Huynh, Nguyen Nguyen, Diep N. Hoang, Dinh Thai Gong, Shimin Shu, Tao Dutkiewicz, Eryk Phan, Khoa T. School of Electrical and Data Engineering University of Technology Sydney Australia School of Computing Engineering and the Built Environment Edinburgh Napier University Edinburgh United Kingdom School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou China Department of Computer Science and Software Engineering Auburn University AuburnAL36849 United States School of Engineering and Mathematical Sciences Department of Computer Science and Information Technology La Trobe University Melbourne Australia

This article introduces a novel lightweight framework using ambient backscattering communications to counter eavesdroppers. In particular, our framework divides an original message into two parts. The first part, i.e., the active-transmit message, is transmitted by the transmitter using conventional RF signals. Simultaneously, the second part, i.e., the backscatter message, is transmitted by an ambient backscatter tag that backscatters upon the active signals emitted by the transmitter. Notably, the backscatter tag does not generate its own signal, making it difficult for an eavesdropper to detect the backscattered signals unless they have prior knowledge of the system. Here, we assume that without decoding/knowing the backscatter message, the eavesdropper is unable to decode the original message. Even in scenarios where the eavesdropper can capture both messages, reconstructing the original message is a complex task without understanding the intricacies of the message-splitting mechanism. A challenge in our proposed framework is to effectively decode the backscattered signals at the receiver, often accomplished using the maximum likelihood (MLK) approach. However, such a method may require a complex mathematical model together with perfect channel state information (CSI). To address this issue, we develop a novel deep meta-learning-based signal detector that can not only effectively decode the weak backscattered signals without requiring perfect CSI but also quickly adapt to a new wireless environment with very little knowledge. Simulation results show that our proposed learning approach, without requiring perfect CSI and complex mathematical model, can achieve a bit error ratio close to that of the MLK-based approach. They also clearly show the efficiency of the proposed approach in dealing with eavesdropping attacks and the lack of training data for deep learning models in practical scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

A Study of Robustness of a Closed-Loop System for Blood Pressure Control

A Study of Robustness of a Closed-Loop System for Blood Pres...

引用

American Control Conference (ACC)

作者： Taylor E. Baum Bharadwaj Satchidanandan Munther A. Dahleh Emery N. Brown Electrical Engineering and Computer Science Department Massachusetts Institute of Technology MA USA Department of Electrical Engineering and Computer Science The Laboratory for Information & Decision Systems The Institute for Data Systems and Society at the Massachusetts Institute of Technology MA USA Department of Anesthesia Critical Care and Pain Medicine The Massachusetts General Hospital MA USA The Picower Institute for Learning and Memory The Massachusetts Institute of Technology MA USA The Division of Sleep Medicine Harvard Medical School MA USA

Wide variability of patient response to vasoactive drugs, and mechanical limits of infusion pumps lead to difficulties in achieving robust Closed-Loop Blood Pressure Control (CLBPC). Our goal is to refine a previously proposed CLBPC system which emphasizes the incorporation of mechanistic cardiovascular models, design simple Model Predictive Control (MPC) and Proportional-Integral-Derivative (PID) controllers, and assess their robustness to estimation errors in physiological parameters of patients that are expected to vary widely within a patient population. A pharmacokinetic-pharmacodynamic (PK-PD) model that quantifies the impact of drugs, phenylephrine and nicardipine, on a patient’s blood pressure is provided. A state space model is then formulated which incorporates the full dynamics of a patient’s blood pressure. We then implement MPC and PID control to simulate regulation of blood pressure and explore the robustness of such controllers to errors in estimates of patient physiological parameters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two dimensional quantum central limit theorem by quantum walks

arXiv

引用

arXiv 2024年

作者： Asahara, Keisuke Funakawa, Daiju Seki, Motoki Suzuki, Akito Data Science and AI Innovation Research Center Shiga University 1-1-1 Banba hikone Shiga522-8522 Japan Department of Electronics and Information Engineering Hokkai-Gakuen University Hokkaido Sapporo062-8605 Japan Department of Mathematics Faculty of Science Hokkaido University Sapporo060-0810 Japan Department of Production Systems Engineering and Sciences Komatsu University Awazu Campus Nu 1-3 Shicho-machi Ishikawa Komatsu923-8511 Japan

Quantum walks, mathematical models referred to as the quantum counterparts of random walks, have garnered significant attention in recent years with the advancement of quantum computing. The weak limit theorem for quantum walks, analogous to the central limit theorem for random walks, is one of the most important theorems in this field. In this study, we investigated the weak limit theorem for a two-state discrete-time quantum walk on a two-dimensional square lattice. As a result, we derived a two-dimensional probability distribution whose support is the intersection of two ellipses. The probability distribution we obtained resembles the distribution of one-dimensional quantum walks while possessing a unique form specific to two dimensions. © 2024, CC BY-NC-ND.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency

arXiv

引用

arXiv 2023年

作者： Mou, Wenlong Ding, Peng Wainwright, Martin J. Bartlett, Peter L. Department of Electrical Engineering and Computer Sciences United States Department of Statistics UC Berkeley United States Laboratory for Information and Decision Systems EECS and Mathematics Massachusetts Institute of Technology United States Statistics and Data Science Center EECS and Mathematics Massachusetts Institute of Technology United States Google Research United States

We study optimal procedures for estimating a linear functional based on observational data. In many problems of this kind, a widely used assumption is strict overlap, i.e., uniform boundedness of the importance ratio, which measures how well the observational data covers the directions of interest. When it is violated, the classical semi-parametric efficiency bound can easily become infinite, so that the instance-optimal risk depends on the function class used to model the regression function. For any convex and symmetric function class F, we derive a non-asymptotic local minimax bound on the mean-squared error in estimating a broad class of linear functionals. This lower bound refines the classical semi-parametric one, and makes connections to moduli of continuity in functional estimation. When F is a reproducing kernel Hilbert space, we prove that this lower bound can be achieved up to a constant factor by analyzing a computationally simple regression estimator. We apply our general results to various families of examples, thereby uncovering a spectrum of rates that interpolate between the classical theories of semi-parametric efficiency (with √n-consistency) and the slower minimax rates associated with non-parametric function estimation. Copyright © 2023, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An Improved Honey Badger Algorithm for Electric Vehicle Charge Orderly Planning

Journal of Network Intelligence

引用

Journal of Network Intelligence 2022年第2期7卷 332-346页

作者： Chen, Ran-Fan Luo, Hao Huang, Kuan-Chun Nguyen, Trong-The Pan, Jeng-Shyang College of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China School of Aeronautics and Astronautics Zhejiang University HangZhou310000 China Department of Industrial and Systems Engineering Chung Yuan University Taoyuan320-33 Taiwan Multimedia Communications Lab VNUHCM-University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

Multiple electric vehicles simultaneously connected to a distribution load network will significantly impact the stability of the power grid. This paper proposes an improved Honey-badger algorithm (IHBA) through elite reverse learning, spiral update, and wild dog survival strategies to optimize the orderly charging of electric vehicles (EV). Objective functions of EV charge orderly planning are taken by using load fluctuation satisfaction, user cost satisfaction, and user convenience satisfaction to achieve the high efficiency of orderly charging. The benchmark test function and the electric vehicle se-quential charging problem were employed to evaluate the proposed IHBA approach. The obtained results are compared with the other algorithms in the literature, which indicate that the IHBA algorithm does not only provides more accurate outcome but better con-vergence speed than the other competitors. © 2022;Taiwan Ubiquitous information CO LTD. All rights reserved.

关键词： Food products

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Unmanned Vehicle Swarms: Challenges, Applications and Opportunities

arXiv

引用

arXiv 2024年

作者： Liu, Guangyuan Van Huynh, Nguyen Du, Hongyang Hoang, Dinh Thai Niyato, Dusit Zhu, Kun Kang, Jiawen Xiong, Zehui Jamalipour, Abbas In Kim, Dong The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The Department of Electrical Engineering and Electronics University of Liverpool Liverpool L69 3GJ United Kingdom The School of Electrical and Data Engineering University of Technology Sydney Australia The School of Computer Science and Engineering Nanyang Technological University Singapore College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The School of Electrical and Information Engineering University of Sydney Australia The College of Information and Communication Engineering Sungkyunkwan University Korea Republic of

With recent advances in artificial intelligence (AI) and robotics, unmanned vehicle swarms have received great attention from both academia and industry due to their potential to provide services that are difficult and dangerous to perform by humans. However, learning and coordinating movements and actions for a large number of unmanned vehicles in complex and dynamic environments introduce significant challenges to conventional AI methods. Generative AI (GAI), with its capabilities in complex data feature extraction, transformation, and enhancement, offers great potential in solving these challenges of unmanned vehicle swarms. For that, this paper aims to provide a comprehensive survey on applications, challenges, and opportunities of GAI in unmanned vehicle swarms. Specifically, we first present an overview of unmanned vehicles and unmanned vehicle swarms as well as their use cases and existing issues. Then, an in-depth background of various GAI techniques together with their capabilities in enhancing unmanned vehicle swarms are provided. After that, we present a comprehensive review on the applications and challenges of GAI in unmanned vehicle swarms with various insights and discussions. Finally, we highlight open issues of GAI in unmanned vehicle swarms and discuss potential research directions. © 2024, CC BY.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Optimized Security Mechanism for publicly Secret Key Sharing over Cloud using Blockchain

Optimized Security Mechanism for publicly Secret Key Sharing...

引用

2024 International Symposium on Securing Next Generation systems Using Future Artificial Intelligence Technologies, SNSFAIT 2024

作者： Byeon, Haewon Quraishi, Aadam Thuniki, Praveen Keshta, Ismail Soni, Mukesh Shabaz, Mohammad Department of AI and Software Inje University Gimhae50834 Korea Republic of Inje University Medical Big Data Research Center Gimhae50834 Korea Republic of Intervention Treatment Institute HoustonTX United States Sr Program Analyst Georgia CummingGA30040 United States Computer Science and Information Systems Department College of Applied Sciences Al Maarefa University Riyadh Saudi Arabia Dr. D. Y. Patii Vidyapeeth Pune Dr. D. Y. Patii School of Science & Technology Tathawade Pune India Model Institute of Engineering and Technology J&K Jammu India

A publicly verifiable key sharing mechanism based on threshold key sharing is provided to explore the security of users' private keys on the blockchain. Participating nodes check the key fragment after receiving it, effectively preventing it from being abused. The crucial sections of the nodes that participated in the critical splicing are made public during the critical recovery stage to prevent them from performing harmful things during the critical recovery stage. Add IDs to the nodes that participated in the crucial splicing during the key distribution stage;a dynamic threshold system is intended to track and update the status of malicious nodes in real time. When the node that possesses the crucial component fails, the owner of the critical component and the main node relocate a key element to the new participating nodes. To safeguard sensitive information. The experimental results show that this system has a key recovery rate of 80% and threshold qualities such as traceability, enforceability, and recoverability. © 2024 Copyright for this paper by its authors.

关键词： Blockchain Encryption Key sharing mechanism Privacy Secret key Security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：