Development of a New Zealand database of plant virus and virus-like organisms.

The recent 8th Australasian plant virology workshop in Rotorua, New Zealand, discussed the development of a New Zealand database of plant virus and virus-like organisms. Key points of discussion included: (i) the purpose of such a database; (ii) who would benefit from the information in a database; (iii) the scope of a database and its associated collections; (iv) database information and format; and (v) potential funding of such a database. From the workshop and further research, we conclude that the preservation and verification of specimens within the collections and the development of a New Zealand database of plant virus and virus-like organisms is essential. Such a collection will help to fulfil statutory requirements in New Zealand and assist in fulfilling international obligations under the International Plant Protection Convention. Sustaining such a database will assist New Zealand virologists and statutory bodies to undertake scientifically sound research. Establishing reliable records and an interactive database will help to ensure accurate and timely diagnoses of diseases caused by plant viruses and virus-like organisms. Detection of new incursions and their diagnosis will be further enhanced by the use of such reference collections and their associated database. Connecting and associating this information to similar overseas databases would assist international collaborations and allow access to the latest taxonomic and diagnostic resources. Associated scientists working in the areas of plant breeding, export phytosanitary assurance and in the area of the conservation estate would also benefit from access to verified specimens of plant viruses and virus-like organisms. We conclude that funding of a New Zealand database of virus and virus-like organisms and its associated collections should be based partly on Crown funds, as it is a nationally significant biological resource.

Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems using SIMULA

The stimulation technique has gained much importance in the performance studies of Concurrency Control (CC) algorithms for distributed database systems. However, details regarding the simulation methodology and implementation are seldom mentioned in the literature. One objective of this paper is to elaborate the simulation methodology using SIMULA. Detailed studies have been carried out on a centralised CC algorithm and its modified version. The results compare well with a previously reported study on these algorithms. Here, additional results concerning the update intensiveness of transactions and the degree of conflict are obtained. The degree of conflict is quantitatively measured and it is seen to be a useful performance index. Regression analysis has been carried out on the results, and an optimisation study using the regression model has been performed to minimise the response time. Such a study may prove useful for the design of distributed database systems.

CRC27012 A National Diagnostic Database for Emergency Plant Pests

Development of a national diagnostic database for Emergency Plant Pests which will be web-accessible.

Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes

Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are agr-, beta-, and gamma-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing beta-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for beta-acyclicity is developed and is shown equivalent to the existing definitions of beta-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing beta-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of beta-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.

A Bayesian hurdle model for analysis of an insect resistance monitoring database

Motivated by the analysis of the Australian Grain Insect Resistance Database (AGIRD), we develop a Bayesian hurdle modelling approach to assess trends in strong resistance of stored grain insects to phosphine over time. The binary response variable from AGIRD indicating presence or absence of strong resistance is characterized by a majority of absence observations and the hurdle model is a two step approach that is useful when analyzing such a binary response dataset. The proposed hurdle model utilizes Bayesian classification trees to firstly identify covariates and covariate levels pertaining to possible presence or absence of strong resistance. Secondly, generalized additive models (GAMs) with spike and slab priors for variable selection are fitted to the subset of the dataset identified from the Bayesian classification tree indicating possibility of presence of strong resistance. From the GAM we assess trends, biosecurity issues and site specific variables influencing the presence of strong resistance using a variable selection approach. The proposed Bayesian hurdle model is compared to its frequentist counterpart, and also to a naive Bayesian approach which fits a GAM to the entire dataset. The Bayesian hurdle model has the benefit of providing a set of good trees for use in the first step and appears to provide enough flexibility to represent the influence of variables on strong resistance compared to the frequentist model, but also captures the subtle changes in the trend that are missed by the frequentist and naive Bayesian models. © 2014 Springer Science+Business Media New York.

An incident database for improving metro safety: The case of shanghai

Large cities depend heavily on their metro systems to reduce traffic congestion, which is particularly the case with Shanghai, the largest and most developed city in China. For the purposes of enhancing the possibility in quantitative risk assessment and promoting the safety management level in Shanghai metro, an adaptable metro operation incident database (MOID) is therefore presented for containing details of all incidents that have occurred in metro operation. Taking compatibility and simplicity into consideration, Microsoft Access 2010 software is used for the comprehensive and thorough design of the MOID. Based on MOID, statistical characteristics of incident, such as types, causes, time, and severity, are discovered and 24 accident precursors are identified in Shanghai metro. The processes are demonstrated to show how the MOID can be used to identify trends in the incidents that have occurred and to anticipate and prevent future accidents. In order to promote the application of MOID, an organizational structure is proposed from the four aspects of supervision, research, implementation, and manufacturer. This research would be conducive to safety risk analysis in identifying relevant precursors in safety management and assessing safety level as a qualitative tool.

SorGSD: a sorghum genome SNP database

Sorghum (Sorghum bicolor) is one of the most important cereal crops globally and a potential energy plant for biofuel production. In order to explore genetic gain for a range of important quantitative traits, such as drought and heat tolerance, grain yield, stem sugar accumulation, and biomass production, via the use of molecular breeding and genomic selection strategies, knowledge of the available genetic variation and the underlying sequence polymorphisms, is required.

MLDB: macromolecule ligand database

MLDB (macromolecule ligand database) is a knowledge base containing ligands co-crystallized with the three-dimensional structures available in the Protein Data Bank. The proposed knowledge base serves as an open resource for the analysis and visualization of all ligands and their interactions with macromolecular structures. MLDB can be used to search ligands, and their interactions can be visualized both in text and graphical formats. MLDB will be updated at regular intervals (weekly) with automated Perl scripts. The knowledge base is intended to serve the scientific community working in the areas of molecular and structural biology. It is available free to users around the clock and can be accessed at http://dicsoft2.physics.iisc.ernet.in/mldb/.

CancerLectinDB: a database of lectins relevant to cancer

The role of lectins in mediating cancer metastasis, apoptosis as well as various other signaling events has been well established in the past few years. Data on various aspects of the role of lectins in cancer is being accumulated at a rapid pace. The data on lectins available in the literature is so diverse, that it becomes difficult and time-consuming, if not impossible to comprehend the advances in various areas and obtain the maximum benefit. Not only do the lectins vary significantly in their individual functional roles, but they are also diverse in their sequences, structures, binding site architectures, quaternary structures, carbohydrate affinities and specificities as well as their potential applications. An organization of these seemingly independent data into a common framework is essential in order to achieve effective use of all the data towards understanding the roles of different lectins in different aspects of cancer and any resulting applications. An integrated knowledge base (CancerLectinDB) together with appropriate analytical tools has therefore been developed for lectins relevant for any aspect of cancer, by collating and integrating diverse data. This database is unique in terms of providing sequence, structural, and functional annotations for lectins from all known sources in cancer and is expected to be a useful addition to the number of glycan related resources now available to the community. The database has been implemented using MySQL on a Linux platform and web-enabled using Perl-CGI and Java tools. Data for individual lectins pertain to taxonomic, biochemical, domain architecture, molecular sequence and structural details as well as carbohydrate specificities. Extensive links have also been provided for relevant bioinformatics resources and analytical tools. Availability of diverse data integrated into a common framework is expected to be of high value for various studies on lectin cancer biology.

Nash equilibrium based semantic cache in mobile sensor grid database systems

Mobile applications are being increasingly deployed on a massive scale in various mobile sensor grid database systems. With limited resources from the mobile devices, how to process the huge number of queries from mobile users with distributed sensor grid databases becomes a critical problem for such mobile systems. While the fundamental semantic cache technique has been investigated for query optimization in sensor grid database systems, the problem is still difficult due to the fact that more realistic multi-dimensional constraints have not been considered in existing methods. To solve the problem, a new semantic cache scheme is presented in this paper for location-dependent data queries in distributed sensor grid database systems. It considers multi-dimensional constraints or factors in a unified cost model architecture, determines the parameters of the cost model in the scheme by using the concept of Nash equilibrium from game theory, and makes semantic cache decisions from the established cost model. The scenarios of three factors of semantic, time and locations are investigated as special cases, which improve existing methods. Experiments are conducted to demonstrate the semantic cache scheme presented in this paper for distributed sensor grid database systems.