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

Employing transactional memory and helper threads to speedup Dijkstra'S algorithm

学校读者我要写书评

暂无评论

Employing transactional memory and helper threads to speedup...

38th International Conference on Parallel Processing, ICPP-2009

作者： Nikas, Konstantinos Anastopoulos, Nikos Goumas, Georgios Koziris, Nectarios School of Electrical and Computer Engineering Computing Systems Laboratory Greece

ISBN: (纸本)9780769538020

In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that computes Single Source Shortest Paths for graphs with non-negative edges and is based on the iterative extraction of nodes from a priority queue. This property limits the explicit parallelism of the algorithm and any attempt to utilize the remaining parallelism results in significant slowdowns due to synchronization overheads. To deal with these problems, we employ the concept of Helper Threads (HT) to extract parallelism on a non-traditional fashion and Transactional Memory (TM) to efficiently orchestrate the concurrent threads' accesses to shared data structures. Results demonstrate that the proposed implementation is able to achieve performance speedups (reaching up to 1.84 for 14 threads), indicating that the two paradigms could be efficiently combined. © 2009 IEEE.

关键词： Iterative methods

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

Towards AI-Powered Edge Intelligence for Object Detection in Self-Driving Cars: Enhancing IoV Efficiency and Safety

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Ahmed, Imran Ahmad, Misbah Siddiqi, Muftooh Ur Rehman Chehri, Abdellah Jeon, Gwangill Anglia Ruskin University School of Computing and Information Science Cambridge United Kingdom University of West of England Centre for Machine Vision Bristol Robotics Laboratory Bristol United Kingdom Hartpury University Department of Animal and Agriculture Gloucester United Kingdom Aston University College of Engineering and Physical Sciences Birmingham United Kingdom Department of Mathematics and Computer Science Canada Incheon National University Department of Embedded Systems Engineering Incheon Korea Republic of

In the rapidly advancing field of intelligent transportation systems, integrating Artificial Intelligence (AI) with edge computing presents a promising way to enhance the safety and efficiency of the Internet of Vehicles (IoV). This study explores and presents a deep learning based object detection model within an edge computing framework which aims to facilitate real time object detection in self driving cars. Using an urban traffic scenarios based dataset, our research shows the ability of the model to accurately detect and classify various objects important for autonomous driving. The YOLOv8 model is used in this work due to its optimal balance between accuracy and computational efficiency. This model has also demonstrated its worth by achieving good performance results, including an average precision of 0.79, a recall of 0.62, and an F1-score of 0.69. The results are demonstrated by a detailed confusion matrix, highlighting the model's effectiveness in complex driving environments and underscoring its reliability for in-vehicle deployment. By implementing AI directly on edge devices within vehicles, our approach might be helpful in significantly reducing latency, boosting decision-making speed, and enhancing data privacy by minimising dependence on cloud processing. The findings not only support the model's capabilities but also illustrate the practical benefits of edge intelligence in autonomous vehicles. These benefits, such as faster decision-making and improved data privacy, contribute effectively to the IoV infrastructure. This study marks a substantial step towards recognising the possibility of AI-enhanced edge computing in driving the next generation of autonomous vehicle technology. © 2025 IEEE.

关键词： Artificial Intelligence Autonomous Vehicles Deep leaning Edge computing Internet of Vehicles

OPEN FAULTS IN BICMOS GATES

学校读者我要写书评

暂无评论

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND systems 1995年第5期14卷 567-575页

作者： MA, SC MCCLUSKEY, EJ Center for Reliable Computing Computer Systems Laboratory Department of Electrical Engineering and Computer Science University of Stanford Stanford CA USA

Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the gate. A switch-level model for CMOS circuits is extended to include bipolar devices. With this switch-level model, opens that cannot be detected by stuck-faults or other functional tests are easily identified. It is also shown that, in BICMOS circuits, an open defect in one transistor can accelerate the wearout of another nondefective transistor.

关键词： BiCMOS integrated circuits Circuit faults Circuit testing Semiconductor device modeling Logic testing Delay MOSFETs Switching circuits Acceleration CMOS technology

Dexterous Manipulation through Imitation Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers

Federated Graph Learning via Constructing and Sharing Feature Spaces for Cross-Domain IoT

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Chen, Jiale Zhuo, Shengda He, Jinchun Qiu, Wangjie Zhang, Qinnan Xiong, Zehui Zheng, Zhiming Tang, Yin Chen, Min Wang, Changdong Huang, Shuqiang Jinan University College of Cyber Security Guangzhou China Beihang University Institute of Artificial Intelligence Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beijing100191 China Zhongguancun Laboratory Beijing China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore Jinan University School of Management Guangzhou China South China University of Technology School of Computer Science and Engineering Guangzhou China Sun Yat-sen University School of Computer Guangzhou China Jinan University College of Cyber Security of Jinan University China Guangdong Key Laboratory of Data Security and Privacy Preserving Guangzhou China

The Internet of Things (IoT) collects large volumes of diverse data, with graph data as a critical component, and extensively utilizes Federated Graph Learning (FGL) to process this data while preserving data security. However, the graph data collected by different IoT institutions are relatively independent due to various factors (e.g., data collection methods, geographical locations), and data access is restricted to local environments due to privacy constraints, IoT institutions typically possess heterogeneous feature spaces. Aggregating under these conditions could potentially contaminate local graph representations. Unfortunately, most existing FGL methods tend to overlook this issue. To address this challenge, we propose Federated Graph Learning via Constructing and Sharing Features (FedCSF), a novel FGL framework designed to build a globally consistent feature space and share it among IoT institutions. To construct and extract the feature space, we employ an uniform feature initialization across IoT institutions and design an encoder to extract both global and local feature relationships, thereby facilitating effective collaboration across data from different IoT institutions. Furthermore, we introduce an independent adaptive aggregation strategy to eliminate the integration of harmful knowledge, ensuring that the contributions from each IoT institution are effectively integrated into the global model. We theoretically analyze the convergence of FedCSF. To validate the effectiveness of FedCSF, we conducted extensive experiments under various settings (i.e., cross-datasets, and cross-domains), demonstrating its significant advantages of FedCSF in terms of performance, convergence speed, and practical adaptability © 2014 IEEE.

关键词： Federated learning

Graph Neural Network Enabled Fluid Antenna systems: A Two-Stage Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： He, Changpeng Lu, Yang Chen, Wei Ai, Bo Wong, Kai-Kit Niyato, Dusit State Key Laboratory of Advanced Rail Autonomous Operation China School of Computer Science and Technology Beijing Jiaotong University Beijing100044 China School of Electronics and Information Engineering Beijing Jiaotong University Beijing100044 China Department of Electronic and Electrical Engineering University College London LondonWC1E 6BT United Kingdom Yonsei Frontier Laboratory The School of Integrated Technology Yonsei University Seoul03722 Korea Republic of College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

An emerging fluid antenna system (FAS) brings a new dimension, i.e., the antenna positions, to deal with the deep fading, but simultaneously introduces challenges related to the transmit design. This paper proposes an "unsupervised learning to optimize" paradigm to optimize the FAS. Particularly, we formulate the sum-rate and energy efficiency (EE) maximization problems for a multiple-user multiple-input single-output (MU-MISO) FAS and solved by a two-stage graph neural network (GNN) where the first stage and the second stage are for the inference of antenna positions and beamforming vectors, respectively. The outputs of the two stages are jointly input into a unsupervised loss function to train the two-stage GNN. The numerical results demonstrates that the advantages of the FAS for performance improvement and the two-stage GNN for real-time and scalable optimization. Besides, the two stages can function separately. © 2025, CC BY.

关键词： Graph neural networks

CIRCUITS FOR PSEUDOEXHAUSTIVE TEST PATTERN GENERATION

学校读者我要写书评

暂无评论

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND systems 1988年第10期7卷 1068-1080页

作者： WANG, LT MCCLUSKEY, EJ Center for Reliable Computing Computer Systems Laboratory Departments University of Stanford Stanford CA USA Center for Reliable Computing Computer Systems Laboratory Departments of Electrical Engineering and Computer Science University of Stanford Stanford CA USA

Implementation methods based on cyclic codes are presented for pseudoexhaustive testing of combinational logic networks with restricted output dependency. A modified linear-feedback shift register (LFSR) is used to generate exhaustive test patterns for every output of the circuit. All detectable, combinational faults (those that do not change a combinational circuit to a sequential circuit) in each cone of logic driving a single output are guaranteed to be detected. Examples indicate that LFSRs based on cyclic codes have lower hardware cost and shorter or comparable test lengths than other approaches. These test-pattern generators are well suited to applications where short testing time, low hardware overhead, and 100% single-stuck-at fault coverage are required.< >

关键词： Test pattern generators Circuit testing Logic testing electrical fault detection Fault detection Circuit faults Combinational circuits Sequential circuits Hardware Shift registers

Sensing With Communication Signals: From Information Theory to Signal Processing

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Fan Liu, Ya-Feng Cui, Yuanhao Masouros, Christos Xu, Jie Han, Tony Xiao Buzzi, Stefano Eldar, Yonina C. Jin, Shi National Mobile Communications Research Laboratory School of Information Science and Engineering Southeast University Nanjing210096 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematicsand Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom Guangdong518172 China Huawei Technologies Co. Ltd China Department of Electrical and Information Engineering University of Cassino and Southern Lazio CassinoI-03043 Italy Department of Electronics Information and Bioengineering Politecnico di Milano MilanoI-20133 Italy ParmaI-43124 Italy Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel

The Integrated Sensing and Communications (ISAC) paradigm is anticipated to be a cornerstone of the upcoming 6G networks. In order to optimize the use of wireless resources, 6G ISAC systems need to harness the communication data payload signals, which are inherently random, for both sensing and communication (S&C) purposes. This tutorial paper provides a comprehensive technical overview of the fundamental theory and signal processing methodologies for ISAC transmission with random communication signals. We begin by introducing the deterministic-random tradeoff (DRT) between S&C from an information-theoretic perspective, emphasizing the need for specialized signal processing techniques tailored to random ISAC signals. Building on this foundation, we review the core signal models and processing pipelines for communication-centric ISAC systems, and analyze the average squared auto-correlation function (ACF) of random ISAC signals, which serves as a fundamental performance metric for multi-target ranging tasks. Drawing insights from these theoretical results, we outline the design principles for the three key components of communication-centric ISAC systems: modulation schemes, constellation design, and pulse shaping filters. The goal is to either enhance sensing performance without compromising communication efficiency or to establish a scalable tradeoff between the two. We then extend our analysis from a single-antenna ISAC system to its multi-antenna counterpart, discussing recent advancements in multiinput multi-output (MIMO) precoding techniques specifically designed for random ISAC signals. We conclude by highlighting several open challenges and future research directions in the field of sensing with communication signals. Copyright © 2025, The Authors. All rights reserved.

关键词： Signal modulation