Effect of simulated masticatory loading on the retention of stud attachments for implant overdentures

P>This study assessed the effect of simulated mastication on the retention of two stud attachment systems for 2-implants overdentures. Sixteen specimens, each simulating an edentulous ridge with implants and an overdenture were divided into two groups, according to the attachment system: Group I (Nobel Biocare ball-socket attachments) and Group II (Locator attachments). Retention forces were measured before and after 400 000 simulated masticatory loads in a customised device. Data were compared by two-way anova followed by Bonferroni test (alpha = 0 center dot 05). Group I presented significantly lower retention forces (Newtons) than Group II at baseline (10 center dot 6 +/- 3 center dot 6 and 66 center dot 4 +/- 16 center dot 0, respectively). However, differences were not significant after 400 000 loads (7 center dot 9 +/- 4 center dot 3 and 21 center dot 6 +/- 17 center dot 0). The number of cycles did not influence the measurements in Group I, whereas a non-linear descending curve was found for Group II. It was concluded that simulated mastication resulted in minor changes for the ball attachment tested. Nevertheless, it reduced the retention of Locator attachments to 40% of the baseline values, what suggests that mastication is a major factor associated with maintenance needs for this system.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

Maximum Likelihood Estimation of Mixture Densities for Binned and Truncated Multivariate Data

Binning and truncation of data are common in data analysis and machine learning. This paper addresses the problem of fitting mixture densities to multivariate binned and truncated data. The EM approach proposed by McLachlan and Jones (Biometrics, 44: 2, 571-578, 1988) for the univariate case is generalized to multivariate measurements. The multivariate solution requires the evaluation of multidimensional integrals over each bin at each iteration of the EM procedure. Naive implementation of the procedure can lead to computationally inefficient results. To reduce the computational cost a number of straightforward numerical techniques are proposed. Results on simulated data indicate that the proposed methods can achieve significant computational gains with no loss in the accuracy of the final parameter estimates. Furthermore, experimental results suggest that with a sufficient number of bins and data points it is possible to estimate the true underlying density almost as well as if the data were not binned. The paper concludes with a brief description of an application of this approach to diagnosis of iron deficiency anemia, in the context of binned and truncated bivariate measurements of volume and hemoglobin concentration from an individual's red blood cells.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

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.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

A genetic algorithm/method of moments approach to the optimization of an RF coil for MRI applications - Theoretical considerations - Abstract

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Amylases in enzyme detergents and their effects on a simulated long-life dairy dessert

Enzyme detergents used in the food industry contain proteinase as the major enzyme but amylase may be present, either by design or inadvertently. Three commercial enzyme detergents and 3 enzyme preparations used in detergents were assayed for alpha-amylase activity by the Ceralpha method using the Megazyme kits. The amylase activities of the detergents varied from 3.2x 10(-6) to 32x 10(-6) mumoles ml(-1) h(-1) while the enzyme preparations had much higher activities ranging from 0.05 to 8.06 mumoles ml(-1) h(-1). When added aseptically to a simulated dairy dessert (2% starch solution) and stored for 42 days, the enzyme detergents caused an increase in viscosity; enzyme preparations at low concentrations caused an initial increase in viscosity followed by a decrease; and enzyme preparations at high concentrations caused an immediate decrease in viscosity. The increase in viscosity corresponded to formation of a distinct network of starch granules while the decrease in viscosity was characterised by a marked decrease in size of the granules and little or no network of granules. Decreases in viscosity corresponded to increases in reducing sugars but samples which increased in viscosity showed no measurable reducing sugars. The amylase activity in all sources was destroyed by heating at 75degreesC for 15 min at pH 1.8.

Activation energy distribution of thermal annealing of a bituminous coal

A bituminous coal was pyrolyzed in a nitrogen stream in an entrained flow reactor at various temperatures from 700 to 1475 degreesC. Char samples were collected at different positions along the reactor. Each collected sample was oxidized nonisothermally in a TGA for reactivity determination. The reactivity of the coal char was found to decrease rapidly with residence time until 0.5 s, after which it decreased only slightly. On the bases of the reactivity data at various temperatures, a new approach was utilized to obtaining the true activation energy distribution function for thermal annealing without the assumption of any distribution function form or a constant preexponential factor. It appears that the true activation energy distribution function consists of two separate parts corresponding to different temperature ranges, suggesting different mechanisms in different temperature ranges. Partially burnt coal chars were also collected along the reactor when the coal was oxidized in air at various temperatures from 700 to 1475 degreesC. The collected samples were analyzed for the residual carbon content and the specific reaction rate was estimated. The characteristic time of thermal deactivation was compared with that of oxidation under realistic conditions. The characteristic times were found to be close to each other, indicating the importance of thermal deactivation during combustion of the coal studied.