Combined solution for fault location in three-terminal lines based on wavelet transforms

This work presents the study and development of a combined fault location scheme for three-terminal transmission lines using wavelet transforms (WTs). The methodology is based on the low- and high-frequency components of the transient signals originated from fault situations registered in the terminals of a system. By processing these signals and using the WT, it is possible to determine the time of travelling waves of voltages and/or currents from the fault point to the terminals, as well as estimate the fundamental frequency components. A new approach presents a reliable and accurate fault location scheme combining some different solutions. The main idea is to have a decision routine in order to select which method should be used in each situation presented to the algorithm. The combined algorithm was tested for different fault conditions by simulations using the ATP (Alternative Transients Program) software. The results obtained are promising and demonstrate a highly satisfactory degree of accuracy and reliability of the proposed method.

Root Water Extraction under Combined Water and Osmotic Stress

Using a numerical implicit model for root water extraction by a single root in a symmetric radial flow problem, based on the Richards equation and the combined convection-dispersion equation, we investigated some aspects of the response of root water uptake to combined water and osmotic stress. The model implicitly incorporates the effect of simultaneous pressure head and osmotic head on root water uptake, and does not require additional assumptions (additive or multiplicative) to derive the combined effect of water and salt stress. Simulation results showed that relative transpiration equals relative matric flux potential, which is defined as the matric flux potential calculated with an osmotic pressure head-dependent lower bound of integration, divided by the matric flux potential at the onset of limiting hydraulic conditions. In the falling rate phase, the osmotic head near the root surface was shown to increase in time due to decreasing root water extraction rates, causing a more gradual decline of relative transpiration than with water stress alone. Results furthermore show that osmotic stress effects on uptake depend on pressure head or water content, allowing a refinement of the approach in which fixed reduction factors based on the electrical conductivity of the saturated soil solution extract are used. One of the consequences is that osmotic stress is predicted to occur in situations not predicted by the saturation extract analysis approach. It is also shown that this way of combining salinity and water as stressors yields results that are different from a purely multiplicative approach. An analytical steady state solution is presented to calculate the solute content at the root surface, and compared with the outputs of the numerical model. Using the analytical solution, a method has been developed to estimate relative transpiration as a function of system parameters, which are often already used in vadose zone models: potential transpiration rate, root length density, minimum root surface pressure head, and soil theta-h and K-h functions.

Specific PCR based detection of Phytophthora medicaginis using the intergenic spacer region of the ribosomal DNA

A technique based on the polymerase chain reaction (PCR) for the specific detection of Phytophthora medicaginis was developed using nucleotide sequence information of the ribosomal DNA (rDNA) regions. The complete IGS 2 region between the 5 S gene of one rDNA repeat and the small subunit of the adjacent repeat was sequenced for P. medicaginis and related species. The entire nucleotide sequence length of the IGS 2 of P. medicaginis was 3566 bp. A pair of oligonucleotide primers (PPED04 and PPED05), which allowed amplification of a specific fragment (364 bp) within the IGS 2 of P. medicaginis using the PCR, was designed. Specific amplification of this fragment from P. medicaginis was highly sensitive, detecting template DNA as low as 4 ng and in a host-pathogen DNA ratio of 1000000:1. Specific PCR amplification using PPED04 and PPED05 was successful in detecting P. medicaginis in lucerne stems infected under glasshouse conditions and field infected lucerne roots. The procedures developed in this work have application to improved identification and detection of a wide range of Phytophthora spp. in plants and soil.

A DNA-based demonstration of a three-host life-cycle for the Bivesiculidae (Platyhelminthes : Digenea)

Immature bivesiculid trematodes collected from the intestine of Thalassoma lunare (Labridae) are shown to be morphologically consistent with adults of Bivesicula claviformis from Epinephelus fasciatus (Serranidae). In addition, the immature bivesiculids have the same sequence for the second internal transcribed spacer of the ribosomal DNA. Comparison with three other species of Bivesiculidae showed differences of between 23% and 30%. These results show that bivesiculids may have three-host life-cycles in addition to the two-host life-cycles that have been demonstrated previously. The three-host life-cycle enables bivesiculids to infect large carnivorous fishes. (C) 1998 Australian Society for Parasitology. Published by Elsevier Science Ltd. All rights reserved.

A preliminary phylogeny of the scale insects (Hemiptera : Sternorrhyncha : Coccoidea) based on nuclear small-subunit ribosomal DNA

Scale insects (Hemiptera: Sternorrhyncha: Coccoidea) are a speciose and morphologically specialized group of plant-feeding bugs in which evolutionary relationships and thus higher classification are controversial. Sequences derived from nuclear small-subunit ribosomal DNA were used to generate a preliminary molecular phylogeny for the Coccoidea based on 39 species representing 14 putative families. Monophyly of the archaeococcoids (comprising Ortheziidae, Margarodidae sensu lato, and Phenacoleachia) was equivocal, whereas monophyly of the neococcoids was supported. Putoidae, represented by Puto yuccae, was found to be outside the remainder of the neococcoid clade. These data are consistent with a single origin (in the ancestor of the neococcoid clade) of a chromosome system involving paternal genome elimination in males. Pseudococcidae (mealybugs) appear to be sister to the rest of the neococcoids and there are indications that Coccidae (soft scales) and Kerriidae (lac scales) are sister taxa. The Eriococcidae (felt scales) was not recovered as a monophyletic group and the eriococcid genus Eriococcus sensu lato was polyphyletic. (C) 2002 Elsevier Science (USA). All rights reserved.

Tooth Replantation After Use of Euro-Coffins Solution or Bovine Milk as Storage Medium: A Histomorphometric Analysis in Dogs

Purpose: Euro-Collins solution was developed for the preservation of organs for transplantation, whose characteristics have raised interest for its use as a storage medium for avulsed teeth before replantation. This study evaluated histologically and morphometrically the healing process of dog teeth replanted after storage in Euro-Collins solution or bovine milk. Materials and Methods: Eighty roots of 4 young adult mongrel clogs were randomly assigned to 4 groups (n = 20) and the root canals were instrumented and obturated with gutta-percha and a calcium hydroxide-based sealer. After 2 weeks, the teeth were extracted and subjected to the following protocols: GI (negative control), replantation immediately after extraction; GII (positive control), bench-drying for 2 hours before replantation; GIII and GIV, immersion in 10 mL of whole bovine milk and Euro-Collins solution at 4 C, respectively, for 8 hours before replantation. The animals were sacrificed 90 days postoperatively. The pieces containing the replanted teeth were subjected to routine processing for histologic and histometric analyses under light microscopy and polarized light microscopy. Results: Root resorption was observed in all groups. GII exhibited the greatest loss of dental structure (P < .01), and inflammatory resorption was predominant in this group. Storage in milk showed poorer results than immediate replantation and storage in Euro-Collins solution (P < .01). The teeth stored in Euro-Collins solution presented similar extension of root resorption and periodontal ligament reorganization to those of immediately replanted teeth. Conclusions: The findings of this study suggest that the Euro-Collins solution is an adequate storage medium for keeping avulsed teeth for up to 8 hours before replantation. Crown Copyright (C) 2010 Published by Elsevier Inc on behalf of American Association of Oral and Maxillofacial Surgeons. All rights reserved. Oral Maxillofac Surg 68:111-119, 2010

A new wavelet-based method for the solution of the population balance equation

A new wavelet-based method for solving population balance equations with simultaneous nucleation, growth and agglomeration is proposed, which uses wavelets to express the functions. The technique is very general, powerful and overcomes the crucial problems of numerical diffusion and stability that often characterize previous techniques in this area. It is also applicable to an arbitrary grid to control resolution and computational efficiency. The proposed technique has been tested for pure agglomeration, simultaneous nucleation and growth, and simultaneous growth and agglomeration. In all cases, the predicted and analytical particle size distributions are in excellent agreement. The presence of moving sharp fronts can be addressed without the prior investigation of the characteristics of the processes. (C) 2001 Published by Elsevier Science Ltd.

Coupling between replication and packaging of flavivirus RNA: Evidence derived from the use of DNA-based full-length cDNA clones of kunjin virus

In order to study whether flavivirus RNA packaging is dependent on RNA replication, we generated two DNA-based Kunjin virus constructs, pKUN1 and pKUN1dGDD, allowing continuous production of replicating (wild-type) and nonreplicating (with a deletion of the NS5 gene RNA-polymerase motif GDD) full-length Kunjin virus RNAs, respectively, via nuclear transcription by cellular RNA polymerase II. As expected, transfection of pKUN1 plasmid DNA into BHK cells resulted in the recovery of secreted infectious Kunjin virions. Transfection of pKUN1dGDD DNA into BHK cells, however, did not result in the recovery of any secreted virus particles containing encapsidated dGDD RNA, despite an apparent accumulation of this RNA in cells demonstrated by Northern blot analysis and its efficient translation demonstrated by detection of correctly processed labeled structural proteins (at least prM and E) both in cells and in the culture fluid using coimmunoprecipitation analysis with anti-E antibodies. In contrast, when dGDD RNA was produced even in much smaller amounts in PKUN1dGDD DNA-transfected repBHK cells (where it was replicated via complementation), it was packaged into secreted virus particles, Thus, packaging of defective Kunjin virus RNA could occur only when it was replicated. Our results with genome-length Kunjin virus RNA and the results with poliovirus replicon RNA (C, I. Nugent et al,, J, Virol, 73:427-435, 1999), both demonstrating the necessity for the RNA to be replicated before it can be packaged, strongly suggest the existence of a common mechanism for minimizing amplification and transmission of defective RNAs among the quasispecies in positive-strand RNA viruses, This mechanism may thus help alleviate the high-copy error rate of RNA-dependent RNA polymerases.

A genetic map of macadamia based on randomly amplified DNA fingerprinting (RAF) markers

The first genetic linkage map of macadamia (Macadamia integrifolia and M. tetraphylla) is presented. The map is based on 56 F-1 progeny of cultivars 'Keauhou' and 'A16'. Eighty-four percent of the 382 markers analysed segregated as Mendelian loci. The two-way pseudo-testcross mapping strategy allowed construction of separate parental cultivar maps. Ninety bridging loci enabled merging of these maps to produce a detailed genetic map of macadamia, 1100 cM in length and spanning 70-80% of the genome. The combined map comprised 24 linkage groups with 265 framework markers: 259 markers from randomly amplified DNA fingerprinting (RAF), five random amplified polymorphic DNA (RAPD), and one sequence-tagged microsatellite site (STMS). The RAF marker system unexpectedly revealed 16 codominant markers, one of them a putative microsatellite locus and exhibiting four distinct alleles in the cross. This molecular study is the most comprehensive examination to date of genetic loci of macadamia, and is a major step towards developing marker-assisted selection for this crop.

Human-robot teamwork: a knowledge-based solution

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

DNA nanoprobes for molecular detection

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Biológica – especialidade Engenharia Genética, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Constraint-based modeling of minimum set covering: application to species differentation

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics