AUTOMATIC CORONARY WALL SEGMENTATION IN INTRAVASCULAR ULTRASOUND IMAGES USING BINARY MORPHOLOGICAL RECONSTRUCTION

Intravascular ultrasound (IVUS) image segmentation can provide more detailed vessel and plaque information, resulting in better diagnostics, evaluation and therapy planning. A novel automatic segmentation proposal is described herein; the method relies on a binary morphological object reconstruction to segment the coronary wall in IVUS images. First, a preprocessing followed by a feature extraction block are performed, allowing for the desired information to be extracted. Afterward, binary versions of the desired objects are reconstructed, and their contours are extracted to segment the image. The effectiveness is demonstrated by segmenting 1300 images, in which the outcomes had a strong correlation to their corresponding gold standard. Moreover, the results were also corroborated statistically by having as high as 92.72% and 91.9% of true positive area fraction for the lumen and media adventitia border, respectively. In addition, this approach can be adapted easily and applied to other related modalities, such as intravascular optical coherence tomography and intravascular magnetic resonance imaging. (E-mail: matheuscardosomg@hotmail.com) (C) 2011 World Federation for Ultrasound in Medicine & Biology.

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.

A Geometric Approach for Turbo Decoding of Reed-Solomon Codes in QAM Modulation Schemes

This work studies the turbo decoding of Reed-Solomon codes in QAM modulation schemes for additive white Gaussian noise channels (AWGN) by using a geometric approach. Considering the relations between the Galois field elements of the Reed-Solomon code and the symbols combined with their geometric dispositions in the QAM constellation, a turbo decoding algorithm, based on the work of Chase and Pyndiah, is developed. Simulation results show that the performance achieved is similar to the one obtained with the pragmatic approach with binary decomposition and analysis.

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.

Binary and ternary inclusion complexes of finasteride in HP beta CD and polymers: Preparation and characterization

The aim of this study was to determine whether inclusion complexes between 2-hydroxypropyl-beta-cyclodextrin (HP beta CD) and finasteride (FIN) are formed, and to characterize these. Equimolar FIN/HP beta CD solid systems in the presence or absence of 0.1% (w/v) of polyvinylpyrrolidone K30 (PVP K30) or 0.3% of chitosan were prepared by coevaporation and freeze-drying methods. The systems were characterized by phase solubility, NMR, DSC, and XRD analysis. The results suggest that true binary and ternary inclusion complexes were formed. (c) 2009 Elsevier Ltd. All rights reserved.

Rheological, mechanical and mucoadhesive properties of thermoresponsive, bioadhesive binary mixtures composed of poloxamer 407 and carbopol 974P designed as platforms for implantable drug delivery systems for use in the oral cavity

This study described the formulation and characterisation of the viscoelastic, mechanical and mucoadhesive properties of thermoresponsive, binary polymeric systems composed of poloxamer (P407) and poly(acrylic acid, C974P) that were designed for use as a drug delivery platform within the oral cavity. Monopolymeric and binary polymeric formulations were prepared containing 10, 15 and 20% (w/w) poloxamer (407) and 0.10-0.25% (w/w) poly(acrylic acid, 934P). The flow theological and viscoelastic properties of the formulations were determined using controlled stress and oscillatory rheometry, respectively, the latter as a function of temperature. The mechanical and mucoadhesive properties (namely the force required to break the bond between the formulation and a pre-hydrated mucin disc) were determined using compression and tensile analysis, respectively. Binary systems composed of 10% (w/w) P407 and C934P were elastoviscous, were easily deformed under stress and did not exhibit mucoadhesion. Formulations containing 15 or 20% (w/w) Pluronic P407 and C934P exhibited a sol-gel temperature T(sol/gel), were viscoelastic and offered high elasticity and resistance to deformation at 37 degrees C. Conversely these formulations were elastoviscous and easily deformed at temperatures below the sol-gel transition temperature. The sol-gel transition temperatures of systems containing 15% (w/w) P407 were unaffected by the presence of C934P; however, increasing the concentration of C934P decreased the T(sol/gel) in formulations containing 20%(w/w) P407. Rheological synergy between P407 and C934P at 37 degrees C was observed and was accredited to secondary interactions between these polymers, in addition to hydrophobic interactions between P407 micelles. Importantly, formulations composed of 20% (w/w) P407 and C934P exhibited pronounced mucoadhesive properties. The ease of administration (below the T(sol/gel)) in conjunction with the viscoelastic (notably high elasticity) and mucoadhesive properties (at body temperature) render the formulations composed of 20% (w/w) P407 and C934P as potentially useful platforms for mucoadhesive, controlled topical drug delivery within the oral cavity. (c) 2009 Published by Elsevier B.V.

Histopathological Changes in the Placentas and Fetuses of Mice Infected with Trypanosoma cruzi Isolated from the Myotis nigricans nigricans Bat

Histopathological changes and placental transmission were studied in the late stages of pregnancy in mice infected with a strain of Trypanosoma cruzi, isolated from a Myolis nigricans nigricans bat. Large amastigote nests were observed in uterine muscles, as well as in decidual and endothelial placental cells. In addition, persistent coagulative and fibrotic Vascular degeneration was observed. Large amastigote burdens were found in giant cells, spongioblasts and endothelial cells within the labyrinthine layer. Transplacental transmission was confirmed in 30% of the fetuses examined, in which amastrigote nests were seen only in striated muscle. During tire acute phase, intrauterine development was impaired as the result of parasitic invasion of the placenta, and fetal mortality rose to 10%. (C) 2008 Elsevier Ltd. All rights reserved.

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.

Surface miscibility of EPC/DOTAP/DOPE in binary and ternary mixed monolayers

Surface pressure (pi)-molecular area (A) curves were used to characterize the packing of pseudo-ternary mixed Langmuir monolayers of egg phosphatidylcholine (EPC), 1,2-dioleoyl-3-trimethylammonium propane (DOTAP) and L-alpha-dioleoyl phosphatidylethanolamine (DOPE). This pseudo-ternary mixture EPC/DOPE/DOTAP has been successfully employed in liposome formulations designed for DNA non-viral vectors. Pseudo-binary mixtures were also studied as a control. Miscibility behavior was inferred from pi-A curves applying the additivity rule by calculating the excess free energy of mixture (Delta G(Exc)). The interaction between the lipids was also deduced from the surface compressional modulus (C(s)(-1)). The deviation from ideality shows dependence on the lipid polar head type and monolayer composition. For lower DOPE concentrations, the forces are predominantly attractive. However, if the monolayer is DOPE rich, the DOTAP presence disturbs the PE-PE intermolecular interaction and the net interaction is then repulsive. The ternary monolayer EPC/DOPE/DOTAP presented itself in two configurations, modulated by the DOPE content, in a similar behavior to the DOPE/DOTAP monolayers. These results contribute to the understanding of the lipid interactions and packing in self-assembled systems associated with the in vitro and in vivo stability of liposomes. (C) 2010 Elsevier B.V. All rights reserved.

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.