Special issue on advances in data mining and its applications

Data mining is the process to identify valid, implicit, previously unknown, potentially useful and understandable information from large databases. It is an important step in the process of knowledge discovery in databases, (Olaru & Wehenkel, 1999). In a data mining process, input data can be structured, seme-structured, or unstructured. Data can be in text, categorical or numerical values. One of the important characteristics of data mining is its ability to deal data with large volume, distributed, time variant, noisy, and high dimensionality. A large number of data mining algorithms have been developed for different applications. For example, association rules mining can be useful for market basket problems, clustering algorithms can be used to discover trends in unsupervised learning problems, classification algorithms can be applied in decision-making problems, and sequential and time series mining algorithms can be used in predicting events, fault detection, and other supervised learning problems (Vapnik, 1999). Classification is among the most important tasks in the data mining, particularly for data mining applications into engineering fields. Together with regression, classification is mainly for predictive modelling. So far, there have been a number of classification algorithms in practice. According to (Sebastiani, 2002), the main classification algorithms can be categorized as: decision tree and rule based approach such as C4.5 (Quinlan, 1996); probability methods such as Bayesian classifier (Lewis, 1998); on-line methods such as Winnow (Littlestone, 1988) and CVFDT (Hulten 2001), neural networks methods (Rumelhart, Hinton & Wiliams, 1986); example-based methods such as k-nearest neighbors (Duda & Hart, 1973), and SVM (Cortes & Vapnik, 1995). Other important techniques for classification tasks include Associative Classification (Liu et al, 1998) and Ensemble Classification (Tumer, 1996).

Recent development in the mechanics of superplasticity and its applications

This paper reviews the recent developments in the mechanics of superplasticity and its applications in industrial practice. After introducing the phenomena of superplasticity, the basic experiments for determining material deformation behavior and related parameters, and constructing superplastic constitutive equations, are reviewed. Finite element related formulations and techniques for simulating superplastic forming are discussed, together with some practical applications. (C) 2004 Elsevier B.V. All rights reserved.

Edge-to-edge matching and its applications - Part I. Application to the simple HCP/BCC system

The edge-to-edge matching crystallographic model has been used to predict all the orientation relationships (OR) between crystals that have simple hexagonal close packed (HCP) and body-centered cubic (BCC) structures. Using the critical values for the interatomic spacing misfit along the matching directions and the cl-value mismatch between matching planes, the model predicted all the four common ORs, namely the Burgers OR, the Potter OR, the Pitsch-Schrader OR and the Rong Dunlop OR, together with the corresponding habit planes. Taking the c(H)/a(H) and a(H)/a(B) ratios as variables, where H and B denote the HCP and BCC structures respectively, the model also predicted the relationship between these variables and the four ORs. These predictions are perfectly consistent with the published experimental results. As was the case in the FCC/BCC system, the edge-to-edge matching model has been shown to be a powerful tool for predicting the crystallographic features of diffusion-controlled phase transformations. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Edge-to-edge matching and its applications - Part II. Application to Mg-Al, Mg-Y and Mg-Mn alloys

A model for the crystallography and morphology of diffusion-controlled phase transformations - edge-to-edge matching - has been used to predict the orientation relationships (OR) and habit planes of precipitates Mg17Al12 in Mg-Al alloy, Mg24Y5 in Mg-Y alloy and alpha-Mn in Mg-Mn alloy. Based on the crystal structures and lattice parameters only, the model predicts that the possible ORs between Mg17Al12 and Mg matrix are the near Burgers OR, the Potter OR, the Gjonnes-Ostmoe OR and the Crawley OR. In the Mg-Y alloy, the OR between Mg24Y5 precipitates and the Mg matrix is predicted to be the Burgers OR only. The model also predicts that there are no reproducible ORs between alpha-Mn and Mg in the Mg-Mn alloy. Combining the edge-to-edge matching model and W. Zhang's Deltag approach, the habit plane and side facets of the precipitate for each OR can be determined. All the predicted ORs and the corresponding habit planes in Mg-Al and Mg-Y alloys agree very well with the experimental results. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Semantic caching for web-based spatial applications

Client-side caching of spatial data is an important yet very much under investigated issue. Effective caching of vector spatial data has the potential to greatly improve the performance of spatial applications in the Web and wireless environments. In this paper, we study the problem of semantic spatial caching, focusing on effective organization of spatial data and spatial query trimming to take advantage of cached data. Semantic caching for spatial data is a much more complex problem than semantic caching for aspatial data. Several novel ideas are proposed in this paper for spatial applications. A number of typical spatial application scenarios are used to generate spatial query sequences. An extensive experimental performance study is conducted based on these scenarios using real spatial data. We demonstrate a significant performance improvement using our ideas.

Protein crystallography and examples of its applications in medicinal chemistry

The field of protein crystallography inspires and enthrals, whether it be for the beauty and symmetry of a perfectly formed protein crystal, the unlocked secrets of a novel protein fold, or the precise atomic-level detail yielded from a protein-ligand complex. Since 1958, when the first protein structure was solved, there have been tremendous advances in all aspects of protein crystallography, from protein preparation and crystallisation through to diffraction data measurement and structure refinement. These advances have significantly reduced the time required to solve protein crystal structures, while at the same time substantially improving the quality and resolution of the resulting structures. Moreover, the technological developments have induced researchers to tackle ever more complex systems, including ribosomes and intact membrane-bound proteins, with a reasonable expectation of success. In this review, the steps involved in determining a protein crystal structure are described and the impact of recent methodological advances identified. Protein crystal structures have proved to be extraordinarily useful in medicinal chemistry research, particularly with respect to inhibitor design. The precise interaction between a drug and its receptor can be visualised at the molecular level using protein crystal structures, and this information then used to improve the complementarity and thus increase the potency and selectivity of an inhibitor. The use of protein crystal structures in receptor-based drug design is highlighted by (i) HIV protease, (ii) influenza virus neuraminidase and (iii) prostaglandin H-2-synthetase. These represent, respectively, examples of protein crystal structures that (i) influenced the design of drugs currently approved for use in the treatment of HIV infection, (ii) led to the design of compounds currently in clinical trials for the treatment of influenza infection and (iii) could enable the design of highly specific non-steroidal anti-inflammatory drugs that lack the common side-effects of this drug class.

An approach to ontology for institutional facts in the semantic web

Refinement in software engineering allows a specification to be developed in stages, with design decisions taken at earlier stages constraining the design at later stages. Refinement in complex data models is difficult due to lack of a way of defining constraints, which can be progressively maintained over increasingly detailed refinements. Category theory provides a way of stating wide scale constraints. These constraints lead to a set of design guidelines, which maintain the wide scale constraints under increasing detail. Previous methods of refinement are essentially local, and the proposed method does not interfere very much with these local methods. The result is particularly applicable to semantic web applications, where ontologies provide systems of more or less abstract constraints on systems, which must be implemented and therefore refined by participating systems. With the approach of this paper, the concept of committing to an ontology carries much more force. (c) 2005 Elsevier B.V. All rights reserved.

Multiresolution spatial databases: Making web-based spatial applications faster

Spatial data has now been used extensively in the Web environment, providing online customized maps and supporting map-based applications. The full potential of Web-based spatial applications, however, has yet to be achieved due to performance issues related to the large sizes and high complexity of spatial data. In this paper, we introduce a multiresolution approach to spatial data management and query processing such that the database server can choose spatial data at the right resolution level for different Web applications. One highly desirable property of the proposed approach is that the server-side processing cost and network traffic can be reduced when the level of resolution required by applications are low. Another advantage is that our approach pushes complex multiresolution structures and algorithms into the spatial database engine. That is, the developer of spatial Web applications needs not to be concerned with such complexity. This paper explains the basic idea, technical feasibility and applications of multiresolution spatial databases.

Adaptive management and its role in managing Great Barrier Reef water quality

Adaptive management is the pathway to effective conservation, use and management of Australia’s coastal catchments and waterways. While the concepts of adaptive management are not new, applications involving both assessment and management responses are indeed limited at the national and regional scales. This paper outlines the components of a systematic framework for linking scientific knowledge, existing tools, planning approaches and participatory processes to achieve healthy regional partnerships between community, industry, government agencies and science providers to overcome institutional barriers and uncoordinated monitoring. The framework developed by the Coastal CRC (www.coastal.crc.org.au/amf/amf_index.htm) is hierarchical in the way it displays information to allow associated frameworks to be integrated, and represents a construct in which processes, information, decision tools and outcomes are brought together in a structured and transparent way for adaptive catchment and coastal management. This paper proposes how an adaptive management approach could be used to benefit the implementation of the Reef Water Quality Protection Plan (RWQPP).

Examination of emotional priming among children and young adolescents: Developmental issues and its association with anxiety

An affective priming task was used to examine bias in the processing of threat-related material in 25 clinically anxious compared to 25 matched, non-anxious control children and young adolescents. No significant differences were found between anxious and non-anxious children in terms of priming effects. However, age-related differences were found depending upon the valence of the target, independent of anxiety status. Both younger (7-10 years) and older (11-14 years) children showed faster response times to pleasant targets when they were preceded by a congruent compared to incongruent stimulus, consistent with a traditional priming effect. For threat target stimuli, older children showed no difference in response latency according to the congruency of the prime-target valence. Younger children, in contrast, showed a reverse priming effect for threat target stimuli, with slower response times for threat-congruent trials than for threat targets preceded by a pleasant prime. Possible explanations for developmental differences in the processing of threat-related material are discussed.

It's all very well, in theory: Theoretical perspectives and their applications in contemporary pedagogical research

Current debates about educational theory are concerned with the relationship between knowledge and power and thereby issues such as who possesses a truth and how have they arrived at it, what questions are important to ask, and how should they best be answered. As such, these debates revolve around questions of preferred, appropriate, and useful theoretical perspectives. This paper overviews the key theoretical perspectives that are currently used in physical education pedagogy research and considers how these inform the questions we ask and shapes the conduct of research. It also addresses what is contested with respect to these perspectives. The paper concludes with some cautions about allegiances to and use of theories in line with concerns for the applicability of educational research to pressing social issues.