Evaluation of light transmission through translucent and opaque posts

Objectives: The transmission of light through translucent posts was observed, and the microhardness of light-cured cement used to secure these posts was evaluated at different depths. Methods: Fifteen single-rooted standard bovine teeth, 16 mm in size, were used. The root canals were prepared using #3 drills Light-Post (five teeth) and Aestheti Post (five teeth) systems (BISCO), with a working-length of 12 mm. In five teeth, translucent posts were cemented (Light-Post #2), while another five teeth received opaque posts (Aestheti Post #2). The roots were painted with black nail varnish to prevent the passage of light through the lateral walls of the roots. The root canals of all the specimens were treated with the All-Bond 2 adhesive system (BISCO) and cemented with light-cured cement (Enforce, Dentsply). All the roots were transversally cut to obtain six specimens 1.5 mm thick. Every two sections corresponded to a specific region of the root (cervical, middle, apical), making it possible to observe the cement microhardness at different levels. The groups (n=10) were defined as: G1: translucent post (TP)/cervical region; G2: TP/middle region; G3: TP/apical region; G4: Opaque post (OP)/cervical region; G5: OP/middle region; G6: PO/apical region. Five root canals were only filled with cement for use as a control (G7). Then, Vickers microhardness analyses were performed. Results: In G3, G5 and G6, the cement was not sufficiently hard to allow for microhardness analysis. When submitted to the ANOVA test, G1 (35.07), G2 (24.28) and G4 (28.64) presented no statistical differences. When the previous groups were compared to G7 (51.00) using the Kruskal-Wallis test, a statistical difference was found. Conclusion: Translucent posts allow cement polymerization up to the middle portion of the root.

Experimental paracoccidioidomycosis in hamster: transmission electron microscopy of inoculation site lesion

Estudou-se sequencialmente, à microscopia eletrônica de transmissão, a interação entre Paracoccidioides brasiliensis (Pb) e células inflamatórias em hamsters inoculados por via intratesticular. Seis horas após inoculações havia predominância de neutrófilos, estando presentes algumas células mononucleares e eosinófilos. Os neutrófilos foram progressivamente substituídos por células mononucleares. Fungos viáveis apresentavam-se fagocitados ou circunscritos por células inflamatórias, geralmente com ampla interface hospedeiro-parasita. Fungos mortos ou degenerados eram acompanhados de interfase estreita. A camada externa da parede do Pb era às vezes quebrada quando em contacto com neutrófilos, em vários pontos, sendo os fragmentos dessa parede descamados e fagocitados. Células fúngicas pequenas com um único núcleo se relacionavam com ampla interfase enquanto as células maiores e multinucleadas apresentavam paredes irregulares, por vezes, contendo lomasoma e/ou estrutura semelhante à mielina. Diferentes padrões de interação do Pb com células do hospedeiro podem ser decorrentes do a fluxo de células inflamatórias funcionalmente diferentes ao local de inoculação ou à idade dos fungos ou ambos os fatores.

Report on ticks collected in the Southeast and Mid-West regions of Brazil: analyzing the potential transmission of tick-borne pathogens to man

Foram coletados espécimes de carrapatos em 1993, 1996, 1997, e 1998, principalmente de animais selvagens e domésticos, nas Regiões Sudeste e Centro-oeste do Brasil. Nove espécies de Amblyommidae foram identificadas: Anocentor Nitens, Amblyomma cajennense, Amblyomma ovale, Amblyomma fulvum, Amblyomma striatum, Amblyomma rotundatum, Boophilus microplus, Boophilus annulatus e Rhipicephalus sanguineus. Analisou-se o potencial destas nove espécies de carrapatos como transmissores de patógenos para o homem. Um Flaviviridade Flavivirus foi isolado de espécimes de Amblyomma cajennense coletados de um capivara doente (Hydrochaeris hydrochaeris). Amblyomma cajennense é o transmissor principal da Rickettsia rickettsii (=R. rickettsi), o agente causador da febre maculosa no Brasil. Os mamíferos selvagens, principalmente capivaras e veados infestados por carrapatos vivem em próximo contato com gado, cavalos e cachorros, com quem compartilham os mesmos carrapatos, oferecendo risco de transmissão destas zoonoses silvestres aos animais domésticos e ao homem.

A metaheuristic to solve the transmission expansion planning

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Transmission network expansion planning with security constraints

A mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints are presented. The methodology allows one to find an optimal and reliable transmission network expansion plan using a DC model to represent the electrical network. The security (n-1) criterion is used. The model presented is solved using a genetic algorithm designed to solve the reliable expansion planning in an efficient way. The results obtained for several known systems from literature show the excellent performance of the proposed methodology. A comparative analysis of the results obtained with the proposed methodology is also presented.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Z(bus) transmission network cost allocation

This paper addresses the problem of allocating the cost of the transmission network to generators and demands. A physically-based network usage procedure is proposed. This procedure exhibits desirable apportioning properties and is easy to implement and understand. A case study based on the IEEE 24-bus system is used to illustrate the working of the proposed technique. Some relevant conclusions are finally drawn.

A SEMICLASSICAL DESCRIPTION OF NONLOCAL EFFECTS ON BARRIER TRANSMISSION

A quantum treatment for nonlocal factorizable potentials is presented in which the Weyl-Wiper quantum phase space description plays an essential role. The nonlocality is treated in an approximated form and allows for a Feynman propagator that can be handled in standard way. The semi-classical limit of the propagator is obtained which permits the calculation of the transmission factor in quantum tunnelling processes. An application in nuclear physics is also discussed.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.