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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhang, Mingkun Bi, Keping Chen, Wei Chen, Quanrun Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology CAS China Key Laboratory of Network Data Science and Technology Institute of Computing Technology CAS China School of Statistics University of International Business and Economics China

Despite ongoing efforts to defend neural classifiers from adversarial attacks, they remain vulnerable, especially to unseen attacks. In contrast, humans are difficult to be cheated by subtle manipulations, since we make judgments only based on essential factors. Inspired by this observation, we attempt to model label generation with essential label-causative factors and incorporate label-non-causative factors to assist data generation. For an adversarial example, we aim to discriminate the perturbations as non-causative factors and make predictions only based on the label-causative factors. Concretely, we propose a casual diffusion model (CausalDiff) that adapts diffusion models for conditional data generation and disentangles the two types of casual factors by learning towards a novel casual information bottleneck objective. Empirically, CausalDiff has significantly outperformed state-of-the-art defense methods on various unseen attacks, achieving an average robustness of 86.39% (+4.01%) on CIFAR-10, 56.25% (+3.13%) on CIFAR-100, and 82.62% (+4.93%) on GTSRB (German Traffic Sign Recognition Benchmark). The code is available at https://***/CAS-AISafetyBasicResearchGroup/CausalDiff. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PALCT: vehicle-to-vehicle communication based on pseudonym assignment and encryption scheme using delay minimisation cover tree algorithm

引用

International Journal of Vehicle Information and Communication Systems 2025年第2期10卷 132-147页

作者： Tandon, Righa Gupta, P.K. Chitkara University Institute of Engineering and Technology Chitkara University Punjab India Department of Computer Science and Engineering Jaypee University of Information Technology HP Solan173 234 India Department of Data Science School of Computing Mohan Babu University AP Tirupati517 102 India

Vehicle-to-vehicle communication is one of the new paradigms of networking, which should be secure, fast, and efficient. In this paper, we propose a framework that implements the pseudonym-based authentication scheme in which communication among vehicles is encrypted by using a matrix array symmetric key (MASK), digital signature algorithm (DSA), and intelligent water drop (IWD). The proposed security scheme also ensures the handling of many security attacks like key-guessing, non-repudiation, replay, and modification. In the proposed scheme, to preserve the identity of the vehicle, we have provided the different pseudonyms for each vehicle in the network that ensure secure communication among vehicles. Furthermore, the proposed delay minimisation cover tree algorithm ensures the issue of timed delay during vehicle-to-vehicle communication. In this algorithm, we have used Dijkstra’s algorithm for finding the optimal shortest path during vehicular communication. The results obtained show that the proposed scheme is effective and efficient, as it reduces the time delay by 4% for 140 vehicle nodes and 28.4% for 1000 vehicle nodes. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enabled Quality Assurance and Traceability in the Indian Confectionery Market

Blockchain-Enabled Quality Assurance and Traceability in the...

引用

2024 International Conference on Innovative computing, Intelligent Communication and Smart Electrical Systems, ICSES 2024

作者： Subashini, B. Shanthi, P. Venkatesh, K. School of Computing Srm Institute of Science and Technology Department of Data Science and Business Systems Tamilnadu kattankulathur India St. Joseph's Institute of Technology Department of Information Technology OMR Chennai119 India School of Computing Srm Institute of Science and Technology Department of Networking and Communications Tamilnadu kattankulathur India

ISBN: (纸本)9798331543617

India, whose population growth is its greatest asset cannot afford to let its people eat confectionery that is either tainted or somehow polluted, since this would lead to extensive malnutrition. Traditional food supply chains are characterized by centralization and the problems associated with it such as having a single point of failure and producing inconsistent products while compromising the quality, along with data loss. With the need for daily reports in all regions of India regarding food fraud, contamination, and adulteration, a clearly advanced decentralized model is sought after for the creation of a supply chain. This paper introduces the supply chain network for the Indian confectionery market based on blockchain to better address quality claims, contamination, and transparency. This enables real-time traceability within the ecosystem, by using IoT strategies along with the Ethereum blockchain leading to better product authentication and resulting in higher consumer confidence. Blockchain creates a secure data tracking function, while smart contracts can be used to define the process - such as IoT monitoring of temperature. The united method enables verified data to be available to the consumer, energy efficiency, and trust across the supply chain. © 2024 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Cardiovascular Disease Prediction Using Supervised Machine Learning Algorithms 1

Performance Evaluation of Cardiovascular Disease Prediction ...

引用

1st International Conference on Innovations in Communications, Electrical and Computer Engineering, ICICEC 2024

作者： Archana, R. Sujatha, V. Abinaya, M. Vijay Anand, P. Ramya, M. Priya, S. SRM Institute of Science and Technology School of Computing Department of Networking and Communications Kattankulathur Chennai India Cmr Institute of Technology Department of Artificial Intelligence and Data Science Bengaluru560037 India SRM Institute of Science and Technology Department of Computing Technologies Kattankulathur Chennai India Vel Tech Rangarajan Dr.Sagunthala R and D Institute of Science and Technology School of Computing Department of CSE[Cyber Security Avadi Chennai India

ISBN: (数字)9798350376517

ISBN: (纸本)9798350376517

Cardiovascular disease has emerged as a very critical and intricate condition on a global scale. Healthcare practitioners have long faced substantial challenges in predicting and identifying heart disease. Medical and other healthcare facilities provide costly treatments and surgical procedures for cardiovascular conditions. People throughout the globe would benefit from early heart disease prediction since it would allow them to take action before the issue worsens. These days, heart disease is a major concern, and the primary causes of this illness include things like smoking, excessive alcohol use, and not getting enough exercise. Based on the extensive dataset that the healthcare industry has produced over time, machine learning has proven effective in decisions and forecasts. Logistic regression, Decision- Trees, Naive-Bayes, Random-Forest, and SVM are among the supervised machine learning algorithms that may anticipate the occurrence of heart illness. A synopsis of the algorithm's performance assessment is also included. A comparison of five models showed that the Decision Tree and Random Forest models were better at predicting heart disease than the others. Also, these models were very accurate, with a 98.5% success rate. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Grey Wolf Optimizer and Deep Neural Network based Feature Selection and Classification in Medical Image Analysis 18

Grey Wolf Optimizer and Deep Neural Network based Feature Se...

引用

18th INDIAcom;11th International Conference on computing for Sustainable Global Development, INDIACom 2024

作者： Chandrashekhar, Katha Leela, P. Madhavi, K. Reddy Avanija, J. Tangudu, Naresh Indur Institute of Engineering and Technology Computer Science and Engineering Siddipet India Mohan Babu University School of Computing Dept. of Data Science Tirupati India Mohan Babu University School of Computing Tirupati India Aditya Institute of Technology and Management Tekkali India

ISBN: (纸本)9789380544519

Accurate and efficient medical image analysis is required for modern healthcare applications, facilitating timely disease diagnosis and treatment. Considering the importance of optimization algorithms and deep learning methodologies, this work presents a novel approach, Grey Wolf Optimizer-Assisted Deep Neural Networks (GWO-DNN), for feature selection and classification in medical image analysis. The proposed framework utilizes the power of the Grey Wolf Optimizer to intelligently select the most relevant features from complex medical images. The selected features are then integrated into Deep Neural Networks, to create accurate models for medical image classification tasks. This integrated approach is designed to improve diagnostic accuracy and enhance patient care. The experimentation and evaluation, reveal that the proposed GWO-DNN based model for image analysis is more efficient than the existing methods. © 2024 Bharati Vidyapeeth, New Delhi.

关键词： Deep Neural Networks (DNN) Disease Classification Feature Selection Grey Wolf Optimization (GWO) Medical Image Analysis

来源：评论

学校读者我要写书评

暂无评论

Selective Temporal Knowledge Graph Reasoning 30

Selective Temporal Knowledge Graph Reasoning

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Hou, Zhongni Jin, Xiaolong Li, Zixuan Bai, Long Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Temporal Knowledge Graph (TKG), which characterizes temporally evolving facts in the form of (subject, relation, object, timestamp), has attracted much attention recently. TKG reasoning aims to predict future facts based on given historical ones. However, existing TKG reasoning models are unable to abstain from predictions they are uncertain, which will inevitably bring risks in real-world applications. Thus, in this paper, we propose an abstention mechanism for TKG reasoning, which helps the existing models make selective, instead of indiscriminate, predictions. Specifically, we develop a confidence estimator, called Confidence Estimator with History (CEHis), to enable the existing TKG reasoning models to first estimate their confidence in making predictions, and then abstain from those with low confidence. To do so, CEHis takes two kinds of information into consideration, namely, the certainty of the current prediction and the accuracy of historical predictions. Experiments with representative TKG reasoning models on two benchmark datasets demonstrate the effectiveness of the proposed CEHis. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Nested Event Extraction upon Pivot Element Recognition 30

Nested Event Extraction upon Pivot Element Recognition

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Ren, Weicheng Li, Zixuan Jin, Xiaolong Bai, Long Su, Miao Liu, Yantao Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://***/waysonren/PerNee. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts 30

Few-shot Link Prediction on Hyper-relational Facts

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A Modified EACOP Implementation for Real-Parameter Single Objective Optimization Problems 13

A Modified EACOP Implementation for Real-Parameter Single Ob...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Tangherloni, Andrea Coelho, Vasco Buffa, Francesca M. Cazzaniga, Paolo Bocconi Institute for Data Science and Analytics Bocconi University Department of Computing Sciences Milan Italy University of Milano-Bicocca Department of Informatics Systems and Communication Milan Italy Bocconi University Department of Computing Sciences Milan Italy Bocconi Institute for Data Science and Analytics Italy University of Bergamo Department of Human and Social Sciences Bergamo Italy

ISBN: (纸本)9798350308365

Evolutionary algorithms are effective techniques for optimizing non-linear and complex high-dimensional problems. However, most of them require a precise fine-tuning of their functioning settings to achieve satisfactory results. In this work, we propose a modified version of an evolutionary approach called the Evolutionary Algorithm for COmplex-process oPtimization (EACOP), designed to have a limited number of hyper-parameters. The base version of EACOP (bEACOP) combines different strategies, including the scatter search methodology, local searches, and a novel combination method based on path relinking to balance the exploration and exploitation phases. Our improved version (iEACOP) intensifies the exploration phase to escape from suboptimal search space areas where, on the contrary, bEACOP gets stuck. Our results show that iEACOP outperforms bEACOP on 27 out of 29 CEC 2017 test suite benchmark functions, exhibiting comparable performance against the three best algorithms of the CEC 2017 competition on single-objective bound-constrained real-parameter numerical optimization. The source code of bEACOP and iEACOP will be made publicly available on GitHub upon acceptance. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Class-Incremental Few-Shot Event Detection 30

Class-Incremental Few-Shot Event Detection

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Event detection is one of the fundamental tasks in information extraction and knowledge graph. However, a realistic event detection system often needs to deal with new event classes constantly. These new classes usually have only a few labeled instances as it is time-consuming and labor-intensive to annotate a large number of unlabeled instances. Therefore, this paper proposes a new task, called class-incremental few-shot event detection. Nevertheless, this task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper further presents a novel knowledge distillation and prompt learning based method, called Prompt-KD. Specifically, to handle the forgetting problem about old knowledge, Prompt-KD develops an attention based multi-teacher knowledge distillation framework, where the ancestor teacher model pre-trained on base classes is reused in all learning sessions, and the father teacher model derives the current student model via adaptation. On the other hand, in order to cope with the few-shot learning scenario and alleviate the corresponding new class overfitting problem, Prompt-KD is also equipped with a prompt learning mechanism. Extensive experiments on two benchmark datasets, i.e., FewEvent and MAVEN, demonstrate the superior performance of Prompt-KD. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：