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

A sufficient and necessary condition for the convergence of Böhm-like trees

Journal of Computational Information Systems 2012年第16期8卷 6851-6862页

作者： Hu, Haixing Wu, Nan Song, Fangmin State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China

In this paper, we introduce the definitions of Böhm-like trees and Böhm trees, and give a sufficient and necessary condition for the convergence of Böhm-like trees. It is shown that a Böhm-like tree is a Böhm tree of a lambda term if and only if it is recursively enumerable and has finite many free variables, but the convergence of a Böhm-like tree is undecidable. © 2012 Binary Information Press.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Timing analysis of scenario-based specifications using linear programming

引用

software Testing, Verification and Reliability 2013年第2期22卷

作者： Xuandong Li Minxue Pan Lei Bu Linzhang Wang Jianhua Zhao State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 People's Republic of China Department of Computer Science and Technology Nanjing University Nanjing 210093 People's Republic of China

Scenario-based specifications (SBSs), such as UML interaction models, offer an intuitive and visual way of describing design requirements, and are playing an increasingly important role in the design of software systems. This paper presents an approach to timing analysis of SBSs expressed by UML interaction models. The approach considers more general and expressive timing constraints in UML sequence diagrams (SDs), and gives a solution to the reachability analysis , constraint conformance analysis and bounded delay analysis problems, which reduces these problems into linear programs. With the synchronous interpretation of the SD compositions, the timing analysis algorithms in the approach form a decision procedure for a class of SBSs where any loop in any path is time-independent of the other parts in the path. These algorithms are also a semi-decision procedure for general SBSs with both the synchronous and asynchronous composition semantics. The approach also supports bounded timing analysis of SBSs, which investigates all the paths in the bound limit one by one, and performs the timing analysis for each finite path by linear programming. A tool prototype has been developed to support this approach. Copyright © 2010 John Wiley & Sons, Ltd.

关键词： real-time systems software verification model checking UML interaction models bounded delay analysis

来源：评论

学校读者我要写书评

暂无评论

Maximum volume clustering: a new discriminative clustering approach

引用

The Journal of Machine Learning Research 2013年第1期14卷

作者： Kevin Murphy Bernhard Schölkopf Gang Niu Bo Dai Lin Shang Masashi Sugiyama Google MPI for Intelligent Systems Department of Computer Science Tokyo Institute of Technology Tokyo Japan College of Computing Georgia Institute of Technology Atlanta GA State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

The large volume principle proposed by Vladimir Vapnik, which advocates that hypotheses lying in an equivalence class with a larger volume are more preferable, is a useful alternative to the large margin principle. In this paper, we introduce a new discriminative clustering model based on the large volume principle called maximum volume clustering (MVC), and then propose two approximation schemes to solve this MVC model: A soft-label MVC method using sequential quadratic programming and a hard-label MVC method using semi-definite programming, respectively. The proposed MVC is theoretically advantageous for three reasons. The optimization involved in hard-label MVC is convex, and under mild conditions, the optimization involved in soft-label MVC is akin to a convex one in terms of the resulting clusters. Secondly, the soft-label MVC method possesses a clustering error bound. Thirdly, MVC includes the optimization problems of a spectral clustering, two relaxed k-means clustering and an information-maximization clustering as special limit cases when its regularization parameter goes to infinity. Experiments on several artificial and benchmark data sets demonstrate that the proposed MVC compares favorably with state-of-the-art clustering methods.

关键词： clustering error bound discriminative clustering finite sample stability large volume principle semi-definite programming sequential quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised vehicle recognition: An approximate region constrained approach

Semi-supervised vehicle recognition: An approximate region c...

引用

7th International Conference on Rough Sets and Knowledge technology, RSKT 2012

作者： Zhao, Rui Wei, Zhihua Miao, Duoqian Wu, Yan Mei, Lin Department of Computer Science and Technology Tongji University 201804 Shanghai China Third Research Institute Ministry of Public Security 201204 Shanghai China State Key Laboratory for Novel Software Technology Nanjing University 210093 Nanjing China

ISBN: (纸本)9783642318993

Semi-supervised learning attracts much concern because it can improve classification performance by using unlabeled examples. A novel semi-supervised classification algorithm SsL-ARC is proposed for real-time vehicle recognition. It makes use of the prior information of object vehicle moving trajectory as constraints to bootstrap the classifier in each iteration. Approximate region interval of trajectory are defined as constraints. Experiments on real world traffic surveillance videos are performed and the results verify that the proposed algorithm has the comparable performance to the state-of-the-art algorithms. © 2012 Springer-Verlag.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Transductive prostate segmentation for CT image guided radiotherapy

Transductive prostate segmentation for CT image guided radio...

引用

3rd International Workshop on Machine Learning in Medical Imaging, MLMI 2012, Held in conjunction with the 15th International Conference on Medical Image Computing and computer-Assisted Intervention, MICCAI 2012

作者： Shi, Yinghuan Liao, Shu Gao, Yaozong Zhang, Daoqiang Gao, Yang Shen, Dinggang State Key Laboratory for Novel Software Technology Nanjing University China Department of Radiology and BRIC UNC Chapel Hill United States Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics China

ISBN: (纸本)9783642354274

Accurate 3-D prostate segmentation is a significant and challenging issue for CT image guided radiotherapy. In this paper, a novel transductive method for 3-D prostate segmentation is proposed, which incorporates the physician's interactive labeling information, to aid accurate segmentation, especially when large irregular prostate motion occurs. More specifically, for the current treatment image, the physician is first asked to manually assign the labels for a small subset of prostate and non-prostate (background) voxels, especially in the first and last slices of the prostate regions. Then, transductive Lasso (tLasso) is proposed to select the most discriminative features slice-by-slice. With the selected features, our proposed weighted Laplacian regularized least squares (wLapRLS) is adopted to predict the prostate-likelihood for each remaining unlabeled voxel in the current treatment image. The final segmentation result is obtained by aligning the manually segmented prostate regions of the planning and previous treatment images, onto the estimated prostate-likelihood map of the current treatment image for majority voting. The proposed method has been evaluated on a real prostate CT dataset including 11 patients with more than 160 images, and compared with several state-of-the-art methods. Experimental results indicate that the promising results can be achieved by our proposed method. © 2012 Springer-Verlag.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Testing aspect-oriented programs with finite state machines

Testing aspect-oriented programs with finite state machines

引用

作者： Xu, Dianxiang El-Ariss, Omar Xu, Weifeng Wang, Linzhang National Center for the Protection of the Financial Infrastructure Dakota State University Madison SD 57042 United States Department of Computer Science North Dakota State University Fargo ND 58105 United States Computer Science Department Gannon University Erie PA 16541 United States State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China

Aspect-oriented programming yields new types of programming faults due to the introduction of new constructs for dealing with crosscutting concerns. To reveal aspect faults, this paper presents a framework for testing whether or not aspect-oriented programs conform to their state models. It supports two families of strategies (i.e. structure-oriented and property-oriented) for automated generation of aspect tests from aspect-oriented state models. A structure-oriented testing strategy derives tests and test code from an aspect-oriented state model to meet a given structural coverage criterion, such as state coverage, transition coverage, or round trip. A property-oriented testing strategy generates test code from the counterexamples of model checking. Two such strategies are checking an aspect-oriented state model against trap properties and checking mutants of aspect models against system properties. Mutation analysis of aspect-oriented programs is used to evaluate the effectiveness of these testing strategies. The experiments demonstrate that testing aspect-oriented programs against their state models can detect many aspect faults. The comparative evaluations also reveal that the structure-oriented and property-oriented testing strategies complement each other-some aspect faults were detected by the structure-oriented strategies, but not by the property-oriented strategies and vice versa. Copyright © 2010 John Wiley & Sons, Ltd.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A survey on algorithm adaptation in evolutionary computation

引用

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

作者： Jun ZHANG Wei-Neng CHEN Zhi-Hui ZHAN Wei-Jie YU Yuan-Long LI Ni CHEN Qi ZHOU Department of Computer Science Sun Yat-sen UniversityGuangzhou 51027.5 China Key Laboratory of Digital Life Ministry of Education Cluangzhou510275 China Key Laboratory of Software Technology Education Departmentof Guangdong Province Guangzhou 510275 China

Evolutionary computation （EC） is one of the fastest growing areas in computer science that solves intractable optimization problems by emulating biologic evolution and organizational behaviors in nature. To de- sign an EC algorithm, one needs to determine a set of algorithmic configurations like operator selections and parameter settings. How to design an effective and ef- ficient adaptation scheme for adjusting the configura- tions of EC algorithms has become a significant and promising research topic in the EC research community. This paper intends to provide a comprehensive survey on this rapidly growing field. We present a classification of adaptive EC （AEC） algorithms from the perspective of how an adaptation scheme is designed, involving the adaptation objects, adaptation evidences, and adapta- tion methods. In particular, by analyzing tile popula- tion distribution characteristics of EC algorithms, we discuss why and how the evolutionary state information of EC can be estimated and utilized for designing ef- fective EC adaptation schemes. Two AEC algorithms using the idea of evolutionary state estimation, includ- ing the clustering-based adaptive genetic algorithm and the adaptive particle swarm optimization algorithm are presented in detail. Some potential directions for the re- search of AECs are also discussed in this paper.

关键词： evolutionary algorithm （EA） evolution- ary computation （EC） algorithm adaptation parameter control

来源：评论

学校读者我要写书评

暂无评论

The equivalence property of max margins

引用

作者： Pan, Meiqin Ding, Zhijun College of International Business Shanghai International Studies University Shanghai China Department of Computer Science and Technology Tongji University Shanghai China State Key Laboratory of Software Engineering Wuhan University Wuhan China

ISBN: (纸本)9783642037177

The equivalence property of vector dual norms is shown by introducing the definition of dual norm and the equivalence of vector norms. Basing on arbitrary norm projection on a plane, the equivalence property of max margins on three kinds of norms is proved in this paper. At last, the optimization question and dual question in three general kinds norm of SVM are given, and their applied scope are also proposed. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Measurement and analysis of plant leaf area based on image processing

Measurement and analysis of plant leaf area based on image p...

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Wang, Jingwen Liu, Hong Department of Information Science and Engineering Shandong Normal University Ji'nan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Ji'nan China

ISBN: (纸本)9781467321068

To improve the accuracy of plant leaf area, a new measurement method of plant leaf area based on Snake model was adopted in this study. In this paper, we captured leaf counter with improved Snake model, built up 8-direction chain codes table, calculated the leaf area with the pixels in leaf contour, and visualized the statistical results with area histogram. This method was proved to be more accurate than prevalent method in this study as well, which has good potentials for practical applications. © 2012 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Distribution-aware mutation analysis

Distribution-aware mutation analysis

引用

36th Annual IEEE International computer software and Applications Conference Workshops, COMPSACW 2012

作者： Sun, Chang-Ai Wang, Guan Cai, Kai-Yuan Chen, Tsong Yueh School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Department of Automatic Control Beijing University of Aeronautics and Astronautics Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Science Beijing China Facuity of Information and Communication Technologies Swinburne University of Technology Melbourne VIC Australia

ISBN: (纸本)9780769547589

Mutation analysis is widely employed to evaluate the effectiveness of various software testing techniques. In most situations, mutation operators are uniformly applied to the original programs, while the faults tend to be clustered in practice. This may result in the inappropriate simulation of faults, and thus cannot deliver the reliable evaluation results. To overcome this, we propose a distribution-aware mutation analysis technique and conducted empirical studies to investigate the impact of the mutation distribution on the effectiveness evaluation of testing techniques. As an illustration, we select the commonly practiced random testing technique and two versions of dynamic random testing techniques and apply them to testing Web services. Results of empirical studies suggest that the mutation distribution significantly affects the evaluation results. This observation further indicates that the effectiveness of testing techniques previously evaluated with the uniform mutation analysis needs further realignments. © 2012 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：