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

2024 International Conference on Distributed Systems, computer Networks and Cybersecurity, ICDSCNC 2024

作者： Gowri, A.S. Jose, P. Karthik, S.M. Shaheema, S Berlin Karuppasway, K.M. Balamurugan, R. School of Computing Srm Institute of Science and Technology Department of Networking and Communications Kattankulathur India Vel Tech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Computer Science and Engineering Chennai India Department for Applied Research Gandhigram India Stella Mary's College of Engineering Department of Artificial Intelligence and Data Science Azhikal India Bharath Institute of Higher Education and Research Department of Mathematics and Statistics Chennai India Dmi College of Engineering Department of Information Technology Chennai India

ISBN: (纸本)9798350375442

Diabetes is a metabolic disease that affects a large number of the global population and is incurable. The primary causes of death symptoms are kidney failure, heart attacks, strokes, and blindness. In this paper Principal component analysis used for pre-processing the data to extract features and The Efficient Hybrid Machine Learning Model Convolution Neural Network-Support Vector Machine is used to categorize the Pima Indian dataset. CNN and non-linear SVM used in a hybrid model to classify the diabetes data from the Pima Indians. To identify positive classes of pima Indians diabetes, the HCNN-SVM extract the features from the original data expression and learns diabetes data through a novel convolution network environment to the SVM classifier with RBF function and achieve the accuracy as 98,04%. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Blockchain Storage Efficiency in Mobile IoT through Multidimensional Structures and Collective Signing

Enhancing Blockchain Storage Efficiency in Mobile IoT throug...

引用

IEEE International Conference on Blockchain (Blockchain)

作者： Hussein Zangoti Alex Pissinou Makki Wazir Zada Khan Niki Pissinou School of Computing and Information Sciences Florida International University Miami FL USA Faculty of Computer Science & Information Technology Jazan University Jazan Saudi Arabia Frost Institute of Data Science and Computing University of Miami Miami FL USA University of Wah Wah Cantt Pakistan

ISBN: (数字)9798350351590

ISBN: (纸本)9798350351606

The rapidly evolving mobile IoT landscape, driven by mobile financial applications, self-driving cars, wearables, and health monitoring devices, confronts substantial blockchain storage challenges due to decentralized networks, limited band-width, and high storage overhead. To tackle these issues, we propose the Collective Signing-Based Blockchain Storage Optimization (CSBSO) algorithm. CSBSO mitigates storage over-head by leveraging the Collective Signing (CoSi) protocol and employing a multidimensional blockchain structure for efficient block management and retrieval. It focuses on identifying and pruning irrelevant blocks and implementing streamlined data management. Evaluations with Ethereum Classic Blockchain and Facebook Users datasets show CSBSO achieves up to 92% storage optimization, surpassing current models. These results underscore the effectiveness of CoSi-based strategies in reducing blockchain storage overhead in resource-constrained environments.

关键词： Social networking (online) Scalability Smart contracts Blockchains Cryptocurrency Autonomous automobiles Wearable devices

来源：评论

学校读者我要写书评

暂无评论

Error Interference in Quantum Simulation

arXiv

引用

arXiv 2024年

作者： Chen, Boyang Xu, Jue Zhao, Qi Yuan, Xiao Department of Computer Science and Technology Tsinghua University Beijing100084 China QICI Quantum Information and Computation Initiative School of Computing and Data Science The University of Hong Kong Pokfulam Road Hong Kong Center on Frontiers of Computing Studies Peking University Beijing100871 China School of Computer Science Peking University Beijing100871 China

Understanding algorithmic error accumulation in quantum simulation is crucial due to its fundamental significance and practical applications in simulating quantum many-body system dynamics. Conventional theories typically apply the triangle inequality to provide an upper bound for the error. However, these often yield overly conservative and inaccurate estimates as they neglect error interference — a phenomenon where errors in different segments can destructively interfere. Here, we introduce a novel method that directly estimates the long-time algorithmic errors with multiple segments, thereby establishing a comprehensive framework for characterizing algorithmic error interference. We identify the sufficient and necessary condition for strict error interference and introduce the concept of approximate error interference, which is more broadly applicable to scenarios such as power-law interaction models, the Fermi-Hubbard model, and higher-order Trotter formulas. Our work demonstrates significant improvements over prior ones and opens new avenues for error analysis in quantum simulation, offering potential advancements in both theoretical algorithm design and experimental implementation of Hamiltonian simulation. Copyright © 2024, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Explainable agency: human preferences for simple or complex explanations

arXiv

引用

arXiv 2024年

作者： Blom, Michelle Singh, Ronal Miller, Tim Sonenberg, Liz Trentelman, Kerry Saulwick, Adam School of Computing and Information Systems The University of Melbourne Melbourne Australia Defence Science and Technology Group Adelaide Australia CSIRO Data61 Melbourne Australia School of Electrical Engineering and Computer Science The University of Queensland Brisbane Australia

Research in cognitive psychology has established that whether people prefer simpler explanations to complex ones is context dependent, but the question of ‘simple vs. complex’ becomes critical when an artificial agent seeks to explain its decisions or predictions to humans. We present a model for abstracting causal reasoning chains for the purpose of explanation. This model uses a set of rules to progressively abstract different types of causal information in causal proof traces. We perform online studies using 123 Amazon MTurk participants and with five industry experts over two domains: maritime patrol and weather prediction. We found participants’ satisfaction with generated explanations was based on the consistency of relationships among the causes (coherence) that explain an event;and that the important question is not whether people prefer simple or complex explanations, but what types of causal information are relevant to individuals in specific contexts. Copyright © 2024, The Authors. All rights reserved.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Discovering Personalized Characteristic Communities in Attributed Graphs

Discovering Personalized Characteristic Communities in Attri...

引用

International Conference on data Engineering

作者： Yudong Niu Yuchen Li Panagiotis Karras Yanhao Wang Zhao Li School of Computing and Information Systems Singapore Management University Singapore Department of Computer Science University of Copenhagen Copenhagen Denmark School of Data Science and Engineering East China Normal University Shanghai China Zhejiang Lab Hangzhou China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

What is the widest community in which a person exercises a strong impact? Although extensive attention has been devoted to searching communities containing given individuals, the problem of finding their unique communities of influence has barely been examined. In this paper, we study the novel problem of Characteristic cOmmunity Discovery (COD) in attributed graphs. Our goal is to identify the largest community, taking into account the query attribute, in which the query node has a significant impact. The key challenge of the COD problem is that it requires evaluating the influence of the query node over a large number of hierarchically structured communities. We first propose a novel compressed COD evaluation approach to accelerate the influence estimation by eliminating redundant computations for overlapping communities. Then, we further devise a local hierarchical reclustering method to alleviate the skewness of hierarchical communities generated by global clustering for a specific query attribute. Extensive experiments confirm the effectiveness and efficiency of our solutions to COD: they find characteristic communities better than existing community search methods by several quality measures and achieve up to 25 x speedups against well-crafted baselines.

关键词： Estimation Search problems data engineering

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural information Processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: fooling segment anything model to segment nothing 24

DarkSAM: fooling segment anything model to segment nothing

引用

Proceedings of the 38th International Conference on Neural information Processing Systems

作者： Ziqi Zhou Yufei Song Minghui Li Shengshan Hu Xianlong Wang Leo Yu Zhang Dezhong Yao Hai Jin National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology School of Cyber Science and Engineering Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University

ISBN: (纸本)9798331314385

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Label Distribution Feature Selection Based on Neighborhood Rough Set

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Guo, Wenzhong Lin, Yaojin College of Computer and Data Science Fuzhou University Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Minnan Normal University Zhangzhou363000 China

In label distribution learning, an instance is involved with many labels in different importance degrees, and the feature space of instances is accompanied with thousands of redundant and/or irrelevant features. Therefore, the main characteristic of feature selection in label distribution learning is to evaluate the discriminable ability of each feature. Motivated by neighborhood rough set, which can be used to measure the dependency degree of feature via constructing neighborhood relations on feature space and label space, respectively, this paper proposes a novel lable distribution feature selection method. In this paper, the neighborhood class of instance in label distribution space is defined, which is beneficial to recognize the logical class of target instance. Then, a new neighborhood rough set model for label distribution learning is proposed. Specially, the dependency degree of feature combining label weight is defined. Finally, a label distribution feature selection based on neighborhood rough set is presented. Extensive experiments on 12 data sets show the effectiveness of the proposed algorithm. © 2024, The Authors. All rights reserved.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-assisted Authentication Protocol for RFID-enabled Supply Chain Management System

引用

IEEE Transactions on Network science and Engineering 2025年

作者： Tariq, Tayyaba Obaidat, Mohammad S. Kuo, Wen-Chung Mahmood, Khalid Ayub, Muhammad Faizan Alenazi, Mohammed J.F National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan The University of Jordan King Abdullah II School of Information Technology Amman11942 Jordan University of Science and Technology Beijing School of Communication and Computing Engineering Beijing100083 China Amity University Amity School of Engineering and Technology Noida201301 India National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Riyadh11451 Saudi Arabia

In the dynamic domain of supply chain management, integrating Radio-Frequency Identification (RFID) technology with blockchain technology represents a significant leap forward. This integration has created a blockchain-assisted RFID-enabled Supply Chain Management System (SCMS). With its ability to utilize electromagnetic fields to identify and track tags attached to objects, RFID technology has revolutionized product management and tracking within supply chains. (SCMS) transmits tracking and product management information through public communication channels. However, (SCMS)'s communication on these channels is vulnerable to various security attacks and privacy challenges. Numerous authentication protocols have recently been proposed to tackle these security and privacy challenges. Unfortunately, most protocols are susceptible to different security attacks, such as tag or reader impersonation, denial of service, physical cloning, desynchronization attacks, etc. Therefore, we have proposed an authentication protocol for an RFID-enabled (SCMS) that also leverages blockchain technology. The integration of blockchain technology ensures data integrity, immutability and transparency across each department involved in (SCMS). In the proposed protocol, we also employ a Physically Unclonable Function (PUF) to secure (SCMS) against physical cloning attacks. We validate the security of the proposed protocol through both informal and formal analysis. The informal analysis confirms that our protocol significantly enhances security and efficiency. Moreover, a performance analysis of the proposed protocol against various competing existing protocols shows its superior performance. Notably, the proposed protocol substantially reduces computational and communication costs by 24.38% and 8.03%, respectively, which underscores its enhanced performance and resource efficiency. © 2013 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：