984 resultados para Palladio, Andrea, 1508-1580.


Relevância:

10.00% 10.00%

Publicador:

Resumo:

36 hojas : ilustraciones.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Compendio de fotografías que ilustran actividades de promoción social para el desarrollo de la artesanía, suscripción de convenios interinstitucionales, eventos feriales, visitas a municipios artesanales tradicionales, entrega de condecoraciones y reconocimientos a las destrezas de los artesanos, inauguración de ferias artesanales que en colaboración con funcionarios de la entidad fueron llevados a cabo por parte de los exgerentes de Artesanías de Colombia: Federico Echeberría Olarte (1968-1972), Graciela Samper de Bermúdez (1972-1984), María Cristina Palau de Angulo (1985-1990), Cecilia Duque Dique (01990-2005) y Paola Andrea Munñoz Jurado (2005-2009). (Herrera Rubio, Neve Enrique)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

52 hojas : ilustraciones, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

54 hojas : ilustraciones, gráficas, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

74 hojas : ilustraciones, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

18 hojas : Ilustraciones.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

23 hojas : ilustraciones, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

44 hojas : ilustraciones, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

28 hojas : ilustraciones, fotografías.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

volúmenes : ilustraciones, fotografías ; 12 cm.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

PDF of powerpoint slides presented at DSUG 2007 Roma

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its recovery block is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. We describe a number of admission control strategies and contrast (through simulations) their relative performance.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Existing Building/Energy Management Systems (BMS/EMS) fail to convey holistic performance to the building manager. A 20% reduction in energy consumption can be achieved by efficiently operated buildings compared with current practice. However, in the majority of buildings, occupant comfort and energy consumption analysis is primarily restricted by available sensor and meter data. Installation of a continuous monitoring process can significantly improve the building systems’ performance. We present WSN-BMDS, an IP-based wireless sensor network building monitoring and diagnostic system. The main focus of WSN-BMDS is to obtain much higher degree of information about the building operation then current BMSs are able to provide. Our system integrates a heterogeneous set of wireless sensor nodes with IEEE 802.11 backbone routers and the Global Sensor Network (GSN) web server. Sensing data is stored in a database at the back office via UDP protocol and can be access over the Internet using GSN. Through this demonstration, we show that WSN-BMDS provides accurate measurements of air-temperature, air-humidity, light, and energy consumption for particular rooms in our target building. Our interactive graphical user interface provides a user-friendly environment showing live network topology, monitor network statistics, and run-time management actions on the network. We also demonstrate actuation by changing the artificial light level in one of the rooms.