811 resultados para Architecture and Complexity
Resumo:
Knowledge of the plan competes with self-consciousness of experience. The less we are able to understand our spatio-visual experience by the abstract coordinates of the plan, the more we are thrust back into a lived experience of the building in duration. This formula, frequently unacknowledged, has been one of the main precepts of the experientialist modernism which arises out of the picturesque and which stands in critique of classical idealism. One of the paths to critique this formula is by showing that the attention to the experience of the spaces in duration is predicated on obscuring, complicating and weakening the apprehension of the plan as a figure. Another development in the practice of modern planning has been architects using a kind of over-drawing where human circulation diagrams or 'movement lines' are drawn expressively across the orthographic plane; thus representing the lived experience of buildings. We will show that these two issues are linked; the plan's weak figure and the privilege this supposes for durational experience has a corollary - experience itself demands to be visible in the plan, and this is one origin of the present fascination with 'diagramming'. In this paper we explore the practice of architectural planning and its theoretical underpinnings in an attempt to show the viability of a history of architectural planning methods.
Resumo:
Despite decades of research, the takeup of formal methods for developing provably correct software in industry remains slow. One reason for this is the high cost of proof construction, an activity that, due to the complexity of the required proofs, is typically carried out using interactive theorem provers. In this paper we propose an agent-oriented architecture for interactive theorem proving with the aim of reducing the user interactions (and thus the cost) of constructing software verification proofs. We describe a prototype implementation of our architecture and discuss its application to a small, but non-trivial case study.
Resumo:
While developments in distributed object computing environments, such as the Common Object Request Broker Architecture (CORBA) [17] and the Telecommunication Intelligent Network Architecture (TINA) [16], have enabled interoperability between domains in large open distributed systems, managing the resources within such systems has become an increasingly complex task. This challenge has been considered for several years within the distributed systems management research community and policy-based management has recently emerged as a promising solution. Large evolving enterprises present a significant challenge for policy-based management partly due to the requirement to support both mutual transparency and individual autonomy between domains [2], but also because the fluidity and complexity of interactions occurring within such environments requires an ability to cope with the coexistence of multiple, potentially inconsistent policies. This paper discusses the need of providing both dynamic (run-time) and static (compile-time) conflict detection and resolution for policies in such systems and builds on our earlier conflict detection work [7, 8] to introduce the methods for conflict resolution in large open distributed systems.