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

A Linked List Encryption Scheme for Image Steganography without Embedding

computer Modeling in Engineering & sciences 2024年第10期141卷 331-352页

作者： Pengbiao Zhao Qi Zhong Jingxue Chen Xiaopei Wang Zhen Qin Erqiang Zhou Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of ChinaChengdu610054China Faculty of Data Science City University of MacaoMacao999078China Department of Computer Science and Engineering University of CaliforniaRiversideCA 92521USA

Information steganography has received more and more attention from scholars nowadays,especially in the area of image steganography,which uses image content to transmit information and makes the existence of secret information *** enhance concealment and security,the Steganography without Embedding(SWE)method has proven effective in avoiding image distortion resulting from cover *** this paper,a novel encrypted communication scheme for image SWE is *** reconstructs the image into a multi-linked list structure consisting of numerous nodes,where each pixel is transformed into a single node with data and pointer *** employing a special addressing algorithm,the optimal linked list corresponding to the secret information can be *** receiver can restore the secretmessage fromthe received image using only the list header position *** scheme is based on the concept of coverless steganography,eliminating the need for any modifications to the cover *** boasts high concealment and security,along with a complete message restoration rate,making it resistant to ***,this paper proposes linked-list construction schemeswithin theproposedframework,which caneffectively resist a variety of attacks,includingnoise attacks and image compression,demonstrating a certain degree of *** validate the proposed framework,practical tests and comparisons are conducted using multiple *** results affirm the framework’s commendable performance in terms of message reduction rate,hidden writing capacity,and robustness against diverse attacks.

关键词： Steganography encryption steganography without embedding coverless steganography

来源：评论

学校读者我要写书评

暂无评论

Explainability and Contestability for the Responsible Use of Public Sector AI

Explainability and Contestability for the Responsible Use of...

引用

2025 CHI Conference on Human Factors in Computing Systems, CHI EA 2025

作者： Schmude, Timothée Faculty of Computer Science Research Network Data Science Doctoral School Computer Science University of Vienna Vienna Austria

ISBN: (纸本)9798400713958

Public institutions have begun to use AI systems in areas that directly impact people’s lives, including labor, law, health, and migration. Explainability ensures that these systems are understandable to the involved stakeholders, while its emerging counterpart contestability enables them to challenge AI decisions. Both principles support the responsible use of AI systems, but their implementation needs to take into account the needs of people without technical background, AI novices. I conduct interviews and workshops to explore how explainable AI can be made suitable for AI novices, how explanations can support their agency by allowing them to contest decisions, and how this intersection is conceptualized. My research aims to inform policy and public institutions on how to implement responsible AI by designing for explainability and contestability. The Remote Doctoral Consortium would allow me to discuss with peers how these principles can be realized and account for human factors in their design. © 2025 Copyright held by the owner/author(s).

关键词： algorithmic fairness contestable AI explainable AI interdisciplinary research qualitative methods

来源：评论

学校读者我要写书评

暂无评论

Recent metaheuristic algorithms for medical object localization using MSER detector in computer-aided diagnosis system

引用

Multimedia Tools and Applications 2025年第15期84卷 14433-14487页

作者： Ait Mehdi, Mohamed Belattar, Khadidja Souami, Feryel Faculty of Computer Science Data Science and Artificial Intelligence Department Laboratory for Research in Artificial Intelligence University of Science and Technology Houari Boumediene BP 32 El-Alia Algiers Bab-Ezzouar16111 Algeria Department of Computer Science University of Algiers Benyoucef Benkhedda Algiers16000 Algeria

Object localization is a critical task in image analysis, often facilitated by artificial intelligence techniques. While the Maximally Stable Extremal Regions (MSER) detection algorithm is a popular choice for local detection, its exhaustive approaches can be algorithmically complex and prone to suboptimal results with improper parameter selection. Various metaheuristic algorithms have been proposed for medical object localization to address this. In this context, four contributions are presented. Firstly, recent metaheuristics, including the Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Heap-based Optimizer (HBO), and Gradient-based Optimizer (GBO), are adapted to tackle the MSER localization problem. These algorithms are rigorously evaluated across diverse medical image datasets using multiple metrics, with their performance statistically validated through the Friedman mean rank test. The second contribution introduces a novel objective function to improve the localization process. The third contribution involves a comparative analysis of the recent algorithms against seven standard metaheuristics specifically designed for MSER localization. Lastly, we present an improved computer-aided diagnosis system that integrates an SVM-based model with Local Binary Patterns (LBP) descriptors extracted from each MSER alongside DenseNet-121 features. Experimental results demonstrate that the HBO and SMA optimizers outperform conventional algorithms, showing a higher diversity, improved exploitation and exploration capabilities, a well-balanced exploration-exploitation trade-off, elevated fitness values, faster convergence speeds, and enhanced computational efficiency. Additionally, we integrate these findings into an improved computer-aided diagnosis system, yielding classification results surpassing state-of-the-art models. These findings highlight the potential advantages of this approach, especially in object detection applications. © The Author(s), under

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs 38

Bandit-Feedback Online Multiclass Classification: Variants a...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Filmus, Yuval Hanneke, Steve Mehalel, Idan Moran, Shay Faculty of Computer Science Faculty of Mathematics Technion Israel Department of Computer Science Purdue University United States Faculty of Computer Science Technion Israel Faculty of Mathematics Faculty of Computer Science Faculty of Data and Decision Sciences Technion Israel Google research Israel

Consider the domain of multiclass classification within the adversarial online setting. What is the price of relying on bandit feedback as opposed to full information? To what extent can an adaptive adversary amplify the loss compared to an oblivious one? To what extent can a randomized learner reduce the loss compared to a deterministic one? We study these questions in the mistake bound model and provide nearly tight answers. We demonstrate that the optimal mistake bound under bandit feedback is at most O(k) times higher than the optimal mistake bound in the full information case, where k represents the number of labels. This bound is tight and provides an answer to an open question previously posed and studied by Daniely and Helbertal ['13] and by Long ['17,'20], who focused on deterministic learners. Moreover, we present nearly optimal bounds of Θ˜(k) on the gap between randomized and deterministic learners, as well as between adaptive and oblivious adversaries in the bandit feedback setting. This stands in contrast to the full information scenario, where adaptive and oblivious adversaries are equivalent, and the gap in mistake bounds between randomized and deterministic learners is a constant multiplicative factor of 2. In addition, our results imply that in some cases the optimal randomized mistake bound is approximately the square-root of its deterministic parallel. Previous results show that this is essentially the smallest it can get. Some of our results are proved via a reduction to prediction with expert advice under bandit feedback, a problem interesting on its own right. For this problem, we provide a randomized algorithm which is nearly optimal in some scenarios. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring Artificial Neural network Models for c-VEP Decoding in a Brain-Artificial Intelligence Interface

Exploring Artificial Neural Network Models for c-VEP Decodin...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Miao, Zhengqing Meunier, Anja Žák, Michal Robert Grosse-Wentrup, Moritz Justus Liebig University Giessen Department of Psychology Giessen Germany University of Vienna Doctoral School Computer Science Faculty of Computer Science Vienna Austria University of Vienna Research Group Neuroinformatics Faculty of Computer Science Vienna Austria University of Vienna Vienna Cognitive Science Hub Vienna Austria University of Vienna Research Network Data Science Vienna Austria

ISBN: (纸本)9798350386226

The Conversational Brain-Artificial Intelligence Interface (BAI) is a novel brain-computer interface (BCI) that uses artificial intelligence (AI) to help individuals with severe language impairments communicate. It translates users' broad intentions into coherent, context-specific responses through an advanced AI conversational agent. A critical aspect of intention translation in BAI is the decoding of code-modulated visual evoked potentials (c-VEP) signals. This study evaluates five different artificial neural network (ANN) architectures for decoding c-VEP-based EEG signals in the BAI system, highlighting the efficacy of lightweight, shallow ANN models and pre-training strategies using data from other participants to enhance classification performance. These results provide valuable insights for the application of ANN models in decoding c-VEP-based EEG signals and may benefit other c-VEP-based BCI systems. © 2024 IEEE.

关键词： Chatbots

来源：评论

学校读者我要写书评

暂无评论

Automatic extraction of lightweight and efficient neural network architecture of heavy convolutional architectures to predict microsatellite instability from hematoxylin and eosin histology in gastric cancer

引用

Neural Computing and Applications 2024年第25期36卷 15295-15321页

作者： Rostami, Habib Ashkpour, Maryam Behzadi-Khormouji, Hamed Mokhtari, Maral Khayati, Armin Keshavarz, Ahmad Talatian Azad, Saeed Tabesh, Yahya Computer Engineering Department Faculty of Intelligent Systems Engineering and Data Science Persian Gulf University Bushehr75168 Iran Artificial Intelligence and Intelligent Healthcare Lab Artificial Intelligence and Data Mining Research Group Faculty of Intelligent Systems Engineering and Data Science ICT Research Institute Persian Gulf University Bushehr75168 Iran Faculty of New Science and Technologies University of Tehran Tehran Iran Department of Computer Science Imec-IDLab University of Antwerp Sint-Pietersvliet 7 Antwerp2000 Belgium Shahid Faghihi Hospital Shiraz University of Medical Sciences Shiraz Iran Department of Computer Science Engineering and IT School of Electrical and Computer Engineering Shiraz University Shiraz Iran Electrical Engineering Department Faculty of Intelligent Systems Engineering and Data Science Persian Gulf University Bushehr75168 Iran IoT and Signal Processing Research Group Faculty of Intelligent Systems Engineering and Data Science ICT Research Institute Persian Gulf University Bushehr75168 Iran Department of Mathematical Sciences Sharif University of Technology Tehran Iran

Cancers have emerged as a significant concern due to their impact on public health and society. The examination and interpretation of tissue sections stained with Hematoxylin and Eosin (H&E) play a crucial role in disease assessment, particularly in cases like gastric cancer. Microsatellite instability (MSI) is suggested to contribute to the carcinogenesis of specific gastrointestinal tumors. However, due to the nonspecific morphology observed in H&E-stained tissue sections, MSI determination often requires costly evaluations through various molecular studies and immunohistochemistry methods in specialized molecular pathology laboratories. Despite the high cost, international guidelines recommend MSI testing for gastrointestinal cancers. Thus, there is a pressing need for a new diagnostic modality with lower costs and widespread applicability for MSI detection. This study aims to detect MSI directly from H&E histology slides in gastric cancer, providing a cost-effective alternative. The performance of well-known deep convolutional neural networks (DCNNs) and a proposed architecture are compared. Medical image datasets are typically smaller than benchmark datasets like ImageNet, necessitating the use of off-the-shelf DCNN architectures developed for large datasets through techniques such as transfer learning. Designing an architecture proportional to a custom dataset can be tedious and may not yield desirable results. In this work, we propose an automatic method to extract a lightweight and efficient architecture from a given heavy architecture (e.g., well-known off-the-shelf DCNNs) proportional to a specific dataset. To predict MSI instability, we extracted the MicroNet architecture from the Xception network using the proposed method and compared its performance with other well-known architectures. The models were trained using tiles extracted from whole-slide images, and two evaluation strategies, tile-based and whole-slide image (WSI)-based, were employed and comp

关键词： network architecture

来源：评论

学校读者我要写书评

暂无评论

Information That Matters: Exploring Information Needs of People Affected by Algorithmic Decisions

arXiv

引用

arXiv 2024年

作者： Schmude, Timothée Koesten, Laura Möller, Torsten Tschiatschek, Sebastian University of Vienna Faculty of Computer Science Research Network Data Science Doctoral School Computer Science Austria University of Vienna Faculty of Computer Science Research Group Visualization and Data Analysis Austria University of Vienna Faculty of Computer Science Research Group Visualization and Data Analysis Research Network Data Science Austria University of Vienna Faculty of Computer Science Research Network Data Science Austria

Every AI system that makes decisions about people has a group of stakeholders that are personally affected by these decisions. However, explanations of AI systems rarely address the information needs of this stakeholder group, who often are AI novices. This creates a gap between conveyed information and information that matters to those who are impacted by the system’s decisions, such as domain experts and decision subjects. To address this, we present the "XAI Novice Question Bank," an extension of the XAI Question Bank [60] containing a catalog of information needs from AI novices in two use cases: employment prediction and health monitoring. The catalog covers the categories of data, system context, system usage, and system specifications. We gathered information needs through task-based interviews where participants asked questions about two AI systems to decide on their adoption and received verbal explanations in response. Our analysis showed that participants’ confidence increased after receiving explanations but that their understanding faced challenges. These included difficulties in locating information and in assessing their own understanding, as well as attempts to outsource understanding. Additionally, participants’ prior perceptions of the systems’ risks and benefits influenced their information needs. Participants who perceived high risks sought explanations about the intentions behind a system’s deployment, while those who perceived low risks rather asked about the system’s operation. Our work aims to support the inclusion of AI novices in explainability efforts by highlighting their information needs, aims, and challenges. We summarize our findings as five key implications that can inform the design of future explanations for lay stakeholder audiences. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Achieving dynamic privacy measurement and protection based on reinforcement learning for mobile edge crowdsensing of IoT

引用

Digital Communications and networks 2024年第2期10卷 380-388页

作者： Renwan Bi Mingfeng Zhao Zuobin Ying Youliang Tian Jinbo Xiong Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber SecurityFujian Normal UniversityFuzhou350117China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic TechnologyGuilin541004China Faculty of Data Science City University of Macao999078MacaoChina State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China

With the maturity and development of 5G field,Mobile Edge CrowdSensing(MECS),as an intelligent data collection paradigm,provides a broad prospect for various applications in ***,sensing users as data uploaders lack a balance between data benefits and privacy threats,leading to conservative data uploads and low revenue or excessive uploads and privacy *** solve this problem,a Dynamic Privacy Measurement and Protection(DPMP)framework is proposed based on differential privacy and reinforcement ***,a DPM model is designed to quantify the amount of data privacy,and a calculation method for personalized privacy threshold of different users is also ***,a Dynamic Private sensing data Selection(DPS)algorithm is proposed to help sensing users maximize data benefits within their privacy ***,theoretical analysis and ample experiment results show that DPMP framework is effective and efficient to achieve a balance between data benefits and sensing user privacy protection,in particular,the proposed DPMP framework has 63%and 23%higher training efficiency and data benefits,respectively,compared to the Monte Carlo algorithm.

关键词： Mobile edge crowdsensing Dynamic privacy measurement Personalized privacy threshold Privacy protection Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Deliberative XAI: How Explanations Impact Understanding and Decision-Making of AI Novices in Collective and Individual Settings

arXiv

引用

arXiv 2024年

XAI research often focuses on settings where people learn about and assess algorithmic systems individually. However, as more public AI systems are deployed, it becomes essential for XAI to facilitate collective understanding and deliberation. We conducted a task-based interview study involving 8 focus groups and 12 individual interviews to explore how explanations can support AI novices in understanding and forming opinions about AI systems. Participants received a collection of explanations organized into four information categories to solve tasks and decide about a system’s deployment. These explanations improved or calibrated participants’ self-reported understanding and decision confidence and facilitated group discussions. Participants valued both technical and contextual information and the self-directed and modular explanation structure. Our contributions include an explanation approach that facilitates both individual and collaborative interaction and explanation design recommendations, including active and controllable exploration, different levels of information detail and breadth, and adaptations to the needs of decision subjects. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LESaET: Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER

LESaET: Low-Dimensional Embedding Method for Link Prediction...

引用

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

作者： Ding, Lichao Zhao, Jing Lu, Kai Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Knowledge graphs (KGs) provide a structured representation of the real world through entity-relation triples. However, current KGs are often incomplete, typically containing only a small fraction of all possible facts. This involves inferring missing content from existing information, a task known as link prediction. Existing methods in the field of link prediction struggle with controlling the dimensionality of embedding vectors or suffer from overly complex models. In order to tackle these challenges, we introduce a method in this paper, named Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER (LESaET). LESaET leverages both self-attention mechanisms and tensor factorization to learn expressive contextual-enhanced representations of KGs. Specifically, LESaET employs the multi-head self-attention mechanism of Transformer as an encoder to capture the mutual information between entities and relationships, and utilizes Enhanced-TuckER as a decoder, ultimately achieving expressive low-dimensional embeddings for link prediction tasks. LESaET demonstrates competitive performance compared to advanced methods on standard datasets. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：