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

arXiv 2024年

作者： Park, Seong Hyeon Choi, Gahyun Kim, Eunjong Park, Gwanyeol Choi, Jisoo Choi, Jiman Chong, Yonuk Lee, Yong-Ho Hahn, Seungyong Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Center for Superconducting Quantum Computing Systems Korea Research Institute of Standards and Science Daejeon34113 Korea Republic of Department of Physics & Astronomy Institute of Applied Physics Seoul National University Seoul08826 Korea Republic of Quantum Devices Labs Korea Advanced Nano Fab Center Suwon16229 Korea Republic of Quantum Design Korea Seoul06272 Korea Republic of SKKU Adavanced Institute of Nanotechnology Sungkyunkwan University Suwon16419 Korea Republic of

Recent advances in quantum information processing with superconducting qubits have fueled a growing demand for scaling and miniaturizing circuit layouts. Despite significant progress, predicting the Hamiltonian of complex circuits remains a challenging task. Here, we propose an improved method for quantizing superconducting circuits that incorporates material- and geometry-dependent kinetic inductance. Our approach models superconducting films as reactive boundary elements, seamlessly integrating into the conventional circuit quantization framework without adding computational complexity. We experimentally validate our method using superconducting devices fabricated with 35 nm-thick disordered niobium films, demonstrating significantly improved accuracy in predicting the Hamiltonian based solely on the device layout and material properties of superconducting films and Josephson junctions. Specifically, conventional methods exhibit an average error of 5.4% in mode frequencies, while our method reduces it to 1.1%. Our method enables systematic studies of superconducting devices with disordered films or compact elements, facilitating precise engineering of superconducting circuits at scale. © 2024, CC BY-NC-ND.

关键词： Superconducting films

来源：评论

学校读者我要写书评

暂无评论

Extending the ElGamal Cryptosystem to the Third Group of Units of n

arXiv

引用

arXiv 2025年

作者： Hamza, Jana EL Hindi, Mohammad Kadri, Seifeddine Kadri, Therrar Awad, Yahya Department of Mathematics and Physics Faculty of Arts and Sciences Lebanese International University Bekaa Lebanon Department of Mathematics and Computer Science Faculty of Science Beirut Arab University Beirut Lebanon Faculty of Applied Computing and Technology Norof University College Kristiansand Norway Department of Science Nourthwestern Polytechnic Grande Prairie Canada

In this paper, we extend the ElGamal cryptosystem to the third group of units of the ring n, which we prove to be more secure than the previous extensions. We describe the arithmetic needed in the new setting. We also provide some numerical simulations that shows the security and efficiency of our proposed *** Codes 20D45, 68W30 © 2025, CC0.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Linear Combination of Hamiltonian Simulation for Nonunitary Dynamics with Optimal State Preparation Cost

引用

Physical Review Letters 2023年第15期131卷 150603-150603页

作者： Dong An Jin-Peng Liu Lin Lin Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Department of Mathematics University of California Berkeley California 94720 USA Simons Institute for the Theory of Computing University of California Berkeley California 94720 USA Center for Theoretical Physics Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Lawrence Berkeley National Laboratory Applied Mathematics and Computational Research Division Berkeley California 94720 USA Challenge Institute for Quantum Computation University of California Berkeley California 94720 USA

We propose a simple method for simulating a general class of nonunitary dynamics as a linear combination of Hamiltonian simulation (LCHS) problems. LCHS does not rely on converting the problem into a dilated linear system problem or on the spectral mapping theorem. The latter is the mathematical foundation of many quantum algorithms for solving a wide variety of tasks involving nonunitary processes, such as the quantum singular value transformation. The LCHS method can achieve optimal cost in terms of state preparation. We also demonstrate an application for open quantum dynamics simulation using the complex absorbing potential method with near-optimal dependence on all parameters.

关键词： Open quantum systems Quantum algorithms Quantum algorithms & computation Quantum simulation Differential equations

来源：评论

学校读者我要写书评

暂无评论

Towards a Quantum Algorithm for the Incompressible Nonlinear Navier-Stokes Equations

Towards a Quantum Algorithm for the Incompressible Nonlinear...

引用

Quantum computing and Engineering (QCE), IEEE International Conference on

作者： Muralikrishnan Gopalakrishnan Meena Yu Zhang Weiwen Jiang Youzuo Lin Stefanie Günther Xinfeng Gao National Center for Computational Sciences Oak Ridge National Laboratory Oak Ridge TN USA Theoretical Division Los Alamos National Laboratory Los Alamos NM USA Department of Electrical and Computer Engineering George Mason University Fairfax VA USA School of Data Science and Society University of North Carolina at Chapel Hill Chapel Hill NC USA Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA USA Department of Mechanical and Aerospace Engineering University of Virginia Charlottesville VA USA

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

In this work, we present novel concepts for quantum algorithms to solve transient, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the incompressible Navier-Stokes equations as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts solving nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. We propose a new framework based on matrix product states (MPSs) and matrix product operators (MPOs), in addition to the Krylov subspace methods. For example, the solution variables of the Navier-Stokes equations are represented by MPSs, and the linear and nonlinear terms are processed by MPOs. The time evolution of the operators is attained by a fast-forwarding algorithm using Krylov subspace methods. Furthermore, we discuss various techniques for efficient encoding of MPSs, measurement reduction for MPOs, and use of tensor operations to treat multi-variate, multi-physics characteristics of Navier-Stokes.

关键词： computers Quantum algorithm Tensors Fluids Partial differential equations Encoding Transient analysis Nonlinear systems Physics Navier-Stokes equations

来源：评论

学校读者我要写书评

暂无评论

Mathematical modeling and simulation of magnetized bioconvective nanoliquid flow capturing Brownian motion, multiple slip, thermophoresis and gyrotactic microorganisms configured by rotating disk

引用

Partial Differential Equations in applied Mathematics 2024年 12卷

作者： Garalleh, Hakim AL Khan, Sami Ullah Waqas, M. Zamri, Nurnadiah Abdullaeva, Barno Gupta, Manish Department of Mathematical Science College of Engineering University of Business and Technology Jeddah 21361 Saudi Arabia Department of Mathematics Namal University Mianwali 42250 Pakistan NUTECH School of Applied Sciences and Humanities National University of Technology Islamabad 44000 Pakistan Department of Computer Science and Mathematics Lebanese American University Beirut Lebanon Faculty of Informatics and Computing University Sultan Zainal Abidin Besut Campus Terengganu Besut 22200 Malaysia Department of Mathematics and Information Technologies Vice-Rector for Scientific Affairs Tashkent State Pedagogical University Tashkent Uzbekistan Division of Research and Development Lovely Professional University Phagwara India

This analysis describes the bioconvective flow of nanofluid due to rotation of disk. A uniform suspension of nanofluid between microorganisms is considered to analyze the applications of bioconvection. The nanofluid assumed to be electrically conducting with amplification of magnetic force. The problem is entertained in presence of different slip features including velocity, temperature, concentration and microorganisms. The formulation of problem in simplified form is attained via dimensionless variables. Shooting numerical scheme is used to compute the simulations. Physical interpretation and visualization of results is observed in view of parameters. The observations concluded that interaction of slip effects reduces the velocity profile but enhances nanofluid temperature and concentration profiles. The temperature profile increases with thermophoresis parameter. Current results comprise applications in cooling of electronics devices, thin film coating, gas turbines engine, energy systems etc. © 2024

关键词： Bioconvection Multiple slip effects Nanoparticles Numerical computations Rotating disks

来源：评论

学校读者我要写书评

暂无评论

Kidney Tumor Detection and Classification Based on Deep Learning Approaches: A New Dataset in CT Scans

引用

Journal of Healthcare Engineering 2022年第1期2022卷 3861161页

作者： Alzu'Bi, Dalia Abdullah, Malak Hmeidi, Ismail Alazab, Rami Gharaibeh, Maha El-Heis, Mwaffaq Almotairi, Khaled H. Forestiero, Agostino Hussein, Ahmad Mohdaziz Abualigah, Laith Department of Computer Information Systems Jordan University of Science and Technology Irbid2210 Jordan Department of General Surgery and Urology University of Science and Technology Irbid22110 Jordan Department of Diagnostic and Interventional Radiology Faculty of Medicine Jordan University of Science and Technology Irbid2210 Jordan Computer Engineering Department Computer and Information Systems College Umm Al-Qura University Makkah21955 Saudi Arabia Institute for High Performance Computing and Networking CNR CS Rende Italy Deanship of E-Learning and Distance Education Umm Al-Qura University Makkah21955 Saudi Arabia Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Faculty of Information Technology Middle East University Amman11831 Jordan School of Computer Sciences Universiti Sains Malaysia Pulau Pinang11800 Malaysia

Kidney tumor (KT) is one of the diseases that have affected our society and is the seventh most common tumor in both men and women worldwide. The early detection of KT has significant benefits in reducing death rates, producing preventive measures that reduce effects, and overcoming the tumor. Compared to the tedious and time-consuming traditional diagnosis, automatic detection algorithms of deep learning (DL) can save diagnosis time, improve test accuracy, reduce costs, and reduce the radiologist's workload. In this paper, we present detection models for diagnosing the presence of KTs in computed tomography (CT) scans. Toward detecting and classifying KT, we proposed 2D-CNN models;three models are concerning KT detection such as a 2D convolutional neural network with six layers (CNN-6), a ResNet50 with 50 layers, and a VGG16 with 16 layers. The last model is for KT classification as a 2D convolutional neural network with four layers (CNN-4). In addition, a novel dataset from the King Abdullah University Hospital (KAUH) has been collected that consists of 8,400 images of 120 adult patients who have performed CT scans for suspected kidney masses. The dataset was divided into 80% for the training set and 20% for the testing set. The accuracy results for the detection models of 2D CNN-6 and ResNet50 reached 97%, 96%, and 60%, respectively. At the same time, the accuracy results for the classification model of the 2D CNN-4 reached 92%. Our novel models achieved promising results;they enhance the diagnosis of patient conditions with high accuracy, reducing radiologist's workload and providing them with a tool that can automatically assess the condition of the kidneys, reducing the risk of misdiagnosis. Furthermore, increasing the quality of healthcare service and early detection can change the disease's track and preserve the patient's life. © 2022 Dalia Alzu'bi et al.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Staged Approach Using Machine Learning and Uncertainty Quantification to Predict the Risk of Hip Fracture

SSRN

引用

SSRN 2024年

作者： Shaik, Anjum Larsen, Kristoffer Lane, Nancy E. Zhao, Chen Su, Kuan-Jui Keyak, Joyce H. Tian, Qing Sha, Qiuying Shen, Hui Deng, Hong-Wen Zhou, Weihua Department of Applied Computing Michigan Technological University 1400 Townsend Dr HoughtonMI49931 United States Department of Mathematical Sciences Michigan Technological University HoughtonMI United States Department of Internal Medicine Division of Rheumatology UC Davis Health SacramentoCA95817 United States Department of Computer Science Kennesaw State University 680 Arntson Dr MariettaGA30060 United States Division of Biomedical Informatics and Genomics Tulane Center of Biomedical Informatics and Genomics Deming Department of Medicine Tulane University New OrleansLA70112 United States Department of Radiological Sciences Department of Biomedical Engineering Department of Mechanical and Aerospace Engineering University of California IrvineCA United States Center for Biocomputing and Digital Health Institute of Computing and Cybersystems Health Research Institute Michigan Technological University HoughtonMI49931 United States

Hip fractures present a significant healthcare challenge, especially within aging populations, where they are often caused by falls. These fractures lead to substantial morbidity and mortality, emphasizing the need for timely surgical intervention. Despite advancements in medical care, hip fractures impose a significant burden on individuals and healthcare systems. This paper focuses on the prediction of hip fracture risk in older and middle-aged adults, where falls and compromised bone quality are predominant *** study cohort included 547 patients, with 94 experiencing hip fracture. To assess the risk of hip fracture, clinical variables and clinical variables combined with hip DXA imaging features were evaluated as predictors, followed by a novel staged approach. Hip DXA imaging features included those extracted by convolutional neural networks (CNNs), shape measurements, and texture features. Two ensemble machine learning models were evaluated: Ensemble 1 (clinical variables only) and Ensemble 2 (clinical variables and imaging features) using the logistic regression as the base classifier and bootstrapping for ensemble learning. The staged approach was developed using uncertainty quantification from Ensemble 1 which was used to decide if hip DXA imaging features were necessary to improve prediction for each subject. Ensemble 2 exhibited the highest performance, achieving an Area Under the Curve (AUC) of 0.9541, an accuracy of 0.9195, a sensitivity of 0.8078, and a specificity of 0.9427. The staged model also performed well, with an AUC of 0.8486, an accuracy of 0.8611, a sensitivity of 0.5578, and a specificity of 0.9249, outperforming Ensemble 1, which had an AUC of 0.5549, an accuracy of 0.7239, a sensitivity of 0.1956, and a specificity of 0.8343. Furthermore, the staged model suggested that 54.49% of patients did not require DXA scanning, effectively balancing accuracy and specificity, while offering a robust solution when DXA data acquisition is not f

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

The First Approach to the Interval Generalized Finite Differences 13th

The First Approach to the Interval Generalized Finite Differ...

引用

13th International Conference on Parallel Processing and applied Mathematics, PPAM 2019

作者： Jankowska, Malgorzata A. Marciniak, Andrzej Institute of Applied Mechanics Poznan University of Technology Jana Pawla II 24 Poznan60-965 Poland Institute of Computing Science Poznan University of Technology Piotrowo 2 Poznan60-965 Poland Department of Computer Science State University of Applied Sciences in Kalisz Poznanska 201-205 Kalisz62-800 Poland

ISBN: (纸本)9783030432218

The paper concerns the first approach to interval generalized finite differences. The conventional generalized finite differences are of special interest due to the fact that they can be applied to irregular grids (clouds) of points. Based on these finite differences we can compute approximate values of some derivatives (ordinary or partial). Furthermore, one can formulate the generalized finite difference method for solving some boundary value problems with a complicated boundary of a domain. The aim of this paper is to propose the interval counterparts of generalized finite differences. Under the appropriate assumptions the exact values of the derivatives are included in the interval values obtained. © 2020, Springer Nature Switzerland AG.

关键词： Boundary value problems

来源：评论

学校读者我要写书评

暂无评论

Recursive Quantum Relaxation for Combinatorial Optimization Problems

arXiv

引用

arXiv 2024年

作者： Kondo, Ruho Sato, Yuki Raymond, Rudy Yamamoto, Naoki Toyota Central R&D Labs. Inc. 41-1 Yokomichi Aichi Nagakute480-1192 Japan Quantum Computing Center Keio University 3-14-1 Hiyoshi Kohoku-ku Kanagawa Yokohama223-8522 Japan Department of Computer Science The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-0033 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama223-8522 Japan

Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems. This paper shows that some existing quantum optimization methods can be unified into a solver to find the binary solution which is most likely measured from the optimal quantum state. Combining this finding with the concept of quantum random access codes (QRACs) for encoding bits into quantum states on fewer qubits, we propose an efficient recursive quantum relaxation method called recursive quantum random access optimization (RQRAO) for MAX-CUT. Experiments on standard benchmark graphs with several hundred nodes in the MAX-CUT problem, conducted in a fully classical manner using a tensor network technique, show that RQRAO not only outperforms the Goemans–Williamson and recursive QAOA methods, but also is comparable to state-of-the-art classical solvers. The code is available at https://***/ToyotaCRDL/rqrao. © 2024, CC BY.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Enterprise problems and proposed solutions using the concept of E-commerce 2

Enterprise problems and proposed solutions using the concept...

引用

2nd International Conference on Smart computing and Electronic Enterprise, ICSCEE 2021

作者： Mohamad, Mohaizi Bin Kanaan, Anas Ghassan Aseh, Khairi Alawi, Nahg Abdulmajid Amayreh, Khalid Thaher Moaiad, Yazeed Al Al-Hodiany, Zakarya Mohsen Pathmanathan, P. Ravindran El-Ebiary, Yousef A. Baker North Borneo University College Malaysia Petra University Faculty of Management and Financial Sciences Business and E-commerce Department Amman Jordan International Institute of Applied Science Swiss School of Management Netherlands Malaysia and University of Aden Geomatika University College Yemen Irbid National University Faculty of Financial and Business Science Administration Department Irbid Jordan MEDIU Faculty of Computer and Information Technology Malaysia MEDIU Faculty of Finance and Admin. Sciences Malaysia UniSZA Faculty of Informatics and Computing Malaysia

ISBN: (纸本)9781665432221

The noise of e-commerce businesses has seen the extension of number of the online businesses global. Buyers now are opted with online business commerce which is greatly benefit compared to traditional businesses. It is undeniable e-commerce enterprises contribute more profits, comparing to "bricks-and-mortal"traditional enterprises, but not to be avoided the problems and challenges faced by the e- commerce marketplace. This study emphasizes the problems and challenges of e-commerce and a set of recommended solutions to those problems and challenges. Those problems are trust, readiness and security. For each of the problems, proposed solutions are presented. Companies have conducted business electronically by applying a range of electronic commerce solutions. In the current situation, a corporation enters the electronic market by building trading partner agreements with sellers or wholesalers of their choice. These deals may include any items that cannot be agree electronically, like terms of transfer, payment devices, or implementation rules. After discovering the right market relationships, a company must choose the elements of their electronic commerce system. In this paper have been formulate current ecommerce problems, challenges and their effective solutions. In future, e-commerce marketplace should concentrate more on securing payment, e-banking and e-government. With that, problems and challenges in e-commerce can be reduce. © 2021 IEEE.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：