A Levinson algorithm based on an isometric transformation of Durbin`s

Starting from the Durbin algorithm in polynomial space with an inner product defined by the signal autocorrelation matrix, an isometric transformation is defined that maps this vector space into another one where the Levinson algorithm is performed. Alternatively, for iterative algorithms such as discrete all-pole (DAP), an efficient implementation of a Gohberg-Semencul (GS) relation is developed for the inversion of the autocorrelation matrix which considers its centrosymmetry. In the solution of the autocorrelation equations, the Levinson algorithm is found to be less complex operationally than the procedures based on GS inversion for up to a minimum of five iterations at various linear prediction (LP) orders.

Distributed power control algorithm for multiple access systems based on Verhulst model

In this paper the continuous Verhulst dynamic model is used to synthesize a new distributed power control algorithm (DPCA) for use in direct sequence code division multiple access (DS-CDMA) systems. The Verhulst model was initially designed to describe the population growth of biological species under food and physical space restrictions. The discretization of the corresponding differential equation is accomplished via the Euler numeric integration (ENI) method. Analytical convergence conditions for the proposed DPCA are also established. Several properties of the proposed recursive algorithm, such as Euclidean distance from optimum vector after convergence, convergence speed, normalized mean squared error (NSE), average power consumption per user, performance under dynamics channels, and implementation complexity aspects, are analyzed through simulations. The simulation results are compared with two other DPCAs: the classic algorithm derived by Foschini and Miljanic and the sigmoidal of Uykan and Koivo. Under estimated errors conditions, the proposed DPCA exhibits smaller discrepancy from the optimum power vector solution and better convergence (under fixed and adaptive convergence factor) than the classic and sigmoidal DPCAs. (C) 2010 Elsevier GmbH. All rights reserved.

The Policy Iteration Algorithm for Average Continuous Control of Piecewise Deterministic Markov Processes

The main goal of this paper is to apply the so-called policy iteration algorithm (PIA) for the long run average continuous control problem of piecewise deterministic Markov processes (PDMP`s) taking values in a general Borel space and with compact action space depending on the state variable. In order to do that we first derive some important properties for a pseudo-Poisson equation associated to the problem. In the sequence it is shown that the convergence of the PIA to a solution satisfying the optimality equation holds under some classical hypotheses and that this optimal solution yields to an optimal control strategy for the average control problem for the continuous-time PDMP in a feedback form.

Optimization of the Topology of Electric Energy Distribution Networks by Using Algorithm Inspired on Ant Behaviors

An algorithm inspired on ant behavior is developed in order to find out the topology of an electric energy distribution network with minimum power loss. The algorithm performance is investigated in hypothetical and actual circuits. When applied in an actual distribution system of a region of the State of Sao Paulo (Brazil), the solution found by the algorithm presents loss lower than the topology built by the concessionary company.

Avoiding Divergence in the Shalvi-Weinstein Algorithm

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA. at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal. or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation. the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.

Jointly multi-user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.

Hardware/firmware implementation of a soft sensor using an improved version of a fuzzy identification algorithm

This paper presents the design and implementation of an embedded soft sensor, i. e., a generic and autonomous hardware module, which can be applied to many complex plants, wherein a certain variable cannot be directly measured. It is implemented based on a fuzzy identification algorithm called ""Limited Rules"", employed to model continuous nonlinear processes. The fuzzy model has a Takagi-Sugeno-Kang structure and the premise parameters are defined based on the Fuzzy C-Means (FCM) clustering algorithm. The firmware contains the soft sensor and it runs online, estimating the target variable from other available variables. Tests have been performed using a simulated pH neutralization plant. The results of the embedded soft sensor have been considered satisfactory. A complete embedded inferential control system is also presented, including a soft sensor and a PID controller. (c) 2007, ISA. Published by Elsevier Ltd. All rights reserved.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Something moves: a philosophical and ethical praise to the combat practicing as art and education

In this work we tried to produce a philosophic-ethic praise to the Martial Arts` combat practice, based in our years of Martial Arts training accompanied with studies of oriental and occidental Philosophy. Tracing a critical history of the changes happened to the Martial Arts we brought the concept of combat as a martial practice of life empowerment. Opposing this, we presented the notion of fight as a result of the capture that the war arts suffered because of the despotic empires. Besides, we demonstrated that the combat practice is simultaneously an artistic and educational activity, because it aims at the production of an immanence field witch is loyal to the event.

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.

Ovarian reserve evaluation: state of the art

Purpose Revise role of hormonal basal and dynamic tests, as well as ultrasonographic measures as ovarian reserve markers, in order to provide better counseling to subfertile couples. Methods Review of publications on the topic, with an emphasis on recent well designed articles. Results Currently available ovarian reserve tests do not provide sufficient evidence to be solely considered ideal, even for premature ovarian senescence patients who do not present subfertility complaints. However, these markers occupy important place in initial approach to treatment of subfertile couples, predicting unsatisfactory results that could be improved by differentiated induction schemes and reducing excessive psychological and financial burdens, and adverse effects. Conclusions In order to remedy the limitations due to the scarcity of strong evidence about this topic, future studies should try to clarify predictive value of markers in groups of specific diseases-related subfertility and pay special attention to propaedeutic multivariate models including anti-Mullerian hormone and antral follicle count.

Ten-year survival of ART restorations in permanent posterior teeth

This study evaluated the 10-year clinical performance of high-viscosity glass-ionomer cement placed in posterior permanent teeth by means of the Atraumatic Restorative Treatment (ART) approach. One operator placed 167 single- and 107 multiple-surface restorations in 43 high-risk caries pregnant women (mean decayed teeth = 9.8 +/- 5.5). Examinations were performed at 1-, 2-, and 10-year intervals according to ART criteria. In the last evaluation, the US Public Health Service (USPHS) criteria were also used. After 10 years, 129 restorations (47.1%) were evaluated and achieved a cumulative survival rate of 49.0% (SE 7.2%). The 10-year survival of single- and multiple-surface ART restorations assessed using the ART criteria were 65.2% (SE 7.3%) and 30.6% (SE 9.9%), respectively. This difference was significant (jackknife SE of difference; p < 0.05). Using the USPHS criteria, the 10-year survival of single- and multiple-surface ART restorations were 86.5% and 57.6%, respectively. The primary causes of failure were total loss (9.3%) and marginal defects (5.4%). The survival rates observed, especially for the single-surface restorations, confirm the potential of the ART approach for restoring and saving posterior permanent teeth.

State of the art etch-and-rinse adhesives

Objectives: The aim of this study was to explore the therapeutic opportunities of each step of 3-step etch-and-rinse adhesives. Methods: Etch-and-rinse adhesive systems are the oldest of the multi-generation evolution of resin bonding systems. In the 3-step version, they involve acid-etching, priming and application of a separate adhesive. Each step can accomplish multiple goals. Acid-etching, using 32-37% phosphoric acid (pH 0.1-0.4) not only simultaneously etches enamel and dentin, but the low pH kills many residual bacteria. Results: Some etchants include anti-microbial compounds such as benzalkonium chloride that also inhibits matrix metalloproteinases (MMPs) in dentin. Primers are usually water and HEMA-rich solutions that ensure complete expansion of the collagen fibril meshwork and wet the collagen with hydrophilic monomers. However, water alone can re-expand dried dentin and can also serve as a vehicle for protease inhibitors or protein cross-linking agents that may increase the durability of resin-dentin bonds. In the future, ethanol or other water-free solvents may serve as dehydrating primers that may also contain antibacterial quaternary ammonium methacrylates to inhibit dentin MMPs and increase the durability of resin-dentin bonds. The complete evaporation of solvents is nearly impossible. Significance: Manufacturers may need to optimize solvent concentrations. Solvent-free adhesives can seal resin-dentin interfaces with hydrophobic resins that may also contain fluoride and antimicrobial compounds. Etch-and-rinse adhesives produce higher resin-dentin bonds that are more durable than most 1 and 2-step adhesives. Incorporation of protease inhibitors in etchants and/or cross-linking agents in primers may increase the durability of resin-dentin bonds. The therapeutic potential of etch-and-rinse adhesives has yet to be fully exploited. (C) 2010 Academy of Dental Materials. Published by Elsevier Ltd. All rights reserved.

Influence of occlusal access on demineralized dentin removal in the Atraumatic Restorative Treatment (ART) approach

Purpose: To verify the influence of cavity access diameter on demineralized dentin removal in the ART approach. Methods: 40 non-carious human premolars were randomly divided into four groups. The occlusal surface was ground flat and the teeth were sectioned mesio-distally. The hemi-sections were reassembled and occlusal access preparations were carried out using ball-shaped diamonds. The resulting size of the occlusal opening was 1.0 mm, 1.4 mm, 1.6 mm and 1.8 mm for Groups A, B, C, and D, respectively. Standardized artificial carious lesions were created and demineralized dentin was excavated. After excavation, the cavities were analyzed using: (a) the tactile method, (b) caries-detection dye to stain demineralized dentin, as proposed by Smales & Fang, and (c) Demineralized Tissue Removal index, as proposed in this study. Statistical analysis was performed using Fisher, Spearman correlation coefficient, kappa, Kruskal-Wallis and Miller tests (P < 0.05). Results: The three methods of evaluation showed no significant difference between Groups A vs. B, and C vs. D, while statistically significant differences were observed between Groups A vs. C, A vs. D, B vs. C and B vs. D. Based on the results of this study, the size of occlusal access significantly affected the efficacy of demineralized tissue removal.