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

A General Framework for Clustering and Distribution Matching with Bandit Feedback

IEEE Transactions on Information Theory 2025年第3期71卷 2116-2139页

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y. F. Scarlett, Jonathan CNRS@CREATE DesCartes Program CREATE Tower 138602 Singapore National University of Singapore Department of Computer Science Queenstown119077 Singapore National University of Singapore School of Computing Department of Information Systems and Analytics Queenstown119077 Singapore National University of Singapore Department of Mathematics Department of Electrical and Computer Engineering Queenstown119077 Singapore Institute of Data Science National University of Singapore Department of Computer Science The Department of Mathematics Queenstown119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank-Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ vanishes. © 1963-2012 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence algorithms for object detection and recognition in video and images

引用

Multimedia Tools and Applications 2025年 1-18页

作者： Dakshinamoorthy, Prabakar Rajaram, Gnanajeyaraman garg, Shruti Murugan, Prabhu Manimaran, A. Sundar, Ramesh Department of Data Science and Business System School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur Chennai India Department of Computer Science Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Tamilnadu Chennai India Birla Institute of Technology Mesra Ranchi India Department of ECE Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai602105 India Department of Computer Science Engineering Saveetha School Of EngineeringSaveetha Institute of Medical and Technical Sciences Chennai6021055 India Department of Netwoking and Communication School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur Chennai India

The usage of machine learning and deep learning algorithms have necessitated Artificial Intelligence'. AI is aimed at automating things by limiting human interference. It is widely used in IT, healthcare, finance, and agriculture. It is achieved through several deep learning algorithms that reflect the human brain's intelligence. These AI algorithms can be manipulated according to changing needs and improved efficiency. This paper tries to utilize the developments made in AI technology to classify the images and recognize the objects present in them. One widely used AI algorithm is CNN (Convolutional Neural Networks). The CNN is a deep learning-based algorithm that consists of various layers that extract and filters the parameters present in the images. Some additional layers of ResNet50 and the CNN algorithm are used to extract the parameters to improve image recognition accuracy. The image dataset taken for training and testing the proposed model is imageNet. The images are initially processed before sending them to the proposed model. The proposed model is trained, validated, and tested through the images obtained after the initial processing. The same process is repeated several times until getting the maximum accuracy. The accuracy of the proposed model in terms of image recognition is recorded. The obtained results are compared with other image classification algorithms like VGG16 and VGG19. It is concluded that the proposed model outperforms other traditional methods in terms of accuracy. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

ERBM: A Machine Learning-Driven Rule-Based Model for Intrusion Detection in IoT Environments

引用

Computers, Materials and Continua 2025年第3期83.0卷 5155-5179页

作者： Mehmmod, Arshad Batool, Komal Sajid, Ahthsham Alam, Muhammad Mansoor Khan, Inam Ullah Department of Information Security and Data Science Riphah Institute of Systems Engineering Riphah International University Islamabad 46000 Pakistan Faculty of Computing Riphah International University Islamabad 46000 Pakistan Faculty of Computing and Informatics Multimedia University Cyberjaya 63100 Malaysia

Traditional rule-based Intrusion Detection Systems (IDS) are commonly employed owing to their simple design and ability to detect known threats. Nevertheless, as dynamic network traffic and a new degree of threats exist in IoT environments, these systems do not perform well and have elevated false positive rates—consequently decreasing detection accuracy. In this study, we try to overcome these restrictions by employing fuzzy logic and machine learning to develop an Enhanced Rule-Based Model (ERBM) to classify the packets better and identify intrusions. The ERBM developed for this approach improves data preprocessing and feature selections by utilizing fuzzy logic, where three membership functions are created to classify all the network traffic features as low, medium, or high to remain situationally aware of the environment. Such fuzzy logic sets produce adaptive detection rules by reducing data uncertainty. Also, for further classification, machine learning classifiers such as Decision Tree (DT), Random Forest (RF), and Neural Networks (NN) learn complex ways of attacks and make the detection process more precise. A thorough performance evaluation using different metrics, including accuracy, precision, recall, F1 Score, detection rate, and false-positive rate, verifies the supremacy of ERBM over classical IDS. Under extensive experiments, the ERBM enables a remarkable detection rate of 99% with considerably fewer false positives than the conventional models. Integrating the ability for uncertain reasoning with fuzzy logic and an adaptable component via machine learning solutions, the ERBM system provides a unique, scalable, data-driven approach to IoT intrusion detection. This research presents a major enhancement initiative in the context of rule-based IDS, introducing improvements in accuracy to evolving IoT threats. Copyright © 2025 The Authors.

关键词： fuzzy prediction intrusions IoT Rule based

来源：评论

学校读者我要写书评

暂无评论

Gradient Descent Robustly Learns the Intrinsic Dimension of data in Training Convolutional Neural Networks

arXiv

引用

arXiv 2025年

作者： Zhang, Chenyang Gao, Peifeng Zou, Difan Cao, Yuan Department of Statistics and Actuarial Science School of Computing and Data Science The University of Hong Kong Hong Kong Department of Computer Science School of Computing and Data Science The University of Hong Kong Hong Kong Department of Computer Science School of Computing and Data Science & Institute of Data Science The University of Hong Kong Hong Kong

Modern neural networks are usually highly over-parameterized. Behind the wide usage of over-parameterized networks is the belief that, if the data are simple, then the trained network will be automatically equivalent to a simple predictor. Following this intuition, many existing works have studied different notions of "ranks" of neural networks and their relation to the rank of data. In this work, we study the rank of convolutional neural networks (CNNs) trained by gradient descent, with a specific focus on the robustness of the rank to image background noises. Specifically, we point out that, when adding background noises to images, the rank of the CNN trained with gradient descent is affected far less compared with the rank of the data. We support our claim with a theoretical case study, where we consider a particular data model to characterize low-rank clean images with added background noises. We prove that CNNs trained by gradient descent can learn the intrinsic dimension of clean images, despite the presence of relatively large background noises. We also conduct experiments on synthetic and real datasets to further validate our claim. © 2025, CC BY-SA.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Automated face recognition using deep learning technique and center symmetric multivariant local binary pattern

引用

Neural computing and Applications 2025年第1期37卷 263-281页

作者： Sekhar, J.C. Josephson, P. Joel Chinnasamy, A. Maheswari, M. Sankar, S. Kalangi, Ruth Ramya Department of Computer Science and Engineering NRI Institute of Technology Andhra Pradesh Guntur India Department of Electronics and Communication Engineering Malla Reddy Engineering College Telangana Hyderabad India Department of Data Science and Business Systems School of Computing SRMIST Kattankulathur Chennai India Department of Computer Science and Engineering Panimalar Engineering College Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vijayawada India

Researchers have recently created several deep learning strategies for various tasks, and facial recognition has made remarkable progress in employing these techniques. Face recognition is a noncontact, nonobligatory, acceptable, and harmonious biometric recognition method with a promising national and social security future. The purpose of this paper is to improve the existing face recognition algorithm, investigate extensive data-driven face recognition methods, and propose a unique automated face recognition methodology based on generative adversarial networks (GANs) and the center symmetric multivariable local binary pattern (CS-MLBP). To begin, this paper employs the center symmetric multivariant local binary pattern (CS-MLBP) algorithm to extract the texture features of the face, addressing the issue that C2DPCA (column-based two-dimensional principle component analysis) does an excellent job of removing the global characteristics of the face but struggles to process the local features of the face under large samples. The extracted texture features are combined with the international features retrieved using C2DPCA to generate a multifeatured face. The proposed method, GAN-CS-MLBP, syndicates the power of GAN with the robustness of CS-MLBP, resulting in an accurate and efficient face recognition system. Deep learning algorithms, mainly neural networks, automatically extract discriminative properties from facial images. The learned features capture low-level information and high-level meanings, permitting the model to distinguish among dissimilar persons more successfully. To assess the proposed technique’s GAN-CS-MLBP performance, extensive experiments are performed on benchmark face recognition datasets such as LFW, YTF, and CASIA-WebFace. Giving to the findings, our method exceeds state-of-the-art facial recognition systems in terms of recognition accuracy and resilience. The proposed automatic face recognition system GAN-CS-MLBP provides a solid basis for a

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study of OOP-Related Bugs in C++ Compilers

引用

IEEE Transactions on Software Engineering 2025年 1-21页

作者： Wang, Bo Chen, Chong Chen, Junjie Xu, Bowen Ye, Chen Lin, Youfang Dong, Guoliang Sun, Jun Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China Beijing Key Laboratory of Traffic Data Mining and Embodied Intelligence China Tianjin University College of Intelligence and Computing Tianjin300350 China North Carolina State University Department of Computer Science NC27695 United States Singapore Management University School of Computing and Information Systems Singapore178902 Singapore

Modern C++, a programming language characterized by its extensive use of object-oriented programming (OOP) features, is widely used for system programming. However, C++ compilers often struggle to correctly handle these sophisticated OOP features, resulting in numerous high-profile compiler bugs that can lead to crashes or miscompilation. Despite the significance of OOP-related bugs, existing studies largely overlook OOP features, hindering their ability to discover such bugs. To assist both compiler fuzzer designers and compiler developers, we conduct a comprehensive study of the compiler bugs caused by incorrectly handling C++ OOP-related features. First, we systematically extract 788 OOP-related C++ compiler bugs from GCC and LLVM. Second, derived from the core concepts of OOP and C++, we manually identified a two-level taxonomy of the OOP-related features leading to compiler bugs, which consists of 6 primary categories (e.g., Abstraction & Encapsulation, Inheritance, and Runtime Polymorphism), along with 17 secondary categories (e.g., Constructors & Destructors and Multiple Inheritance). Third, we systematically analyze the root causes, symptoms, fixes, options, and C++ standard versions of these bugs. Our analysis yields 13 key findings, highlighting that features related to the construction and destruction of objects lead to the highest number of bugs, crashes are the most frequent symptom, and while the average time from bug introduction to discovery is 1856 days, fixing the bug once discovered takes only 174 days on average. Additionally, more than half of the bugs can be triggered without any compiler options. These findings offer valuable insights not only for developing new compiler testing approaches but also for improving language design and compiler engineering. Inspired by these findings, we developed a proof-of-concept compiler fuzzer OOPFuzz, specifically targeting OOP-related bugs in C++ compilers. We applied it against the newest release versions

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Debate-to-Write: A Persona-Driven Multi-Agent Framework for Diverse Argument Generation 31

Debate-to-Write: A Persona-Driven Multi-Agent Framework for ...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Hu, Zhe Chan, Hou Pong Li, Jing Yin, Yu Department of Computing The Hong Kong Polytechnic University Hong Kong DAMO Academy Alibaba Group China Research Centre for Data Science & Artificial Intelligence Hong Kong Department of Computer and Data Sciences Case Western Reserve University United States

ISBN: (纸本)9798891761964

Writing arguments is a challenging task for both humans and machines. It entails incorporating high-level beliefs from various perspectives on the topic, along with deliberate reasoning and planning to construct a coherent narrative. Current language models often generate outputs autoregressively, lacking explicit integration of these underlying controls, resulting in limited output diversity and coherence. In this work, we propose a persona-based multi-agent framework for argument writing. Inspired by the human debate, we first assign each agent a persona representing its high-level beliefs from a unique perspective, and then design an agent interaction process so that the agents can collaboratively debate and discuss the idea to form an overall plan for argument writing. Such debate process enables fluid and nonlinear development of ideas. We evaluate our framework on argumentative essay writing. The results show that our framework generates more diverse and persuasive arguments by both automatic and human evaluations. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

51st International Conference on Very Large data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo 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 Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dual AAV Cluster-Assisted Maritime Physical-Layer Secure Communications via Collaborative Beamforming

引用

IEEE Internet of Things Journal 2025年第9期12卷 12589-12607页

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

Autonomous aerial vehicles (AAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of AAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the AAV relay for remote maritime communications. However, due to the open nature of AAV channels, security issue requires special consideration. This article proposes a dual AAV cluster-assisted system via CB to achieve physical-layer security in maritime wireless communications. Specifically, one AAV cluster forms a maritime AAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other AAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multiobjective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of AAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. © 2014 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Explainable AI in Blockchain System for Decentralized Governance

Explainable AI in Blockchain System for Decentralized Govern...

引用

2025 International Conference on Pervasive Computational Technologies, ICPCT 2025

作者： Chahar, Suman Kaur, Kawaljit Kaswan, Kuldeep Singh Dhatterwal, Jagjit Singh University Institute of Computing Chandigarh University Mohali India Galgotias University Department of Computer Science and Engineering Greater Noida India Koneru Lakshmaiah Education Foundation Department of Artificial Intelligence and Data Science Andhra Pradesh India

ISBN: (纸本)9798331508685

Decentralized governance is going through radical changes due to the innovative use of blockchain which allows decisions to be made in a transparent, secure and more im- portantly, immutable way, without the authority of a single individual or party. Thus, the introduction of artificial intelligence (AI) in blockchain governing systems complicates such thing as transparency and trust, especially in the case of deep AI systems. But more on this later - this is where Explainable AI or XAI comes into the picture. XAI methods enable understanding of the reasons behind the choices made by AI models and solves the "black box"problem that is predominant in machine learn- ing. When applied to decentralised governance, XAI provides clarifications of AI's decision making in such areas as voting, resource distribution and the enactment of smart contracts. This way, the stakeholders are confident that the decision-making is fair and impartial and this is made possible by the use of XAI. This paper aims to find out more about the applicability of XAI concept in blockchain -based governance systems in terms of bias and fairness in automated decisions and explanation of the decisions made. The reasons why interpretability plays the crucial role in decentralized systems are explained with the help of the comparison between the classical artificial intelligence and the Xin Intelligent. The study also looks at various use cases such as, Decentralized Autonomous Organizations (DAOs), and voting systems implemented on blockchain platforms and how XAI can enhance the performance of the governance systems. As this study shows, XAI is vital in building trust, improving responsibility, and guaranteeing balanced majorities in decentralized blockchain governance structures. © 2025 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：