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

arXiv 2025年

作者： Zhang, Quanjun Fang, Chunrong Zheng, Yi Zhang, Yaxin Zhao, Yuan Huang, Rubing Zhou, Jianyi Yang, Yun Zheng, Tao Chen, Zhenyu Department of Computing Technologies Swinburne University of Technology Melbourne Australia State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing China School of Computer Science and Engineering Macau University of Science and Technology Jiangsu Nanjing China Huawei Cloud Computing Technologies Co. Ltd. Beijing China Shenzhen Research Institute of Nanjing University Guangdong Shenzhen China

Unit testing validates the correctness of the units of the software system under test and serves as the cornerstone in improving software quality and reliability. To reduce manual efforts in writing unit tests, some techniques have been proposed to generate test assertions automatically, including deep learning (DL)-based, retrieval-based, and integration-based ones. Among them, recent integration-based approaches inherit from both DL-based and retrieval-based approaches and are considered state-of-the-art. Despite being promising, such integration-based approaches suffer from inherent limitations, such as retrieving assertions with lexical matching while ignoring meaningful code semantics, and generating assertions with a limited training corpus. In this paper, we propose a novel Retrieval-Augmented Deep Assertion Generation approach, namely RetriGen, based on a hybrid assertion retriever and a pre-trained language model (PLM)-based assertion generator. Given a focal-test, RetriGen first builds a hybrid assertion retriever to search for the most relevant test-assert pair from external codebases. The retrieval process takes both lexical similarity and semantical similarity into account via a token-based and an embedding-based retriever, respectively. RetriGen then treats assertion generation as a sequence-to-sequence task and designs a PLM-based assertion generator to predict a correct assertion with historical test-assert pairs and the retrieved external assertion. Although our concept is general and can be adapted to various off-the-shelf encoder-decoder PLMs, we implement RetriGen to facilitate assertion generation based on the recent CodeT5 model. We conduct extensive experiments to evaluate RetriGen against six state-of-the-art approaches across two large-scale datasets and two metrics. The experimental results demonstrate that RetriGen achieves 57.66% and 73.24% in terms of accuracy and CodeBLEU, outperforming all baselines with an average improvement of 50.66

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

DEM-bond model: A computational framework for designing mechanically enhanced polymer nanosphere-based ordered nanostructures

引用

Materials and Design 2025年 253卷

作者： Chen, Dan Chen, Zhiren Zhang, Tengfang Zhu, Zhihong Zhou, Qingwei Luo, Fang Wu, Fan Wang, Yunming Guo, Chucai College of Advanced Interdisciplinary Studies & Hunan Provincial Key Laboratory of Novel NanoOptoelec-tronic Information Materials and Devices National University of Defense Technology Hunan Changsha410073 China Nanhu Laser Laboratory National University of Defense Technology Hunan Changsha410073 China China Telecom Cloud Computing Co. Ltd. Hunan Branch Hunan Changsha410000 China Shenzhen TenFong Technology Co. Ltd Guangdong Shenzhen518055 China State Key Laboratory of Materials Processing and Die & Mould Technology School of Materials Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

Polymer nanosphere-based devices demonstrate exceptional optoelectronic properties due to the surface and size effect. However, the lack of predictive computational models for nanosphere interactions during fabricatio... 详细信息

关键词： Nanospheres

来源：评论

学校读者我要写书评

暂无评论

Constraint Boundary Wandering Framework: Enhancing Constrained Optimization with Deep Neural Networks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Wu, Shuang Chen, Shixiang Shen, Li Zhang, Lefei Tao, Dacheng Wuhan University National Engineering Research Center for Multimedia Software School of Computer Science Wuhan430072 China University of Science and Technology of China Key Laboratory of the Ministry of Education for Mathematical Foundations and Applications of Digital Technology School of Mathematical Sciences China Shenzhen Campus of Sun Yat-sen University School of Cyber Science and Technology Shenzhen518107 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Constrained optimization problems are pervasive in various fields, and while conventional techniques offer solutions, they often struggle with scalability. Leveraging the power of deep neural networks (DNNs) in optimization, we present a novel learning-based approach, the Constraint Boundary Wandering Framework (CBWF), to address these challenges. Our contributions include introducing a boundary wandering strategy inspired by the active-set method, enhancing equality constraint feasibility, and treating the Lipschitz constant as a learnable parameter. Additionally, we evaluate the regularization term, illustrating that the nonsmooth L2 norm yields superior results. Extensive testing on synthetic datasets and the ACOPT dataset demonstrates CBWF's superiority, outperforming existing deep learning-based solvers in terms of both objective and constraint loss. © 1979-2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

An event summarizing algorithm based on the timeline relevance model in Sina Weibo

引用

Science China(Information Sciences) 2018年第12期61卷 184-186页

作者： Kai LEI Lizhu ZHANG Ying LIU Ying SHEN Chenwei LIU Qian YU Weitao WENG Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) School of Electronics and Computer Engineering Peking University

Dear editor,Depicting superior punctuality and originality,Weibo has become increasingly critical and influential in China for online information acquisition and sharing. However, very few research has studied Weibo to investigate event summarizing even though most of the published Weibos are event-driven. Besides, we observe that the existing methods are unsuitable for process-

关键词： IDF TF HAC An event summarizing algorithm based on the timeline relevance model in Sina Weibo

来源：评论

学校读者我要写书评

暂无评论

OpenLS-DGF: An Adaptive Open-Source Dataset Generation Framework for Machine Learning Tasks in Logic Synthesis

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Ni, Liwei Wang, Rui Liu, Miao Meng, Xingyu Lin, Xiaoze Liu, Junfeng Luo, Guojie Chu, Zhufei Qian, Weikang Yang, Xiaoyan Xie, Biwei Li, Xingquan Li, Huawei Chinese Academy of Sciences State Key Lab of Processors Institute of Computing Technology Beijing100190 China Pengcheng Laboratory Shenzhen518055 China University of Chinese Academy of Sciences Beijing101408 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Chinese Academy of Sciences School of Computer Science and Technology Beijing100049 China Peking University School of Computer Science Center for Energy-Efficient Computing and Applications Beijing100871 China Ninbo University Faculty of Electrical Engineering and Computer Science Ninbo315211 China Shanghai Jiao Tong University University of Michigan-Shanghai Jiao Tong University Joint Institute MoE Key Laboratory of Artificial Intelligence Shanghai200240 China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou311121 China

This paper introduces OpenLS-DGF, an adaptive logic synthesis dataset generation framework, to enhance machine learning (ML) applications within the logic synthesis process. Previous dataset generation flows were tailored for specific tasks or lacked integrated ML capabilities. While OpenLS-DGF supports various machine learning tasks by encapsulating the three fundamental steps of logic synthesis: Boolean representation, logic optimization, and technology mapping. It preserves the original information in both Verilog and ML-friendly GraphML formats. The Verilog files offer semi-customizable capabilities, enabling researchers to insert additional steps and incrementally refine the generated dataset. Furthermore, OpenLS-DGF includes an adaptive circuit engine that facilitates the final dataset management and downstream tasks. The generated OpenLS-D-v1 dataset comprises 46 combinational designs from established benchmarks, totaling over 966,000 Boolean circuits. OpenLS-D-v1 supports integrating new data features, making it more versatile for new tasks. This paper demonstrates the versatility of OpenLS-D-v1 through four distinct downstream tasks: circuit classification, circuit ranking, quality of results (QoR) prediction, and probability prediction. Each task is chosen to represent essential steps of logic synthesis, and the experimental results show the generated dataset from OpenLSDGF achieves prominent diversity and applicability. The source code and datasets are available at https://***/Logic-Factory/ACE/blob/master/OpenLS-DGF. © 1982-2012 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Huge Page Friendly Virtualized Memory Management

引用

Journal of Computer Science & technology 2020年第2期35卷 433-452页

作者： Sai Sha Jing-Yuan Hu Ying-Wei Luo Xiao-Lin Wang Zhenlin Wang School of Electronics Engineering and Computer Science Peking UniversityBeijing 100871China Peng Cheng Laboratory Shenzhen 518052China Shenzhen Key Laboratory for Cloud Computing Technology&Applications School of Electronic and Computer EngineeringPeking University ShenzhenShenzhen 518000China Department of Computer Science Michigan Technological UniversityMichigan 49246U.S.A.

With the rapid increase of memory consumption by applications running on cloud data centers,we need more efficient memory management in a virtualized *** huge pages becomes more critical for a virtual machine's performance when it runs large working set size *** with large working set sizes are more sensitive to memory allocation,which requires us to quickly adjust the virtual machine's memory to accommodate memory phase *** would be much more efficient if we could adjust virtual machines'memory at the granularity of huge ***,existing virtual machine memory reallocation techniques,such as ballooning,do not support huge *** addition,in order to drive effective memory reallocation,we need to predict the actual memory demand of a virtual *** find that traditional memory demand estimation methods designed for regular pages cannot be simply ported to a system adopting huge *** to adjust the memory of virtual machines timely and effectively according to the periodic change of memory demand is another challenge we *** paper proposes a dynamic huge page based memory balancing system(HPMBS)for efficient memory management in a virtualized *** first rebuild the ballooning mechanism in order to dispatch memory in the granularity of huge *** then design and implement a huge page working set size estimation mechanism which can accurately estimate a virtual machine's memory demand in huge pages *** these two mechanisms,we finally use an algorithm based on dynamic programming to achieve dynamic memory *** show that our system saves memory and improves overall system performance with low overhead.

关键词： virtualization huge page ballooning memory balancing

来源：评论

学校读者我要写书评

暂无评论

TopicDSDR: Combining topic decomposition and data reconstruction for summarization

TopicDSDR: Combining topic decomposition and data reconstruc...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhang, Zhiming Li, Hongjie Huang, Lian'En Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong China

ISBN: (纸本)9783642385612

Multi-document summarization attempts to select the most important information to generate a compressed summary from a collection of documents. From the perspective of data reconstruction, a good summary may also well reconstruct the original documents. A document generally contains a variety of information centered around a main topic and covers different aspects of the main topic. In this paper we propose a novel model that combines data reconstruction and topic decomposition to summarize the documents, named TopicDSDR, which can not only best reconstruct the original documents but also capture the semantic similarity and main topics. We discuss two kinds of reconstructions: linear reconstruction and nonnegative reconstruction. We use the generalized Kullback-Leibler(KL) divergence as the loss function to evaluate the quality of summary for linear and nonnegative reconstruction and develop two new algorithms respectively. We conduct experiments on DUC2006 and DUC2007 summarization data sets, the experimental results demonstrate the effectiveness of our proposed methods. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Dynamic cache partitioning based on hot page migration

引用

Frontiers of Computer Science 2012年第4期6卷 363-372页

作者： Xiaolin WANG Xiang WEN Yechen LI Zhenlin WANG Yingwei LUO Xiaoming LI Department of Computer Science Peking UniversityBeijing 100871China Department of Computer Science Michigan Technological UniversityHoughtonMI 49931USA The Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate SchoolShenzhen 518055China

Static cache partitioning can reduce inter- application cache interference and improve the composite performance of a cache-polluted application and a cache- sensitive application when they run on cores that share the last level cache in the same multi-core processor. In a virtu- alized system, since different applications might run on dif- ferent virtual machines （VMs） in different time, it is inappli- cable to partition the cache statically in advance. This paper proposes a dynamic cache partitioning scheme that makes use of hot page detection and page migration to improve the com- posite performance of co-hosted virtual machines dynami- cally according to prior knowledge of cache-sensitive appli- cations. Experimental results show that the overhead of our page migration scheme is low, while in most cases, the com- posite performance is an improvement over free composition.

关键词： cache partitioning hot page migration dynamic cache partitioning virtualization virtual machine monitor

来源：评论

学校读者我要写书评

暂无评论

Comments-oriented document summarization based on multi-aspect co-feedback ranking

Comments-oriented document summarization based on multi-aspe...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Huang, Lifu Li, Hongjie Huang, Lian'En Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783642385612

With the popularity of Web 2.0, comments left by readers on web documents have drawn much attention. In this paper, we study the problem of comments-oriented document summarization, which aims to summarize a web document by considering not only its content but also the comments. Generally, most of the comments usually convey one or a few aspects of the document. Given a sentence set from both the web document and its corresponding comments to summarize, we can divide different sentences into different clusters (named "aspects") according to the content. It is challenging and interesting to summarize the web document based on these clusters. Motivated by this, we propose a novel model: MultiAspectCoRank, for comments-oriented document summarization. Firstly we rank all the sentences based on the multiple aspects obtained from the whole document, and then provide each ranking list as feedback to others until the top-N results of each ranking list are unchanged. We get the final result by integrating these different ranking lists together. Experimental results on a set of real-world blog data with manually labeled sentences show the promising performance of our approach. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Optimized event storyline generation based on mixture-event-aspect model

Optimized event storyline generation based on mixture-event-...

引用

2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013

作者： Huang, Lifu Huang, Lian'en Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong518055 China

ISBN: (纸本)9781937284978

Recently, much research focuses on event storyline generation, which aims to produce a concise, global and temporal event summary from a collection of articles. Generally, each event contains multiple sub-events and the storyline should be composed by the component summaries of all the sub-events. However, different sub-events have different part-whole relationship with the major event, which is important to correspond to users' interests but seldom considered in previous work. To distinguish different types of sub-events, we propose a mixture-event-aspect model which models different sub-events into local and global aspects. Combining these local/global aspects with summarization requirements together, we utilize an optimization method to generate the component summaries along the timeline. We develop experimental systems on 6 distinctively different datasets. Evaluation and comparison results indicate the effectiveness of our proposed method. © 2013 Association for Computational Linguistics.

关键词： Mixtures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：