Developing human minor salivary glands: morphological parallel relation between the expression of TGF-beta isoforms and cytoskeletal markers of glandular maturation

Morphogenesis of salivary glands involves complex coordinated events. Synchronisation between cell proliferation, polarisation and differentiation, which are dependent on epithelial-mesenchymal interactions and on the microenvironment, is a requirement. Growth factors mediate many of these orchestrated biological processes and transforming growth factor-beta (TGF-beta) appear to be relevant. Using immunohistochemistry and immunofluorescence, we have mapped the distribution of TGF-beta 1, 2 and 3 and compared it with the expression of maturation markers in human salivary glands obtained from foetuses ranging from weeks 4 to 24 of gestation. TGF-beta 1 first appeared during canalisation stage in the surrounding mesenchyme and, in the more differentiated stages, was expressed in the cytoplasm of acinar cells throughout the adult gland. TGF-beta 2 was detected since the bud stage of the salivary gland. Its expression was observed in ductal cells and increased along gland differentiation, TGF-beta 3 was detected from the canalisation stage of the salivary gland, being weakly expressed on ductal cells, and it was the only factor detected on myoepithelial cells. The data suggest that TGF-beta have a role to play in salivary gland development and differentiation.

High-performance L-band series and parallel switches using low-cost p-i-n diodes

Low-cost UHF-band p-i-n diodes are used to develop high-performance L-band series and parallel switches. To stop the rectification of large RF, signals, the diodes are biased at a large reverse-bias voltage. Parasitic elements of the diodes are tuned out using LC circuits in biasing circuits without increasing the size of the switches. (C) 2002 John Wiley Sons, Inc.

Analysis of a circular patch antenna radiating in a parallel-plate radial guide

A field matching method is described to analyze a recessed circular cavity radiating into a radial waveguide. Using the wall impedance approach, the analysis is divided into two separate problems of the cavity and its external environment. Based on this analysis, a computer algorithm is developed for determining wall admittances as seen at the edge of the patch in the cavity, the radial admittance matrix for the two-probe feed arrangement, and the input impedance as observed from the coaxial line feeding the cavity. This algorithm is tested against the general-purpose Hewlett-Packard finite-element High Frequency Structure Simulator as well as against measured results. Good agreement in all considered cases is noted.

Molecular rates parallel diversification contrasts between carnivorous plant sister lineages

In the carnivorous plant family Lentibulariaceae, the bladderwort lineage (Utricularia and Genlisea) is substantially more species-rich and morphologically divergent than its sister lineage, the butterworts (Pinguicula). Bladderworts have a relaxed body plan that has permitted the evolution of terrestrial, epiphytic, and aquatic forms that capture prey in intricately designed suction bladders or corkscrew-shaped lobster-pot traps. In contrast, the flypaper-trapping butterworts maintain vegetative structures typical of angiosperms. We found that bladderwort genomes evolve significantly faster across seven loci (the trnL intron, the second trnL exon, the trnL-F intergenic spacer, the rps16 intron, rbcL, coxI, and 5.8S rDNA) representing all three genomic compartments. Generation time differences did not show a significant association. We relate these findings to the contested speciation rate hypothesis, which postulates a relationship between increased nucleotide substitution and increased cladogenesis. (C) 2002 The Willi Hennig Society.

Parallel simulation system for earthquake generation: Fault analysis modules and parallel coupling analysis

Solid earth simulations have recently been developed to address issues such as natural disasters, global environmental destruction and the conservation of natural resources. The simulation of solid earth phenomena involves the analysis of complex structures including strata, faults, and heterogeneous material properties. Simulation of the generation and cycle of earthquakes is particularly important, but such simulations require the analysis of complex fault dynamics. GeoFEM is a parallel finite-element analysis system intended for solid earth field phenomena problems. This paper describes recent development in the GeoFEM project for the simulation of earthquake generation and cycles.

Eigenvalue computations in the context of data-sparse approximations of integral operators

In this work, we consider the numerical solution of a large eigenvalue problem resulting from a finite rank discretization of an integral operator. We are interested in computing a few eigenpairs, with an iterative method, so a matrix representation that allows for fast matrix-vector products is required. Hierarchical matrices are appropriate for this setting, and also provide cheap LU decompositions required in the spectral transformation technique. We illustrate the use of freely available software tools to address the problem, in particular SLEPc for the eigensolvers and HLib for the construction of H-matrices. The numerical tests are performed using an astrophysics application. Results show the benefits of the data-sparse representation compared to standard storage schemes, in terms of computational cost as well as memory requirements.

Projecto de execução de fundações e estruturas de uma ponte em betão armado pré-esforçado

Este Trabalho refere-se ao Projecto de Execução de Fundações e Estruturas de uma Ponte Rodoviária em betão armado pré-esforçado, realizado no âmbito do Trabalho Final de Mestrado em Engenharia Civil – Especialização em Estruturas, do Instituto Superior de Engenharia de Lisboa. O Projecto de Execução é composto de Peças Escritas e Peças Desenhadas. Nas Peças Escritas estão incluídos: Memória Justificativa e Descritiva; Cálculos Justificativos e Anexos. A ponte é composta por dois tabuleiros paralelos com 10,28m de largura cada um e afastados entre si de 0,10m. A obra é constituída de 8 tramos; os tramos correntes com 31m de comprimento e os tramos extremos com 25 e 20m de comprimento, perfazendo um comprimento total de 231m. A obra foi parcialmente isolada dos sismos pela introdução, em todos os pilares, de aparelhos de apoio de elevado amortecimento sísmico do tipo HDRB (High Damping Rubber Bearings). Encontram-se particularmente discriminadas e detalhadas neste projecto as seguintes situações: - Cálculo do Pré-esforço e respectivas perdas; - Acção das sobrecargas rodoviárias; - Diferença de comportamento da obra na entrada em serviço e no longo prazo; - Análise sísmica e do isolamento sísmico; - Estudo dos efeitos diferidos: retracção e fluência. Tendo as abordagens de cálculo e as verificações de segurança seguido a regulamentação nacional em vigor, nomeadamente RSA e REBAP, foi no entanto feita uma aproximação às regras do “Capacity Design” previstas no EC8, em que se privilegia a actuação do projectista sobre o comportamento da estrutura, procurando uma resposta não linear da mesma, visando garantir que: - A rotura não ocorrerá nos elementos de fundação; - Nos pilares a dissipação de energia se faz através de rótulas plásticas, evitando-se roturas associadas a esforços transversos. A aplicação destas regras neste Projecto demonstrou haver um agravamento substancial na definição dos esforços a que devem resistir alguns dos componentes da estrutura, designadamente os pilares e as fundações, originando soluções de secções de betão e armaduras bem mais exigentes do que aqueles que resultariam da simples verificação de segurança, pela comparação entre esforços actuante e esforços resistentes “secção a secção”, imposta pela actual regulamentação nacional.

Kdd, semma crisp-dm: a parallel overviee

In the last years there has been a huge growth and consolidation of the Data Mining field. Some efforts are being done that seek the establishment of standards in the area. Included on these efforts there can be enumerated SEMMA and CRISP-DM. Both grow as industrial standards and define a set of sequential steps that pretends to guide the implementation of data mining applications. The question of the existence of substantial differences between them and the traditional KDD process arose. In this paper, is pretended to establish a parallel between these and the KDD process as well as an understanding of the similarities between them.

KDD, SEMMA and CRISP-DM: a parallel overview

In the last years there has been a huge growth and consolidation of the Data Mining field. Some efforts are being done that seek the establishment of standards in the area. Included on these efforts there can be enumerated SEMMA and CRISP-DM. Both grow as industrial standards and define a set of sequential steps that pretends to guide the implementation of data mining applications. The question of the existence of substantial differences between them and the traditional KDD process arose. In this paper, is pretended to establish a parallel between these and the KDD process as well as an understanding of the similarities between them.

Parallel implementation of vertex component analysis for hyperspectral endmember extraction

International Conference with Peer Review 2012 IEEE International Conference in Geoscience and Remote Sensing Symposium (IGARSS), 22-27 July 2012, Munich, Germany

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

Specification of software architecture reconfiguration

In the past years, Software Architecture has attracted increased attention by academia and industry as the unifying concept to structure the design of complex systems. One particular research area deals with the possibility of reconfiguring architectures to adapt the systems they describe to new requirements. Reconfiguration amounts to adding and removing components and connections, and may have to occur without stopping the execution of the system being reconfigured. This work contributes to the formal description of such a process. Taking as a premise that a single formalism hardly ever satisfies all requirements in every situation, we present three approaches, each one with its own assumptions about the systems it can be applied to and with different advantages and disadvantages. Each approach is based on work of other researchers and has the aesthetic concern of changing as little as possible the original formalism, keeping its spirit. The first approach shows how a given reconfiguration can be specified in the same manner as the system it is applied to and in a way to be efficiently executed. The second approach explores the Chemical Abstract Machine, a formalism for rewriting multisets of terms, to describe architectures, computations, and reconfigurations in a uniform way. The last approach uses a UNITY-like parallel programming design language to describe computations, represents architectures by diagrams in the sense of Category Theory, and specifies reconfigurations by graph transformation rules.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.