Chest pain in the dental surgery: A brief review and practical points in diagnosis and management

If a dental patient develops chest pain it must always be managed promptly and properly, i.e., the practitioner immediately stops the procedure and, being aware of the patients's medical history, questions the patient regarding the nature of the pain to help determine the likely diagnosis. It will most likely be a manifestation of coronary artery disease (synonymous with ischaemic heart disease), i.e., angina pectoris or acute myocardial infarction, most usually the former. Angina will usually resolve with proper intervention whereas up to about one-half of myocardial infarction cases will develop cardiac arrest, mostly in the first few hours, and this will be fatal in up to two-thirds of cases. As health care professions, dental practitioners have an inherent duty of care to be able to initiate appropriate care if such a medical emergency occurs.

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.

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

Rapid field calculations for the effect of ferromagnetic material in MRI magnet design

Magnetic resonance imaging (MRI) magnets have very stringent constraints on the homogeneity of the static magnetic field that they generate over desired imaging regions. The magnet system also preferably generates very little stray field external to its structure, so that ease of siting and safety are assured. This work concentrates on deriving, means of rapidly computing the effect of 'cold' and 'warm' ferromagnetic material in or around the superconducting magnet system, so as to facilitate the automated design of hybrid material MR magnets. A complete scheme for the direct calculation of the spherical harmonics of the magnetic field generated by a circular ring of ferromagnetic material is derived under the conditions of arbitrary external magnetizing fields. The magnetic field produced by the superconducting coils in the system is computed using previously developed methods. The final, hybrid algorithm is fast enough for use in large-scale optimization methods. The resultant fields from a practical example of a 4 T, clinical MRI magnet containing both superconducting coils and magnetic material are presented.

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.

Practical and economic advantages of choice feeding systems for laying poultry

Poultry can be managed under different feeding systems, depending on the husbandry skills and the feed available. These systems include the following: (1) a complete dry feed offered as a mash ad libitum; (2) the same feed offered as pellets or crumbles ad libitum; (3) a complete feed with added whole grain; (4) a complete wet feed given once or twice a day; (5) a complete feed offered on a restricted basis; (6) choice feeding. Of all these, an interesting alternative to offering complete diets is choice feeding which can be applied on both a small or large commercial scale. Under choice feeding or free-choice feeding birds are usually offered a choice between three types of feedstuffs: (a) an energy source (e.g. maize, rice bran, sorghum or wheat); (b) a protein source (e.g. soyabean meal, meat meal, fish meal or coconut meal) plus vitamins and minerals and (c), in the case of laying hens, calcium in granular form (i.e. oyster-shell grit). This system differs from the modern commercial practice of offering a complete diet comprising energy and protein sources, ground and mixed together. Under the complete diet system, birds are mainly only able to exercise their appetite for energy. When the environmental temperature varies, the birds either over- or under-consume protein and calcium. The basic principle behind practising choice feeding with laying hens is that individual hens are able to select from the various feed ingredients on offer and compose their own diet, according to their actual needs and production capacity. A choice-feeding system is of particular importance to small poultry producers in developing countries, such as Indonesia, because it can substantially reduce the cost of feed. The system is flexible and can be constructed in such a way that the various needs of a flock of different breeds, including village chickens, under different climates can be met. The system also offers a more effective way to use home-produced grain, such as maize, and by-products, such as rice bran, in developing countries. Because oyster-shell grit is readily available in developing countries at lower cost than limestone, the use of cheaper oyster-shell grit can further benefit small-holders in these countries. These benefits apart, simpler equipment suffices when designing and building a feed mixer on the farm, and transport costs are lower. If whole (unground) grain is used, the intake of which is accompanied by increased efficiency of feed utilisation, the costs of grinding, mixing and many of the handling procedures associated with mash and pellet preparation are eliminated. The choice feedstuffs can all be offered in the current feed distribution systems, either by mixing the ingredients first or by using a bulk bin divided into three compartments.

Modelling High-Dimensional Data by Mixtures of Factor Analyzers

We focus on mixtures of factor analyzers from the perspective of a method for model-based density estimation from high-dimensional data, and hence for the clustering of such data. This approach enables a normal mixture model to be fitted to a sample of n data points of dimension p, where p is large relative to n. The number of free parameters is controlled through the dimension of the latent factor space. By working in this reduced space, it allows a model for each component-covariance matrix with complexity lying between that of the isotropic and full covariance structure models. We shall illustrate the use of mixtures of factor analyzers in a practical example that considers the clustering of cell lines on the basis of gene expressions from microarray experiments. (C) 2002 Elsevier Science B.V. 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 practical guide to exercise training for heart failure patients

Background: Exercise training has been shown to improve exercise capacity in patients with heart failure. We sought to examine the optimal strategy of exercise training for patients with heart failure. Methods: Review of the published data on the characteristics of the training program, with comparison of physiologic markers of exercise capacity in heart failure patients and healthy individuals and comparison of the change in these characteristics after all exercise training program. Results: Many factors, including the duration, supervision, and venue of exercise training; the volume of working muscle; the delivery mode (eg, continuous vs. intermittent exercise), training intensity; and the concurrent effects of medical treatments may influence the results of exercise training in heart failure. Starting in an individually prescribed and safely monitored hospital-based program, followed by progression to an ongoing and progressive home program of exercise appears to be the best solution to the barriers of anxiety, adherence, and ease of access encountered by the heart failure patient. Conclusions: Various exercise training programs have been shown to improve exercise capacity and symptom status in heart failure, but these improvements may only be preserved with an ongoing maintenance program.