A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Trialing wetlands to treat coal mining wastewaters in a low rainfall, high evaporation environment

The large number of wetlands treating mining wastewaters around the world have mostly been constructed in temperate environments. Wetlands have yet to be proven in low rainfall, high evaporation environments and such conditions are common in many parts of Australia. BHP Australia Coal is researching whether wetlands have potential in central Queensland to treat coal mining wastewaters. In this region, mean annual rainfall is < 650 mm and evaporation > 2 000 mm. A pilot-scale wetland system has been constructed at an open-cut coal mine. The system comprises six treatment cells, each 125 m long and 10 m wide. The system is described in the paper and some initial results presented. Results over the first fourteen months of operation have shown that although pH has not increased enough to enable reuse or release of the water, sulfate reduction has been observed in parts of the system, as shown by the characteristic black precipitate and smell of hydrogen sulfide emanating from the wetlands. These encouraging signs have led to experiments aimed at identifying the factors limiting sulfate reduction. The first experiment, described herein, included four treatments where straw was overlain by soil and the water level varied, being either at the top of the straw, at the top of the soil, or about 5 cm above the soil. The effect of inoculating with sulfate-reducing bacteria was investigated. Two controls were included, one covered and one open, to enable the effect of evaporation to be determined. The final treatment consisted of combined straw/cattle manure overlain with soil. Results showed that sulfate reduction did occur, as demonstrated by pH increases and lowering of sulfate levels. Mean pH of the water was significantly higher after 19 days; in the controls, pH was < 3.3, whereas in the treatments, pH ranged from 5.4 to 6.7. The best improvement in sulfate levels occurred in the straw/cattle manure treatment. (C) 1997 IAWQ. Published by Elsevier Science Ltd.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.

Perspectives on sexual and reproductive health among women in an ancient mining area in Brazil

The purpose of this study was to describe the reproductive profile and frequency of genital infections among women living in the Serra Pelada, a former mining village in the Para state, Brazil. A descriptive study of women living in the mining area of Serra Pelada was performed in 2004 through interviews that gathered demographics and clinical data, and assessed risk behaviors of 209 randomly-selected women. Blood samples were collected for rapid assay for HIV; specimens were taken for Pap smears and Gram stains. Standard descriptive statistical analyses were performed and prevalence was calculated to reflect the relative frequency of each disease. Of the 209 participants, the median age was 38 years, with almost 70% having less than four years of education and 77% having no income or under 1.9 times the minimum wage of Brazil. About 30% did not have access to health care services during the preceding year. Risk behaviors included: alcohol abuse, 24.4%; illicit drug abuse, 4.3%; being a sex worker, 15.8%; and domestic violence, 17.7%. Abnormal Pap smear was found in 8.6%. Prevalence rates of infection were: HIV, 1.9%; trichomoniasis, 2.9%; bacterial vaginosis, 18.7%; candidiasis, 5.7%; Chlamydial-related cytological changes, 3.3%; and HPV-related cytological changes, 3.8%. Women living in this mining area in Brazil are economically and socially vulnerable to health problems. It is important to point out the importance of concomitant broader strategies that include reducing poverty and empowering women to make improvements regarding their health.

An association rule-based method to support medical image diagnosis with efficiency

In this paper, we propose a method based on association rule-mining to enhance the diagnosis of medical images (mammograms). It combines low-level features automatically extracted from images and high-level knowledge from specialists to search for patterns. Our method analyzes medical images and automatically generates suggestions of diagnoses employing mining of association rules. The suggestions of diagnosis are used to accelerate the image analysis performed by specialists as well as to provide them an alternative to work on. The proposed method uses two new algorithms, PreSAGe and HiCARe. The PreSAGe algorithm combines, in a single step, feature selection and discretization, and reduces the mining complexity. Experiments performed on PreSAGe show that this algorithm is highly suitable to perform feature selection and discretization in medical images. HiCARe is a new associative classifier. The HiCARe algorithm has an important property that makes it unique: it assigns multiple keywords per image to suggest a diagnosis with high values of accuracy. Our method was applied to real datasets, and the results show high sensitivity (up to 95%) and accuracy (up to 92%), allowing us to claim that the use of association rules is a powerful means to assist in the diagnosing task.

The application of adaptive partitioned random search in feature selection problem

Feature selection is one of important and frequently used techniques in data preprocessing. It can improve the efficiency and the effectiveness of data mining by reducing the dimensions of feature space and removing the irrelevant and redundant information. Feature selection can be viewed as a global optimization problem of finding a minimum set of M relevant features that describes the dataset as well as the original N attributes. In this paper, we apply the adaptive partitioned random search strategy into our feature selection algorithm. Under this search strategy, the partition structure and evaluation function is proposed for feature selection problem. This algorithm ensures the global optimal solution in theory and avoids complete randomness in search direction. The good property of our algorithm is shown through the theoretical analysis.