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

IEEE 6th International Symposium on Theoretical Aspects of software Engineering, TASE 2012

作者： Ye, Nan Chen, Xin Ding, Wenxu Jiang, Peng Bu, Lei Li, Xuandong State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University Nanjing Jiangsu 210093 P.R. China China

ISBN: (纸本)9780769547510

Regression testing is a widely used way to assure the quality of modified software. It requires executing a suite of test cases to ensure that modifications do not introduce any negative impact to software behavior. To collect test cases in the suite that can reveal modifications, different versions of software must be compared carefully. Existing approaches, relying on manual examination on programs or models to identify differences, are expensive. In the paper, we present a fully automatic approach to generating regression test cases based on activity diagram revision. By collecting execution traces and revising old activity diagrams, the approach firstly constructs new activity diagrams that can reveal software behavior changes. Then, both affected paths and new paths in activity diagrams are identified. Finally, an execution-based approach is applied to generate regression test cases whose execution can cover these paths. Experiments show the effectiveness of our approach. © 2012 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

The optimization of replica distribution in the unstructured overlays

引用

science China(Information sciences) 2012年第3期55卷 714-722页

作者： FENG GuoFu1,2 , LI WenZhong2, LU SangLu2, CHEN DaoXu2 & BUYYA Rajkumar3 1School of Information science, Nanjing Audit University, Nanjing 210029, China 2state key laboratory of Novel software technology, Nanjing University, Nanjing 210093, China 3department of computer science and software Engineering, The University of Melbourne, Victoria 3010, Australia 1. School of Information Science Nanjing Audit University Nanjing 210029 China2. State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 China3. Department of Computer Science and Software Engineering The University of Melbourne Victoria 3010 Australia

Replication is a widely used technique in unstructured overlays to improve content availability or system performance. A fundamental question often addressed by previous work focused on: how many replicas ought to be allocated for each data item given the fixed query rates and limited storage capability? In this paper, we have put forth two optimal replica distributions to achieve the highest success rate and the lowest message consumption. Especially, we have investigated the influence of item size on replica distribution. Our results show that Square-Root Replication, which is traditionally considered to be optimal, is not always the best choice. Our study offers a new deep understanding of resource managment in self-organized unstructured overlays.

关键词： unstructured overlay item size distribution query rate success rate expected search size

来源：评论

学校读者我要写书评

暂无评论

Innovative instruction, assessment & evaluation in programming language concepts 2012

Innovative instruction, assessment & evaluation in programmi...

引用

2012 IEEE International Conference on Information science and technology, ICIST 2012

作者： Powers, David M. W. Department of Computer Science School of Computer Science Engineering and Mathematics Flinders University Australia Beijing Municipal Key Laboratory for Multimedia and Intelligent Software Technology Beijing University of Technology China

ISBN: (纸本)9781457703454

This paper describes the development of a course in Programming Concepts over a period of a decade. Initially we present educational principles that underlie the approach, as well as specific and generic aims for this course. We then proceed to show how an integrated program of assessment and instruction has allowed teaching and comparison of multiple programming paradigms and concepts within a common framework. The specifiation of specific and generic skills and the extents to which they are expected to be covered has been closely validated with surveys framed around them. We also address some general issues in modern education. © 2012 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Leveraging network structure for incremental document clustering

引用

14th Asia Pacific Web technology Conference, APWeb 2012

作者： Qian, Tieyun Si, Jianfeng Li, Qing Yu, Qian State Key Laboratory of Software Engineering Wuhan University Wuhan China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9783642292521

Recent studies have shown that link-based clustering methods can significantly improve the performance of content-based clustering. However, most previous algorithms are developed for fixed data sets, and are not applicable to the dynamic environments such as data warehouse and online digital library. In this paper, we introduce a novel approach which leverages the network structure for incremental clustering. Under this framework, both the link and content information are incorporated to determine the host cluster of a new document. The combination of two types of information ensures a promising performance of the clustering results. Furthermore, the status of core members is used to quickly determine whether to split or merge a new cluster. This filtering process eliminates the unnecessary and time-consuming checks of textual similarity on the whole corpus, and thus greatly speeds up the entire procedure. We evaluate our proposed approach on several real-world publication data sets and conduct an extensive comparison with both the classic content based and the recent link based algorithms. The experimental results demonstrate the effectiveness and efficiency of our method. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Fault class prioritization in Boolean expressions 12

Fault class prioritization in Boolean expressions

引用

27th Annual ACM Symposium on Applied Computing, SAC 2012

作者： Wang, Ziyuan Chen, Zhenyu Chen, Tsong-Yueh Xu, Baowen State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Centre for Software Analysis and Testing Swinburne University of Technology VIC 3122 Australia

ISBN: (纸本)9781450308571

A recent study has classified faults in Boolean expressions into ten classes and has proved that there are five key fault classes, namely CCF, CDF, ORF, ENF and ASF, such that if a test suite can kill all faulty versions of these five core fault classes, if can kill all faulty versions of all fault classes. In order to generate more effective test suites, we should prioritize these five fault classes further, such that test cases with stronger fault detection capability could be generated as early as possible. Such a process is referred to as the fault class prioritization. Based on the observation in the fault class hierarchy, we divide the five fault classes into two groups {CCF, CDF} and {ORF, ENF, ASF}. Two strategies of fault class prioritization are proposed to generate test cases efficiently. We design experiments using TCAS Boolean expressions and some randomly generated Boolean expressions. The experimental results suggest that if we generate test cases for CCF and CDF firstly, the final test suite always have a higher efficiency of killing faults. © 2012 ACM.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

PHD filter for multi-target tracking by variational Bayesian approximation

PHD filter for multi-target tracking by variational Bayesian...

引用

IEEE Annual Conference on Decision and Control

作者： Wenling Li Yingmin Jia Junping Du Jun Zhang Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electronic and Information Engineering Beihang University (BUAA) Beijing 100191 China

ISBN: (纸本)9781467357159

In this paper, we address the problem of multitarget tracking with unknown measurement noise variance parameters by the probability hypothesis density (PHD) filter. Based on the concept of conjugate prior distributions for noise statistics, the inverse-Gamma distributions are employed to describe the dynamics of the noise variance parameters and a novel implementation to the PHD recursion is developed by representing the predicted and the posterior intensities as mixtures of Gaussian-inverse-Gamma terms. As the target state and the noise variance parameters are coupled in the likelihood functions, the variational Bayesian approximation approach is applied so that the posterior is derived in the same form as the prior and the resulting algorithm is recursive. A numerical example is provided to illustrate the effectiveness of the proposed filter.

关键词： Nickel

来源：评论

学校读者我要写书评

暂无评论

state estimation for jump Markov linear systems with uncompensated biases

State estimation for jump Markov linear systems with uncompe...

引用

American Control Conference

作者： Wenling Li Yingmin Jia Junping Du Jun Zhang Deyuan Meng Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing 100191 China. Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electronic and Information Engineering Beihang University (BUAA) Beijing 100191 China

ISBN: (纸本)9781479901777

This paper studies the problem of state estimation for jump Markov linear systems with uncompensated biases. By describing the state and the measurement biases as additive random variables, a suboptimal filter has been developed by applying the basic interacting multiple model (IMM) approach. To derive a precise representation of the biases contributions to the state estimation, three auxiliary matrices are introduced with respect to the correlation between the state estimation errors and the biases, which helps to derive mode-conditioned estimates in the framework of the IMM. A numerical example involving tracking a maneuvering target is provided to compare the performance of the proposed filter with that of the augmented state filter.

关键词： Jump Markov linear system Interacting multiple model Uncompensated bias state estimation Bias uncompensated maneuvering target Linear system interacting boson model Markov jump IMM

来源：评论

学校读者我要写书评

暂无评论

Finite-time consensus control for multiple manipulators with unmodeled dynamics

Finite-time consensus control for multiple manipulators with...

引用

American Control Conference

作者： Bin Zhang Yingmin Jia Junping Du Jun Zhang Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electronic and Information Engineering Beihang University (BUAA) Beijing 100191 China

ISBN: (纸本)9781479901777

This paper is devoted to the finite-time control problem for multiple manipulators, where unmodeled dynamics is taken into consideration. An effective coordinated control strategy is introduced, under which distributed protocols with continuous feedbacks are proposed. By applying the homogeneous theory for stability analysis, it is proven that the multi-robot system can be globally finite-time stabilized through our protocols. Numerical simulations on four manipulators with two degrees of freedom are presented to validate the effectiveness of the control strategy.

关键词： unmodeled dynamics control strategy Manipulators two degrees of freedom multi-robot systems Stability analysis distributed protocol

来源：评论

学校读者我要写书评

暂无评论

Boosting and margin theory

引用

Frontiers of Electrical and Electronic Engineering in China 2012年第1期7卷 127-133页

作者： Jufu FENG Liwei WANG Masashi SUGIYAMA Cheng YANG Zhi-Hua ZHOU Chicheng ZHANG Key Laboratory of Machine Perception MOE School of Electron- ics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Tokyo Institute of TechnologyTokyo 152-8552 Japan National Key Laboratory for Novel Software Technology NanjingUniversity Nanjing 210093 China

Many researchers have worked on the ex- planation of AdaBoost＇s good experimental results in theory. Some work give an upper bound of generaliza- tion error in terms of the margin distribution function, while Breiman gave a sharper generalization error bound based on minimum margin. He also developed the arc- gv algorithm to maximize the minimum margin, then made the minimum margin larger than AdaBoost. How- ever, its empirical results are even worse than AdaBoost. Therefore, is the minimum margin bound not practi- cal？ This paper gives a new concept called Equilibrium margin （Emargin） and proves a new generalization er- ror bound using Emargin, which is always better than minimum margin bound. In addition, we show Emargin is a good indicator of generalization. Then, we conduct experiments showing that the Emargin of AdaBoost is larger than arc-gv, but the generalization error of Ada- Boost is usually better.

关键词： boosting margin explanation generalization

来源：评论

学校读者我要写书评

暂无评论

Ant colony optimization with multi-agent evolution for detecting functional modules in protein-protein interaction networks

Ant colony optimization with multi-agent evolution for detec...

引用

3rd International Conference on Information Computing and Applications, ICICA 2012

作者： Ji, Junzhong Liu, Zhijun Zhang, Aidong Jiao, Lang Liu, Chunnian College of Computer Science and Technology Beijing University of Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing 100124 China Department of Computer Science and Engineering University at Buffalo State University of New York Buffalo NY 14260 United States

ISBN: (纸本)9783642340611

Functional module identification in a Protein-Protein Interaction (PPI) network is one of the most important and challenging tasks in computational biology. For detecting functional modules, it is difficult to solve the problem directly and always results in a low accuracy and a large discard rate. In this paper, we present a novel algorithm of ant colony optimization with multi-agent evolution for detecting functional modules. The proposed ACO-MAE algorithm enhances the performance of ant colony optimization (ACO) by incorporating multi-agent evolution (MAE). First, the ant colony optimization for solving Traveling Salesman Problems (TSP) is conducted to construct primary clustering results. Then, the multi-agent evolutionary process is performed to move out of local optima. From simulation results, it is shown that the proposed ACO-MAE algorithm has superior performance when compared to other existing algorithms. © 2012 Springer-Verlag.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：