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

Wuhan University Journal of Natural Sciences 2004年第5期9卷 561-568页

作者： ZHANG Wei-feng 1,2,3 , XU Bao-wen 2,3,4 , ZHOU Xiao-yu 2,3,4 1. Department of computer Science and engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, Jiangsu, China 2. Department of computer Science and engineering, Southeast University, Nanjing 210096, Jiangsu, China 3. Jiangsu Institute of software quality, Nanjing 210096 Jiangsu, China 4. The State Key laboratory of software engineering, Wuhan University, Wuhan 430072, Hubei, China Department of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Department of Computer Science and Engineering Southeast University Najing Jiangsu China Jiangsu Institute of Software Quality Nanjing Jiangsu China The State Key Laboratory of Software Engineering Wuhan University Wuhan Hubei China

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected by them. Since the selections of the search results cannot affect the future ones, they may not cover most people’s interests. In this paper, feedback information produced by the user’s accessing lists will be represented by the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability. Key words WWW - search engine - query reconstruction - feedback CLC number TP 311. 135.4 Foundation item: Supported by the National Natural Science Fundation of China (60373066). National Grand Fundamental Research 973 Program of China (2002CB31200). Opening Foundation of State Key laboratory of software engineering in Wuhan University, Opening Foundation of Jiangsu Key laboratory of computer Information Processing Technology in Soochow University Biography: ZHANG Wei-feng (1975-), male, Ph.D. research direction: artificial intelligence, search engine, data mining, network language.

关键词： WWW search engine query reconstruction feedback

来源：评论

学校读者我要写书评

暂无评论

ProSy: API-Based Synthesis with Probabilistic Model

引用

Journal of computer Science & Technology 2020年第6期35卷 1234-1257页

作者： Bin-Bin Liu Wei Dong Jia-Xin Liu Ya-Ting Zhang Dai-Yan Wang College of Computer Science National University of Defense TechnologyChangsha 410072China Key Laboratory of Software Engineering for Complex Systems College of Computer ScienceNational University of Defense TechnologyChangsha 410072China

Program synthesis is an exciting topic that desires to generate programs satisfying user intent automatically. But in most cases, only small programs for simple or domain-specific tasks can be synthesized. The major obstacle of synthesis lies in the huge search space. A common practice in addressing this problem is using a domain-specific language, while many approaches still wish to synthesize programs in general programming languages. With the rapid growth of reusable libraries, component-based synthesis provides a promising way, such as synthesizing Java programs which are only composed of APIs (application programming interfaces). However, the efficiency of searching for proper solutions for complex tasks is still a challenge. Given an unfamiliar programming task, programmers would search for API usage knowledge from various coding resources to reduce the search space. Considering this, we propose a novel approach named ProSy to synthesize API-based programs in Java. The key novelty is to retrieve related knowledge from Javadoc and Stack Overflow and then construct a probabilistic reachability graph. It assigns higher probabilities to APIs that are more likely to be used in implementing the given task. In the synthesis process, the program sketch with a higher probability will be considered first;thus, the number of explored reachable paths would be decreased. Some extension and optimization strategies are further studied in the paper. We implement our approach and conduct several experiments on it. We compare ProSy with SyPet and other state-of-the-art API-based synthesis approaches. The experimental results show that ProSy reduces the synthesis time of SyPet by up to 80%.

关键词： application programming interface(API)-based program Petri net probabilistic reachability graph program synthesis

来源：评论

学校读者我要写书评

暂无评论

Improving students’programming quality with the continuous inspection process:a social coding perspective

引用

Frontiers of computer Science 2020年第5期14卷 43-60页

作者： Yao Lu Xinjun Mao Tao Wang Gang Yin Zude Li College of Computer National University of Defense TechnologyChangsha410073China Key Laboratory of Software Engineering for Complex Systems Changsha410073China School of Information Science and Engineering Central South UniversityChangsha410012China

College students majoring in computer science and software engineering need to master skills for high-quality ***,rich research has shown that both the teaching and learning of high-quality programming are challenging and deficient in most college education ***,the continuous inspection paradigm has been widely used by developers on social coding sites(e.g.,GitHub)as an important method to ensure the internal quality of massive code *** paper presents a case where continuous inspection is introduced into the classroom setting to improve students’programming *** the study,we first designed a specific continuous inspection process for students’collaborative projects and built an execution environment for the *** then conducted a controlled experiment with 48 students from the same course during two school years to evaluate how the process affects their programming *** results show that continuous inspection can help students in identifying their bad coding habits,mastering a set of good coding rules and significantly reducing the density of code quality issues introduced in the ***,we describe the lessons learned during the study and propose ideas to replicate and improve the process and its execution platform.

关键词： continuous inspection programming quality SonarQube

来源：评论

学校读者我要写书评

暂无评论

Using genetic algorithms for early schedulability analysis and stress testing in real-time systems

引用

Genetic Programming and Evolvable Machines 2006年第2期7卷 145-170页

作者： Lionel C. Briand Yvan Labiche Marwa Shousha Software Quality Engineering Laboratory Department of Systems and Computer Engineering Carleton University Ottawa Canada

Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. It is therefore important for the designers of such systems to analyze the schedulability of tasks during the design process, as well as to test the system's response time to events in an effective manner once it is implemented. This article explores the use of genetic algorithms to provide automated support for both tasks. Our main objective is then to automate, based on the system task architecture, the derivation of test cases that maximize the chances of critical deadline misses within the system; we refer to this testing activity as stress testing. A second objective is to enable an early but realistic analysis of tasks' schedulability at design time. We have developed a specific solution based on genetic algorithms and implemented it in a tool. Case studies were run and results show that the tool (1) is effective at identifying test cases that will likely stress the system to such an extent that some tasks may miss deadlines, (2) can identify situations that were deemed to be schedulable based on standard schedulability analysis but that, nevertheless, exhibit deadline misses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

software architecture documentation for developers: A survey

Software architecture documentation for developers: A survey

引用

software engineering 2014

作者： Rost, Dominik Naab, Matthias Lima, Crescendo Von Flach Chavez, Christina Fraunhofer Institute for Experimental Software Engineering Kaiserslautern Germany Fraunhofer Project Center on Software and Systems Engineering Software Engineering Laboratory Department of Computer Science Bahia Brazil

来源：评论

学校读者我要写书评

暂无评论

A UML-Based Approach to System Testing

引用

software and systems Modeling 2002年第1期1卷 10-42页

作者： Briand, Lionel Labiche, Yvan Software Quality Engineering Laboratory Systems and Computer Engineering Department Carleton University Ottawa Canada

System testing is concerned with testing an entire system based on its specifications. In the context of object-oriented, UML development, this means that system test requirements are derived from UML analysis artifacts such as use cases, their corresponding sequence and collaboration diagrams, class diagrams, and possibly Object Constraint Language (OCL) expressions across all these artifacts. Our goal here is to support the derivation of functional system test requirements, which will be transformed into test cases, test oracles, and test drivers once we have detailed design information. In this paper, we describe a methodology in a practical way and illustrate it with an example. In this context, we address testability and automation issues, as the ultimate goal is to fully support system testing activities with high-capability tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Application Specified Soft-Error Failure Rate Analysis Using Sequential Equivalence Checking Techniques

引用

Tsinghua Science and Technology 2020年第1期25卷 103-116页

作者： Tun Li Qinhan Yu Hai Wan Sikun Li School of Computer Science National University of Defense TechnologyChangsha 410073China the Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China. School of Software Tsinghua UniversityBeijing 100084China

Soft errors have become a critical challenge as a result of technology scaling. Existing circuit-hardening techniques are commonly associated with prohibitive overhead of performance, area, and power. However,evaluating the influence of soft errors in Flip-Flops(FFs) on the failure of circuit is a difficult verification ***, we proposed a novel flip-flop soft-error failure rate analysis methodology using a formal method with respect to application behaviors. Approach and optimization techniques to implement the proposed methodology based on the given formula using Sequential Equivalence Checking(SEC) are introduced. The proposed method combines the advantage of formal technique-based approaches in completeness and the advantage of application behaviors in accuracy to differentiate vulnerability of components. As a result, the FFs in a circuit are sorted by their failure rates, and designers can use this information to perform optimal hardening of selected sequential components against soft errors. Experimental results of an implementation of a SpaceWire end node and the largest ISCAS’89 benchmark sequential circuits indicate the feasibility and potential scalability of our approach. A case study on an instruction decoder of a practical 32-bit microprocessor demonstrates the applicability of our method.

关键词： soft error failure rate analysis Sequential Equivalence Checking(SEC) application specified

来源：评论

学校读者我要写书评

暂无评论

Implicit Multi-Scale Swin Transformer Network for Image Denoising

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Qi Ding, Yuwei Zhang, Weiqi Zhu, Yian Zhang, Bob Lin, Jerry Chun-Wei Harbin Institute of Technology at Weihai School of Economics and Management Weihai China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Northwestern Polytechnical University School of Computer Science Xi’an China Northwestern Polytechnical University Yangtze River Delta Research Institute Taicang China University of Macau PAMI Research Group Department of Computer and Information Science Taipa China Department of Distributed Systems and IT Devices Electrical Engineering and Mathematical Sciences Silesian university of technology Poland

Image denoising has been used in various edge computing scenarios such as consumer electronics to improve the image quality and user experience. Existing image denoising methods based on Convolutional Neural Networks (CNNs) and vision Transformers achieve good performance by empirically utilizing residual neural network (ResNet) as basic component. However, ResNet lacks interpretability in network design and also long-term memory of features, potentially restricting the performance of denoising networks. In this paper, we propose an Implicit Multi-scale Swin Transformer Network (IMSNet) for image denoising, which introduces the implicit Euler scheme from the feature memory perspective. Specifically, densely connected implicit feature extraction blocks (IFEBs) are designed to learn the residual mapping between noisy and clean images. The IFEB reformulates the initial skip connection of ResNet based on the implicit Euler discretization, providing both network interpretability and long-term memory. In IFEB, the multi-scale swin Transformer block (MSB) is designed as the implicit layer to capture spatial details and non-local contextual information at different scales. Additionally, a cross-layer feature fusion block (CLFF) is proposed to further improve feature reuse capabilities. Compared to existing denoising networks, the extensive experiments demonstrate the superior performance of our IMSNet in various image denoising tasks, and the flexibility in the practical applications with proposed light model on resource-restricted platforms such as consumer electronic devices. © 1975-2011 IEEE.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards functional verifying a family of SystemC TLMs

引用

Frontiers of computer Science 2020年第1期14卷 53-66页

作者： Tun LI Jun YE Qingping TAN College of Computer National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems Changsha 410073China Jiangnan Institute of Computing Technology Wuxi 214083China

It is often the case that in the development of a system-on-a-chip(SoC)design,a family of SystemC transaction level models(TLM)is *** in the same family often share common functionalities but differ in their timing,implementation,configuration and performance in various SoC developing *** most cases,all the TLMs in a family must be verified for the follow-up design *** our previous work,we proposed to call such family TLM product line(TPL),and proposed feature-oriented(FO)design methodology for efficient TPL ***,developers can only verify TLM in a family one by one,which causes large portion of duplicated verification ***,in our proposed methodology,functional verification of TPL has become a *** this paper,we proposed a novel TPL verification method for FO *** our method,for the given property,we can exponentially reduce the number of TLMs to be verified by identifying mutefeature-modules(MFM),which will avoid duplicated *** proposed method is presented in informal and formal way,and the correctness of it is *** theoretical analysis and experimental results on a real design show the correctness and efficiency of the proposed method.

关键词： system-on-a-chip transaction level model SystemC feature-oriented functional verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：