935 resultados para super-dense computation
Resumo:
We show the existence of free dense subgroups, generated by two elements, in the holomorphic shear and overshear group of complex-Euclidean space and extend this result to the group of holomorphic automorphisms of Stein manifolds with the density property, provided there exists a generalized translation. The conjugation operator associated to this generalized translation is hypercyclic on the topological space of holomorphic automorphisms.
Resumo:
We describe a system designed to re-bunch positron pulses delivered by an accumulator supplied by a positron source and a Surko-trap. Positron pulses from the accumulator are magnetically guided in a 0.085 T field and are injected into a region free of magnetic fields through a μ -metal field terminator. Here positrons are temporally compressed, electrostatically guided and accelerated towards a porous silicon target for the production and emission of positronium into vacuum. Positrons are focused in a spot of less than 4 mm FWTM in bunches of ∼8 ns FWHM. Emission of positronium into the vacuum is shown by single shot positron annihilation lifetime spectroscopy.
Resumo:
The literature on the use of free trade agreements (FTAs) has recently been growing because it is becoming more important to encourage the use of current FTAs than to increase the number of FTAs. In this paper, we discuss some practical issues in the computation of FTA utilization rates, which provide a useful measure to discover how much FTA schemes are used in trade. For example, compared with the use of customs data on FTA utilization in imports, when using certificates of origin data on FTA utilization in exports, there are several points about which we should be careful. Our practical guidance on the computation of FTA utilization rates will be helpful when computing such rates and in examining the determinants of those rates empirically.
Resumo:
Nowadays computing platforms consist of a very large number of components that require to be supplied with diferent voltage levels and power requirements. Even a very small platform, like a handheld computer, may contain more than twenty diferent loads and voltage regulators. The power delivery designers of these systems are required to provide, in a very short time, the right power architecture that optimizes the performance, meets electrical specifications plus cost and size targets. The appropriate selection of the architecture and converters directly defines the performance of a given solution. Therefore, the designer needs to be able to evaluate a significant number of options in order to know with good certainty whether the selected solutions meet the size, energy eficiency and cost targets. The design dificulties of selecting the right solution arise due to the wide range of power conversion products provided by diferent manufacturers. These products range from discrete components (to build converters) to complete power conversion modules that employ diferent manufacturing technologies. Consequently, in most cases it is not possible to analyze all the alternatives (combinations of power architectures and converters) that can be built. The designer has to select a limited number of converters in order to simplify the analysis. In this thesis, in order to overcome the mentioned dificulties, a new design methodology for power supply systems is proposed. This methodology integrates evolutionary computation techniques in order to make possible analyzing a large number of possibilities. This exhaustive analysis helps the designer to quickly define a set of feasible solutions and select the best trade-off in performance according to each application. The proposed approach consists of two key steps, one for the automatic generation of architectures and other for the optimized selection of components. In this thesis are detailed the implementation of these two steps. The usefulness of the methodology is corroborated by contrasting the results using real problems and experiments designed to test the limits of the algorithms.
Resumo:
Purpose Sustainable mobility urban policies intend reducing car use and increasing walking, cycling and public transport. However, this transfer from private car to these more sustainable modes is only a real alternative where distances are small and the public transport supply competitive enough. This paper proposes a methodology to calculate the number of trips that can be transferred from private car to other modes in city centres. Method The method starts analyzing which kind of trips cannot change its mode (purposes, conditions, safety , etc.), and then setting a process to determine under which conditions trips made by car between given O-D pairs can be transferable. Then, the application of demand models allow to determine which trips fulfil the transferability conditions. The process test the possibility of transfer in a sequential way: firs to walking, then cycling and finally to public transport. Results The methodology is tested through its application to the city of Madrid (Spain), with the result of only some 18% of the trips currently made by car could be made by other modes, under the same conditions of trip time, and without affecting their characteristics. Out of these trips, 75% could be made by public transport, 15% cycling and 10% on foot. The possible mode to be transferred depends on the location: city centre areas are more favourable for walking and cycling while city skirts could attract more PT trips. Conclusions The proposed method has demonstrated its validity to determine the potential of transferring trips out of cars to more sustainable modes. Al the same time it is clear that, even in areas with favourable conditions for walking, cycling and PT trips, the potential of transfer is limited because cars fulfil more properly special requirements of some trips and tours.