Ex ante evaluations of alternate data structures for end user queries: Theory and experimental test

The data structure of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. This research develops a methodology for evaluating, ex ante, the relative desirability of alternative data structures for end user queries. This research theorizes that the data structure that yields the lowest weighted average complexity for a representative sample of information requests is the most desirable data structure for end user queries. The theory was tested in an experiment that compared queries from two different relational database schemas. As theorized, end users querying the data structure associated with the less complex queries performed better Complexity was measured using three different Halstead metrics. Each of the three metrics provided excellent predictions of end user performance. This research supplies strong evidence that organizations can use complexity metrics to evaluate, ex ante, the desirability of alternate data structures. Organizations can use these evaluations to enhance the efficient and effective retrieval of information by creating data structures that minimize end user query complexity.

MHCWeb: Converting a WWW database into a knowledge-based collaborative environment

The World Wide Web (WWW) is useful for distributing scientific data. Most existing web data resources organize their information either in structured flat files or relational databases with basic retrieval capabilities. For databases with one or a few simple relations, these approaches are successful, but they can be cumbersome when there is a data model involving multiple relations between complex data. We believe that knowledge-based resources offer a solution in these cases. Knowledge bases have explicit declarations of the concepts in the domain, along with the relations between them. They are usually organized hierarchically, and provide a global data model with a controlled vocabulary, We have created the OWEB architecture for building online scientific data resources using knowledge bases. OWEB provides a shell for structuring data, providing secure and shared access, and creating computational modules for processing and displaying data. In this paper, we describe the translation of the online immunological database MHCPEP into an OWEB system called MHCWeb. This effort involved building a conceptual model for the data, creating a controlled terminology for the legal values for different types of data, and then translating the original data into the new structure. The 0 WEB environment allows for flexible access to the data by both users and computer programs.

The effects of normalisation on the ability of business end-users to detect data anomalies: An experimental evaluation

With the proliferation of relational database programs for PC's and other platforms, many business end-users are creating, maintaining, and querying their own databases. More importantly, business end-users use the output of these queries as the basis for operational, tactical, and strategic decisions. Inaccurate data reduce the expected quality of these decisions. Implementing various input validation controls, including higher levels of normalisation, can reduce the number of data anomalies entering the databases. Even in well-maintained databases, however, data anomalies will still accumulate. To improve the quality of data, databases can be queried periodically to locate and correct anomalies. This paper reports the results of two experiments that investigated the effects of different data structures on business end-users' abilities to detect data anomalies in a relational database. The results demonstrate that both unnormalised and higher levels of normalisation lower the effectiveness and efficiency of queries relative to the first normal form. First normal form databases appear to provide the most effective and efficient data structure for business end-users formulating queries to detect data anomalies.

A global marker database for Phytophthora infestans

A marker database was compiled for isolates of the potato and tomato late blight pathogen, Phytophthora infestans, originating from 41 locations which include 31 countries plus 10 regions within Mexico. Presently, the database contains information on 1,776 isolates for one or more of the following markers: restriction fragment length polymorphism (RFLP) fingerprint consisting of 23 bands; mating type; dilocus allozyme genotype; mitochondrial DNA haplotype; sensitivity to the fungicide metalaxyl; and virulence. In the database, 305 entries have unique RFLP fingerprints and 258 entries have unique multilocus genotypes based on RFLP fingerprint, dilocus allozyme genotype, and mating type. A nomenclature is described for naming multilocus genotypes based on the International Organization for Standardization (ISO) two-letter country code and a unique number, Forty-two previously published multilocus genotypes are represented in the database with references to publications. As a result of compilation of the database, seven new genotypes were identified and named. Cluster analysis of genotypes from clonally propagated populations worldwide generally confirmed a previously published classification of old and new genotypes. Genotypes from geographically distant countries were frequently clustered, and several old and new genotypes were found in two or more distant countries. The cluster analysis also demonstrated that A2 genotypes from Argentina differed from all others. The database is available via the Internet, and thus can serve as a resource for Phytophthora workers worldwide.

The nature and evolution of the association among digeneans, molluscs and fishes

Patterns of association of digenean families and their mollusc and vertebrate hosts are assessed by way of a new database containing information on over 1000 species of digeneans for lift-cycles and over 5000 species from fishes. Analysis of the distribution of digenean families in molluscs suggests that the group was associated primitively with gastropods and that infection of polychaetes, bivalves and scaphopods are all the results of host-switching. For the vertebrates. infections of agnathans and chondrichthyans are apparently the result of host-switching from teleosts. For digenean families the ratio of orders of fishes infected to superfamilies of molluscs infected ranges from 0.5 (Mesometridae) to 16 (Bivesiculidae) and has a mean of 5.6. Individual patterns of host association of 13 dipenean families and superfamilies are reviewed. Two, Bucephalidae and Sanguinicolidae. are exceptional in infecting a range of first intermediate hosts qualitatively as broad as their range of definitive hosts. No well-studied taxon shows narrower association with vertebrate than with mollusc clades. The range of definitive hosts of digeneans is characteristically defined by eco-physiological similarity rather than phylogenetic relationship. The range of associations of digenean families with mollusc taxa is generally much narrower. These data are considered in the light of ideas about the significance of different forms of host association. If Manter's Second Rule (the longer the association with a host group, the mure pronounced the specificity exhibited by the parasite group) is invoked, then the data may suggest that the Digenea first parasitised molluscs before adopting vertebrate hosts. This interpretation is consistent with most previous ideas about the evolution of the Digenea but contrary to current interpretations based on the monophyly of the Neodermata. The basis of Manter's Second Rule is. however, considered too flimsy for this interpretation to be robust. Problems of the inference of the evolution of patterns of parasitism in the Neodermata al-e discussed and considered so intractable that the truth may be presently unknowable. (C) 2001 Australian Society for Parasitology Inc. Published by Elsevier Science Ltd. All rights reserved.

CyBase: a database of cyclic protein sequence and structure

CyBase is a curated database and information source for backbone-cyclized proteins. The database incorporates naturally occurring cyclic proteins as well as synthetic derivatives, grafted analogues and acyclic permutants. The database provides a centralized repository of information on all aspects of cyclic protein biology and addresses issues pertaining to the management and searching of topologically circular sequences. The database is freely available at http://research.imb.uq.edu.au/cybase.

Identifying critical components during information security evaluations

Electronic communications devices intended for government or military applications must be rigorously evaluated to ensure that they maintain data confidentiality. High-grade information security evaluations require a detailed analysis of the device's design, to determine how it achieves necessary security functions. In practice, such evaluations are labour-intensive and costly, so there is a strong incentive to find ways to make the process more efficient. In this paper we show how well-known concepts from graph theory can be applied to a device's design to optimise information security evaluations. In particular, we use end-to-end graph traversals to eliminate components that do not need to be evaluated at all, and minimal cutsets to identify the smallest group of components that needs to be evaluated in depth.

A border-based approach for hiding sensitive frequent itemsets

Sharing data among organizations often leads to mutual benefit. Recent technology in data mining has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive knowledge is hidden. The challenge is to minimize the side effect on the quality of the sanitized database so that nonsensitive knowledge can still be mined. In this paper, we study such a problem in the context of hiding sensitive frequent itemsets by judiciously modifying the transactions in the database. To preserve the non-sensitive frequent itemsets, we propose a border-based approach to efficiently evaluate the impact of any modification to the database during the hiding process. The quality of database can be well maintained by greedily selecting the modifications with minimal side effect. Experiments results are also reported to show the effectiveness of the proposed approach. © 2005 IEEE

Conclusions

The researchers focussed on the impact of the heroin shortage that occurred in early 2001 on three Australian jurisdictions, namely NSW, Vic and SA. They interviewed 82 heroin dependent heroin users and 172 key informants from health and law enforcement agencies. They also examined a range of indicator data such as drug seizures, drug-related arrests, deaths related to drug use, emergency department admissions for overdose or drug induced psychosis , calls to telephone help lines about drug use, needles distributed for drug use, and notifications about blood borne diseases. In addition a range of documentation, in particular from the law enforcement sector, was examined.

Image reconstruction in full-field Fourier-domain optical coherence tomography

Full-field Fourier-domain optical coherence tomography (3F-OCT) is a full-field version of spectral domain/swept source optical coherence tomography. A set of two-dimensional Fourier holograms is recorded at discrete wavenumbers spanning the swept source tuning range. The resultant three-dimensional data cube contains comprehensive information on the three-dimensional spatial properties of the sample, including its morphological layout and optical scatter. The morphological layout can be reconstructed in software via three-dimensional discrete Fourier transformation. The spatial resolution of the 3F-OCT reconstructed image, however, is degraded due to the presence of a phase cross-term, whose origin and effects are addressed in this paper. We present a theoretical and experimental study of the imaging performance of 3F-OCT, with particular emphasis on elimination of the deleterious effects of the phase cross-term.

Optimal Paths and Costs of Adjustment in Dynamic DEA Models: With Application to Chilean Department Stores

In this paper we propose a range of dynamic data envelopment analysis (DEA) models which allow information on costs of adjustment to be incorporated into the DEA framework. We first specify a basic dynamic DEA model predicated on a number or simplifying assumptions. We then outline a number of extensions to this model to accommodate asymmetric adjustment costs, non-static output quantities, non-static input prices, and non-static costs of adjustment, technological change, quasi-fixed inputs and investment budget constraints. The new dynamic DEA models provide valuable extra information relative to the standard static DEA models-they identify an optimal path of adjustment for the input quantities, and provide a measure of the potential cost savings that result from recognising the costs of adjusting input quantities towards the optimal point. The new models are illustrated using data relating to a chain of 35 retail department stores in Chile. The empirical results illustrate the wealth of information that can be derived from these models, and clearly show that static models overstate potential cost savings when adjustment costs are non-zero.