Lin, Jianfeng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 79-83). / Abstracts in English and Chinese. / Abstract --- p.i / 内容摘要 --- p.ii / Acknowledgement --- p.iii / Table of Contents --- p.iv / List of Figures --- p.vi / List of Tables --- p.vii / Chapter Chapter 1. --- Introduction --- p.1 / Chapter Chapter 2. --- Related Work --- p.6 / Chapter 2.1. --- Ontology Integration --- p.7 / Chapter 2.2. --- Schema Matching --- p.10 / Chapter 2.3. --- Taxonomy Integration as Text Categorization --- p.13 / Chapter 2.4. --- Cross-lingual Text Categorization & Cross-lingual Information Retrieval --- p.15 / Chapter Chapter 3. --- Problem Definition --- p.17 / Chapter 3.1. --- Mono-lingual Category Tree Integration --- p.17 / Chapter 3.2. --- Integration Operators --- p.19 / Chapter 3.3. --- Cross-lingual Category Tree Integration --- p.21 / Chapter Chapter 4. --- Mono-lingual Category Tree Integration Techniques --- p.23 / Chapter 4.1. --- Category Relationships --- p.23 / Chapter 4.2. --- Decision Rules --- p.27 / Chapter 4.3. --- Mapping Algorithm --- p.38 / Chapter Chapter 5. --- Experiment of Mono-lingual Category Tree Integration --- p.42 / Chapter 5.1. --- Dataset --- p.42 / Chapter 5.2. --- Automated Text Classifier --- p.43 / Chapter 5.3. --- Evaluation Metrics --- p.46 / Chapter 5.3.1. --- Integration Accuracy --- p.47 / Chapter 5.3.2. --- Precision and Recall and F1 value of the Three Operators --- p.48 / Chapter 5.3.3. --- "Precision and Recalls of ""Split""" --- p.48 / Chapter 5.4. --- Parameter Turning --- p.49 / Chapter 5.5. --- Experiments Results --- p.55 / Chapter Chapter 6. --- Cross-lingual Category Tree Integration --- p.60 / Chapter 6.1. --- Parallel Corpus --- p.61 / Chapter 6.2. --- Cross-lingual Concept Space Construction --- p.65 / Chapter 6.2.1. --- Phase Extraction --- p.65 / Chapter 6.2.2. --- Co-occurrence analysis --- p.65 / Chapter 6.2.3. --- Associate Constraint Network for Concept Generation --- p.67 / Chapter 6.3. --- Document Translation --- p.69 / Chapter 6.4. --- Experiment Setting --- p.72 / Chapter 6.5. --- Experiment Results --- p.73 / Chapter Chapter 7. --- Conclusion and Future Work --- p.77 / Reference --- p.79

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Traditional database systems manage data, but often do not address its provenance. In the past, users were often implicitly familiar with data they used, how it was created (and hence how it might be appropriately used), and from which sources it came. Today, users may be physically and organizationally remote from the data they use, so this information may not be easily accessible to them. In recent years, several models have been proposed for recording provenance of data. Our work is motivated by opportunities to make provenance easy to manage and query. For example, current approaches model provenance as expressions that may be easily stored alongside data, but are difficult to parse and reconstruct for querying, and are difficult to query with available languages. We contribute a conceptual model for data and provenance, and evaluate how well it addresses these opportunities. We compare the expressive power of our model's language to that of other models. We also define a benchmark suite with which to study performance of our model, and use this suite to study key model aspects implemented on existing software platforms. We discover some salient performance bottlenecks in these implementations, and suggest future work to explore improvements. Finally, we show that our implementations can comprise a logical model that faithfully supports our conceptual model.

No description available.

No description available.

"November 4, 2002." Includes bibliographical references (leaves 180-814) Applies analytic modelling techniques to the study of agent-based routing algorithms

Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the network and collectively construct a distributed routing policy. Agent-based routing algorithms belonging to this class do not require a complete model of the network, and are able to adapt autonomously to network changes in dynamic and unpredictable environments. Previous studies of these algorithms have been carried out exclusively via the use of simulation-based models. In this thesis, we apply analytic modelling techniques to the study of agent-based routing algorithms. Our aim is to broaden the research in this field, as well as to gain a greater theoretical understanding of some fundamental properties of this class of algorithms. / Thesis (Ph.D.)--School of Applied Mathematics, 2002.

Thesis (M. Phil.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.

Thesis (M.S.)--University of Florida, 2000. / Title from first page of PDF file. Document formatted into pages; contains v, 111 p.; also contains graphics. Vita. Includes bibliographical references (p. 106-110).

Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xii, 122 p.; also contains graphics. Vita. Includes bibliographical references (p. 114-121).