Computer Sciences Commons^™

Measurement Of The Cross Section For Γγ→Pp̄, Artuso, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

During a police investigation, officers often have to sort through hundreds of photographs to identify a suspect. To aid this task, we at the Institute of Systems Science developed and implemented a flexible database system that can retrieve faces using personal information, fuzzy and free-text descriptors, and classification trees.

Measurement Of The Branching Fraction For D+K-++, Balest, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at the Cornell Electron Storage Ring we have measured the ratio of branching fractions, B(D+K-++)/(D0K-+)=2.350.160.16. Our recent measurement of scrB(D0K-+) then gives scrB(D+K-++)=(9.30.60.8)%.

Study Of The Five-Charged-Pion Decay Of The Τ Lepton, D. Gibaut, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The branching fractions for the five-charged-particle decays of the τ lepton have been measured in e+e− annihilations using the CLEO II detector at the Cornell Electron Storage Ring. Assuming all charged particles to be pions, the results are B(3π−2π+≥0 neutrals ντ)=(0.097±0.005±0.011)%, B(3π−2π+ντ)=(0.077±0.005 ±0.009)%, B(3π−2π+π0ντ)=(0.019±0.004±0.004)%, and B(3π−2π+2π0ντ)B(3π−2π−π0ντ) is measured for the first time by exclusive π0 reconstruction. The results are compared with the predictions from the partially conserved-axial-current and conserved-vector-current hypotheses assuming isospin invariance.

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have measured the vector-pseudoscalar mass splitting M(D*+s)-M(D+s)=144.22±0.47±0.37 MeV significantly more precisely than the previous world average. We minimize the systematic errors by also measuring the vector-pseudoscalar mass difference M(D*0)-M(D0) using the radiative decay D*0→D0γ, obtaining [M(D*+s)-M(D+s)]-[M(D*0)-M(D0)] =2.09±0.47±0.37 MeV. This is then combined with our previous high-precision measurement of M(D*0)-M(D0), which used the decay D*0→D0π0. We also measure the mass difference M(D+s)-M(D+)=99.5±0.6±0.3 MeV, using the φπ+ decay modes of the D+s and D+ mesons.

Resolving Attribute Incompatibility In Database Integration: An Evidential Reasoning Approach, Ee-Peng Lim, Shashi Shekhar

Research Collection School Of Computing and Information Systems

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel (1989) showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. The authors show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. They therefore propose an extended relational model based on Dempster-Shafer theory of evidence (1976) to incorporate such uncertain knowledge about the source databases. They also develop a full set of extended relational operations …

A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu

Computer Science Faculty Publications

Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=2² nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …

Using Database Technology To Support Domain-Oriented Application Composition Systems, Danny A. Cecil, Joseph A. Fullenkamp

Theses and Dissertations

This research designed and prototyped an OODBMS technology base to store and retrieve various types of domain artifacts for domain-oriented application composition systems (DOACS). We developed object-oriented database schemas for a validating domain and the Object-Connection-Update software architecture. We implemented an inheritance relationship between the schemas so a domain model can inherit an architectural structure from an architecture model allowing us to isolate domain-specific knowledge from architecture-specific knowledge. We also developed a meta-model to formally define domain models in the database. We then developed a set of database methods to transform a domain model into a database schema for storing …

Performance Measurement Of Three Commercial Object-Oriented Database Management Systems, Timothy J. Halloran

Theses and Dissertations

The goal of this thesis was to study the performance of three commercial object-oriented database management systems. The commercial systems studied included Itasca, sold by Itasca Systems Incorporated Matisse, sold by Intellitic International and ObjectStore, sold by Object Design Incorporated. To examine performance of these database management systems two benchmarks were run the OO1 benchmark and a new AFIT Simulation benchmark. The OO1 benchmark was designed, implemented, and run on all three database management systems. ObjectStore was our top performer on all configurations of the OO1 benchmark. The AFIT Simulation benchmark was designed, implemented, and run on the ObjectStore database …

User-Database Interface: The Effect Of Abstraction Levels On Query Performance, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

A common classification of data models is based on their abstraction levels: physical, logical and conceptual. The user-database interaction can be similarly classified. For the conceptual-level interaction, the user and the database exchange information on the user's world, e.g., information of entities, relationships, and attributes. For the logical-level interaction, the user and the database communicate based on concepts in the database system, e.g., relations and join operations. We expect users to be familiar with concepts in their world but not the concepts in the database system. This is especially so for infrequent or naive database users. The conceptual level should …

Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.

Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

No abstract provided.

Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unijied multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subezpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs forall queries at once. In this paper, …

Establishing A Distributed Processing And Distributed Database Environment For Intergraph Mge & Orscle Products, Praveen Chandrasekhar

Electronic Dissertations and Theses

The department of Agricultural Economics undertake various government contracts for GIS based applications. Currently, they have multi-year contracts with the Louisiana Department of Health and Hospitals (LDHH). This contract is carried out in the Agricultural Economics Geographical Information System lab (AEGIS). One part of the contract is to integrate a heterogenous system comprising of PCs and Intergraph workstations so that the PC can share the data or Microstation Geographical information system Environment (MGE) and ORACLE based applications. Since the Department also undertakes other contracts which requires them to use ARC/INFOR as the front-end while the data would reside in ORACLE …

Semantics-Based Information Brokering: A Step Towards Realizing The Infocosm, Vipul Kashyap, Amit P. Sheth

Kno.e.sis Publications

The rapid advances in computer and communication technologies, and their merger, is leading to a global information market place. It will consist of federations of very large number of information systems that will cooperate to varying extents to support the users' information needs. We propose an architecture which may facilitate meeting these needs. It consists of three main components: information providers, information brokers and information consumers. We also propose an approach to information brokering. We discuss two of it's tasks: information resource discovery, which identities relevant information sources for a given query, and query processing, which involves the generation of …

Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

Entity identification is the problem of matching object instances from different databases which correspond to the same real-world entity. In this paper, we present a 2-step entity identification process in which attributes for matching tuples may be missing in certain tuples, and thus need to be derived prior to the matching. To match tuples, we require identity rules which specify the conditions to be satisfied by a pair of tuples, from different databases, before they can be considered as modeling the same real-world entity. We also introduce ILFD's (instance-level functional dependencies) as a form of inference rules which derive the …

Specifying And Enforcing Intertask Dependencies, Paul Attie, Munindar Singh, Amit P. Sheth, Marek Rusinkiewicz

Kno.e.sis Publications

Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or workflows that access heterogeneous databases and legacy application systems. Most extended transaction models use conditions involving events or dependencies between transactions. Intertask dependencies can serve as a uniform framework for defining extended transaction models. In this paper we introduce event attributes needed to determine whether a dependency is enforceable and to properly schedule events in extended transaction models. Using these attributes and a formalization of a dependency into the temporal logic CTL, we can automatically synthesize an automaton that captures the computations that …

Memory-Adaptive External Sorting, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large relations may fluctuate due to contention from other higher priority transactions. This study focuses on techniques that enable external sorts both to reduce their buffer usage when they lose memory, and to effectively utilize any additional buffers that are given to them. We also show how these techniques can be extended to work with sort-merge joins. A series of experiments confirms that our proposed techniques are useful for sorting and joining large relations in the face of memory fluctuations.

A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth

Kno.e.sis Publications

Presents an overview of the ITX (Interacting Transaction) system, which supports complex interactions among cooperating agents in the presence of user interventions that change application objectives and system failures. The system's components and its unique fixed-point criterion for feedback control of iterative interactions are described. An example of a simplified multimedia teleconferencing application is discussed to illustrate the features of the ITX system.

Ccis Networking - July 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton

Theses and Dissertations

The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …

Partially Preemptible Hash Joins, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

With the advent of real-time and goal-oriented database systems, priority scheduling is likely to be an important feature in future database management systems. A consequence of priority scheduling is that a transaction may lose its buffers to higher-priority transactions, and may be given additional memory when transactions leave the system. Due to their heavy reliance on main memory, hash joins are especially vulnerable to fluctuations in memory availability. Previous studies have proposed modifications to the hash join algorithm to cope with these fluctuations, but the proposed algorithms have not been extensively evaluated or compared with each other. This paper contains …

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson

Research Collection School Of Computing and Information Systems

The objective of entity identification is to determine the correspondence between object instances from more than one database. Entity identification at the instance level, assuming that schema level heterogeneity has been resolved a priori, is examined. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. The use of extended key, which is the union of keys, and possibly other attributes, from the relations to be matched, and its corresponding identify rule are proposed to determine the equivalence …

Federated Autonomous Databases: Project Overview, Satya Prabhakar, Jiandong Huang, James Richardson, Jaideep Srivastava, Ee Peng Lim, Sham Navathe, Ashok Savarase, Mark Foresti

Research Collection School Of Computing and Information Systems

The paper presents an overview of an ongoing research program, Federated Autonomous Databases, sponsored by Rome Laboratory (US Air Force) and conducted by Honeywell in collaboration with the University of Minnesota and Georgia Institute of Technology. This program is exploratory in nature and is aimed at understanding and solving, within the scope of the program definition, the problem of providing integrated access to distributed, heterogeneous and autonomous databases.

A Distributed Object-Oriented Database Application Design, Hsin-Feng Edward Wu

Theses and Dissertations

The purpose of this study is to analyze and develop a distributed object-oriented database management system (DOODBMS) application to support parallel software development of the Parallel Algorithms and Applications Group (PAAG) at AFIT. By following the software lifecycle of object-oriented paradigm, this thesis investigation is intended to generate requirements analysis, design, implementation, user interface design and implementation, and integration of the database application with the user interface. ITASCA, an existing DOODBMS platform, has been chosen to prototype the application for its distribution functionalities and object-oriented modeling power. The user interface of the database application is based on X-window OSF/Motif front-end …

Protocol Conformance Test Generation Using Circular Uio With Overlapping, Sesharao Patchipala

Theses

The purpose of the protocol conformance testing is to ensure that protocol implementations are consistent with their specifications. After the U-method was introduced, several test methods based on the Unique Input/Output (UI0) sequences which were the main concept in the U-method have been proposed, namely, the RCP-method, MUIO-method, MUIO with overlapping method, B-method, C-method. A good test sequence must be short and have wide fault coverage. By comparing the test sequences generated by the above test methods based on experimental results, reveals that the test sequences by the MUIO with overlapping method are the worst in quality but their lengths …

Computer Implementation Of Mason's Rule And Software Development Of Stochastic Petri Nets, Xiaoyong Zhao

Theses

A symbolic performance analysis approach for discrete event systems can be formulated based on the integration of Petri nets and Moment Generating Function concepts [1-3]. The key steps in the method include modeling a system with arbitrary stochastic Petri nets (ASPN), generation of state machine Petri nets with transfer functions, derivation of equivalent transfer functions, and symbolic derivation of transfer functions to obtain the performance measures. Since Mason's rule can be used to effectively derive the closed-form transfer function, its computer implementation plays a very important role in automating the above procedure. This thesis develops the computer implementation of Mason's …

Systems Integration In Pharmaceutical Industry Using Object-Oriented Expert System Technology, Korrapolu Reddy

Theses

SPHINX is an object-oriented expert system addressed to solve the burning problems of pharmaceutical industry. SPHINX stands for Systems integration in PHarmaceutical INdustry using object-oriented eXpert system technology.

Various problems that American pharmaceutical industries are facing have been explained. Using the revolutionary object-oriented concepts and the powerful expert systems technology, it has been shown how a prescription can be written to solve all the problems of pharmaceutical industries. A problem "Minimizing the wastage of Interferon" has been taken to demonstrate the power of Object-oriented Expert System technology.

Ccis Networking - January 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.