No description available.

No description available.

International Telemetering Conference Proceedings / October 25-28, 1993 / Riviera Hotel and Convention Center, Las Vegas, Nevada / NASA Goddard Space Flight Center (GSFC) has developed a set of functional telemetry processing components based upon Very Large Scale Integration (VLSI) and Application Specific Integrated Circuits (ASIC). These components provide a framework for the assembly of telemetry data ground systems for space projects such as the Earth Observing System (EOS) and the Small Explorer (SMEX) mission series. Implementation of the ground systems for such projects using a common set of functional components has obvious cost benefits in both systems development and maintenance. Given the existence of these components, the next logical step is to utilize a similar approach and create a set of reusable software components for the implementation of telemetry data system monitoring and control functions. This paper describes a generalized set of software components, called the Telemetry Processing Control Environment (TPCE), which has been developed to fulfil this need. This combination of hardware and software components enables the rapid development of flexible, cost-effective telemetry processing systems capable of meeting the performance requirements facing NASA in the coming decade.

In this thesis, two methods are developed in an aid to help users capture valuable design information and knowledge and reuse them. They are the design pattern recovery (DPR) method and pattern-based redocumentation (PBR) method. The DPR method is for matching up metrics of patterns with patterns themselves in order to capture valuable design information. Patterns are used as a container for storing the information. Two new metrics, i.e., p-value and s-value are introduced. They are obtained by analysing product metrics statistically. Once patterns have been detected from a system, the system can be redocumented using these patterns. Some existing XML (extensible Markup Language) technologies are utilised in order to realise the PRB method. Next, a case study is carried out to validate the soundness and usefulness of the DPR method. Finally, some conclusions drawn from this research are summarised, and further work is suggested for the researchers in software engineering.

Yu-shan Chan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 95-99). / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- "Expert System, Expert System Shell, and ""MetaSystem""" --- p.2 / Chapter 1.2 --- Adopting OBJECTBASE In EXPERT SYSTEM SHELL(ESS) --- p.4 / Chapter 2. --- SURVEY ON EXISTING SYSTEMS --- p.7 / Chapter 2.1 --- Review of inference models --- p.7 / Chapter 2.1.1 --- The Classical Period --- p.9 / Chapter 2.1.2 --- The modern period --- p.11 / Chapter 2.2 --- Rules in Objectbase vs. other Representations --- p.12 / Chapter 2.2.1 --- Rule-based systems --- p.13 / Chapter 2.2.2 --- Object-oriented systems --- p.13 / Chapter 2.2.3 --- Other systems --- p.13 / Chapter 2.2.4 --- Rules embedded in object-- the Objectbase approach --- p.14 / Chapter 2.3 --- Conclusion --- p.15 / Chapter 3. --- DESIGN OF ESS FOR AN OBJECTBASE SYSTEM --- p.16 / Chapter 3.1 --- Introducing ESS in Objectbase --- p.18 / Chapter 3.1.1 --- The Concept of Object Modeling --- p.19 / Chapter 3.1.2 --- Why Objectbase? --- p.20 / Chapter 3.1.3 --- ESS : a higher layer on Objectbase --- p.22 / Chapter 3.1.4 --- Schema Objects and Shell Objects --- p.23 / Chapter 3.2 --- Module design of ESS --- p.24 / Chapter 3.2.1 --- Knowledge Representation Module --- p.25 / Chapter 3.2.2 --- Objectbase inference module --- p.27 / Chapter 3.2.3 --- The Rule一Inference Module --- p.28 / Chapter 3.3 --- Knowledge Representation --- p.29 / Chapter 3.3.1 --- Schema Knowledge & the Rulebase --- p.30 / Chapter 3.3.2 --- Rule Structure --- p.31 / Chapter 3.4 --- Inference Engine --- p.35 / Chapter 3.4.1 --- The Two Levels of Inference --- p.35 / Chapter 3.5 --- Rule一Inference (RI) --- p.37 / Chapter 3.5.1 --- Structural design of RI --- p.38 / Chapter 3.5.2 --- Drawing Inference --- p.39 / Chapter 3.5.3 --- Query Processor and RI --- p.42 / Chapter 3.5.4 --- RI and the Inference Engine(IE) --- p.43 / Chapter 3.6 --- Conclusion --- p.43 / Chapter 4. --- IMPLEMENTATION --- p.45 / Chapter 4.1 --- Rulelnference: a comprehensive structure --- p.46 / Chapter 4.1.1 --- Class Rule --- p.46 / Chapter 4.1.2 --- Class RuleList --- p.47 / Chapter 4.1.3 --- Accompany data structures for inference --- p.48 / Chapter 4.1.4 --- Class Rulelnference --- p.49 / Chapter 4.2 --- Rule Setting --- p.51 / Chapter 4.2.1 --- Rule Construction --- p.51 / Chapter 4.2.2 --- Rule Parsing and the Rule Definition Language (RDL) --- p.52 / Chapter 4.3 --- How Inference is done in ESS --- p.53 / Chapter 4.3.1 --- Reset and Load system --- p.53 / Chapter 4.3.2 --- Inference making --- p.54 / Chapter 4.4 --- Using RuleInference in the Rule Constructor --- p.58 / Chapter 4.4.1 --- The Rule Constructor --- p.59 / Chapter 4.5 --- Using Rulelnference in the Application Constructor --- p.60 / Chapter 4.5.1 --- The RiNode --- p.61 / Chapter 4.5.2 --- Schema and Rule Set Handling --- p.63 / Chapter 4.6 --- Conclusion --- p.64 / Chapter 5. --- CASE STUDY --- p.66 / Chapter 5.1 --- Background on Statement analysis --- p.66 / Chapter 5.1.1 --- Ratios for decision making --- p.68 / Chapter 5.2 --- Sample System: Financial Data Analysis System --- p.70 / Chapter 5.2.1 --- The FINANCE schema --- p.71 / Chapter 5.2.2 --- Rules --- p.73 / Chapter 5.2.3 --- Results --- p.75 / Chapter 5.3 --- Evaluation --- p.81 / Chapter 5.4 --- Conclusion --- p.82 / Chapter 6. --- RESULT AND DISCUSSION --- p.84 / Chapter 6.1 --- An Expert System Shell on Objectbase --- p.84 / Chapter 6.2 --- The ESS on MOBILE --- p.85 / Chapter 6.3 --- Pros and cons for the ESS --- p.86 / Chapter 6.4 --- MOBILE: how it has been improved --- p.87 / Chapter 7. --- CONCLUSION --- p.89 / Chapter 7.1 --- Comparison --- p.91 / Chapter 7.2 --- Appraisal --- p.92 / Chapter 8. --- REFERENCES --- p.95 / Table of Content for Appendixes / APPENDIX 1. RULE DEFINITION LANGUAGE --- p.100 / APPENDIX 2. THE CLASS RULEINFERENCE --- p.103 / APPENDIX 3. THE RINODE --- p.104 / APPENDIX 4. FINANCIAL STATEMENT ANALYSIS --- p.108 / APPENDIX 5. DATA STRUCTURE OF RULE AND RULELIST --- p.117 / APPENDIX 6. DATA STRUCTURE OF VARLIST AND ACTLIST --- p.118 / APPENDIX 7. DATA STRUCTURE OF RULEINFERENCE --- p.121

No description available.

by Frank Hing-Wah Luk. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 92-95). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- The Problem in Object-Oriented Database Indexing --- p.2 / Chapter 1.3 --- Contributions --- p.3 / Chapter 1.4 --- Thesis Organization --- p.4 / Chapter 2 --- Object-oriented Data Model --- p.5 / Chapter 2.1 --- Object-oriented Data Model --- p.5 / Chapter 2.2 --- Object and Object Identifiers --- p.6 / Chapter 2.3 --- Complex Attributes and Methods --- p.6 / Chapter 2.4 --- Class --- p.8 / Chapter 2.4.1 --- Inheritance Hierarchy --- p.8 / Chapter 2.4.2 --- Aggregation Hierarchy --- p.8 / Chapter 2.5 --- Sample Object-Oriented Database Schema --- p.9 / Chapter 3 --- Indexing in Object-Oriented Databases --- p.10 / Chapter 3.1 --- Introduction --- p.10 / Chapter 3.2 --- Indexing on Inheritance Hierarchy --- p.10 / Chapter 3.3 --- Indexing on Aggregation Hierarchy --- p.13 / Chapter 3.4 --- Indexing on Integrated Support --- p.16 / Chapter 3.5 --- Indexing on Method Invocation --- p.18 / Chapter 3.6 --- Indexing on Overlapping Path Expressions --- p.19 / Chapter 4 --- Triple Node Hierarchy --- p.23 / Chapter 4.1 --- Introduction --- p.23 / Chapter 4.2 --- Triple Node --- p.25 / Chapter 4.3 --- Triple Node Hierarchy --- p.26 / Chapter 4.3.1 --- Construction of the Triple Node Hierarchy --- p.26 / Chapter 4.3.2 --- Updates in the Triple Node Hierarchy --- p.31 / Chapter 4.4 --- Cost Model --- p.33 / Chapter 4.4.1 --- Storage --- p.33 / Chapter 4.4.2 --- Query Cost --- p.35 / Chapter 4.4.3 --- Update Cost --- p.35 / Chapter 4.5 --- Evaluation --- p.37 / Chapter 4.6 --- Summary --- p.42 / Chapter 5 --- Triple Node Hierarchy in Both Aggregation and Inheritance Hierarchies --- p.43 / Chapter 5.1 --- Introduction --- p.43 / Chapter 5.2 --- Preliminaries --- p.44 / Chapter 5.3 --- Class-Hierarchy Tree --- p.45 / Chapter 5.4 --- The Nested CH-tree --- p.47 / Chapter 5.4.1 --- Construction --- p.47 / Chapter 5.4.2 --- Retrieval --- p.48 / Chapter 5.4.3 --- Update --- p.48 / Chapter 5.5 --- Cost Model --- p.49 / Chapter 5.5.1 --- Assumptions --- p.51 / Chapter 5.5.2 --- Storage --- p.52 / Chapter 5.5.3 --- Query Cost --- p.52 / Chapter 5.5.4 --- Update Cost --- p.53 / Chapter 5.6 --- Evaluation --- p.55 / Chapter 5.6.1 --- Storage Cost --- p.55 / Chapter 5.6.2 --- Query Cost --- p.57 / Chapter 5.6.3 --- Update Cost --- p.62 / Chapter 5.7 --- Summary --- p.63 / Chapter 6 --- Decomposition of Path Expressions --- p.65 / Chapter 6.1 --- Introduction --- p.65 / Chapter 6.2 --- Configuration on Path Expressions --- p.67 / Chapter 6.2.1 --- Single Path Expression --- p.67 / Chapter 6.2.2 --- Overlapping Path Expressions --- p.68 / Chapter 6.3 --- New Algorithm --- p.70 / Chapter 6.3.1 --- Example --- p.72 / Chapter 6.4 --- Evaluation --- p.75 / Chapter 6.5 --- Summary --- p.76 / Chapter 7 --- Conclusion and Future Research --- p.77 / Chapter 7.1 --- Conclusion --- p.77 / Chapter 7.2 --- Future Research --- p.78 / Chapter A --- Evaluation of some Parameters in Chapter5 --- p.79 / Chapter B --- Cost Model for Nested-Inherited Index --- p.82 / Chapter B.1 --- Storage --- p.82 / Chapter B.2 --- Query Cost --- p.84 / Chapter B.3 --- Update --- p.84 / Chapter C --- Algorithm constructing a minimum auxiliary set of J Is --- p.87 / Chapter D --- Estimation on the number of possible combinations --- p.89 / Bibliography --- p.92

Experienced procedural programmers seem to have difficulty when transferring from a procedural language to an object-oriented language. The problem is how to assist the experienced procedural programmers to make this shift. The long term goal of this research is to identify areas where programmers have problems and to develop an automated system to help them overcome these difficulties. This study examines the class designs produced by procedural programmers and the effect of specifications and domain knowledge on class designs. Two types of specifications were used: those written from a procedural point of view which emphasized the functions and those written from an object-oriented view which highlights the domain entities. In addition, the problem specifications were selected from three different domains in order to assess the effect of domain familiarity. Data was collected using paper and pencil designs and through verbal protocols. The class designs were analyzed to see if the different types produced could be classified and to determine the effect of specification type and domain knowledge.

Software measurement has been of interest to software engineers for almost as long as software has been developed. While the evolution of systematic processes of software development has seen a trend away from reliance on the expertise of individual software developers alone to ensure software quality, systematic processes of software measure development have not evolved to a similar extent. The problem with defining software measures according to an informal process is that the quality of measures can be highly dependent on the expertise of the individual measure developers. If a systematic process of software measure development were defined, that promoted transparency and objectivity in measure development, then this systematic process could support the development of high quality measures by less expert users. In this thesis, a systematic process of software descriptive measure development is described and demonstrated. The approach taken to defining this systematic process is to investigate the various processes by which currently available software descriptive measures have been developed. These processes are then amalgamated with an established systematic method of measure development used in the field of social science. Applying the stages of measure development thus identified to the task of developing measures to describe C++ class and object modularity tests the feasibility of this measure development process. Insights gained through this testing provide feedback to further refine the process. In this way, a systematic process of descriptive software measure development is defined alongside the definition of a set of measures that provide a detailed description of the complex software characteristic of modularity. The products of each stage of this measure development process assist a user to validate the measures with respect to an intended application, and to analyse and interpret the measurement data obtained by applying the measures to a software system. This is demonstrated in a case study that also provides an indirect indication of the quality of the process by which the measures were developed. The major contribution of this work is the systematic process of descriptive software measure development, as it has a wide application and can be used to develop measures to describe many software characteristics of interest. A second important contribution is made by the set of measures of C++ class and object modularity developed to demonstrate this systematic descriptive measure development process.

We present a type-based approach to statically derive symbolic closed-form formulae that characterize the bounds of heap memory usages of programs written in object-oriented languages. Given a program with size and alias annotations, our inference system will compute the amount of memory required by the methods to execute successfully as well as the amount of memory released when methods return. The obtained analysis results are useful for networked devices with limited computational resources as well as embedded software. / Singapore-MIT Alliance (SMA)