Search results for " Architecture"
showing 10 items of 2595 documents
Tommaso Maria Napoli Utriusque Architecturae Compendium Roma 1688 Breve trattato sulle fabbriche civili e militari e la conservazione delle architett…
2013
Il volume Tommaso Maria Napoli Utriusque Architecturae Compendium Roma 1688 Breve trattato sulle fabbriche civili e militari e la conservazione delle architetture del frate domenicano Tommaso Maria Napoli, vuole contribuire ad accrescere le nostre conoscenze sui principi che dovevano sottendere alla realizzazione dell’architettura civile e militare del periodo barocco e tardo barocco, così come espressi nel breve trattato scritto dal frate architetto, nato a Palermo, Tommaso Maria Napoli (1659-1725), e pubblicato a Roma alla fine del Seicento. Alla traduzione dal latino del trattato, redatta da esperti (Fabio Zarbo e Pietro Zarbo), è inclusa un’interessante ricerca, redatta congiuntamente c…
Theatrum vel Monumentum: The Permanence of Ephemeral in the Work of Aldo Rossi
2020
At the base of the poetics of Aldo Rossi those who Manfredo Tafuri called the "unspeakable extremes", life and death, in the architectural form of the theatre and the monument are counterposed. Although Rossi has often joined them, for a long time the criticism of his work has been disinterested taking the apparent aporia between ephemeral and definitive, only with the purpose to recompose them in unities ending up in simplifying a complex reasoning that had mainly to do with a rituality of the architectural element and building contrasting sides between those who believe that the primacy of Rossi’s architecture is held by the monument and who by the theatre. This way, far from the theoreti…
On the impact of forgetting on learning machines
1995
People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…
Boosting Textual Compression in Optimal Linear Time
2005
We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performance guarantee. It displays the following remarkable properties: (a) it can turn any memoryless compressor into a compression algorithm that uses the “best possible” contexts; (b) it is very simple and optimal in terms of time; and (c) it admits a decompression algorithm again optimal in time. To the best of our knowledge, this is the first boosting technique displaying these properties.Technically, our boosting technique builds upon three main ingredients: the Burrows--Wheeler Transform, the Suffix Tree d…
Work Partitioning on Parallel and Distributed Agent-Based Simulation
2017
Work partitioning is a key challenge with ap- plications in many scientific and technological fields. The problem is very well studied with a rich literature on both distributed and parallel computing architectures. In this paper we deal with the work partitioning problem for parallel and distributed agent-based simulations which aims at (i) balancing the overall load distribution, (ii) minimizing, at the same time, the communication overhead due to agents' inter-dependencies. We introduce a classification taxonomy of work partitioning strategies and present a space-based work partitioning ap- proach, based on a Quad-tree data structure, which enables to: identify a good space partitioning …
Global RDF Vector Space Embeddings
2017
Vector space embeddings have been shown to perform well when using RDF data in data mining and machine learning tasks. Existing approaches, such as RDF2Vec, use local information, i.e., they rely on local sequences generated for nodes in the RDF graph. For word embeddings, global techniques, such as GloVe, have been proposed as an alternative. In this paper, we show how the idea of global embeddings can be transferred to RDF embeddings, and show that the results are competitive with traditional local techniques like RDF2Vec.
Supervised learning of time-independent Hamiltonians for gate design
2018
We present a general framework to tackle the problem of finding time-independent dynamics generating target unitary evolutions. We show that this problem is equivalently stated as a set of conditions over the spectrum of the time-independent gate generator, thus transforming the task to an inverse eigenvalue problem. We illustrate our methodology by identifying suitable time-independent generators implementing Toffoli and Fredkin gates without the need for ancillae or effective evolutions. We show how the same conditions can be used to solve the problem numerically, via supervised learning techniques. In turn, this allows us to solve problems that are not amenable, in general, to direct ana…
On the Influence of Technology on Learning Processes
2014
Probabilistic computations and frequency computations were invented for the same purpose, namely, to study possible advantages of technology involving random choices. Recently several authors have discovered close relationships of these generalizations of deterministic computations to computations taking advice. Various forms of computation taking advice were studied by Karp and Lipton [1], Damm and Holzer [2], and Freivalds [3]. In the present paper, we apply the nonconstructive, probabilistic, and frequency methods to an inductive inference paradigm originally due to Gold [4] and investigate their impact on the resulting learning models. Several trade-offs with respect to the resulting l…
The Hierarchical Continuous Pursuit Learning Automation for Large Numbers of Actions
2018
Part 10: Learning - Intelligence; International audience; Although the field of Learning Automata (LA) has made significant progress in the last four decades, the LA-based methods to tackle problems involving environments with a large number of actions are, in reality, relatively unresolved. The extension of the traditional LA (fixed structure, variable structure, discretized, and pursuit) to problems within this domain cannot be easily established when the number of actions is very large. This is because the dimensionality of the action probability vector is correspondingly large, and consequently, most components of the vector will, after a relatively short time, have values that are smal…
Which new semantic for new shapes?
2006
There are two innovations which have drastically changed the building process: the operational continuity of the design and construction phases, and the software allowing not only the representation but also the autonomous creation of complex shapes never before thought of just because they could not be represented. This last innovation gave rise to a new design paradigm whose tools, according to their supporters, are the most advanced fields of mathematics and information science. Some ways of using these new possibilities gave rise to a radical, problematic, change in the relationship net between the designer’s intentions, the shapes through which they express them (invented or self-gener…