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

Artificial Intelligence-based Service Chains Scheduling for Medical Emergency in Healthcare

学校读者我要写书评

暂无评论

Artificial Intelligence-based Service Chains Scheduling for ...

International Conference on Contemporary computing and Informatics (IC3I)

作者： Mukesh Soni Maher Ali Rusho Haewon Byeon Azzah AlGhamdi Shaikh Abdul Hannan Parth Rameshchandra Dave Dr. D. Y. Patil Vidyapeeth Dr. D. Y. Patil School of Science & Technology Tathawade Pune Marashtra Department of Lockheed Martin Engineering Management University of Colorado Boulder Colorado Department of AI and Software & Medical Big Data Research Centre Inje University Gimhae Republic of Korea Computer Information Systems Department College of Computer Science and Information Technology Imam Abdalrhman Bin Faisal University Khobar Saudi Arabia Faculty of Computing and Information AlBaha University AlBaha Kingdom of Saudi Arabia Department of Computer Engineering L. D. College of Engineering Ahmedabad Gujarat India

ISBN: (数字)9798350350067

ISBN: (纸本)9798350350074

This study analyses the weekly scheduling challenge of health and medical information network service function chains to meet medical emergency categorization and grading needs. Emergency services are divided into four sorts by urgency and service area, with priorities and weights. The health and medical information network architecture, service model, and operation method are built accordingly. To reduce weighted completion time, a service function chain scheduling model is created. The function chain scheduling scheme is solved by matching game and Q -learning reinforcement learning algorithms for different issue scales. Finally, simulation studies demonstrate that this approach can accomplish graded medical emergency service, build health and medical information networks, and progress smart healthcare.

关键词： Schedules Job shop scheduling Service function chaining Hospitals Processor scheduling Reinforcement learning Games Emergency services Network function virtualization Standards

Deep learning for community detection: Progress, challenges and opportunities 29

学校读者我要写书评

暂无评论

Deep learning for community detection: Progress, challenges ...

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Liu, Fanzhen Xue, Shan Wu, Jia Zhou, Chuan Hu, Wenbin Paris, Cecile Nepal, Surya Yang, Jian Yu, Philip S. Department of Computing Macquarie University Sydney Australia CSIRO's Data61 Sydney Australia Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China School of Computer Science Wuhan University Wuhan China Department of Computer Science University of Illinois at Chicago Chicago United States

ISBN: (纸本)9780999241165

As communities represent similar opinions, similar functions, similar purposes, etc., community detection is an important and extremely useful tool in both scientific inquiry and data analytics. However, the classic methods of community detection, such as spectral clustering and statistical inference, are falling by the wayside as deep learning techniques demonstrate an increasing capacity to handle high-dimensional graph data with impressive performance. Thus, a survey of current progress in community detection through deep learning is timely. Structured into three broad research streams in this domain - deep neural networks, deep graph embedding, and graph neural networks, this article summarizes the contributions of the various frameworks, models, and algorithms in each stream along with the current challenges that remain unsolved and the future research opportunities yet to be explored. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： data Analytics

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

GradSA: Gradient Sparsification and Accumulation for Communication-Efficient Distributed Deep Learning 15th

学校读者我要写书评

暂无评论

GradSA: Gradient Sparsification and Accumulation for Communi...

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Liu, Bo Jiang, Wenbin Zhao, Shaofeng Jin, Hai He, Bingsheng National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Huazhong University of Science and Technology Wuhan China Library Henan University of Economics and Law Zhengzhou China Department of Computer Science School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9783030642426

Large-scale distributed deep learning is of great importance in various applications. For distributed training, the inter-node gradient communication often becomes the performance bottleneck. Gradient sparsification has been proposed to reduce the communication overhead. However, the sparsification only arbitrarily selects a small fraction of gradients, while the efficiency of selection dimension has been overlooked. Furthermore, gradient staleness is inevitable after applying the sparsification which will ultimately lead to model divergence. In this paper, we propose a staleness-compensated sparse stochastic gradient descent algorithm, GradSA, to improve the training efficiency. Layer-level gradients are sparsified to reduce the communication overhead, which conform to the characteristics of the network structure, and historical accumulation of the approximated gradients is utilized to speed up convergence. We demonstrate the model convergence acceleration and the efficiency of our layer-level selection over existing state-of-the-art works, such as DGC, TernGrad, and 8-Bit quantization. © 2020, Springer Nature Switzerland AG.

关键词： Efficiency

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025, CC BY-NC-SA.

关键词： Markov processes

Inverse learning of black-box aggregator for robust Nash equilibrium

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Guanpu Xu, Gehui He, Fengxiang Tao, Dacheng Parisini, Thomas Johansson, Karl Henrik Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Digital Futures Stockholm100 44 Sweden Artificial Intelligence and its Applications Institute School of Informatics University of Edinburgh EdinburghEH8 9AB United Kingdom College of Computing & Data Science Nanyang Technological University Singapore639798 Singapore Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom Department of Engineering and Architecture University of Trieste Trieste34127 Italy

In this note, we investigate the robustness of Nash equilibria (NE) in multi-player aggregative games with coupling constraints. There are many algorithms for computing an NE of an aggregative game given a known aggregator. When the coupling parameters are affected by uncertainty, robust NE need to be computed. We consider a scenario where players' weight in the aggregator is unknown, making the aggregator kind of "a black box". We pursue a suitable learning approach to estimate the unknown aggregator by proposing an inverse variational inequality-based relationship. We then utilize the counterpart to reconstruct the game and obtain first-order conditions for robust NE in the worst case. Furthermore, we characterize the generalization property of the learning methodology via an upper bound on the violation probability. Simulation experiments show the effectiveness of the proposed inverse learning approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Inverse problems

Engineering single-molecule fluorescence withasymmetric nano-antennas

学校读者我要写书评

暂无评论

Light(science & Applications) 2021年第5期10卷 858-866页

作者： Wenqi Zhao Xiaochaoran Tian Zhening Fang Shiyi Xiao Meng Qiu Qiong He Wei Feng Fuyou Li Yuanbo Zhang Lei Zhou Yan-Wen Tan State Key Laboratory of Surface Physics and Department of Physics Fudan UniversityShanghai 200433China Shanghai Institute for Advanced Communication and Data Science Shanghai UniversityShanghai 200444China Key Laboratory of Specialty Fiber Optics and Optical Access Networks Joint International Research Laboratory of Specialty Fiber Optics and Advanced CommunicationShanghai UniversityShanghai 200444China Department of Chemistry and State Key Laboratory of Molecular Engineering of Polymers Fudan UniversityShanghai 200433China Institute for Nanoelectronic Devices and Quantum Computing Fudan UniversityShanghai 200433China Collaborative Innovation Center of Advanced Microstructures Nanjing 210093China Multiscale Research Institute of Complex Systems Fudan UniversityShanghai 200433China

As a powerful tool for studying molecular dynamics in bioscience,single-molecule fluorescence detection providesdynamical information buried in ensemble *** in the near-infrared(NIR)is particularly usefulbecause it offers higher signal-to-noise ratio and increased penetration depth in tissue compared with *** low quantum yield of most NIR fluorophores,however,makes the detection of single-moleculefluorescence ***,we use asymmetric plasmonic nano-antenna to enhance the fluorescence intensity ofAlEE1000,a typical NIR dye,by a factor up to *** asymmetric nano-antenna achieve such an enhancement mainlyby increasing the quantum yield(to~80%)rather than the local field,which degrades the molecules'*** coupled-mode-theory analysis reveals that the enhancements stem from resonance-matching between antennaand molecule and,more importantly,from optimizing the coupling between the near-and far-ield modes withdesigner asymmetric *** work provides a universal scheme for engineering single-molecule fluorescence inthe near-infrared regime.

关键词： stability. asymmetric quantum

Enabling End-to-End Secure Federated Learning in Biomedical Research on Heterogeneous computing Environments with APPFLx

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hoang, Trung-Hieu Fuhrman, Jordan Madduri, Ravi Li, Miao Chaturvedi, Pranshu Li, Zilinghan Kim, Kibaek Ryu, Minseok Chard, Ryan Huerta, E.A. Giger, Maryellen Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana-Champaign Street UrbanaIL61801 United States University of Chicago ChicagoIL United States Data Science and Learning Division Argonne National Laboratory LemontIL United States Department of Computer Science University of Illinois at Urbana-Champaign Street UrbanaIL61801 United States School of Industrial and Systems Engineering Georgia Institute of Technology AtlantaGA United States School of Computing Augmented Intelligence Arizona State University TempeAZ United States

Facilitating large-scale, cross-institutional collaboration in biomedical machine learning projects requires a trustworthy and resilient federated learning (FL) environment to ensure that sensitive information such as protected health information is kept confidential. In this work, we introduce APPFLx, a low-code FL framework that enables the easy setup, configuration, and running of FL experiments across organizational and administrative boundaries while providing secure end-to-end communication, privacy-preserving functionality, and identity management. APPFLx is completely agnostic to the underlying computational infrastructure of participating clients. We demonstrate the capability of APPFLx as an easy-to-use framework for accelerating biomedical studies across institutions and healthcare systems while maintaining the protection of private medical data in two case studies: (1) predicting participant age from electrocardiogram (ECG) waveforms, and (2) detecting COVID-19 disease from chest radiographs. These experiments were performed securely across heterogeneous compute resources, including a mixture of on-premise high-performance computing and cloud computing, and highlight the role of federated learning in improving model generalizability and performance when aggregating data from multiple healthcare systems. Finally, we demonstrate that APPFLx serves as a convenient and easy-to-use framework for accelerating biomedical studies across institutions and healthcare system while maintaining the protection of private medical data. Copyright © 2023, The Authors. All rights reserved.

关键词： Privacy-preserving techniques

Towards Communication-efficient Federated Learning via Sparse and Aligned Adaptive Optimization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Xiumei Li, Jun Wei, Kang Shi, Long Xiong, Zeihui Ding, Ming Chen, Wen Jin, Shi Poor, H. Vincent School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China The Department of Computing Hong Kong Polytechnic University 999077 Hong Kong The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Data61 CSIRO SydneyNSW2015 Australia Department of Electronics Engineering Shanghai Jiao Tong University Shanghai200240 China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Department of Electrical and Computer Engineering Princeton University NJ08544 United States

Adaptive moment estimation (Adam), as a Stochastic Gradient Descent (SGD) variant, has gained widespread popularity in federated learning (FL) due to its fast convergence. However, federated Adam (FedAdam) algorithms suffer from a threefold increase in uplink communication overhead compared to federated SGD (FedSGD) algorithms, which arises from the necessity to transmit both local model updates and first and second moment estimates from distributed devices to the centralized server for aggregation. Driven by this issue, we propose a novel sparse FedAdam algorithm called FedAdam-SSM, wherein distributed devices sparsify the updates of local model parameters and moment estimates and subsequently upload the sparse representations to the centralized server. To further reduce the communication overhead, the updates of local model parameters and moment estimates incorporate a shared sparse mask (SSM) into the sparsification process, eliminating the need for three separate sparse masks. Theoretically, we develop an upper bound on the divergence between the local model trained by FedAdam-SSM and the desired model trained by centralized Adam, which is related to sparsification error and imbalanced data distribution. By minimizing the divergence bound between the model trained by FedAdam-SSM and centralized Adam, we optimize the SSM to mitigate the learning performance degradation caused by sparsification error. Additionally, we provide convergence bounds for FedAdam-SSM in both convex and non-convex objective function settings, and investigate the impact of local epoch, learning rate and sparsification ratio on the convergence rate of FedAdam-SSM. Experimental results show that FedAdam-SSM outperforms baselines in terms of convergence rate (over 1.1× faster than the sparse FedAdam baselines) and test accuracy (over 14.5% ahead of the quantized FedAdam baselines). Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems