Mesoionic pyridopyrimidinylium and pyridooxazinylium olates and non-mesoionic pyridopyrimidinones. Structures in the solid state, solution, and matrices

X-Ray crystal structures, C-13 NMR spectra and theoretical calculations (B3LYP/6-31G*) are reported for the mesoionic (zwitterionic) pyridopyrimidinylium- and pyridooxazinyliumolates 2a, 3a and 5a,b as well as the enol ether 11b and the enamine 11c. The 1-NH compounds like 1a, 2a and 3a exist in the mesoionic form in the crystal and in solution, but the OH tautomers such as 1b and 2b dominate in the gas phase as revealed by the Ar matrix IR spectra in conjunction with DFT calculations. All data indicate that the mesoionic compounds can be regarded as intramolecular pyridine-ketene zwitterions (cf. 16 --> 17) with a high degree of positive charge on the pyridinium nitrogen, a long pyridinium N-CO bond (ca. 1.44-1.49 Angstrom), and normal C=O double bonds (ca. 1.22 Angstrom). All mesoionic compounds exhibit a pronounced tilting of the olate C=O groups (the C=O groups formally derived from a ketene) towards the pyridinium nitrogen, giving NCO angles of 110-118 degrees. Calculations reveal a hydrogen bond with 6-CH, analogous to what is found in ketene-pyridine zwitterions and the C3O2-pyridine complex. The 2-OH tautomers of type 1b, 2b, and 11 also show a high degree of zwitterionic character as indicated by the canonical structures 11 12.

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.

Data quality initiatives - striving for continuous improvements

Although managers consider accurate, timely, and relevant information as critical to the quality of their decisions, evidence of large variations in data quality abounds. Over a period of twelve months, the action research project reported herein attempted to investigate and track data quality initiatives undertaken by the participating organisation. The investigation focused on two types of errors: transaction input errors and processing errors. Whenever the action research initiative identified non-trivial errors, the participating organisation introduced actions to correct the errors and prevent similar errors in the future. Data quality metrics were taken quarterly to measure improvements resulting from the activities undertaken during the action research project. The action research project results indicated that for a mission-critical database to ensure and maintain data quality, commitment to continuous data quality improvement is necessary. Also, communication among all stakeholders is required to ensure common understanding of data quality improvement goals. The action research project found that to further substantially improve data quality, structural changes within the organisation and to the information systems are sometimes necessary. The major goal of the action research study is to increase the level of data quality awareness within all organisations and to motivate them to examine the importance of achieving and maintaining high-quality data.

Development and evaluation of neural network freeway incident detection models using field data

This paper discusses a multi-layer feedforward (MLF) neural network incident detection model that was developed and evaluated using field data. In contrast to published neural network incident detection models which relied on simulated or limited field data for model development and testing, the model described in this paper was trained and tested on a real-world data set of 100 incidents. The model uses speed, flow and occupancy data measured at dual stations, averaged across all lanes and only from time interval t. The off-line performance of the model is reported under both incident and non-incident conditions. The incident detection performance of the model is reported based on a validation-test data set of 40 incidents that were independent of the 60 incidents used for training. The false alarm rates of the model are evaluated based on non-incident data that were collected from a freeway section which was video-taped for a period of 33 days. A comparative evaluation between the neural network model and the incident detection model in operation on Melbourne's freeways is also presented. The results of the comparative performance evaluation clearly demonstrate the substantial improvement in incident detection performance obtained by the neural network model. The paper also presents additional results that demonstrate how improvements in model performance can be achieved using variable decision thresholds. Finally, the model's fault-tolerance under conditions of corrupt or missing data is investigated and the impact of loop detector failure/malfunction on the performance of the trained model is evaluated and discussed. The results presented in this paper provide a comprehensive evaluation of the developed model and confirm that neural network models can provide fast and reliable incident detection on freeways. (C) 1997 Elsevier Science Ltd. All rights reserved.

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 scaleless data model for direct and progressive spatial query processing

A progressive spatial query retrieves spatial data based on previous queries (e.g., to fetch data in a more restricted area with higher resolution). A direct query, on the other side, is defined as an isolated window query. A multi-resolution spatial database system should support both progressive queries and traditional direct queries. It is conceptually challenging to support both types of query at the same time, as direct queries favour location-based data clustering, whereas progressive queries require fragmented data clustered by resolutions. Two new scaleless data structures are proposed in this paper. Experimental results using both synthetic and real world datasets demonstrate that the query processing time based on the new multiresolution approaches is comparable and often better than multi-representation data structures for both types of queries.

Dissecting query performance in logical data models: Parsimony vs. greater ontological clarity

Even when data repositories exhibit near perfect data quality, users may formulate queries that do not correspond to the information requested. Users’ poor information retrieval performance may arise from either problems understanding of the data models that represent the real world systems, or their query skills. This research focuses on users’ understanding of the data structures, i.e., their ability to map the information request and the data model. The Bunge-Wand-Weber ontology was used to formulate three sets of hypotheses. Two laboratory experiments (one using a small data model and one using a larger data model) tested the effect of ontological clarity on users’ performance when undertaking component, record, and aggregate level tasks. The results indicate for the hypotheses associated with different representations but equivalent semantics that parsimonious data model participants performed better for component level tasks but that ontologically clearer data model participants performed better for record and aggregate level tasks.

Formal verification of ASM designs using the MDG tool

In this paper, we present a formal hardware verification framework linking ASM with MDG. ASM (Abstract State Machine) is a state based language for describing transition systems. MDG (Multiway Decision Graphs) provides symbolic representation of transition systems with support of abstract sorts and functions. We implemented a transformation tool that automatically generates MDG models from ASM specifications, then formal verification techniques provided by the MDG tool, such as model checking or equivalence checking, can be applied on the generated models. We support this work with a case study of an Island Tunnel Controller, which behavior and structure were specified in ASM then using our ASM-MDG tool successfully verified within the MDG tool.

Incremental derivation of abstraction relations for data refinements

Data refinements are refinement steps in which a program’s local data structures are changed. Data refinement proof obligations require the software designer to find an abstraction relation that relates the states of the original and new program. In this paper we describe an algorithm that helps a designer find an abstraction relation for a proposed refinement. Given sufficient time and space, the algorithm can find a minimal abstraction relation, and thus show that the refinement holds. As it executes, the algorithm displays mappings that cannot be in any abstraction relation. When the algorithm is not given sufficient resources to terminate, these mappings can help the designer find a suitable abstraction relation. The same algorithm can be used to test an abstraction relation supplied by the designer.

Integrable Kondo impurities in the one-dimensional supersymmetric U model of strongly correlated electrons

Integrable Kondo impurities in the one-dimensional supersymmetric U model of strongly correlated electrons are studied by means of the boundary graded quantum inverse scattering method. The boundary K-matrices depending on the local magnetic moments of the impurities are presented as non-trivial realizations of the reflection equation algebras in an impurity Hilbert space. Furthermore, the model Hamiltonian is diagonalized and the Bethe ansatz equations are derived. It is interesting to note that our model exhibits a free parameter in the bulk Hamiltonian but no free parameter exists on the boundaries. This is in sharp contrast to the impurity models arising from the supersymmetric t-J and extended Hubbard models where there is no free parameter in the bulk but there is a free parameter on each boundary.

Integrable Kondo impurities in the one-dimensional supersymmetric extended Hubbard model

An integrable Kondo problem in the one-dimensional supersymmetric extended Hubbard model is studied by means of the boundary graded quantum inverse scattering method. The boundary K-matrices depending on the local moments of the impurities are presented as a non-trivial realization of the graded reflection equation algebras in a two-dimensional impurity Hilbert space. Further, the model is solved by using the algebraic Bethe ansatz method and the Bethe ansatz equations are obtained.

The incidence of schizophrenia: A systematic review

There has been a debate on whether or not the incidence of schizophrenia varies across time and place. In order to optimise the evidence upon which this debate is based, we have undertaken a systematicsystematic review of the literature. In this paper we provide an overview of the methods of the review and a preliminary analysis of the studies identified to date. Electronic databases (Medline, Psychlnfo, Embase, LILAC) were systematically searched for articles published between January 1965 and December 2001. The search terms were: (schizo* OR psycho*)AND (incidence OR prevalence). References were also identified from review articles, reference list and by writing to authors. To date we have identified 137 papers drawn from 33 nations. 37 papers in language other than English await translation. The currently included papers have generated 1413 different items of rate information data. In order to analyze these data we have undertaken several sequential filters in order to identify (a) non-overlapping data, (b) birth cohort study versus noncohort studies, (c) overall and sex-specific rates, (d) diagnostic criteria, (e) age ranges, (f) epoch of study, and (g) data on migrant or other special interest groups. In addition, we will examine the impact of urbanicity of site, age and/or sex standardization, and quality score on the incidence rates. The various discrete incidence rates will be presented graphically and the impact of various filters on these rates will be inspected using meta-analytic techniques. The use of meta-analysis may help elucidate the epidemiological landscape with respect to the incidence of schizophrenia and aid in the generation of new hypothesis. Acknowledgements: The Stanley Medical Research Institute supported project