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

Resilient Distributed Optimization for Multi-Agent Cyberphysical Systems

IEEE Transactions on Automatic Control 2025年第6期70卷 3952-3967页

作者： Yemini, Michal Nedic, Angelia Goldsmith, Andrea J. Gil, Stephanie Bar-Ilan University Faculty of Engineering Israel Arizona State University School of Electrical Computer and Energy Engineering TempeAZ85281 United States Princeton University Department of Electrical and Computer Engineering PrincetonNJ08544 United States Harvard University Computer Science Department School of Engineering and Applied Sciences CambridgeMA02139 United States

This work focuses on the problem of distributed optimization in multi-agent cyberphysical systems, where a legitimate agent's iterates are influenced both by the values it receives from potentially malicious neighboring agents, and by its own self-serving target function. We develop a new algorithmic and analytical framework to achieve resilience for the class of problems where stochastic values of trust between agents exist and can be exploited. In this case, we show that convergence to the true global optimal point can be recovered, both in mean and almost surely, even in the presence of malicious agents. Furthermore, we provide expected convergence rate guarantees in the form of upper bounds on the expected squared distance to the optimal value. Finally, numerical results are presented that validate our analytical convergence guarantees even when the malicious agents compose the majority of agents in the network and where existing methods fail to converge to the optimal nominal points. © 1963-2012 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Enhanced MADM Strategy with Heptapartitioned Neutrosophic Distance Metrics

引用

Neutrosophic Sets and Systems 2025年 78卷 74-96页

作者： Eassa, Mohamed Myvizhi, M. Elkholy, Mohamed Abdelhafeez, Ahmed Elbehiery, Hussam Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan Department of Mathematics KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Faculty of Computer Science& Engineering Alamein International University Egypt

In this work, a novel methodological approach to multi-attribute decision-making problems is developed and the notion of Heptapartitioned Neutrosophic Set Distance Measures (HNSDM) is introduced. By averaging the Penta-Partitioned Neutrosophic Distance Measures under particular conditional criteria, the suggested technique ranks the options. Additionally, we explore the fundamental characteristics of HNSDM and provide several illustrative theorems. The Heptapartitioned Neutrosophic Set Distance Measures are formulated based on the Hepta Neutrosophic Set. Lastly, a practical numerical example is provided to illustrate the efficacy of the suggested methodology. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioned Neutrosophic set Heptapartitioned Neutrosophic set and MADM strategy Heptapartitioned set Neutrosophic sine distance measure

来源：评论

学校读者我要写书评

暂无评论

Error-Correcting Graph Codes 16

Error-Correcting Graph Codes

引用

16th Innovations in Theoretical computer Science Conference, ITCS 2025

作者： Kopparty, Swastik Potukuchi, Aditya Sha, Harry Department of Mathematics Department of Computer Science University of Toronto Canada Department of Electrical Engineering and Computer Science York University Toronto Canada

ISBN: (纸本)9783959773614

In this paper, we construct Error-Correcting Graph Codes. An error-correcting graph code of distance δ is a family C of graphs, on a common vertex set of size n, such that if we start with any graph in C, we would have to modify the neighborhoods of at least δn vertices in order to obtain some other graph in C. This is a natural graph generalization of the standard Hamming distance error-correcting codes for binary strings. Yohananov and Yaakobi were the first to construct codes in this metric. We extend their work by showing 1. Combinatorial results determining the optimal rate vs distance trade-off nonconstructively. 2. Graph code analogues of Reed-Solomon codes and code concatenation, leading to positive distance codes for all rates and positive rate codes for all distances. 3. Graph code analogues of dual-BCH codes, yielding large codes with distance δ = 1 - o(1). This gives an explicit "graph code of Ramsey graphs". Several recent works, starting with the paper of Alon, Gujgiczer, Körner, Milojević, and Simonyi, have studied more general graph codes;where the symmetric difference between any two graphs in the code is required to have some desired property. Error-correcting graph codes are a particularly interesting instantiation of this concept. © Swastik Kopparty, Aditya Potukuchi, and Harry Sha.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Edge detection using the Prewitt operator with fractional order telegraph partial differential equations (PreFOTPDE)

引用

Multimedia Tools and Applications 2025年第13期84卷 12329-12345页

作者： Tenekeci, Mehmet Emin Abdulazeez, Sadeq Taha Karadağ, Kerim Modanli, Mahmut Department of Computer Engineering Faculty of Engineering Harran University Şanlıurfa Turkey Department of Mathematics College of Basic Education University of Duhok Duhok Iraq Department of Electrical and Electronics Engineering Faculty of Engineering Harran University Şanlıurfa Turkey Depertmants of Mathematics Faculty of Arts and Sciences Harran University Sanliurfa Turkey

Detecting edges in image processing is an important process in image analysis or enhancement. Many methods detected edge information based on the differences in brightness values. Prewitt, the most widely used edge detection method, performs the extraction of edges by partial differential calculation. This study performed fractional order partial differential calculation with the Telegraph equation in the Prewitt method calculation. Filter coefficients are determined by using Grumwald-Letnikov series expansion for fractional partial differential equation calculation. To determine the most appropriate fraction value, five different coefficients were tried. The proposed method is compared with the conventional edge detection methods Sobel, Canny and standard Prewitt. The obtained result showed that the proposed method detects the edges more accurately. In addition, it has been compared with Prewitt fractional order edge detection (FOED) and edge detection method based on ant colony optimization (ACO) methods developed in recent years. Pratt's figure of merit (FOM) metric was used to compare these studies. It was realized that the FOM values calculated with the proposed method were more accurate than the others methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant properties of scale-free linear protocols for synchronization of homogeneous multi-agent systems

引用

IEEE Transactions on Automatic Control 2025年第6期70卷 4194-4201页

作者： Stoorvogel, Anton A. Saberi, Ali Liu, Zhenwei University of Twente Department of Electrical Engineering Mathematics and Computer Science P.O. Box 217 Enschede Netherlands Washington State University School of Electrical Engineering and Computer Science PullmanWA99164 United States Northeastern University College of Information Science and Engineering Shenyang110819 China

Originally, protocols were designed for multi-agent systems (MAS) using information about the network which might not be available. Recently, there has been a focus on scale-free synchronization where the protocol is designed without any prior information about the network. As long as the network contains a directed spanning tree, a scale-free protocol guarantees that the network achieves synchronization. If there is no directed spanning tree then synchronization cannot be achieved. But what happens when these scale-free protocols are applied to such a network where the directed spanning tree no longer exists? This paper establishes that the network decomposes into a number of basic bicomponents which achieves synchronization among all nodes in this basic bicomponent. On the other hand, nodes which are not part of any basic bicomponent converge to a weighted average of the synchronized trajectories of the basic bicomponents. The weights are independent of the initial conditions and are independent of the designed protocol. © 1963-2012 IEEE.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Application of computer Vision Technology in User Interface Design 3rd

Application of Computer Vision Technology in User Interface ...

引用

3rd World Conference on Intelligent and 3D Technologies, WCI3DT 2024

作者： Su, Jianna Department of Mathematics and Computer Engineering Ordos Institute of Applied Technology Inner Mongolia Erdos017010 China

ISBN: (纸本)9789819791231

This article explores the application of computer vision technology in user interface design, particularly through gesture recognition to enhance human–computer interaction. Gestures offer natural and versatile advantages in the process of human–computer interaction. Vision-based gesture recognition technology has broad application potential in virtual environments, sign language recognition, machine control, and other fields. In the task of gesture recognition in user interface design, the recognition results are affected by some irrelevant factors, such as dynamic backgrounds and close-fitting clothing. The attention mechanism is a good way to address the above problems, as it applies weights to key areas to extract essential features, thereby improving the model's performance. Several commonly used attention mechanisms, such as spatial attention, channel attention, and mixed attention mechanisms, can only apply attention to a single-frame image, focusing on specific regions. However, gestures consist of sequences of multiple-frame images, and the recognition results are collectively influenced by multiple-frame gesture images. The aforementioned attention mechanisms cannot meet the requirements effectively. To address this issue, a joint intra-frame and inter-frame attention module has been investigated. The model is able to prevent the impact of irrelevant elements during the gesture identification process because of this module's ability to apply attention concurrently across many consecutive frames and inside a single frame. In order to further user interface design, this study employs convolutional neural networks to include gesture recognition. These results shed light on how computer vision technology may revolutionize UI design and enhance user experiences. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

Science China(Information Sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Addressing Imbalance in Health Datasets: A New Method NR-Clustering SMOTE and Distance Metric Modification

引用

computers, Materials & Continua 2025年第2期82卷 2931-2949页

作者： Hairani Hairani Triyanna Widiyaningtyas Didik Dwi Prasetya Afrig Aminuddin Department of Electrical Engineering and Informatics Faculty of EngineeringUniversitas Negeri MalangMalang65145Indonesia Department of Computer Science Universitas BumigoraMataram83127Indonesia Department of Computer Graphic and Multimedia Faculty of ComputingCollege of Computing and Applied SciencesUniversiti Malaysia Pahang Al-Sultan AbdullahPekan26600Malaysia

An imbalanced dataset often challenges machine learning, particularly classification methods. Underrepresented minority classes can result in biased and inaccurate models. The Synthetic Minority Over-Sampling Technique (SMOTE) was developed to address the problem of imbalanced data. Over time, several weaknesses of the SMOTE method have been identified in generating synthetic minority class data, such as overlapping, noise, and small disjuncts. However, these studies generally focus on only one of SMOTE’s weaknesses: noise or overlapping. Therefore, this study addresses both issues simultaneously by tackling noise and overlapping in SMOTE-generated data. This study proposes a combined approach of filtering, clustering, and distance modification to reduce noise and overlapping produced by SMOTE. Filtering removes minority class data (noise) located in majority class regions, with the k-nn method applied for filtering. The use of Noise Reduction (NR), which removes data that is considered noise before applying SMOTE, has a positive impact in overcoming data imbalance. Clustering establishes decision boundaries by partitioning data into clusters, allowing SMOTE with modified distance metrics to generate minority class data within each cluster. This SMOTE clustering and distance modification approach aims to minimize overlap in synthetic minority data that could introduce noise. The proposed method is called “NR-Clustering SMOTE,” which has several stages in balancing data: (1) filtering by removing minority classes close to majority classes (data noise) using the k-nn method;(2) clustering data using K-means aims to establish decision boundaries by partitioning data into several clusters;(3) applying SMOTE oversampling with Manhattan distance within each cluster. Test results indicate that the proposed NR-Clustering SMOTE method achieves the best performance across all evaluation metrics for classification methods such as Random Forest, SVM, and Naїve Bayes, compared t

关键词： SMOTE modification Clustering-SMOTE manhattan distance

来源：评论

学校读者我要写书评

暂无评论

Development of Mechatronic Solution on Hot-Stamping Heads 33rd

Development of Mechatronic Solution on Hot-Stamping Heads

引用

33rd International Conference on Organization and Technology of Maintenance, OTO 2024

作者： Ostojić, Ivan Velimirović, Mirjana Kovačević, Nada Ratković Dihovicni, Djordje Computer-Mechanical Engineering Section Department of Electrical and Computer Engineering Academy of Technical Applied Studies Belgrade Belgrade Serbia Urban Technics Valjevo Serbia

ISBN: (纸本)9783031805967

The general goal of the research is to reduce loss of productivity, failure and downtime and the percentage of waste in production in the company, which is already committed to and successful in applying standards, raising the quality of service, as well as occupational safety and environmental protection. In this scientific paper a mechatronic subsystem is designed and implemented, as an addition to the hot-stamping production line, which would monitor whether there are present (and whether there are in quantities enough of) each of the three thermoplastic, metallized strips, which line the product - profiled lath. When it is detected and recognized that the tape will soon be used up, the sub-system automatically signals this with turning off heating of the slat and activating a sound alarm, attracting attention of the human operator. The heater switches off automatically if the strip loss has occurred (event driven system), in order to prevent deformation of the slat profile. The subsystem includes automatic monitoring of the remaining amount of tape, alarm notification in case of imminent disappearance of the tape, with the heater turned off and alarming the operator. The human operator then has enough time to replace the tape (approximately five to ten minutes, depending on the product). The subsystem described above is designed, built, implemented, tested and put in operation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Learned, uncertainty-driven adaptive acquisition for photon-efficient scanning microscopy

引用

Optics Express 2025年第6期33卷 12269-12287页

作者： Ye, Cassandra Tong Han, Jiashu Liu, Kunzan Angelopoulos, Anastasios Griffith, Linda Monakhova, Kristina You, Sixian The Department of Electrical Engineering and Computer Science CambridgeMA02139 United States Fu Foundation School of Engineering and Applied Science Columbia University in The City of New York New YorkNY10027 United States University of California Berkeley Department of Electrical Engineering and Computer Science BerkeleyCA94720 United States Department of Biological Engineering Massachusetts Institute of Technology CambridgeMA02139 United States

Scanning microscopy systems, such as confocal and multiphoton microscopy, are powerful imaging tools for probing deep into biological tissue. However, scanning systems have an inherent trade-off between acquisition time, field of view, phototoxicity, and image quality. This often results in noisy measurements when fast, large field of view, and/or gentle imaging is needed. Deep learning could be used to denoise noisy microscopy measurements, but these algorithms can be prone to hallucination, which can be disastrous for medical and scientific applications. We propose a method to simultaneously denoise and predict pixel-wise uncertainty for scanning microscopy systems, improving algorithm trustworthiness and providing statistical guarantees for deep learning predictions. Furthermore, we propose to leverage this learned, pixel-wise uncertainty to drive an adaptive acquisition technique that rescans only the most uncertain regions of a sample, saving time and reducing the total light dose to the sample. We demonstrate our method on experimental confocal and multiphoton microscopy systems, showing that our uncertainty maps can pinpoint hallucinations in the deep learned predictions. Finally, with our adaptive acquisition technique, we demonstrate up to 16× reduction in acquisition time and total light dose while successfully recovering fine features in the sample and reducing hallucinations. We are the first to demonstrate distribution-free uncertainty quantification for a denoising task with real experimental data and the first to propose adaptive acquisition based on reconstruction uncertainty. © 2025 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：