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.

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.

Selecting optimal instantiations of data models - Theory and validation of an ex ante approach

The schema of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. Obtaining quickly the appropriate data increases the likelihood that an organization will make good decisions and respond adeptly to challenges. This research presents and validates a methodology for evaluating, ex ante, the relative desirability of alternative instantiations of a model of data. In contrast to prior research, each instantiation is based on a different formal theory. This research theorizes that the instantiation that yields the lowest weighted average query complexity for a representative sample of information requests is the most desirable instantiation for end-user queries. The theory was validated by an experiment that compared end-user performance using an instantiation of a data structure based on the relational model of data with performance using the corresponding instantiation of the data structure based on the object-relational model of data. Complexity was measured using three different Halstead metrics: program length, difficulty, and effort. For a representative sample of queries, the average complexity using each instantiation was calculated. As theorized, end users querying the instantiation with the lower average complexity made fewer semantic errors, i.e., were more effective at composing queries. (c) 2005 Elsevier B.V. All rights reserved.

Filtering duplicate items over distributed data streams

In recent years many real time applications need to handle data streams. We consider the distributed environments in which remote data sources keep on collecting data from real world or from other data sources, and continuously push the data to a central stream processor. In these kinds of environments, significant communication is induced by the transmitting of rapid, high-volume and time-varying data streams. At the same time, the computing overhead at the central processor is also incurred. In this paper, we develop a novel filter approach, called DTFilter approach, for evaluating the windowed distinct queries in such a distributed system. DTFilter approach is based on the searching algorithm using a data structure of two height-balanced trees, and it avoids transmitting duplicate items in data streams, thus lots of network resources are saved. In addition, theoretical analysis of the time spent in performing the search, and of the amount of memory needed is provided. Extensive experiments also show that DTFilter approach owns high performance.

Direct mesh: A multiresolution approach to terrain visualization

Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use terrain data at variable levels of detail (LOD). Typically, an MTM adopts a tree structure where a parent node represents a lower-resolution approximation of its descendants. Given a region of interest (ROI) and a LOD, the process of retrieving the required terrain data from the database is to traverse the MTM tree from the root to reach all the nodes satisfying the ROI and LOD conditions. This process, while being commonly used for multiresolution terrain visualization, is inefficient as either a large number of sequential I/O operations or fetching a large amount of extraneous data is incurred. Various spatial indexes have been proposed in the past to address this problem, however level-by-level tree traversal remains a common practice in order to obtain topological information among the retrieved terrain data. A new MTM data structure called direct mesh is proposed. We demonstrate that with direct mesh the amount of data retrieval can be substantially reduced. Comparing with existing MTM indexing methods, a significant performance improvement has been observed for real-life terrain data.

Semantic caching for multiresolution spatial query processing in mobile environments

Spatial data are particularly useful in mobile environments. However, due to the low bandwidth of most wireless networks, developing large spatial database applications becomes a challenging process. In this paper, we provide the first attempt to combine two important techniques, multiresolution spatial data structure and semantic caching, towards efficient spatial query processing in mobile environments. Based on the study of the characteristics of multiresolution spatial data (MSD) and multiresolution spatial query, we propose a new semantic caching model called Multiresolution Semantic Caching (MSC) for caching MSD in mobile environments. MSC enriches the traditional three-category query processing in semantic cache to five categories, thus improving the performance in three ways: 1) a reduction in the amount and complexity of the remainder queries; 2) the redundant transmission of spatial data already residing in a cache is avoided; 3) a provision for satisfactory answers before 100% query results have been transmitted to the client side. Our extensive experiments on a very large and complex real spatial database show that MSC outperforms the traditional semantic caching models significantly

An efficient algorithm for partitioning parameterized polygons into rectangles

In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.

Towards pattern-based design recovery

A method and a corresponding tool is described which assist design recovery and program understanding by recognising instances of design patterns semi-automatically. The approach taken is specifically designed to overcome the existing scalability problems caused by many design and implementation variants of design pattern instances. Our approach is based on a new recognition algorithm which works incrementally rather than trying to analyse a possibly large software system in one pass without any human intervention. The new algorithm exploits domain and context knowledge given by a reverse engineer and by a special underlying data structure, namely a special form of an annotated abstract syntax graph. A comparative and quantitative evaluation of applying the approach to the Java AWT and JGL libraries is also given.

Integrating high and moderate spatial resolution image data to estimate forest age structure

The collection of spatial information to quantify changes to the state and condition of the environment is a fundamental component of conservation or sustainable utilization of tropical and subtropical forests, Age is an important structural attribute of old-growth forests influencing biological diversity in Australia eucalypt forests. Aerial photograph interpretation has traditionally been used for mapping the age and structure of forest stands. However this method is subjective and is not able to accurately capture fine to landscape scale variation necessary for ecological studies. Identification and mapping of fine to landscape scale vegetative structural attributes will allow the compilation of information associated with Montreal Process indicators lb and ld, which seek to determine linkages between age structure and the diversity and abundance of forest fauna populations. This project integrated measurements of structural attributes derived from a canopy-height elevation model with results from a geometrical-optical/spectral mixture analysis model to map forest age structure at a landscape scale. The availability of multiple-scale data allows the transfer of high-resolution attributes to landscape scale monitoring. Multispectral image data were obtained from a DMSV (Digital Multi-Spectral Video) sensor over St Mary's State Forest in Southeast Queensland, Australia. Local scene variance levels for different forest tapes calculated from the DMSV data were used to optimize the tree density and canopy size output in a geometric-optical model applied to a Landsat Thematic Mapper (TU) data set. Airborne laser scanner data obtained over the project area were used to calibrate a digital filter to extract tree heights from a digital elevation model that was derived from scanned colour stereopairs. The modelled estimates of tree height, crown size, and tree density were used to produce a decision-tree classification of forest successional stage at a landscape scale. The results obtained (72% accuracy), were limited in validation, but demonstrate potential for using the multi-scale methodology to provide spatial information for forestry policy objectives (ie., monitoring forest age structure).

Stock structure of Spanish mackerel Scomberomorus commerson along the Australian east coast deduced from parasite data

The parasite fauna of Spanish mackerel Scomberomorus commerson from three regions off eastern Australia was examined for evidence of separate stocks. The abundance of five metacestodes was very similar in all areas suggesting that extensive mixing of the fish occurs along the coast, unlike the Situation across northern Australia where large differences have been found between regions. The similarity in abundances of two metacestodes from Townsville fish and south-east Queensland fish Suggests that these two regions have fish with very similar histories. The data lead to the conclusion that the seasonal fishery for Spanish mackerel off south-east Queensland is based on a random group of fish from the same origin as fish sampled off Townsville and is not a subpopulation that moves south each year. (c) 2006 The Fisheries Society of the British Isles.

Fast Structure-Based Assignment of 15N HSQC Spectra of Selectively 15N-Labeled Paramagnetic Proteins

A novel strategy for fast NMR resonance assignment of N-15 HSQC spectra of proteins is presented. It requires the structure coordinates of the protein, a paramagnetic center, and one or more residue-selectively N-15-labeled samples. Comparison of sensitive undecoupled N-15 HSQC spectra recorded of paramagnetic and diamagnetic samples yields data for every cross-peak on pseudocontact shift, paramagnetic relaxation enhancement, cross-correlation between Curie-spin and dipole-dipole relaxation, and residual dipolar coupling. Comparison of these four different paramagnetic quantities with predictions from the three-dimensional structure simultaneously yields the resonance assignment and the anisotropy of the susceptibility tensor of the paramagnetic center. The method is demonstrated with the 30 kDa complex between the N-terminal domain of the epsilon subunit and the theta subunit of Escherichia Coll DNA polymerase III. The program PLATYPUS was developed to perform the assignment, provide a measure of reliability of the assignment, and determine the susceptibility tensor anisotropy.

Solution structure of robustoxin, the lethal neurotoxin from the funnel-web spider Atrax robustus

The solution structure of robustoxin, the lethal neurotoxin from the Sydney funnel-web spider Atrax robustus, has been determined from 2D H-1 NMR data, Robustoxin is a polypeptide of 42 residues cross-linked by four disulphide bonds, the connectivities of which were determined from NMR data and trial structure calculations to be 1-15, 8-20, 14-31 and 16-42 (a 1-4/2-6/3-7/5-8 pattern), The structure consists of a small three-stranded, anti-parallel beta-sheet and a series of interlocking gamma-turns at the C-terminus. It also contains a cystine knot, thus placing it in the inhibitor cystine knot motif family of structures, which includes the omega-conotoxins and a number of plant and animal toxins and protease inhibitors. Robustoxin contains three distinct charged patches on its surface, and an extended loop that includes several aromatic and non-polar residues, Both of these structural features may play a role in its binding to the voltage-gated sodium channel. (C) 1997 Federation of European Biochemical Societies.

Solution structure and proposed binding mechanism of a novel potassium channel toxin kappa-conotoxin PVIIA

Background: kappa-PVIIA is a 27-residue polypeptide isolated from the venom of Conus purpurascens and is the first member of a new class of conotoxins that block potassium channels. By comparison to other ion channels of eukaryotic cell membranes, voltage-sensitive potassium channels are relatively simple and methodology has been developed for mapping their interactions with small-peptide toxins, PVIIA, therefore, is a valuable new probe of potassium channel structure. This study of the solution structure and mode of channel binding of PVIIA forms the basis for mapping the interacting residues at the conotoxin-ion channel interface. Results: The three-dimensional structure of PVIIA resembles the triple-stranded beta sheet/cystine-knot motif formed by a number of toxic and inhibitory peptides. Subtle structural differences, predominantly in loops 2 and 4, are observed between PVIIA and other conotoxins with similar structural frameworks, however. Electrophysiological binding data suggest that PVIIA blocks channel currents by binding in a voltage-sensitive manner to the external vestibule and occluding the pore, Comparison of the electrostatic surface of PVIIA with that of the well-characterised potassium channel blocker charybdotoxin suggests a likely binding orientation for PVIIA, Conclusions: Although the structure of PVIIA is considerably different to that of the alpha K scorpion toxins, it has a similar mechanism of channel blockade. On the basis of a comparison of the structures of PVIIA and charybdotoxin, we suggest that Lys19 of PVIIA is the residue which is responsible for physically occluding the pore of the potassium channel.

Structure determination of the three disulfide bond isomers of alpha-conotoxin GI: A model for the role of disulfide bonds in structural stability

The three possible disulfide bonded isomers of alpha-conotoxin GI have been selectively synthesised and their structures determined by H-1 NMR spectroscopy. alpha-Conotoxin GI derives from the venom of Conus geographus and is a useful neuropharmacological tool as it selectively binds to the nicotinic acetylcholine receptor (nAChR), a ligand-gated ion channel involved in nerve signal transmission. The peptide has the sequence ECCNPACGRHYSC-NH2, and the three disulfide bonded isomers are referred to as GI(2-7;3-13), GI(2-13;3-7) and GI(2-3;7-13). The NMR structure for the native isomer GI(2-7;3-13) is of excellent quality, with a backbone pairwise RMSD of 0.16 Angstrom for a family of 35 structures, and comprises primarily a distorted 3(10),, helix between residues 5 to 11. The two non-native isomers exhibit multiple conformers in solution, with the major populated forms being different in structure both from each other and from the native form. Structure-activity relationships for the native GI(2-7;3-13) as well as the role of the disulfide bonds on folding and stability of the three isomers are examined. It is concluded that the disulfide bonds in alpha-conotoxin GI play a crucial part in determining both the structure and stability of the peptide. A trend for increased conformational heterogeneity was observed in the order of GI(2-7;3-13) < GI(2-13;3-7) < GI(2-3;7-13). It was found that the peptide bond joining Cys2 to Cys3 in GI(2-3;7-13) is predominantly trans, rather than cis as theoretically predicted. These structural data are used to interpret the varying nAChR binding of the non-native forms. A model for the binding of native GI(2-7;3-13) to the mammalian nAChR is proposed, with an alpha-subunit binding face made up of Cys2, Asn4, Pro5, Ala6 and Cys7 and a selectivity face, comprised of Arg9 and His10. These two faces orient the molecule between the alpha and delta subunits of the receptor. The structure of the CCNPAC sequence of the native GI(2-7;3-13) is compared to the structure of the identical sequence from the toxic domain of heat-stable enterotoxins, which forms part of the receptor binding region of the enterotoxins, but which has a different disulfide connectivity. (C) 1998 Academic Press Limited.

Structure of Caribbean ciguatoxin isolated from Caranx latus

Caribbean ciguatoxins (C-CTXs) are responsible for the widespread occurrence of ciguatera in the Caribbean Sea. The structure and configuration of C-CTX-1 (1), the major ciguatoxin isolated from the horse-eye jack (Caranx latus), has been determined from DQF-COSY, E-COSY, TOCSY, NOESY, POESY, ge-HSQC. and HMQC experiments performed at 750 MHz and 500 MHz on a 0.13 pmol sample. C-CTX-1 ([M + H](+) m/z 1141.6 Da, molecular formula C62H92O19) has a ciguatoxin/breveroxin ladder structure comprising 14 trans-fused, ether-linked rings (7/6/6/7/8/9/7/6/8/6/7/6/7/6) assembled fi um 6 protonated fragments. The relative stereochemistry and ring configuration of 1 was determined from an analysis of coupling constant and NOE data. Like ciguatoxins in the Pacific Ocean (P-CTX), C-CTX-1 possesses a flexible nine-membered ring which may be a conserved feature among ciguatoxins. However, C-CTX-1 has a longer contiguous carbon backbone (57 vs 55 carbons for P-CTX-1), one extra ring, and a hemiketal in ring N but no spiroketal as found in P-CTX. C-CTX-1 possesses a primary hydroxyl which may allow selective derivatization. A minor analogue, C-CTX-2, was also isolated from fish and assigned the structure 56 epi-C-CTX-1 (2). since it slowly rearranged to C-CTX-1 in solution. Given the structural similarities between Caribbean and Pacific ciguatoxins, we propose that C-CTX-1 and C-CTX-2 arise from a Caribbean strain of the benthic dinoflagellate, Gambierdiscus toxicus.