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

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Chuangyi Gui Long Zheng Pengcheng Yao Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China

Triangle counting is one of the most basic graph applications to solve many real-world problems in a wide variety of domains. Exploring the massive parallelism of the Graphics Processing Unit (GPU) to accelerate the triangle counting is prevail. We identify that the stat-of-the-art GPU-based studies that focus on improving the load balancing still exhibit inherently a large number of random accesses in degrading the performance. In this paper, we design a prefetching scheme that buffers the neighbor list of the processed vertex in advance in the fast shared memory to avoid high latency of random global memory access. Also, we adopt the degree-based graph reordering technique and design a simple heuristic to evenly distribute the workload. Compared to the state-of-the-art HEPC Graph Challenge Champion in the last year, we advance to improve the performance of triangle counting by up to 5.9× speedup with> 109 TEPS on a single GPU for many large real graphs from graph challenge datasets.

关键词： Graphics processing units Prefetching Parallel processing Indexes Acceleration Optimization

来源：评论

学校读者我要写书评

暂无评论

VulDeeLocator: A deep learning-based fine-grained vulnerability detector

arXiv

引用

arXiv 2020年

作者： Li, Zhen Zou, Deqing Xu, Shouhuai Chen, Zhaoxuan Zhu, Yawei Jin, Hai The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Cyber Security and Computer Hebei University Baoding071002 China The Department of Computer Science University of Colorado Colorado Springs CO80918 United States University of Texas San Antonio United States

Automatically detecting software vulnerabilities is an important problem that has attracted much attention from the academic research community. However, existing vulnerability detectors still cannot achieve the vulnerability detection capability and the locating precision that would warrant their adoption for real-world use. In this paper, we present a vulnerability detector that can simultaneously achieve a high detection capability and a high locating precision, dubbed Vulnerability Deep learning-based Locator (VulDeeLocator). In the course of designing VulDeeLocator, we encounter difficulties including how to accommodate semantic relations between the definitions of types as well as macros and their uses across files, how to accommodate accurate control flows and variable define-use relations, and how to achieve high locating precision. We solve these difficulties by using two innovative ideas: (i) leveraging intermediate code to accommodate extra semantic information, and (ii) using the notion of granularity refinement to pin down locations of vulnerabilities. When applied to 200 files randomly selected from three real-world software products, VulDeeLocator detects 18 confirmed vulnerabilities (i.e., true-positives). Among them, 16 vulnerabilities correspond to known vulnerabilities;the other two are not reported in the national Vulnerability database (NVD) but have been "silently" patched by the vendor of Libav when releasing newer versions. Copyright © 2020, The Authors. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Minimum Spanning Tree Clustering Based on Density Filtering 7th

Minimum Spanning Tree Clustering Based on Density Filtering

引用

7th CCF Academic Conference on bigdata, CCF bigdata 2019

作者： Wang, Ke Xie, Xia Sun, Jiayu Cao, Wenzhi 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 Wuhan430074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hunan University of Technology and Business Changsha410205 China

ISBN: (纸本)9789811518980

Clustering analysis is an important method in data mining. In order to recognize clusters with arbitrary shapes as well as clusters with different density, we propose a new clustering approach: minimum spanning tree clustering based on density filtering. It masks the low-density points in the density filtering step, which reduces the interference of noise and makes the gap between clusters clearer. It uses relative values of adjacent distances to find mutations of density and changes between clusters to divide data sets. It is tested on multiple synthetic data sets and real-world data sets, the results of which show that the algorithm is able to detect clusters with arbitrary shape and it is insensitive to the imbalance of density between clusters. It has achieved great results on multiple data sets. © Springer Nature Singapore Pte Ltd 2019.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Revocable Certificateless Signature Scheme for IoT Device

引用

International Journal of Network Security 2021年第6期23卷 1012-1027页

作者： Chen, Yushuang Zheng, Dong Guo, Rui Zhang, Yinghui Tao, Xiaoling School of Cyberspace Security Xi’an University of Posts and Telecommunications Xi’an710121 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China National Engineering Laboratory for Wireless Security Xi’an University of Posts and Telecommunications Guilin University of Electronic Technology Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China

With the rapid development of Internet of Things (IoT) technology, completing a transaction with intelligent devices has been an essential communication mode in our daily life. Generally, lightweight smart devices conduct transactions relying on the third-party payment platform, which takes several inherent challenges of mutual distrust, data authentication and low efficiency in the IoT environment. To mitigate these issues, in this paper, we design a paring-free revocable certificateless signature (CLS) scheme with high efficiency based on the blockchain technique. Our scheme is a viable approach to enhance the performance without bilinear parings operation in the IoT lightweight equipment. And there are two different address lists stored in the blockchain to record the secret and public transaction data, respectively. According to this method, not only can the key management of the user be implemented in an efficient solution, but also enables the public verification to be performed transparently between the two parties. Furthermore, with the help of cloud server, it generates a time key for the user to accomplish revocation with low computation cost. We also make an analysis on the security to demonstrate that our proposal is existential unforgeability against adaptive chosen message attacks (EUF-CMA) under the elliptic curve discrete logarithm (ECDL) problem. Finally, the performance comparison indicates that our protocol is better than other related schemes. © 2021. International Journal of Network Security. All Rights Reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Context aware 3d unet for brain tumor segmentation

arXiv

引用

arXiv 2020年

作者： Ahmad, Parvez Qamar, Saqib Shen, Linlin Saeed, Adnan 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 Wuhan430074 China Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China School of Hydropower and Information Technology Huazhong University of Science and Technology Wuhan430074 China

Deep convolutional neural network (CNN) achieves remarkable performance for medical image analysis. UNet is the primary source in the performance of 3D CNN architectures for medical imaging tasks, including brain tumor segmentation. The skip connection in the UNet architecture concatenates features from both encoder and decoder paths to extract multi-contexual information from image data. The multi-scaled features play an essential role in brain tumor segmentation. However, the limited use of features can degrade the performance of the UNet approach for segmentation. In this paper, we propose a modified UNet architecture for brain tumor segmentation. In the proposed architecture, we used densely connected blocks in both encoder and decoder paths to extract multi-contexual information from the concept of feature reusability. The proposed residual inception blocks (RIB) are used to extract local and global information by merging features of different kernel sizes. We validate the proposed architecture on the multimodal brain tumor segmentation challenges (BRATS) 2020 testing dataset. The dice (DSC) scores of the whole tumor (WT), tumor core (TC), and enhancement tumor (ET) are 89.12%, 84.74%, and 79.12%, respectively. Our proposed work is in the top ten methods based on the dice scores of the testing dataset. © 2020, CC-BY.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

Active legibility in multiagent reinforcement learning

引用

Artificial Intelligence 2025年 346卷

作者： Liu, Yanyu Pan, Yinghui Zeng, Yifeng Ma, Biyang Doshi, Prashant School of Automation Central South University No. 605 South Lushan Road Hunan Changsha410083 China School of Artificial Intelligence & National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom School of Computer Science Minnan Normal University Fujian Zhangzhou China Department of Computer Science University of Georgia AthensGA United States

A multiagent sequential decision problem has been seen in many critical applications including urban transportation, autonomous driving cars, military operations, etc. Its widely known solution, namely multiagent reinforcement learning, has evolved tremendously in recent years. Among them, the solution paradigm of modeling other agents attracts our interest, which is different from traditional value decomposition or communication mechanisms. It enables agents to understand and anticipate others' behaviors and facilitates their collaboration. Inspired by recent research on the legibility that allows agents to reveal their intentions through their behavior, we propose a multiagent active legibility framework to improve their performance. The legibility-oriented framework drives agents to conduct legible actions so as to help others optimize their behaviors. In addition, we design a series of problem domains that emulate a common legibility-needed scenario and effectively characterize the legibility in multiagent reinforcement learning. The experimental results demonstrate that the new framework is more efficient and requires less training time compared to several multiagent reinforcement learning algorithms. © 2025 The Author(s)

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Accuracy vs. Efficiency: Achieving both Through Hardware-Aware Quantization and Reconfigurable Architecture with Mixed Precision

Accuracy vs. Efficiency: Achieving both Through Hardware-Awa...

引用

IEEE International Conference on big data and Cloud computing (BdCloud)

作者： Libo Chang Shengbing Zhang Huimin Du Shiyu Wang Meikang Qiu Jihe Wang School of Computer Science Northwestern Polytechnical University and National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'an China School of Electronic Engineering Xi'an University of Posts and Telecommunication Xi'an China School of Computer Science Northwestern Polytechnical University and Engineering Research Center of Embedded System Integration Ministry of Education Xi'an China Texas A&M University-Commerce Texas USA

We propose a hardware/software co-design framework, which leverages hardware-aware quantization and a reconfigurable processor to improve the computational efficiency of convolutional neural networks (CNNs) on tiny IoT devices based on reconfigurable platforms. Firstly, we proposed a multi-objective optimization value function that can weigh accuracy, the size of CNN models, and computational delay, to improve the efficiency of the mixed- precision quantization algorithm based on deep reinforcement learning. Secondly, we propose a reconfigurable CNN processor that can adapt to the computing characteristics of various quantized CNN models, as well as a reconfigurable computing array and an on-chip elastic buffer, to improve the performance and computing efficiency on edge equipment. Finally, we demonstrate the effectiveness of the proposed co-design method through an extensive evaluation of the Ultra96-V2 platform. With respect to the well-known CNNs—VGG-16, ResNet-50, and MobileNet-V2, the experimental result shows that the throughput of 216.6 GOPS, 214.0 GOPS, and 53.6 GOPS, the computing efficiency of 0.63GOPS/DSP, 0.64GOPS/DSP, and 0.24 GOPS/DSP, respectively. In addition, achieving a better optimized trade-off between the computing efficiency and accuracy compared with the recently proposed CNN processor with fixed bit-width and mixed-precision.

关键词： Adaptation models Quantization (signal) Computational modeling Reinforcement learning Throughput system-on-chip Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

A Scale Adaptive Kernel Correlation Filter-Based Tracker with Optimized Update Strategy

A Scale Adaptive Kernel Correlation Filter-Based Tracker wit...

引用

第三十九届中国控制会议

作者： Minghui Shi Yong Heng Liang Han Qingdong Li Zhang Ren School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control Laboratory Beihang University Beijing Institute of Electronic System Engineering School of Sino-French Engineer Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Correlation filter-based trackers have achieved competitive results in the field of visual tracking, but the abilities to deal with the multi-scale and keep the tracking stability still need to be improved. In this article, the complex background tracking problems are studied based on the kernel correlation filter. In order to address the fixed size limitation, we present an improved scheme, which can not only realize scale adaption, but also retain the advantages of the original algorithm. In addition, the adaptive update learning rate of the model is achieved by using the peak sidelobe ratio as an indicator to measure the filter performance. Using the index, we can selectively reduce the model interference to low precision information. Moreover, we design a redetection mechanism that runs automatically when the tracking evaluation indicator is low. Compared with the radical model update methods, those conservative update strategies can effectively decrease the model pollution and ensure the tracking effect. Extensive verifications based on OTB-100 benchmark show that the optimized algorithm improves the accuracy, robustness, and generalization ability of target tracking.

关键词： Target tracking Kernel correlation filter Scale adaption Peak sidelobe ratio Learning rate adaption

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：