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

arXiv 2024年

作者： Zhang, Yifan Zhao, Xinkui Li, Ziying Yin, Jianwei Zhang, Lufei Chen, Zuoning School of Software Technology Zhejiang University Zhejiang Ningbo315048 China College of Computer Science and Technology Zhejiang University Zhejiang Hangzhou310058 China State Key Laboratory of Mathematical Engineering and Advanced Computing Jiangsu Wuxi214125 China Chinese Academy of Engineering Beijing100088 China

In the era of the Internet of Everything, operating systems (OSs) face unprecedented challenges posed by an evolving application landscape and increasingly heterogeneous hardware ecosystems. This shift toward increasingly dynamic and unpredictable operational contexts presents significant challenges for both OS developers and users. Against this backdrop, the fusion of Artificial Intelligence (AI) with Operating Systems emerges as a critical frontier for innovation. This survey delves into the intricate interplay between AI and OSs, illustrating how existing OS mechanisms combined with AI significantly elevate the performance, security, and efficiency of modern operating systems. We investigate a range of AI methodologies applied to optimize core OS functionalities and clarify the correlation to related studies. Our analysis touches on the existing hurdles and prospective avenues in this interdisciplinary domain, underscoring the imperative for robust and seamless integration of AI capabilities into OS architectures. Through an examination of illustrative case studies and cutting-edge developments, we offer a thorough review of the current status of AI-OS integration, accentuating its pivotal role in steering the evolution of advanced computing paradigms. We also envision the promising prospects of Intelligent Operating Systems, debating how groundbreaking OS designs will usher in novel possibilities and highlight the central role that AI will assume in propelling these next-generation systems forward. This forward-thinking outlook illuminates the profound influence of AI on the foundational elements of computing, heralding the advent of a new epoch characterized by intelligent, self-adapting, and highly adaptive software ecosystems. Copyright © 2024, The Authors. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A riemannian exponential augmented lagrangian method for computing the projection robust Wasserstein distance 23

A riemannian exponential augmented lagrangian method for com...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Bo Jiang Ya-Feng Liu Ministry of Education Key Laboratory of NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing China 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 Beijing China

Projection robust Wasserstein (PRW) distance is recently proposed to efficiently mitigate the curse of dimensionality in the classical Wasserstein distance. In this paper, by equivalently reformulating the computation of the PRW distance as an optimization problem over the Cartesian product of the Stiefel manifold and the Euclidean space with additional nonlinear inequality constraints, we propose a Riemannian exponential augmented Lagrangian method (REALM) for solving this problem. Compared with the existing Riemannian exponential penalty-based approaches, REALM can potentially avoid too small penalty parameters and exhibit more stable numerical performance. To solve the subproblems in REALM efficiently, we design an inexact Riemannian Barzilai-Borwein method with Sinkhorn iteration (iRBBS), which selects the stepsizes adaptively rather than tuning the step-sizes in efforts as done in the existing methods. We show that iRBBS can return an ε-stationary point of the original PRW distance problem within O(ε-3) iterations, which matches the best known iteration complexity result. Extensive numerical results demonstrate that our proposed methods outperform the state-of-the-art solvers for computing the PRW distance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

mathematical modeling of intelligent RGV simulation scheduling system based on simulated annealing algorithm

Mathematical modeling of intelligent RGV simulation scheduli...

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Benchao Yang Hongchuan Zhou Jiaqi Liu State Key Laboratory of Mathematical Engineering and advanced computing Information Engineering University Zhengzhou China

ISBN: (纸本)9781665438575

By establishing a mathematical model, the intelligent RGV scheduling scheme is optimized to design an efficient and stable intelligent RGV simulation scheduling system. This paper studies two different situations, including whether there is a fault in a process. Using the combination of high response ratio priority scheduling algorithm and simulated annealing algorithm, the process conditions including two or more process package faults are established, an intelligent RGV simulation scheduling algorithm based on simulated annealing is proposed, and the general intelligent RGV simulation scheduling system model is established. At the end of the paper, the failure of the two processes is also analyzed, and similar solutions can be given on the basis of this paper.

关键词： Annealing Scheduling algorithms Memory management Loading Simulated annealing Scheduling mathematical models

来源：评论

学校读者我要写书评

暂无评论

单原子在铝合金中的扩散迁移行为:可解释机器学习加速第一原理计算方法

引用

Science China Materials 2024年第4期67卷 1140-1149页

作者：黄敬涛薛景腾李明伟程源来忠红胡津周飞曲囡刘勇朱景川 School of Materials Science and Engineering Harbin Institute of TechnologyHarbin 150001China National Key Laboratory for Precision Hot Processing of Metals Harbin Institute of TechnologyHarbin 150001China National Key Laboratory of Science and Technology on Advanced Composites in SpecialEnvironments Harbin Institute of TechnologyHarbin 150001 China Center for Analysis Measurement and ComputingHarbin Institute of TechnologyHarbin 150001China State Key Laboratory for Environment-friendly Energy Materials School of Materials Science and EngineringSouthwest University of Science and TechnologyMianyang 621010China

本文采用机器学习加速第一原理计算的方法,研究了铝基体中单原子的扩散迁移行为.建立铝基体中三十多种单原子扩散迁移行为的小样本数据集,以原子半径、离子半径和第一电离能等固有参数作为输入特征值,合金原子与空位之间的相互作用能以... 详细信息

本文采用机器学习加速第一原理计算的方法,研究了铝基体中单原子的扩散迁移行为.建立铝基体中三十多种单原子扩散迁移行为的小样本数据集,以原子半径、离子半径和第一电离能等固有参数作为输入特征值,合金原子与空位之间的相互作用能以及合金原子在铝基体中的扩散势垒作为输出参数.通过相关性分析初步确定描述符与预测目标之间的关系,并利用递归特征消除法确定不同目标的输入特征和描述符数量.通过交叉验证证明所选模型的先进性,并进行微调以优化其性能.为了验证其效率和准确性,CatBoost模型经过了传统算法的严格测试.利用训练有素的模型预测周期表中其他单原子在铝基体中的扩散迁移行为.机器学习加速第一原理计算的结果可为进一步开发新型铝合金提供理论依据.

关键词：机器学习扩散迁移交叉验证输出参数单原子第一原理计算原子半径小样本数据

来源：评论

学校读者我要写书评

暂无评论

Path planning of UAV base station based on deep reinforcement learning

引用

Procedia Computer Science 2022年 202卷 89-104页

作者： Siming Yang Zheng Shan Jiang Cao Yuan Gao Yang Guo Ping Wang Xiaonan Wang Jing Wang Tingting Zhang Jiayu Guo State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan 450001 China Academy of Military Science of the PLA Beijing 100091 China Network Technology Research Center of the PLA Beijing 100090 China

UAV base station platform has become the current research hotspot of assisting ground base station for wireless *** present, the most important issue is how to make path planning to provide the stable communication guarantee for multiple mobile users. In this article, we model the air-to-ground channel to describe the path loss between the UAV platform and the user and build a simulation environment for training based on the OpenAI-GYM architecture. In addition, this paper proposes a reinforcement learning algorithm based on intrinsic rewards, which uses the mean square error of the state prediction results to quantify the novelty of the state. Algorithms enable agents to efficiently carry out strategy iterations. Experiments results showed that our algorithm has a higher score and takes less time.

关键词： UAV path planning Wireless communication coverage Deep learning Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

THE Furnace temperature curve based on one-dimensional unsteady heat conduction model

THE Furnace temperature curve based on one-dimensional unste...

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Jiaqi Liu Hongchuan Zhou Benchao Yang State Key Laboratory of Mathematical Engineering and advanced computing Information Engineering University Zhengzhou China

ISBN: (纸本)9781665438575

This paper mainly studies the change rule of center temperature of welding zone in backwelding furnace under different set temperature and transfer rate conditions, and searches for appropriate temperature and rate to obtain the optimal furnace temperature curve. Different infinite length plate models were established for the small temperature region and interval respectively, and the heat transfer of each part was considered according to Fourier heat law and Newton cooling law, and the equation about the temperature change with time was constructed based on the law of energy conservation.

关键词： Heating systems Semiconductor device modeling Temperature Cooling Furnaces Computational modeling Welding

来源：评论

学校读者我要写书评

暂无评论

Semivortex solitons and their excited states in spin-orbit-coupled binary bosonic condensates

引用

Physical Review E 2024年第6期109卷 064201-064201页

作者： Haiming Deng Jinqing Li Zhaopin Chen Yaohui Liu Dong Liu Chunzhi Jiang Chao Kong Boris A. Malomed School of Physics and Electronic-Electrical Engineering Microelectronics and Optoelectronics Technology Key Laboratory of Hunan Higher Education Hunan Engineering Research Center of Advanced Embedded Computing and Intelligent Medical Systems Physics Department and Solid-State Institute Department of Physical Electronics School of Electrical Engineering Faculty of Engineering Instituto de Alta Investigación

It is known that two-dimensional two-component fundamental solitons of the semivortex (SV) type, with vorticities (s+,s−)=(0,1) in their components, are stable ground states (GSs) in the spin-orbit-coupled (SOC) binary Bose-Einstein condensate with the contact self-attraction acting in both components, in spite of the possibility of the critical collapse in the system. However, excited states (ESs) of the SV solitons, with the vorticity set (s+,s−)=(S+,S++1) and S+=1,2,3,..., are unstable in the same system. We construct ESs of SV solitons in the SOC system with opposite signs of the self-interaction in the two components. The main finding is stability of the ES-SV solitons, with the extra vorticity (at least) up to S+=6. The threshold value of the norm for the onset of the critical collapse, Nthr, in these excited states is higher than the commonly known critical value, Nc≈5.85, associated with the single-component Townes solitons, Nthr increasing with the growth of S+. A velocity interval for stable motion of the GS-SV solitons is found too. The results suggest a solution for the challenging problem of the creation of stable vortex solitons with high topological charges.

关键词： Solitons

来源：评论

学校读者我要写书评

暂无评论

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection against Multipath Routing

引用

IEEE Journal on Selected Areas in Communications 2025年第6期43卷 2155-2171页

作者： Zhao, Ziming Li, Zhaoxuan Xie, Xiaofei Liu, Zhipeng Li, Tingting Yu, Jiongchi Zhang, Fan Chen, Binbin School of Software Technology Zhejiang University Ningbo315100 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China ZJU-Hangzhou Global Scientific and Technological Innovation Center 311200 China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province 310027 China Jiaxing Research Institute Zhejiang University 314000 China Zhengzhou Xinda Institute of Advanced Technology Zhengzhou450001 China Singapore State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security UCAS Beijing100049 China School of Computing and Information Systems Singapore Management University Singapore188065 Singapore Advanced Digital Sciences Center Singapore138632 Singapore Singapore University of Technology and Design SingaporeB96049 Singapore

With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multi-path routing phenomenon that exists in practice. In this paper, we reveal practical challenges in the context of enabling line-speed model inference in the network dataplane. Furthermore, we propose FCPlane, the forwarding and computing integrated dataplane for zero-trust intrusion detection that aims to enable efficient load balancing while providing reliable traffic analysis results, even against multipath routing. The core idea is to reconcile forwarding and computation to the flowlet level, for which a tailor-made Markov chain model is designed. Based on two public traffic datasets, we evaluate seven state-of-the-art in-network traffic analysis models deployed in four types of topologies (three with multipath routing and one without) to explore performance impact and demonstrate the effectiveness of our proposal. © 1983-2012 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

ODCP: Optimizing Data Caching and Placement in Distributed File System Using Erasure Coding 17th

ODCP: Optimizing Data Caching and Placement in Distributed F...

引用

17th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2020

作者： Wu, Shuhan Li, Yunchun Yang, Hailong Luan, Zerong Li, Wei School of Computer Science and Engineering Beihang University Beijing100191 China College of Life Sciences and Bioengineering Beijing University of Technology Beijing100083 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi214125 China

ISBN: (纸本)9783030794774

Many current distributed file systems use erasure-coding based data redundancy techniques to improve the reliability of data storage. Such techniques can significantly improve the effective storage utilization. However, there are several drawbacks to the above techniques. Firstly, they introduce non-negligible computation overhead for decoding. Secondly, traditional data caching and placement strategies become less effective in such cases. To solve the above drawbacks, this paper proposes a new data cache allocation mechanism based on simulated annealing and a new data placement strategy based on convex optimization, which effectively reduces data block transmission delay and decoding delay. We have implemented the proposed data placement strategy in the real-world distributed file system Alluxio, and evaluated the performance of our strategy. Experiment results show that our strategy can significantly reduce the file read delay compared to traditional data placement strategies. © 2021, IFIP International Federation for Information Processing.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Spreading Dynamics of Random Walks in Complex Networks 8

Spreading Dynamics of Random Walks in Complex Networks

引用

8th International Conference on Information Technology: IoT and Smart City, ICIT 2020

作者： Hao, Yaohui Liu, Hongbo Sun, Jiajia Gao, Liwei Information Engineering University Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China

ISBN: (纸本)9781450388559

The study of spreading dynamics is an important foundation to analyze the spread of viruses orrumors. The general method of analyzing spreading dynamics is based on model, such as SI model, SISmodel, SIR model,ect. However, the spreading dynamics in the network is affected by many factors and represents some randomicity. So, in this paper, we propose Random Walks(RW) spreading model for opinions to illustrate the spreading behavior in networks, for instance, the random networks and BA scale-free networks. With MonteCarlo simulation method, the results show that the spreading speed of BA scale-free network is more quickly than that of ER random network, when the spreading probability β is small. But, with the increase of β, the spreading speed of ER random network increases gradually and exceeds that of BA scale-free network. © 2020 ACM.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：