3 resultados para dynamic storage allocation
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
By considering a network of dissipative quantum harmonic oscillators, we deduce and analyse the optimum topologies which are able to store quantum superposition states, protecting them from decoherence, for the longest period of time. The storage is made dynamically, in that the states to be protected evolve through the network before being retrieved back in the oscillator where they were prepared. The decoherence time during the dynamic storage process is computed and we demonstrate that it is proportional to the number of oscillators in the network for a particular regime of parameters.
Resumo:
The aim of this work was to evaluate the effect of the storage time on the thermal properties of triethylene glycol dimethacrylate/2,2-bis[4-(2-hydroxy-3-methacryloxy-prop-1-oxy)-phenyl]propane bisphenyl-alpha-glycidyl ether dimethacrylate (TB) copolymers used in formulations of dental resins after photopolymerization. The TB copolymers were prepared by photopolymerization with an Ultrablue IS light-emitting diode, stored in the dark for 160 days at 37 degrees C, and characterized with differential scanning calorimetry (DSC), dynamic mechanical analysis (DMA), and Fourier transform infrared spectroscopy with attenuated total reflection. DSC curves indicated the presence of an exothermic peak, confirming that the reaction was not completed during the photopolymerization process. This exothermic peak became smaller as a function of the storage time and was shifted at higher temperatures. In DMA studies, a plot of the loss tangent versus the temperature initially showed the presence of two well-defined peaks. The presence of both peaks confirmed the presence of residual monomers that were not converted during the photopolymerization process. (C) 2009 Wiley Periodicals, Inc. J Appl Polym Sci 112: 679-684, 2009
Resumo:
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.