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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Jin, Xiongnan Wang, Zhilin Chen, Jinpeng Yang, Liu Oh, Byungkook Hwang, Seung-Won Li, Jianqiang National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Alibaba Group China School of Computer Science Beijing University of Posts and Telecommunications China Xiangjiang Laboratory China School of Computer Science and Engineering Central South University China Computer Science & Engineering Konkuk University Korea Republic of Department of Computer Science and Engineering Seoul National University Korea Republic of

ISBN: (纸本)157735897X

Entity alignment (EA) is crucial for integrating knowledge graphs (KGs) constructed from diverse sources. Conventional unsupervised EA approaches attempt to eliminate human intervention but often suffer from accuracy limitations. With the rise of large language models (LLMs), leveraging their capabilities for EA presents a promising direction. However, it introduces new challenges: formulating the LLM-based EA problem and extracting the background knowledge in LLMs to realize EA without human intervention. This paper proposes HLMEA, a novel hybrid language model-based unsupervised EA method. HLMEA formulates the EA task into a filtering and single-choice problem and synergistically integrates small language models (SLMs) and LLMs. Specifically, SLMs filter candidate entities based on textual representations generated from KG triples. Then, LLMs refine this selection to identify the most semantically aligned entities. An iterative self-training mechanism allows SLMs to distill knowledge from LLM outputs, enhancing the EA ability of hybrid language models in subsequent rounds cooperatively. We also conducted extensive experiments on benchmark datasets to evaluate HLMEA's performance. The results demonstrate that HLMEA significantly outperforms unsupervised and even supervised EA baselines, proving its potential for scalable and effective EA across large KGs. The code and data are available at https://***/xnjin-ai/HLMEA. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ShiftwiseConv: Small Convolutional Kernel with Large Kernel Effect

arXiv

引用

arXiv 2024年

作者： Li, Dachong Li, Li Chen, Zhuangzhuang Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Mathematical Sciences Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology China

Large kernels make standard convolutional neural networks (CNNs) great again over transformer architectures in various vision tasks. Nonetheless, recent studies meticulously designed around increasing kernel size have shown diminishing returns or stagnation in performance. Thus, the hidden factors of large kernel convolution that affect model performance remain unexplored. In this paper, we reveal that the key hidden factors of large kernels can be summarized as two separate components: extracting features at a certain granularity and fusing features by multiple pathways. To this end, we leverage the multi-path long-distance sparse dependency relationship to enhance feature utilization via the proposed Shiftwise (SW) convolution operator with a pure CNN architecture. In a wide range of vision tasks such as classification, segmentation, and detection, SW surpasses state-of-the-art transformers and CNN architectures, including SLaK and UniRepLKNet. More importantly, our experiments demonstrate that 3 × 3 convolutions can replace large convolutions in existing large kernel CNNs to achieve comparable effects, which may inspire follow-up works. Code and all the models at https://***/lidc54/shift-wiseConv. © 2024, CC BY-NC-SA.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Single Block Encoder-Decoder Transformer Model for Multi-Step Traffic Flow Forecasting 6

Single Block Encoder-Decoder Transformer Model for Multi-Ste...

引用

6th IEEE Symposium on computers and Informatics, ISCI 2024

作者： Omar, Mas Yakub, Fitri Talip, Mohamad Sofian Abu Maslan, Mohd Nazmin Sinha, Vijay Kumar Muljono, Muljono Universiti Teknologi Malaysia Wee Laboratory Malaysia-Japan International Institute of Technology Kuala Lumpur Malaysia Universiti Teknologi Malaysia Malaysia-Japan International Institute of Technology Department of Electronic System Engineering Kuala Lumpur Malaysia University of Malaya Faculty of Engineering Department of Electrical Engineering Kuala Lumpur Malaysia Universiti Teknikal Malaysia Faculty of Industrial and Manufacturing Technology and Engineering Melaka Malaysia Chitkara University School of Engineering & Technology Department of Computer Science & Engineering Himachal Pradesh India Universitas Dian Nuswantoro Faculty of Computer Science Semarang Indonesia

ISBN: (纸本)9798350353853

Accurate traffic flow forecasting is crucial for managing and planning urban transportation systems. Despite the widespread use of sequence modelling models like Long Short-Term Memory (LSTM) for this purpose, the potential of Transformer models remains underexplored. This is particularly true for the simplest form of a single block encoder-decoder Transformer model, which can be finely tuned through optimised hyperparameters. This paper examines the performance of a singular horizon-step forecasting method for multi-step traffic flow forecasting using a proposed Single Block Encoder-Decoder Transformer model optimised with a Grid Search algorithm. Results demonstrate that this model can enhance forecasting accuracy compared to the state-of-the-art LSTM model typically used for multi-step forecasting. The model effectively captures long-range temporal dependencies within a single road traffic flow dataset. It was tested on hourly traffic flow data to forecast the next 24 hours for the I5-North freeway in California, sourced from the Caltrans Performance Measurement system. The optimal configuration included an embedding dimension of 32, a feed-forward dimension of 128, and 8 attention heads. Results show a significant improvement, with a 4.7% reduction in Root Mean Squared Error compared to an LSTM model with two hidden layers of 100 neurons each, showcasing the potential of Single Block Encoder-Decoder Transformer models for real-world traffic prediction applications. © 2024 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Efficiently Verifying Mutually Exclusive Inconsistency of Requirements for Embedded systems 9

Efficiently Verifying Mutually Exclusive Inconsistency of Re...

引用

9th International Symposium on system Security, Safety, and Reliability, ISSSR 2023

作者： Chen, Xiaohong Ruan, Kun Jin, Zhi Li, Junhu Zheng, Lingling East China Normal University Shanghai Key Laboratory of Trustworthy Computing Shanghai China Jilin University School of Software Changchun China Peking University School of Computer Science and Technology Beijing China Southwest China Research Institute of Electronic Equipment Chengdu China

ISBN: (纸本)9798350302479

Formal methods have demonstrated tremendous potential for verifying requirements consistency, particularly for safety-critical systems. In our previous research, we included environment characteristics in the scope of formal specification verification for embedded systems and proposed a requirement consistency verification method based on an environment model. However, we found that this method was not sufficiently efficient. To address this issue, this paper defines this environment model introduced inconsistency as mutually exclusive inconsistency, based on its representation characteristics, and proposes an efficient static verification approach for embedded systems. We reduce the consistency verification problem to the traversal of a graph. To support the proposed approach, we implement a requirement consistency verification tool, called Env-Consistency, and apply it to industrial cases. To illustrate the advantages of this approach, several sets of comparative experiments are designed, which demonstrates our approach is both effective and efficient. © 2023 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Block Validation Mechanism for UTXO-based Blockchains

An Efficient Block Validation Mechanism for UTXO-based Block...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Bin Xiao Jiang Xiao Hai Jin 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 China Department of Computing The Hong Kong Polytechnic University Hong Kong

It has been recognized that one of the bottlenecks in the UTXO-based blockchain systems is the slow block validation - the process of validating a newly-received block by a node before locally storing it and further broadcasting it. As a block contains multiple inputs, the block validation mainly involves checking the inputs against the status data, which is also known as the Unspent Transaction Outputs (UTXO) set. As time goes by, the UTXO set becomes more and more expansive, most of which can only be stored on disks. This considerably slows down the input checking and thus block validation, which can potentially compromise system security. To deal with the above problem, we disassemble the function of input checking into three parts: existence validation (EV), unspent validation (UV), and script validation (SV). Based on the disassembly, we propose EBV, an efficient block validation mechanism to speed up EV, UV, and SV individually. First, EBV changes the representation of status data, from UTXO set to a bit-vector set, which drastically reduces its size. The smaller status data can be entirely maintained in memory, thereby accelerating UV and also block validation. Second, EBV requires each transaction to carry the proof data, which enables EV and SV without accessing the disks. Furthermore, we also cope with two challenges in the design of EBV, namely transaction inflation and fake positions. To evaluate the EBV mechanism, we implement a prototype on top of Bitcoin, the most widely known UTXO-based blockchain, and conduct extensive experiments to compare EBV and Bitcoin. The experimental results demonstrate that EBV successfully reduces the memory requirement by 93.1 % and the block validation time by up to 93.5%.

关键词： Distributed processing Memory management Prototypes Bitcoin Broadcasting Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

An improvised CNN model for fake image detection

引用

International Journal of Information technology (Singapore) 2023年第1期15卷 5-15页

作者： Hamid, Yasir Elyassami, Sanaa Gulzar, Yonis Balasaraswathi, Veeran Ranganathan Habuza, Tetiana Wani, Sharyar Information Security and Engineering Technology Abu Dhabi Polytechnic Abu Dhabi United Arab Emirates Department of Management Information System College of Business Administration King Faisal University Riyadh Saudi Arabia Department of Networking and Communications School of Computing SRM Institute of Science and Technology Chengalpattu India Department of Computer Science and SWE College of Info. Tech UAEU Al Ain United Arab Emirates Department of Computer Science International Islamic University Malaysia Kuala Lumpur Malaysia

The last decade has witnessed a multifold growth of image data courtesy of the emergence of social networking services like Facebook, Instagram, LinkedIn etc. The major menace faced by today’s world is the issue of doctored images, where-in the photographs are altered using a rich set of ways like splicing, copy-move, removal to change their meaning and hence demands serious mitigation mechanisms to be thought of. The problem when seen from the prism of Artificial intelligence is a binary classification one, where-in the characterization must be drawn between the original and the manipulated images. This research work proposes a computer vision model based on Convolution Neural Networks for fake image detection. A comparative analysis of 6 popular traditional machine learning models and 6 different CNN architectures to select the best possible model for further experimentation. The proposed model based on ResNet50 employed with powerful preprocessing techniques results in a perfect fake image detector having a total accuracy of 0.99 having an improvement of around 18% performance with other models. © 2022, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of computer Applications and Management.

关键词： Artificial Intelligence Classification Convolution neural networks Doctored images Splicing

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Blockchain Scheme for Tracing Manufacturing Processes and Trading Transactions 22

A Hybrid Blockchain Scheme for Tracing Manufacturing Process...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Yuan, Ye Yang, Mingxing Xiong, Ruoting Sun, Yani Zhang, Xianchao Ren, Wei HuBei Land Resources Vocational College China China University of Geosciences Gemological Institute Wuhan China University of East Anglia School of Computing Science United Kingdom Yunnan Innovation Institute Beihang University Yunnan Key Laboratory of Blockchain Application Technology Kunming China Jiaxing University Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Jiaxing China State Key Laboratory of Geo-Information Engineering Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology Mnr Beijing China Ministry of Education China China University of Geosciences School of Computer Science Wuhan China

ISBN: (纸本)9798331509712

Blockchain can be envisioned as an enabling framework in terms of cryptography and distributed computing to construct trusted data records among un-trusted users. It can be applied in two typical scenarios - historical process provenance and transaction tracing, by immutably sequentialized blocks. In the former there exists no tokens;but in the latter token handover among accounts should be cryptographically guaranteed. In some situations, above two applications may be both required. E.g., in the manufacture of a jewel, processing flow by different operators should be recorded for quality guaranteeing, and in its trading stage, the ownership handover should be recorded for value confirmation. To tackle above two requirements, two chains are usually thus demanded. In this paper, we propose a single chain solution to avoid cross-chain burden, by a hybrid block structure. The process data can be imported from the legacy (non-anonymous) information processing system, and transaction data stems from anonymous payment demand for ownership handover. We formally describe and prove token handover model with cryptographical authenticity. We also propose several security enhancements in the design for shortening the length of the chain, and protecting the data confidentiality in the chain. Our design is general and not limited to single application. The experimental results and extensive analysis justified that the performance and security of our proposed scheme is efficient. © 2024 IEEE.

关键词： Data Provenance Data Tracing Hybrid Blockchain Token Handover

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Makeup Transfer Method Based on Latent Vector Manipulation 2

A Novel Hybrid Makeup Transfer Method Based on Latent Vector...

引用

2nd International Conference on Artificial Intelligence and computer Information technology, AICIT 2023

作者： Li, Yumiao Li, Peng Shen, Ziqi Li, Wenhui Key Laboratory of Intelligent Computing and Service Technology for Folk Song Ministry of Culture and Tourism Xi'an710119 China School of Computer Science Shaanxi Normal University Xi'an710119 China Key Laboratory of Modern Teaching Technology Ministry of Education Xi'an710062 China Engineering Laboratory of Teaching Information Technology of Shaanxi Province Xi'an710119 China Xi'an Key Laboratory of Cultural Tourism Resources Development and Utilization Xi'an710062 China

ISBN: (纸本)9798350302950

With the development of image processing technology and the improvement of people's living standards, there is a wide demand for makeup services in society. In this paper, we focus on style transfer and its application in automatic makeup generation, and propose a facial feature fusion recovery technique that utilizes an adaptive spatial feature fusion attention mechanism to solve the problem of inconsistent clarity between the reference image and the source image. By using the moving least squares method to calculate similarity on each sample image, the reference image set achieving the optimal makeup transfer effect can be efficiently selected. At the same time, the latent vector can be manipulated to achieve on-demand hybrid makeup generation and de-makeup image generation. By assigning different weights, the proportion of makeup in specific reference image in the final makeup effect can be controlled, and a new mixed makeup style can be obtained. The experiment shows that the proposed model can achieve state-of-the-art makeup transfer effect, and can also generate suitable makeup effects for low resolution input images. © 2023 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Two-Sided Online Task Assignment Based on Worker Portraits in Mobile CrowdSensing

Two-Sided Online Task Assignment Based on Worker Portraits i...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Zhenyang Mao Peng Li Guangzhong Liao Lei Nie Haizhou Bao Qin Liu School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China School of Cyber Science and Engineering Wuhan University China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Task assignment is a challenging problem in mobile crowdsensing (MCS), especially since workers and tasks are online. Existing work does not consider the portrait of the workers when assigning tasks, which may result in workers being assigned to fields they are not familiar with, thus affecting the quality of task completion. In this paper, we focus on online scenarios and identify a more practical task assignment problem, a two-sided (workers and tasks) online task assignment problem based on worker portrait in MCS. We decompose this problem into two subproblems: the worker portrait analysis problem (WPA) and the two-sided online personalized assignment problem (TOPA). To solve the WPA problem, we propose a worker portrait analysis algorithm that uses the semi-supervised model to describe the worker portrait at a fine-grained level. Then, based on the worker portrait, we propose a two-sided online personalized assignment algorithm to solve the TOPA problem. The proposed algorithm guarantees a lower bound on the assignment results by analyzing the worker portrait data. Moreover, we prove the TOPA problem is NP-hard and demonstrate the competitive ratio can achieve ln(max(u i,j )+1). Finally, we conduct extensive experiments on two datasets, and the experimental results show that our method outperforms baseline algorithms.

关键词： Analytical models Crowdsensing Federated learning Task analysis Synthetic data

来源：评论

学校读者我要写书评

暂无评论

FlashWalker: An In-Storage Accelerator for Graph Random Walks

FlashWalker: An In-Storage Accelerator for Graph Random Walk...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Fuping Niu Jianhui Yue Jiangqiu Shen Xiaofei Liao Haikun Liu Hai Jin 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 Wuhan China Department of Computer Science Michigan Technological University Houghton Michigan USA

Graph random walk is widely used in the graph processing as it is a fundamental component in graph analysis, ranging from vertices ranking to the graph embedding. Different from traditional graph processing workload, random walk features massive processing parallelisms and poor graph data reuse, being limited by low I/O efficiency. Prior designs for random walk mitigate slow I/O operations. However, the state-of-the-art random walk processing systems are bounded by slow disk I/O bandwidth, which is confirmed by our experiments with real-world graphs. To address this issue, we propose FlashWalker, an in-storage accelerator for random walk that moves walk updating close to graph data stored in flash memory, by exploiting significant parallelisms inside SSD. Featuring a heterogeneous and parallel processing system, FlashWalker includes a board-level accelerator, channel-level accelerators, and chip-level accelerators. To address challenges posed by the tight resource constraints for processing large-scale graphs, we propose novel designs: storing a few popular subgraphs in accelerators, the pre-walking for dense walks, two optimizations to search the subgraph mapping table, and a subgraph scheduling algorithm. We implement FlashWalker in RTL, showing small circuit area overhead. Our evaluation shows FlashWalker reduces the execution time of random walk algorithms by up to 660.50×, compared with GraphWalker, which is the state-of-the-art system for random walk algorithms.

关键词： Distributed processing Scheduling algorithms Bandwidth Parallel processing Distance measurement Flash memories Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：