Condiciones para una arquitectura radical

La investigación Condiciones para una arquitectura radical se ha desarrollado en el marco de la beca FI 2009-12; y también incluye una beca de movilidad BE-DGR 2009 por un período de seis meses de 2010 en Princeton University School of Architecture. Condiciones para una arquitectura radical tiene un objetivo general: trabajar las relaciones entre límite, experiencia y comunidad a partir de dos pilares: arte y tecnología. Son tres familias de conceptos y sus articulaciones complejas en el espacio común: para definir en última instancia, otros procesos posibles de gestión en la ciudad. La lucha ideológica está en pensar cual debería ser el futuro de las ciudades. El objetivo concreto de la tesis es la búsqueda de herramientas para abrir nuevos espacios en la ciudad donde materializar un cambio social y urbano. Para entender esta aproximación la investigación indaga en los momentos de acercamiento y simbiosis de la arquitectura a las tesis del arte y la tecnología: una mirada atenta a las condiciones de contexto. Se explora el cruce de algunas ideas emancipadoras que se formularon en diferentes momentos de la cultura - desde las vanguardias históricas hasta ahora- en los que se intuyó la importancia del sistema abierto -el paso del objeto al proceso- y su trasposición en arquitectura: una arquitectura y un urbanismo open source; son episodios en los que ha existido un cuestionamiento de las fronteras disciplinares y un interés por la apropiación convivencial de lo público. Algunas de aquellas ideas pueden repetirse en el contexto activo de unas nuevas condiciones.

Habitat et pratiques domestiques des Ve-IVe s. a.v. J.-C. dans la ville de Lattes

Les recherches menées ces dernières années sur le site de Lattes ont livré une documentation abondante sur l’architecture et l’organisation de l’espace domestique du ve s. et surtout du ive s. av. J.-C. C’est en effet durant cette période qu’a eu lieu la mise en place de la trame urbaine de la ville qui, dans ses grandes lignes, perdurera jusqu’à la fin de l’occupation protohistorique du site ; de même, c’est à ce moment qu’apparaissent des techniques de construction dont certaines sont exclusives de ces périodes, mais qui pour d’autres resteront en vigueur jusqu’à la Protohistoire récente. Cet article présente une synthèse de nos connaissances sur cette phase ancienne, en insistant sur les permanences, les modifications ou les évolutions dans l’architecture, la typologie des maisons et les pratiques domestiques au cours de ces étapes et par rapport aux étapes postérieures.

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

VLSI architecture for an Underwater Robot Vision System

It is well known that image processing requires a huge amount of computation, mainly at low level processing where the algorithms are dealing with a great number of data-pixel. One of the solutions to estimate motions involves detection of the correspondences between two images. For normalised correlation criteria, previous experiments shown that the result is not altered in presence of nonuniform illumination. Usually, hardware for motion estimation has been limited to simple correlation criteria. The main goal of this paper is to propose a VLSI architecture for motion estimation using a matching criteria more complex than Sum of Absolute Differences (SAD) criteria. Today hardware devices provide many facilities for the integration of more and more complex designs as well as the possibility to easily communicate with general purpose processors

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Transmission delays in residual computation

The design of control, estimation or diagnosis algorithms most often assumes that all available process variables represent the system state at the same instant of time. However, this is never true in current network systems, because of the unknown deterministic or stochastic transmission delays introduced by the communication network. During the diagnosing stage, this will often generate false alarms. Under nominal operation, the different transmission delays associated with the variables that appear in the computation form produce discrepancies of the residuals from zero. A technique aiming at the minimisation of the resulting false alarms rate, that is based on the explicit modelling of communication delays and on their best-case estimation is proposed

Towards a user-friendly webservice architecture for statistical machine translation in the PANACEA project

This paper presents a webservice architecture for Statistical Machine Translation aimed at non-technical users. A workfloweditor allows a user to combine different webservices using a graphical user interface. In the current state of this project,the webservices have been implemented for a range of sentential and sub-sententialaligners. The advantage of a common interface and a common data format allows the user to build workflows exchanging different aligners.

Computation of multiple correspondence analysis, with code in R

The generalization of simple correspondence analysis, for two categorical variables, to multiple correspondence analysis where they may be three or more variables, is not straighforward, both from a mathematical and computational point of view. In this paper we detail the exact computational steps involved in performing a multiple correspondence analysis, including the special aspects of adjusting the principal inertias to correct the percentages of inertia, supplementary points and subset analysis. Furthermore, we give the algorithm for joint correspondence analysis where the cross-tabulations of all unique pairs of variables are analysed jointly. The code in the R language for every step of the computations is given, as well as the results of each computation.

Analog circuit for real-time computation of respiratory mechanical impedance in sleep studies

The aim of this work was to develop a low-cost circuit for real-time analog computation of the respiratory mechanical impedance in sleep studies. The practical performance of the circuit was tested in six patients with obstructive sleep apnea. The impedance signal provided by the analog circuit was compared with the impedance calculated simultaneously with a conventional computerized system. We concluded that the low-cost analog circuit developed could be a useful tool for facilitating the real-time assessment of airway obstruction in routine sleep studies.

Analog circuit for real-time computation of respiratory mechanical impedance in sleep studies

The aim of this work was to develop a low-cost circuit for real-time analog computation of the respiratory mechanical impedance in sleep studies. The practical performance of the circuit was tested in six patients with obstructive sleep apnea. The impedance signal provided by the analog circuit was compared with the impedance calculated simultaneously with a conventional computerized system. We concluded that the low-cost analog circuit developed could be a useful tool for facilitating the real-time assessment of airway obstruction in routine sleep studies.

Final architecture diploma projects in the analysis of the UPC buildings energy performance

A partir de maig de 2003, per iniciativa del Vicerectorat adjunt d’Edificacions de la UPC, el Centre Interdisciplinari de Tecnologia, Innovació i Educació per a la Sostenibilitat (CITIES) treballa en l’elaboració i la implantació del Pla d’Eficiència en el Consum de Recursos (PECR), amb l’objectiu d’establir polítiques i definir línees d’actuació per a l’estalvi i l’eficiència en el consum dels recursos energètics i d’ aigua en els edificis de la UPC.El PECR contempla, en una de les primeres fases, la realització d’avaluacions energètiques en les edificacions de la UPC per valorar l’estat actual dels edificis i poder establir uns indicadors del seu comportament energètic a partir dels quals establir els objectius d’estalvi i d’eficiència. Per fer aquestes avaluacions, es va crear una línea de projectes finals de carrera (PFC) per a estudiants de l’Escola Politècnica Superior de l’Edificació de Barcelona (EPSEB), sota la coordinació de professors tutors de diferents departaments y amb la col•laboració indispensable de totes les unitats de recolzament de la UPC.Aquesta publicació és la ponència presentada al IV Congrès "Sustainable City", a Tallinn, en el que es va presentar aquest projecte com a una eina de treball amb l'objectiu de reduir l'impacte ambiental dels edificis universitaris en les ciutats.

Domestic architecture and social differences in North-Eastern Iberia during the iron age (c.525-200 BC)

This paper is concerned with the organization of societies in north-eastern Iberia (present-day Catalonia) during the Iron Age, using data provided by domestic architecture and settlement organization. I offer an analysis of the social differences detected in the dwellings based on a sample of houses excavated at different types of settlement. Although many Iberian houses had simple layouts and small surface areas, some larger dwellings at the main sites are distinguished by the shape of their ground plans, their surface areas, architectural features, and central locations; these houses are believed to be the residences of the Iberian elite. Such dwellings are not found at all sites and the data suggest that there was a relationship between the category of the settlement (or its function) and the types of dwelling in it.

A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: explorations and mechanisms for the breakdown of hyperbolicity

In two previous papers [J. Differential Equations, 228 (2006), pp. 530 579; Discrete Contin. Dyn. Syst. Ser. B, 6 (2006), pp. 1261 1300] we have developed fast algorithms for the computations of invariant tori in quasi‐periodic systems and developed theorems that assess their accuracy. In this paper, we study the results of implementing these algorithms and study their performance in actual implementations. More importantly, we note that, due to the speed of the algorithms and the theoretical developments about their reliability, we can compute with confidence invariant objects close to the breakdown of their hyperbolicity properties. This allows us to identify a mechanism of loss of hyperbolicity and measure some of its quantitative regularities. We find that some systems lose hyperbolicity because the stable and unstable bundles approach each other but the Lyapunov multipliers remain away from 1. We find empirically that, close to the breakdown, the distances between the invariant bundles and the Lyapunov multipliers which are natural measures of hyperbolicity depend on the parameters, with power laws with universal exponents. We also observe that, even if the rigorous justifications in [J. Differential Equations, 228 (2006), pp. 530-579] are developed only for hyperbolic tori, the algorithms work also for elliptic tori in Hamiltonian systems. We can continue these tori and also compute some bifurcations at resonance which may lead to the existence of hyperbolic tori with nonorientable bundles. We compute manifolds tangent to nonorientable bundles.