• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 271
  • 145
  • 59
  • 48
  • 23
  • 12
  • 11
  • 10
  • 7
  • 6
  • 5
  • 4
  • 2
  • 2
  • 2
  • Tagged with
  • 729
  • 185
  • 136
  • 89
  • 87
  • 87
  • 80
  • 79
  • 75
  • 69
  • 68
  • 57
  • 52
  • 49
  • 48
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Regeneration and Transformation of Impatiens walleriana Using Cotyledonary Node Culture

Baxter, Aaron Jacob 16 January 2006 (has links)
Impatiens walleriana, commonly grown as a herbaceous annual, is susceptible to Impatiens Necrotic Spot Virus (INSV). A lack of resistant cultivars leaves growers with the sole option of destroying infected plants before INSV spreads throughout their entire crop. Therefore, the introduction of INSV resistant cultivars would have the potential to save Impatiens growers a substantial amount of money. Virus resistance has been successfully conveyed in several crops by insertion of pathogen DNA into the host plant. One method of generating transgenic plants involves the use of Agrobacterium-mediated gene transfer. A commonly used technique involves transformation of explant tissue and subsequent regeneration in vitro under aseptic conditions. However, prior to our research there was no regeneration protocol suitable for Agrobacterium-mediated transformation of Impatiens walleriana available. Herein we report the development of a new method for regeneration of Impatiens walleriana using cotyledonary node culture. Using this technique, four regeneration media amended with 1, 3, 5, or 7µM of thidiazuron were evaluated for their ability to induce de novo shoot production in cotyledonary node explants, and evaluated for number of shoots produced per explant. Results showed a significantly greater frequency of regeneration and number of shoots per explant using media amended with 1µM of thidiazuron. This technique has shown to be repeatable and is not susceptible to ploidy instability. Unfortunately, damage to the cotyledonary node explants during Agrobacterium inoculation and transfection prevented regeneration of transformed shoots in several attempts. However, transient GFP expression after transfection of shoot pads derived from cotyledonary nodes with Agrobacterium strain LBA 4404 containing plasmid pHB2829 with nptII and S-GFP was obtained, indicating the possibility for this regeneration protocol to derive stably transformed Impatiens with INSV resistance. / Master of Science
102

Modeling C2 Networks as Dependencies: Understanding What the Real Issues Are

Drabble, Brian January 2014 (has links)
No / This chapter describes an approach to modeling C2 and other types of networks as a series of nodes (people, groups, resources, locations, concepts, etc.). The nodes are linked by one or more weighted arcs describing the type and the strength of the dependency that one node has on another node. This model allows analysts to identify the most important nodes in a network in terms of their direct and indirect dependencies and to rank them accordingly. The same model also supports consequence analysis in which the direct, indirect, cascading, and cumulative effects of changes to node capabilities can be propagated across the networks. The chapter describes the basic modeling technique and two types of dependency propagation that it supports. These are illustrated with two examples involving the modeling and reasoning across insurgent networks and an Integrated Air Defense System. These show how aspects of the networks can be analyzed and targeted. Details are also provided on the mechanisms to link the analysis to a planning system through which plans can be developed to bring about desired effect(s) in the networks.
103

Utilização do gama probe na detecção do linfonodo sentinela em pacientes com câncer de próstata

Silva Júnior, Neivo da 14 February 2005 (has links)
Made available in DSpace on 2016-03-22T17:26:57Z (GMT). No. of bitstreams: 1 Neivo.pdf: 343535 bytes, checksum: e65c41380c8ceabe9bc780ffcc1c99f1 (MD5) Previous issue date: 2005-02-14 / Objective: The objective of this study is to describe the reproducibility of the sentinel lymph node technique in patients with prostate cancer and verify if there is improved accuracy over modified lymphadenectomy. Material and methods: Twenty-three patients with biopsy proven prostate cancer were enrolled in this study. Lymphoscintigraphy was performed after the transrectal administration of 99mTc-Sulphur Colloid guided by ultrasound, with one injection in each prostate lobe. Images were obtained 15 and 180 minutes after injection. Sentinel lymph node was harvested during surgery using a gamma probe, followed by extended lymphadenectomy. Results: The mean age of the patients in this study was 66 years old. An average of 3.36 sentinel lymph nodes was found for each patient. Radioactive lymph nodes were identified by the gamma probe in 21 out of 23 patients. In one of the patients there was no radiopharmaceutical migration from the injection site and in another the sentinel lymph node was visualized by lymphoscintigraphy but was not found during surgery. Three patients had lymph node metastasis; in one of these patients the sentinel lymph node was the only positive node and was found outside the modified lymphadenectomy region (dissection of the lymph nodes from the obturator fossa and the external iliac). Conclusion: Sentinel lymph node biopsy in prostate cancer adds important information to the staging of patients, not always attained through the lymphadenectomy restricted to the obturator fossa and external iliac. Such information is essencial for the choice of the best treatment to be applied. / n
104

Reconfiguração no t-node em caso de falhas / Reconfiguration on the t-node machine under fault

Nunes, Raul Ceretta January 1993 (has links)
Procedimentos de reconfiguração são usados em diversos sistemas para isolar módulos falhos e recuperar o sistema após a ocorrência de erros. Em ambientes multiprocessadores, onde existe redundância implícita de nodos processadores, vários algoritmos de reconfiguração já foram propostos. Entretanto a maior parte destes algoritmos destina-se a topologias específicas bastante exploradas como, por exemplo, arquiteturas na forma de arrays e árvores. Neste trabalho é apresentada uma estratégia de detecção/reconfiguração para tolerar falhas na máquina T-NODE. Esta máquina possui uma arquitetura multiprocessadora fracamente acoplada, que tem como processador base o transputer. Sua arquitetura de interconexão é definida pelo usuário; a organização de barramentos implementada com base em uma chave crossbar, a qual permite uma variada e fácil gama de opções. Assim, os algoritmos tradicionais de reconfiguração não se aplicam pois são excessivamente restritivos. A análise da arquitetura e do software de baixo nível existentes para a T-NODE revelou recursos praticamente inexistentes a nível de controle de falhas nos processadores e erros no processamento. Mesmo considerando-se que o principal objetivo desta máquina é a obtenção de alto desempenho, é possível implementar procedimentos que melhorem suas características de confiabilidade. Neste estudo é apresentada uma maneira de melhorar o nível de tolerância a falhas da máquina de modo que ela possa ser usada em tarefas mais exigentes do ponto de vista de confiabilidade, sem perda excessiva de desempenho. A estratégia definda usa a técnica de redundância dinâmica com detecção de falhas on-line e recuperação do sistema através do isolamento da falha por reconfiguração e conseqüente reinicialização do sistema. A validação da estratégia foi feita pela construção de um protótipo utilizando a linguagem OCCAM2 e um processador transputer conectado ao barramento de um microcomputador PC. No protótipo foram implementados três processos distintos: o testador, o supervisor e o reconfigurador. Estes processos têm respectivamente, as funções de testar os nodos processadores, supervisionar os resultados dos testes e reconfigurar o sistema quando da ocorrência de uma falha. / In many systems, reconfiguration strategies are used to remove failed components and to recuperate system from the resulting errors. Various reconfiguration algorithms have been proposed with the goal of covering faults in multiprocessing systems, but most of them support only specific architecture styles, as arrays or trees. In this study, a reconfiguration algorithm is proposed whose goal is to tolerate faults in the T-NODE machine. The T-NODE is a loosed coupled, multiprocessor machine based on transputers. The analysis of the architecture and of the system software existing for the T-NODE has shown that, in practice, there were not special resources aiming to control processor faults and processing errors. Even considering that the main goal of this machine is processing with high performance, it is possible to implement alternative procedures which result in better reliability characteristics. By other way, the interconnection architecture of this machine is defined by the user; its bus organization implemented with the aid of a crossbar switch allows choices among several possibilities. Consequently, traditional algorithms do not apply because they are too restrictive. Therefore, the research here related aims to improve the fault-tolerance parameters of this machine without changing significantly its original performance. The strategy here presented uses a dynamic redundancy technique with on-line fault detection; system recovery is get by logically isolating the faulty module, reconfiguring the others and restarting the system. The validation of the strategy has been done with the construction of a prototype using the OCCAM2 language and a transputer processor connected to the bus of a microcomputer (PC). Three different processes have been implemented in the prototype: the tester, the supervisior and the reconfigurator. These processes have respectively the functions of: testing the processing nodes, to supervise tests results and to reconfigure the system under fault occurrence.
105

A Comparison of the Costs of Sentinel Lymph Node Biopsy and of Axillary lymph Node Dissection in the Management of Early-stage Breast Cancer in Ontario

Wells, Bryan John 17 February 2010 (has links)
Objective: To complete a cost-minimization analysis (CMA) of the cost of sentinel lymph node biopsy (SLNB) and axillary lymph node dissection (ALND) in the management of early-stage breast cancer (ESBC) in a hypothetical Ontario hospital setting. Methods: Decision-analysis modeling, with a decision-tree and Markov states, was used to estimate hospital costs for the two treatment options. The model was populated with data from the literature and costs from the Ontario Case Costing Initiative, a publicly accessible, government-sponsored, costing database. Model variability and parameter uncertainty were quantified by probabilistic sensitivity analysis (PSA). Results: The SLNB treatment algorithm was cost-minimizing compared to the ALND-only treatment option. The costs of treating postoperative complications did not contribute to the incremental average cost. Conclusion: A treatment algorithm that involves SLNB as the initial axillary-staging procedure in the setting of ESBC offers a cost-savings over the ALND-only option. This result is generalizable to all Ontario hospitals.
106

A Comparison of the Costs of Sentinel Lymph Node Biopsy and of Axillary lymph Node Dissection in the Management of Early-stage Breast Cancer in Ontario

Wells, Bryan John 17 February 2010 (has links)
Objective: To complete a cost-minimization analysis (CMA) of the cost of sentinel lymph node biopsy (SLNB) and axillary lymph node dissection (ALND) in the management of early-stage breast cancer (ESBC) in a hypothetical Ontario hospital setting. Methods: Decision-analysis modeling, with a decision-tree and Markov states, was used to estimate hospital costs for the two treatment options. The model was populated with data from the literature and costs from the Ontario Case Costing Initiative, a publicly accessible, government-sponsored, costing database. Model variability and parameter uncertainty were quantified by probabilistic sensitivity analysis (PSA). Results: The SLNB treatment algorithm was cost-minimizing compared to the ALND-only treatment option. The costs of treating postoperative complications did not contribute to the incremental average cost. Conclusion: A treatment algorithm that involves SLNB as the initial axillary-staging procedure in the setting of ESBC offers a cost-savings over the ALND-only option. This result is generalizable to all Ontario hospitals.
107

Reconfiguração no t-node em caso de falhas / Reconfiguration on the t-node machine under fault

Nunes, Raul Ceretta January 1993 (has links)
Procedimentos de reconfiguração são usados em diversos sistemas para isolar módulos falhos e recuperar o sistema após a ocorrência de erros. Em ambientes multiprocessadores, onde existe redundância implícita de nodos processadores, vários algoritmos de reconfiguração já foram propostos. Entretanto a maior parte destes algoritmos destina-se a topologias específicas bastante exploradas como, por exemplo, arquiteturas na forma de arrays e árvores. Neste trabalho é apresentada uma estratégia de detecção/reconfiguração para tolerar falhas na máquina T-NODE. Esta máquina possui uma arquitetura multiprocessadora fracamente acoplada, que tem como processador base o transputer. Sua arquitetura de interconexão é definida pelo usuário; a organização de barramentos implementada com base em uma chave crossbar, a qual permite uma variada e fácil gama de opções. Assim, os algoritmos tradicionais de reconfiguração não se aplicam pois são excessivamente restritivos. A análise da arquitetura e do software de baixo nível existentes para a T-NODE revelou recursos praticamente inexistentes a nível de controle de falhas nos processadores e erros no processamento. Mesmo considerando-se que o principal objetivo desta máquina é a obtenção de alto desempenho, é possível implementar procedimentos que melhorem suas características de confiabilidade. Neste estudo é apresentada uma maneira de melhorar o nível de tolerância a falhas da máquina de modo que ela possa ser usada em tarefas mais exigentes do ponto de vista de confiabilidade, sem perda excessiva de desempenho. A estratégia definda usa a técnica de redundância dinâmica com detecção de falhas on-line e recuperação do sistema através do isolamento da falha por reconfiguração e conseqüente reinicialização do sistema. A validação da estratégia foi feita pela construção de um protótipo utilizando a linguagem OCCAM2 e um processador transputer conectado ao barramento de um microcomputador PC. No protótipo foram implementados três processos distintos: o testador, o supervisor e o reconfigurador. Estes processos têm respectivamente, as funções de testar os nodos processadores, supervisionar os resultados dos testes e reconfigurar o sistema quando da ocorrência de uma falha. / In many systems, reconfiguration strategies are used to remove failed components and to recuperate system from the resulting errors. Various reconfiguration algorithms have been proposed with the goal of covering faults in multiprocessing systems, but most of them support only specific architecture styles, as arrays or trees. In this study, a reconfiguration algorithm is proposed whose goal is to tolerate faults in the T-NODE machine. The T-NODE is a loosed coupled, multiprocessor machine based on transputers. The analysis of the architecture and of the system software existing for the T-NODE has shown that, in practice, there were not special resources aiming to control processor faults and processing errors. Even considering that the main goal of this machine is processing with high performance, it is possible to implement alternative procedures which result in better reliability characteristics. By other way, the interconnection architecture of this machine is defined by the user; its bus organization implemented with the aid of a crossbar switch allows choices among several possibilities. Consequently, traditional algorithms do not apply because they are too restrictive. Therefore, the research here related aims to improve the fault-tolerance parameters of this machine without changing significantly its original performance. The strategy here presented uses a dynamic redundancy technique with on-line fault detection; system recovery is get by logically isolating the faulty module, reconfiguring the others and restarting the system. The validation of the strategy has been done with the construction of a prototype using the OCCAM2 language and a transputer processor connected to the bus of a microcomputer (PC). Three different processes have been implemented in the prototype: the tester, the supervisior and the reconfigurator. These processes have respectively the functions of: testing the processing nodes, to supervise tests results and to reconfigure the system under fault occurrence.
108

Reconfiguração no t-node em caso de falhas / Reconfiguration on the t-node machine under fault

Nunes, Raul Ceretta January 1993 (has links)
Procedimentos de reconfiguração são usados em diversos sistemas para isolar módulos falhos e recuperar o sistema após a ocorrência de erros. Em ambientes multiprocessadores, onde existe redundância implícita de nodos processadores, vários algoritmos de reconfiguração já foram propostos. Entretanto a maior parte destes algoritmos destina-se a topologias específicas bastante exploradas como, por exemplo, arquiteturas na forma de arrays e árvores. Neste trabalho é apresentada uma estratégia de detecção/reconfiguração para tolerar falhas na máquina T-NODE. Esta máquina possui uma arquitetura multiprocessadora fracamente acoplada, que tem como processador base o transputer. Sua arquitetura de interconexão é definida pelo usuário; a organização de barramentos implementada com base em uma chave crossbar, a qual permite uma variada e fácil gama de opções. Assim, os algoritmos tradicionais de reconfiguração não se aplicam pois são excessivamente restritivos. A análise da arquitetura e do software de baixo nível existentes para a T-NODE revelou recursos praticamente inexistentes a nível de controle de falhas nos processadores e erros no processamento. Mesmo considerando-se que o principal objetivo desta máquina é a obtenção de alto desempenho, é possível implementar procedimentos que melhorem suas características de confiabilidade. Neste estudo é apresentada uma maneira de melhorar o nível de tolerância a falhas da máquina de modo que ela possa ser usada em tarefas mais exigentes do ponto de vista de confiabilidade, sem perda excessiva de desempenho. A estratégia definda usa a técnica de redundância dinâmica com detecção de falhas on-line e recuperação do sistema através do isolamento da falha por reconfiguração e conseqüente reinicialização do sistema. A validação da estratégia foi feita pela construção de um protótipo utilizando a linguagem OCCAM2 e um processador transputer conectado ao barramento de um microcomputador PC. No protótipo foram implementados três processos distintos: o testador, o supervisor e o reconfigurador. Estes processos têm respectivamente, as funções de testar os nodos processadores, supervisionar os resultados dos testes e reconfigurar o sistema quando da ocorrência de uma falha. / In many systems, reconfiguration strategies are used to remove failed components and to recuperate system from the resulting errors. Various reconfiguration algorithms have been proposed with the goal of covering faults in multiprocessing systems, but most of them support only specific architecture styles, as arrays or trees. In this study, a reconfiguration algorithm is proposed whose goal is to tolerate faults in the T-NODE machine. The T-NODE is a loosed coupled, multiprocessor machine based on transputers. The analysis of the architecture and of the system software existing for the T-NODE has shown that, in practice, there were not special resources aiming to control processor faults and processing errors. Even considering that the main goal of this machine is processing with high performance, it is possible to implement alternative procedures which result in better reliability characteristics. By other way, the interconnection architecture of this machine is defined by the user; its bus organization implemented with the aid of a crossbar switch allows choices among several possibilities. Consequently, traditional algorithms do not apply because they are too restrictive. Therefore, the research here related aims to improve the fault-tolerance parameters of this machine without changing significantly its original performance. The strategy here presented uses a dynamic redundancy technique with on-line fault detection; system recovery is get by logically isolating the faulty module, reconfiguring the others and restarting the system. The validation of the strategy has been done with the construction of a prototype using the OCCAM2 language and a transputer processor connected to the bus of a microcomputer (PC). Three different processes have been implemented in the prototype: the tester, the supervisior and the reconfigurator. These processes have respectively the functions of: testing the processing nodes, to supervise tests results and to reconfigure the system under fault occurrence.
109

Controlling false positive rate in network analysis of transcriptomic data

Xu, Huan 01 October 2019 (has links)
No description available.
110

Compiler Assisted Energy Management For Sensor Network Nodes

Jindal, Prachee 08 1900 (has links)
Emerging low power, embedded, wireless sensor devices are useful for wide range of applications, yet have very limited processing storage and especially energy resources. Sensor networks have a wide variety of applications in medical monitoring, environmental sensing and military surveillance. Due to the large number of sensor nodes that may be deployed and the required long system lifetimes, replacing the battery is not an option. Sensor systems must utilize the minimal possible energy while operating over a wide range of operating scenarios. The most of the efforts in the energy management in sensor networks have concentrated on minimizing energy consumption in the communication subsystem. Some researchers have also dealt with the issue of minimizing the energy in computing subsystem of a sensor network node. Some proposals using energy aware software have also been made. Relatively little work has been done on compiler controlled energy management in sensor networks. In this thesis, we present our investigations on how compiler techniques can be used to minimize CPU energy consumption in sensor network nodes. One effectively used energy management technique in general purpose processors, is dynamic voltage scaling. In this thesis we implement and evaluate a compiler assisted DVS algorithm and show its usefulness for a small sensor node processor. We were able to achieve an energy saving of 29% with a little performance slowdown. Scratchpad memories have been widely used for improving performance. In this thesis we show that if the scratchpad size for the system is chosen carefully, then large energy savings can be achieved by using a compiler assisted scratchpad allocation policy. With a small size of 512 byte scratchpad memory we were able to achieve 50% of energy savings. We also studied the behavior of dynamic voltage scaling in presence of scratchpad memory. Our results show that in presence of scratchpad memory less opportunities are found for applying dynamic voltage scaling techniques. The sensor network community lacks a comprehensive benchmark suite, for our study we also implemented a set of applications, representative of computational workload on sensor network nodes. The techniques studied in this thesis can easily be integrated with existing energy management techniques in sensor networks, yielding in additional energy savings.

Page generated in 0.0793 seconds