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

Real-Time Road Damage Detection and Infrastructure Evaluation Leveraging Unmanned Aerial Vehicles and Tiny Machine Learning

引用

IEEE Internet of Things Journal 2024年第12期11卷 21347-21358页

作者： Khan, Muhammad Waseem Obaidat, Mohammad S. Mahmood, Khalid Batool, Dania Badar, Hafiz Muhammad Sanaullah Aamir, Muhammad Gao, Wu Comsats University Islamabad Sahiwal Campus Department Of Computer Science Sahiwal57000 Pakistan Superior University Department Of Computer Science Lahore54000 Pakistan The University Of Jordan King Abdullah Ii School Of Information Technology Amman11942 Jordan University Of Science And Technology Beijing School Of Communication And Computing Engineering Beijing100083 China Amity University Amity School Of Engineering And Technology Uttar Pradesh Noida201301 India National Yunlin University Of Science And Technology Graduate School Of Intelligent Data Science Douliu64002 Taiwan University Of Palermo Department Of Engineering Palermo90133 Italy Emerson University Department Of Emerging Computing Technologies Multan60000 Pakistan Northwestern Polytechnical University Center For Bio-Inspired System-on-Chip School Of Computer Science Xi'an710060 China

Road damage detection (RDD) through computer vision and deep learning techniques can ensure the safety of vehicles and humans on the roads. Integrating unmanned aerial vehicles (UAVs) in RDD and infrastructure evaluation (IE) has also emerged as a key enabler, contributing significantly to data acquisition and real-time monitoring of road damages, such as potholes, cracks, and surface anomalies, facilitating proactive maintenance and improved road conditions. These UAVs are low-powered and resource-constrained devices that work autonomously to perform pattern detection and decision making leveraging tiny machine learning (Tiny ML) algorithms. These Tiny ML algorithms are designed to run on edge devices, IoT devices, UAVs, etc. In this study, the RDD2022 data set collected using UAVs and dashboard cameras of vehicles was utilized to train pure and mixed models that exhibit class instance imbalance in certain classes which is addressed by implementing data augmentation as a regularization technique. State-of-the-art two-stage detectors: Faster R-CNN ResNet101 and one-stage detectors: SSD MobileNet V1 FPN, YOLOv5, and Efficientdet D1 are employed. The results indicate that the two-stage detector achieved an impressive mean average precision (mAP) of 88.49% overall and 96.62% for focused classes. Notably, the state-of-the-art Efficientdet D1 approach achieved a competitive mAP of 86.47% overall and 95.12% for focused classes, with significantly lower computational cost. These findings highlight the potential of advanced object detection techniques, particularly Efficientdet D1, to enhance the accuracy and efficiency of RDD systems, thereby improving passenger safety and overall performance. © 2014 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

LSGraph: A Locality-centric High-performance Streaming Graph Engine 24

LSGraph: A Locality-centric High-performance Streaming Graph...

引用

19th European Conference on computer Systems, EuroSys 2024

作者： Qi, Hao Wu, Yiyang He, Ligang Zhang, Yu Luo, Kang Cai, Minzhi Jin, Hai Zhang, Zhan Zhao, 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 Computer Science University of Warwick United Kingdom Zhejiang Lab China

ISBN: (纸本)9798400704376

Streaming graph has been broadly employed across various application domains. It involves updating edges to the graph and then performing analytics on the updated graph. However, existing solutions either suffer from poor data locality and high computation complexity for streaming graph analytics, or need high overhead to search and move graph data to ensure ordered neighbors during streaming graph update. This paper presents a novel locality-centric streaming graph engine, called LSGraph, to enable efficient both graph analytics and graph update. The main novelty of this engine is a differentiated hierarchical indexed streaming graph representation approach to achieve efficient data search and movement for graph update and also maintain data locality and ordered neighbors for efficient graph analytics simultaneously. Besides, a locality-aware streaming graph data update mechanism is also proposed to efficiently regulate the distance of data movement, minimizing the overhead of memory access during graph update. We have implemented LSGraph and conducted a systematic evaluation on both real-world and synthetic datasets. Compared with three cutting-edge streaming graph engines, i.e., Terrace, Aspen, and PaC-tree, LSGraph achieves 2.98×-81.08×, 1.46×-12.56×, and 1.26×-10.31× speedups during graph update, while obtaining 1.02×-4.28×, 1.58×-3.55×, and 1.20×-2.72× speedups during graph analytics, respectively. © 2024 Owner/Author.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Towards optimized tensor code generation for deep learning on sunway many-core processor

引用

Frontiers of computer science 2024年第2期18卷 1-15页

作者： Mingzhen LI Changxi LIU Jianjin LIAO Xuegui ZHENG Hailong YANG Rujun SUN Jun XU Lin GAN Guangwen YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China National University of Singapore Singapore 119077Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214000China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing 100854China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application *** the existing deep learning compilers,TVM is well known for its efficiency in code generation and optimization across diverse hardware *** the meanwhile,the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning *** paper combines the trends in these two ***,we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as *** addition,we leverage the architecture features during the compilation such as core group for massive parallelism,DMA for high bandwidth memory transfer and local device memory for data locality,in order to generate efficient codes for deep learning workloads on *** experiment results show that the codes generated by swTVM achieve 1.79x improvement of inference latency on average compared to the state-of-the-art deep learning framework on Sunway,across eight representative *** work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in *** believe this work will encourage more people to embrace the power of deep learning and Sunwaymany-coreprocessor.

关键词： sunway processor deep learning compiler code generation performance optimization

来源：评论

学校读者我要写书评

暂无评论

Toward High-Performance Delta-Based Iterative Processing with a Group-Based Approach

引用

Journal of computer science & technology 2022年第4期37卷 797-813页

作者： Hui Yu Xin-Yu Jiang Jin Zhao Hao Qi Yu Zhang Xiao-Fei Liao Hai-Kun Liu Fu-Bing Mao Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.

关键词： iterative algorithm delta-based execution model efficiency

来源：评论

学校读者我要写书评

暂无评论

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

引用

Journal of computer science & technology 2022年第5期37卷 1068-1085页

作者： Chun-Xue Zhu Long-Long Lin Ping-Peng Yuan Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

来源：评论

学校读者我要写书评

暂无评论

MeHyper: Accelerating Hypergraph Neural Networks by Exploring Implicit Dataflows 31

MeHyper: Accelerating Hypergraph Neural Networks by Explorin...

引用

31st IEEE International Symposium on High Performance computer Architecture, HPCA 2025

作者： Zhao, Wenju Yao, Pengcheng Chen, Dan Zheng, Long Liao, Xiaofei Wang, Qinggang Ma, Shaobo Li, Yu Liu, Haifeng Xiao, Wenjing Sun, Yufei Zhu, Bing Jin, Hai Xue, Jingling Huazhong University of Science and Technology 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 Wuhan430074 China National University of Singapore School of Computing 119077 Singapore Guangxi University School of Computer Electronics and Information NanNing530004 China University of New South Wales School of Computer Science and Engineering SydneyNSW2052 Australia

ISBN: (纸本)9798331506476

Hypergraph Neural Networks (HGNNs) are increasingly utilized to analyze complex inter-entity relationships. Traditional HGNN systems, based on a hyperedge-centric dataflow model, independently process aggregation tasks for hyperedges and vertices, leading to significant computational redundancy. This redundancy arises from recalculating shared information across different tasks. For the first time, we identify and harness implicit dataflows (i.e., dependencies) within HGNNs, introducing the microedge concept to effectively capture and reuse intricate shared information among aggregation tasks, thereby minimizing redundant computations. We have developed a new microedge-centric dataflow model that processes shared information as fine-grained microedge aggregation tasks. This dataflow model is supported by the Read-Process-Activate-Generate execution model, which aims to optimize parallelism among these tasks. Furthermore, our newly developed MeHyper, a microedge-centric HGNN accelerator, incorporates a decoupled pipeline for improved computational parallelism and a hierarchical feature management strategy to reduce off-chip memory accesses for large volumes of intermediate feature vectors generated. Our evaluation demonstrates that MeHyper substantially outperforms the leading CPUbased system PyG-CPU and the GPU-based system HyperGef, delivering performance improvements of 1,032.23 × and 10.51 ×, and energy efficiencies of 1,169.03 × and 9.96 ×, respectively. © 2025 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Automated heart disease prediction using improved explainable learning-based technique

引用

Neural computing and Applications 2024年第26期36卷 16289-16318页

作者： Bizimana, Pierre Claver Zhang, Zuping Hounye, Alphonse Houssou Asim, Muhammad Hammad, Mohamed El-Latif, Ahmed A. Abd School of Computer Science and Engineering Central South University Changsha410083 China School of Mathematics and Statistics Central South University Changsha410008 China EIAS Data Science Lab College of Computer and Information Sciences and Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh11586 Saudi Arabia School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China Department of Mathematics and Computer Science Faculty of Science Menoufia University Shebin El-Koom Egypt Information Technology Department Faculty of Computers and Information Menoufia University Shebin El-Koom Egypt

Heart disease (HD) stands as a major global health challenge, being a predominant cause of death and demanding intricate and costly detection methods. The widespread impact of heart failure, contributing to increased rates of morbidity and mortality, underscores the urgency for accurate and timely prediction and diagnosis. This is crucial for effective prevention, early detection, and treatment, thereby reducing the threat to individual health. However, the early and precise prediction of HD remains a significant challenge. The complexity of medical data poses a considerable challenge for healthcare professionals, who are required to interpret and utilize this information swiftly for effective intervention. Addressing this gap, our study introduces a novel Improved Explainable Learning-Based Technique (IELBT) for HD prediction. This technique harnesses a strategic combination of feature selection, Venn diagrams, data normalization methods, optimized parameters, and machine learning algorithms, specifically tailored for predicting HD. We evaluated the performance of our model using the Alizadeh Sani HD dataset, aiming to accurately detect the presence or absence of the condition. Our results demonstrate that the IELBT, employing a support vector machine with a robust scaling approach, optimal parameterization, and a data split ratio of 70:30, achieves an impressive accuracy rate of 96.00%. Beyond achieving high accuracy, the IELBT outperforms similar models in existing literature and provides significant interpretability and explanation, essential elements in the field of medical diagnosis. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Dynamics of synthetic yeast chromosome evolution shaped by hierarchical chromatin organization

引用

National science Review 2023年第5期10卷 240-250页

作者： Sijie Zhou Yi Wu Yu Zhao Zhen Zhang Limin Jiang Lin Liu Yan Zhang Jijun Tang Ying-Jin Yuan Frontiers Science Center for Synthetic Biology (Ministry of Education) Tianjin University Key Laboratory of Systems Bioengineering(Ministry of Education) School of Chemical Engineering and TechnologyTianjin University Institute for Systems Genetics NYU Langone Health School of Computer Science and Technology College of Intelligence and ComputingTianjin University Epigenetic Group Frasergen Bioinformatics Co.Ltd. Department of Computer Science University of South Carolina

Synthetic genome evolution provides a dynamic approach for systematically and straightforwardly exploring evolutionary *** Chromosome Rearrangement and Modification by LoxP-mediated Evolution(SCRaMbLE) is an evolutionary system intrinsic to the synthetic yeast genome that can rapidly drive structural ***,we detect over 260 000 rearrangement events after the SCRaMbLEing of a yeast strain harboring 5.5 synthetic yeast chromosomes(synⅡ,synⅢ,synⅤ,circular synⅥ,synⅨR and synⅩ).Remarkably,we find that the rearrangement events exhibit a specific landscape of *** further reveal that the landscape is shaped by the combined effects of chromatin accessibili and spatial contact *** rearrangements tend to occur in 3D spatially proximal and chromatin-accessible *** enormous numbers of rearrangements mediated by SCRaMbLE provide a driving force to potentiate directed genome evolution,and the investigation of the rearrangement landscape offers mechanistic insights into the dynamics of genome evolution.

关键词： synthetic biology genome rearrangement hierarchical chromatin organization synthetic yeast genome SCRaMbLE Saccharomyces cerevisiae

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Demystifying Ethereum account diversity:observations,models and analysis

引用

Frontiers of computer science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：