891 resultados para Repair algorithms
Resumo:
A 3D binary image is considered well-composed if, and only if, the union of the faces shared by the foreground and background voxels of the image is a surface in R3. Wellcomposed images have some desirable topological properties, which allow us to simplify and optimize algorithms that are widely used in computer graphics, computer vision and image processing. These advantages have fostered the development of algorithms to repair bi-dimensional (2D) and three-dimensional (3D) images that are not well-composed. These algorithms are known as repairing algorithms. In this dissertation, we propose two repairing algorithms, one randomized and one deterministic. Both algorithms are capable of making topological repairs in 3D binary images, producing well-composed images similar to the original images. The key idea behind both algorithms is to iteratively change the assigned color of some points in the input image from 0 (background)to 1 (foreground) until the image becomes well-composed. The points whose colors are changed by the algorithms are chosen according to their values in the fuzzy connectivity map resulting from the image segmentation process. The use of the fuzzy connectivity map ensures that a subset of points chosen by the algorithm at any given iteration is the one with the least affinity with the background among all possible choices
Resumo:
Hernia repair one of the most frequently performed operations in general surgery. With the introduction of tension-free mesh repair, recurrence rates dropped well below 5% for open and laparoscopic procedures. However, chronic postoperative pain remains a widely neglected complication with a high socio-economic impact. It occurs in about 10-20% of patients after hernia repair. We review the different types of post-herniorrhaphy pain with the typical diagnostic features and we conclude with a pragmatic algorithm based on our clinical experience.
Resumo:
Le problème de localisation-routage avec capacités (PLRC) apparaît comme un problème clé dans la conception de réseaux de distribution de marchandises. Il généralisele problème de localisation avec capacités (PLC) ainsi que le problème de tournées de véhicules à multiples dépôts (PTVMD), le premier en ajoutant des décisions liées au routage et le deuxième en ajoutant des décisions liées à la localisation des dépôts. Dans cette thèse on dévelope des outils pour résoudre le PLRC à l’aide de la programmation mathématique. Dans le chapitre 3, on introduit trois nouveaux modèles pour le PLRC basés sur des flots de véhicules et des flots de commodités, et on montre comment ceux-ci dominent, en termes de la qualité de la borne inférieure, la formulation originale à deux indices [19]. Des nouvelles inégalités valides ont été dévelopées et ajoutées aux modèles, de même que des inégalités connues. De nouveaux algorithmes de séparation ont aussi été dévelopés qui dans la plupart de cas généralisent ceux trouvés dans la litterature. Les résultats numériques montrent que ces modèles de flot sont en fait utiles pour résoudre des instances de petite à moyenne taille. Dans le chapitre 4, on présente une nouvelle méthode de génération de colonnes basée sur une formulation de partition d’ensemble. Le sous-problème consiste en un problème de plus court chemin avec capacités (PCCC). En particulier, on utilise une relaxation de ce problème dans laquelle il est possible de produire des routes avec des cycles de longueur trois ou plus. Ceci est complété par des nouvelles coupes qui permettent de réduire encore davantage le saut d’intégralité en même temps que de défavoriser l’apparition de cycles dans les routes. Ces résultats suggèrent que cette méthode fournit la meilleure méthode exacte pour le PLRC. Dans le chapitre 5, on introduit une nouvelle méthode heuristique pour le PLRC. Premièrement, on démarre une méthode randomisée de type GRASP pour trouver un premier ensemble de solutions de bonne qualité. Les solutions de cet ensemble sont alors combinées de façon à les améliorer. Finalement, on démarre une méthode de type détruir et réparer basée sur la résolution d’un nouveau modèle de localisation et réaffectation qui généralise le problème de réaffectaction [48].
Resumo:
Aircraft Maintenance, Repair and Overhaul (MRO) feedback commonly includes an engineer’s complex text-based inspection report. Capturing and normalizing the content of these textual descriptions is vital to cost and quality benchmarking, and provides information to facilitate continuous improvement of MRO process and analytics. As data analysis and mining tools requires highly normalized data, raw textual data is inadequate. This paper offers a textual-mining solution to efficiently analyse bulk textual feedback data. Despite replacement of the same parts and/or sub-parts, the actual service cost for the same repair is often distinctly different from similar previously jobs. Regular expression algorithms were incorporated with an aircraft MRO glossary dictionary in order to help provide additional information concerning the reason for cost variation. Professional terms and conventions were included within the dictionary to avoid ambiguity and improve the outcome of the result. Testing results show that most descriptive inspection reports can be appropriately interpreted, allowing extraction of highly normalized data. This additional normalized data strongly supports data analysis and data mining, whilst also increasing the accuracy of future quotation costing. This solution has been effectively used by a large aircraft MRO agency with positive results.
Resumo:
Combinatorial Optimization is a branch of optimization that deals with the problems where the set of feasible solutions is discrete. Routing problem is a well studied branch of Combinatorial Optimization that concerns the process of deciding the best way of visiting the nodes (customers) in a network. Routing problems appear in many real world applications including: Transportation, Telephone or Electronic data Networks. During the years, many solution procedures have been introduced for the solution of different Routing problems. Some of them are based on exact approaches to solve the problems to optimality and some others are based on heuristic or metaheuristic search to find optimal or near optimal solutions. There is also a less studied method, which combines both heuristic and exact approaches to face different problems including those in the Combinatorial Optimization area. The aim of this dissertation is to develop some solution procedures based on the combination of heuristic and Integer Linear Programming (ILP) techniques for some important problems in Routing Optimization. In this approach, given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution is randomly destroyed (i.e., customers are removed in a random way) and repaired by solving an ILP model, in an attempt to find a new improved solution.
Resumo:
Ischaemic spinal cord injury (SCI) remains the Achilles heel of open and endovascular descending thoracic and thoracoabdominal repair. Neurological outcomes have improved coincidentially with the introduction of neuroprotective measures. However, SCI (paraplegia and paraparesis) remains the most devastating complication. The aim of this position paper is to provide physicians with broad information regarding spinal cord blood supply, to share strategies for shortening intraprocedural spinal cord ischaemia and to increase spinal cord tolerance to transitory ischaemia through detection of ischaemia and augmentation of spinal cord blood perfusion. This study is meant to support physicians caring for patients in need of any kind of thoracic or thoracoabdominal aortic repair in decision-making algorithms in order to understand, prevent or reverse ischaemic SCI. Information has been extracted from focused publications available in the PubMed database, which are cohort studies, experimental research reports, case reports, reviews, short series and meta-analyses. Individual chapters of this position paper were assigned and after delivery harmonized by Christian D. Etz, Ernst Weigang and Martin Czerny. Consequently, further writing assignments were distributed within the group and delivered in August 2014. The final version was submitted to the EJCTS for review in September 2014.
Resumo:
Uno de los defectos más frecuentes en los generadores síncronos son los defectos a tierra tanto en el devanado estatórico, como de excitación. Se produce un defecto cuando el aislamiento eléctrico entre las partes activas de cualquiera de estos devanados y tierra se reduce considerablemente o desaparece. La detección de los defectos a tierra en ambos devanados es un tema ampliamente estudiado a nivel industrial. Tras la detección y confirmación de la existencia del defecto, dicha falta debe ser localizada a lo largo del devanado para su reparación, para lo que habitualmente el rotor debe ser extraído del estator. Esta operación resulta especialmente compleja y cara. Además, el hecho de limitar la corriente de defecto en ambos devanados provoca que el defecto no sea localizable visualmente, pues apenas existe daño en el generador. Por ello, se deben aplicar técnicas muy laboriosas para localizar exactamente el defecto y poder así reparar el devanado. De cara a reducir el tiempo de reparación, y con ello el tiempo en que el generador esta fuera de servicio, cualquier información por parte del relé de protección acerca de la localización del defecto resultaría de gran utilidad. El principal objetivo de esta tesis doctoral ha sido el desarrollo de nuevos algoritmos que permitan la estimación de la localización de los defectos a tierra tanto en el devanado rotórico como estatórico de máquinas síncronas. Respecto al devanado de excitación, se ha presentado un nuevo método de localización de defectos a tierra para generadores con excitación estática. Este método permite incluso distinguir si el defecto se ha producido en el devanado de excitación, o en cualquiera de los componentes del sistema de excitación, esto es, transformador de excitación, conductores de alimentación del rectificador controlado, etc. En caso de defecto a tierra en del devanado rotórico, este método proporciona una estimación de su localización. Sin embargo, para poder obtener la localización del defecto, se precisa conocer el valor de resistencia de defecto. Por ello, en este trabajo se presenta además un nuevo método para la estimación de este parámetro de forma precisa. Finalmente, se presenta un nuevo método de detección de defectos a tierra, basado en el criterio direccional, que complementa el método de localización, permitiendo tener en cuenta la influencia de las capacidades a tierra del sistema. Estas capacidades resultan determinantes a la hora de localizar el defecto de forma adecuada. En relación con el devanado estatórico, en esta tesis doctoral se presenta un nuevo algoritmo de localización de defectos a tierra para generadores que dispongan de la protección de faltas a tierra basada en la inyección de baja frecuencia. Se ha propuesto un método general, que tiene en cuenta todos los parámetros del sistema, así como una versión simplificada del método para generadores con capacidades a tierra muy reducida, que podría resultar de fácil implementación en relés de protección comercial. Los algoritmos y métodos presentados se han validado mediante ensayos experimentales en un generador de laboratorio de 5 kVA, así como en un generador comercial de 106 MVA con resultados satisfactorios y prometedores. ABSTRACT One of the most common faults in synchronous generators is the ground fault in both the stator winding and the excitation winding. In case of fault, the insulation level between the active part of any of these windings and ground lowers considerably, or even disappears. The detection of ground faults in both windings is a very researched topic. The fault current is typically limited intentionally to a reduced level. This allows to detect easily the ground faults, and therefore to avoid damage in the generator. After the detection and confirmation of the existence of a ground fault, it should be located along the winding in order to repair of the machine. Then, the rotor has to be extracted, which is a very complex and expensive operation. Moreover, the fact of limiting the fault current makes that the insulation failure is not visually detectable, because there is no visible damage in the generator. Therefore, some laborious techniques have to apply to locate accurately the fault. In order to reduce the repair time, and therefore the time that the generator is out of service, any information about the approximate location of the fault would be very useful. The main objective of this doctoral thesis has been the development of new algorithms and methods to estimate the location of ground faults in the stator and in the rotor winding of synchronous generators. Regarding the excitation winding, a new location method of ground faults in excitation winding of synchronous machines with static excitation has been presented. This method allows even to detect if the fault is at the excitation winding, or in any other component of the excitation system: controlled rectifier, excitation transformer, etc. In case of ground fault in the rotor winding, this method provides an estimation of the fault location. However, in order to calculate the location, the value of fault resistance is necessary. Therefore, a new fault-resistance estimation algorithm is presented in this text. Finally, a new fault detection algorithm based on directional criterion is described to complement the fault location method. This algorithm takes into account the influence of the capacitance-to-ground of the system, which has a remarkable impact in the accuracy of the fault location. Regarding the stator winding, a new fault-location algorithm has been presented for stator winding of synchronous generators. This algorithm is applicable to generators with ground-fault protection based in low-frequency injection. A general algorithm, which takes every parameter of the system into account, has been presented. Moreover, a simplified version of the algorithm has been proposed for generators with especially low value of capacitance to ground. This simplified algorithm might be easily implementable in protective relays. The proposed methods and algorithms have been tested in a 5 kVA laboratory generator, as well as in a 106 MVA synchronous generator with satisfactory and promising results.
Resumo:
Background and objective: In this paper, we have tested the suitability of using different artificial intelligence-based algorithms for decision support when classifying the risk of congenital heart surgery. In this sense, classification of those surgical risks provides enormous benefits as the a priori estimation of surgical outcomes depending on either the type of disease or the type of repair, and other elements that influence the final result. This preventive estimation may help to avoid future complications, or even death. Methods: We have evaluated four machine learning algorithms to achieve our objective: multilayer perceptron, self-organizing map, radial basis function networks and decision trees. The architectures implemented have the aim of classifying among three types of surgical risk: low complexity, medium complexity and high complexity. Results: Accuracy outcomes achieved range between 80% and 99%, being the multilayer perceptron method the one that offered a higher hit ratio. Conclusions: According to the results, it is feasible to develop a clinical decision support system using the evaluated algorithms. Such system would help cardiology specialists, paediatricians and surgeons to forecast the level of risk related to a congenital heart disease surgery.
Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.
Resumo:
Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.
Resumo:
The aim of this study was to evaluate periapical repair after root canal filling with different endodontic sealers. Sixty-four root canals from dog´s teeth were filled, divided into 4 groups (n=16). Root canals were instrumented with K-type files and irrigated with 1% sodium hypochlorite solution. Root canals were filled in the same session by active lateral condensation of the cones and sealers: Intrafill, AH Plus, Roeko Seal and Resilon/Epiphany System. After 90 days, the animals were euthanized and the tissues to be evaluated were processed and stained with hematoxylin and eosin. For histopathological analysis, the following parameters were evaluated: inflammatory process, mineralized tissue resorption, and apical mineralized tissue deposition. Histopathological analysis demonstrated that Intrafill had less favorable results in terms of apical and periapical repair, compared to the other sealers (p<0.05). AH Plus, Roeko Seal, and Epiphany sealers had similar and satisfactory results (p>0.05). In conclusion, AH Plus and the materials Roeko Seal and Epiphany are good options for clinical use in Endodontics.
Resumo:
The aim of this study was to evaluate the bone repair using autogenous periosteum-derived cells (PDC) and bovine anorganic apatite and collagen (HA-COL). PDC from Wistar rats (n=10) were seeded on HA-COL discs and subjected to osteoinduction during 6 days. Critical-size defects in rat calvarias were treated with blood clot (G1), autogenous bone (G2), HA-COL (G3) and HA-COL combined with PDC (G4) (n=40), and then analyzed 1 and 3 months after surgeries. Radiographic analysis exhibited no significant temporal change. G1 and G2 had discrete new marginal bone, but the radiopacity of graft materials in G2, G3 and G4 impaired the detection of osteogenesis. At 3 months, histopathological analysis showed the presence of ossification islets in G1, which was more evident in G2, homogeneous new bone around HA-COL in G3 and heterogeneous new bone around HA-COL in G4 in addition to moderate presence of foreign body cells in G3 and G4. Histomorphometric analysis showed no change in the volume density of xenograft (p>0.05) and bone volume density in G2 was twice greater than in G1 and G4 after 3 months (p<0.05), but similar to G3. The PDC did not increase bone formation in vivo, although the biomaterial alone showed biocompatibility and osteoconduction capacity.
Resumo:
Yerba mate (Ilex paraguariensis) is rich in several bioactive compounds that can act as free radical scavengers. Since oxidative DNA damage is involved in various pathological states such as cancer, the aim of this study was to evaluate the antioxidant activity of mate tea as well as the ability to influence DNA repair in male Swiss mice. Forty animals were randomly assigned to four groups. The animals received three different doses of mate tea aqueous extract, 0.5, 1.0 or 2.0 g/kg, for 60 days. After intervention, the liver, kidney and bladder cells were isolated and the DNA damage induced by H2O2 was investigated by the comet assay. The DNA repair process was also investigated for its potential to protect the cells from damage by the same methodology. The data presented here show that mate tea is not genotoxic in liver, kidney and bladder cells. The regular ingestion of mate tea increased the resistance of DNA to H2O2-induced DNA strand breaks and improved the DNA repair after H2O2 challenge in liver cells, irrespective of the dose ingested. These results suggest that mate tea could protect against DNA damage and enhance the DNA repair activity. Protection may be afforded by the antioxidant activity of the mate tea's bioactive compounds
Resumo:
We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.
Resumo:
Objective: to investigate the use of local anaesthetics, in the presence or absence of vasoconstrictors, for perineal repair during spontaneous delivery. Design: double-blind, randomised-controlled trial. Setting: a birth centre, in the city of Sao Paulo, Brazil. Participants: from June to December 2004, a total of 96 women were allocated into three groups (first-degree perineal lacerations, second-degree perineal lacerations or episiotomy), and treated with local anaesthesia (1% lidocaine or 1% lidocaine with epinephrine) (n = 16 per treatment per group). Interventions: an initial local infiltration of the anaesthetic solution was given so that episiotomy could be carried out (5 ml) and to suture spontaneous lacerations (1 ml), followed by repeated doses (1 ml) until pain was completely inhibited. Measurements and findings: the main outcome measurement was the volume of anaesthetic used during episiotomy and perineal suture. Our data suggest that the concomitant use of the vasoconstrictor resulted in a significantly lower average volume used in the treatment of first-degree (1 ml, 95% confidence interval (0) 0.4-1.6) and second-degree (3.7 ml, 95% CI 1.6-5.8) lacerations (p = 0.002 and 0.001, respectively). A 0.3 ml (95% CI 1.5-2.1) average decrease in anaesthetic volume was observed with episiotomy (p = 0.724). The maximum volume of anaesthetic used with and without vasoconstrictor was 1-2 ml in 95% and 3-4 ml in 50% of first-degree lacerations, respectively, and 1-6 ml in 88% and 7-15 ml in 81% of second-degree lacerations, respectively. For episiotomy, the maximum dose was 15 ml, regardless of anaesthetic solution used. Key conclusions: our data confirm the hypothesis that the use of anaesthetics in conjunction with vasoconstrictors is more effective than anaesthetics alone in the repair of perineal lacerations, but not for episiotomy. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
Voltage and current waveforms of a distribution or transmission power system are not pure sinusoids. There are distortions in these waveforms that can be represented as a combination of the fundamental frequency, harmonics and high frequency transients. This paper presents a novel approach to identifying harmonics in power system distorted waveforms. The proposed method is based on Genetic Algorithms, which is an optimization technique inspired by genetics and natural evolution. GOOAL, a specially designed intelligent algorithm for optimization problems, was successfully implemented and tested. Two kinds of representations concerning chromosomes are utilized: binary and real. The results show that the proposed method is more precise than the traditional Fourier Transform, especially considering the real representation of the chromosomes.