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

3rd International Conference on Computational Electronics for Wireless Communications, ICCWC 2023

作者： Shikha, Shikha Sethia, Divyashikha Indu, S. Department of Computer Science and Engineering Delhi Technological University Delhi India Department of Software Engineering Delhi Technological University Delhi India Department of Electronics and Communication Delhi Technological University Delhi India

ISBN: (纸本)9789819719426

In the last few years, combining multiple algorithms to improve the performance of machine learning models has been a common practice. However, its application to stress detection still needs to be explored. This paper uses a stacking ensemble technique to introduce a novel stress classification approach using electroencephalogram (EEG) signals. Specifically, the study evaluates the effectiveness of various classifiers, including Random Forest (RF), K-Nearest Neighbor (KNN), Gradient Boosting (GB), Naive Bayes (NB), Support Vector Machine (SVM), Logistic Regression (LR), Decision Tree (DT), and Adaboost (AB), individually and in combination with RF as the base model, for stress classification tasks. The paper uses the SAM40 Dataset consisting of 32-channel EEG data to extract features in time and frequency domains for stress classification. The results show that the stacked classifiers outperform single classifiers, with RF + KNN providing the highest accuracy of 98.55%. The findings suggest that a stacked classifier is a promising approach for stress classification, as it can leverage the strengths of different algorithms and improve generalization performance. It holds promising future applicability in personalized stress management, healthcare interventions, and addressing societal concerns related to mental well-being. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Zero Trust Networks: Evolution and Application from Concept to Practice

引用

computers, Materials & Continua 2025年第2期82卷 1593-1613页

作者： Yongjun Ren Zhiming Wang Pradip Kumar Sharma Fayez Alqahtani Amr Tolba Jin Wang School of Computer Science School of Cyber Science and EngineeringEngineering Research Center of Digital ForensicsMinistry of EducationNanjing University of Information Science and TechnologyNanjing210044China Department of Computing Science University of AberdeenAberdeenAB243FXUK Software Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh12372Saudi Arabia Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Sanya Institute of Hunan University of Science and Technology Sanya572024China

In the context of an increasingly severe cybersecurity landscape and the growing complexity of offensive and defen-sive techniques,Zero Trust Networks(ZTN)have emerged as a widely recognized *** Trust not only addresses the shortcomings of traditional perimeter security models but also consistently follows the fundamental principle of“never trust,always verify.”Initially proposed by John Cortez in 2010 and subsequently promoted by Google,the Zero Trust model has become a key approach to addressing the ever-growing security threats in complex network *** paper systematically compares the current mainstream cybersecurity models,thoroughly explores the advantages and limitations of the Zero Trust model,and provides an in-depth review of its components and key ***,it analyzes the latest research achievements in the application of Zero Trust technology across various fields,including network security,6G networks,the Internet of Things(IoT),and cloud computing,in the context of specific use *** paper also discusses the innovative contributions of the Zero Trust model in these fields,the challenges it faces,and proposes corresponding solutions and future research directions.

关键词： Zero trust cybersecurity software-defined perimeter micro-segmentation internet of things

来源：评论

学校读者我要写书评

暂无评论

MA-MFIF: When misaligned multi-focus Image fusion meets deep homography estimation

引用

Multimedia Tools and Applications 2025年第12期84卷 10877-10898页

作者： Zhao, Baojun Luo, Fei Fuentes, Joel Ding, Weichao Gu, Chunhua School of Information Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Information Technologies Universidad del Bio-Bio Chillán3780000 Chile

Multi-focus image fusion is a technique that combines multiple out-of-focus images to enhance the overall image quality. It has gained significant attention in recent years, thanks to the advancements in deep learning. However, one of the persistent challenges in this field is the processing of misaligned data, which can negatively impact the fusion results. To overcome this problem, a novel fusion framework with pre-registration is proposed for the fusion of misaligned multi-focus images. For pre-registration, content-aware deep homography estimation is used, which performs transfer learning on a real multi-focus image dataset to adapt to registration under defocused conditions. For fusion, a fusion module with dual-branch feature interaction is utilized to avoid invalid feature fusion and trained on real light field dataset to achieve better fusion performance. Qualitative and quantitative experimental results show that the proposed method has a 2-3 percentage point improvement in multiple evaluation metrics compared to existing advanced registration and fusion methods, and a maximum improvement of 4.83 percentage points in fusion performance when tested independently on the Lytro dataset. Additionally, We find that the value of the Qcv metric is greatly influenced by the alignment status of the input images, leading to its inability to reflect the fusion quality of aligned images. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Fairness-Aware Budgeted Edge Server Placement for Connected Autonomous Vehicles

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4762-4776页

作者： Wu, Jintao Xu, Xiaolong Cui, Guangming Zhang, Yiwen Qi, Lianyong Dou, Wanchun Cai, Zhipeng Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software Nanjing210044 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China Anhui University School of Computer Science and Technology Anhui230031 China College of Computer Science and Technology Qingdao266580 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China Georgia State University Department of Computer Science United States

Mobile edge computing (MEC) considerably enhances the capabilities and performance of connected autonomous vehicles (CAVs) by deploying edge servers (ESs) on roadside units (RSUs) near CAVs, thereby ensuring low-latency services. Given the constrained and costly nature of ES resources (computing, storage, and bandwidth), equitable ES utilization is critical for CAV operations. However, fairness considerations are often overlooked in current budgeted edge server placement (ESP) strategies, potentially worsening resource imbalances and compromising user experience. This paper investigates the fairness-aware budgeted edge server placement (FESP) problem within RSUs, proving its NP-hardness. To address FESP, we first propose FESP-O, an integer programming-based optimal approach for small-scale problems, followed by FESP-APX, an approximation approach for large-scale scenarios that provides near-optimal solutions. We analyze the time complexity and approximation ratio of our proposed algorithms and validate their efficacy through experiments on real-world datasets. Extensive experimental results demonstrate significant performance improvements over baseline and state-of-the-art methods, indicating practical suitability and efficiency. © 2002-2012 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Layout Decomposition via Boolean Satisfiability

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 1112-1125页

作者： Liu, Hongduo Liao, Peiyu Zou, Mengchuan Pang, Bowen Li, Xijun Yuan, Mingxuan Ho, Tsung-Yi Yu, Bei The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong Hong Kong Huawei Noah's Ark Lab Hong Kong Hong Kong Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing100190 China

Multiple patterning lithography (MPL) has been introduced in the integrated circuits manufacturing industry to enhance feature density as the technology node advances. A crucial step of MPL is assigning layout features to different masks, namely layout decomposition. Exact algorithms like integer linear programming (ILP) can solve layout decomposition to optimality but lack scalability for dense patterns. Relaxation algorithms (e.g., linear programming and semi-definite programming) and heuristics (e.g., exact cover) are capable of handling large cases at the cost of inferior solution quality. These methods rely on different mathematical solvers and expert-designed heuristics to offer a balance between solution quality and computational efficiency. In this article, we propose a unified layout decomposition framework comprising three algorithms: 1) satisfiability (SAT)-exact;2) SAT-bilevel;and 3) SAT-fast, all leveraging the capabilities of Boolean SAT solvers. The SAT-exact ensures optimality, but with faster convergence than ILP, SAT-bilevel addresses the decomposition as a bilevel optimization problem for rapid near-optimal solutions, and SAT-fast handles very large layouts in an incremental manner. Experimental results demonstrate our framework's superiority over existing state-of-the-art methods in terms of solution quality and runtime. © 2024 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An Automated Approach to Discovering software Refactorings by Comparing Successive Versions

引用

IEEE Transactions on software engineering 2025年第05期51卷 1358-1380页

作者： Liu, Bo Liu, Hui Niu, Nan Zhang, Yuxia Li, Guangjie Jiang, He Jiang, Yanjie University of Cincinnati Department of Electrical Engineering and Computer Science CincinnatiOH United States National Innovation Institute of Defense Technology Beijing China School of Software Dalian University of Technology Dalian China Beijing Institute of Technology School of Computer Science and Technology Beijing China Peking University School of Computer Science Beijing China

software developers and maintainers frequently conduct software refactorings to improve software quality. Identifying the conducted software refactorings may significantly facilitate the comprehension of software evolution, and thus facilitate software maintenance and evolution. Besides that, the identified refactorings are also valuable for data-driven approaches in software refactoring. To this end, researchers have proposed a few approaches to identifying software refactorings automatically. However, the performance (especially precision) of such approaches deserves substantial improvement. To this end, in this paper, we propose a novel refactoring detection approach, called REEXTRACTOR+. At the heart of REEXTRACTOR+ is a reference-based entity matching algorithm that matches coarse-grained code entities (e.g., classes and methods) between two successive versions, and a context-aware statement matching algorithm that matches statements within a pair of matched methods. We evaluated REEXTRACTOR+ on a benchmark consisting of 400 commits from 20 real-world projects. The evaluation results suggested that REEXTRACTOR+ significantly outperformed the state of the art in refactoring detection, reducing the number of false positives by 59.6% and improving recall by 19.2%. We also evaluated the performance of the proposed matching algorithms that serve as the cornerstone of refactoring detection. The evaluation results suggested that the proposed algorithms excel in matching code entities, substantially reducing the number of mistakes (false positives plus false negatives) by 67% compared to the state-of-the-art approaches. © 2025 IEEE.

关键词： software quality

来源：评论

学校读者我要写书评

暂无评论

An Efficient Dialogue Policy Agent with Model-Based Causal Reinforcement Learning 31

An Efficient Dialogue Policy Agent with Model-Based Causal R...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Xu, Kai Wang, Zhenyu Zhao, Yangyang Fang, Bopeng School of Software Engineering South China University of Technology Guangdong China Department of Computer and Communication Engineering Changsha University of Science and Technology Changsha China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798891761964

Dialogue policy trains an agent to select dialogue actions frequently implemented via deep reinforcement learning (DRL). The model-based reinforcement methods built a world model to generate simulated data to alleviate the sample inefficiency. However, traditional world model methods merely consider one-step dialogues, leading to an inaccurate environmental simulation. Furthermore, different users may have different intention preferences, while most existing studies lack consideration of the intention-preferences causal relationship. This paper proposes a novel framework for dialogue policy learning named MCA, implemented through model-based reinforcement learning with automatically constructed causal chains. The MCA model utilizes an autoregressive Transformer to model dialogue trajectories, enabling a more accurate simulation of the environment. Additionally, it constructs a causal chains module that outputs latent preference distributions for intention-action pairs, thereby elucidating the relationship between user intentions and agent actions. The experimental results show that MCA can achieve state-of-the-art performances on three dialogue datasets over the compared dialogue agents, highlighting its effectiveness and robustness. © 2025 Association for Computational Linguistics.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An LLM-Based Framework for Synthetic Data Generation 15

An LLM-Based Framework for Synthetic Data Generation

引用

15th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2025

作者： Goyal, Mandeep Mahmoud, Qusay H. Ontario Tech University Department of Electrical Computer and Software Engineering OshawaONL1G 0C5 Canada

ISBN: (纸本)9798331507695

The demand for high-quality datasets is rapidly increasing across sectors such as healthcare, finance, and cybersecurity, yet challenges like data scarcity and privacy concerns persist. To address this, we introduce a framework for synthetic data generation that empowers users to create realistic datasets while maintaining privacy. The framework leverages fine-tuned Large Language Models (LLMs) and differential privacy techniques, including IBM's diffprivlib, to generate synthetic data that replicates real-world patterns without exposing sensitive information. A proof-of-concept platform has been constructed to facilitate seamless data generation and augmentation, making it particularly useful in scenarios where original datasets are inaccessible, scarce, or privacy-restricted. The platform supports the creation of datasets across five key categories, employing advanced methods to preserve data integrity while ensuring compliance with stringent privacy standards. By combining cutting-edge AI technologies with robust privacy-preserving techniques, this framework offers a practical solution for researchers and professionals seeking reliable synthetic data to drive innovation in data-sensitive fields. © 2025 IEEE.

关键词： Data integrity

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient modeling in WSN-assisted IoT based on software defined network

引用

Computing 2025年第6期107卷 1-35页

作者： Hajian, Elham Khayyambashi, Mohammad Reza Movahhedinia, Naser Computer Engineering Department Faculty of Engineering University of Bojnord Bojnord Iran Department of Computer Architecture Faculty of Computer Engineering University of Isfahan Isfahan Iran Department of Software Engineering Faculty of Computer Engineering University of Isfahan Isfahan Iran

Consolidating the Internet of Things (IoT) and software Defined Networks (SDN) has been a great concern among researchers. In IoT, Wireless Sensor Network (WSN) is important communication component. Due to the large volume of data generated in IoT and the limitations of WSN, load distribution in these networks is a serious challenge. The Base Station (BS) in these networks may experience a lot of delay due to high processing. Also, data of applications in these networks must inform to users with the lowest delay. Therefore, in addition to load distribution, reducing response time is also one of the factors that must be considered. Therefore, load distribution among BS’s seems to be crucial Considering several BSs and their relationships with the network nodes and preventing them from overloading through load distribution may solve the problem. This can be implemented by applying the common nodes that belong to several BSs. That is, to reduce the load of the overloaded BS, the common node in the cluster corresponding to BS and the other BSs is selected to send common node load to the other BSs. The common node is selected through the load-balancing node-finder algorithm. Load transfer is done through the forwarding node, which is specified in the proposed routing process. The Colored Petri Nets (CPN) s are applied to implement the proposed method. Here, queue length, residual energy, nodes, BSs, and delay time are simulated in three scenarios. The results show that most of the nodes are applied in the proposed algorithm to implement load balancing between the nodes and BSs. The results show the proposed SDN-based algorithm reduces the residual energy to 18%, the queue length to 9.5%, and the delay to 35%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Performance of Machine Learning Models in Healthcare: An Analytical Framework for Assessing and Improving Data Quality 5th

Enhancing Performance of Machine Learning Models in Healthca...

引用

5th International Conference on Advances in Information Communication Technology and Computing, AICTC 2024

作者： Al-Hgaish, Areen Atan, Rodziah Yaakob, Razali Osman, Mohd Hafeez Department of Software Engineering and Information Systems Faculty of Computer Science and Information Technology Universiti Putra Malaysia Serdang44330 Malaysia Department of Computer Science Faculty of Computer Science and Information Technology Universiti Putra Malaysia Serdang44330 Malaysia

ISBN: (纸本)9789819761050

The utilization of Data-Driven Machine Learning (DDML) models in the healthcare sector poses unique challenges due to the crucial nature of clinical decision-making and its impact on patient outcomes. A primary concern in this domain is the data quality that forms the basis for these models, which is essential for their effectiveness. While numerous studies are dedicated to leveraging Machine Learning (ML) to enhance patient care, a substantial gap exists in understanding and evaluating the quality of training data before training ML models. This issue is exacerbated by the lack of well-defined standards to ensure that data characteristics align with the specific goals of ML in healthcare. To address this, our study introduces a conceptual three-dimensional framework focusing on data accuracy, completeness, and consistency aimed at assessing and improving the quality of training data. This framework is designed to enhance the performance, predictability, and interpretability of healthcare-specific ML models and reduce biases, thus bridging current research gaps and laying the groundwork for future developments in ML-driven healthcare systems. This paper presents the initial step for our proposed Data Quality Framework (DQF), which addresses the three dimensions mentioned above. It discusses its potential implications and applications in healthcare data, and its main goal is to provide a comprehensive overview of the proposed DQF, illustrating its significance in advancing healthcare data quality and ultimately improving patient outcomes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Data accuracy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：