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

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and big data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Wei, Xinlei Tan, Yujuan Liu, Duo Wu, Daitao Wu, Yu Chen, Xianzhang Li, Jian College of Computer Science Chongqing University Chongqing China School of Big Data and Software Engineering Chongqing University Chongqing China School of Electrical Engineering Chongqing University Chongqing China

ISBN: (纸本)9798350319934

Node failure is one of the most typical issues in distributed storage systems. The classic fault-tolerance methods can meet the fault tolerance needs of systems deployed in edge storage, 5G IoT, and other high-performance data centers. However, mobile distributed systems contend with inconsistent network signals and relatively low bandwidth in weak network environments. The traditional fault-tolerance schemes have difficulty ensuring distributed storage and data repair simultaneously, posing a considerable challenge to data storage reliability. To address this problem, we proposed a hybrid fault-tolerance scheme based on potential replicas, called HFPR, which trades off storage overhead and performance for weak network mobile distributed storage systems. HFPR first stores data with the erasure code redundancy and then gradually increases data redundancy by reserving potential replicas, enabling the system to disperse network transmission pressure and reduce network transmission. To maximize replica utilization and control the storage overhead of potential replicas, we design a node state prediction mechanism and a file lifecycle management mechanism. Evaluation results show that, compared with the traditional hybrid fault-tolerant scheme with the same storage overhead, HFPR achieves better replica-level repair efficiency in data repair and a reduced probability of degraded reads by approximately 50%. During data distribution, HFPR can minimize data write amplification by up to 1.1× and additional network transfers by up to 77.5%. © 2022 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

3DS: An Efficient DPDK-based data Distribution Service for Distributed Real-time Applications 24

3DS: An Efficient DPDK-based Data Distribution Service for D...

引用

作者： Xu, Tianyu Chen, Xianzhang Wu, Changze Wang, Jiapin Zheng, Rongwei Liu, Duo Tan, Yujuan Ren, Ao Li, Jian College of Computer Science Chongqing University Chongqing China School of Big Data and Software Engineering Chongqing University Chongqing China School of Electrical Engineering Chongqing University Chongqing China

ISBN: (纸本)9798350319934

data Distribution Service (DDS) is a widely-used middleware for data transmission in distributed real-time applications, such as autonomous vehicles and robotics. However, the communication of existing DDS middlewares generally relies on the network stacks of the operating system, which brings long latency to the real-time applications. In this paper, we propose a DPDK-based DDS, dubbed 3DS, to improve the performance of communication of DDS middlewares. First, 3DS reduces the latency of communication between distributed real-time applications by avoiding the latency of kernel. Second, 3DS reduces the overhead of dynamic memory allocation and deallocation by a reserved memory pool. Finally, 3DS adopts a thread-exclusive CPU model to reduce the resource contention between threads. We implement and evaluate 3DS on real systems running Linux. The experimental results show that 3DS reduces 44% of the communication latency over FastDDS, which is the state-of-the-art DDS middleware used by ROS2. Moreover, the throughput of data transfer in 3DS can be 1.51 times that of FastDDS. © 2022 IEEE.

关键词： data transfer

来源：评论

学校读者我要写书评

暂无评论

Mask guided diverse face image synthesis

引用

Frontiers of Computer Science 2022年第3期16卷 67-75页

作者： Song SUN Bo ZHAO Muhammad MATEEN Xin CHEN Junhao WEN School of Big Data&Software Engineering Chongqing UniversityChongqing 401331China Department of Computer Science The University of British ColumbiaVancouve BC V6T 1Z4Canada Department of Computer Science Air University Multan CampusMultan 60000Pakistan

Recent studies have shown remarkable success in face image generation ***,existing approaches have limited diversity,quality and controllability in generating *** address these issues,we propose a novel end-to-end learning framework to generate diverse,realistic and controllable face images guided by face *** face mask provides a good geometric constraint for a face by specifying the size and location of different components of the face,such as eyes,nose and *** framework consists of four components:style encoder,style decoder,generator and *** style encoder generates a style code which represents the style of the result face;the generator translate the input face mask into a real face based on the style code;the style decoder learns to reconstruct the style code from the generated face image;and the discriminator classifies an input face image as real or *** the style code,the proposed model can generate different face images matching the input face mask,and by manipulating the face mask,we can finely control the generated face *** empirically demonstrate the effectiveness of our approach on mask guided face image synthesis task.

关键词： face image generation image translation generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Deep Learning Approach for Nonfunctional software Requirements Classifications 3

Hybrid Deep Learning Approach for Nonfunctional Software Req...

引用

3rd International Conference on Communication, Computing and Digital Systems, C-CODE 2023

作者： Rahman, Kiramat Ghani, Anwar Ahmad, Rashid Sajjad, Syed Haseeb International Islamic University Dept. of Software Engineering Islamabad Pakistan Big Data Research Center Jeju National University Jeju Korea Republic of Inernational Islamic University Dept. of Computer Science Islamabad Pakistan

ISBN: (纸本)9798350332391

This paper explores the concept of algorithmic hybridization, which involves combining various machine learning (ML) algorithms to enhance performance by utilizing the benefits of both simultaneously. This study presents a framework that utilizes a combination of long short-term memory (LSTM) and bidirectional LSTM (BiLSTM) with artificial neural networks (ANN) to classify non-functional requirements (NFR). The task of NFR classification is challenging due to the scarcity of supervised learning data. The effectiveness of the proposed approach was assessed by comparing the performance of our integrated model with that of single LSTM and BiLSTM models. To conduct this evaluation, we combined two datasets consisting of 1000 non-functional requirements (NFR). The experimental findings revealed that the proposed approach is effective as the hybrid models exhibited better precision, recall, and F-1 score compared to its counterparts. © 2023 IEEE.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

Unsigned Road Incidents Detection Using Improved RESNET From Driver-View Images

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1203-1216页

作者： Li, Changping Wang, Bingshu Zheng, Jiangbin Zhang, Yongjun Chen, C.L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Frequent road incidents cause significant physical harm and economic losses globally. The key to ensuring road safety lies in accurately perceiving surrounding road incidents. However, the highly dynamic nature of traffic introduces significant challenges, particularly in detecting sudden and temporary incidents. In this article, we propose a novel detection framework, multihead attention ResNet with dynamic bottleneck (DB_RESNET_MHA), to identify physical unsigned road incidents. Our approach introduces three key innovations. First, we develop a tailored data augmentation strategy to create images that closely mimic the complex variations found in real-world road environments. Second, we enhance model expressiveness by employing attention mechanisms to nonlinearly integrate convolutional kernels within the residual network. Furthermore, we refine the prediction head by applying spatially distinct attention weights, enabling the model to capture intricate correlations between different features more effectively. To demonstrate the effectiveness of our method, we create a dataset for unsigned road incidents (UnsignRI), comprising a total of 16 323 images that capture 12 distinct types of incidents. It stands out as the most comprehensive dataset in the field, encompassing a wide range of geographical features and incident categories. Experimental results show that DB_RESNET_MHA achieves an average accuracy of 96.2% and a f1-score of 0.955 across various categories of unsigned incidents, surpassing other models. © 2020 IEEE.

关键词： Highway accidents

来源：评论

学校读者我要写书评

暂无评论

Video2Reward: Generating Reward Function from Videos for Legged Robot Behavior Learning 27

Video2Reward: Generating Reward Function from Videos for Leg...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zeng, Runhao Zhou, Dingjie Liang, Qiwei Liu, Junlin Li, Hui Huang, Changxin Li, Jianqiang Hu, Xiping Sun, Fuchun Artificial Intelligence Research Institute Shenzhen MSU-BIT University China College of Mechatronics and Control Engineering Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781643685489

Learning behavior in legged robots presents a significant challenge due to its inherent instability and complex constraints. Recent research has proposed the use of a large language model (LLM) to generate reward functions in reinforcement learning, thereby replacing the need for manually designed rewards by experts. However, this approach, which relies on textual descriptions to define learning objectives, fails to achieve controllable and precise behavior learning with clear directionality. In this paper, we introduce a new video2reward method, which directly generates reward functions from videos depicting the behaviors to be mimicked and learned. Specifically, we first process videos containing the target behaviors, converting the motion information of individuals in the videos into keypoint trajectories represented as coordinates through a video2text transforming module. These trajectories are then fed into an LLM to generate the reward function, which in turn is used to train the policy. To enhance the quality of the reward function, we develop a video-assisted iterative reward refinement scheme that visually assesses the learned behaviors and provides textual feedback to the LLM. This feedback guides the LLM to continually refine the reward function, ultimately facilitating more efficient behavior learning. Experimental results on tasks involving bipedal and quadrupedal robot motion control demonstrate that our method surpasses the performance of state-of-the-art LLM-based reward generation methods by over 37.6% in terms of human normalized score. More importantly, by switching video inputs, we find our method can rapidly learn diverse motion behaviors such as walking and running. © 2024 The Authors.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Tree Regularization for Visual Explanations of Cancer Cell Classification

Tree Regularization for Visual Explanations of Cancer Cell C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Muhammad Umair Raza Jie Chen Li Wang Adil Nawaz Victor C.M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The challenge of interpretability remains a significant barrier to adopting deep neural networks in healthcare domains. Although tree regularization aims to align a deep neural network’s decisions with a single axis-aligned decision tree, however, relying on one tree for all inputs often leads to sub-optimal performance and interoperability. To address this limitation, we propose an enhanced tree regularization method that integrates a post-hoc visual explainable model such as Grad-CAM. This approach guides the deep model to be well-approximated by decision trees tailored to the salient regions identified by Grad-CAM in the input space. We rigorously validate the effectiveness of this framework on two cancer cell datasets: CNMC, which focuses on acute lymphoblastic leukemia cells, and ISBI2016, which comprises benign and malignant skin lesions. The results demonstrate that the proposed method delivers simpler and more interpretable explanations without compromising accuracy, thereby advancing the interpretability of deep learning models in critical healthcare applications.

关键词： Visualization Accuracy Decision making Artificial neural networks Predictive models Skin Decision trees Lesions Biological cells Cancer

来源：评论

学校读者我要写书评

暂无评论

Structure Balance and Gradient Matching-Based Signed Graph Condensation 39

Structure Balance and Gradient Matching-Based Signed Graph C...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Rong Xu, Long Liu, Songbai Ji, Junkai Li, Lingjie Lin, Qiuzhen Ma, Lijia College of Computer Science and Software Engineering Shenzhen University Shenzhen China College of Big Data and Internet Shenzhen Technology University Shenzhen China

ISBN: (纸本)157735897X

Training graph neural networks (GNNs) for graph representation has received increasing concerns due to its outstanding performance in the link prediction and node classification tasks, but it incurs much time and storage for tackling large-scale graphs. To alleviate this issue, graph condensation has been emerged to condense the large graph into a small but highly-informative graph, while achieving comparable performance of GNNs trained on the small graph and large graph. However, existing works mainly focus on the gradient or distribution matching under GNN training trajectories to condense simple link structures, while overlooking the structure matching for condensing signed graph that exists conflict links and structural balance among nodes. To bridge this gap, we propose a novel Structure Balance and Gradient Matching-Based Signed Graph Condensation (SGSGC) method for condensing signed graph with node attributes, conflict links and structural balance into informative smaller ones. Specifically, we first propose a structure-balanced matching to match the structural balance between the original and condensed signed graph, and then combine it with the gradient matching to condense signed graph for the link sign prediction task, while preserving both conflicting link structures and node attributes. Moreover, we use the feature smoothing and the graph sparsification technique to improve the robustness for the GNN training, respectively. Finally, a bi-level optimization technique is proposed to simultaneously find the optimal node attributes and conflict structure of the condensed graph. Experiments on six datasets demonstrate that SGSGC achieves excellent performance. On Epinions, 94% test accuracy of training on the original signed graph, while reducing their graph size by 99.95% - 99.99%, and there exist 2.24% - 6.26% accuracy improvements for link sign prediction compared to the state-of-the-arts. Copyright © 2025, Association for the Advancement of Artificial Int

关键词： Network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

Evaluating the usage of fault localization in automated program repair:an empirical study

引用

Frontiers of Computer Science 2021年第1期15卷 53-67页

作者： Deheng YANG Yuhua QI Xiaoguang MAO Yan LEI College of Computer National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems Changsha 410073China Beijing Institute of Tracking and Communication Technology Beijing 100094China School of Big Data&Software Engineering Chongqing UniversityChongqing 400044China

Fault localization techniques are originally proposed to assist in manual debugging by generally producing a rank list of suspicious *** the increasing popularity of automated program repair,the fault localization techniques have been introduced to effectively reduce the search space of automated program *** developers who mainly focus on the rank information,current automated program repair has two strategies to use the fault localization information:suspiciousness-first algorithm(SFA)based on the suspiciousness accuracy and rank-first algorithm(RFA)relying on the rank ***,despite the fact that the two different usages are widely adopted by current automated program repair and may result in different repair results,little is known about the impacts of the two strategies on automated program *** this paper we empirically compare the performance of SFA and RFA in the context of automated program ***,we implement the two strategies and six well-studied fault localization techniques into four state-of-the-art automated program repair tools,and then use these tools to perform repair experiments on 60 real-world bugs from *** study presents a number of interesting findings:RFA outperforms SFA in 70.02%of cases when measured by the number of candidate patches generated before a valid patch is found(NCP),while SFA performs better in parallel repair and patch diversity;the performance of SFA can be improved by increasing the suspiciousness accuracy of fault localization techniques;finally,we use SimFix that deploys SFA to successfully repair four extra Defects4J bugs which cannot be repaired by SimFix originally using *** observations provide a new perspective for future research on the usage and improvement of fault localization in automated program repair.

关键词： automated program repair fault localization empirical study

来源：评论

学校读者我要写书评

暂无评论

Edge Learning-Based Efficient data Imputation of Water Quality 7th

Edge Learning-Based Efficient Data Imputation of Water Quali...

引用

7th International Conference on Computing, Control and Industrial engineering, CCIE 2023

作者： Wang, Yongsheng Chen, Zhen Liu, Limin Gao, Jing Liu, Guangwen Xu, Zhiwei School of Data Science and Application Inner Mongolia University of Technology Hohhot010080 China Inner Mongolia Autonomous Region Engineering Technology Research Center of Big Data Based Software Service Hohhot010080 China Institute of Computing Technology Chinese Academy of Sciences Beijing100000 China

ISBN: (纸本)9789819927296

Water quality monitoring is critical for developing effective surface water management strategies, whereas data preprocessing is the foundation for monitoring water quality. Water quality monitoring usually suffers from abnormal and missing values in the collected data of surface water quality, and thus an efficient data imputation method for water quality data is highly desired. To handle these challenges, we propose an edge learning-based data imputation method. By using VAE as the generator of WGAN-LP, the performance of value imputation of water quality is generalized and improved. In addition, we demonstrate the performance of the proposed method on two real-world datasets, collected from Wuliangsu Lake and Taihu Lake in Inner Mongolia. Compared with state of the art, the enhanced imputation accuarcy of water quality is achieved. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Water quality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：