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

Towards Intelligent Transportation with Pedestrians and Vehicles In-the-Loop: A Surveillance Video-Assisted Federated Digital Twin Framework

引用

IEEE Network 2025年

作者： Li, Xiaolong Wei, Jianhao Wang, Haidong Dong, Li Chen, Ruoyang Yi, Changyan Cai, Jun Niyato, Dusit Shen, Xuemin Hunan Provincial General University Key Laboratory of IoT Intelligent Sensing and Distributed Collaborative Optimization Hunan University of Technology and Business Xiangjiang Laboratory Changsha410205 China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China University of Concordia Department of Electrical and Computer Engineering Montreal Canada Nanyang Technological University College of Computing and Data Science Singapore Singapore University of Waterloo Department of Electrical and Computer Engineering Canada

In intelligent transportation systems (ITSs), integrating pedestrians and vehicles into traffic management models is essential for developing realistic and safe solutions. However, current systems often fail to simulate complex, real-world scenarios due to the absence of a comprehensive digital twin framework across diverse traffic environments and effective modeling of pedestrian-vehicle interactions. In this article, we propose a surveillance video-assisted federated digital twin (SV-FDT) framework to enhance ITSs by incorporating pedestrians and vehicles into the control loop. SV-FDT improves computational efficiency and communication performance by transmitting only semantic data and agent parameters, rather than raw video streams. The proposed framework adopts three-layer architecture and constructs detailed pedestrian-vehicle interaction models using multi-source traffic surveillance videos. The three-layer architecture includes: (i) an end layer that collects surveillance videos from multiple sources;(ii) an edge layer that performs self-supervised semantic segmentation to extract interactions, converts them into executable traffic codes, and generates local digital twin systems (LDTSs) for regional traffic modeling;and (iii) a cloud layer that integrates LDTSs into a real-time global digital twin model. Key design considerations, challenges, and practical implementation guidelines are discussed for SV-FDT, and a testbed evaluation is used to show that SV-FDT improves traffic flow, reduces mirroring delay, and enhances recognition accuracy and system efficiency compared to traditional terminal-server frameworks. Finally, we outline open challenges and potential directions for future research in digital twin-enabled ITS. © 1986-2012 IEEE.

关键词： Air traffic control

来源：评论

学校读者我要写书评

暂无评论

parallel computing for large-scale author name disambiguation in medline 21

Parallel computing for large-scale author name disambiguatio...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data science and Systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Succinct representations in collaborative filtering: A case study using wavelet tree on 1,000 cores 20

Succinct representations in collaborative filtering: A case ...

引用

20th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2019

作者： Peng, Xiangjun Wang, Qingfeng Sun, Xu Gong, Chunye Wang, Yaohua User-Centric Computing Group University of Nottingham Ningbo China China Department of Computer Science and Technology National University of Defense Technology China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China

ISBN: (纸本)9781728126166

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results. © 2019 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneous Processor Design for CNN-Based AI Applications on IoT Devices

引用

Procedia computer science 2020年 174卷 2-8页

作者： Zhiqiang Liu Jingfei Jiang Guoqing Lei Kai Chen Buyue Qin Xiaoqiang Zhao Artificial Intelligence Research Center National Innovation Institute of Defense Technology Beijing China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China College of System Engineering National University of Defense Technology Changsha China

This paper proposes a heterogeneous processor design for CNN-based AI applications on IoT devices. The heterogeneous processor contains an embedded RISC-V CPU that works as a general processor and an efficient CNN-accelerator that supports a variety of CNN models with a list of macro instructions. For demonstration, we implement a prototype on an FPGA platform with the RISC-V CPU working under 20 MHz and the CNN accelerator working under 100 MHz. As a case study, we run a CNN-based face detection and recognition application on this prototype. The prototype can process one image in 0.72 seconds and an ASIC implementation working under 400 MHz can process one image in less than 0.15 seconds by estimation, which can satisfy the needs for many IoT scenarios such as access control systems and check-in systems.

关键词： Processor RISC-V Accelerator AI (Artificial Intelligence) CNN (Convolutional Neural Network) IoT (Internet of Things)

来源：评论

学校读者我要写书评

暂无评论

Personalized Local Differential Privacy for Multi-dimensional Range Queries over Mobile User Data

引用

IEEE Transactions on Mobile Computing 2025年

作者： He, Yuanyuan Wang, Meiqi Deng, Xianjun Yang, Peng Xue, Qiao Yang, Laurence T. Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan430074 China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology Nanjing210000 China

Multi-dimensional range queries performed on the mobile user data records become increasingly important and popular in the fields of e-commerce, social media, transportation logistics, etc. Meanwhile, mobile users usually have different privacy requirements for different attributes of the records. A straightforward and effective approach is to first get low-dimensional range query outcomes by using existing LDP mechanisms at different privacy levels, and then derive high-dimensional range query results at each level, and finally aggregate the results from all levels. However, it incurs low utility of the query results, since the non-fixed privacy budgets and the correlation between dimensions (attributes) detrimentally impact the utility of LDP methods, ultimately rendering them ineffective in practice. In this paper, we propose a new Personalized LDP approach for Multi-dimensional Range queries (PLDP-MR) over mobile user data, consisting of the user grouping, data perturbing, data re-perturbing, and range query results aggregating steps. First, PLDP-MR offers flexible dual grouping based on user-selected privacy levels and relevant attributes to obtain the corresponding one-dimensional and two-dimensional grids. PLDP-MR optimizes the grid granularity to minimize errors from perturbing users' attribute data with different LDP noises at non-fixed privacy levels. Furthermore, PLDP-MR carefully re-perturbs the LDP-noisy data from mobile users at lower privacy levels (i.e., having the higher utility) to achieve LDP with higher privacy levels and supplement the data volume of the corresponding groups. Thus, the data utility is effectively improved without additional privacy losses. Finally, PLDP-MR aggregates the frequencies in all the one-dimensional and two-dimensional grids related to the multi-dimensional range query at all query intervals and all privacy levels to derive the final query result with considering the correlation between attributes. The aggregations use

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Improve the Detection of Clustered Outliers via Outlier Score Propagation

Improve the Detection of Clustered Outliers via Outlier Scor...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yongmou Li Yijie Wang Hongtao Guan Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Most of the existing outlier detection methods in the literature often adopt the assumption that the outliers would locate in the low-density area of the input data space. However, such low-density assumption may not hold in the presence of clustered outliers, which usually demonstrate relatively high density. For this reason, the clustered and cluster-based outlier detection methods are proposed; however, these methods either make strong data distribution assumptions or rely on the high-quality clustering results which are often not available. To address this issue, we propose a graph-based outlier detection approach which is capable of significantly enhancing the performance of existing outlier detection methods, in the presence of clustered outliers. Experiments are conducted on both synthesized and real-world datasets to demonstrate the superiority of our proposed method. In particular, our proposed method outperforms the state-of-the-art clustered outlier detection methods by a large margin.

关键词： Anomaly detection Support vector machines Kernel distributed databases Forestry Vegetation Transforms

来源：评论

学校读者我要写书评

暂无评论

Regulatory Element parallel Mining Algorithm Based on Bit Combination 12

Regulatory Element Parallel Mining Algorithm Based on Bit Co...

引用

12th International Symposium on Computational Intelligence and Design, ISCID 2019

作者： Zhou, Kailong Lu, Jun Zhao, Renpeng Lv, Xingfeng Heilongjiang University College of Computer Science and Technology Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781728146522

Regulatory element parallel mining algorithm of frequent itemset based on bit combination is proposed in this paper. The algorithm is represented by converting promoter data filtered by frequent itemset into binary machine bits, and then mining the frequent itemset of the data set in parallel by means of regulatory element. In the whole mining process, if a combination of regulatory elements is frequent, data should be added 1, and if it is not frequent, the data should be pruned. Preprocessing, eliminating and other operations are used to optimize the whole algorithm. Converting the processed raw data and regulatory element into binary bits facilitates the parallel operation of data and saves memory space, breaking through the limitations of traditional methods that cannot be effectively parallelized due to recursive operations in the mining process. In this thesis, OpenMP technology is used to parallelize the algorithm based on regulatory element, which improves the efficiency of the algorithm. © 2019 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A distributed Computing Framework Based on Variance Reduction Method to Accelerate Training Machine Learning Models

A Distributed Computing Framework Based on Variance Reductio...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Zhen Huang Mingxing Tang Feng Liu Jinyan Qiu Hangjun Zhou Yuan Yuan Changjian Wang Dongsheng Li Yuxing Peng Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China H.R. Support Center PLA Changsha China Hunan University of Finance and Economics Changsha China

ISBN: (数字)9781728169811

ISBN: (纸本)9781728169828

To support large-scale intelligent applications, distributed machine learning based on JointCloud is an intuitive solution scheme. However, the distributed machine learning is difficult to train due to that the corresponding optimization solver algorithms converge slowly, which highly demand on computing and memory resources. To overcome the challenges, we propose a computing framework for L-BFGS optimization algorithm based on variance reduction method, which can utilize a fixed big learning rate to linearly accelerate the convergence speed. To validate our claims, we have conducted several experiments on multiple classical datasets. Experimental results show that the computing framework accelerate the training process of solver and obtain accurate results for machine learning algorithms.

关键词： Acceleration Stochastic processes Machine learning algorithms Approximation algorithms Symmetric matrices Machine learning Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-based Energy-Aware Offloading in Edge-Cloud Vehicular Networks

引用

Procedia computer science 2021年 191卷 328-336页

作者： Leila Ismail Huned Materwala Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi 15551 United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi 15551 United Arab Emirates

A vehicular network underpinned by the 3-tier vehicle-edge-cloud infrastructure enables an efficient and safer travel experience. The compute-intensive vehicular applications are often offloaded to the edge and/or cloud servers to enhance the applications’ Quality of Services (QoS). The underlying edge-cloud servers consume a high among of energy. Consequently, it becomes crucial to optimizing energy consumption in the offloading process. Current energy-efficient offloading strategies in 2-tier vehicle-edge infrastructure, do not account for cloud computing energy consumption. In this paper, we address this void by proposing a machine learning-based energy-aware offloading algorithm, which optimizes the energy of the edge-cloud computing platform. The offloading strategy is enabled by the Support Vector Machine (SVM) regression model machine learning algorithm used for the edge-cloud power prediction. The experimental results show that the proposed algorithm is a promising approach in energy savings.

关键词： Cloud computing Computation offloading Edge computing Energy-efficiency Machine learning Queuing theory Support Vector Machine (SVM) Vehicular network

来源：评论

学校读者我要写书评

暂无评论

Load Balancing a Multi-Block Grids-based Application on Heterogeneous Platform

Load Balancing a Multi-Block Grids-based Application on Hete...

引用

IEEE International Conference on Computational science and Engineering, CSE

作者： Yonggang Che Chuanfu Xu Zhenghua Wang Institute for Quantum Information & State Key Lab. of High Performance Computing College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Lab National University of Defense Technology Changsha China

ISBN: (数字)9781665403986

ISBN: (纸本)9781665403993

This paper presents a load balancing method for a multi-block grids-based CFD (Computational Fluid Dynamics) application on heterogeneous platform. This method includes an asymmetric task scheduling scheme and a load balancing model. The idea is to balance the computing speed between the CPU and the coprocessor by adjusting the workload and the numbers of threads on both sides. Optimal load balance parameters are empirically selected, guided by a performance model. Performance evaluation is conducted on a computer server consists of two Intel Xeon E5-2670 v3 CPUs and two MIC coprocessors (Xeon Phi 5110P and Xeon Phi 7120P) for the simulation of turbulent combustion in a supersonic combustor. The results show that the performance is highly sensitive to the load balance parameters. With the optimal parameters, the heterogeneous computing achieves a maximum speedup of 2.30 × for a 6-block mesh, and a maximum speedup of 2.66 × for a 8-block mesh, over the CPU-only computing.

关键词： Computational modeling Computational fluid dynamics Load management Servers Task analysis Load modeling Coprocessors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：