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

arXiv 2024年

作者： Fan, Lili Wang, Ziwei Liao, Chenfei Wang, Jingwei School of Mathematics and Computer Science Wuhan Polytechnic University Wuhan430023 China State Key Laboratory of High Field Laser Physics Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai201800 China

Plasma surface high-order harmonics generation (SHHG) driven by intense laser pulses on plasma targets enables a high-quality extreme ultraviolet source with high pulse energy and outstanding spatiotemporal coherence. Optimizing the performance of SHHG is important for its applications in single-shot imaging and absorption spectroscopy. In this work, we demonstrate the optimization of laser-driven SHHG by an improved Bayesian strategy in conjunction with particle-in-cell simulations. A traditional Bayesian algorithm is first employed to optimize the SHHG intensity in a two-dimensional space of parameter. Then an improved Bayesian strategy, using the Latin hypercube sampling technique and a dynamic acquisition strategy, is developed to overcome the curse of dimensionality and the risk of local optima in a high-dimensional space optimization. The improved Bayesian optimization approach is efficient and robust in three-dimensionally optimizing the harmonic ellipticity, paving the way for the upcoming SHHG experiments with a considerable repetition rate. © 2024, CC BY.

关键词： Pulse repetition rate

来源：评论

学校读者我要写书评

暂无评论

An Innovative Method for Fraud Detection in E-Commerce Using DCNN-Multiclass SVM Model

An Innovative Method for Fraud Detection in E-Commerce Using...

引用

Intelligent Algorithms for Computational Intelligence Systems (IACIS), International Conference on

作者： Rafiya Banu Abbarapu Ashok Vijay Kumar Dwivedi Kotte Amaranadha Reddy Thulasimani T Neerav Nishant Department of Commerce B. S. Abdur Rahman Crescent Institute of Science and Technology Vandalur India Department of Mathematics School of Advanced Sciences VIT Andrapradesh India Department of Mathematics Vishwavidyalaya Engineering College Ambikapur (C.G.) India Department of Mathematics Kalasalingam Academy of Research and Education Krishnankoil India Department of Mathematics Bannari Amman Institute of Technology Sathyamangalam India Department of Computer Science and Engineering Babu Banarasi Das University Lucknow India

ISBN: (数字)9798350360660

ISBN: (纸本)9798350360677

A growing number of monetary transactions are taking place through different E-commerce platforms in this age of big data. Theft of personal information for fraudulent reasons is one of the risks that could arise from these opportunities. Credit cards are a prime target for cybercriminals seeking to steal personal data or execute fraudulent transactions due to their extensive use for online shopping. Intelligent fraud detection systems have come a long way, yet the system still haven't solved the notorious problems brought on by data imbalances. Following this important sequence will ensure that the data is properly prepared for feature extraction and model training. Prior to ATF processing raw log files pertaining to online e-commerce activity, a preprocessor removes data noise, such as click records created by customers who have not registered. Data mining for features an evolving metaheuristic algorithm called the multi-verse optimizer imitates the laws of the popular theory called multi-verse. While training the model, the proposed approach utilized DCNN-Multiclass SVM. Two state-of-the-art approaches, CNN and SVM, are beaten by the suggested approach. After using the strategy, accuracy improved by 95.65%.

关键词： Training Support vector machines Accuracy Metaheuristics Feature extraction Data models Fraud Electronic commerce Data mining Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Agent-based Simulation with Netlogo to Evaluate AmI Scenarios

arXiv

引用

arXiv 2024年

作者： Carbo, Javier Sanchez-Pi, Nayat Molina, José Manuel Department of Informatics Universidad Carlos III de Madrid Colmenarejo Madrid Spain Computer Science Department Institute of Mathematics and Statistics Universidade do Estado do Rio de Janeiro RJ Rio de Janeiro Brazil

In this paper an agent-based simulation is developed in order to evaluate an AmI scenario based on agents. Many AmI applications are implemented through agents but they are not compared to any other existing alternative in order to evaluate the relative benefits of using them. The proposal simulation environment developed in Netlogo analyse such benefits using two evaluation criteria: First, measuring agent satisfaction of different types of desires along the execution. Second, measuring time savings obtained through a correct use of context information. So, here, a previously suggested agent architecture, an ontology and a 12-steps protocol to provide AmI services in airports, is evaluated using a NetLogo simulation environment. The present work uses a NetLogo model considering scalability problems of this application domain but using FIPA and BDI extensions to be coherent with our previous works and our previous JADE implementation of them. The NetLogo model presented simulates an airport with agent users passing through several zones located in a specific order in a map: passport controls, check-in counters of airline companies, boarding gates, different types of shopping. Although initial data in simulations are generated randomly, and the model is just an approximation of real-world airports, the definition of this case of use of Ambient Intelligence through NetLogo agents opens an interesting way to evaluate the benefits of using Ambient Intelligence, which is a significant contribution to the final development of them. © 2024, CC BY-NC-ND.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Smart Contracts and Blockchain : An Analytical Approach 6

Smart Contracts and Blockchain : An Analytical Approach

引用

6th International Conference on Contemporary Computing and Informatics, IC3I 2023

作者： Sayal, Anu Vasundhara, Chetlur Gupta, Veethika Gupta, Ashulekha Maheshawri, Himani Memoria, Minakshi Taylor's University Department of Mathematics Malaysia Karnataka Bangalore India School of Social Sciences Doon University Uttarakhand Dehradun India Department of Management Studies Uttarakhand Dehradun India Graphic Era Hill University Department of Computing Uttarakhand Dehradun India Uttaranchal Institute of Technology Uttaranchal University Department of Computer Science and Engineering Uttarakhand Dehradun India

ISBN: (纸本)9798350304480

The conventional paper-based legal agreements have been replaced with smart contracts in the modern day. The way legal contracts are utilized to bind the parties to do business is changing as a result of this developing idea. SM-Smart contracts offer a solution to the issue of trust in the digital era. A smart contract is a computer program that is designed to automatically execute the terms of a contract between two or more parties. It operates on a blockchain network and contains the rules and conditions of the agreement. A software developer creates smart contracts by computer-programming the terms and conditions of the written legal agreement. In order for all parties to be aware of the conclusion right away, smart contracts are used to automate the execution of legal agreements. No third party is involved in the contract's execution. Numerous platforms and applications built using blockchain technology depend heavily on smart contracts. © 2023 IEEE.

关键词： Blockchain Coding Execute Vending Machine

来源：评论

学校读者我要写书评

暂无评论

Metric Dimension of Villarceau Grids

arXiv

引用

arXiv 2024年

作者： Prabhu, S. Jeba, D. Sagaya Rani Manuel, Paul Davoodi, Akbar Department of Mathematics Rajalakshmi Engineering College Chennai602105 India Department of Mathematics Panimalar Engineering College Chennai600123 India Department of Information Science College of Life Sciences Kuwait University Kuwait The Czech Academy of Sciences Institute of Computer Science Pod Vodárenskou věží 2 Prague182 07 Czech Republic

The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a graph G, the metric dimension, denoted as dim(G), is the minimum size of a resolving set, a subset of vertices such that for every pair of vertices in G, there exists a vertex in the resolving set whose shortest path distance to the two vertices is different. This subset of vertices helps to uniquely determine the location of other vertices in the graph. A basis is a resolving set with a least cardinality. Finding a basis is a problem with practical applications in network design, where it is important to efficiently locate and identify nodes based on a limited set of reference points. The Cartesian product of Pm and Pn is the grid network in network science. In this paper, we investigate two novel types of grids in network science: the Villarceau grid Type I and Type II. For each of these grid types, we find the precise metric *** Codes 05C12 © 2024, CC BY.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Some fractional-order modeling and analysis of the transmission dynamics together with prevention controls

引用

The European Physical Journal Special Topics 2024年 1-25页

作者： Guirao, Juan L. G. Jan, Rashid Baleanu, Dumitru Mohammed, Pshtiwan Othman Abdullah, Farah Aini Chorfi, Nejmeddine Department of Applied Mathematics and Statistics Technical University of Cartagena Hospital de Marina Cartagena Spain Department of Civil Engineering Institute of Energy Infrastructure (IEI) College of Engineering Universiti Tenaga Nasional (UNITEN) Kajang Malaysia Mathematics Research Center Near East University TRNC Nicosia Turkey Department of Computer Science and Mathematics Lebanese American University Beirut Lebanon Institute of Space Science-Subsidiary of INFLPR Magurele-Bucharest Romania Department of Mathematics College of Education University of Sulaimani Sulaimani Iraq Research and Development Center University of Sulaimani Sulaymaniyah Iraq School of Mathematical Sciences Universiti Sains Malaysia USM Penang Malaysia Department of Mathematics College of Science King Saud University Riyadh Saudi Arabia

The purpose of the present research is to improve our understanding of how coronavirus infection spreads by creating an epidemic model that incorporates isolation and quarantine measures. The dynamics of this viral spread are represented using the Caputo–Fabrizio operator. By analyzing the equilibria of the model and utilizing the next-generation matrix method, we determine the endemic indicator, $${\mathcal {R}}_0$$ . The main findings demonstrate that the equilibrium without infection is locally stable when $${\mathcal {R}}_0$$ is less than one and unstable otherwise. Also, we demonstrate the existence and uniqueness of the solution of our recommended model. In addition to this, we interrogate the solution pathways of the system by varying different factors, aiming to comprehend the intricate transmission of COVID-19 and visualize the crucial factors of the system that can aid public health officials in the control of the spread of infection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Entropy of labeled versus unlabeled networks

引用

Physical Review E 2022年第5期106卷 054308-054308页

作者： Jeremy Paton Harrison Hartle Huck Stepanyants Pim van der Hoorn Dmitri Krioukov Department of Physics Northeastern University Boston Massachusetts 02115 USA Network Science Institute Northeastern University Boston Massachusetts 02115 USA Department of Mathematics and Computer Science Eindhoven University of Technology 5600 MB Eindhoven Netherlands Department of Mathematics Northeastern University Boston Massachusetts 02115 USA Department of Electrical and Computer Engineering Northeastern University Boston Massachusetts 02115 USA

The structure of a network is an unlabeled graph, yet graphs in most models of complex networks are labeled by meaningless random integers. Is the associated labeling noise always negligible, or can it overpower the network-structural signal? To address this question, we introduce and consider the sparse unlabeled versions of popular network models and compare their entropy against the original labeled versions. We show that labeled and unlabeled Erdős-Rényi graphs are entropically equivalent, even though their degree distributions are very different. The labeled and unlabeled versions of the configuration model may have different prefactors in their leading entropy terms, although this remains conjectural. Our main results are upper and lower bounds for the entropy of labeled and unlabeled one-dimensional random geometric graphs. We show that their unlabeled entropy is negligible in comparison with the labeled entropy. This means that in sparse networks the entropy of meaningless labeling may dominate the entropy of the network structure. The main implication of this result is that the common practice of using exchangeable models to reason about real-world networks with distinguishable nodes may introduce uncontrolled aberrations into conclusions made about these networks, suggesting a need for a thorough reexamination of the statistical foundations and key results of network science.

关键词： Network structure Shannon entropy

来源：评论

学校读者我要写书评

暂无评论

Ultrahigh-Flux Water Nanopumps Generated by Asymmetric Terahertz Absorption

引用

Physical Review Letters 2024年第18期132卷 184003-184003页

作者： Qi-Lin Zhang Tong Zhou Chao Chang Shi-Yu Gu Yun-Jie Wang Qi Liu Zhi Zhu School of Mathematics-Physics and Finance and School of Materials Science and Engineering Anhui Polytechnic University Wuhu 241000 China Innovation Laboratory of Terahertz Biophysics National Innovation Institute of Defense Technology Beijing 100071 China School of Physics Peking University Beijing 100871 China College of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai 200093 China

Controlling active transport of water through membrane channels is essential for advanced nanofluidic devices. Despite advancements in water nanopump design using techniques like short-range invasion and subnanometer-level control, challenges remain facilely and remotely realizing massive waters active transport. Herein, using molecular dynamic simulations, we propose an ultrahigh-flux nanopump, powered by frequency-specific terahertz stimulation, capable of unidirectionally transporting massive water through asymmetric-wettability membrane channels at room temperature without any external pressure. The key physics behind this terahertz-powered water nanopump is revealed to be the energy flow resulting from the asymmetric optical absorption of water.

关键词： Cell membrane transport Classical statistical mechanics Nanofluidics Liquid-solid interfaces Water Molecular dynamics Terahertz techniques

来源：评论

学校读者我要写书评

暂无评论

Recent advances and applications of deep learning methods in materials science

引用

npj Computational Materials 2022年第1期8卷 548-573页

作者： Kamal Choudhary Brian DeCost Chi Chen Anubhav Jain Francesca Tavazza Ryan Cohn Cheol Woo Park Alok Choudhary Ankit Agrawal Simon J.L.Billinge Elizabeth Holm Shyue Ping Ong Chris Wolverton Materials Science and Engineering Division National Institute of Standards and TechnologyGaithersburgMD20899USA Theiss Research La JollaCA92037USA DeepMaterials LLC Silver SpringMD20906USA Material Measurement Science Division National Institute of Standards and TechnologyGaithersburgMD20899USA Department of NanoEngineering University of California San DiegoSan DiegoCA92093USA Energy Technologies Area Lawrence Berkeley National LaboratoryBerkeleyCAUSA Department of Materials Science and Engineering Carnegie Mellon UniversityPittsburghPA15213USA Department of Materials Science and Engineering Northwestern UniversityEvanstonIL60208USA Department of Electrical and Computer Engineering Northwestern UniversityEvanstonIL60208USA Department of Applied Physics and Applied Mathematics and the Data Science Institute Fu Foundation School of Engineering and Applied SciencesColumbia UniversityNew YorkNY10027USA

Deep learning(DL)is one of the fastest-growing topics in materials data science,with rapidly emerging applications spanning atomistic,image-based,spectral,and textual data *** allows analysis of unstructured data and automated identification of *** recent development of large materials databases has fueled the application of DL methods in atomistic prediction in *** contrast,advances in image and spectral data have largely leveraged synthetic data enabled by high-quality forward models as well as by generative unsupervised DL *** this article,we present a high-level overview of deep learning methods followed by a detailed discussion of recent developments of deep learning in atomistic simulation,materials imaging,spectral analysis,and natural language *** each modality we discuss applications involving both theoretical and experimental data,typical modeling approaches with their strengths and limitations,and relevant publicly available software and *** conclude the review with a discussion of recent cross-cutting work related to uncertainty quantification in this field and a brief perspective on limitations,challenges,and potential growth areas for DL methods in materials science.

关键词： learning limitations textual

来源：评论

学校读者我要写书评

暂无评论

On the practicality of quantum sieving algorithms for the shortest vector problem

arXiv

引用

arXiv 2024年

作者： Doriguello, Joao F. Giapitzakis, George Luongo, Alessandro Morolia, Aditya HUN-REN Alfréd Rényi Institute of Mathematics Budapest Hungary Centre for Quantum Technologies National University of Singapore Singapore David R. Cheriton School of Computer Science University of Waterloo Waterloo Canada

One of the main candidates of post-quantum cryptography is lattice-based cryptography. Its cryptographic security against quantum attackers is based on the worst-case hardness of lattice problems like the shortest vector problem (SVP), which asks to find the shortest non-zero vector in an integer lattice. Asymptotic quantum speedups for solving SVP are known and rely on Grover’s search. However, to assess the security of lattice-based cryptography against these Grover-like quantum speedups, it is necessary to carry out a precise resource estimation beyond asymptotic scalings. In this work, we perform a careful analysis on the resources required to implement several sieving algorithms aided by Grover’s search for dimensions of cryptographic interests. For such, we take into account fixed-point quantum arithmetic operations, non-asymptotic Grover’s search, the cost of using quantum random access memory (QRAM), different physical architectures, and quantum error correction. We find that even under very optimistic assumptions like circuit-level noise of 10−5, code cycles of 100 ns, reaction time of 1 µs, and using state-of-the-art arithmetic circuits and quantum error-correction protocols, the best sieving algorithms require ≈ 1013 physical qubits and ≈ 1031 years to solve SVP on a lattice of dimension 400, which is roughly the dimension in which SVP is to be solved in order to break the minimally secure post-quantum cryptographic standards currently being proposed by NIST. We estimate that a 6-GHz-clock-rate single-core classical computer would take roughly the same amount of time to solve the same problem. We conclude that there is currently little to no quantum speedup in the dimensions of cryptographic interest and the possibility of realising a considerable quantum speedup using quantum sieving algorithms would require significant breakthroughs in theoretical protocols and hardware development. © 2024, CC BY.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：