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

On the particle approximation of lagged Feynman–Kac formulae

Stochastic Processes and their Applications 2025年 188卷

作者： Awadelkarim, Elsiddig Caffarel, Michel Del Moral, Pierre Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia University of Toulouse CNRS-Lab. de Chimie et Physique Quantiques Toulouse31062 France Centre de Recherche Inria Bordeaux Sud-Ouest Talence33405 France School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen China

In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman–Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function. The typical application considered here is the computation of eigenvalues associated with non-negative operators as found, for example, in physics or particle simulation of rare-events. We focus on a novel lagged approximation of this invariant measure, based upon the introduction of a ratio of time-averaged Feynman–Kac marginals associated with a positive operator iterated l∈N times;a lagged Feynman–Kac formula. This estimator and its approximation using Diffusion Monte Carlo (DMC) are commonly used in the physics literature. In short, DMC is an iterative algorithm involving N∈N particles or walkers simulated in parallel, that undergo sampling and resampling operations. In this work, it is shown that for the DMC approximation of the lagged Feynman–Kac formula, one has an almost sure characterization of the L1-error as the time parameter (iteration) goes to infinity and this is at most of O(exp{−κl}/N), for κ>0. In addition a non-asymptotic in time, and time uniform L1−bound is proved which is O(l/N). We also prove a novel central limit theorem to give a characterization of the exact asymptotic in time variance. This analysis demonstrates that the strategy used in physics, namely, to run DMC with N and l small and, for long time enough, is mathematically justified. Our results also suggest how one should choose N and l in practice. We emphasize that these results are not restricted to physical applications;they have broad relevance to the general problem of particle simulation of the Feynman–Kac formula, which is utilized in a great variety of scientific and engineering fields. © 2025 Elsevier B.V.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Optimized Security Mechanism for publicly Secret Key Sharing over Cloud using Blockchain

Optimized Security Mechanism for publicly Secret Key Sharing...

引用

2024 International Symposium on Securing Next Generation Systems Using Future Artificial Intelligence Technologies, SNSFAIT 2024

作者： Byeon, Haewon Quraishi, Aadam Thuniki, Praveen Keshta, Ismail Soni, Mukesh Shabaz, Mohammad Department of AI and Software Inje University Gimhae50834 Korea Republic of Inje University Medical Big Data Research Center Gimhae50834 Korea Republic of Intervention Treatment Institute HoustonTX United States Sr Program Analyst Georgia CummingGA30040 United States Computer Science and Information Systems Department College of Applied Sciences Al Maarefa University Riyadh Saudi Arabia Dr. D. Y. Patii Vidyapeeth Pune Dr. D. Y. Patii School of Science & Technology Tathawade Pune India Model Institute of Engineering and Technology J&K Jammu India

A publicly verifiable key sharing mechanism based on threshold key sharing is provided to explore the security of users' private keys on the blockchain. Participating nodes check the key fragment after receiving it, effectively preventing it from being abused. The crucial sections of the nodes that participated in the critical splicing are made public during the critical recovery stage to prevent them from performing harmful things during the critical recovery stage. Add IDs to the nodes that participated in the crucial splicing during the key distribution stage;a dynamic threshold system is intended to track and update the status of malicious nodes in real time. When the node that possesses the crucial component fails, the owner of the critical component and the main node relocate a key element to the new participating nodes. To safeguard sensitive information. The experimental results show that this system has a key recovery rate of 80% and threshold qualities such as traceability, enforceability, and recoverability. © 2024 Copyright for this paper by its authors.

关键词： Blockchain Encryption Key sharing mechanism Privacy Secret key Security

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Based Classification of Micro-Doppler Radar Responses of Hands and Harmonically-Tagged Held Objects

TechRxiv

引用

TechRxiv 2022年

作者： Nourshamsi, Neda Maaz, Mohammad Jafari, Amir Hossein Nanzer, Jeffrey A. Department of Electrical and Computer Engineering Michigan State University East LansingMI48824 United States Data Science program The George Washington University WashingtonDC20052 United States

We explore the differentiability of the micro-Doppler signal responses of human hand motion and held objects using harmonic radar and harmonic tags. When observing moving hands and objects tagged with harmonic radio-frequency tags, the harmonic radar detects motion (Doppler) responses at the fundamental frequency (scattered from the hand) and at the harmonic frequency (generated by the tag). In homodyne harmonic radars, both frequency responses manifest at baseband. In this work we explore the feasibility of differentiating the micro-Doppler and harmonic micro-Doppler baseband responses using machine learning based classification. For this purpose, three different classification algorithms in parallel with Adam optimization have been deployed. Results are presented in terms of confusion matrix and receiver operating curve (ROC). Overall, Convolution neural network (CNN) provides more accurate performance compared to the other algorithms, demonstrating the first step in classifications of human and hand-held objects. This work provides a framework for future research in harmonic micro-Doppler signal classification. © 2022-11-13, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting CotA laccase from Antarctic Bacillus sp. PAMC28748 for efficient mediator-assisted dye decolorization and ABTS regeneration

引用

Chemosphere 2025年 372卷 144137页

作者： Karmacharya, Jayram Shrestha, Prasansah Han, So-Ra Lee, Jun Hyuck Oh, Tae-Jin Department of Life Science and Biochemical Engineering SunMoon University Asan31460 Korea Republic of Genome-based Bio-IT Convergence Institute Asan31460 Korea Republic of Bio Big Data-based Chungnam Smart Clean Research Leader Training Program SunMoon University Asan31460 Korea Republic of Division of Life Sciences Korea Polar Research Institute Incheon21990 Korea Republic of Department of Pharmaceutical Engineering and Biotechnology SunMoon University Asan31460 Korea Republic of

Laccases are of particular interest in addressing environmental challenges, such as the degradation of triphenylmethane (TPM) dyes, including crystal violet (CV) and Coomassie Brilliant Blue (CBB), which are commonly used in SDS-PAGE for protein visualization. However, these dyes present significant environmental concerns due to their resistance to degradation, which makes their removal from industrial wastewater a major challenge. To address this, the current study investigates the potential of a novel CotA laccase derived from Bacillus sp. PAMC28748, an Antarctic bacterial isolate, for decolorizing these stubborn dyes. The CotA gene was successfully cloned and expressed, and the enzyme demonstrated optimal activity at pH 3 and 50 °C, which favors its maximum catalytic performance. The recombinant Bacillus sp. PAMC28748 rBCLac effectively decolorized CBB without additional mediators, whereas the degradation of CV required the use of the redox mediator ABTS. With ABTS, over 90 % decolorization was achieved at a 0.35 % concentration of CV after 240 min of incubation. Further investigation through molecular docking studies revealed that hydrogen bonding and hydrophobic interactions between the enzyme and the dye molecules are critical for effective degradation, highlighting the enzyme's specific interaction mechanisms. In addition to its catalytic effectiveness, the study also demonstrated the practical potential of the rBCLac system by recovering and reusing both ABTS and rBCLac through ultracentrifugation and acetone precipitation. The process maintained over 75 % efficiency across three cycles, despite a slight decline in enzyme activity, thus showcasing the system's sustainability and reusability. These findings collectively suggest that rBCLac, isolated from an extreme Antarctic environment, holds considerable promise as a candidate for the removal of industrial wastewater containing persistent dyes, with the added potential for cost-effective and sustainable wat

关键词： Hydrogen bonds

来源：评论

学校读者我要写书评

暂无评论

On the Particle Approximation of Lagged Feynman-Kac Formulae

arXiv

引用

arXiv 2024年

作者： Awadelkarim, Elsiddig Caffarel, Michel Moral, Pierre Del Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia University of Toulouse CNRS-Lab. de Chimie et Physique Quantiques Toulouse31062 France Centre de Recherche Inria Bordeaux Sud-Ouest Talence33405 France School of Data Science The Chinese University Hong Kong Shenzhen China

In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman-Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function. The typical application considered here is the computation of eigenvalues associated with non-negative operators as found, for example, in physics or particle simulation of rare-events. We focus on a novel lagged approximation of this invariant measure, based upon the introduction of a ratio of time-averaged Feynman-Kac marginals associated with a positive operator iterated l ∈ N times;a lagged Feynman-Kac formula. This estimator and its approximation using Diffusion Monte Carlo (DMC) have been extensively employed in the physics literature. In short, DMC is an iterative algorithm involving N ∈ N particles or walkers simulated in parallel, that undergo sampling and resampling operations. In this work, it is shown that for the DMC approximation of the lagged Feynman-Kac formula, one has an almost sure characterization of the L1-error as the time parameter (iteration) goes to infinity and this is at most of O(exp{−κl}/N), for_ κ > 0. In addition a non-asymptotic in time, and time uniform L1−bound is proved which is O(l/√N). We also prove a novel central limit theorem to give a characterization of the exact asymptotic in time variance. This analysis demonstrates that the strategy used in physics, namely, to run DMC with N and l small and, for long time enough, is mathematically justified. Our results also suggest how one should choose N and l in practice. We emphasize that these results are not restricted to physical applications;they have broad relevance to the general problem of particle simulation of the Feynman-Kac formula, which is utilized in a great variety of scientific and engineering fields. © 2024, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Big data in healthcare:Conceptual network structure,key challenges and opportunities

引用

Digital Communications and Networks 2023年第4期9卷 856-868页

作者： Leonardo B.Furstenaua Pedro Leivas Michele Kremer Sott Michael S.Dohan Jose Ricardo Lopez-Robles Manuel J.Cobo Nicola Luigi Bragazzi Kim-Kwang Raymond Choo Post-Graduate Program in Industrial Engineering Federal University of Rio Grande Do SulPorto Alegre90035-190Brazil University of Santa Cruz Do Sul Av.Independencia 2293Santa Cruz Do SulRSBrazil Business School Unisinos UniversityAv.Dr.Nilo Peçanha 160091330-002Porto AlegreBrazil Faculty of Business Administration Lakehead UniversityThunder BayOntarioCanada Autonomous University of Zacatecas Av.Ramon Lopez Velarde Col.CentroZacatecas98000Mexico Department of Computer Science and Artificial Intelligence Andalusian Research Institute in Data Science and Computational Intelligence(DaSCI)University of GranadaGranada 18071Spain York University ON M3J 1P3Canada Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249USA

Big data is a concept that deals with large or complex data sets by using data analysis tools(e.g.,data mining,machine learning)to analyze information extracted from several sources *** data has attracted wide attention from academia,for example,in supporting patients and health professionals by improving the accuracy of decision-making,diagnosis and disease *** research aimed to perform a Bibliometric Performance and Network Analysis(BPNA)supported by a Scoping Review(SR)to depict the strategic themes,thematic evolution structure,main challenges and opportunities related to the concept of big data applied in the healthcare *** this goal in mind,4857 documents from the Web of science covering the period between 2009 to June 2020 were analyzed with the support of SciMAT *** bibliometric performance showed the number of publications and citations over time,scientific productivity and the geographic distribution of publications and research *** strategic diagram yielded 20 clusters and their relative importance in terms of centrality and *** thematic evolution structure presented the most important themes and how it changes over ***,we presented the main challenges and future opportunities of big data in healthcare.

关键词： Big data Healthcare digitalization Bibliometric Strategic intelligence Co-word analysis SciMAT

来源：评论

学校读者我要写书评

暂无评论

Generative adversarial networks applied to gene expression analysis: An interdisciplinary perspective

Computational and Systems Oncology

引用

Computational and Systems Oncology 2023年第3期3卷

作者： Ai, Xusheng Smith, Melissa C Feltus, Frank Alex Electrical and Computer Engineering Department Clemson University Clemson SC United States Department of Genetics and Biochemistry Biomedical Data Science & Informatics Program Clemson Center for Human Genetics Clemson University Clemson SC United States

The remarkable flexibility and adaptability of generative adversarial networks (GANs) have led to the proliferation of its models in bioinformatics research. Proteomic and transcriptomic profiles have been shown to be promising methods for discovering and identifying disease biomarkers. However, those analyses were performed by trained human examiners making the process tedious, time consuming, and hard to standardize. With the development of GANs, it is now possible to reduce computational costs and human time for bioinformatics analysis to produce effective biomarkers. Moreover, GANs help address the lack of phenotypic state transitional gene expression data as well as avoid protected human data constraints by generating RNA sequencing (RNA-seq) data from random vectors. The purpose of this review is to summarize the use of GAN approaches and techniques to augment RNA-seq expression data and identify clinically useful biomarkers. We compare different studies that use different types of GAN models to examine the biomarkers. Also, we identify research gaps and challenges that apply GANs to bio-informatics. Finally, we propose potential directions for future research. © 2023 The Authors. Computational and Systems Oncology published by Wiley Periodicals LLC.

关键词： biomarkers data augmentation generative adversarial network RNA sequencing

来源：评论

学校读者我要写书评

暂无评论

Dimension reduction of dynamical systems on networks with leading and non-leading eigenvectors of adjacency matrices

引用

Physical Review Research 2022年第2期4卷 023257-023257页

作者： Naoki Masuda Prosenjit Kundu Department of Mathematics State University of New York at Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

Dimension reduction techniques for dynamical systems on networks are considered to promote our understanding of the original high-dimensional dynamics. One strategy of dimension reduction is to derive a low-dimensional dynamical system whose behavior approximates the observables of the original dynamical system that are weighted linear summations of the state variables at the different nodes. Recently proposed methods use the leading eigenvector of the adjacency matrix of the network as the mixture weights to obtain such observables. In the present study, we explore performances of this type of one-dimensional reductions of dynamical systems on networks when we use non-leading eigenvectors of the adjacency matrix as the mixture weights. Our theory predicts that non-leading eigenvectors can be more efficient than the leading eigenvector and enables us to select the eigenvector minimizing the error. We numerically verify that the optimal non-leading eigenvector outperforms the leading eigenvector for some dynamical systems and networks. We also argue that, despite our theory, it is practically better to use the leading eigenvector as the mixture weights to avoid misplacing the bifurcation point too distantly and to be resistant against dynamical noise.

关键词： Network resilience

来源：评论

学校读者我要写书评

暂无评论

ECG signals-based security and steganography approaches in WBANs: A comprehensive survey and taxonomy

引用

Sustainable Computing: Informatics and Systems 2024年 41卷

作者： Masdari, Mohammad Band, Shahab S. Qasem, Sultan Noman Sayed, Biju Theruvil Pai, Hao-Ting Department of Computer Engineering Urmia Branch Islamic Azad University Urmia Iran Future Technology Research Center National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management International Graduate School of Artificial Intelligence National Yunlin University of Science and Technology Taiwan Riyadh11432 Saudi Arabia Computer Science Department Faculty of Applied Science Taiz University Taiz6803 Yemen Department of Computer Science Dhofar University PO Box 2509 SalalahPCode 211 Oman Bachelor Program of Big Data Applications in Business National Pingtung University Pingtung Taiwan

Wireless Body Area Networks (WBANs) are integral components of e-healthcare systems, responsible for monitoring patients' physiological states through intelligent implantable or wearable sensor nodes. These nodes collect medical data, which is then transmitted to remote healthcare facilities for thorough evaluation. Securing medical data within WBANs is paramount due to its central role in preserving patient privacy and confidentiality. Notably, Electrocardiogram (ECG) signals have recently gained prominence as pivotal elements within diverse security frameworks. Incorporating ECG signals strategically enhances the security and reliability of WBANs and broader e-healthcare systems, instilling greater trustworthiness. This survey article provides an in-depth exploration of contemporary ECG-based security schemes, adding to the scholarly discourse. The imperative to categorize these security paradigms revolves around their use of ECG signals. This categorization identifies three key domains: the first involves schemes that utilize ECG signals for cryptographic operations, encompassing key generation, agreement, management, and authentication. The second category employs steganography-based techniques, using ECG signals to conceal patients' sensitive medical data. The third category focuses on enhancing ECG signal security during data transmission. Each category is meticulously elaborated, detailing architectural foundations, notable contributions, and intrinsic security services. Furthermore, each section presents a comprehensive overview of the attributes characterizing ECG-based security frameworks. This includes insights into employed datasets, simulation environments, evaluation metrics, and inherent advantages and limitations. Expanding on this, a thorough analysis of distinctive attributes underpinning these security frameworks concludes by shedding light on potential directions for future research. © 2023 Elsevier Inc.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A deep learning system for predicting time to progression of diabetic retinopathy

引用

NATURE MEDICINE 2024年第2期30卷 358-359页

作者： [Anonymous] Shanghai Belt and Road International Joint Laboratory for Intelligent Prevention and Treatment of Metabolic Disorders Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Center for Diabetes Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Department of Ophthalmology Huadong Sanatorium Wuxi China Department of Ophthalmology Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong China Singapore Eye Research Institute Singapore National Eye Centre Singapore Singapore Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Chemical and Biological Engineering The Hong Kong University of Science and Technology Hong Kong China State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Department of Ophthalmology Peking Union Medical College Hospital Peking Union Medical College Chinese Academy of Medical Sciences Beijing China Medical Records and Statistics Office Shanghai Sixth People’s Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Geriatrics Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Tech

We developed and validated a deep learning system (termed DeepDR Plus) in a diverse, multiethnic, multi-country dataset to predict personalized risk and time to progression of diabetic retinopathy. We show that DeepDR Plus can be integrated into the clinical workflow to promote individualized intervention strategies for the management of diabetic retinopathy.

关键词： Diabetes complications Machine learning Predictive markers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：