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

High-speed and low-power molecular dynamics processing unit(MDPU)with ab initio accuracy

npj Computational Materials 2024年第1期10卷 559-568页

作者： Pinghui Mo Yujia Zhang Zhuoying Zhao Hanhan Sun Junhua Li Dawei Guan Xi Ding Xin Zhang Bo Chen Mengchao Shi Duo Zhang Denghui Lu Yinan Wang Jianxing Huang Fei Liu Xinyu Li Mohan Chen Jun Cheng Bin Liang Weinan E Jiayu Dai Linfeng Zhang Han Wang Jie Liu College of Integrated Circuits Hunan UniversityChangsha410082P.R.China College of Electrical and Information Engineering Hunan UniversityChangsha410082P.R.China College of Computer National University of Defense TechnologyChangsha410073P.R.China Department of Physics National University of Defense TechnologyChangsha410073P.R.China DP Technology 100080 BeijingP.R.China AI for Science Institute 100080 BeijingP.R.China Academy for Advanced Interdisciplinary Studies Peking University100871 BeijingP.R.China HEDPS CAPTCollege of EngineeringPeking University100871 BeijingP.R.China School of Mathematical Science Peking University100871 BeijingP.R.China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEMCollege of Chemistry and Chemical EngineeringXiamen UniversityXiamen361005P.R.China School of Integrated Circuits Peking University100871 BeijingP.R.China Center for Machine Learning Research Peking University100871 BeijingP.R.China Institute of Applied Physics and Computational Mathematics 100088 BeijingP.R.China Greater Bay Area Institute for Innovation Hunan UniversityGuangzhou511300P.R.China Department of Electrical and Computer Engineering University of WashingtonSeattleWA98195USA

Molecular dynamics(MD)is an indispensable atomistic-scale computational tool widely-used in various *** the past decades,nearly all ab initio MD and machine-learning MD have been based on the general-purpose central/graphics processing units(CPU/GPU),which are well-known to suffer from their intrinsic“memory wall”and“power wall”***,nowadays MD calculations with ab initio accuracy are extremely time-consuming and power-consuming,imposing serious restrictions on the MD simulation size and *** solve this problem,here we propose a special-purpose MD processing unit(MDPU),which could reduce MD time and power consumption by about 103 times(109 times)compared to state-of-the-art machine-learningMD(ab initio MD)based on CPU/GPU,while keeping ab initio *** significantly-enhanced performance,the proposed MDPU may pave a way for the accurate atomistic-scale analysis of large-size and/or longduration problems which were impossible/impractical to compute before.

关键词： consuming power MDP

来源：评论

学校读者我要写书评

暂无评论

Geometric Spanning Trees Minimizing the Wiener Index

arXiv

引用

arXiv 2023年

作者： Abu-Affash, A. Karim Carmi, Paz Luwisch, Ori Mitchell, Joseph S.B. Department of Software Engineering Shamoon College of Engineering Israel Computer Science Department Ben-Gurion University Israel Department of Applied Mathematics and Statistics Stony Brook University United States

The Wiener index of a network, introduced by the chemist Harry Wiener [30], is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule, is considered to be a fundamental and useful network descriptor. We study the problem of constructing geometric networks on point sets in Euclidean space that minimize the Wiener index: given a set P of n points in d, the goal is to construct a network, spanning P and satisfying certain constraints, that minimizes the Wiener index among the allowable class of spanning networks. In this work, we focus mainly on spanning networks that are trees and we focus on problems in the plane (d = 2). We show that any spanning tree that minimizes the Wiener index has non-crossing edges in the plane. Then, we use this fact to devise an O(n4)-time algorithm that constructs a spanning tree of minimum Wiener index for points in convex position. We also prove that the problem of computing a spanning tree on P whose Wiener index is at most W, while having total (Euclidean) weight at most B, is NP-hard. Computing a tree that minimizes the Wiener index has been studied in the area of communication networks, where it is known as the optimum communication spanning tree problem. © 2023, CC0.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria Radio Frequency Identification Approach for Manufacturing Company Selection Based on Partitioned Maclaurin Symmetric Mean Operators Under Complex Intuitionistic Fuzzy Set Environment

引用

International Journal of Fuzzy Systems 2024年第5期26卷 1730-1748页

作者： Azam, Muhammad Jana, Chiranjibe Khan, Muhammad Sajjad Ali Pal, Madhumangal Xin, Qin Yang, Shilin Sarkar, Biswajit Faculty of Science Beijing University of Technology Beijing100022 China Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore721102 India Department of Mathematics Khushal Khan Khattak University Karak Khyber Pakhtunkhwa Karak27200 Pakistan Faculty of Science and Technology University of the Faroe Islands Tórshavn Faroe Islands Department of Industrial Engineering Yonsei University 50 Yonsei-ro Sinchon-dong Seodaemun-gu Seoul03722 Korea Republic of Center for Global Health Research Saveetha Medical College Saveetha Institute of Medical and Technical Sciences Saveetha University Tamil Nadu 600077 Chennai India Department of Industrial Engineering and Management National Taipei University of Technology Taipei City 106344 Taiwan Chennai602105 India

The theory of intuitionistic fuzzy sets (IFSs) plays an essential role to deal with uncertainty and ambiguity. However, the IFSs deal only with anticipation, not periodicity. But, complex IFSs (CIFS) can handle both uncertainties and periodicity at a time. Therefore, this paper focuses on a new multi-criteria decision making (MCDM) approach using Maclaurin symmetric mean (MSM) operator in connection with the CIFS setting. Then, we develop some CIF partitioned based MSM (CIFPMSM) operators and their weighted form by considering that all the criteria can be arranged into some groups. The proposed operators not only deal with the interrelationship among criteria but also deal with the partitioned relationship among criteria. We discuss the properties of these proposed operators and investigate their cases. Finally, a decision-making approach for radio frequency identification (RFID) for manufacturing companies is developed based on the proposed operators and compared the results with the existing method to show the application and feasibility of the proposed method. © The Author(s) under exclusive licence to Taiwan Fuzzy Systems Association 2024.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Approach for Handling UAV in Crowded Environment Using Deep Q-Networks

A Dynamic Approach for Handling UAV in Crowded Environment U...

引用

Global Conference for Advancement in Technology (GCAT)

作者： Yash Upadhyay Muskan Gahlawat S. Nivetha Saurabh Rana B Natarajan Pratik Gupta Department of Computer Science and Engineering (AIE) Amrita School of Computing Amrita Vishwa Vidyapeetham Chennai India Department of Computer Science and Engineering RVS College of Engineering & Technology Coimbatore Department of Mathematics Chandigarh University Department of Computer Science and Engineering (AIE) Amrita Vishwa Vidyapeetham Chennai India Department of Applied Mathematics Gautam Buddha University Noida

The demand for wireless connections is rising, and the advent of mobile internet has sparked a hunt for fresh, creative ways to expand the capacity and reach of cellular networks. One strategy to provide ground mobile users with long-term communication coverage is to employ Unmanned Aerial vehicles (UAV) as mobile base stations. The proposed method incorporates a Deep Reinforcement Learning (DRL) method to address the challenges that persist with traditional approaches. We introduced Deep Q-Learning with an attention mechanism-based multi-agent model to develop an energy-efficient control system for UAVs in cellular networks. Due to the proposed strategy’s dynamic nature, it efficiently handles the crowded environment by resolving scalability and mobility issues. The researchers evaluated the proposed model using the benchmark dataset, producing promising results. Further, the researchers tested the proposed model using the sum rate metric to analyze the capability of the proposed algorithm to provide a reasonable throughput rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Business Process Automation using Robotic Process Automation (RPA) and AI Algorithm's on Various Tasks 8

Business Process Automation using Robotic Process Automation...

引用

8th International Conference on Communication and Electronics Systems, ICCES 2023

作者： Dandale, M.N. Mazharunnisa Daniel, D. J. Joel Devadass Priya, R. Sathya Walid, Md. Abul Ala Thulasimani, T. Yeshwantrao Chavan College of Engineering Applied Mathematics and Humanities Maharashtra Nagpur India Koneru Lakshmaiya Educational Foundation Kl University Kl Business School Vijayawada Andhra Pradesh Vaddeswaram India VelTech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Electronics and Communication Engineering Tamilnadu Chennai India Knowledge Institute of Technology Department of Cse Tamilnadu Salem India Department of Computer Science and Engineering Bangladesh Bannari Amman Institute of Technology Mathematics Tamilnadu Erode India

ISBN: (纸本)9798350396638

Robotic Process Automation (RPA) bots automate mundane, rules-based operations, allowing workers more time to focus on high-level, strategic projects. Meanwhile, AI be used to analyze data and spot trends, resulting in better choices and increased productivity for enterprises. Previous researches are less efficient, slowly working algorithms when classification is performed in a large set of databases. The existing methods could be doing better while comparing the error factors, and in the cross-verification process, they have made inappropriate results, leading to wrong classifications. Robotic Process Automation (RPA) bots automate mundane, rules-based operations, allowing workers more time to focus on high-level, strategic projects. Meanwhile, AI be used to analyze data and spot trends, resulting in better choices and increased productivity for enterprises. Previous research on email automation and invoice process automation have needed to improve classification model efficiency and they have less efficient, slowly working algorithms when doing classification in a large set of databases. In this work, the Random Forest algorithm is used for classification, and the Quest method is used to segment texts in emails and invoices, both of which can be automated more effectively. The results of existing categorization algorithms have been less than ideal, especially when used to huge datasets, and are often completely inaccurate. The suggested method outperforms previous ML/AI approaches because it produces highly accurate outcomes with little resource investment. There are a number of benefits to utilizing RPA with AI, such as cost reduction, increased output, and streamlined operations. The advantages of this automation, challenges that must be met, and potential answers to those questions are discussed in this study. © 2023 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Image Encryption Algorithm Based on New Fractional Beta Chaotic Maps

引用

computer Modeling in engineering & Sciences 2022年第7期132卷 119-131页

作者： Rabha W.Ibrahim Hayder Natiq Ahmed Alkhayyat Alaa Kadhim Farhan Nadia M.G.Al-Saidi Dumitru Baleanu Institute of Electrical and Electronics Engineers Kuala Lumpur59200Malaysia Information Technology College Imam Ja’afar Al-Sadiq UniversityBaghdad10001Iraq Department of Computer Technical Engineering College of Technical EngineeringIslamic UniversityNajaf192122Iraq Department of Computer Sciences University of TechnologyBaghdad10066Iraq Department of Applied Sciences University of TechnologyBaghdad10066Iraq Department of Mathematics Cankaya UniversityBalgatAnkara06530Turkey Institute of Space Sciences Magurele-BucharestR76900Romania Department of Medical Research China Medical UniversityTaichung40402Taiwan

In this study,a new algorithm of fractional beta chaotic maps is proposed to generate chaotic sequences for image *** proposed technique generates multi random sequences by shuffling the image pixel *** technique is used to blur the pixels connecting the input and encrypted images and to increase the attack *** proposed algorithm makes the encryption process sophisticated by using fractional chaotic maps,which hold the properties of *** fractional beta sequences are utilized to alter the image pixels to decryption *** experimental results proved that the proposed image encryption algorithm successfully encrypted and decrypted the images with the same *** output findings indicate that our proposed algorithm has good entropy and low correlation *** translates to enhanced security against different attacks.A MATLAB programming tool was used to implement and assess the image quality measures.A comparison with other image encryption techniques regarding the visual inspection and signal-to-noise ratio is provided.

关键词： Fractional calculus fractional beta function chaotic function image encryption

来源：评论

学校读者我要写书评

暂无评论

Multisequences with High Joint Nonlinear Complexity from Function Fields

Multisequences with High Joint Nonlinear Complexity from Fun...

引用

2022 International Conference on Electronic Information engineering and computer Science, EIECS 2022

作者： Yan, Yang Wang, Qiuyan Wu, Chenghuang Zhao, Chun'e Liu, Lin School of Information Technology and Engineering Tianjin University of Technology and Education Tianjin China School of Computer Science and Technology Tiangong University Tianjin China Provincial Key Laboratory of Applied Mathematics Putian University Fujian Putian China College of Science University of Petroleum Shandong Qingdao China Tianjin LINHAITEC Ltd Tianjin China

ISBN: (纸本)9781510663312

Multisequences over finite fields play an important role in applications that related to parallelization, such as word-based stream ciphers and pseudorandom vector generators. It is interesting to study complexity measures for multisequences. In this paper, we propose three constructions of multisequences over finite fields from rational function fields and Hermitian function fields. We also analyze the joint nonlinear complexity of these multisequences. Moreover, the length and dimension of these multisequences are flexible. © 2023 SPIE.

关键词： Rational functions

来源：评论

学校读者我要写书评

暂无评论

Shallow Recurrent Decoder for Reduced Order Modeling of Plasma Dynamics

arXiv

引用

arXiv 2024年

作者： Kutz, J. Nathan Reza, Maryam Faraji, Farbod Knoll, Aaron Department of Applied Mathematics and Electrical and Computer Engineering University of Washington SeattleWA98195 United States Imperial Plasma Propulsion Laboratory Department of Aeronautics Imperial College London London United Kingdom

Reduced order models are becoming increasingly important for rendering complex and multiscale spatio-temporal dynamics computationally tractable. The computational efficiency of such surrogate models is especially important for design, exhaustive exploration and physical understanding. Plasma simulations, in particular those applied to the study of E × B plasma discharges and technologies, such as Hall thrusters, require substantial computational resources in order to resolve the multidimentional dynamics that span across wide spatial and temporal scales. Although high-fidelity computational tools are available to simulate such systems over limited conditions and in highly simplified geometries, simulations of full-size systems and/or extensive parametric studies over many geometric configurations and under different physical conditions are computationally intractable with conventional numerical tools. Thus, scientific studies and industrially oriented modeling of plasma systems, including the important E × B technologies, stand to significantly benefit from reduced order modeling algorithms. We develop a model reduction scheme based upon a Shallow REcurrent Decoder (SHRED) architecture. The scheme uses a neural network for encoding limited sensor measurements in time (sequence-to-sequence encoding) to full state-space reconstructions via a decoder network. Based upon the theory of separation of variables, the SHRED architecture is capable of (i) reconstructing full spatio-temporal fields with as little as three point sensors, even the fields that are not measured with sensor feeds but that are in dynamic coupling with the measured field, and (ii) forecasting the future state of the system using neural network roll-outs from the trained time encoding model. The SHRED reduced order model architecture is demonstrated on the plasma dynamics in a 2D configuration representative of a radial-azimuthal plane of a typical Hall thruster geometry. Copyright © 2024, The Author

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

ON THE MAXIMUM SIZE OF VARIABLE-LENGTH NON-OVERLAPPING CODES

arXiv

引用

arXiv 2024年

作者： Wang, Geyang Wang, Qi Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland College ParkMD20742 United States Department of Computer Science and Engineering National Center for Applied Mathematics Shenzhen Southern University of Science and Technology Nanshan District Guangdong Shenzhen518055 China

Non-overlapping codes are a set of codewords such that the prefix of each codeword is not a suffix of any codeword in the set, including itself. If the lengths of the codewords are variable, it is additionally required that every codeword is not contained in any other codeword as a subword. Let C(n, q) be the maximum size of q-ary fixed-length non-overlapping codes of length n. The upper bound on C(n, q) has been well studied. However, the nontrivial upper bound on the maximum size of variable-length non-overlapping codes of length at most n remains open. In this paper, by establishing a link between variable-length non-overlapping codes and fixed-length ones, we are able to show that the size of a q-ary variable-length non-overlapping code is upper bounded by C(n, q). Furthermore, we prove that the average length of the codewords in a q-ary variable-length non-overlapping codes is lower bounded by ⌈logq C˜⌉, and is asymptotically no shorter than n−2 as q approaches ∞, where C˜ denotes the cardinality of q-ary variable-length non-overlapping codes of length up to *** Codes 94A45, 94B25 © 2024, CC BY.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Malware Detection Issues, Future Trends and Challenges: A Survey

Malware Detection Issues, Future Trends and Challenges: A Su...

引用

2023 International Symposium on Networks, computers and Communications, ISNCC 2023

作者： Aliahmad, Anas Eleyan, Derar Eleyan, Amna Bejaoui, Tarek Zolkipli, Mohamad Fadli Al-Khalidi, Mohammed College of Graduate Studies Department of Investigations and Cybercrime Palestine Technical University Palestine Palestine Technical University Kadoorie Applied Computing Department Palestine Manchester Metropolitan University Department of Computing and Mathematics Manchester United Kingdom University of Carthage Computer Engineering Department Tunisia School of Computing UUM CAS University Utara Malaysia

ISBN: (纸本)9798350335590

This paper focuses on the challenges and issues of detecting malware in to-day's world where cyberattacks continue to grow in number and complexity. The paper reviews current trends and technologies in malware detection and the limitations of existing detection methods such as signature-based detection and heuristic analysis. The emergence of new types of malware, such as file-less malware, is also discussed, along with the need for real-time detection and response. The research methodology used in this paper is presented, which includes a literature review of recent papers on the topic, keyword searches, and analysis and representation methods used in each study. In this paper, the authors aim to address the key issues and challenges in detecting malware today, the current trends and technologies in malware detection, and the limitations of existing methods. They also explore emerging threats and trends in malware attacks and highlight future directions for research and development in the field. To achieve this, the authors use a research methodology that involves a literature review of recent papers related to the topic. They focus on detecting and analyzing methods, as well as representation and extraction methods used in each study. Finally, they classify the literature re-view, and through reading and criticism, highlight future trends and problems in the field of malware detection. © 2023 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：