A limpeza e modelagem dos canais radiculares consiste em uma etapa fundamental para o sucesso da terapia endodôntica. O objetivo deste estudo foi avaliar um novo conceito de instrumento endodôntico Self Adjusting File (SAF), e instrumentos rotatórios de NiTi, na capacidade de limpeza de canais achatados por meio de microscopia óptica. Vinte e dois incisivos inferiores instrumentados com instrumentos rotatórios K3 (n=11) e sistema SAF (n=11), tiveram seus terços apicais submetidos ao processamento histológico e analisados em microscopia óptica (40×). As imagens capturadas pelo software Adobe Photoshop 5.1 foram analisadas com auxilio de grade de integração do software Image J. O perímetro de ação dos instrumentos nas paredes dos canais radiculares foi determinado com auxilio do software Image J e uma mesa digital Bamboo. Os dados obtidos foram submetidos à análise de variância e teste de T não pareado corrigido pelo teste de Welch, considerando-se a presença de debris no terço apical e a superfície de dentina sem contato com o instrumento (&alpha;=5%). A análise estatística mostrou haver diferença significante entre os grupos. Canais instrumentados com o sistema endodôntico SAF apresentaram valores percentual de debris e superfície não tocada pelo instrumento menores (2,18 ± 2,71 e 12,33 ± 7,85 respectivamente) quando comparado com canais instrumentados com instrumentos rotatórios (13,11 ± 12,98 e 53,54 ± 15,95, respectivamente) (p<0.05). Concluiu-se que o sistema SAF proporcionou melhor preparo de canais radiculares por tocar mais nas paredes radiculares promovendo consequentemente melhor limpeza. / Cleaning and shaping of root canals are essential steps for the success of endodontic therapy. The purpose of this study was to evaluate a new concept of endodontic instrument - the Self Adjusting File (SAF) system - and NiTi rotary instruments, regarding their cleaning capacity in flattened root canals, using optical microscopy. Twenty-two mandibular incisors prepared with K3 rotary instruments (n=11) and SAF system (n=11) had their apical thirds subjected to histological processing and analyzed by optical microscopy (40×). The images captured by Adobe Photoshop 5.1 software were analyzed with the integration grid of Image J software. The perimeter of action of the instruments on the root canals walls was determined using Image J software and a Bamboo digital tablet. Data were analyzed statistically using analysis of variance and unpaired t-test with Welchs correction, considering the presence of debris in the apical third and the root dentin surface untouched by the instrument (&alpha;=5%). The statistical analysis revealed significant difference between the groups. Canals prepared with the SAF system presented lower percent values of debris and untouched root dentin surfaces (2.18 ± 2.71 and 12.33 ± 7.85, respectively) compared with canals prepared with rotary instruments (13.11 ± 12.98 and 53.54 ± 15.95, respectively) (p<0.05). In conclusion, the SAF system was associated with better root canal preparation, as it touched more the root dentin walls and consequently promoted a more effective cleaning.

A limpeza e modelagem dos canais radiculares consiste em uma etapa fundamental para o sucesso da terapia endodôntica. O objetivo deste estudo foi avaliar um novo conceito de instrumento endodôntico Self Adjusting File (SAF), e instrumentos rotatórios de NiTi, na capacidade de limpeza de canais achatados por meio de microscopia óptica. Vinte e dois incisivos inferiores instrumentados com instrumentos rotatórios K3 (n=11) e sistema SAF (n=11), tiveram seus terços apicais submetidos ao processamento histológico e analisados em microscopia óptica (40×). As imagens capturadas pelo software Adobe Photoshop 5.1 foram analisadas com auxilio de grade de integração do software Image J. O perímetro de ação dos instrumentos nas paredes dos canais radiculares foi determinado com auxilio do software Image J e uma mesa digital Bamboo. Os dados obtidos foram submetidos à análise de variância e teste de T não pareado corrigido pelo teste de Welch, considerando-se a presença de debris no terço apical e a superfície de dentina sem contato com o instrumento (&alpha;=5%). A análise estatística mostrou haver diferença significante entre os grupos. Canais instrumentados com o sistema endodôntico SAF apresentaram valores percentual de debris e superfície não tocada pelo instrumento menores (2,18 ± 2,71 e 12,33 ± 7,85 respectivamente) quando comparado com canais instrumentados com instrumentos rotatórios (13,11 ± 12,98 e 53,54 ± 15,95, respectivamente) (p<0.05). Concluiu-se que o sistema SAF proporcionou melhor preparo de canais radiculares por tocar mais nas paredes radiculares promovendo consequentemente melhor limpeza. / Cleaning and shaping of root canals are essential steps for the success of endodontic therapy. The purpose of this study was to evaluate a new concept of endodontic instrument - the Self Adjusting File (SAF) system - and NiTi rotary instruments, regarding their cleaning capacity in flattened root canals, using optical microscopy. Twenty-two mandibular incisors prepared with K3 rotary instruments (n=11) and SAF system (n=11) had their apical thirds subjected to histological processing and analyzed by optical microscopy (40×). The images captured by Adobe Photoshop 5.1 software were analyzed with the integration grid of Image J software. The perimeter of action of the instruments on the root canals walls was determined using Image J software and a Bamboo digital tablet. Data were analyzed statistically using analysis of variance and unpaired t-test with Welchs correction, considering the presence of debris in the apical third and the root dentin surface untouched by the instrument (&alpha;=5%). The statistical analysis revealed significant difference between the groups. Canals prepared with the SAF system presented lower percent values of debris and untouched root dentin surfaces (2.18 ± 2.71 and 12.33 ± 7.85, respectively) compared with canals prepared with rotary instruments (13.11 ± 12.98 and 53.54 ± 15.95, respectively) (p<0.05). In conclusion, the SAF system was associated with better root canal preparation, as it touched more the root dentin walls and consequently promoted a more effective cleaning.

Parkinson’s disease (PD) is a common neurodegenerative disorder that is characterised by akinesia, muscular rigidity, and postural instability, due primarily to the loss of dopaminergic neurons in the substantia nigra and depletion of upstream dopamine in the striatum. Current dopaminergic treatments reduce motor symptoms, but have diminishing benefits as the disease progresses. Treatment with the neuroactive steroid natural progesterone (PROG) improves outcomes in many experimental models of brain injury due to its pleiotropic mechanisms of neuroprotection, many of which may also benefit PD. This thesis investigated the influence of PROG on motor impairments in the unilateral intrastriatal 6-hydroxydopamine (6-OHDA) lesion model of PD in rats. We established a PD-like impairment with a d-amphetamine induced rotation test at day 7 after large lesions and then administered PROG (4 mg/kg or 8 mg/kg) once daily for 7 days starting at day 8. Both PROG doses markedly improved the primary outcome measure, forelimb akinesia on the adjusting steps test, with improvement sustained for six weeks after treatment had stopped. In a second study the beneficial influence of PROG (8 mg/kg) on akinesia was replicated for rats with large lesions and was extended to rats with small lesions so that the latter rats were now similar to sham operated controls. We also found that PROG modestly improved postural instability of the ipsilateral forelimb on the postural instability test, and sensorimotor integration on the whisker test, but did not improve skilled reaching accuracy on a single-pellet reaching task, forelimb use asymmetry on the cylinder test, sensory neglect on the corridor test, or rotation bias after apomorphine. Furthermore, PROG did not change striatal tyrosine hydroxylase density when assessed in rats with large lesions. This study has provided the most thorough examination to date regarding PROG’s influence on motor skills in an animal model of PD. Furthermore, this study has produced novel evidence of the beneficial effects of PROG treatment on forelimb akinesia. These initial promising findings suggest that PROG is an effective therapy for akinesia and thus provides an impetus to further investigate PROG’s efficacy for the treatment of PD.

In this dissertation, we study self-adjusting algorithms for large-scale distributed systems. Self-adjusting algorithms enable distributed systems to adjust their properties dynamically as the input pattern changes. Self-adjustment is an attractive tool as it has the potential to significantly improve the performance of distributed systems, especially when the input patterns are skewed. We start with a distributed self-adjusting algorithm for skip graphs that minimizes the average routing costs between arbitrary communication pairs by performing topological adaptation to the communication pattern. Our algorithm is fully decentralized, conforms to the CONGEST model (i.e. uses O(log n) bit messages), and requires O(log n) bits of memory for each node, where n is the total number of nodes. Upon each communication request, our algorithm first establishes communication by using the standard skip graph routing, and then locally and partially reconstructs the skip graph topology to perform topological adaptation. We propose a computational model for such algorithms, as well as a yardstick (working set property) to evaluate them. Our working set property can also be used to evaluate self-adjusting algorithms for other graph classes where multiple tree-like subgraphs overlap (e.g. hypercube networks). We derive a lower bound of the amortized routing cost for any algorithm that follows our model and serves an unknown sequence of communication requests. We show that the routing cost of our algorithm is at most a constant factor more than the amortized routing cost of any algorithm conforming to our computational model. We also show that the expected transformation cost for our algorithm is at most a logarithmic factor more than the amortized routing cost of any algorithm conforming to our computational model. As a follow-up work, we present a distributed self-adjusting algorithm (referred to as DyHypes) for topological adaption in hypercubic networks. One of the major differences between hypercubic networks and skip graphs is that hypercubic networks are more rigid in structure than that of skip graphs. This property of hypercubic networks makes self-adjustment significantly different compared to skip graphs. Upon a communication between an arbitrary pair of nodes, DyHypes transforms the network to place frequently communicating nodes closer to each other to maximize communication efficiency, and uses randomization in the transformation process to speed up the transformation and reduce message complexity. We show that, as compared to DSG, DyHypes reduces the transformation cost by a factor of O(log n), where n is the number of nodes involved in the transformation. Moreover, despite achieving faster transformation with lower message complexity, the combined cost (routing and transformation) of DyHypes is at most a log log n factor more than that of any algorithm that conforms to the computational model adopted for this work. Similar to DSG, DyHypes is fully decentralized, conforms to the CONGEST model, and requires O(log n) bits of memory for each node, where N is the total number of nodes. Finally, we present a novel distributed load balancing algorithm called Meezan to address the load imbalance among large-scale networked cache servers. Modern web services rely on a network of distributed cache servers to efficiently deliver content to users. Load imbalance among cache servers can substantially degrade content delivery performance. Due to the skewed and dynamic nature of real-world workloads, cache servers that serve viral content experience higher load as compared to other cache servers. Our algorithm Meezan replicates popular objects to mitigate skewness and adjusts hash space boundaries in response to load dynamics in a novel way. Our theoretical analysis shows that Meezan achieves near perfect load balancing for a wide range of operating parameters. Our trace driven simulations shows that Meezan reduces load imbalance by up to 52% as compared to prior solutions.

In this research we consider synchronization of oscillators. We use mechanical metronomes that are coupled through a mechanical medium. We investigate the problem for three different cases: 1) In passive coupling of two oscillators, the coupling medium is a one degree of freedom passive mechanical basis. The analysis of the system is supported by simulations of the proposed model and experimental results. 2) In another case, the oscillator is forced by an external input while the input is also affected by the oscillator. This feedback loop introduces dynamics to the whole system. For realization, we place the mechanical metronome on a one degree of freedom moving base. The movements of the base are a function of a feedback from the phase of the metronome. We study a family of functions for the reactions of the base and their impact on the behavior of the metronome. 3) We consider two metronomes located on a moving base. In this case the two metronomes oscillate and as the base is not freely moving, they are not directly coupled to each other. Now based on the feedbacks from the vision system, the base moves and hence the phases of the metronomes are affected by these movements. We study the space of possibilities for the movements of the base and consider impacts of the base movement on the synchronization of metronomes. We also show how such a system evolves in time.

Problems with storm water runoff are becoming more frequent, and the main cause is the increase of impervious cover (IC). The imperviousness increases stream peak flows, changes peak times, and so changes the flood distribution. Several policies are used to manage flows and flooding; however most have been reported to be inefficient because land owners do not have correct exposure to price incentives and risk. The main contributions of this thesis are an investigation into market mechanisms to price and allocate impervious cover allowances, while managing flood distribution. The market mechanisms are based on the electricity and gas markets which use linear programming formulations. This thesis develops three net pool market mechanisms: Det_MarketIC is a capped and deterministic market for IC, and Sto_MarketIC and Sto_MarketIC_Risk are stochastic market models with flood component penalties and risk positions representing the desired risk from the community respectively. Additionally, a gross pool market was extended under rainfall uncertainty, Gross_MarketIC. The market design is an auction system with operational constraints and bids for IC allowances from participants. The system relates physical routed flows at nodal or control points to these bids. The models clear the market by creating a demand (supply) curve for increments (reductions) in flows at specific places, and accounts for marginal changes in the expected flood damage and flood damage components. The market formulations estimate efficient allocations and prices. Decomposed prices from the market models are shown based on duality, as applied in electricity markets. The dual prices show spatial and temporal effects of flows, which impact at flooding areas. With Sto_MarketIC and Gross_MarketIC, prices account for changes in flood distribution. With Sto_MarketIC_Risk, prices also account for the risk as CVaR in flooding areas. Thus, prices increase as binding risk conditions are tightened. Finally, the net pool models are illustrated using hydrological and hydraulic simulators based on a small catchment located in Canterbury, New Zealand. Allocations and prices varied with the different models. Participants would face increasing prices in their IC allowances due to increments in flood damage.

Objective : Low back pain (LBP), and in particular sacroiliac joint syndrome, is a significant health concern for both patient and their chiropractor with regards to quality of life and work related musculoskeletal disorders. Therefore, chiropractors often utilise mechanical aids to reduce the impact on the chiropractor’s health. It is, however, important to establish whether these mechanical aids are indeed clinically effective, therefore, this study evaluated the Activator Adjusting Instrument (AAI) against an AAI placebo to determine whether this adjusting instrument is an effective aid for both the chiropractor and the patient. Method : This randomised, placebo controlled clinical trial consisted of 40 patients (20 per group), screened by stringent inclusion criteria assessed through a telephonic and clinical assessment screen. Post receipt of informed consent from the patients, measurements (NRS, Revised Oswestry Disability Questionnaire, algometer) were taken at baseline, prior to consultation three and at the follow consultation. This procedure occurred with four interventions over a two week period. Results: The AAI group showed clinical significance for all clinical measures as compared to the AAI placebo group which attained clinical significance only for the Revised Oswestry Disability Questionnaire. By comparison there was only a statistically significant difference between the groups in terms of the algometer readings (p= 0.037). Conclusion : Therefore, it is evident that the AAI seems to have clinical benefit beyond a placebo. However this is not reflected in the statistical analysis. It is, therefore, suggested that this study be repeated with a larger sample size in order to verify the effect on the statistical analysis outcomes.

A etapa de broad-phase para a detecção de colisão em cenas compostas de n objetos que se movimentam é um problema desafiador, pois enumerar os pares de colisão revela uma complexidade quadrática. Estruturas de dados espaciais são desenvolvidas para acelerar o processo, mas muitas vezes a natureza estática dessas estruturas dificulta o manejo de cenas dinâmicas. Nesse trabalho, é proposta uma nova estrutura chamada de árvore BSP semi-ajustável para representar cenas compostas de milhares de objetos dinâmicos. Um algoritmo de agendamento avalia onde a árvore BSP torna-se desbalanceada, usa várias estratégias para alterar os planos de corte e atualizações preguiçosas para reduzir os custos de reconstrução. É mostrado que a árvore não precisa uma total reconstrução mesmo em cenas altamente dinâmicas, ajustando-se e mantendo propriedades desejáveis de balanceamento e profundidade. / The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n²) complexity. Spatial data structures are designed to accelerate this process, but often their static nature makes it difficult to handle dynamic scenes. In this work we propose a new structure called Semi-Adjusting BSP-tree for representing scenes composed of thousands of moving objects. A scheduling algorithm evaluates locations where the BSP-tree becomes unbalanced, uses several strategies to alter cutting planes, and defers updates based on their re-structuring cost. We show that the tree does not require a complete re-structuring even in highly dynamic scenes, but adjusts itself while maintaining desirable balancing and height properties.

A etapa de broad-phase para a detecção de colisão em cenas compostas de n objetos que se movimentam é um problema desafiador, pois enumerar os pares de colisão revela uma complexidade quadrática. Estruturas de dados espaciais são desenvolvidas para acelerar o processo, mas muitas vezes a natureza estática dessas estruturas dificulta o manejo de cenas dinâmicas. Nesse trabalho, é proposta uma nova estrutura chamada de árvore BSP semi-ajustável para representar cenas compostas de milhares de objetos dinâmicos. Um algoritmo de agendamento avalia onde a árvore BSP torna-se desbalanceada, usa várias estratégias para alterar os planos de corte e atualizações preguiçosas para reduzir os custos de reconstrução. É mostrado que a árvore não precisa uma total reconstrução mesmo em cenas altamente dinâmicas, ajustando-se e mantendo propriedades desejáveis de balanceamento e profundidade. / The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n²) complexity. Spatial data structures are designed to accelerate this process, but often their static nature makes it difficult to handle dynamic scenes. In this work we propose a new structure called Semi-Adjusting BSP-tree for representing scenes composed of thousands of moving objects. A scheduling algorithm evaluates locations where the BSP-tree becomes unbalanced, uses several strategies to alter cutting planes, and defers updates based on their re-structuring cost. We show that the tree does not require a complete re-structuring even in highly dynamic scenes, but adjusts itself while maintaining desirable balancing and height properties.

A etapa de broad-phase para a detecção de colisão em cenas compostas de n objetos que se movimentam é um problema desafiador, pois enumerar os pares de colisão revela uma complexidade quadrática. Estruturas de dados espaciais são desenvolvidas para acelerar o processo, mas muitas vezes a natureza estática dessas estruturas dificulta o manejo de cenas dinâmicas. Nesse trabalho, é proposta uma nova estrutura chamada de árvore BSP semi-ajustável para representar cenas compostas de milhares de objetos dinâmicos. Um algoritmo de agendamento avalia onde a árvore BSP torna-se desbalanceada, usa várias estratégias para alterar os planos de corte e atualizações preguiçosas para reduzir os custos de reconstrução. É mostrado que a árvore não precisa uma total reconstrução mesmo em cenas altamente dinâmicas, ajustando-se e mantendo propriedades desejáveis de balanceamento e profundidade. / The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n²) complexity. Spatial data structures are designed to accelerate this process, but often their static nature makes it difficult to handle dynamic scenes. In this work we propose a new structure called Semi-Adjusting BSP-tree for representing scenes composed of thousands of moving objects. A scheduling algorithm evaluates locations where the BSP-tree becomes unbalanced, uses several strategies to alter cutting planes, and defers updates based on their re-structuring cost. We show that the tree does not require a complete re-structuring even in highly dynamic scenes, but adjusts itself while maintaining desirable balancing and height properties.