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

11th International Conference on Electrical Engineering, computer science and Informatics, EECSI 2024

作者： Yunita, Yunita Stiawan, Deris Rini, Dian Palupi Sriwijaya University Faculty of Computer Science Indonesia Sriwijaya University Intelligent System Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Communication Network and Information Security Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Image Processing Dan Pattern Recognition Laboratory Group Faculty of Computer Science South Sumatera Palembang Indonesia

ISBN: (纸本)9798350355314

One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems © 2024 IEEE.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based ECG Classification for Arterial Fibrillation Detection

引用

computers, Materials & Continua 2024年第6期79卷 4805-4824页

作者： Muhammad Sohail Irshad Tehreem Masood Arfan Jaffar Muhammad Rashid Sheeraz Akram Abeer Aljohani Faculty of Computer Science&Information Technology The Superior UniversityLahore54000Pakistan Intelligent Data Visual Computing Research(IDVCR) Lahore54000Pakistan Department of Computer Science National University of TechnologyIslamabad45000Pakistan Information Systems Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia Department of Computer Science Applied CollegeTaibah UniversityMedina42353Saudi Arabia

The application of deep learning techniques in the medical field,specifically for Atrial Fibrillation(AFib)detection through Electrocardiogram(ECG)signals,has witnessed significant *** and timely diagnosis increases the patient’s chances of ***,issues like overfitting and inconsistent accuracy across datasets remain *** a quest to address these challenges,a study presents two prominent deep learning architectures,ResNet-50 and DenseNet-121,to evaluate their effectiveness in AFib *** aim was to create a robust detection mechanism that consistently performs *** such as loss,accuracy,precision,sensitivity,and Area Under the Curve(AUC)were utilized for *** findings revealed that ResNet-50 surpassed DenseNet-121 in all evaluated *** demonstrated lower loss rate 0.0315 and 0.0305 superior accuracy of 98.77%and 98.88%,precision of 98.78%and 98.89%and sensitivity of 98.76%and 98.86%for training and validation,hinting at its advanced capability for AFib *** insights offer a substantial contribution to the existing literature on deep learning applications for AFib detection from ECG *** comparative performance data assists future researchers in selecting suitable deep-learning architectures for AFib ***,the outcomes of this study are anticipated to stimulate the development of more advanced and efficient ECG-based AFib detection methodologies,for more accurate and early detection of AFib,thereby fostering improved patient care and outcomes.

关键词： Convolution neural network atrial fibrillation area under curve ECG false positive rate deep learning classification

来源：评论

学校读者我要写书评

暂无评论

A Fast Optimistic Method for Monotone Variational Inequalities 40

A Fast Optimistic Method for Monotone Variational Inequaliti...

引用

40th International Conference on Machine Learning, ICML 2023

作者： Sedlmayer, Michael Nguyen, Dang-Khoa Bot, Radu Ioan Research Network Data Science University of Vienna Vienna Austria Faculty of Mathematics University of Vienna Vienna Austria

We study monotone variational inequalities that can arise as optimality conditions for constrained convex optimisation or convex-concave minimax problems and propose a novel algorithm that uses only one gradient/operator evaluation and one projection onto the constraint set per iteration. The algorithm, which we call fOGDA-VI, achieves a o(1/k) rate of convergence in terms of the restricted gap function as well as the natural residual for the last iterate. Moreover, we provide a convergence guarantee for the sequence of iterates to a solution of the variational inequality. These are the best theoretical convergence results for numerical methods for (only) monotone variational inequalities reported in the literature. To empirically validate our algorithm we investigate a two-player matrix game with mixed strategies of the two players. Concluding, we show promising results regarding the application of fOGDA-VI to the training of generative adversarial nets. © 2023 Proceedings of Machine Learning research. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

HPC-in-Containers: A Containerized Parallel Environment for Parallel Programming Learning Using Docker

HPC-in-Containers: A Containerized Parallel Environment for ...

引用

2024 International Conference on Information Technology Systems and Innovation, ICITSI 2024

作者： Arisal, Andria Suhartanto, Heru National Research and Innovation Agency Research Center for Data and Information Sciences Bandung Indonesia University of Indonesia Faculty of Computer Science Depok Indonesia

ISBN: (纸本)9798331511470

This paper presents HPC-in-Containers, a novel containerized parallel computing environment using Docker. It is designed to facilitate learning parallel programming concepts, where users do not have to deploy a multicomputer infrastructure. Instead, they can use their desktop and laptop to easily have a multicomputer environment by utilizing containerization on the multi-core CPU. The environment offers a comprehensive platform for exploring various parallel programming paradigms, including distributed memory parallelism, shared memory parallelism, and hybrid approaches. We include source code samples for each paradigm to demonstrate its capabilities: parallel multicomputer implementations using MPI, parallel thread implementations for single computers using OpenMP, and hybrid parallelization techniques combining both MPI and OpenMP. Furthermore, to enhance user interaction and ease of use, the Docker image incorporates a Jupyter Notebook interface with a C interpreter, allowing users to write, execute, and visualize parallel code through a web browser. This feature makes HPC-in-Containers particularly suitable for educational settings, enabling students to experiment with parallel programming concepts in a controlled, reproducible environment. Our work contributes to the field of parallel computing education by providing a flexible, scalable, and easily deployable platform that bridges the gap between theoretical concepts and practical implementation. It offers a valuable resource for educators, students, and researchers seeking to explore and master the intricacies of parallel programming in a containerized setting. © 2024 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

MOCBOA:Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems

引用

computer Modeling in Engineering & sciences 2025年第4期143卷 967-1008页

作者： Nour Elhouda Chalabi Abdelouahab Attia Abdulaziz S.Almazyad Ali Wagdy Mohamed Frank Werner Pradeep Jangir Mohammad Shokouhifar Computer Science Department University of M’silaIchebiliaM’sila28000Algeria Computer ScienceDepartment Mohamed El Bachir El IbrahimiUniversity of Bordj BouArreridjBordj BouArreridj34000Algeria Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11931Jordan Faculty of Mathematics Otto-von-Guericke UniversityMagdeburg39016Germany University Centre for Research and Development Chandigarh UniversityMohali140413India Department of Electrical and Computer Engineering Shahid Beheshti UniversityTehran14399Iran DTU AI and Data Science Hub(DAIDASH) Duy Tan UniversityDa Nang550000Vietnam

Multi-objective optimization is critical for problem-solving in engineering,economics,and *** study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct *** approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto *** comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume *** paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.

关键词： Multi-objective optimization chef-based optimization algorithm(CBOA) pareto dominance epsilon dominance cone-epsilon dominance strengthened dominance

来源：评论

学校读者我要写书评

暂无评论

Granularity is crucial when applying differential privacy to text: An investigation for neural machine translation

Granularity is crucial when applying differential privacy to...

引用

2024 Findings of the Association for Computational Linguistics, EMNLP 2024

作者： Vu, Doan Nam Long Igamberdiev, Timour Habernal, Ivan Trustworthy Human Language Technologies Germany Department of Computer Science Technical University of Darmstadt Germany Research Center Trustworthy Data Science and Security of the University Alliance Ruhr Faculty of Computer Science Ruhr University Bochum Germany

ISBN: (纸本)9798891761681

Applying differential privacy (DP) by means of the DP-SGD algorithm to protect individual data points during training is becoming increasingly popular in NLP. However, the choice of granularity at which DP is applied is often neglected. For example, neural machine translation (NMT) typically operates on the sentence-level granularity. From the perspective of DP, this setup assumes that each sentence belongs to a single person and any two sentences in the training dataset are independent. This assumption is however violated in many real-world NMT datasets, e.g., those including dialogues. For proper application of DP we thus must shift from sentences to entire documents. In this paper, we investigate NMT at both the sentence and document levels, analyzing the privacy/utility trade-off for both scenarios, and evaluating the risks of not using the appropriate privacy granularity in terms of leaking personally identifiable information (PII). Our findings indicate that the document-level NMT system is more resistant to membership inference attacks, emphasizing the significance of using the appropriate granularity when working with DP. © 2024 Association for Computational Linguistics.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge Computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-trial Vector-based Whale Optimization Algorithm

引用

Journal of Bionic Engineering 2024年第3期21卷 1465-1495页

作者： Mohammad H.Nadimi-Shahraki Hajar Farhanginasab Shokooh Taghian Ali Safaa Sadiq Seyedali Mirjalili Faculty of Computer Engineering Najafabad BranchIslamic Azad UniversityNajafabad***Iran Big Data Research Center Najafabad BranchIslamic Azad UniversityNajafabad***Iran Department of Computer Science Nottingham Trent UniversityNottinghamNG118NSUK Centre for Artificial Intelligence Research and Optimisation Torrens UniversityBrisbane4006Australia

The Whale Optimization Algorithm(WOA)is a swarm intelligence metaheuristic inspired by the bubble-net hunting tactic of humpback *** spite of its popularity due to simplicity,ease of implementation,and a limited number of parameters,WOA’s search strategy can adversely affect the convergence and equilibrium between exploration and exploitation in complex *** address this limitation,we propose a new algorithm called Multi-trial Vector-based Whale Optimization Algorithm(MTV-WOA)that incorporates a Balancing Strategy-based Trial-vector Producer(BS_TVP),a Local Strategy-based Trial-vector Producer(LS_TVP),and a Global Strategy-based Trial-vector Producer(GS_TVP)to address real-world optimization problems of varied degrees of ***-WOA has the potential to enhance exploitation and exploration,reduce the probability of being stranded in local optima,and preserve the equilibrium between exploration and *** the purpose of evaluating the proposed algorithm's performance,it is compared to eight metaheuristic algorithms utilizing CEC 2018 test ***,MTV-WOA is compared with well-stablished,recent,and WOA variant *** experimental results demonstrate that MTV-WOA surpasses comparative algorithms in terms of the accuracy of the solutions and convergence ***,we conducted the Friedman test to assess the gained results statistically and observed that MTV-WOA significantly outperforms comparative ***,we solved five engineering design problems to demonstrate the practicality of *** results indicate that the proposed MTV-WOA can efficiently address the complexities of engineering challenges and provide superior solutions that are superior to those of other algorithms.

关键词： Swarm intelligence algorithms Metaheuristic algorithms Optimization Engineering design problems Whale optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cross-Modal Interactive Memory network Based on Fine-Grained Medical Feature Extraction for Radiology Report Generation

A Cross-Modal Interactive Memory Network Based on Fine-Grain...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Ma, Xitong Kuang, Yuansen Yuan, Lin Tian, Cheng Zeng, Yijie Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Radiology report generation is an essential task in the medical field, which aims to automate the generation of medical terminology descriptions of radiology images. However, this task currently suffers from several problems: 1) existing methods need to manually build knowledge graphs or templates (consuming time and effort) to introduce medical or prior knowledge to assist in report generation;2) previous models cannot handle the problem of data bias well (anomaly reports and anomaly descriptions make up only a tiny portion of the dataset), causing the models to ignore the learning of anomaly descriptions easily;3) existing approaches cannot robustly supervise the model, resulting in incomplete and inconsistent reports being generated. To address these issues, we propose a cross-modal interactive memory network based on fine-grained medical feature extraction. In our model, we design a cross-modal interactive memory network to automatically store and remember the required medical text knowledge and use this medical knowledge to help generate reports. Furthermore, we design an abnormal medical knowledge enhancement module to enhance the learning of abnormal fine-grained knowledge through the interaction of disease topics and their states to interact with text features. In addition, we design a cross-modal joint semantic loss unit to reduce semantic differences between different features and improve the visual representation ability of the model. We experimented and evaluated our model on MIMIC-CXR and IU-Xray datasets to compare with other baseline models. © 2024 IEEE.

关键词： Radiology

来源：评论

学校读者我要写书评

暂无评论

An Entity Relation Extraction Framework Based on Large Language Model and Multi-Tasks Iterative Prompt Engineering

An Entity Relation Extraction Framework Based on Large Langu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Geng, Haibin Shi, Chenglong Jiang, Xuesong Kong, Zan Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Document-level entity relation extraction is an important task in the field of natural language processing, which plays an important role in semantic understanding and knowledge graph construction. However, existing deep neural networks and graph neural networks models are limited by their performance and parameters number, which can not capture global semantics and have poor generalization ability. Furthermore, existing methods employing large language model for entity relation extraction do not establish good relationships among multi-tasks of entity relation extraction task, resulting in more information can not be effectively shared and transmitted between tasks. In addition, previous approaches can not effectively eliminate false entities and relationships. To solve these problems, we propose an entity relation extraction framework based on large language model and multi-tasks iterative prompt engineering. In our model, we design an iterative prompt engineering, which can better establish the relationship among multi-tasks, and ensure every task to obtain the optimal results. Moreover, we design semantic merging, group disambiguation and self-verification modules to eliminate the false entity relations and noise nodes. Additionally, we design summary prompts to provide sufficient global semantics for better text segmentation. Finally, we evaluated our model on wikiann, wikineural, ACE2005, CoNLL2003, CoNLL2004, and SciERC datasets and compared it with other baseline models. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：