A Component-Based Software Configuration Management Model and Its Supporting System

Software configuration management(SCM)is an important key technology in software development.Component-based software development (CBSD)is an emerging paradigm in software development.However,to apply CBSD effectively in real world practice,supporting SCM in CBSD needs to be further investigated.In this paper,the objects that need to be managed in CBSD is analyzed and a component-based SCM model is presented.In this model,Components,as the integral logical constituents in a system,are managed as the basic configuration items in SCM,and the relationships between/among components are defined and maintained.Based on this model.a configuration management system is implemented.     

一种优化的面向对象软件复杂性度量方法

首先结合面向对象技术特性,对面向对象软件类级别的CK度量方法和系统级别的MOOD度量方法进行了分析,并就CK度量提出了优化的度量方法OCK。然后结合OCK度量和MOOD度量的优点提出了较优化的面向对象软件复杂性度量方法OSCM。OSCM度量可以有效地弥补CK度量和MOOD度量的不足,优化度量结果。     

An Algebraic Hardware/Software Partitioning Algorithm

Hardware and software co-design is a design technique which delivers computer systems comprising hardware and software components.A critical phase of the co-design process is to decompose a program into hardware and software .This paper proposes an algebraic partitioning algorithm whose correctness is verified in program algebra.The authors inroduce a program analysis phase before program partitioning and deveop a collection of syntax-based splitting rules.The former provides the information for moving operations from software to hardware and reducing the interaction between compoents,and th latter supports a compositional approach to program partitioning.     

面向对象软件覆盖度量的研究和软件测试工具的实现

面向对象软件测试技术的研究是面向对象方法不可缺少的一环，但是面对面向对象技术所引入的新特点，传统的测试技术已经无法有效地进行测试。因此，结合传统的测试技术，提出了一种新的面向对象软件覆盖度量-基于段的面向对象覆盖度量（object-oriented segment coverage），解决了传统的覆盖度量没有考虑到继承和多态等语言特征对面向对象软件软件测试过程的影响的不足，可以比传统的结构化覆盖度量获得更精确的测试覆盖数据。同时，还分析了一个已实现的、具有高度可重用性和灵活性的面向多种OO语言的测试工具的系统结构。     

Efficient Incremental Maintenance of Frequent Patterns with FP-Tree

Mining frequent patterns has been studied popularly in data mining area. However, little work has been done on mining patterns when the database has an influx of fresh data constantly. In these dynamic scenarios, efficient maintenance of the discovered patterns is crucial. Most existing methods need to scan the entire database repeatedly, which is an obvious disadvantage. In this paper, an efficient incremental mining algorithm, Incremental-Mining (IM), is proposed for maintenance of the frequent patterns when new incremental data come. Based on the frequent pattern tree (FP-tree) structure, IM gives a way to make the most of the things from the previous mining process, and requires scanning the original data once at most. Furthermore, IM can identify directly the differential set of frequent patterns, which may be more informative to users. Moreover, IM can deal with changing thresholds as well as changing data, thus provide a full maintenance scheme. IM has been implemented and the performance study shows it outperforms three other incremental algorithms: FUP, DB-tree and re-running frequent pattern growth (FP-growth).     

完善验证的凝聚力测量方法以提升软件品质

无适当使用软件测量将可能引起软件低品质且高成本的窘态.凝聚力是软件品质重要因子之一如同维护度,可靠度和再利用度.软件模组品质的优劣必影响整体系统之品质的优劣.为了设计和维护高品质软件,软件专案经理人和软件工程师无可避免需引用软件凝聚力测量以衡量和产生高品质软件.提出以活路跃变量及视觉化变量纵距为分析基础之功能导向凝聚力测量方法.进而,以一系列实际案例来作实验验证,并以一组性质来作理论辩证所提的测量方法.因此一经完善定义,完善实验和完善辩证之凝聚力测量方法被提出用于当软件凝聚力强度的指标和因此增进软件品质.这凝聚力测量方法能容易嵌入CASE以帮助软件工程师确保软件品质.     

面向对象软件度量的分析和研究

软件度量学是软件工程的一个新分支,通过度量反馈的信息来控制开发过程,以提高软件质量。传统的面向过程的软件将数据和操作分离,强调以算法为核心。近年来发展起来的面向对象软件的主要特性包括抽象性、封装性、继承性和多态性,将数据和操作封装,强调以对象为核心。因此面向对象软件度量方法也随之发展起来,著名的是C&K度量方法。还介绍了面向对象的软件可重用性的度量方法。并对面向对象软件的下一步研究阐述了看法。     

面向对象软件度量的研究

软件度量是提高和保证软件质量的关键。在给出的面向对象软件度量的结构模型基础上,讨论了实现该模型要解决的关键问题。通过度量结果的分析和评价,能够有效地对面向对象软件的测试和提高软件质量提供科学的依据。     

A Transactional Asynchronous Replication Scheme for Mobile Database Systems

In mobile database systems,mobility of users has a significant impact on data replication.As a result,the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable To solve this problem,a new mobile database replication scheme,the Transaction-Level Result-Set Propagation(TLRSP)model,is put forward in this paper,The conflict dectction and resolution strategy based on TLRSP is discussed in detail,and the implementation algorithm is proposed,In order to compare the performance of the TLRSP model with that of other mobile replication schemes,we have developed a detailde simulation model.Experimantal results show that the TLRSP model provides an effcient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency.     

青鸟构件库的构件度量

对软件产业发展所需要的软件生产率和软件质量的重视引起了对软件复用技术的研究,同时,有关复用度量的研究和应用也引起了广泛的重视.青鸟构件库系统可以对可复用构件进行描述、管理、存储和检索,用以满足基于“构件-构架”复用的软件开发过程的需要.该文介绍了青鸟构件库中的构件度量模型,并阐述了利用青鸟程序分析系统中的面向对象度量工具和青鸟构件库后期度量系统(包括反馈信息的收集、处理和分析工具)来实现模型的方法.     

基于继承图的面向对象软件复杂性度量研究

面向对象软件开发是一种新的可以减少成本、提高可用性和灵活性的高效的软件系统开发方法。复杂性度量在软件开发中起着非常重要的作用,它可减少整个开发周期的费用,但目前还没有成熟的用于面向对象软件复杂性的度量方法。文章首先通过继承图描述面向对象软件复杂性度量方法,然后讨论了单元重复继承算法,最后给出了具体实例。     

An Investigation into the Applicability and Validity of Object-Oriented Design Metrics

In this paper we consider empirical evidence in support of a set of object-oriented software metrics. In particular, we look at the object oriented design metrics of Chidamber and Kemerer, and their applicability in different application domains.We briefly describe the metrics, and present our empirical findings, arising from our analysis of systems taken from a number of different application domains. Our investigations have led us to conclude that a subset of the metrics can be of great value to software developers, maintainers and project managers.     

Formal Ontology: Foundation of Domain Knowledge Sharing and Reusing

Domain analysis is the activity of identifying and representing the relevant information in a domain,so that the information can be shared and reused in similar systems.But until now,no efficient approaches are available for capturing and representing the results of domain analysis and then for sharing and reusing the domain knowledge.This paper proposes an ontology-oriented approach for formalizing the domain models.The architecture for the multiple-layer structure of the domain knowledge base is also discussed.And finally,some genetic algorithm-based methods have been given for supporting the knowledge sharing and reusing.     

The faster higher-order cellular automaton for hyper-parallel undistorted data compression

This paper defines second-order and third-order permutation global functions and presents the corresponding higher-order cellular automaton approach to the hyper-parallel undistorted data compression.The genetic algorithm is successfully devoted to finding out all the correct local compression rules for the higher-order cellualr automaton.The correctness of the higher-order compression rules,the time complexity,and the systolic hardware implementation issue are discussed.In comparison with the first-order automation method reported,the proposed higher-order approach has much faster compression speed with almost the same degree of cellular structure complexity for hardware implementation.     

Java语言的度量及工具实现

简述了面向对象软件度量的最新进展,并设计和实现了基于目前流行的Ｃ＆Ｋ度量方法的Ｊａｖａ语言度量工具。     

面向对象软件度量阈值的确定方法: 问题、进展与挑战

面向对象软件度量是理解和保证面向对象软件质量的重要手段之一.通过将面向对象软件的度量值与其阈值比较,可简单直观评价其是否有可能包含缺陷.确定度量阈值方法主要有基于数据分布特征的无监督学习方法和基于缺陷相关性的有监督学习方法.两类方法各有利弊:无监督学习方法无需标签信息而易于实现,但所得阈值的缺陷预测性能通常较差;有监督学习方法通过机器学习算法提升所得阈值的缺陷预测性能,但标签信息在实际过程中不易获得且度量与缺陷链接技术复杂.近年来,两类方法的研究者不断探索并取得较大进展.同时,面向对象软件度量阈值确定方法研究仍存在一些亟待解决的挑战.对近年来国内外学者在该领域的研究成果进行系统性的总结.首先,阐述面向对象软件度量阈值确定方法的研究问题.其次,分别从无监督学习方法和有监督学习方法总结相关研究进展,并梳理具体的理论和实现的技术路径.然后,简要介绍面向对象软件度量阈值的其他相关技术.最后,总结当前该领域研究过程面临的挑战并给出建议的研究方向.     

A metamodel for modeling system features and their refinement, constraint and interaction relationships

This paper presents a metamodel for modeling system features and relationships between features. The underlying idea of this metamodel is to employ features as first-class entities in the problem space of software and to improve the customization of software by explicitly specifying both static and dynamic dependencies between system features. In this metamodel, features are organized as hierarchy structures by the refinement relationships, static dependencies between features are specified by the constraint relationships, and dynamic dependencies between features are captured by the interaction relationships. A first-order logic based method is proposed to formalize constraints and to verify constraints and customization. This paper also presents a framework for interaction classification, and an informal mapping between interactions and constraints through constraint semantics. Hong Mei received the BSc and MSc degrees in computer science from the Nanjing University of Aeronautics and Astronautics (NUAA), China, in 1984 and 1987, respectively, and the PhD degree in computer science from the Shanghai Jiao Tong University in 1992. He is currently a professor of Computer Science at the Peking University, China. His current research interests include Software Engineering and Software Engineering Environment, Software Reuse and Software Component Technology, Distributed Object Technology, and Programming Language. He has published more than 100 technical papers. Wei Zhang received the BSc in Engineering Thermophysics and the MSc in Computer Science from the Nanjing University of Aeronautics and Astronautics (NUAA), China, in 1999 and 2002, respectively. He is currently a PhD student at the School of Electronics Engineering and Computer Science of the Peking University, China. His research interests include feature-oriented requirements modeling, feature-driven software architecture design and feature-oriented software reuse. Haiyan Zhao received both the BSc and the MSc degree in Computer Science from the Peking Univeristy, China, and the Ph.D degree in Information Engineering from the University of Tokyo, Japan. She is currently an associate professor of Computer Science at the Peking University, China. Her research interests include Software Reuse, Domain Engineering, Domain Specific Languange and Program Transformation.     

Automated object-oriented reusable component identification

An automated tool to assist in the understanding of legacy code can be useful both in the areas of software reuse and software maintenance. Most previous work in this area has concentrated on functionally-oriented code. Whereas object-oriented code has been shown to be inherently more reusable than functionally-oriented code, in many cases the eventual reuse of the object-oriented code was not considered during development. This paper describes an approach that makes preparing existing object-oriented code for reuse easier and more quantifiable. This problem includes two primary sub-problems: understanding the function of components, and applying an appropriate set of metrics to the components to quantify reusability.The research described in this paper addresses an approach to the automated understanding of object-oriented code. A knowledge-based system that implements the approach is described. This paper also briefly discusses the formulation of reusability metrics for object-oriented code.     

Handling non-canonical software requirements based on Annotated Predicate Calculus

Eliciting requirements for a proposed system inevitably involves the problem of handling undesirable information about customer's needs, including inconsistency, vagueness, redundancy, or incompleteness. We term the requirements statements involved in the undesirable information non-canonical software requirements. In this paper, we propose an approach to handling non-canonical software requirements based on Annotated Predicate Calculus (APC). Informally, by defining a special belief lattice appropriate for representing the stakeholder's belief in requirements statements, we construct a new form of APC to formalize requirements specifications. We then show how the APC can be employed to characterize non-canonical requirements. Finally, we show how the approach can be used to handle non-canonical requirements through a case study. Kedian Mu received B.Sc. degree in applied mathematics from Beijing Institute of Technology, Beijing, China, in 1997, M.Sc. degree in probability and mathematical statistics from Beijing Institute of Technology, Beijing, China, in 2000, and Ph.D. in applied mathematics from Peking University, Beijing, China, in 2003. From 2003 to 2005, he was a postdoctoral researcher at Institute of Computing Technology, Chinese Academy of Sciences, China. He is currently an assistant professor at School of Mathematical Sciences, Peking University, Beijing, China. His research interests include uncertain reasoning in artificial intelligence, knowledge engineering and science, and requirements engineering. Zhi Jin was awarded B.Sc. in computer science from Zhejiang University, Hangzhou, China, in 1984, and studied for her M.Sc. in computer science (expert system) and her Ph.D. in computer science (artificial intelligence) at National Defence University of Technology, Changsha, China. She was awarded Ph.D. in 1992. She is a senior member of China Computer Federation. She is currently a professor at Academy of Mathematics and System Sciences, Chinese Academy of Science. Her research interests include knowledge-based systems, artificial intelligence, requirements engineering, ontology engineering, etc. Her current research focuses on ontology-based requirements elicitation and analysis. She has got about 60 papers published, including co-authoring one book. Ruqian Lu is a professor of computer science of the Institute of Mathematics, Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He designed the “Tian Ma” software systems that have been widely applied in more than 20 fields, including the national defense and the economy. He has won two first class awards from Chinese Academy of Sciences and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Lookeng Prize for Mathematics. Yan Peng received B.Sc. degree in software from Jilin University, Changchun, China, in 1992. From June 2002 to December 2005, he studied for his M.E. in software engineering at College of Software Engineering, Graduate School of Chinese Academy of Sciences, Beijing, China. He was awarded M.E degree in 2006. He is currently responsible for CRM (customer relationship management) and BI (business intelligence) project in the BONG. His research interests include customer relationship management, business intelligence, data ming, software engineering and requirements engineering.     

基于面向对象系统的质量度量模型PMMSQ的设计和实现

本文首先从软件质量度量的角度出发,阐述了软件质量度量的理论与方法,介绍了ISO9126模型;针对已有软件质量度量模型中存在的问题,提出了一个适合于软件质量度量实践的实用软件质量度量模型（PMMSQ）,并详细介绍了面向对象系统软件质量度量的步骤;最后,根据PMMSQ模型完成了软件度量活动的核心工作--对象特征集存储库的设
计和实现。