Historic evolution and urban planning typology of Olympic Village

Article providing a broad historical overview of the role and typology of Olympic villages along the history of the Modern Olympic Games. This article was published in the book entitled ‘Olympic Villages: a hundred years of urban planning and shared experiences’ compiling the papers given at the 1997 International Symposium on International Chair in Olympism (IOC-UAB).

EU cohesion aid to Spain: a data set. Part I: 2000-06 planning period

In this paper we construct a data set on EU cohesion aid to Spain during the planning period 2000-06. The data are disaggregated by region, year and function and attempt to approximate the timing of actual executed expenditure on assisted projects.

El impacto de las aplicaciones intensivas de E/S en la planificación de trabajos en clusters no-dedicados

Con la mayor capacidad de los nodos de procesamiento en relación a la potencia de cómputo, cada vez más aplicaciones intensivas de datos como las aplicaciones de la bioinformática, se llevarán a ejecutar en clusters no dedicados. Los clusters no dedicados se caracterizan por su capacidad de combinar la ejecución de aplicaciones de usuarios locales con aplicaciones, científicas o comerciales, ejecutadas en paralelo. Saber qué efecto las aplicaciones con acceso intensivo a dados producen respecto a la mezcla de otro tipo (batch, interativa, SRT, etc) en los entornos no-dedicados permite el desarrollo de políticas de planificación más eficientes. Algunas de las aplicaciones intensivas de E/S se basan en el paradigma MapReduce donde los entornos que las utilizan, como Hadoop, se ocupan de la localidad de los datos, balanceo de carga de forma automática y trabajan con sistemas de archivos distribuidos. El rendimiento de Hadoop se puede mejorar sin aumentar los costos de hardware, al sintonizar varios parámetros de configuración claves para las especificaciones del cluster, para el tamaño de los datos de entrada y para el procesamiento complejo. La sincronización de estos parámetros de sincronización puede ser demasiado compleja para el usuario y/o administrador pero procura garantizar prestaciones más adecuadas. Este trabajo propone la evaluación del impacto de las aplicaciones intensivas de E/S en la planificación de trabajos en clusters no-dedicados bajo los paradigmas MPI y Mapreduce.

Safety in vicinity of industrials plants: risk assessment and land use planning

The aim of this book is to survey on different Land Use Planning and safety approaches in vicinity of industrial plants. As this research is associated with three broad fields of Land Use Planning, safety and security, the set principle is to avoid unnecessary and over detailed information, but including the useful ones to provide a comprehensive resource which can be applicable for several purposes. Besides, the proposed method, which is explained in Chapter 7, can initiate a new field for future of Land Use Planning in vicinity of industrial plants.

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.

EU cohesion aid to Spain: a data set. Part II: 1994-99 planning period

In this paper we construct a data set on EU cohesion aid to Spain during the planning period 1994-99. The data are disaggregated by region, year and function and attempt to approximate the timing of actual executed expenditure on assisted projects.

Deployment of self-expandable stents in aneurysmatic cerebral vessels: comparison of different computational approaches for interventional planning

In the last few years, there has been a growing focus on faster computational methods to support clinicians in planning stenting procedures. This study investigates the possibility of introducing computational approximations in modelling stent deployment in aneurysmatic cerebral vessels to achieve simulations compatible with the constraints of real clinical workflows. The release of a self-expandable stent in a simplified aneurysmatic vessel was modelled in four different initial positions. Six progressively simplified modelling approaches (based on Finite Element method and Fast Virtual Stenting – FVS) have been used. Comparing accuracy of the results, the final configuration of the stent is more affected by neglecting mechanical properties of materials (FVS) than by adopting 1D instead of 3D stent models. Nevertheless, the differencesshowed are acceptable compared to those achieved by considering different stent initial positions. Regarding computationalcosts, simulations involving 1D stent features are the only ones feasible in clinical context.

A recoverable production planning model

Aware of the importance of developing new alternatives to improve the performance of the companies, our purpose in this paper is to develop a medium term production planning model that deals with the concepts of Partnership and Reverse Logistics. Our model takes advantage of the synergies of integration, developing a model for global production planning that generates the optimal production and purchasing schedule for all the companies integrating a logistic chain. In a second part of the paper we incorporate products returns to the first model proposed, and analyze the implications they have over this model. We use some examples with different configurations of supply chains varying the number of production plants, distribution centers and recovery plants. To solve the model we have combined optimization and simulation procedures.

A diagram of public spaces within urban landscape as a strategy for sustainable urban planning in Chinese cities

Destruction of historical urban fabric in many Chinese cities and towns, without the possibility of its recovery as an urban asset, leads us to consider alternative strategies and criteria for formulating new urban projects, using creative urban planning instruments and strategies to provide a sense of place and identity to the urban landscape. The challenge is to set up an urban structure that constitutes a spatial reference system, a structure consisting of a set of urban landmarks that construct a system of related public spaces, endowed with collective significance and identity. Such a network could include a wide variety of urban typologies and natural elements. An important result of this strategy would be the recovery of the social and cultural values attached to the natural landscape in Chinese civilization. Hangzhou city will be analyzed as a case study

Access by Capacity and Peak-Load Pricing

Several European telecommunications regulatory agencies have recently introduced a fixed capacity charge (flat rate) to regulate access to the incumbent's network. The purpose of this paper is to show that the optimal capacity charge and the optimal access-minute charge analysed by Armstrong, Doyle, and Vickers (1996) have a similar structure and imply the same payment for the entrant. I extend the analysis tothe case where there is a competitor with market power. In this case, the optimalcapacity charge should be modified to avoid that the entrant cream-skims the market,fixing a longer or a shorter peak period than the optimal. Finally, I consider a multiproduct setting, where the effect of the product differentiation is exacerbated.

Intestinal and hepatic nitrogen balance in the rat after the administration of an oral protein load

The fate of a small oral dose of protein given to overnight-starved rats was studied. After 3 h, 62 per cent of the protein amino acids had been absorbed. Most of the absorbed N went into the bloodstream through the portal in the form of amino acids, but urea and ammonia were also present. About one-quarter of all absorbed N was carried as lymph amino acids. The liver was able to take all portal free ammonia and a large proportion of portal amino acids, releasing urea. The hepatic N balance was negative, indicating active proteolysis and net loss of liver protein.

Access by Capacity and Peak-Load Pricing

Several European telecommunications regulatory agencies have recently introduced a fixed capacity charge (flat rate) to regulate access to the incumbent's network. The purpose of this paper is to show that the optimal capacity charge and the optimal access-minute charge analysed by Armstrong, Doyle, and Vickers (1996) have a similar structure and imply the same payment for the entrant. I extend the analysis tothe case where there is a competitor with market power. In this case, the optimalcapacity charge should be modified to avoid that the entrant cream-skims the market,fixing a longer or a shorter peak period than the optimal. Finally, I consider a multiproduct setting, where the effect of the product differentiation is exacerbated.

Width and serialization of classical planning problems

We introduce a width parameter that bounds the complexity of classical planning problems and domains, along with a simple but effective blind-search procedure that runs in time that is exponential in the problem width. We show that many benchmark domains have a bounded and small width provided thatgoals are restricted to single atoms, and hence that such problems are provably solvable in low polynomial time. We then focus on the practical value of these ideas over the existing benchmarks which feature conjunctive goals. We show that the blind-search procedure can be used for both serializing the goal into subgoals and for solving the resulting problems, resulting in a ‘blind’ planner that competes well with a best-first search planner guided by state-of-the-art heuristics. In addition, ideas like helpful actions and landmarks can be integrated as well, producing a planner with state-of-the-art performance.

Planning under partial observability by classical replanning: theory and experiments

Planning with partial observability can be formulated as a non-deterministic search problem in belief space. The problem is harder than classical planning as keeping track of beliefs is harder than keeping track of states, and searching for action policies is harder than searching for action sequences. In this work, we develop a framework for partial observability that avoids these limitations and leads to a planner that scales up to larger problems. For this, the class of problems is restricted to those in which 1) the non-unary clauses representing the uncertainty about the initial situation are nvariant, and 2) variables that are hidden in the initial situation do not appear in the body of conditional effects, which are all assumed to be deterministic. We show that such problems can be translated in linear time into equivalent fully observable non-deterministic planning problems, and that an slight extension of this translation renders the problem solvable by means of classical planners. The whole approach is sound and complete provided that in addition, the state-space is connected. Experiments are also reported.