In situ impedance spectroscopy study of the electrochemical corrosion of Ti and Ti-6Al-4V in simulated body fluid at 25 degrees C and 37 degrees C

The corrosion resistance of Ti and Ti-6Al-4V was investigated through electrochemical impedance spectroscopy, EIS, potentiodynamic polarisation curves and UV-Vis spectrophotometry. The tests were done in Hank solution at 25 degrees C and 37 degrees C. The EIS measurements were done at the open circuit potential at specific immersion times. An increase of the resistance as a function of the immersion time was observed, for Ti (at 25 degrees C and 37 degrees C), and for Ti-6Al-4V (at 25 degrees C), which was interpreted as the formation and growth of a passive film on the metallic surfaces. (C) 2009 Elsevier Ltd. All rights reserved.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Using Normative Markov Decision Processes for Evaluating Electronic Contracts: A Case Study in a Simulated Aerospace Aftermarket

Before signing electronic contracts, a rational agent should estimate the expected utilities of these contracts and calculate the violation risks related to them. In order to perform such pre-signing procedures, this agent has to be capable of computing a policy taking into account the norms and sanctions in the contracts. In relation to this, the contribution of this work is threefold. First, we present the Normative Markov Decision Process, an extension of the Markov Decision Process for explicitly representing norms. In order to illustrate the usage of our framework, we model an example in a simulated aerospace aftermarket. Second, we specify an algorithm for identifying the states of the process which characterize the violation of norms. Finally, we show how to compute policies with our framework and how to calculate the risk of violating the norms in the contracts by adopting a particular policy.

Uma Proposta de especificação formal e fundamentação teórica para simulated annealing

Os algoritmos baseados no paradigma Simulated Annealing e suas variações são atualmente usados de forma ampla na resolução de problemas de otimização de larga escala. Esta popularidade é resultado da estrutura extremamente simples e aparentemente universal dos algoritmos, da aplicabilidade geral e da habilidade de fornecer soluções bastante próximas da ótima. No início da década de 80, Kirkpatrick e outros apresentaram uma proposta de utilização dos conceitos de annealing (resfriamento lento e controlado de sólidos) em otimização combinatória. Esta proposta considera a forte analogia entre o processo físico de annealing e a resolução de problemas grandes de otimização combinatória. Simulated Annealing (SA) é um denominação genérica para os algoritmos desenvolvidos com base nesta proposta. Estes algoritmos combinam técnicas de busca local e de randomização. O objetivo do presente trabalho é proporcionar um entendimento das características do Simulated Annealing e facilitar o desenvolvimento de algoritmos com estas características. Assim, é apresentado como Simulated Annealing e suas variações estão sendo utilizados na resolução de problemas de otimização combinatória, proposta uma formalização através de um método de desenvolvimento de algoritmos e analisados aspectos de complexidade. O método de desenvolvimento especifica um programa abstrato para um algoritmo Simulated Annealing seqüencial, identifica funções e predicados que constituem os procedimentos deste programa abstrato e estabelece axiomas que permitem a visualização das propriedades que estes procedimentos devem satisfazer. A complexidade do Simulated Annealing é analisada a partir do programa abstrato desenvolvido e de seus principais procedimentos, permitindo o estabelecimento de uma equação genérica para a complexidade. Esta equação genérica é aplicável aos algoritmos desenvolvidos com base no método proposto. Uma prova de correção é apresentada para o programa abstrato e um código exemplo é analisado com relação aos axiomas estabelecidos. O estabelecimento de axiomas tem como propósito definir uma semântica para o algoritmo, o que permite a um desenvolvedor analisar a correção do código especificado para um algoritmo levando em consideração estes axiomas. O trabalho foi realizado a partir de um estudo introdutório de otimização combinatória, de técnicas de resolução de problemas, de um levantamento histórico do uso do Simulated Annealing, das variações em torno do modelo e de embasamentos matemáticos documentados. Isto permitiu identificar as características essenciais dos algoritmos baseados no paradigma, analisar os aspectos relacionados com estas características, como as diferentes formas de realizar uma prescrição de resfriamento e percorrer um espaço de soluções, e construir a fundamentação teórica genérica proposta.

Mechanism of Muscle Vibrations During Stimulated and Voluntary Isometric Contractions of Mammalian Skeletal Muscle

When a muscle contracts it produces vibrations. The origin of these vibrations is not known in detail. The purpose of this study was to determine the mechanism associated with muscle vibrations. Mechanisms which have been proposed in the literature were described as theories (cross-bridge cycling, vibrating string and unfused motor unit theories). Specific predictions were derived from each theory, and tested in three conceptually different studies. In the first study, the influence of recruitment strategies of motor units (MUs) on the vibromyographic (VMG) signal was studied in the in-situ cat soleus using electrical stimulation of the soleus nerve. VMG signals increased with increasing recruitment and decreased with increasing firing rates of MUs. Similar results were obtained for the human rectus femoris (RF) muscle using percutaneous electrical stimulation of the femoral nerve. The influence of MU activation on muscle vibrations was studied in RF by analyzing VMG signals at different percentages (0-100%) of the maximal voluntary contraction (MVC). In our second study, we tested the effects of changing the material properties of the in-situ cat soleus (through muscle length changes) on the VMG signal. The magnitude of the VMG signal was higher for intermediate muscle lengths compared to the longest and the shortest muscle lengths. The decreased magnitude of the VMG signal at the longest and at the shortest muscle lengths was associated with increased passive stiffness and with decreased force transients during unfused contractions, respectively. In the third study, the effect of fatigue on muscle vibrations was studied in human RF and vastus lateralis (VL) musc1es during isometric voluntary contractions at a leveI of 70% MVC. A decrease in the VMG signal magnitude was observed in RF (presumably due to derecruitment of MUs) and an increase in VL (probably related to the enhancement of physiological tremor, which may have occurred predorninantly in a mediolateral direction) with fatigue. The unfused MU theory, which is based on the idea that force transients produced by MUs during unfused tetanic contraction is the mechanism for muscle vibrations, was supported by the results obtained in the above three studies.

Existence and uniqueness of a fixed-point for local contractions

This paper proves the existence and uniqueness of a fixed-point for local contractions without assuming the family of contraction coefficients to be uniformly bounded away from 1. More importantly it shows how this fixed-point result can apply to study existence and uniqueness of solutions to some recursive equations that arise in economic dynamics.

Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado

This paper analyzes the performance of a parallel implementation of Coupled Simulated Annealing (CSA) for the unconstrained optimization of continuous variables problems. Parallel processing is an efficient form of information processing with emphasis on exploration of simultaneous events in the execution of software. It arises primarily due to high computational performance demands, and the difficulty in increasing the speed of a single processing core. Despite multicore processors being easily found nowadays, several algorithms are not yet suitable for running on parallel architectures. The algorithm is characterized by a group of Simulated Annealing (SA) optimizers working together on refining the solution. Each SA optimizer runs on a single thread executed by different processors. In the analysis of parallel performance and scalability, these metrics were investigated: the execution time; the speedup of the algorithm with respect to increasing the number of processors; and the efficient use of processing elements with respect to the increasing size of the treated problem. Furthermore, the quality of the final solution was verified. For the study, this paper proposes a parallel version of CSA and its equivalent serial version. Both algorithms were analysed on 14 benchmark functions. For each of these functions, the CSA is evaluated using 2-24 optimizers. The results obtained are shown and discussed observing the analysis of the metrics. The conclusions of the paper characterize the CSA as a good parallel algorithm, both in the quality of the solutions and the parallel scalability and parallel efficiency

Modelagem dos algorítmos simples e Simulated Annealing por cadeias de Markov

Os Algoritmos Genético (AG) e o Simulated Annealing (SA) são algoritmos construídos para encontrar máximo ou mínimo de uma função que representa alguma característica do processo que está sendo modelado. Esses algoritmos possuem mecanismos que os fazem escapar de ótimos locais, entretanto, a evolução desses algoritmos no tempo se dá de forma completamente diferente. O SA no seu processo de busca trabalha com apenas um ponto, gerando a partir deste sempre um nova solução que é testada e que pode ser aceita ou não, já o AG trabalha com um conjunto de pontos, chamado população, da qual gera outra população que sempre é aceita. Em comum com esses dois algoritmos temos que a forma como o próximo ponto ou a próxima população é gerada obedece propriedades estocásticas. Nesse trabalho mostramos que a teoria matemática que descreve a evolução destes algoritmos é a teoria das cadeias de Markov. O AG é descrito por uma cadeia de Markov homogênea enquanto que o SA é descrito por uma cadeia de Markov não-homogênea, por fim serão feitos alguns exemplos computacionais comparando o desempenho desses dois algoritmos

Effects of muscarinic receptor antagonists on acetylcholine-induced contractions of jejunal smooth muscle in horses

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

THE EFFECT of E-GLASS FIBERS and ACRYLIC RESIN THICKNESS on FRACTURE LOAD IN A SIMULATED IMPLANT-SUPPORTED OVERDENTURE PROSTHESIS

Statement of problem. Implant overdenture prostheses are prone to acrylic resin fracture because of space limitations around the implant overdenture components.Purpose. The purpose of this study was to evaluate the influence of E-glass fibers and acrylic resin thickness in resisting acrylic resin fracture around a simulated overdenture abutment.Material and methods. A model was developed to simulate the clinical situation of an implant overdenture abutment with varying acrylic resin thickness (1.5 or 3.0 mm) with or without E-glass fiber reinforcement. Forty-eight specimens with an underlying simulated abutment were divided into 4 groups (n=12): 1.5 mm acrylic resin without E-glass fibers identified as thin with no E-glass fiber mesh (TN-N); 1.5 mm acrylic resin with E-glass fibers identified as thin with E-glass fiber mesh (TN-F); 3.0 mm acrylic resin without E-glass fibers identified as thick without E-glass fiber mesh (TK-N); and 3.0 mm acrylic resin with E-glass fibers identified as thick with E-glass fiber mesh (TK-F). All specimens were submitted to a 3-point bending test and fracture loads (N) were analyzed with a 2-way ANOVA and Tukey's post hoc test (alpha=.05).Results. The results revealed significant differences in fracture load among the 4 groups, with significant effects from both thickness (P<.001) and inclusion of the mesh (P<.001). Results demonstrated no interaction between mesh and thickness (P=.690). The TN-N: 39 +/- 5 N; TN-F: 50 +/- 6.9 N; TK-N: 162 +/- 13 N; and TK-F: 193 +/- 21 N groups were all statistically different (P<.001).Conclusions. The fracture load of a processed, acrylic resin implant-supported overdenture can be significantly increased by the addition of E-glass fibers even when using thin acrylic resin sections. on a relative basis, the increase in fracture load was similar when adding E-glass fibers or increasing acrylic resin thickness. (J Prosthet Dent 2011;106:373-377)

Weight loss and changes in surface roughness of denture base and reline materials after simulated toothbrushing in vitro

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