Mechanical alloying of MoSi2 with ternary alloying elements. Part 1: Experimental

Phase evolution during the mechanical alloying of Mo and Si elemental powders with a ternary addition of Al, Mg, Ti or Zr was monitored using X-ray diffraction. Rietveld analysis was used to quantify the phase proportions. When Mo and Si are mechanically alloyed in the absence of a ternary element, the tetragonal C11b polymorph of MoSi2 (t-MoSi2) forms by a self-propagating combustion reaction. With additional milling, the tetragonal phase transforms to the hexagonal C40 structure (h-MoSi2). The mechanical alloying of Al, Mg and Ti additions with Mo and Si tend to promote a more rapid transformation of t-MoSi2 to h-MoSi2. In high concentrations, the addition of these ternary elements inhibits the initial combustion reaction, instead promoting the direct formation of h-MoSi2. The addition of Zr tends to stabilise the tetragonal phase.

Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images

Mixture models implemented via the expectation-maximization (EM) algorithm are being increasingly used in a wide range of problems in pattern recognition such as image segmentation. However, the EM algorithm requires considerable computational time in its application to huge data sets such as a three-dimensional magnetic resonance (MR) image of over 10 million voxels. Recently, it was shown that a sparse, incremental version of the EM algorithm could improve its rate of convergence. In this paper, we show how this modified EM algorithm can be speeded up further by adopting a multiresolution kd-tree structure in performing the E-step. The proposed algorithm outperforms some other variants of the EM algorithm for segmenting MR images of the human brain. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Pseudo-ternary phase diagrams of aqueous mixtures of Quil A, cholesterol and phospholipid prepared by the lipid-film hydration method

Pseudo-ternary phase diagrams of the polar lipids Quil A, cholesterol (Chol) and phosphatidylcholine (PC) in aqueous mixtures prepared by the lipid film hydration method (where dried lipid film of phospholipids and cholesterol are hydrated by an aqueous solution of Quil A) were investigated in terms of the types of particulate structures formed therein. Negative staining transmission electron microscopy and polarized light microscopy were used to characterize the colloidal and coarse dispersed particles present in the systems. Pseudo-ternary phase diagrams were established for lipid mixtures hydrated in water and in Tris buffer (pH 7.4). The effect of equilibration time was also studied with respect to systems hydrated in water where the samples were stored for 2 months at 4degreesC. Depending on the mass ratio of Quil A, Chol and PC in the systems, various colloidal particles including ISCOM matrices, liposomes, ring-like micelles and worm-like micelles were observed. Other colloidal particles were also observed as minor structures in the presence of these predominant colloids including helices, layered structures and lamellae (hexagonal pattern of ring-like micelles). In terms of the conditions which appeared to promote the formation of ISCOM matrices, the area of the phase diagrams associated with systems containing these structures increased in the order: hydrated in water/short equilibration period < hydrated in buffer/short equilibration period < hydrated in water/prolonged equilibration period. ISCOM matrices appeared to form over time from samples, which initially contained a high concentration of ring-like micelles suggesting that these colloidal structures may be precursors to ISCOM matrix formation. Helices were also frequently found in samples containing ISCOM matrices as a minor colloidal structure. Equilibration time and presence of buffer salts also promoted the formation of liposomes in systems not containing Quil A. These parameters however, did not appear to significantly affect the occurrence and predominance of other structures present in the pseudo-binary systems containing Quil A. Pseudo-ternary phase diagrams of PC, Chol and Quil A are important to identify combinations which will produce different colloidal structures, particularly ISCOM matrices, by the method of lipid film hydration. Colloidal structures comprising these three components are readily prepared by hydration of dried lipid films and may have application in vaccine delivery where the functionality of ISCOMs has clearly been demonstrated. (C) 2003 Elsevier B.V. All rights reserved.

GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA

Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA structure and flexibility may also play a role in protein-DNA interactions, the simultaneous exploration of sequence-and structure-based hypotheses about the composition of binding sites and the ordering of features in a regulatory region should be considered as well. The consideration of structural features requires the development of new detection tools that can deal with data types other than primary sequence. Results: GANN ( available at http://bioinformatics.org.au/gann) is a machine learning tool for the detection of conserved features in DNA. The software suite contains programs to extract different regions of genomic DNA from flat files and convert these sequences to indices that reflect sequence and structural composition or the presence of specific protein binding sites. The machine learning component allows the classification of different types of sequences based on subsamples of these indices, and can identify the best combinations of indices and machine learning architecture for sequence discrimination. Another key feature of GANN is the replicated splitting of data into training and test sets, and the implementation of negative controls. In validation experiments, GANN successfully merged important sequence and structural features to yield good predictive models for synthetic and real regulatory regions. Conclusion: GANN is a flexible tool that can search through large sets of sequence and structural feature combinations to identify those that best characterize a set of sequences.

A new algorithm for the detection of intercluster galaxy filaments using galaxy orientation alignments

We present a new algorithm for detecting intercluster galaxy filaments based upon the assumption that the orientations of constituent galaxies along such filaments are non-isotropic. We apply the algorithm to the 2dF Galaxy Redshift Survey catalogue and find that it readily detects many straight filaments between close cluster pairs. At large intercluster separations (> 15 h(-1) Mpc), we find that the detection efficiency falls quickly, as it also does with more complex filament morphologies. We explore the underlying assumptions and suggest that it is only in the case of close cluster pairs that we can expect galaxy orientations to be significantly correlated with filament direction.

Hierarchical indexing structure for efficient similarity search in video retrieval

With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is gaining its importance. To support such applications efficiently, content-based video indexing must be addressed. Typically, each video is represented by a sequence of frames. Due to the high dimensionality of frame representation and the large number of frames, video indexing introduces an additional degree of complexity. In this paper, we address the problem of content-based video indexing and propose an efficient solution, called the Ordered VA-File (OVA-File) based on the VA-file. OVA-File is a hierarchical structure and has two novel features: 1) partitioning the whole file into slices such that only a small number of slices are accessed and checked during k Nearest Neighbor (kNN) search and 2) efficient handling of insertions of new vectors into the OVA-File, such that the average distance between the new vectors and those approximations near that position is minimized. To facilitate a search, we present an efficient approximate kNN algorithm named Ordered VA-LOW (OVA-LOW) based on the proposed OVA-File. OVA-LOW first chooses possible OVA-Slices by ranking the distances between their corresponding centers and the query vector, and then visits all approximations in the selected OVA-Slices to work out approximate kNN. The number of possible OVA-Slices is controlled by a user-defined parameter delta. By adjusting delta, OVA-LOW provides a trade-off between the query cost and the result quality. Query by video clip consisting of multiple frames is also discussed. Extensive experimental studies using real video data sets were conducted and the results showed that our methods can yield a significant speed-up over an existing VA-file-based method and iDistance with high query result quality. Furthermore, by incorporating temporal correlation of video content, our methods achieved much more efficient performance.

Modelling the structure of latexin-carboxypeptidase A complex based on chemical cross-linking and molecular docking

We have determined the three-dimensional structure of the protein complex between latexin and carboxypeptidase A using a combination of chemical cross-linking, mass spectrometry and molecular docking. The locations of three intermolecular cross-links were identified using mass spectrometry and these constraints were used in combination with a speed-optimised docking algorithm allowing us to evaluate more than 3 x 10(11) possible conformations. While cross-links represent only limited structural constraints, the combination of only three experimental cross-links with very basic molecular docking was sufficient to determine the complex structure. The crystal structure of the complex between latexin and carboxypeptidase A4 determined recently allowed us to assess the success of this structure determination approach. Our structure was shown to be within 4 angstrom r.m.s. deviation of C alpha atoms of the crystal structure. The study demonstrates that cross-linking in combination with mass spectrometry can lead to efficient and accurate structural modelling of protein complexes.

Structure of saccharose-based carbon and transport of confined fluids: hybrid reverse Monte Carlo reconstruction and simulation studies

We present results of the reconstruction of a saccharose-based activated carbon (CS1000a) using hybrid reverse Monte Carlo (HRMC) simulation, recently proposed by Opletal et al. [1]. Interaction between carbon atoms in the simulation is modeled by an environment dependent interaction potential (EDIP) [2,3]. The reconstructed structure shows predominance of sp(2) over sp bonding, while a significant proportion of sp(3) hybrid bonding is also observed. We also calculated a ring distribution and geometrical pore size distribution of the model developed. The latter is compared with that obtained from argon adsorption at 87 K using our recently proposed characterization procedure [4], the finite wall thickness (FWT) model. Further, we determine self-diffusivities of argon and nitrogen in the constructed carbon as functions of loading. It is found that while there is a maximum in the diffusivity with respect to loading, as previously observed by Pikunic et al. [5], diffusivities in the present work are 10 times larger than those obtained in the prior work, consistent with the larger pore size as well as higher porosity of the activated saccharose carbon studied here.

Toward efficient multifeature query processing

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.

Incremental learning for interactive e-mail filtering

In this article, we propose a framework, namely, Prediction-Learning-Distillation (PLD) for interactive document classification and distilling misclassified documents. Whenever a user points out misclassified documents, the PLD learns from the mistakes and identifies the same mistakes from all other classified documents. The PLD then enforces this learning for future classifications. If the classifier fails to accept relevant documents or reject irrelevant documents on certain categories, then PLD will assign those documents as new positive/negative training instances. The classifier can then strengthen its weakness by learning from these new training instances. Our experiments’ results have demonstrated that the proposed algorithm can learn from user-identified misclassified documents, and then distil the rest successfully.

Investigating the performance analysis of EASI algorithm and EKENS algorithm in nonlinear model

This paper investigates the performance of EASI algorithm and the proposed EKENS algorithm for linear and nonlinear mixtures. The proposed EKENS algorithm is based on the modified equivariant algorithm and kernel density estimation. Theory and characteristic of both the algorithms are discussed for blind source separation model. The separation structure of nonlinear mixtures is based on a nonlinear stage followed by a linear stage. Simulations with artificial and natural data demonstrate the feasibility and good performance of the proposed EKENS algorithm.

Time weight collaborative filtering

Collaborative filtering is regarded as one of the most promising recommendation algorithms. The item-based approaches for collaborative filtering identify the similarity between two items by comparing users' ratings on them. In these approaches, ratings produced at different times are weighted equally. That is to say, changes in user purchase interest are not taken into consideration. For example, an item that was rated recently by a user should have a bigger impact on the prediction of future user behaviour than an item that was rated a long time ago. In this paper, we present a novel algorithm to compute the time weights for different items in a manner that will assign a decreasing weight to old data. More specifically, the users' purchase habits vary. Even the same user has quite different attitudes towards different items. Our proposed algorithm uses clustering to discriminate between different kinds of items. To each item cluster, we trace each user's purchase interest change and introduce a personalized decay factor according to the user own purchase behaviour. Empirical studies have shown that our new algorithm substantially improves the precision of item-based collaborative filtering without introducing higher order computational complexity.

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.

Analysing time series structure with hidden Markov models

This paper consides the problem of extracting the relationships between two time series in a non-linear non-stationary environment with Hidden Markov Models (HMMs). We describe an algorithm which is capable of identifying associations between variables. The method is applied both to synthetic data and real data. We show that HMMs are capable of modelling the oil drilling process and that they outperform existing methods.

The primal sketch revisited: locating and representing edges in human vision via Gaussian-derivative filtering

Marr's work offered guidelines on how to investigate vision (the theory - algorithm - implementation distinction), as well as specific proposals on how vision is done. Many of the latter have inevitably been superseded, but the approach was inspirational and remains so. Marr saw the computational study of vision as tightly linked to psychophysics and neurophysiology, but the last twenty years have seen some weakening of that integration. Because feature detection is a key stage in early human vision, we have returned to basic questions about representation of edges at coarse and fine scales. We describe an explicit model in the spirit of the primal sketch, but tightly constrained by psychophysical data. Results from two tasks (location-marking and blur-matching) point strongly to the central role played by second-derivative operators, as proposed by Marr and Hildreth. Edge location and blur are evaluated by finding the location and scale of the Gaussian-derivative `template' that best matches the second-derivative profile (`signature') of the edge. The system is scale-invariant, and accurately predicts blur-matching data for a wide variety of 1-D and 2-D images. By finding the best-fitting scale, it implements a form of local scale selection and circumvents the knotty problem of integrating filter outputs across scales. [Supported by BBSRC and the Wellcome Trust]