Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

The Schenberg spherical gravitational wave detector: the first commissioning runs

Here we present a status report of the first spherical antenna project equipped with a set of parametric transducers for gravitational detection. The Mario Schenberg, as it is called, started its commissioning phase at the Physics Institute of the University of Sao Paulo, in September 2006, under the full support of FAPESP. We have been testing the three preliminary parametric transducer systems in order to prepare the detector for the next cryogenic run, when it will be calibrated. We are also developing sapphire oscillators that will replace the current ones thereby providing better performance. We also plan to install eight transducers in the near future, six of which are of the two-mode type and arranged according to the truncated icosahedron configuration. The other two, which will be placed close to the sphere equator, will be mechanically non-resonant. In doing so, we want to verify that if the Schenberg antenna can become a wideband gravitational wave detector through the use of an ultra-high sensitivity non-resonant transducer constructed using the recent achievements of nanotechnology.

Gravitational field of a straight cosmic string in the framework of higher-derivative gravity

The gravitational properties of a straight cosmic string are studied in the linear approximation of higher-derivative gravity. These properties are shown to be very different from those found using linearized Einstein gravity: there exists a short range gravitational (anti-gravitational) force in the nonrelativistic limit; in addition, the derection angle of a light ray moving in a plane orthogonal to the string depends on the impact parameter.

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.

Action of the gravitational field on the dynamical Casimir effect

In this paper, we analyze the action of the gravitational field on the dynamical Casimir effect. We consider a massless scalar field confined in a cuboid cavity placed in a gravitational field described by a static and diagonal metric. With one of the plane mirrors of the cavity allowed to move, we compute the average number of particles created inside the cavity by means of the Bogoliubov coefficients computed through perturbative expansions. We apply our result to the case of an oscillatory motion of the mirror, assuming a weak gravitational field described by the Schwarzschild metric. The regime of parametric amplification is analyzed in detail, demonstrating that our computed result for the mean number of particles created agrees with specific associated cases in the literature. Our results, obtained in the framework of the perturbation theory, are restricted, under resonant conditions, to a short-time limit.

Efficiency in the loading of a sodium magneto-optical trap from alkali metal dispensers

We study the loading of sodium atoms into a magneto-optical trap from current-controlled sodium metal dispensers. Contrary to what was previously reported [V. Wippel, C. Binder, W. Huber, L Windholz, M. Allegrini, F. Fuso, E. Arimondo, Eur. Phys. J. D 17 (2001) 2851 we demonstrate a significantly higher number of trapped atoms that make Na dispensers a feasible source of atoms for cold-atom studies. The inherent rise in pressure that naturally arises from metal dispensers as they are heated to release atoms is partially controlled by placing the metal dispensers near the pumping port where an ion pump is connected. We also study the effects of placing the sodium dispensers at different distances from the main vacuum chamber where the atoms are trapped and the effectiveness of using a Zeeman slower to cool the atoms as they emerge from the dispensers. We observe trapping of up to 1.9 x 10(8) atoms, which is significantly higher by almost three orders of magnitude than previously reported experiments. (C) 2008 Elsevier B.V. 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.

Gravitational self-localization for spherical masses

In this work, I consider the center-of-mass wave function for a homogenous sphere under the influence of the self-interaction due to Newtonian gravity. I solve for the ground state numerically and calculate the average radius as a measure of its size. For small masses, M≲10−17 kg, the radial size is independent of density, and the ground state extends beyond the extent of the sphere. For masses larger than this, the ground state is contained within the sphere and to a good approximation given by the solution for an effective radial harmonic-oscillator potential. This work thus determines the limits of applicability of the point-mass Newton Schrödinger equations for spherical masses. In addition, I calculate the fringe visibility for matter-wave interferometry and find that in the low-mass case, interferometry can in principle be performed, whereas for the latter case, it becomes impossible. Based on this, I discuss this transition as a possible boundary for the quantum-classical crossover, independent of the usually evoked environmental decoherence. The two regimes meet at sphere sizes R≈10−7 m, and the density of the material causes only minor variations in this value.

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.

Análise paramétrica da simulação composicional do processo de Drenagem Gravitacional Assistida por Gás (GAGD)

In Brazil and around the world, oil companies are looking for, and expected development of new technologies and processes that can increase the oil recovery factor in mature reservoirs, in a simple and inexpensive way. So, the latest research has developed a new process called Gas Assisted Gravity Drainage (GAGD) which was classified as a gas injection IOR. The process, which is undergoing pilot testing in the field, is being extensively studied through physical scale models and core-floods laboratory, due to high oil recoveries in relation to other gas injection IOR. This process consists of injecting gas at the top of a reservoir through horizontal or vertical injector wells and displacing the oil, taking advantage of natural gravity segregation of fluids, to a horizontal producer well placed at the bottom of the reservoir. To study this process it was modeled a homogeneous reservoir and a model of multi-component fluid with characteristics similar to light oil Brazilian fields through a compositional simulator, to optimize the operational parameters. The model of the process was simulated in GEM (CMG, 2009.10). The operational parameters studied were the gas injection rate, the type of gas injection, the location of the injector and production well. We also studied the presence of water drive in the process. The results showed that the maximum vertical spacing between the two wells, caused the maximum recovery of oil in GAGD. Also, it was found that the largest flow injection, it obtained the largest recovery factors. This parameter controls the speed of the front of the gas injected and determined if the gravitational force dominates or not the process in the recovery of oil. Natural gas had better performance than CO2 and that the presence of aquifer in the reservoir was less influential in the process. In economic analysis found that by injecting natural gas is obtained more economically beneficial than CO2