2,304 research outputs found
Gramática de grafos para comportamiento complejo
Background activity is the biological phenomenon that prevents the brain of an alive
organism from reaching a state of complete inactivity. The neuroscientist community
claims that it is related to cognitive functions such as memory and the exploration of
previously sensed experiences.
Artificial neural networks were originally developed as a nervous system model. In
Computer Science, they have been applied in function approximation and pattern recognition
problems. However, dynamics of the typically used paradigms are not appropriate
for the replication of processes such as background activity. When the goal is to
reproduce the behavior of real neural networks, the most adequate model is the Spiking
Neural Network (SNN), whose elements closely resemble the biological neurons.
Our objective is to develop an algorithm that generates SNN topologies able to maintain
background activity. The topology of an SNN is described as a graph, thus, the first
contribution of this project is a grammar formalism to generate them. That formalism is
applied by an automated search process in order to find SNNs that are able to maintain
background activity. This search is done by an evolutionary algorithm, which develops
a population of SNNs and applies successive transformations to them, gradually increasing
their ability to fulfill the proposed objective.
Considering that the different SNNs of the population are independent of each other,
the time required to execute the algorithm can be noticeably reduced when using parallel
computation. In order to obtain the results discussed in this document, the program
was run over 40 cores of the local supercomputing node, which is part of the Spanish
Supercomputing Network. The resulting execution time is decreased in an order of
magnitude compared to the one that would be required in a quad-core personal computer.
This was crucial for the development of the project, as it considerably improved
our ability to manage the process of obtaining and studying the results
Unbounded loops in quantum programs: categories and weak while loops
Control flow of quantum programs is often divided into two different classes:
classical and quantum. Quantum programs with classical control flow have their
conditional branching determined by the classical outcome of measurements, and
these collapse quantum data. Conversely, quantum control flow is coherent, i.e.
it does not perturb quantum data; quantum walk-based algorithms are practical
examples where coherent quantum feedback plays a major role. This dissertation
has two main contributions: (i) a categorical study of coherent quantum
iteration and (ii) the introduction of weak while loops.
(i) The objective is to endow categories of quantum processes with a traced
monoidal structure capable of modelling iterative quantum loops. To this end,
the trace of a morphism is calculated via the execution formula, which adds up
the contribution of all possible paths of the control flow. Haghverdi's unique
decomposition categories are generalised to admit additive inverses and
equipped with convergence criteria using basic topology. In this setting, it is
possible to prove the validity of the execution formula as a categorical trace
on certain categories of quantum processes.
(ii) A weak while loop is a classical control flow primitive that offers a
trade-off between the collapse caused on each iteration and the amount of
information gained. The trade-off may be adjusted by tuning a parameter and, in
certain situations, it is possible to set its value so that we may control the
algorithm without sacrificing its quantum speed-up. As an example, it is shown
that Grover's search problem can be implemented using a weak while loop,
maintaining the same time complexity as the standard Grover's algorithm (as
previously shown by Mizel).Comment: PhD Thesi
Comportamiento y variación del confort térmico de la vivienda de interés social en clima cálido húmedo, a partir del proceso de transformación y adecuación de la morfología y envolvente de la edificación. (Estudio de caso: proyecto de vivienda de interés social Villa María etapa I)
Trabajo de InvestigaciónA partir de la necesidad de promover el desarrollo de proyectos sostenibles con una mayor capacidad de adaptación a los efectos del cambio climático, se analiza el comportamiento térmico de las viviendas de interés social del municipio de Guamal Meta, con el propósito de garantizar una mayor eficiencia térmica de las edificaciones mediante la implmentación de estrategias pasivas.INTRODUCCIÓN
1. DESCRIPCIÓN DEL PROBLEMA
2. ESTADO DEL ARTE
3. JUSTIFICACIÓN
4. OBJETIVOS
5. HIPÓTESIS DE INVESTIGACIÓN
6. MARCO TEÓRICO
7. MARCO CONCEPTUAL 8. METODOLOGÍA
9. GENERALIDADES Y ASPECTOS AMBIENTALES
10. DESCRIPCIÓN CLIMÁTICA
11. LOCALIZACIÓN DEL PROYECTO Y ANÁLISIS DEL SECTOR
12. PARÁMETROS DE DESARROLLO DEL PROYECTO
13. FASE 1 – CARACTERIZACIÓN Y ANÁLISIS DEL PROYECTO
14. ANÁLISIS DEL VOLUMEN ARQUITECTÓNICO (MODELO DE LINEA BASE)
15. FASE 2- INTERVENCIONES Y MODIFICACIONES REALIZADAS A LA
VIVIENDA.
16. FASE 3 – DESARROLLO DE LA PROPUESTA DE VIVIENDA
17. MATERIALIDAD DE LA ENVOLVENTE
18. FASE 4 – DESARROLLO E IMPLEMENTACIÓN DE ESTRATEGIAS PASIVAS
19. RESULTADOS TÉRMICOS DE LA PROPUESTA
20. PRESUPUESTO DE OBRA
21. RESUMEN DEL PROCESO DE DISEÑO
22. SOCIALIZACIÓN DE RESULTADOS CON LA COMUNIDAD
23. CONCLUSIONES
BIBLIOGRAFÍA
ANEXOSMaestríaMagíster en Diseño Sostenibl
Weakly measured while loops: peeking at quantum states
While loops test a predicate on every iteration. Such measurement collapses
quantum superposition, affecting the evolution of the algorithm. We define a
while loop primitive using weak measurements, offering a trade-off between the
collapse caused and the amount of information gained per iteration. This
trade-off is adjusted with a parameter set by the programmer. We give
sufficient conditions for the collapse not to affect the evolution in a
detrimental way. As an example, we implement Grover's algorithm with a while
loop, maintaining the quadratic quantum speed-up.Comment: 15 pages (+refs & one appendix), 3 figure
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
We study a variant of the subgraph isomorphism problem that is of high
interest to the quantum computing community. Our results give an algorithm to
perform pattern matching in quantum circuits for many patterns simultaneously,
independently of the number of patterns. After a pre-computation step in which
the patterns are compiled into a decision tree, the running time is linear in
the size of the input quantum circuit.
More generally, we consider connected port graphs, in which every edge
incident to has a label unique in . Jiang and Bunke showed that
the subgraph isomorphism problem for such graphs can be solved
in time . We show that if in addition the graphs are
directed acyclic, then the subgraph isomorphism problem can be solved for an
unbounded number of patterns simultaneously. We enumerate all pattern
matches in time , where is the number of
vertices of the largest pattern. In the case of quantum circuits, we can
express the bound obtained in terms of the maximum number of qubits and
depth of the patterns :
Rehabilitating, repairing and restoring against demolishing, tearing down and destroying: the recovery of the military fort for the Santa Pola town museum
This communication develops the process of interventions of the Renaissance fortress of a new plant built in 1554–57 in Santa Pola. It is one of the earliest examples built with reference to military architecture theoretical treaties (XV–XVI) and best preserved. The study runs its own story from its initial military use, through the use of civil equipment until the final cultural and Museum Center. First, the project of Italian origin is examined and its use as barracks for troops for a duration of three centuries (1557–1850), pointing out the architectural constants of war machinery in a defense position and its origin as a rainwater collector and cistern: a perfect square with two bastions in which a plan of the uprising is preserved (1778). Secondly, we study the changes in the mentioned architecture throughout a century and a half (1850–1990) after its change of ownership (from the state to the municipality), and as a result of the new use as a city hall and public endowment: a market and health and leisure centre, which meant the demolition of defensive elements and the opening up to the outside of the inner parade ground. And thirdly, the new transfer of the municipal offices brings in the beginning of a project of transformations (1990–2015) that retrieves the demolished elements at the same time as it assigns the entire fort for a cultural centre: exhibition, research and history museum, promoting the identity between the citizens and the building which stands in the foundations of their city. The conclusions take us through an interesting route that goes from the approach of defensive tactics, its use as administrative headquarters to the current cultural policy of preservation. In addition, all the known plans of the fort are recovered (of military, civil and cultural use), some unpublished, as well as the project of the North wing that has guided the last operation and which has been set as a pattern of reference
Unbounded loops in quantum programs: categories and weak while loops
Control flow of quantum programs is often divided into two different classes: classical and quantum. Quantum programs with classical control flow have their conditional branching determined by the classical outcome of measurements, and these collapse quantum data. Conversely, quantum control flow is coherent, i.e. it does not perturb quantum data; quantum walk-based algorithms are practical examples where coherent quantum feedback plays a major role. This dissertation has two main contributions: (i) a categorical study of coherent quantum iteration and (ii) the introduction of weak while loops.
(i) The objective is to endow categories of quantum processes with a traced monoidal structure capable of modelling iterative quantum loops. To this end, the trace of a morphism is calculated via the execution formula, which adds up the contribution of all possible paths of the control flow. Haghverdi's unique decomposition categories are generalised to admit additive inverses and equipped with convergence criteria using basic topology. In this setting, it is possible to prove the validity of the execution formula as a categorical trace on certain categories of quantum processes. Among these there are categories of quantum processes over finite dimensional Hilbert spaces (as previously shown by Bartha), but also certain categories of quantum processes over infinite dimensional Hilbert spaces, such as a category of time-shift invariant quantum processes over discrete time.
(ii) A weak while loop is a classical control flow primitive that offers a trade-off between the collapse caused on each iteration and the amount of information gained. The trade-off may be adjusted by tuning a parameter and, in certain situations, it is possible to set its value so that we may control the algorithm without sacrificing its quantum speed-up. As an example, it is shown that Grover's search problem can be implemented using a weak while loop, maintaining the same time complexity as the standard Grover's algorithm (as previously shown by Mizel). In a more general setting, sufficient conditions are provided that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for
Recuperación urbana del sector industrial de Puente Aranda, a través de un sistema habitacional integral eco-sostenible y bio-productivo
La transformación urbana y funcional que, de manera imprevista y sin adecuación, se ha presentado en el tradicional sector industrial de la localidad de Puente Aranda, ha estancado gradualmente el desarrollo urbano en este sector, estratégico en la zona centro occidental de la ciudad. Allí, se han implantado, a lo largo de las últimas décadas, nuevos usos, diversos, en estructuras que la industria abandonó, en búsqueda de mejores sectores, en zonas periurbanas. Sin embargo, al no adaptarse la infraestructura urbana para soportar las particularidades de estas nuevas dinámicas, se producen procesos de obstrucción funcional, desplazamiento de la población residente, abandono de edificaciones; dando como resultado un deterioro y subutilización de estas estructuras urbanas, que a su vez intensifica el desequilibrio medioambiental, que el desarrollo industrial previo ha generado.
Se propone una intervención de recuperación urbana, social y ambiental del sector industrial de la localidad de Puente Aranda, mediante la reconfiguración urbana, en cuanto a los usos del suelo, el espacio público y a los servicios urbanos, que a su vez apunte hacia la regeneración de la estructura ecológica principal, mediante la recuperación integral de los elementos ambientales y de espacio público. Como ejemplo de desarrollo, se genera una propuesta habitacional, que posee estas mismas estrategias, para así contribuir a la solución de la situación de dificultad del sector y mejorar la calidad de vida de los habitantes.The urban and functional transformation that, unforeseen and without adaptation, has been presented in the traditional industrial sector of the district of Puente Aranda, has gradually stagnated the urban development in this sector, strategic in the western central area of the city. There, over the last decades, new, diverse uses have been implemented in structures that the industry abandoned, in search of better sectors, in peri-urban areas. However, as the urban infrastructure does not adapt to support the particularities of these new dynamics, there are processes of functional obstruction, displacement of the resident population, abandonment of buildings; resulting in a deterioration and underutilization of these urban structures, which in turn intensifies the environmental imbalance, which previous industrial development has generated.
It is proposed an intervention of urban, social and environmental recovery of the industrial sector of the town of Puente Aranda, through urban reconfiguration, in terms of land uses, public space and urban services, which in turn towards regeneration of the main ecological structure, through the integral recovery of environmental elements and public space. As an example of development, a housing proposal is generated, which has these same strategies, in order to contribute to the solution of the difficult situation of the sector and improve the quality of life of the inhabitants.Arquitecto (a)Pregrad
- …