Thesis (M.S.)--University of Wisconsin--Madison, 1968. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Su Yat Fan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 91-95). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Our Objective --- p.4 / Chapter 1.3 --- The Organization of the Thesis --- p.5 / Chapter 2 --- Related Works --- p.7 / Chapter 2.1 --- Semi-structured Data --- p.7 / Chapter 2.1.1 --- What are Semi-structured Data? --- p.8 / Chapter 2.1.2 --- Examples of Semi-structured Data --- p.9 / Chapter 2.2 --- Object Exchange Model --- p.10 / Chapter 2.3 --- Regular Path Expressions --- p.12 / Chapter 2.4 --- Graph Schemas --- p.13 / Chapter 2.4.1 --- Accurate Graph Schemas: DataGuides --- p.15 / Chapter 2.4.2 --- Approximate Graph Schemas --- p.17 / Chapter 2.4.3 --- Conceptual Graphs (CG) --- p.19 / Chapter 2.5 --- Chapter Summary --- p.25 / Chapter 3 --- Query Evaluation and Characteristics of Conceptual Graphs --- p.27 / Chapter 3.1 --- Generation of Data Graphs --- p.28 / Chapter 3.2 --- Conceptual Graphs with Respect to Different Types of Data Graphs --- p.29 / Chapter 3.2.1 --- Experimental Setup --- p.29 / Chapter 3.2.2 --- Experimental Results --- p.30 / Chapter 3.3 --- Query Evaluation --- p.34 / Chapter 3.4 --- The Effect of Traversal Orders over Conceptual Graphs --- p.39 / Chapter 3.4.1 --- Experimental Setup --- p.39 / Chapter 3.4.2 --- Experimental Results --- p.40 / Chapter 3.5 --- Chapter Summary --- p.46 / Chapter 4 --- Problems in Conceptual Graphs --- p.47 / Chapter 4.1 --- False Paths in Conceptual Graphs --- p.50 / Chapter 4.2 --- Utility Function --- p.51 / Chapter 4.3 --- Information Incompleteness in the Construction Process --- p.53 / Chapter 4.4 --- Chapter Summary --- p.54 / Chapter 5 --- Refinement of the Utility Function --- p.55 / Chapter 5.1 --- """Attributes Or Roles"" Instead of ""Attributes and Roles""" --- p.56 / Chapter 5.2 --- Roles --- p.57 / Chapter 5.2.1 --- The New Utility Function with Only Roles Involved --- p.57 / Chapter 5.2.2 --- Query Evaluation Using Roles Only --- p.58 / Chapter 5.3 --- Attributes --- p.63 / Chapter 5.3.1 --- The New Utility Function Based on Attributes Only --- p.63 / Chapter 5.3.2 --- Query Evaluation Using Attributes Only --- p.64 / Chapter 5.4 --- A Reliability Test for Attribute-only Utility Function --- p.66 / Chapter 5.5 --- Chapter Summary --- p.70 / Chapter 6 --- New Operators for Conceptual Graph Construction --- p.74 / Chapter 6.1 --- The Original Algorithm --- p.74 / Chapter 6.2 --- Revised Algorithm with New Operators --- p.75 / Chapter 6.3 --- Query Evaluation of the Revised Algorithm --- p.79 / Chapter 6.3.1 --- Experimental Setup --- p.79 / Chapter 6.3.2 --- Evaluation Results --- p.80 / Chapter 6.4 --- Chapter Summary --- p.85 / Chapter 7 --- Conclusions --- p.87 / Chapter 7.1 --- Future Work --- p.89 / Bibliography --- p.91

This thesis presents a data structure for the interactive editing of logic diagrams by means of a storage graphics terminal. It presents an overview of Computer-Aided Design of digital systems, and outlines the requirements of an interactive graphics system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with recommendations for further study. / M.S.

An Euler diagram C = {c_1, c_2,..., c_n} is a collection of n simple closed curves (i.e., Jordan curves) that partition the plane into connected subsets, called regions, each of which is enclosed by a unique combination of curves. Typically, Euler diagrams are used to visualize the distribution of discrete characteristics across a sample population; in this case, each curve represents a characteristic and each region represents the sub-population possessing exactly the combination of containing curves' properties. Venn diagrams are a subclass of Euler diagrams in which there are 2^n regions representing all possible combinations of curves (e.g., two partially overlapping circles). In this dissertation, we study the Euler Diagram Generation Problem (EDGP), which involves constructing an Euler diagram with a prescribed set of regions. We describe a graph-theoretic model of an Euler diagram's structure and use this model to develop necessary-and-sufficient existence conditions. We also use the graph-theoretic model to prove that the EDGP is NP-complete. In addition, we study the related Area-Proportional Euler Diagram Generation Problem (w-EDGP), which involves constructing an Euler diagram with a prescribed set of regions, each of which has a prescribed area. We develop algorithms for constructing area-proportional Euler diagrams composed of up to three circles and rectangles, as well as diagrams with an unbounded number of curves and a region of common intersection. Finally, we present implementations of our algorithms that allow the dynamic manipulation and real-time construction of area-proportional Euler diagrams.