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

Dynamic Insights into Lower Urinary Tract Function: Exploring Intraindividual and Interindividual Variability through Personalized Mathematical Modeling

Dynamic Insights into Lower Urinary Tract Function: Explorin...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Mohamed Zaid Caleb Hendrick Elie Alhajjar John Yin Zachary C. Danziger Giovanna Guidoboni Graduate School of Biomedical Science and Engineering University of Maine Orono ME USA Maine College of Engineering and Computing Orono ME USA Engineering and Applied Sciences Department RAND Arlington VA USA Chemical and Biological Engineering Wisconsin Institute for Discovery University of Wisconsin–Madison Madison Wisconsin USA Department of Rehabilitation Medicine Division of Physical Therapy Emory University Georgia USA W.H. Coulter Department of Biomedical Engineering Emory University Georgia USA

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

This study proposes a novel approach to obtain personalized estimates of Lower Urinary Tract Function leveraging on the simulated and experimentally acquired bladder pressure. Our findings reveal the model’s adaptability across intraindividual cycles and consistency within specific cohorts, shedding light on the importance of variability in the micturition process. The study emphasizes the significance of intraindividual and interindividual variability, paving the way for improved diagnostics and therapeutic strategies in the field of lower urinary function.

关键词： Neurological diseases Biomechanics Biological system modeling Bladder Rats Biomarkers Mathematical models Data models Complexity theory engineering in medicine and biology

来源：评论

学校读者我要写书评

暂无评论

Hybrid Machine Learning Approach for Enhanced Vulnerability Detection in Cloud Environments Using NIST and MITRE Frameworks

Hybrid Machine Learning Approach for Enhanced Vulnerability ...

引用

Advanced Research in computing (ICARC), International Conference on

作者： N W Chanaka Lasantha M W P Maduranga Ruvan Abeysekara Valmik Tilwari Nilotpal Chakraborty Debashree Sharma Faculty of Graduate Studies IIC University of Technology Phnom Penh Cambodia Department of Electrical and Electronic Engineering University of Sri Jayewardenepura Nugegoda Sri Lanka Faculty of Computing BCAS Campus Colombo Sri Lanka Department. of Electronics & Communication Engineering Indian Institute of Information Technology Guwahati India Department of Computer Science Engineering Indian Institute of Information Technology Guwahati India Department of Electronics & Communication Engineering Indian Institute of Information Technology Guwahati India

ISBN: (数字)9798331530983

ISBN: (纸本)9798331530990

Cloud security is challenged by constant adaptive cyber threats and traditional detection methods lack real time adaptability. In this paper, we propose a new hybrid ML approach stitching data from National Institute of Standards and Technology (NIST) and MITRE Adversarial Tactics, Techniques and Common Knowledge (ATT&CK) databases together. In contrast to existing methods, this framework combines, in unique and unprecedented fashion, ensemble ML models and Realtime data processing for increased detection accuracy and reduced false positives. This approach addresses specific challenges in the cloud environments and by leveraging standardised frameworks, it offers actionable audiences for efficient and effective vulnerability management process. The framework is validated by the experimental results which prove its robustness to evolution of the cybersecurity demands.

关键词： Adaptation models Accuracy Cloud computing security Scalability NIST Transformers Data models Threat assessment Robustness Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Explicit error bounds with commutator scaling for time-dependent product and multi-product formulas

arXiv

引用

arXiv 2024年

作者： Mizuta, Kaoru Ikeda, Tatsuhiko N. Fujii, Keisuke Department of Applied Physics Graduate School of Engineering The University of Tokyo Hongo 7-3-1 Bunkyo Tokyo113-8656 Japan Photon Science Center Graduate School of Engineering The University of Tokyo Hongo 7-3-1 Bunkyo Tokyo113-8656 Japan Hirosawa 2-1 Wako Saitama351-0198 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Toyonaka Osaka560-8531 Japan Center for Quantum Information and Quantum Biology Osaka University 560-0043 Japan Fujitsu Quantum Computing Joint Research Division at QIQB Osaka University 1-2 Machikaneyama Toyonaka560-0043 Japan

Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time evolution operators, is one of the central approaches for simulating quantum dynamics by quantum computers. It has been of great interest whether PFs have a bound of the error from the exact time evolution, which is expressed by commutators among local terms (called commutator scaling), since it brings the substantial suppression of the computational cost in terms of the system size. Although a series of recent studies have revealed the presence and the explicit formulas of the PF error bounds for time-independent systems, those for time-dependent Hamiltonians remain to be a difficult problem except for low-order PFs. In this paper, we derive an explicit error bound of generic PFs for smooth time-dependent Hamiltonians H(t) = PΓγ=1 Hγ(t), which is expressed by commutators among the terms {Hγ(t)}Γγ=1 and their time derivatives. This error bound can also host the substantial suppression in the system size for generic local Hamiltonians with finite-, short-, and long-ranged interactions, thereby giving a much better estimate of gate counts. Our derivation employs the so-called Floquet theory;Embedding generic smooth time-dependent Hamiltonians into time-periodic ones, we map the time-dependent PF error to the time-independent one defined on an infinite-dimensional space. This approach allows to obtain the error bounds not only for the ordinary time-dependent PF but also for its various family, such as the one for non-unitary dynamics. In particular, we also clarify the explicit error bound of a time-dependent multi-product formula, with which we can achieve much smaller error by a linear combination of time-dependent PFs. Our results will shed light on applications of near-term and future quantum computers, ranging from quantum simulation of nonequilibrium materials to faster algorithms exploiting time-dependent Hamiltonians such as adiabatic state pre

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Characteristics Fluctuation of Sub-3-nm Bulk FinFET Devices Induced by Random Interface Traps

Characteristics Fluctuation of Sub-3-nm Bulk FinFET Devices ...

引用

IEEE Conference on Nanotechnology

作者： Sekhar Reddy Kola Min-Hui Chuang Yiming Li Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program National Yang Ming Chiao Tung University Hsinchu Taiwan Department of Electronics and Electrical Engineering Institute of Communications Engineering Institute of Biomedical Engineering Institute of Pioneer Semiconductor Innovation Institute of Artificial Intelligence Innovation National Yang Ming Chiao Tung University Hsinchu Taiwan

Three-dimensional (3D) bulk fin-typed field effect transistors (FinFETs) have emerged as key devices that can scale down the technology node beyond 22-nm. However, the scaled devices have created new sources of fluctuation inherent in 3D geometry. The interface trap is one such fluctuation that is caused by the trapping and de-trapping of charge carriers and has an adverse effect on device characteristics and variability. In this work, we study impacts of random interface traps (RITs) on electrical characteristic of bulk FinFETs by using a 3D quantum-mechanically corrected device simulation. RIT position effects on short channel effects (SCEs) are examined with physical governed influence to show the major fluctuations. More than 50% reductions of the RITs-induced characteristic fluctuation of the germanium (Ge) devices are observed, compared with Si devices. The Ge ones can reduce SCE variations and exhibit high immunity to RITs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Simple and Tighter Derivation of Achievability for Classical Communication Over Quantum Channels

引用

PRX Quantum 2023年第4期4卷 040330-040330页

作者： Hao-Chung Cheng (鄭皓中) Department of Electrical Engineering and Graduate Institute of Communication Engineering National Taiwan University Taiwan Republic of China Department of Mathematics National Taiwan University Taiwan Republic of China Center for Quantum Science and Engineering National Taiwan University Taiwan Republic of China Physics Division National Center for Theoretical Sciences Taiwan Republic of China Hon Hai (Foxconn) Quantum Computing Center Taiwan Republic of China

Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information theory, the crafted Hayashi-Nagaoka operator inequality is an essential technique in proving a wealth of one-shot achievability bounds since it effectively resembles a union bound in various problems. In this work, we show that the so-called pretty-good measurement naturally plays a role as the union bound as well. A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quantum channel coding via an elegant three-line proof. The proposed analysis enjoys the following favorable features. (i) The established one-shot bound admits a closed-form expression as in the celebrated Holevo-Helstrom theorem. Namely, the average error probability of sending M messages through a classical-quantum channel is upper bounded by the minimum error of distinguishing the joint channel input-output state against (M−1) decoupled product states. (ii) Our bound directly yields asymptotic achievability results in the large deviation, small deviation, and moderate deviation regimes in a unified manner. (iii) The coefficients incurred in applying the Hayashi-Nagaoka operator inequality or the quantum union bound are no longer needed. Hence, the derived one-shot bound sharpens existing results relying on the Hayashi-Nagaoka operator inequality. In particular, we obtain the tightest achievable ε-one-shot capacity for classical communication over quantum channels heretofore, improving the third-order coding rate in the asymptotic scenario. (iv) Our result holds for infinite-dimensional Hilbert space. (v) The proposed method applies to deriving one-shot achievability for classical data compression with quantum side information, entanglement-assisted classical communication over quantum channels, and various quantum network information-processing protocols.

关键词： Quantum communication Quantum communication, protocols & technology Quantum information processing Quantum information theory

来源：评论

学校读者我要写书评

暂无评论

All-Microwave Manipulation of Superconducting Qubits with a Fixed-Frequency Transmon Coupler

引用

Physical Review Letters 2023年第26期130卷 260601-260601页

作者： Shotaro Shirai Yuta Okubo Kohei Matsuura Alto Osada Yasunobu Nakamura Atsushi Noguchi Komaba Institute for Science (KIS) The University of Tokyo Meguro-ku Tokyo 153-8902 Japan Department of Applied Physics Graduate School of Engineering The University of Tokyo Bunkyo-ku Tokyo 113-8656 Japan PRESTO Japan Science and Technology Agency Kawaguchi-shi Saitama 332-0012 Japan RIKEN Center for Quantum Computing (RQC) Wako Saitama 351–0198 Japan Inamori Research Institute for Science (InaRIS) Kyoto-shi Kyoto 600-8411 Japan

All-microwave control of fixed-frequency superconducting quantum computing circuits is advantageous for minimizing the noise channels and wiring costs. Here we introduce a swap interaction between two data transmons assisted by the third-order nonlinearity of a coupler transmon under a microwave drive. We model the interaction analytically and numerically and use it to implement an all-microwave controlled-Z gate. The gate based on the coupler-assisted swap transition maintains high drive efficiency and small residual interaction over a wide range of detuning between the data transmons.

关键词： Quantum control Quantum engineering Quantum information with solid state qubits Superconducting qubits

来源：评论

学校读者我要写书评

暂无评论

Electronic-photonic quantum systems on-chip

Electronic-photonic quantum systems on-chip

引用

Quantum 2.0, QUANTUM 2022

作者： Wang, Imbert Ramesh, Anirudh Kramnik, Danielius Fargas Cabanillas, Josep M. Stojanović, Vladimir Kumar, Prem Popović, Miloš A. Department of Electrical and Computer Engineering Photonics Center Boston University BostonMA02215 United States Graduate Program in Applied Physics Northwestern University EvanstonIL60208 United States Department of Electrical Engineering and Computer Science UC Berkeley BerkeleyCA94720 United States Center for Photonic Communication and Computing Dept. of Electrical and Computer Eng. Northwestern University EvanstonIL60208 United States

We present progress towards realizing electronic-photonic quantum systems on-chip;particularly, entangled photon-pair sources, placing them in the context of previous work, and outlining our vision for mass-producible... 详细信息

ISBN: (纸本)9781957171111

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Theory of Acceleration of Decision Making by Correlated Time Sequences

arXiv

引用

arXiv 2022年

作者： Okada, Norihiro Yamagami, Tomoki Chauvet, Nicolas Ito, Yusuke Hasegawa, Mikio Naruse, Makoto Department of Electrical Engineering Graduate School of Engineering Tokyo University of Science 6-3-1 Niijuku Katsushika-ku Tokyo125-8585 Japan Department of Information Physics and Computing Graduate School of Information Science and Technology The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan

Photonic accelerators have been intensively studied to provide enhanced information processing capability to benefit from the unique attributes of physical processes. Recently, it has been reported that chaotically oscillating ultrafast time series from a laser, called laser chaos, provide the ability to solve multi-armed bandit (MAB) problems or decision-making problems at GHz order. Furthermore, it has been confirmed that the negatively correlated time-domain structure of laser chaos contributes to the acceleration of decision-making. However, the underlying mechanism of why decision-making is accelerated by correlated time series is unknown. In this study, we demonstrate a theoretical model to account for accelerating decision-making by correlated time sequence. We first confirm the effectiveness of the negative autocorrelation inherent in time series for solving two-armed bandit problems using Fourier transform surrogate methods. We propose a theoretical model that concerns the correlated time series subjected to the decision-making system and the internal status of the system therein in a unified manner, inspired by correlated random walks. We demonstrate that the performance derived analytically by the theory agrees well with the numerical simulations, which confirms the validity of the proposed model and leads to optimal system design. The present study paves the way for improving the effectiveness of correlated time series for decision-making, impacting artificial intelligence and other applications. Copyright © 2022, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Training Framework for 3D Point Cloud Object Detection Model 25

Unsupervised Training Framework for 3D Point Cloud Object De...

引用

Proceedings of the 40th ACM/SIGAPP Symposium on Applied computing

作者： Min-Jyun Wu Hsiang-Jui Lin Shih-Hao Hung Chi-Sheng Shih Dept. of Computer Science and Information Engineering National Taiwan University Taipei Taiwan High Performance and Scientific Computing (HPSC) Center National Taiwan University Taipei Taiwan Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan Center of Artificial Intelligence and Advanced Robotics National Taiwan University Taipei Taiwan

ISBN: (纸本)9798400706295

Point cloud data frames are critical, if not indispensable, for precise robot navigation and localization, but training the object detection models for them remains challenging. Many models require labeled 3D objects to train the model. However, the sparse and occluded 3D point cloud data make it difficult, if not impossible, to automate the labeling process. This work proposes a training framework to generate 3D labels on point clouds to tackle the aforementioned challenges. The proposed method takes advantage of the consecutive presence of the same object on different frames to automate the labeling process. The experimental results show that the unsupervised framework trains a robust model for 3D object detection. On the roadside data, the model archives 90.27% AP for scooters and 91.33% AP for cars. On nuScenes dataset, the framework demonstrates the detection precision doubles on IoU 0.25 and IoU 0.5 when the recalls remain similar, compared to the model trained by the MODEST framework.

关键词： computer systems organization

来源：评论

学校读者我要写书评

暂无评论

An Efficient Three-Factor Authenticated Key Agreement Technique Using FCM Under HC-IoT Architectures

引用

Computers, Materials & Continua 2022年第7期72卷 1373-1389页

作者： Chandrashekhar Meshram Agbotiname Lucky Imoize Sajjad Shaukat Jamal Parkash Tambare Adel R.Alharbi Iqtadar Hussain Department of Post Graduate Studies and Research in Mathematics Jayawanti Haksar Government Post-Graduation CollegeCollege of Chhindwara UniversityBetul460001M.P.India Department of Electrical and Electronics Engineering Faculty of EngineeringUniversity of LagosAkokaLagos100213Nigeria Department of Electrical Engineering and Information Technology Institute of Digital CommunicationRuhr University44801BochumGermany Department of Mathematics College of ScienceKing Khalid UniversityAbhaSaudi Arabia Water Resources&Applied Mathematics Research Lab Nagpur440027India College of Computing and Information Technology University of TabukTabuk71491Saudi Arabia Mathematics Program Department of MathematicsStatistics and PhysicsCollege of Arts and SciencesQatar University2713DohaQatar

The Human-Centered Internet of Things(HC-IoT)is fast becoming a hotbed of security and privacy *** users can establish a common session key through a trusted server over an open communication channel using a three-party authenticated key *** of the early authenticated key agreement systems relied on pairing,hashing,or modular exponentiation processes that are computationally intensive and *** order to address this problem,this paper offers a new three-party authenticated key agreement technique based on fractional chaotic *** new scheme uses fractional chaotic maps and supports the dynamic sensing of HC-IoT devices in the network architecture without a password *** projected security scheme utilized a hash function,which works well for the resource-limited HC-IoT *** results show that our new technique is resistant to password guessing attacks since it does not use a ***,our approach provides users with comprehensive privacy protection,ensuring that a user forgery attack causes no ***,our new technique offers better security features than the techniques currently available in the literature.

关键词： Three-party authenticated key agreement anonymity fractional chaotic maps Chebyshev polynomial password table human-centered internet of things(HC-IoT)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：