Projeto Alternativo ao Nó de Ligação do Pópulo

O presente trabalho visa, o estudo e a elaboração de um projeto de execução de um Nó de Ligação em trevo completo. O projeto requer um estudo cuidado da geometria das estradas principais existentes, das características do terreno e de todas as restantes condicionantes que se impõe à realização do mesmo. Esta fase do projeto é decisiva para o desenvolvimento e o sucesso do projeto, nos diversos aspetos técnicos, económicos e ambientais relacionados. Após o enquadramento do nó de ligação em trevo no terreno, procedeu-se à localização dos quatro ramos de ligação direta, ao seu traçado geométrico e as ligações às estradas principais. Seguidamente, realizou-se o traçado de todos os restabelecimentos necessários para a circulação nas vias pré-existentes e o seu acesso ao nó. Este trabalho foi realizado aplicando todos os conhecimentos adquiridos na Licenciatura em Engenharia Civil e no Mestrado em Engenharia Civil no Ramo das Infraestruturas e Ambiente no ISEP, com especial importância em Vias de Comunicação e Infraestruturas de Transportes. Todos os procedimentos de definição geométrica e analítica do nó de ligação em trevo foram realizados recorrendo ao programa para computador “AutoCAD Civil 2013”.

Complete DNA sequence and gene organization of the mitochondrial genome of the liverfluke, Fasciola hepatica L. (Platyhelminthes; Trematoda)

The complete nucleotide sequence of the mitochondrial (mt) DNA molecule of the liverfluke, Fasciola hepatica (phylum Platyhelminthes, class Trematoda, family Fasciolidae), was determined, It comprises 14462 bp, contains 12 protein-encoding, 2 ribosomal and 22 transfer RNA genes, and is the second complete flatworm (and the first trematode) mitochondrial sequence to be described in detail. All of the genes are transcribed from the same strand. Of the genes typically found in mitochondrial genomes of eumetazoans, only atp8 is absent. The nad4L and nad4 genes overlap by 40 nt. Most intergenic sequences are very short. Two larger non-coding regions are present. The longer one (817 nt) is located between trnG and cox3 and consists of 8 identical tandem repeats of 85 nt, rich in G and C, followed by 1 imperfect repeat. The shorter non-coding region (187 nt) exhibits no special features and is separated from the longer region by trnG. The gene arrangement resembles that of some other trematodes including the eastern Asian Schistosoma species (and cyclophyllidean cestode species) but it is strikingly different from that of the African schistosomes, represented by Schistosoma mansoni. The genetic code is as inferred previously for flatworms. Transfer RNA genes range in length from 58 to 70 nt, their products producing characteristic 'clover leaf' structures, except for tRNA(S-VON) and tRNA(S-AGN) lacking the DHU arm.

Beta-lactamase detection in Staphylococcus aureus and coagulase-negative Staphylococcus isolated from bovine mastitis

The objectives of the study were to evaluate the presence/production of beta-lactamases by both phenotypic and genotypic methods, verify whether results are dependent of bacteria type (Staphylococcus aureus versus coagulase-negative Staphylococcus - CNS) and verify the agreement between tests. A total of 200 bacteria samples from 21 different herds were enrolled, being 100 CNS and 100 S. aureus. Beta-lactamase presence/detection was performed by different tests (PCR, clover leaf test - CLT, Nitrocefin disk, and in vitro resistance to penicillin). Results of all tests were not dependent of bacteria type (CNS or S. aureus). Several S. aureus beta-lactamase producing isolates were from the same herd. Phenotypic tests excluding in vitro resistance to penicillin showed a strong association measured by the kappa coefficient for both bacteria species. Nitrocefin and CLT are more reliable tests for detecting beta-lactamase production in staphylococci.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Beta-lactamase detection in Staphylococcus aureus and coagulase-negative Staphylococcus isolated from bovine mastitis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

FERM domain interaction with myosin negatively regulates FAK in cardiomyocyte hypertrophy

Focal adhesion kinase (FAK) regulates cellular processes that affect several aspects of development and disease. The FAK N-terminal FERM (4.1 protein-ezrin-radixin-moesin homology) domain, a compact clover-leaf structure, binds partner proteins and mediates intramolecular regulatory interactions. Combined chemical cross-linking coupled to MS, small-angle X-ray scattering, computational docking and mutational analyses showed that the FAK FERM domain has a molecular cleft (similar to 998 angstrom(2)) that interacts with sarcomeric myosin, resulting in FAK inhibition. Accordingly, mutations in a unique short amino acid sequence of the FERM myosin cleft, FP-1, impaired the interaction with myosin and enhanced FAK activity in cardiomyocytes. An FP-1 decoy peptide selectively inhibited myosin interaction and increased FAK activity, promoting cardiomyocyte hypertrophy through activation of the AKT-mammalian target of rapamycin pathway. Our findings uncover an inhibitory interaction between the FAK FERM domain and sarcomeric myosin that presents potential opportunities to modulate the cardiac hypertrophic response through changes in FAK activity.

Gráfico interactivo de las relaciones derivativas entre palabras del español

[ES] La aplicación Gráfico interactivo de las relaciones derivativas entre palabras del español se centra en realizar un tratamiento a la información recabada en la tesis Sistema computacional de la gestión morfológica del español, de toda la información que contiene esta tesis este proyecto hace uso recogiendo cualquier palabra introducida por el usuario, buscando su forma canónica y devolviendo en forma gráfica la familia de palabras relacionada con esta, mediante un grafo. Esta aplicación web tiene como objetivo hacer amena la legibilidad y consulta de la información mencionada. Para lograr este objetivo se ha desarrollado una interfaz muy sencilla para el usuario, en la que éste solo tiene que introducir una palabra y relacionarla mediante un click. Una vez realizada la búsqueda, la aplicación permite al usuario interactuar con el grafo, pudiendo moverlo por la pantalla a su antojo, también tiene la función de mostrar los hijos de un nodo hoja al pasar el puntero por encima de éste y al hacer doble click sobre un nodo hoja, sea hijo o nieto de la raíz, devolviendo un nuevo grafo con el nodo seleccionado como raíz del mismo y mostrando sus hijos y nietos si los tuviera.

MODULARITY BASED FUZZY COMMUNITY DETECTION IN SOCIAL NETWORKS

Fuzzy community detection is to identify fuzzy communities in a network, which are groups of vertices in the network such that the membership of a vertex in one community is in [0,1] and that the sum of memberships of vertices in all communities equals to 1. Fuzzy communities are pervasive in social networks, but only a few works have been done for fuzzy community detection. Recently, a one-step forward extension of Newman’s Modularity, the most popular quality function for disjoint community detection, results into the Generalized Modularity (GM) that demonstrates good performance in finding well-known fuzzy communities. Thus, GMis chosen as the quality function in our research. We first propose a generalized fuzzy t-norm modularity to investigate the effect of different fuzzy intersection operators on fuzzy community detection, since the introduction of a fuzzy intersection operation is made feasible by GM. The experimental results show that the Yager operator with a proper parameter value performs better than the product operator in revealing community structure. Then, we focus on how to find optimal fuzzy communities in a network by directly maximizing GM, which we call it Fuzzy Modularity Maximization (FMM) problem. The effort on FMM problem results into the major contribution of this thesis, an efficient and effective GM-based fuzzy community detection method that could automatically discover a fuzzy partition of a network when it is appropriate, which is much better than fuzzy partitions found by existing fuzzy community detection methods, and a crisp partition of a network when appropriate, which is competitive with partitions resulted from the best disjoint community detections up to now. We address FMM problem by iteratively solving a sub-problem called One-Step Modularity Maximization (OSMM). We present two approaches for solving this iterative procedure: a tree-based global optimizer called Find Best Leaf Node (FBLN) and a heuristic-based local optimizer. The OSMM problem is based on a simplified quadratic knapsack problem that can be solved in linear time; thus, a solution of OSMM can be found in linear time. Since the OSMM algorithm is called within FBLN recursively and the structure of the search tree is non-deterministic, we can see that the FMM/FBLN algorithm runs in a time complexity of at least O (n2). So, we also propose several highly efficient and very effective heuristic algorithms namely FMM/H algorithms. We compared our proposed FMM/H algorithms with two state-of-the-art community detection methods, modified MULTICUT Spectral Fuzzy c-Means (MSFCM) and Genetic Algorithm with a Local Search strategy (GALS), on 10 real-world data sets. The experimental results suggest that the H2 variant of FMM/H is the best performing version. The H2 algorithm is very competitive with GALS in producing maximum modularity partitions and performs much better than MSFCM. On all the 10 data sets, H2 is also 2-3 orders of magnitude faster than GALS. Furthermore, by adopting a simply modified version of the H2 algorithm as a mutation operator, we designed a genetic algorithm for fuzzy community detection, namely GAFCD, where elite selection and early termination are applied. The crossover operator is designed to make GAFCD converge fast and to enhance GAFCD’s ability of jumping out of local minimums. Experimental results on all the data sets show that GAFCD uncovers better community structure than GALS.

Long-distance transport of alkali metals in maturing wheat

The alkali metals cesium, rubidium, lithium and sodium were introduced together with strontium via flaps into leaf laminas or into the stem of maturing, intact winter wheat (Triticum aestivum L. cv. Arina) grown in a field. Long-distance transport of these elements and the influence of the application date and of different application positions were investigated. The phloem-immobile Sr served as a marker for the distribution of the xylem sap in the plants. Dry matter accumulation in the grains and the transpiration per shoot were not markedly affected by the treatments as compared to control plants. The phloem mobility was rather high for Cs and Rb. Li was almost immobile in the phloem (similarly to Sr). An application into the cut stem xylem below the second leaf node contributed more to the contents in the grains than an application into the flag leaf. An earlier feeding date led to a higher accumulation in the grains. The marked losses of the elements applied during maturation (most pronounced for Li) can be explained by leakage in the rain.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Computación evolutiva de bosques de expansión mínimos con restricción de grado y de rol

Encontrar el árbol de expansión mínimo con restricción de grado de un grafo (DCMST por sus siglas en inglés) es un problema NP-complejo ampliamente estudiado. Una de sus aplicaciones más importantes es el dise~no de redes. Aquí nosotros tratamos una nueva variante del problema DCMST, que consiste en encontrar el árbol de expansión mínimo no solo con restricciones de grado, sino también con restricciones de rol (DRCMST), es decir, a~nadimos restricciones para restringir el rol que los nodos tienen en el árbol. Estos roles pueden ser nodo raíz, nodo intermedio o nodo hoja. Por otra parte, no limitamos el número de nodos raíz a uno, por lo que, en general, construiremos bosques de DRCMSTs. El modelado en los problemas de dise~no de redes puede beneficiarse de la posibilidad de generar más de un árbol y determinar el rol de los nodos en la red. Proponemos una nueva representación basada en permutaciones para codificar los bosques de DRCMSTs. En esta nueva representación, una permutación codifica simultáneamente todos los árboles que se construirán. Nosotros simulamos una amplia variedad de problemas DRCMST que optimizamos utilizando ocho algoritmos de computación evolutiva diferentes que codifican los individuos de la población utilizando la representación propuesta. Los algoritmos que utilizamos son: algoritmo de estimación de distribuciones (EDA), algoritmo genético generacional (gGA), algoritmo genético de estado estacionario (ssGA), estrategia evolutiva basada en la matriz de covarianzas (CMAES), evolución diferencial (DE), estrategia evolutiva elitista (ElitistES), estrategia evolutiva no elitista (NonElitistES) y optimización por enjambre de partículas (PSO). Los mejores resultados fueron para el algoritmo de estimación de distribuciones utilizado y ambos tipos de algoritmos genéticos, aunque los algoritmos genéticos fueron significativamente más rápidos.---ABSTRACT---Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode the forest of DRCMSTs. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight diferent evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm (EDA), generational genetic algorithm (gGA), steady-state genetic algorithm (ssGA), covariance matrix adaptation evolution strategy (CMAES), diferential evolution (DE), elitist evolution strategy (ElististES), non-elitist evolution strategy (NonElististES) and particle swarm optimization (PSO). The best results are for the estimation of distribution algorithm and both types of genetic algorithms, although the genetic algorithms are significantly faster. iv

Identity and pathogenicity of Fusarium spp. Isolated from wheat fields in Queensland and northern New South Wales

To establish the identity of Fusarium species associated with head blight (FHB) and crown rot (CR) of wheat, samples were collected from wheat paddocks with different cropping history in southern Queensland and northern New South Wales during 2001. CR was more widespread but FHB was only evident in northern NSW and often occurred with CR in the same paddock. Twenty different Fusarium spp. were identified from monoconidial isolates originating from different plant parts by using morphology and species-specific PCR assays. Fusarium pseudograminearum constituted 48% of all isolates and was more frequently obtained from the crown, whereas Fusarium graminearum made up 28% of all isolates and came mostly from the head. All 17 Fusarium species tested caused FHB and all 10 tested caused CR in plant infection assays, with significant (P < 0.001) difference in aggressiveness among species and among isolates within species for both diseases. Overall, isolates from stubble and crown were more aggressive for CR, whereas isolates from the flag leaf node were more aggressive for FHB. Isolates that were highly aggressive in causing CR were those originating from paddocks with wheat following wheat, whereas those from fields with wheat following maize or sorghum were highly aggressive for FHB. Although 20% of isolates caused severe to highly severe FHB and CR, there was no significant (P < 0.32) correlation between aggressiveness for FHB and CR. Given the ability of F. graminearum to colonise crowns in the field and to cause severe CR in bioassays, it is unclear why this pathogen is not more widely distributed in Australia.

Protected cropping for specialty melons in North Queensland

Protective cropping could be an effective system for growing specialty melons in the dry tropics of North Queensland. The growing system could reduce outdoor risks for production loss, improve fruit quality, increase yield per m2, allow production offseason, and used for supplying niche markets in a segment of the larger melon market in Australia. First evaluations in Giru, Queensland, included seven cultivars of fruit types 'Galia', 'Hami', 'Charentais', small 'Canary', and 'Rockmelon', transplanted July 25, 2013 under a high polyethylene-covered tunnel. Plants were grown at a density of 2.8 plants m-2 in containers filled with volcanic rock and irrigated with a complete nutrient solution. Pruning and trellising was done to a single vertical stem, keeping lateral shoots on the main stem after the 7th leaf node. After bearing small fruit, lateral shoots were cut off after their second or third leaf node. To facilitate insect pollination, a screen window in the tunnel was left partially opened. On November 20 the cultivars had combined marketable yields that ranged from 2.8 to 8.2 fruits m-2 and 3.1 to 7.8 kg m-2. Total soluble solids levels in fruit ranged from 6 to 13 °Brix. Cultivars 'Tempo' ('Galia'), 'Tikal' ('Canary') and 'Sultan' ('Charentais') had fruit yields that were up to 2.6 times greater than yields commonly achieved with field-grown rockmelon crops. Sugar levels in fruits and marketable yields may be increased with changes in fertigation management. Promising results in this first evaluation justify examination of a greater number of genetic materials, in addition to the development of economic feasibility studies and further adaptive research to refine crop recommendations for growing melons in protective cropping systems.

Leaf area index estimation with MODIS reflectance time series and model inversion during full rotations of Eucalyptus plantations

The leaf area index (LAI) of fast-growing Eucalyptus plantations is highly dynamic both seasonally and interannually, and is spatially variable depending on pedo-climatic conditions. LAI is very important in determining the carbon and water balance of a stand, but is difficult to measure during a complete stand rotation and at large scales. Remote-sensing methods allowing the retrieval of LAI time series with accuracy and precision are therefore necessary. Here, we tested two methods for LAI estimation from MODIS 250m resolution red and near-infrared (NIR) reflectance time series. The first method involved the inversion of a coupled model of leaf reflectance and transmittance (PROSPECT4), soil reflectance (SOILSPECT) and canopy radiative transfer (4SAIL2). Model parameters other than the LAI were either fixed to measured constant values, or allowed to vary seasonally and/or with stand age according to trends observed in field measurements. The LAI was assumed to vary throughout the rotation following a series of alternately increasing and decreasing sigmoid curves. The parameters of each sigmoid curve that allowed the best fit of simulated canopy reflectance to MODIS red and NIR reflectance data were obtained by minimization techniques. The second method was based on a linear relationship between the LAI and values of the GEneralized Soil Adjusted Vegetation Index (GESAVI), which was calibrated using destructive LAI measurements made at two seasons, on Eucalyptus stands of different ages and productivity levels. The ability of each approach to reproduce field-measured LAI values was assessed, and uncertainty on results and parameter sensitivities were examined. Both methods offered a good fit between measured and estimated LAI (R(2) = 0.80 and R(2) = 0.62 for model inversion and GESAVI-based methods, respectively), but the GESAVI-based method overestimated the LAI at young ages. (C) 2010 Elsevier Inc. All rights reserved.

An ATP-binding cassette subfamily G full transporter is essential for the retention of leaf water in both wild barley and rice.

Land plants have developed a cuticle preventing uncontrolled water loss. Here we report that an ATP-binding cassette (ABC) subfamily G (ABCG) full transporter is required for leaf water conservation in both wild barley and rice. A spontaneous mutation, eibi1.b, in wild barley has a low capacity to retain leaf water, a phenotype associated with reduced cutin deposition and a thin cuticle. Map-based cloning revealed that Eibi1 encodes an HvABCG31 full transporter. The gene was highly expressed in the elongation zone of a growing leaf (the site of cutin synthesis), and its gene product also was localized in developing, but not in mature tissue. A de novo wild barley mutant named "eibi1.c," along with two transposon insertion lines of rice mutated in the ortholog of HvABCG31 also were unable to restrict water loss from detached leaves. HvABCG31 is hypothesized to function as a transporter involved in cutin formation. Homologs of HvABCG31 were found in green algae, moss, and lycopods, indicating that this full transporter is highly conserved in the evolution of land plants.