Ma Chak Kei. / Thesis submitted in: July 2002. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 97-101). / Abstracts in English and Chinese. / ABSTRACT --- p.II / ACKNOWLEDGEMENTS --- p.VI / TABLE OF CONTENTS --- p.VII / LIST OF TABLES --- p.XI / LIST OF FIGURES --- p.XIII / Chapter CHAPTER 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Addressing and Manipulating XML Data --- p.1 / Chapter 1.2 --- The Structured-Element Object Model (SEOM) --- p.3 / Chapter 1.3 --- Relate Research --- p.4 / Chapter 1.4 --- Contribution --- p.5 / Chapter 1.5 --- Thesis Overview --- p.6 / Chapter CHAPTER 2. --- BACKGROUND TECHNOLOGIES --- p.7 / Chapter 2.1 --- Overview of XML --- p.7 / Chapter 2.1.1. --- XML Basic Syntax --- p.8 / Chapter 2.1.2. --- Namespaces in XML --- p.8 / Chapter 2.2 --- Overview of XML Schema --- p.9 / Chapter 2.2.1. --- W3C XML Schema --- p.10 / Chapter 2.2.2 --- ", Schema Alternatives" --- p.13 / Chapter 2.3 --- Overview of XPath --- p.13 / Chapter 2.4 --- Overview of DOM --- p.15 / Chapter CHAPTER 3. --- OVERVIEW OF STRUCTURED-ELEMENT OBJECT MODEL (SEOM) --- p.18 / Chapter 3.1 --- Introduction --- p.18 / Chapter 3.2 --- Objectives --- p.20 / Chapter 3.3 --- General Concepts in SEOM --- p.21 / Chapter 3.3.1. --- Data Representation --- p.21 / Chapter 3.3.2. --- Data Binding --- p.24 / Chapter 3.3.3. --- Data Access --- p.25 / Chapter CHAPTER 4. --- SEOM DOCUMENT MODELING --- p.27 / Chapter 4.1 --- Data Modeling --- p.27 / Chapter 4.1.1. --- Simple XML Data Model --- p.28 / Chapter 4.1.2. --- SEOM Data Model --- p.32 / Chapter 4.2 --- Schema Modeling --- p.41 / Chapter 4.2.1. --- SEOM Schema --- p.42 / Chapter 4.2.2. --- Creating a Schema --- p.46 / Chapter CHAPTER 5. --- SEOM DOCUMENT PROCESSING --- p.51 / Chapter 5.1 --- SEOM Document Processing --- p.51 / Chapter 5.2 --- The Classes --- p.51 / Chapter 5.2.1. --- SEOM Document Class --- p.52 / Chapter 5.2.2. --- A bstract SElement Class --- p.55 / Chapter 5.2.3. --- Generic SElement Class --- p.56 / Chapter 5.2.4. --- Implementation SElement Classes --- p.57 / Chapter 5.3 --- XML Parsing and Data Binding --- p.59 / Chapter 5.3.1. --- Parsing Process --- p.60 / Chapter 5.4 --- Querying --- p.62 / Chapter 5.4.1. --- Query Wrapper and Result Wrapper --- p.62 / Chapter 5.4.2. --- Embedding in XPath --- p.68 / Chapter CHAPTER 6. --- AN WEB-BASED SEOM DOCUMENT QUERY SYSTEM --- p.71 / Chapter 6.1 --- Web-based SEOM Document Query System --- p.71 / Chapter 6.2 --- Client-Server Architecture --- p.71 / Chapter 6.3 --- The Server --- p.74 / Chapter 6.3.1. --- Data Loading --- p.74 / Chapter 6.3.2. --- Implemented SElement - R-Tree --- p.74 / Chapter 6.3.3. --- Network Interface --- p.80 / Chapter 6.4 --- Client Side --- p.82 / Chapter 6.4.1. --- The Interface --- p.82 / Chapter 6.4.2. --- Programmatic Controls --- p.85 / Chapter CHAPTER 7. --- EVALUATION --- p.88 / Chapter 7.1 --- Experiment with Synthetic Data --- p.88 / Chapter 7.2 --- Qualitative Comparison --- p.90 / Chapter 7.3 --- Advantages --- p.91 / Chapter 7.4 --- Disadvantages --- p.92 / Chapter 7.5 --- Means of Enhancement --- p.93 / Chapter CHAPTER 8. --- CONCLUSION --- p.94 / BIBLIOGRAPHY --- p.97

The PEREAM system is a software engineering environment that supports the design and implementation of object-oriented software components. Software development in the system is accomplished by the continuous evolution of a concept from an early specification to a final implementation. PEREAM supports the ability to incrementally specify software components. It provides for the reusing, browsing, and editing of the software components at any stage of their development history. Concepts in the PEREAM system are modeled with a uniform data structure. The development of the software components is maintained in a graph structure. The concepts are manipulated using the Smalltalk-80 Class Browser or the PEREAM GRAPHICAL EDITOR. This thesis describes the concepts and design behind the PEREAM system and the PEREAM MODELING TECHNIQUE. It also discusses the design and implementation of a graphical editor for the PEREAM environment which manipulates the software components graphically.

Declarative visual programming languages (VPLs), including spreadsheets, make up a large portion of both research and commercial VPLs. Spreadsheets in particular enjoy a wide audience, including end users. Unfortunately, spreadsheets and most other declarative VPLs still suffer from some of the problems that have been solved in other languages, such as ad-hoc (cut-and-paste) reuse of code which has been remedied in object-oriented languages, for example, through the code-reuse mechanism of inheritance. We believe spreadsheets and other declarative VPLs can benefit from the addition of an inheritance-like mechanism for fine-grained code reuse. This dissertation first examines the opportunities for supporting reuse inherent in declarative VPLs, and then introduces similarity inheritance and describes a prototype of this model in the research spreadsheet language Forms/3. Similarity inheritance is very flexible, allowing multiple granularities of code sharing and even mutual inheritance; it includes explicit representations of inherited code and all sharing relationships, and it subsumes the current spreadsheet mechanisms for formula propagation, providing a gradual migration from simple formula reuse to more sophisticated uses of inheritance among objects. Since the inheritance model separates inheritance from types, we investigate what notion of types is appropriate to support reuse of functions on different types (operation polymorphism). Because it is important to us that immediate feedback, which is characteristic of many VPLs, be preserved, including feedback with respect to type errors, we introduce a model of types suitable for static type inference in the presence of operation polymorphism with similarity inheritance. / Graduation date: 1999

Thesis (Ph.D.)--Memorial University of Newfoundland, 2005. / Bibliography: leaves 246-251.

Thesis (Ph.D.)--University of Hong Kong, 1998. / Includes bibliographical references. Also available in print.

An active object system is a transition-based object-oriented system suitable for the design of various concurrent systems. An AOS consists of a collection of interacting objects, where the behavior of each object is determined by the transition statements provided in the class of that object. A transition statement is a condition-action pair, an equational assignment statement, or an event routine. The transition statements provided for each object can access, besides the state of that object, the states of the other objects known to it through its interface variables. Interface variables are bound to objects when objects are instantiated so that desired connections among objects are established. The major benefit of the AOS approach is that an active system can be hierarchically composed from its active software components as if it were a hardware system. An AOS provides better encapsulation and more flexible communication protocols than ordinary object oriented systems, since control within an AOS is localized. / Graduation date: 1992

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 288-291). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2004. / Zhu, Donghua, Committee Member ; Cozzens, Susan, Committee Member ; Huo, Xiaoming, Committee Member ; Porter, Alan, Committee Chair ; Lu, Jye-Chyi, Committee Member. Vita. Includes bibliographical references (leaves 191-195).

Thesis (M. Sc.)--York University, 2001. / Typescript. Includes bibliographical references (leaves 164-167). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ66388.

published_or_final_version / abstract / toc / Computer Science / Master / Master of Philosophy