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

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

来源：评论

学校读者我要写书评

暂无评论

Sample Complexity of Posted Pricing for a Single Item 38

Sample Complexity of Posted Pricing for a Single Item

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Jin, Billy Kesselheim, Thomas Ma, Will Singla, Sahil Cornell University School of Operations Research and Information Engineering United States University of Bonn Institute of Computer Science Lamarr Institute for Machine Learning and Artificial Intelligence Germany Columbia University Graduate School of Business Data Science Institute United States Georgia Tech School of Computer Science United States

Selling a single item to n self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical and do not work for sequential buyers, posted pricing mechanisms, where fixed prices are set for the item for different buyers, have emerged as a practical and effective alternative. This paper investigates how many samples are needed from buyers' value distributions to find near-optimal posted prices, considering both independent and correlated buyer distributions, and welfare versus revenue maximization. We obtain matching upper and lower bounds (up to logarithmic factors) on the sample complexity for all these settings. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-Language Multimodal Detection: A Novel Model for Identifying Duplicate Publications in Scientific Papers 11

Cross-Language Multimodal Detection: A Novel Model for Ident...

引用

11th IEEE International Conference on Behavioural and Social Computing, BESC 2024

作者： Huang, Jiayu Haihong, E. Liu, Jianhua Hu, Tianyi Qiao, Xiaodong Ding, Junpeng Hu, Xinyang School of Computer Science Beijing University of Posts and Telecommunications Beijing China Beijing Wanfang Data Co. Ltd. Beijing China

ISBN: (纸本)9798331531904

This paper introduces a novel multimodal, cross-language detection model for identifying duplicate publications in academia, a problem where authors publish similar content across different languages without citation. Traditional detection methods are primarily text-based and struggle with linguistic variations and deliberately altered structures. Our model uniquely integrates textual, image, and structural modalities using a knowledge distillation SBERT for semantic similarity calculations between Chinese and English, and Vision Transformer (ViT) for image comparisons. We developed a new ChineseEnglish multimodal dataset in collaboration with the Chinese Journal of Electronics and Wanfang data. On this dataset, our model has an AUC of 0.931 and an F1 of 0.82. The model's effectiveness is demonstrated through the identification and subsequent verification of two suspected duplicate publications. This research advances duplicate detection by combining multiple modalities and supports comprehensive academic content analysis. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Spectral Normalized-Cut Graph Partitioning with Fairness Constraints 26

Spectral Normalized-Cut Graph Partitioning with Fairness Con...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Li, Jia Wang, Yanhao Merchant, Arpit School of Data Science and Engineering East China Normal University Shanghai China Department of Computer Science University of Helsinki Helsinki Finland

ISBN: (纸本)9781643684369

Normalized-cut graph partitioning aims to divide the set of nodes in a graph into k disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the partitioning problem wherein nodes are characterized by a categorical sensitive attribute (e.g., gender or race) indicating membership to different demographic groups. Our goal is to ensure that each group is approximately proportionally represented in each cluster while minimizing the normalized cut value. To resolve this problem, we propose a two-phase spectral algorithm called FNM. In the first phase, we add an augmented Lagrangian term based on our fairness criteria to the objective function for obtaining a fairer spectral node embedding. Then, in the second phase, we design a rounding scheme to produce k clusters from the fair embedding that effectively trades off fairness and partition quality. Through comprehensive experiments on nine benchmark datasets, we demonstrate the superior performance of FNM compared with three baseline methods. © 2023 The Authors.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

DivLog: Log Parsing with Prompt Enhanced In-Context Learning 24

DivLog: Log Parsing with Prompt Enhanced In-Context Learning

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Xu, Junjielong Yang, Ruichun Huo, Yintong Zhang, Chengyu He, Pinjia The Chinese University of Hong Kong Dept. of Computer Science & Engineering Hong Kong Eth Zurich Switzerland School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data China

ISBN: (纸本)9798400702174

Log parsing, which involves log template extraction from semi-structured logs to produce structured logs, is the first and the most critical step in automated log analysis. However, current log parsers suffer from limited effectiveness for two reasons. First, traditional data-driven log parsers solely rely on heuristics or handcrafted features designed by domain experts, which may not consistently perform well on logs from diverse systems. Second, existing super-vised log parsers require model tuning, which is often limited to fixed training samples and causes sub-optimal performance across the entire log source. To address this limitation, we propose Di-vLog, an effective log parsing framework based on the in-context learning (ICL) ability of large language models (LLMs). Specifically, before log parsing, DivLog samples a small amount of offline logs as candidates by maximizing their diversity. Then, during log parsing, DivLog selects five appropriate labeled candidates as examples for each target log and constructs them into a prompt. By mining the semantics of examples in the prompt, DivLog generates a target log template in a training-free manner. In addition, we design a straightforward yet effective prompt format to extract the output and enhance the quality of the generated log templates. We conducted experiments on 16 widely-used public datasets. The results show that DivLog achieves (1) 98.1% Parsing Accuracy, (2) 92.1% Precision Template Accuracy, and (3) 92.9% Recall Template Accuracy on average, exhibiting state-of-the-art performance. © 2024 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Unsigned Road Incidents Detection Using Improved RESNET From Driver-View Images

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1203-1216页

作者： Li, Changping Wang, Bingshu Zheng, Jiangbin Zhang, Yongjun Chen, C.L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Frequent road incidents cause significant physical harm and economic losses globally. The key to ensuring road safety lies in accurately perceiving surrounding road incidents. However, the highly dynamic nature of traffic introduces significant challenges, particularly in detecting sudden and temporary incidents. In this article, we propose a novel detection framework, multihead attention ResNet with dynamic bottleneck (DB_RESNET_MHA), to identify physical unsigned road incidents. Our approach introduces three key innovations. First, we develop a tailored data augmentation strategy to create images that closely mimic the complex variations found in real-world road environments. Second, we enhance model expressiveness by employing attention mechanisms to nonlinearly integrate convolutional kernels within the residual network. Furthermore, we refine the prediction head by applying spatially distinct attention weights, enabling the model to capture intricate correlations between different features more effectively. To demonstrate the effectiveness of our method, we create a dataset for unsigned road incidents (UnsignRI), comprising a total of 16 323 images that capture 12 distinct types of incidents. It stands out as the most comprehensive dataset in the field, encompassing a wide range of geographical features and incident categories. Experimental results show that DB_RESNET_MHA achieves an average accuracy of 96.2% and a f1-score of 0.955 across various categories of unsigned incidents, surpassing other models. © 2020 IEEE.

关键词： Highway accidents

来源：评论

学校读者我要写书评

暂无评论

Theoretical Insights for Diffusion Guidance: A Case Study for Gaussian Mixture Models 41

Theoretical Insights for Diffusion Guidance: A Case Study fo...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wu, Yuchen Chen, Minshuo Li, Zihao Wang, Mengdi Wei, Yuting Department of Statistics and Data Science The Wharton School University of Pennsylvania United States Department of Electrical and Computer Engineering Princeton University United States

Diffusion models benefit from instillation of task-specific information into the score function to steer the sample generation towards desired properties. Such information is coined as guidance. For example, in text-to-image synthesis, text input is encoded as guidance to generate semantically aligned images. Proper guidance inputs are closely tied to the performance of diffusion models. A common observation is that strong guidance promotes a tight alignment to the task-specific information, while reducing the diversity of the generated samples. In this paper, we provide the first theoretical study towards understanding the influence of guidance on diffusion models in the context of Gaussian mixture models. Under mild conditions, we prove that incorporating diffusion guidance not only boosts classification confidence but also diminishes distribution diversity, leading to a reduction in the differential entropy of the output distribution. Our analysis covers the widely adopted sampling schemes including those based on the SDE and ODE reverse processes, and leverages comparison inequalities for differential equations as well as the Fokker-Planck equation that characterizes the evolution of probability density function, which may be of independent theoretical interest. Copyright 2024 by the author(s)

关键词： Fokker Planck equation

来源：评论

学校读者我要写书评

暂无评论

CaFe DBSCAN: A Density-based Clustering Algorithm for Causal Feature Learning 10

CaFe DBSCAN: A Density-based Clustering Algorithm for Causal...

引用

10th IEEE International Conference on data science and Advanced Analytics, DSAA 2023

作者： Weber, Pascal Miklautz, Lukas Kumar, Akshey Grosse-Wentrup, Moritz Plant, Claudia Doctoral School of the University of Vienna Vienna Austria University of Vienna Data Science@Uni Vienna Faculty of Computer Science Vienna Austria

ISBN: (纸本)9798350345032

Causal Feature Learning (CFL) infers macro-level causes (e.g., an aggregation of pixels in a traffic light image) from micro-level data (e.g., pixels of the image) by clustering the predicted probabilities of effect states (e.g., state of the traffic light). The current method for CFL uses a two-step procedure. First, a classifier for the effect states is trained, and afterwards, the predicted effect state probabilities are clustered. With CaFe DBSCAN, we present a novel density-based clustering method that conducts CFL directly by estimating conditional probabilities during clustering. To this end, we introduce the notion of clustering regions with similar conditional probabilities of the effect states given their micro-level data points. Our single-step approach has the following benefits: (1) CaFe DBSCAN introduces a comprehensive approach to Causal Feature Learning. Unlike existing methods, CaFe DBSCAN uses a probabilistic framework and does not require separate classification and clustering steps implemented by different algorithms relying on various assumptions, parameter settings, and optimization goals. (2) We do not need to train and tune a classifier first, hence the algorithm is more runtime-efficient than the current approach. (3) Due to the properties of density-based clustering algorithms, CaFe DBSCAN is robust against noise and outliers, which leads to purer clusters. (4) Our algorithm automatically infers a reasonable number of clusters, i.e., macro-level causes. We demonstrate the benefits of CaFe DBSCAN on synthetic and real-world data. © 2023 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Counterfactual Explanation Through Constraint Relaxation 36

Counterfactual Explanation Through Constraint Relaxation

引用

36th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2024

作者： Gupta, Sharmi Dev O'Sullivan, Barry Quesada, Luis Insight Centre for Data Analytics SFI Centre for Research Training in Artificial Intelligence School of Computer Science IT University College Cork Cork Ireland

ISBN: (纸本)9798331527235

Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints. A common approach to recover feasibility is to eliminate the constraints that cause the conflicts in the system. This approach allows the system to provide an explanation as: 'if the user is willing to drop some of their constraints, there exists a solution'. However, this form of explanation might not be very informative. A counterfactual explanation is a type of explanation that can provide a basis for the user to recover feasibility by helping them understand what changes can be applied to their existing constraints rather than removing them. We propose an iterative method based on conflict detection and maximal relaxations in over-constrained constraint satisfaction problems to help compute a counterfactual explanation. We have evaluated our approach using well known instances that occur in industrial applications and demonstrated the relevance of multi-point relaxations. © 2024 IEEE.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Dynamic community detection algorithm based on hyperbolic graph convolution

引用

International Journal of Intelligent Computing and Cybernetics 2024年第3期17卷 632-653页

作者： Weijiang Wu Heping Tan Yifeng Zheng College of Information Science and Engineering/College of Artificial Intelligence China University of Petroleum BeijingBeijingChina Beijing Key Laboratory of Petroleum Data Mining China University of Petroleum BeijingBeijingChina School of Computer Science Minnan Normal UniversityZhangzhouChina

Purpose:Community detection is a key factor in analyzing the structural features of complex ***,traditional dynamic community detection methods often fail to effectively solve the problems of deep network information loss and computational complexity in hyperbolic *** address this challenge,a hyperbolic space-based dynamic graph neural network community detection model(HSDCDM)is ***/methodology/approach:HSDCDM first projects the node features into the hyperbolic space and then utilizes the hyperbolic graph convolution module on the Poincare and Lorentz models to realize feature fusion and information *** addition,the parallel optimized temporal memory module ensures fast and accurate capture of time domain information over extended ***,the community clustering module divides the community structure by combining the node characteristics of the space domain and the time *** evaluate the performance of HSDCDM,experiments are conducted on both artificial and real ***:Experimental results on complex networks demonstrate that HSDCDM significantly enhances the quality of community detection in hierarchical *** shows an average improvement of 7.29%in NMI and a 9.07%increase in ARI across datasets compared to traditional *** complex networks with nonEuclidean geometric structures,the HSDCDM model incorporating hyperbolic geometry can better handle the discontinuity of the metric space,provides a more compact embedding that preserves the data structure,and offers advantages over methods based on Euclidean geometry ***/value:This model aggregates the potential information of nodes in space through manifoldpreserving distribution mapping and hyperbolic graph topology ***,it optimizes the Simple Recurrent Unit(SRU)on the hyperbolic space Lorentz model to effectively extract time series data in hyperbolic space,thereby enhancing computing efficiency by eliminating t

关键词： Complex networks Dynamic community detection Hyperbolic graph neural network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：