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

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Haozhao Wang Wenchao Xu Yunfeng Fan Ruixuan Li Pan Zhou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

VulCNN: An Image-inspired Scalable Vulnerability Detection system

VulCNN: An Image-inspired Scalable Vulnerability Detection S...

引用

International Conference on Software engineering (ICSE)

作者： Yueming Wu Deqing Zou Shihan Dou Wei Yang Duo Xu Hai Jin Huazhong University of Science and Technology China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering HUST Wuhan China Services Computing Technology and System Lab National Engineering Research Center for Big Data Technology and System HUST Wuhan China Fudan University China University of Texas at Dallas United States Cluster and Grid Computing Lab School of Computer Science and Technology HUST Wuhan China

ISBN: (纸本)9781665495899

Since deep learning (DL) can automatically learn features from source code, it has been widely used to detect source code vulnerability. To achieve scalable vulnerability scanning, some prior studies intend to process the source code directly by treating them as text. To achieve accurate vulnerability detection, other approaches consider distilling the program semantics into graph representations and using them to detect vulnerability. In practice, text-based techniques are scalable but not accurate due to the lack of program semantics. Graph-based methods are accurate but not scalable since graph analysis is typically time-consuming. In this paper, we aim to achieve both scalability and accuracy on scanning large-scale source code vulnerabilities. Inspired by existing DL-based image classification which has the ability to analyze millions of images accurately, we prefer to use these techniques to accomplish our purpose. Specifically, we propose a novel idea that can efficiently convert the source code of a function into an image while preserving the program details. We implement Vul-CNN and evaluate it on a dataset of 13,687 vulnerable functions and 26,970 non-vulnerable functions. Experimental results report that VulCNN can achieve better accuracy than eight state-of-the-art vul-nerability detectors (i.e., Checkmarx, FlawFinder, RATS, TokenCNN, VulDeePecker, SySeVR, VulDeeLocator, and Devign). As for scalability, VulCNN is about four times faster than VulDeePecker and SySeVR, about 15 times faster than VulDeeLocator, and about six times faster than Devign. Furthermore, we conduct a case study on more than 25 million lines of code and the result indicates that VulCNN can detect large-scale vulnerability. Through the scanning reports, we finally discover 73 vulnerabilities that are not reported in NVD.

关键词： Deep learning Codes Scalability Semantics Detectors Transforms Rats

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Memory Architecture Supporting Fine-Grained data Migration

SSRN

引用

SSRN 2022年

作者： Chi, Ye Yue, Jianhui Liao, Xiaofei Liu, Haikun Jin, Hai 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 Science Michigan Technological University HoughtonMI United States

We propose Mocha, a non-hierarchical caching architecture that organizes DRAM and NVM in a flat address space physically, but manages DRAM/NVM in a cache/memory hierarchy in this paper. Since the commercial NVM device-Intel Optane DC Persist Memory Modules (DCPMM) actually access the physical media at a granularity of 256 bytes (an Optane block), we manage the DRAM cache at the 256-byte size to adapt to this device feature of Optane. This design not only enables fine-grained data migration and management for the DRAM cache, but also avoids write amplification for Optane DCPMM. We also create a the \textit{ Indirect Address Cache} (IAC) in \textit{Hybrid Memory Controller}(HMC) and propose a reverse address mapping table in the DRAM to speed up address translation and cache replacement. Besides, we exploit an utility-based caching mechanism to filter cold blocks in the NVM, and further improve DRAM cache effectiveness. We implement Mocha in an architecture simulator. Experimental results indicate that MOCHA can improve performance of applications by 8.2\% on average (up to 24.6\%), provide 6.9\% reduction in average energy consumption and 25.9\% reduction in average data migration traffic, compared to the most advanced hybrid memory architecture-HSCC. © 2022, The Authors. All rights reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Unique in the Metro system: The Likelihood to Re-Identify a Metro User with Limited Trajectory Points

SSRN

引用

SSRN 2023年

作者： Yang, Hongtai Ping, An Wei, Hongmin Zhai, Guocong School of Transportation and Logistics Institute of System Science and Engineering National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Southwest Jiaotong University Chengdu611756 China Guangdong–Hong Kong-Macau Joint Laboratory for Smart Cities Shenzhen518060 China School of Transportation and Logistics National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Southwest Jiaotong University Chengdu611756 China Department of Civil & Environmental Engineering Old Dominion University 129C Kaufman Hall NorfolkVA23529 United States

Though the collection of metro smart card data could help improve the operations of the metro system, the release of such data might lead to privacy issues. Few studies have quantified the probability to re-identify a user from the smart card data using very limited trajectory points. Thus, this study investigates this topic by analyzing eight-day metro smart card data of Chengdu, China. Results reveal that, on the macro level, three random trajectory points with a temporal resolution of one minute and one hour are enough to identify over 90% and 67% of the users. Even when the resolution is reduced to one day, 20% of the users could be still be identified by three points. On the individual level, three carefully selected points with a temporal resolution of one minute, one hour, and one day could lead to a re-identification risk no less than 0.5 for 99%, 89%, and 52% of the users. The effects of number of points, number of users, and other temporal resolutions are also thoroughly evaluated. These findings emphasize the great privacy issues involved in the release of metro smart card data and remind metro operators to take proactive measures to enhance privacy protection. © 2023, The Authors. All rights reserved.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

Optimal margin distribution machine for multi-instance learning 29

Optimal margin distribution machine for multi-instance learn...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Teng Jin, Hai 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

ISBN: (纸本)9780999241165

Multi-instance learning (MIL) is a celebrated learning framework where each example is represented as a bag of instances. An example is negative if it has no positive instances, and vice versa if at least one positive instance is contained. During the past decades, various MIL algorithms have been proposed, among which the large margin based methods is a very popular class. Recently, the studies on margin theory disclose that the margin distribution is of more importance to generalization ability than the minimal margin. Inspired by this observation, we propose the multi-instance optimal margin distribution machine, which can identify the key instances via explicitly optimizing the margin distribution. We also extend a stochastic accelerated mirror prox method to solve the formulated minimax problem. Extensive experiments show the superiority of the proposed method. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Multi-Population Genetic Algorithm for Multi-UAV Task Assignment in Consumer Electronics Applications

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Bai, Xiaoshan Jiang, Haoyu Li, Chao Ullah, Inam Dabel, Maryam M. Al Bashir, Ali Kashif Wu, Zongze Sam, Shuzhi Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Shenzhen University Shenzhen City Joint Laboratory of Autonomous Unmanned Systems and Intelligent Manipulation Shenzhen518060 China Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan University of Hafr Al Batin Department of Computer Science and Engineering College of Computer Science and Engineering Saudi Arabia Manchester Metropolitan University Manchester United Kingdom Shenzhen518060 China National University of Singapore Department of Electrical and Computer Engineering Singapore117576 Singapore

In recent years, as people’s living standards have improved and consumption concepts have been transformed, the demand for purchasing consumer electronics online has continued to grow, further stimulating the development of the logistics industry. Consequently, how to deliver consumer electronics to households at minimal cost has become a crucial factor that limits the development of the consumer technology industry. To tackle this problem, this paper studies the task assignment problem for multiple initially dispersed UAVs to deliver products to target locations while minimizing their total operation time. Each UAV can continuously provide delivery services to multiple target locations within its limited loading capacity and operation time. To solve this problem, we propose several hybrid multipopulation genetic algorithms. First, a novel crossover operator for the genetic algorithms is designed, through which a single parent chromosome can generate offspring individually. Second, two mutation mechanisms are performed to increase gene diversity. Third, multiple local search strategies are employed to enhance the populations’ fitness during each iteration of evolution. An improved 2-opt local search strategy is applied to optimize individual chromosomes when their similarity with the current best chromosome falls below a prescribed threshold. Alternatively, local search strategies are utilized for 1-opt, 2h-opt and interchange processes. Combining local search strategies, genetic operators, and the multi-population mechanism leads to several hybrid multi-population genetic algorithms. Numerical simulations and experimental tests demonstrate that the hybrid multi-population genetic algorithm, integrated with the improved 2-opt and 1-opt local search strategies, exhibits superior performance among the designed hybrid genetic algorithms, the minimum marginal cost algorithm (MMA), and the existing popular Co-evolutionary Multi-population Genetic Algorithm (CMGA). In exp

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

FaceBench: A Multi-View Multi-Level Facial Attribute VQA dataset for Benchmarking Face Perception MLLMs

arXiv

引用

arXiv 2025年

作者： Wang, Xiaoqin Ma, Xusen Hou, Xianxu Ding, Meidan Li, Yudong Chen, Junliang Chen, Wenting Peng, Xiaoyang Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China AIAC Xi’an Jiaotong-Liverpool University China Tsinghua University China The Hong Kong Polytechnic University Hong Kong City University of Hong Kong Hong Kong Sun Yat-sen University China

Multimodal large language models (MLLMs) have demonstrated remarkable capabilities in various tasks. However, effectively evaluating these MLLMs on face perception remains largely unexplored. To address this gap, we introduce FaceBench, a dataset featuring hierarchical multi-view and multi-level attributes specifically designed to assess the comprehensive face perception abilities of MLLMs. Initially, we construct a hierarchical facial attribute structure, which encompasses five views with up to three levels of attributes, totaling over 210 attributes and 700 attribute values. Based on the structure, the proposed FaceBench consists of 49,919 visual question-answering (VQA) pairs for evaluation and 23,841 pairs for fine-tuning. Moreover, we further develop a robust face perception MLLM baseline, Face-LLaVA, by training with our proposed face VQA data. Extensive experiments on various mainstream MLLMs and Face-LLaVA are conducted to test their face perception ability, with results also compared against human performance. The results reveal that, the existing MLLMs are far from satisfactory in understanding the fine-grained facial attributes, while our Face-LLaVA significantly outperforms existing open-source models with a small amount of training data and is comparable to commercial ones like GPT-4o and Gemini. The dataset will be released at https://***/CVI-SZU/FaceBench. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2024年

作者： Wang, Yuhe Wang, Yating National & Local Joint Engineering Laboratory for Big Data Analysis and Computing Technology Beijing100190 China Institute for Scientific Computation Texas A&M University College StationTX77843 United States School of Mathematics and Statistics Xi’an Jiaotong University Shaanxi Xi’an710049 China

Fluid flow through bimodal porous media, characterized by a distinct separation in pore size distribution, is critical in various scientific and engineering applications, including groundwater management, oil and gas production, and carbon sequestration. This note delves into the physical similarity of fluid flow within such media, bridging the gap between microscale phenomena and macroscale observations. We present a representative mathematical model that conceptualizes bimodal porous media as a double-continuum system, distinguishing between macroporous and microporous regions. The model captures the complex interactions between these regions, particularly focusing on the challenges of modeling fluid flow when there is significant disparity in pore sizes. By employing a heuristic approach grounded in pore-scale tomography, we derive governing equations that describe fluid flow and analyze the solution characteristics. The results reveal unique features of the fluid flow in bimodal systems, such as the occurrence of boundary discontinuities and the delayed transient response, which are not observed in conventional porous media. This work provides ground for further studies in bimodal porous media, offering insights that could enhance predictive modeling and optimization in various applications concerning porous media with similar bimodal pore size distributions. © 2024, CC BY.

关键词： Transient analysis

来源：评论

学校读者我要写书评

暂无评论

Two-Stage OD Flow Prediction for Emergency in Urban Rail Transit

引用

IEEE Transactions on Intelligent Transportation systems 2024年第1期25卷 920-928页

作者： Zhu, Guangyu Ding, Jiacun Wei, Yun Yi, Yang Xu, Sendren Sheng-Dong Wu, Edmond Q. Beijing Jiaotong University Key Lab. of Transport Industry of Big Data Application Technologies for Comprehensive Transport The Beijing Research Center of Urban Traffic Information Sensing and Service Technologies Beijing100044 China Beijing Mass Transit Railway Operation Corporation Ltd. Beijing100014 China Yangzhou University College of Information Engineering Yangzhou225127 China National Taiwan University of Science and Technology Automation and Control Center The Graduate Institute of Automation and Control Taipei106335 Taiwan Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China The Shanghai Engineering Research Center of Intelligent Control and Management Department of Automation Shanghai200240 China

Urban rail transit (URT) is vulnerable to natural disasters and social emergencies including fire, storm and epidemic (such as COVID-19), and real-time origin-destination (OD) flow prediction provides URT operators with important information to ensure the safety of URT system. However, hindered by the high dimensionality of OD flow and the lack of supportive information reflecting the real-time passenger flow changes, study in this area is at the beginning stage. A novel model consisting of two stages is proposed for OD flow prediction. The first stage predicts the inflows of all stations by Long Short-Term Memory (LSTM) in real time, where the dimension is reduced compared with predicting OD flows directly. In the second stage, the notion of separation rate, namely, the proportion of inbound passengers bounding for another station, is estimated. Finally, The OD flow is predicted by multiplying the inflow and separation rate. Experiments based on Hangzhou Metro dataset show the proposed model outperforms the contrast model in weighted mean average error (WMAE) and weighted mean square error (WMSE). Results also suggest that the proposed prediction model performs better on weekdays than on weekends, and with greater accuracy on larger OD flows. © 2000-2011 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Fil-Cad: A Fault Detection Method for Iiot Based on Federated Incremental Learning with Class Accuracy Distillation

SSRN

引用

SSRN 2024年

作者： Liu, Yanhua Fang, Wenyu Huang, Wei Wang, Xiaofeng Zhao, Baokang Liu, Ximeng College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Fault detection is a research topic attracting much attention in IIoT. However, the continuous accumulation and growth of IIoT data leads to the catastrophic forgetting problem in the fault detection model and data heterogeneity, which creates a bottleneck for the performance and generalization of federated learning in fault detection. To improve the fault detection performance of federated learning models in data incremental scenarios, we propose a federatedincremental-learning-based fault detection method for IIoT, namely FIL-CAD. Firstly, comparing the knowledge distillation, the accuracies of different data classes in the global and local models are chosen as the model lightweight learning features, and the loss function is weighted. Secondly, we introduce the concept of data learning depth. It computes different model weights in the aggregation based on their degrees of data sample learning and model training participation and obtains the global model through weighted aggregation. Additionally, FIL-CAD supports the combination of differential privacy to protect data privacy. The proposed method is compared with four benchmark methods on four datasets, which include CWRU and MFPT bearing datasets. Then, the experimental results show that FIL-CAD performs optimally in accuracy and F1-Score, and the average accuracy is improved by 1.32%-18.52%, demonstrating the superiority of FIL-CAD. © 2024, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：