Matching prescription claims with medication data for nursing home residents: Implications for prescriber feedback, drug utilisation studies and selection of prescription claims database

Medication data retrieved from Australian Repatriation Pharmaceutical Benefits Scheme (RPBS) claims for 44 veterans residing in nursing homes and Pharmaceutical Benefits Scheme (PBS) claims for 898 nursing home residents were compared with medication data from nursing home records to determine the optimal time interval for retrieving claims data and its validity. Optimal matching was achieved using 12 weeks of RPBS claims data, with 60% of medications in the RPBS claims located in nursing home administration records, and 78% of medications administered to nursing home residents identified in RPBS claims. In comparison, 48% of medications administered to nursing home residents could be found in 12 weeks of PBS data, and 56% of medications present in PBS claims could be matched with nursing home administration records. RPBS claims data was superior to PBS, due to the larger number of scheduled items available to veterans and the veteran's file number, which acts as a unique identifier. These findings should be taken into account when using prescription claims data for medication histories, prescriber feedback, drug utilisation, intervention or epidemiological studies. (C) 2001 Elsevier Science Inc. All rights reserved.

Partial automation of database processing of simulation outputs from L-systems models of plant morphogenesis

Models of plant architecture allow us to explore how genotype environment interactions effect the development of plant phenotypes. Such models generate masses of data organised in complex hierarchies. This paper presents a generic system for creating and automatically populating a relational database from data generated by the widely used L-system approach to modelling plant morphogenesis. Techniques from compiler technology are applied to generate attributes (new fields) in the database, to simplify query development for the recursively-structured branching relationship. Use of biological terminology in an interactive query builder contributes towards making the system biologist-friendly. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.

The work of fracture in uniaxial and biaxial oriented unplasticised polyvinylchloride pipes

In oriented unplasticised polyvinylchloride (uPVC) pipes, cracks propagate tangentially rather than through the wall as in conventional pipe. Notched impact, a modified peel test and the specific work of fracture approach have been used to measure fracture toughness of a conventionally extruded, a uniaxially oriented and a biaxially oriented uPVC pipe in different directions. The different failure mode for the oriented pipes was found to result from an order of magnitude increase in the fracture toughness for cracks propagating perpendicular to the orientation direction. Differences in the fracture toughness between the oriented pipes were also related to their molecular orientation. (C) 2002 Elsevier Science Ltd. All rights reserved.

Polarised infrared and differential scanning calorimetry studies on oriented vinyl pipe materials

The molecular orientation in a conventionally extruded PVC pipe, a uniaxially oriented PVC pipe and a biaxially oriented PVC pipe has been studied via Infrared dichroism. The degree of order or crystallinity has also been studied by Differential Scanning Calorimetry and also via Infrared Spectroscopy. The fundamental structural difference between the conventional and oriented pipes was that polymer chains were preferentially aligning in the hoop direction for oriented pipes whereas they were fairly isotropic in the conventional pipe with a slight preferential alignment in the axial direction. Analysis of the C-Cl stretching mode indicated that the uniaxially oriented pipe had much higher alignment of the C-Cl bond in the axial direction than the biaxial pipe, which correlates with higher fracture toughness for circumferential cracking in the biaxial pipe. Both DSC and Infrared spectroscopy detected little change in the crystallinity or order in the oriented pipes compared to the conventionally extruded pipes. (C) 2002 Kluwer Academic Publishers.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

Cognitive style factors affecting database query performance

As end-user computing becomes more pervasive, an organization's success increasingly depends on the ability of end-users, usually in managerial positions, to extract appropriate data from both internal and external sources. Many of these data sources include or are derived from the organization's accounting information systems. Managerial end-users with different personal characteristics and approaches are likely to compose queries of differing levels of accuracy when searching the data contained within these accounting information systems. This research investigates how cognitive style elements of personality influence managerial end-user performance in database querying tasks. A laboratory experiment was conducted in which participants generated queries to retrieve information from an accounting information system to satisfy typical information requirements. The experiment investigated the influence of personality on the accuracy of queries of varying degrees of complexity. Relying on the Myers–Briggs personality instrument, results show that perceiving individuals (as opposed to judging individuals) who rely on intuition (as opposed to sensing) composed queries more accurately. As expected, query complexity and academic performance also explain the success of data extraction tasks.

Introducing OTseeker (Occupational Therapy Systematic Evaluation of Evidence): A new evidence database for occupational therapists

OTseeker (Occupational Therapy Systematic Evaluation of Evidence) is a new resource for occupational therapists that has been designed with the principle aim of increasing access to research to support clinical decisions. It contains abstracts of systematic reviews and quality ratings of randomized controlled trials (RCTs) relevant to occupational therapy. It is available, free of charge, at www.otseeker.com. This paper describes the OTseeker database and provides an example of how it may support occupational therapy practice.

Database technologies for l-system simulations in virtual plant applications on bioinformatics

One of the most important advantages of database systems is that the underlying mathematics is rich enough to specify very complex operations with a small number of statements in the database language. This research covers an aspect of biological informatics that is the marriage of information technology and biology, involving the study of real-world phenomena using virtual plants derived from L-systems simulation. L-systems were introduced by Aristid Lindenmayer as a mathematical model of multicellular organisms. Not much consideration has been given to the problem of persistent storage for these simulations. Current procedures for querying data generated by L-systems for scientific experiments, simulations and measurements are also inadequate. To address these problems the research in this paper presents a generic process for data-modeling tools (L-DBM) between L-systems and database systems. This paper shows how L-system productions can be generically and automatically represented in database schemas and how a database can be populated from the L-system strings. This paper further describes the idea of pre-computing recursive structures in the data into derived attributes using compiler generation. A method to allow a correspondence between biologists' terms and compiler-generated terms in a biologist computing environment is supplied. Once the L-DBM gets any specific L-systems productions and its declarations, it can generate the specific schema for both simple correspondence terminology and also complex recursive structure data attributes and relationships.

Researchers' information needs in the bibliographic database : a literature review

This article is published online with Open Access and distributed under the terms of the Creative Commons Attribution Non-Commercial License.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs