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

IEEE International Conference on software Analysis, Evolution and Reengineering (SANER)

作者： Zeyu Wang Sheng Huang Zhongxin Liu Meng Yan Xin Xia Bei Wang Dan Yang Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University China School of Big Data and Software Engineering Chongqing University Chongqing China College of Computer Science and Technology Zhejiang University Hangzhou China Faculty of Information Technology Monash University Australia

Plot-based Graphic API recommendation (Plot2API) is an unstudied but meaningful issue, which has several important applications in the context of software engineering and data visualization, such as the plotting guidance of the beginner, graphic API correlation analysis, and code conversion for plotting. Plot2API is a very challenging task, since each plot is often associated with multiple APIs and the appearances of the graphics drawn by the same API can be extremely varied due to the different settings of the parameters. Additionally, the samples of different APIs also suffer from extremely *** the lack of technologies in Plot2API, we present a novel deep multi-task learning approach named Semantic Parsing Guided Neural Network (SPGNN) which translates the Plot2API issue as a multi-label image classification and an image semantic parsing tasks for the solution. In SPGNN, the recently advanced Convolutional Neural Network (CNN) named EfficientNet is employed as the backbone network for API recommendation. Meanwhile, a semantic parsing module is complemented to exploit the semantic relevant visual information in feature learning and eliminate the appearance-relevant visual information which may confuse the visual-information-based API recommendation. Moreover, the recent data augmentation technique named random erasing is also applied for alleviating the imbalance of API *** collect plots with the graphic APIs used to drawn them from Stack Overflow, and release three new Plot2API datasets corresponding to the graphic APIs of R and Python programming languages for evaluating the effectiveness of Plot2API techniques. Extensive experimental results not only demonstrate the superiority of our method over the recent deep learning baselines but also show the practicability of our method in the recommendation of graphic APIs.

关键词： Deep learning Visualization Semantics Neural networks data visualization software Task analysis

来源：评论

学校读者我要写书评

暂无评论

Improving Code Summarization Through Automated Quality Assurance

Improving Code Summarization Through Automated Quality Assur...

引用

International Symposium on software Reliability engineering (ISSRE)

作者： Yuxing Hu Meng Yan Zhongxin Liu Qiuyuan Chen Bei Wang Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) Ministry of Education China School of Big Data and Software Engineering Chongqing University Chongqing China Pengcheng Laboratory Shenzhen China College of Computer Science and Technology Zhejiang University Hangzhou China

ISBN: (纸本)9781665425889

The code summarization task aims to generate brief descriptions of source code automatically. It is beneficial for developers to understand source code. However, almost all of current code summarization approaches may generate low-quality (BLEU4<40) summaries, which will mislead developers. Previous work has shown that it is possible to conduct quality assurance for document generation (QA4DG) and improve the practicability of document generation approaches. Code summarization can also be regarded as a document generation task. This work aims to investigate whether QA4DG approaches can be leveraged to improve code summarization. Specifically, we first investigate whether existing QA4DG approaches can be plugged in code summarization approaches. We find that an automated quality assurance framework for commit message generation named QACom performs best. In-spired by the idea behind QAcom, we propose an ensemble code summarization approach called Ensum. Precisely, given a code snippet, Ensum first uses current code summarization approaches to generate candidate summaries. Then, Ensum predicts the quality of each candidate summary using a collaborative filtering-based component and a retrieval-based component and selects the best candidate summary as the output. Experimental results on two public datasets show that Ensum outperforms three state-of-the-art single approaches and one ensemble approach for code summarization in terms of BLEU-4, METEOR, and ROUGE-L.

关键词： Codes Quality assurance Filtering Collaboration software reliability Task analysis

来源：评论

学校读者我要写书评

暂无评论

Calling Cards: A Customizable Platform to Longitudinally Record Protein-DNA Interactions Over Time in Cells and Tissues (vol 3, e883, 2023)

CURRENT PROTOCOLS

引用

CURRENT PROTOCOLS 2023年第10期3卷 e883页

作者： Yen, Allen Mateusiak, Chase Sarafinovska, Simona Gachechiladze, Mariam A. Guo, Juanru Chen, Xuhua Moudgil, Arnav Cammack, Alexander J. Hoisington-Lopez, Jessica Crosby, MariaLynn Brent, Michael R. Mitra, Robi D. Dougherty, Joseph D. Department of Genetics Washington University School of Medicine Saint Louis Missouri Department of Psychiatry Washington University School of Medicine Saint Louis Missouri Contribution: Conceptualization Data curation Formal analysis Funding acquisition Investigation Methodology Project administration Software Supervision Validation Visualization Writing - original draft Writing - review & editing Edison Family Center for Genome Sciences and Systems Biology Washington University School of Medicine Saint Louis Missouri Contribution: Conceptualization Data curation Formal analysis Methodology Software Visualization Writing - original draft Contribution: Formal analysis Funding acquisition Investigation Visualization Writing - original draft Writing - review & editing Contribution: Formal analysis Funding acquisition Investigation Visualization Writing - review & editing Contribution: Data curation Methodology Software Writing - review & editing Contribution: Methodology Writing - review & editing Current address: Department of Ophthalmology Stanford University School of Medicine Stanford California Contribution: Conceptualization Methodology Software Validation Department of Neurology Washington University School of Medicine Saint Louis Missouri Current address: Department of Neurodegenerative Diseases University College London London United Kingdom Contribution: Conceptualization Methodology Validation Contribution: Investigation Writing - review & editing Department of Computer Science and Engineering Washington University Saint Louis Missouri Contribution: Funding acquisition Contribution: Conceptualization Funding acquisition Project administration Resources Software Supervision Writing - review & editing Intellectual and Developmental Disabilities Research Center Washington University School of Medicine Saint Louis Missouri Contribution: Conceptualization Funding acquisition Project administration Resources Supervision Writing - origin

Calling Cards is a platform technology to record a cumulative history of transient protein-DNA interactions in the genome of genetically targeted cell types. The record of these interactions is recovered by next-generation sequencing. Compared with other genomic assays, readouts of which provide a snapshot at the time of harvest, Calling Cards enables correlation of historical molecular states to eventual outcomes or phenotypes. To achieve this, Calling Cards uses the piggyBac transposase to insert self-reporting transposon “Calling Cards” into the genome, leaving permanent marks at interaction sites. Calling Cards can be deployed in a variety of in vitro and in vivo biological systems to study gene regulatory networks involved in development, aging, and disease. Out of the box, it assesses enhancer usage but can be adapted to profile-specific transcription factor (TF) binding with custom TF-piggyBac fusion proteins. The Calling Cards workflow has five main stages: delivery of Calling Cards reagents, sample preparation, library preparation, sequencing, and data analysis. Here, we first present a comprehensive guide for experimental design, reagent selection, and optional customization of the platform to study additional TFs. Then, we provide an updated protocol for the five steps, using reagents that improve throughput and decrease costs, including an overview of a newly deployed computational pipeline. This protocol is designed for users with basic molecular biology experience to process samples into sequencing libraries in 2 days. Familiarity with bioinformatic analysis and command line tools is required to set up the pipeline in a high-performance computing environment and to conduct downstream analyses. © 2023 Wiley Periodicals LLC. This article was corrected on 16 October 2023. See the end of the full text for details. Basic Protocol 1 : Preparation and delivery of Calling Cards reagents Support Protocol 1 : Next-generation sequencing quantification of barcode

关键词： calling cards epigenetics enhancer usage gene regulation transcription factor binding

来源：评论

学校读者我要写书评

暂无评论

Single-path Bit Sharing for Automatic Loss-aware Model Compression

arXiv

引用

arXiv 2021年

作者： Liu, Jing Zhuang, Bohan Chen, Peng Shen, Chunhua Cai, Jianfei Tan, Mingkui The School of Software Engineering South China University of Technology China The Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China The Pazhou Laboratory Guangzhou China The School of Computer Science the University of Adelaide Australia The Faculty of Information Technology Monash University Australia The College of Computer Science and Technology Zhejiang University Hangzhou China

Network pruning and quantization are proven to be effective ways for deep model compression. To obtain a highly compact model, most methods first perform network pruning and then conduct quantization based on the pruned model. However, this strategy may ignore that the pruning and quantization would affect each other and thus performing them separately may lead to sub-optimal performance. To address this, performing pruning and quantization jointly is essential. Nevertheless, how to make a trade-off between pruning and quantization is non-trivial. Moreover, existing compression methods often rely on some pre-defined compression configurations (i.e., pruning rates or bitwidths). Some attempts have been made to search for optimal configurations, which however may take unbearable optimization cost. To address these issues, we devise a simple yet effective method named Single-path Bit Sharing (SBS) for automatic loss-aware model compression. To this end, we consider the network pruning as a special case of quantization and provide a unified view for model pruning and quantization. We then introduce a single-path model to encode all candidate compression configurations, where a high bitwidth value will be decomposed into the sum of a lowest bitwidth value and a series of re-assignment offsets. Relying on the single-path model, we introduce learnable binary gates to encode the choice of configurations and learn the binary gates and model parameters jointly. More importantly, the configuration search problem can be transformed into a subset selection problem, which helps to significantly reduce the optimization difficulty and computation cost. In this way, the compression configurations of each layer and the trade-off between pruning and quantization can be automatically determined. Extensive experiments on CIFAR-100 and ImageNet show that SBS significantly reduces computation cost while achieving promising performance. For example, our SBS compressed MobileNetV2 achieves

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

FM4SN: A feature-oriented approach to tenant-driven customization of multi-tenant service networks

arXiv

引用

arXiv 2020年

作者： Kumara, Indika van den Heuvel, Willem-Jan Tamburri, Damian Han, Jun Colman, Alan Jheronimus Academy of Data Science Eindhoven University of Technology's Hertogenbosch Netherlands School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia

In a multi-tenant service network, multiple virtual service networks (VSNs), one for each tenant, coexist on the same service network. The tenants themselves need to be able to dynamically create and customize their own VSNs to support their initial and changing functional and performance requirements. These tasks are problematic for them due to: 1) platform-specific knowledge required, 2) the existence of a large number of customization options and their dependencies, and 3) the complexity in deriving the right subset of options. In this paper, we present an approach to enable and simplify the tenant-driven customization of multi-tenant service networks. We propose to use feature as a high-level customization abstraction. A regulated collaboration among a set of services in the service network realizes a feature. A software engineer can design a customization policy for a service network using the mappings between features and collaborations, and enact the policy with the controller of the service network. A tenant can then specify the requirements for its VSN as a set of functional and performance features. A customization request from a tenant triggers the customization policy of the service network, which (re)configures the corresponding VSN at runtime to realize the selected features. We show the feasibility of our approach with two case studies and a performance evaluation. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A codebook-driven approach for low-light image enhancement

引用

engineering Applications of Artificial Intelligence 2025年 156卷

作者： Xu Wu Xianxu Hou Zhihui Lai Jie Zhou Ya-nan Zhang Witold Pedrycz Linlin Shen College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou 215400 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 518060 China School of Computer Science Sichuan Normal University Chengdu 610065 China The Department of Electrical & Computer Engineering University of Alberta Alberta T6G 1H9 Canada

Low-light image enhancement (LLIE) aims to improve low-illumination images. However, existing methods face two challenges: (1) uncertainty in restoration from diverse brightness degradations; (2) loss of texture and color information caused by noise suppression and light enhancement. In this paper, we propose a novel enhancement approach, CodeEnhance, by leveraging discrete codebook priors and image refinement to address these challenges. In particular, we reframe LLIE as learning an image-to-code mapping from low-light images to discrete codebook, which has been learned from high-quality images. To enhance this process, a Semantic Embedding Module (SEM) is introduced to integrate semantic information with low-level features, and a Codebook Shift (CS) mechanism, designed to adapt the pre-learned codebook to better suit the distinct characteristics of our low-light dataset. Additionally, we present an Interactive Feature Transformation (IFT) module to refine texture and color information during image reconstruction, allowing for interactive enhancement based on user preferences. Extensive experiments on both real-world and synthetic benchmarks demonstrate that the incorporation of prior knowledge and controllable information transfer significantly enhances LLIE performance in terms of quality and fidelity. The proposed CodeEnhance exhibits superior robustness to various degradations, including uneven illumination, noise, and color distortion. The code can be obtained from https://***/csxuwu/CodeEnhance or https://***/*** .

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

A Secure Federated data-Driven Evolutionary Multi-objective Optimization Algorithm

arXiv

引用

arXiv 2022年

作者： Liu, Qiqi Yan, Yuping Ligeti, Péter Jin, Yaochu Trustworthy and General AI Lab School of Engineering Westlake University China Faculty of Technology Bielefeld University Bielefeld33619 Germany Faculty of Informatics Department of Computeralgebra Eötvös Loránd University Hungary Smart Data Group E-Group ICT Software Zrt Hungary Department of Computer Science University of Surrey Surrey GuildfordGU2 7XH United Kingdom

data-driven evolutionary algorithms usually aim to exploit the information behind a limited amount of data to perform optimization, which have proved to be successful in solving many complex real-world optimization problems. However, most data-driven evolutionary algorithms are centralized, causing privacy and security concerns. Existing federated Bayesian optimization algorithms and data-driven evolutionary algorithms mainly protect the raw data on each client. To address this issue, this paper proposes a secure federated data-driven evolutionary multiobjective optimization algorithm to protect both the raw data and the newly infilled solutions obtained by optimizing the acquisition function conducted on the server. We select the query points on a randomly selected client at each round of surrogate update by calculating the acquisition function values of the unobserved points on this client, thereby reducing the risk of leaking the information about the solution to be sampled. In addition, since the predicted objective values of each client may contain sensitive information, we mask the objective values with Diffie-Hellman-based noise, and then send only the masked objective values of other clients to the selected client via the server. Since the calculation of the acquisition function also requires both the predicted objective value and the uncertainty of the prediction, the predicted mean objective and uncertainty are normalized to reduce the influence of noise. Experimental results on a set of widely used multi-objective optimization benchmarks show that the proposed algorithm can protect privacy and enhance security with only negligible sacrifice in the performance of federated data-driven evolutionary optimization. Copyright © 2022, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Incorporating Multiple Features to Predict Bug Fixing Time with Neural Networks

Incorporating Multiple Features to Predict Bug Fixing Time w...

引用

International Conference on software Maintenance (ICSM)

作者： Wei Yuan Yuan Xiong Hailong Sun Xudong Liu SKLSDE Lab School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing China SKLSDE Lab School of Software Beihang University Beijing China

Debugging is a well-known time-consuming task, and knowing how long it would take to resolve bugs is of great importance for allocating the limited resources in a software development team. However, it is challenging to predict bug fixing time since fixing bugs is subject to a plethora of uncertain factors such as types of bugs, program complexity and developers' abilities. Existing work mainly focuses on developers' activities in a bug lifecycle and ignores other important factors. In light of the limitations of existing work, we propose a novel approach to predicting the bug fixing time by incorporating a comprehensive set of relevant features. Specifically, we consider four types of features including developers' activities, developers' sentiments, semantics of bugs, and efforts caused by understanding and analyzing source code, and design particular neural networks to take advantage of these features and make them work efficiently. Experimental results on four real application datasets demonstrate that on the one hand, our approach outperforms the state-of-the-art by over 5% in accuracy and 7.3% in F1-score on average; on the other hand, each type of the features considered in our approach plays an important part in the prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterogenous Multi-Source Fusion for Ship Trajectory Complement and Prediction with Sequence Modeling

Heterogenous Multi-Source Fusion for Ship Trajectory Complem...

引用

IEEE International Conference on data science in Cyberspace (DSC)

作者： Changmeng Zheng Qi Peng Xuemiao Xu Key Laboratory of Big Data and Intelligent Robot School of Software Engineering South China University of Technology Guangzhou China School of Computer Science & Engineering South China University of Technology Guangzhou China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

Effectively monitoring ships and discovering abnormal ship trajectory in time is necessary for marine traffic supervision. The basic work of discovering the ship's abnormal trajectory is to predict the ship's navigation dynamically. Previous works in ship trajectory prediction are basically concern on single-source data, for example, the AIS data. These methods ignore the relations between different sources which may improve the performance of predicting ship trajectory. We propose a neural sequence model based on heterogeneous multisource fusion for ship trajectory completion and prediction. Our method makes better utilization of AIS, GPS and ARPA radar information to predict ship trajectory precisely. We construct a dataset which contains about 8 million ship trajectory samples and the experiments demonstrate that our multi-source fusion model gains promising results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Signal approximation with Pascal’s triangle and sampling

Signal approximation with Pascal’s triangle and sampling

引用

第32届中国控制与决策会议

作者： Lei Chen Xinghuo Yu Jinhu Lü School of Automation Science and Electrical Engineering State Key Laboratory of Software Development EnvironmentBeijing Advanced Innovation Center for Big Data and Brain ComputingBeihang University School of Engineering RMIT University

This brief explores the approximation properties of a unique basis expansion based on Pascal’s triangle,which realizes a sampled-data driven approach between a continuous-time signal and its discrete-time *** roles of certain parameters,such as sampling time interval or model order,and signal characteristics,i.e.,its curvature,on the approximation are *** errors in one and multiple-step predictions are ***,time-variant approximations under the thresholds of signal curvature are employed to narrow errors and provide flexibilities.

关键词： Signal approximation Sampling Discretization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：