This thesis sets out to answer three simple questions: What tools are available for novice programmers to program GUIs? Are those tools fulfilling their role? Can anything be done to make better tools? Despite being simple questions, the answers are not so easily constructed. In answering the first question, it was necessary to examine the range of tools available and decide upon criteria which could be used to identify tools aimed specifically at the novice programmer (there being no currently agreed criteria for their identification). Having identified these tools, it was then necessary to construct a framework within which they could be sensibly compared. The answering of the second question required an investigation of what were the successful features of current tools and which features were less successful. Success or failure of given features was determined by research in both programming language design and studies of programmer satisfaction. Having discovered what should be retained and discarded from current systems, the answering of the third question required the construction of new systems through blending elements from visual languages, program editors and fourth generation languages. These final prototypes illustrate a new way of thinking about and constructing the next generation of GUI programming languages for the novice.

Approved for public release; distribution is unlimited / The purpose of this research is to define a centralized database containing all necessary information related to the daily management in an industrial and commercial organization that is publicly owned and equipped with civil personality and financial autonomy. The system is composed of the following subsystems: o Subsystem "Human resource management" o Subsystem "Provisioning" o Subsystem "Financial, budgetary and accounting management" The three subsystems should be installed in a central site and at regional sites. Each site will have its own database. The central database will be supplied with the data, which come from the other sites at the end of the day or according to need via modems. It is necessary to develop a tool for remote database queries in order to accomplish this work. The platform on which the application must be executed is IBM-INFORMIX running on top of the WINDOWS operating system. The database will be a relational database. The framework used in the design and modeling consists of: o Object Oriented Analysis (OOA), which enables the development of high quality software by defining the problem structure. o The Delphi Language, which provides a robust development environment. The installation of the solution will be executed according to the following scenario: o Client/Server architecture with the object oriented development tool DELPHI. o The database will be installed on the central and regional servers. o The application will be installed on the end users' stations. o Data access will be through an open ODBC. This software will present an integrated solution that will provide centralized and accurate data, so that data will be used to derive the right decision at the best time. / Major, Tunisian Army

Approved for public release; distribution is unlimited / The purpose of this thesis is to develop a prototype web-enabled database to improve the process flow of data collection and manipulation in support of Army aviation operations. Data collection is focused around routine aviation operations and aviation maintenance with the intention of identifying a feasible replacement for the existing redundant manual and automated collection procedures. The web interface has the potential to reduce the logistical burden on unit's data collection procedures and provides tailorable, near real time information about aircraft maintenance status, individual training, and unit training to decision makers at all levels as a decision support tool. This thesis will describe the design considerations for a web-enabled database to include the development of detailed data and process models. / Major, United States Army

Approved for public release; distribution is unlimited / This thesis explores the Bahrain Defense Force (BDF) needs for a decision support system in the area of analyzing, establishing and maintaining the organizational structures of BDF units. It also identifies the BDF measures that must be taken to qualify a certain unit structure. Subsequently, the thesis designs and develops a specific DSS prototype that can aid BDF decision makers and planners perspectives in this area. Creating this prototype has involved three different layers to be investigated: the data, the models and the user interfaces. The data layer consists of a Microsoft Access database application that houses BDF Units, Manpower, Vehicles, Weapons, Salaries, and Jobs information. The model layer consists of two Microsoft Excel spreadsheets that contain Infantry Battalion and enhanced Armor Battalion HR optimization models. The UI layer consists of user controls, input/output forms, queries, reports, and visualization aids (i.e. charts and pivot tables). These interfaces were developed using MS Access capabilities. Consequently, the BDF-DSS is an integration of database and optimization technology using widely available desktop tools. The general benefits of this DSS are reduced costs for data gathering, computation, and data presentation, and added value resulting from investigating more alternatives, doing more sophisticated analyses of alternatives, using better methods of comparing alternatives, and making quicker and better decisions. / Bahrain Defense Force author. / Major, Bahrain Defense Force

In this constantly growing information technology driven era, data migration and replication pose a serious bottleneck in the distributed database infrastructure envi- ronment. For large heterogeneous environments with domains such as geospatial sci- ence and high energy physics, where large array of scienti c data are involved, diverse challenges are encountered with respect to dataset identi cation, location services, and e cient retrieval of information. These challenges include locating data sources, identifying e ective transfer route, and replication, just to mention a few. As dis- tributed systems aimed at constant delivery of data to the point of query origination continue to expand in size and functionality, e cient replication and data retrieval systems have subsequently become increasingly important and relevant. One such system is an infrastructure for large scale distributed scienti c data management. Several data management systems have been developed to help manage these fast growing datasets and their metadata. However little work has been done on allowing cross-communication and data-sharing between these di erent dataset management systems in a distributed, heterogeneous environment. This dissertation addresses this problem, focusing particularly on metadata and provenance service associated with it. We present the Virtual Uni ed Metadata architecture to establish communication between remote sites within a distributed heterogeneous environment using a client-server model. The system provides a frame- work that allows heterogeneous metadata services communicate and share metadata and datasets through the implementation of a communication interface. It allows for metadata discovery and dataset identi cation by enabling remote query between heterogeneous metadata repositories. The signi cant contributions of this system include: { the design and implementation of a client/server based remote metadata query system for scienti c datasets within distributed heterogeneous dataset reposito- ries; { Implementation of a caching mechanism for optimizing the system performance; { Analyzing the quality of service with respect to correct dataset identi cation, estimation of migration and replication time frame, and cache performance.

by Yip Wai Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1990. / Bibliography: leaves 132-135. / ABSTRACT / ACKNOWLEDGEMENTS / PART I / Chapter 1 --- OVERVIEW ON SEMANTIC DATA MODELLING APPROACH … --- p.1 / Chapter 2 --- SCOPE OF RESEARCH --- p.4 / Chapter 3 --- CONCEPTUAL STRUCTURE OF SAM* --- p.7 / Chapter 3.1 --- Concepts and Associations --- p.7 / Chapter 3.1.1 --- Membership Association --- p.8 / Chapter 3.1.2 --- Aggregation Association --- p.8 / Chapter 3.1.3 --- Generalization Association --- p.9 / Chapter 3.1.4 --- Interaction Association --- p.10 / Chapter 3.1.5 --- Composition Association --- p.11 / Chapter 3.1.6 --- Cross-Product Association --- p.12 / Chapter 3.1.7 --- Summary Association --- p.13 / Chapter 3.2 --- An Example --- p.14 / Chapter 3.3 --- Occurrences --- p.15 / PART II / Chapter 4 --- SYSTEM OVERVIEW --- p.17 / Chapter 4.1 --- System Objectives --- p.17 / Chapter 4.1.1 --- Data Level --- p.17 / Chapter 4.1.2 --- Meta-Data Level --- p.18 / Chapter 4.2 --- System Characteristics --- p.19 / Chapter 4.3 --- Design Considerations --- p.20 / Chapter 5 --- IMPLEMENTATION CONSIDERATIONS --- p.23 / Chapter 5.1 --- Introduction --- p.23 / Chapter 5.2 --- Data Definition Language for Schema --- p.24 / Chapter 5.3 --- Construction of Directed Acyclic Graph --- p.27 / Chapter 5.4 --- Query Manipulation Language --- p.28 / Chapter 5.4.1 --- Semantic Manipulation Language --- p.29 / Chapter 5.4.1.1 --- Locate Concepts --- p.30 / Chapter 5.4.1.2 --- Retrieve Information About Concepts --- p.30 / Chapter 5.4.1.3 --- Find a Path Between Two Concepts --- p.31 / Chapter 5.4.2 --- Occurrence Manipulation Language --- p.32 / Chapter 5.5 --- Examples --- p.35 / Chapter 6 --- RESULTS AND DISCUSSIONS --- p.41 / Chapter 6.1 --- Allow Non-Homogeneity of Facts about Entities --- p.41 / Chapter 6.2 --- Field Name is Information --- p.42 / Chapter 6.3 --- Description of Group of Information --- p.43 / Chapter 6.4 --- Explicitly Description of Interaction --- p.43 / Chapter 6.5 --- Information about Entities --- p.44 / Chapter 6.6 --- Automatically Joining Tables --- p.45 / Chapter 6.7 --- Automatically Union Tables --- p.45 / Chapter 6.8 --- Automatically Select Tables --- p.46 / Chapter 6.9 --- Ambiguity --- p.47 / Chapter 6.10 --- Normalization --- p.47 / Chapter 6.11 --- Update --- p.50 / PART III / Chapter 7 --- SCHEMA VERIFICATION --- p.55 / Chapter 7.1 --- Introduction --- p.55 / Chapter 7.2 --- Need of Schema Verification --- p.57 / Chapter 7.3 --- Integrity Constraint Handling Vs Schema Verification --- p.58 / Chapter 8 --- AUTOMATIC THEOREM PROVING --- p.60 / Chapter 8.1 --- Overview --- p.60 / Chapter 8.2 --- A Discussion on Some Automatic Theorem Proving Methods --- p.61 / Chapter 8.2.1 --- Resolution --- p.61 / Chapter 8.2.2 --- Natural Deduction --- p.63 / Chapter 8.2.3 --- Tableau Proof Methods --- p.65 / Chapter 8.2.4 --- Connection Method --- p.67 / Chapter 8.3 --- Comparison of Automatic Theorem Proving Methods --- p.70 / Chapter 8.3.1 --- Proof Procedure --- p.70 / Chapter 8.3.2 --- Overhead --- p.70 / Chapter 8.3.3 --- Unification --- p.71 / Chapter 8.3.4 --- Heuristics --- p.72 / Chapter 8.3.5 --- Getting Lost --- p.73 / Chapter 8.4 --- The Choice of Tool for Schema Verification --- p.73 / Chapter 9 --- IMPROVEMENT OF CONNECTION METHOD --- p.77 / Chapter 9.1 --- Motivation of Improving Connection Method --- p.77 / Chapter 9.2 --- Redundancy Handled by the Original Algorithm --- p.78 / Chapter 9.3 --- Design Philosophy of the Improved Version --- p.82 / Chapter 9.4 --- Primary Connection Method Algorithm --- p.83 / Chapter 9.5 --- AND/OR Connection Graph --- p.89 / Chapter 9.6 --- Graph Traversal Procedure --- p.91 / Chapter 9.7 --- Elimination Redundancy Using AND/OR Connection Graph --- p.94 / Chapter 9.8 --- Further Improvement on Graph Traversal --- p.96 / Chapter 9.9 --- Comparison with Original Connection Method Algorithm --- p.97 / Chapter 9.10 --- Application of Connection Method to Schema Verification --- p.98 / Chapter 9.10.1 --- Express Constraint in Well Formed Formula --- p.98 / Chapter 9.10.2 --- Convert Formula into Negation Normal Form --- p.101 / Chapter 9.10.3 --- Verification --- p.101 / PART IV / Chapter 10 --- FURTHER DEVELOPMENT --- p.103 / Chapter 10.1 --- Intelligent Front-End --- p.103 / Chapter 10.2 --- On Connection Method --- p.104 / Chapter 10.3 --- Many-Sorted Calculus --- p.104 / Chapter 11 --- CONCLUSION --- p.107 / APPENDICES / Chapter A --- COMPARISON OF SEMANTIC DATA MODELS --- p.110 / Chapter B --- CONSTRUCTION OP OCCURRENCES --- p.111 / Chapter C --- SYNTAX OF DDL FOR THE SCHEMA --- p.113 / Chapter D --- SYNTAX OF SEMANTIC MANIPULATION LANGUAGE --- p.116 / Chapter E --- TESTING SCHEMA FOR FUND INVESTMENT DBMS --- p.118 / Chapter F --- TESTING SCHEMA FOR STOCK INVESTMENT DBMS --- p.121 / Chapter G --- CONNECTION METHOD --- p.124 / Chapter H --- COMPARISON BETWEEN RESOLUTION AND CONNECTION METHOD --- p.128 / REFERENCES --- p.132

Jessie Ching. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves 98-101.

by Poon, Koon-hei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 80-83). / Abstracts in English and Chinese. / Chapter CHAPTER 1 --- INTRODUCTION --- p.6 / Chapter CHAPTER 2 --- LITERATURE REVIEW --- p.13 / Chapter 2.1. --- BACKGROUND --- p.13 / Chapter 2.2. --- example systems --- p.20 / Chapter 2.2.1 --- Multibase --- p.20 / Chapter 2.2.2. --- Mermai d --- p.23 / Chapter 2.2.3. --- The Metadatabase Approach --- p.26 / Chapter 2.3. --- SUMMARY --- p.29 / Chapter CHAPTER 3 --- THE METADATABASE APPROACH --- p.31 / Chapter 3.1. --- Two-Stage Entity Relationship (TSER) model --- p.31 / Chapter 3.2. --- The GIRD --- p.34 / Chapter 3.3. --- The Metadatabase system in action --- p.36 / Chapter 3.3. --- global query formulations and processing in the metadatabase system --- p.37 / Chapter CHAPTER 4 --- PROBLEM OUTLINES FOR HORIZONTAL PARTITIONING AND ITS VARIANTS --- p.39 / Chapter 4.1. --- Horizontal partitioning --- p.39 / Chapter 4.2. --- Level of abstraction --- p.41 / Chapter 4.3. --- Schematic variances --- p.42 / Chapter 4.4. --- Summary --- p.43 / Chapter 4.5. --- The Scenario --- p.44 / Chapter 4.6. --- Populating the Metadatabase --- p.48 / Chapter CHAPTER 5 --- THE ENHANCEMENTS FOR GLOBAL QUERY WITH HORIZONTAL PARTITIONED DATA OBJECTS --- p.51 / Chapter 5.1. --- Identifying partitioned data objects --- p.51 / Chapter 5.2. --- Additional metadata for the horizontal partitioned data objects --- p.52 / Chapter 5.3. --- Complications of horizontal partitioning problem --- p.54 / Chapter 5.3.1. --- Level of abstraction --- p.55 / Chapter 5.3.2. --- Schematic variances --- p.57 / Chapter 5.4. --- Global query with horizontal partitioning data objects --- p.59 / Chapter 5.5. --- Housing the new metadata --- p.68 / Chapter 5.6. --- Example --- p.72 / Chapter CHAPTER 6 --- ANALYSIS --- p.75 / Chapter CHAPTER 7 --- CONCLUSION AND FUTURE WORKS --- p.78 / REFERENCES --- p.80 / APPENDICES --- p.84 / Chapter A. --- GIRD Definitions --- p.84 / Chapter A1. --- GIRD Model --- p.84 / Chapter A2. --- GIRD/SER Contents --- p.84 / Chapter A3. --- GIRD/OER Constructs --- p.87 / Chapter A4. --- Definition of Meta-attributes --- p.89 / Chapter B. --- Problems Representations in Relation Algebra --- p.96 / Chapter B1. --- Horizontal problem --- p.96 / Chapter B2. --- Level of abstraction --- p.96 / Chapter B3. --- Schematic Variance --- p.97 / Chapter C. --- Details of local systems --- p.98

Typescript, etc. / Digitized by Kansas Correctional Industries

Photocopy of typescript. / Digitized by Kansas Correctional Industries