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

5th World Symposium on software engineering, WSSE 2023

作者： Tete, Akpedje Touré, Fadel Badri, Mourad Software Engineering Research laboratory Department of Mathematics and Computer Science University of Quebec Trois-RivièresQC Canada

ISBN: (纸本)9798400708053

This paper aims at studying the ability of deep machine learning to predict software faults based on object-oriented metrics. This research investigated software faults from the perspective of fault-proneness, faults number and faults frequency, and used data collected from several versions of a Java open-source software system. This study relied on Chidamber and Kemerer suite of metrics as proxy to capture various software characteristics. In this study, the deep learning regression and classification results were compared to linear and logistic regressions. Auto-Encoders (AE) and Principal Components Analysis (PCA) have been used to reduce redundant information from the dataset. To evaluate the prediction ability of the models, this research used the inter-version validation strategy. The results showed that the models can achieve a significant average performance up to 89%. © 2023 Copyright held by the owner/author(s).

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Interference Suppression and Jitter Elimination Ability-Based Adaption Tracking Guidance for Robotic Fishes

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 126-137页

作者： Dongfang Li Jie Huang Rob Law Xin Xu Limin Zhu Edmond Q.Wu IEEE the School of Electrical Engineering and Automation Fuzhou University the Key Laboratory of System Control and Information Processing Ministry of Education the School of Electrical Engineering and Automation Fuzhou University 5G+Industrial Internet Institute Fuzhou University the University of Macau the College of Mechatronics and Automation National University of Defense Technology the School of Mechanical Engineering Shanghai Jiao Tong University the Department of Computer Science and Engineering Shanghai Jiao Tong University

This work presents an adaptive tracking guidance method for robotic fishes. The scheme enables robots to suppress external interference and eliminate motion jitter. An adaptive integral surge line-of-sight guidance rule is designed to eliminate dynamics interference and sideslip issues. Limited-time yaw and surge speed observers are reported to fit disturbance variables in the model. The approximation values can compensate for the system's control input and improve the robots' tracking ***, this work develops a terminal sliding mode controller and third-order differential processor to determine the rotational torque and reduce the robots' run jitter. Then, Lyapunov's theory proves the uniform ultimate boundedness of the proposed method. Simulation and physical experiments confirm that the technology improves the tracking error convergence speed and stability of robotic fishes.

关键词： Adaptive integral surge line-of-sight approximation robotic fish speed observer

来源：评论

学校读者我要写书评

暂无评论

Behaviour-diverse automatic penetration testing:a coverage-based deep reinforcement learning approach

引用

Frontiers of computer Science 2025年第3期19卷 15-24页

作者： Yizhou YANG Longde CHEN Sha LIU Lanning WANG Haohuan FU Xin LIU Zuoning CHEN Zhongguancun Laboratory Beijing 100081China Zhejiang Lab Hangzhou 311121China National Research Centre of Parallel Computer Engineering and Technology Wuxi 214000China Faculty of Geographical Science Beijing Normal UniversityBeijing 100875China Department of Earth System Science Tsinghua UniversityBeijing 100084China

Reinforcement Learning(RL)is gaining importance in automating penetration testing as it reduces human effort and increases ***,given the rapidly expanding scale of modern network infrastructure,the limited testing scale and monotonous strategies of existing RLbased automated penetration testing methods make them less effective in practical *** this paper,we present CLAP(Coverage-Based Reinforcement Learning to Automate Penetration Testing),an RL penetration testing agent that provides comprehensive network security assessments with diverse adversary testing behaviours on a massive *** employs a novel neural network,namely the coverage mechanism,to address the enormous and growing action spaces in large *** also utilizes a Chebyshev decomposition critic to identify various adversary strategies and strike a balance between *** results across various scenarios demonstrate that CLAP outperforms state-of-the-art methods,by further reducing attack operations by nearly 35%.CLAP also provides enhanced training efficiency and stability and can effectively perform pen-testing over large-scale networks with up to 500 ***,the proposed agent is also able to discover pareto-dominant strategies that are both diverse and effective in achieving multiple objectives.

关键词： network security penetration testing reinforcement learning artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

An Improved Method for Approximating the Infinite-Horizon Value Function of the Discrete-Time Switched LQR Problem

引用

Journal of systems Science & Complexity 2024年第1期37卷 22-39页

作者： HOU Tan LI Yuanlong LIN Zongli Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of System Control and Information Processing Ministry of Education of ChinaShanghai 200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China Charles L.Brown Department of Electrical and Computer Engineering University of VirginiaCharlottesvilleVA 22904-4743USA

This paper considers the problem of approximating the infinite-horizon value function of the discrete-time switched LQR *** particular,the authors propose a new value iteration method to generate a sequence of monotonically decreasing functions that converges exponentially to the value *** method facilitates us to use coarse approximations resulting from faster but less accurate algorithms for further value iteration,and thus,the proposed approach is capable of achieving a better approximation for a given computation time compared with the existing *** numerical examples are presented in this paper to illustrate the effectiveness of the proposed method.

关键词： Optimal control switched linear systems switched LQR problem.

来源：评论

学校读者我要写书评

暂无评论

Community Smell Occurrence Prediction on Multi-Granularity by Developer-Oriented Features and Process Metrics

引用

Journal of computer Science & Technology 2022年第1期37卷 182-206页

作者： Zi-Jie Huang Zhi-Qing Shao Gui-Sheng Fan Hui-Qun Yu Xing-Guang Yang Kang Yang Department of Computer Science and Engineering East China University of Science and TechnologyShanghai 200237China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai 200237China Shanghai Engineering Research Center of Smart Energy Shanghai 200237China

Community smells are sub-optimal developer community structures that hinder *** studies performed smell prediction and provided refactoring guidelines from a top-down aspect to help community ***,refactoring smells also requires bottom-up effort from every ***,supportive measures and guidelines for them are not available at a fine-grained *** recent work revealed developers'personalities and working states could influence community smells'emergence and variation,we build prediction models with experience,sentiment,and development process features of developers considering three smells including Organizational Silo,Lone Wolf,and Bottleneck,as well as two related classes including smelly developer and smelly *** predict the five classes in the individual granularity,and we also generate forecasts for the number of smelly developers in the community *** proposed models achieve F-measures ranging from 0.73 to 0.92 in individual-wide within-project,time-wise,and cross-project prediction,and mean R2 performance of 0.68 in community-wide Smelly Developer *** also exploit SHAP(SHapley Additive exPlanations)to assess feature importance to explain our *** conclusion,we suggest developers with heavy workload should foster more frequent communication in a straightforward and polite way to build healthier communities,and we recommend community shepherds to use the forecasting model for refactoring planning.

关键词： community smell developer sentiment socio-technical analysis empirical software engineering

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Pseudo-Labeling for Unsupervised Meta-Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5475-5488页

作者： Ouyang, Tianran Dong, Xingping Ye, Mang Du, Bo Shao, Ling Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China University of Chinese Academy of Sciences UCAS-Terminus AI Lab Beijing101408 China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science 314100 China

In unsupervised meta-learning, the clustering-based pseudo-labeling approach is an attractive framework, since it is model-agnostic, allowing it to synergize with supervised algorithms to learn from unlabeled data. However, the pseudo-labels suffer from clustering noise and semantic chaos problems, further impacting the effectiveness of meta-learning. In this paper, we analyze and optimize the pseudo-labeling process, including encoding and clustering, aiming to generate semantic-like pseudo-labels to narrow the gap between unsupervised and supervised meta-learning. First, during the encoding, we observe that the embedding space of existing methods lacks clustering-friendly properties, which is the primary reason for clustering noise. To address this issue, we minimize the inter-to-intra-class similarity ratio to generate clustering-friendly embedding features and validate our approach through comprehensive experiments. Then, during the clustering, we find that the semantic quality of pseudo-labels is not adequately controlled, resulting in semantic chaos of pseudo-labels. We propose a semantic-stability index to measure the semantic quality of pseudo-labels quantitatively. Based on this index, we propose the Semantic-aware Pseudo-label Reassignment mechanism to generate semantic-like pseudo-labels for all samples. Our approach is model-agnostic and can easily be integrated into existing supervised methods. To demonstrate its generalization ability, we integrate it into two representative algorithms: MAML and EP. The results on three main few-shot benchmarks clearly show that the proposed method achieves significant improvement compared to state-of-the-art models. Notably, our approach also outperforms the corresponding supervised method in three tasks. © 1979-2012 IEEE.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic and Attentive Network for Unsupervised Video Summarization

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2022年第2期18卷 1-21页

作者： Zhong, Sheng-Hua Lin, Jingxu Lu, Jianglin Fares, Ahmed Ren, Tongwei College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical Engineering Computer Systems Engineering Program Faculty of Engineering at Shoubra Benha University Cairo Egypt State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

With the rapid growth of video data, video summarization is a promising approach to shorten a lengthy video into a compact version. Although supervised summarization approaches have achieved state-of-the-art performance, they require frame-level annotated labels. Such an annotation process is time-consuming and tedious. In this article, we propose a novel deep summarization framework named Deep Semantic and Attentive Network for Video Summarization (DSAVS) that can select the most semantically representative summary by minimizing the distance between video representation and text representation without any frame-level labels. Another challenge associated with video summarization tasks mainly originates from the difficulty of considering temporal information over a long time. Long Short-Term Memory (LSTM) performs well for temporal dependencies modeling but does not work well with long video clips. Therefore, we introduce a self-attention mechanism into our summarization framework to capture the long-range temporal dependencies among the frames. Extensive experiments on two popular benchmark datasets, i.e., SumMe and TVSum, show that our proposed framework outperforms other state-of-the-art unsupervised approaches and even most supervised methods. © 2022 Association for Computing Machinery.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Feature Model Configuration Reuse Scheme for Self-Adaptive systems

引用

computers, Materials & Continua 2022年第4期71卷 1249-1262页

作者： Sumaya Alkubaisi Said Ghoul Oguz Ata Electrical and Computer Engineering Department Altinbas UniversityIstanbul34218Turkey Faculty of Information Technology Research Laboratory on Bio-Inspired Software EngineeringPhiladelphia UniversityAmman26160Jordan

Most large-scale systems including self-adaptive systems utilize feature models(FMs)to represent their complex architectures and benefit from the reuse of commonalities and variability ***-adaptive systems(SASs)are capable of reconfiguring themselves during the run time to satisfy the scenarios of the requisite ***,reconfiguration of SASs corresponding to each adaptation of the system requires significant computational time and *** process of configuration reuse can be a better alternative to some contexts to reduce computational time,effort and ***,systems’complexity can be reduced while the development process of systems by reusing elements or *** are considered one of the new ways of reuse process that are able to introduce new opportunities for the reuse process beyond the conventional system *** current FM-based modelling techniques represent,manage,and reuse elementary features to model SASs concepts,modeling and reusing configurations have not yet been *** this context,this study presents an extension to FMs by introducing and managing configuration features and their reuse *** results demonstrate that reusing configuration features reduces the effort and time required by a reconfiguration process during the run time to meet the required scenario according to the current context.

关键词： Self-adaptive system feature model system reuse configuration management variability modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：