CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

PDF papers
References

Hits 1 to 16 of 16

_id acadia08_448
id acadia08_448
authors Alfaris, Anas; Riccardo Merello
year 2008
title The Generative Multi-Performance Design System
source Silicon + Skin: Biological Processes and Computation, [Proceedings of the 28th Annual Conference of the Association for Computer Aided Design in Architecture (ACADIA) / ISBN 978-0-9789463-4-0] Minneapolis 16-19 October 2008, 448-457
summary This paper proposes a framework for an integrated computational design system. This design system builds on the strengths inherent in both generative synthesis models and multi-performance analysis and optimization. Four main design mechanisms and their mathematical models are discussed and their integration proposed. The process of building the design system begins by a top-down decomposition of a design concept. The different disciplines involved are decomposed into modules that simulate the respective design mechanisms. Subsequently through a bottom-up approach, the design modules are connected into a data flow network that includes clusters and subsystems. This network forms the Generative Multi-Performance Design System. This integrated system acts as a holistic structured functional unit that searches the design space for satisfactory solutions. The proposed design system is domain independent. Its potential will be demonstrated through a pilot project in which a multi-performance space planning problem is considered. The results are then discussed and analyzed.
keywords Analysis; Behavior; Generative; Optimization; Performance
series ACADIA
type normal paper
last changed 2009/02/26 07:47

_id avocaad_2001_10
id avocaad_2001_10
authors Bige Tunçer, Rudi Stouffs, Sevil Sariyildiz
year 2001
title Facilitating the complexity of architectural analyses
source AVOCAAD - ADDED VALUE OF COMPUTER AIDED ARCHITECTURAL DESIGN, Nys Koenraad, Provoost Tom, Verbeke Johan, Verleye Johan (Eds.), (2001) Hogeschool voor Wetenschap en Kunst - Departement Architectuur Sint-Lucas, Campus Brussel, ISBN 80-76101-05-1
summary It is common practice for architecture students to collect documents on prominent buildings relevant to their design task in the early stage of design. While practitioners can rely on a body of design experience of their own, during the process of a new design, students can only draw from the examples of success and failure from other architects. In the past, such precedent based learning was implicit in the master-apprentice relationship common in the educational system. Nowadays academics commonly no longer have the possibility to maintain an extensive design practice, and instead introduce important outside precedents to the students. Thus, the study of important historical precedents or designs plays an important role in design instruction and in the students’ design processes. While there is no doubt that the most effective outcome of such a study would be achieved when the student does entire the study herself, students also benefit from a collaboration with peers, where they form groups to do an analysis of various aspects of a same building or over a group of buildings. By integrating the respective results into a common, extensible, library, students can draw upon other results for comparisons and relationships between different aspects or buildings. The complexity this introduces is best supported in a computer medium.The Web offers many examples of architectural analyses on a wide variety of subjects. Commonly, these analyses consist of a collection of documents, categorized and hyperlinked to support navigation through the information space. More sophisticated examples rely on a database for storage and management of the data, and offer a more complex categorization of the information entities and their relationships. These studies present effective ways of accessing and browsing information, however, it is precluded within these analyses to distinguish and relate different components within the project documents. If enabled, instead, this would offer a richer information structure presenting new ways of accessing, viewing, and interpreting this information. Hereto, documents can be decomposed by content. This implies both expanding the document structure, replacing document entities by detailed substructures, and augmenting the structure’s relatedness with content information. The relationships between the resulting components make the documents inherently related by content.We propose a methodology to integrate project documents into a single model, and present an application for the presentation of architectural analyses in an educational setting. This approach provides the students with a simple interface and mechanisms for the presentation of an analysis of design precedents, and possibly their own designs. Since all the information is integrated within a single environment, students will benefit from each others’ studies, and can draw new conclusions across analyses and presentations from their peers.
series AVOCAAD
email b.tuncer@bk.tudelft.nl, I.s.sariyildiz@bk.tudelft.nl, r.stouffs@bk.tudelft.nl
last changed 2005/09/09 08:48

_id 2e56
authors Coyne, Robert Francis
year 1991
title ABLOOS : an evolving hierarchical design framework
source Carnegie Mellon University, Department of Architecture
summary The research reported in this thesis develops an approach toward a more effective use of hierarchical decomposition in computational design systems. The approach is based on providing designers a convenient interactive means to specify and experiment with the decompositional structure of design problems, rather than having decompositions pre-specified and encoded in the design system. Following this approach, a flexible decomposition capability is combined with an underlying design method to form the basis for an extensible and evolving framework for cooperative (humdcomputer) design. As a testbed for this approach, the ABLOOS framework for layout design is designed and constructed as a hierarchical extension of LOOS.’The framework enables a layout task to be hierarchically decomposed, and for the LOOS methodology to be applied recursively to layout subtasks at appropriate levels of abstraction within the hierarchy; layout solutions for the subtasks are then recomposed to achieve an overall solution, Research results thus far are promising: ABLOOS has produced high quality solutions for a class of industrial layout design tasks (an analog power board layout with 60 components that have multiple complex constraints on their placement); the adaptability of the framework across domains and disciplines has been demonstrated; and, further development of ABLOOS is underway including its extension to layouts in 2 1/2D space and truly 3D arrangements. The contribution of this work is in demonstrating an effective, flexible and extensible capability for hierarchical decomposition in design. It has also produced a more comprehensive layout system that can serve as a foundation for the further investigation of hierarchical decomposition in a variety of design domains.
series thesis:PhD
last changed 2003/02/12 21:37

_id ijac20108405
id ijac20108405
authors Din, Edouard; Athanassios Economou
year 2010
title Surface Symmetries: The Smith House Revisited
source International Journal of Architectural Computing vol. 8 - no. 4, p. 485
summary This work proposes the use of partial order lattices along with representational schemes to account for patterns of ambiguity and emergence in the description of designs. The complexity of such designs is viewed as an aggregation of spatial layers that can all be decomposed by the subgroup relations of the symmetry of the configuration. At the end, this methodology points to a combinatorial approach that generates visual prototypes for future use in design synthesis. Here, Meier's work is just a case study that validates the group theoretical approach.
series journal
last changed 2019/05/24 07:55

_id cf2009_173
id cf2009_173
authors Din, Edouard; Economou, Athanassios
year 2009
title Emergent symmetries: visual computations – A group theoretical analysis of the Smith House by Richard Meier
source T. Tidafi and T. Dorta (eds) Joining Languages, Cultures and Visions: CAADFutures 2009, PUM, 2009, pp. 173-187
summary This work proposes the use of partial order lattices along with represent-ational schemes to account for patterns of ambiguity and emergence in the description of designs. The complexity of such designs is viewed as an aggregation of spatial layers that can all be decomposed by the subgroup relations of the symmetry of the configuration. At the end, this methodology points to a combinatorial approach that generates visual prototypes for future use in design synthesis. Here, Meier’s work is just a case study that validates the group theoretical approach.
keywords Abstraction, partial order lattice, recombinant, visual prototype
series CAAD Futures
email edouard.din@tuskegee.edu
last changed 2009/06/08 18:53

_id 68c0
authors Gero, John S. and Rosenman, Michael A.
year 1990
title Design Decision Making Using Pareto-Optimal Dynamic Programming
source Berlin: Springer- Verlag, 1990. pp. 376-396
summary When designing using the systems approach, the given system is decomposed into a number of subsystems, and for each subsystem a set of feasible alternatives is selected by the designer. A building design example is presented in which it is demonstrated that sufficient relevant solutions are generated in one pass of the dynamic programming procedure to give a good approximation to the Pareto set, thus offering designers sufficient choice in making a final selection. The relevant information is displayed in an intelligent manner so that designers can either make a final decision or else perceive what extra information they require
keywords optimization, decision making, design process, architecture, multicriteria, evaluation, decomposition, dynamic programming
series CADline
email john@arch.usyd.edu.au
last changed 2003/06/02 08:24

_id 1a4e
authors Goel, Ashok Kumar
year 1989
title Integration of case-based reasoning and model-based reasoning for adaptive design problem solving
source Ohio State University
summary In the case-based approach to design, a novel problem is solved by adapting a design known to solve a related problem. Adapting a known design to solve a related problem by the commonly used methods of heuristic association and search, however, can be computationally expensive if the adaptation search space is not small. The adaptation space, then, needs to be decomposed into smaller and simpler spaces that can be searched more efficiently and effectively. The knowledge for decomposing the adaptation search space can be represented as a behavior-structure model that specifies how the structure of the known design results in its output behaviors. This research investigates the use of such behavior-structure models for adapting the designs of physical devices. Comprehension of how the output behaviors of a design arise from its structure is represented as a behavioral component-substance model for the design. The model explicitly specifies (i) the expected output behaviors of the design including its functions, (ii) the elementary structural and behavioral interactions between components and substances constituting the structure of the design, and (iii) the internal causal behaviors of the design that compose the elementary interactions into its output behaviors. The causal behaviors of the design, in this model, are indexed by the expected output behaviors for which they are responsible. The model aids case-based design in several ways. First, it identifies conceptual primitives for specifying the functions of designs, which are used to index the known designs stored in a case-based memory. Second, it identifies elementary types of behavior transformations and elementary types of structure modifications. Third, it provides knowledge for decomposition of the adaptation search space into smaller spaces so that the search for the needed structure modifications is localized. Fourth, it leads to a novel method for simulating the behavioral effects of structure modifications. The output and causal behaviors of the modified design, in this method, are derived by revising the output and causal behaviors of the known design. This integrative approach unifies case-based methods, associative methods, heuristic search methods, decomposition methods, and model-based methods into one architecture for adaptive design problem solving. Core portions of this approach have been implemented in an experimental design system called KRITIK.  
keywords Case Based Reasoning; Model Based Reasoning; Adaptive Design; Problem Solving
series thesis:PhD
last changed 2003/02/12 21:37

_id cf2017_431
id cf2017_431
authors Gonzalez, Paloma; Sass, Larry
year 2017
title Constructive Design: Rule Discovery for 3D Printing Decomposed Large Objects
source Gülen Çagdas, Mine Özkar, Leman F. Gül and Ethem Gürer (Eds.) Future Trajectories of Computation in Design [17th International Conference, CAAD Futures 2017, Proceedings / ISBN 978-975-561-482-3] Istanbul, Turkey, July 12-14, 2017, pp. 431-442.
summary This paper presents a rule discovery process for designers that work with physically large 3D printed models. After a period of discovery, rules were formalized, then developed into operations and programmable functions used in a generative design system. Past examples of generative systems are built based on visual constraints leading to graphical outcomes. With the emergence of 3D printing, we introduce ideas for rule building based on physical constraints and outcomes. The decomposition rules are: curved surface slicing, freestanding attribute, interval patterning, edge mating, and pneumatic attribute. The freestanding attribute, the most novel rule, is based on Chilean anti-earthquake building techniques. This rule provides the greatest degree of structural stability to a model. We conclude with a discussion of results from the case study used to generate the set constructive rules. We believe this method of module generation, 3D Printing and assembles can support design prototyping and model manufacturing across scales.
keywords Decomposition, Large Objects, 3D Printing.
series CAAD Futures
email palomagr@mit.edu, lsass@mit.edu
last changed 2017/12/01 13:38

_id 53ad
authors Huang, Jeffrey
year 1997
title Interorganizational Systems in Design
source Harvard University, Graduate School of Design
summary This thesis employs recent developments in coordination theory to analyze and map the coordination processes among participating firms in building design. The process model enables an understanding of the activities and dependencies in the collaborative design process, based on which potential implications of Interorganizational Information Systems (IOS), such as concurrent design platforms, vertical information links and electronic marketplaces, can be understood and critically assessed. Part One defines the parameters of the research, and contrasts the implementation of IOS in the aerospace, automobile and consulting industry to the state of practice in the building design industry. From the comparison, the need for fundamentally rethinking and redesigning the building design process is derived. Part Two describes how this can be accomplished by making the coordination processes in building design explicit. The building design process is decomposed into its core activities and dependencies, and new ways of recomposing the processes are identified which use alternative coordination mechanisms facilitated by IOS. Part Three describes the implications of the process model. Suggestions for appropriate IOS are made, and evidence of IOS applications in design is given in the analysis of four field studies, and in an example redesign of a design process.
series thesis:PhD
email jhuang@gsd.harvard.edu
last changed 2003/02/12 21:37

_id 0803
authors Jabri, Marwan A. and Skellern, David J.
year 1988
title Automatic Floorplan Design Using PIAF
source August, 1988. 36 p. : ill. tables
summary This paper presents PIAF (a Package for Intelligent and Algorithmic Floorplanning), developed at Sydney University Electrical Engineering (SUEE) for use in custom integrated circuit design. Floorplanning plays a crucial role in the design of custom integrated circuits. When design is approached in a top-down fashion, the function to be implemented on silicon is first decomposed in a conceptual phase into a Functional Block Diagram (FBD). This FBD has a 'blocks and buses' structure where blocks represent sub- functions and buses represent the interconnections that carry data and other information between blocks. The decomposition of the function into sub-functions is hierarchical and aims at reducing the complexity of the design problem. When the FBD is known, the floorplanning process may be performed. When this task is performed manually, the designer searches for a relative placement of the blocks and for an area and shape for each block to minimize the overall chip layout area while at the same time meeting design constraints such as design tool limitations, interconnection characteristics and technological design rules. PIAF is a knowledge-based system (KBS) that has been developed at SUEE during the last four years. It relies on a strategy that partitions the floorplanning task in a way that allows efficient use of heuristics and specialized design knowledge in the generation and pruning of the solution space. This paper presents the operation of PIAF and discusses several implementation issues including; KBS structure, knowledge representation, knowledge acquisition, current context memory design, design quality factors and explanation facility. This paper uses a running example to present the operation of each PIAF's KBS-based solving phases
keywords knowledge, representation, knowledge acquisition, electrical engineering, design, integrated circuits, knowledge base, systems, layout, synthesis
series CADline
last changed 2003/06/02 08:24

_id 2005_529
id 2005_529
authors Mayer, Rosirene and Turkienicz, Benamy
year 2005
title Cognitive Process, Styles and Grammars
source Digital Design: The Quest for New Paradigms [23nd eCAADe Conference Proceedings / ISBN 0-9541183-3-2] Lisbon (Portugal) 21-24 September 2005, pp. 529-536
summary This paper argues that individual architectural styles are ways to express different theories of architecture. These theories, in turn, are related to the architect’s design purposes or goals. In order to understand the cognitive process involved in the creation of a particular language or style goals have to be decomposed in subgoals, which will be related, step-by-step, to the vocabulary and syntactic rules adopted by these architects. The study should contribute to the development of models allowing the incorporation of cognitive processes in the generation of synthetic grammars. It is assumed that this will be made possible through the correlation between semantic rules and syntactic rules in shape grammars. As a case, this paper analyses semantic extensions of the architectural language of the Brazilian architect Oscar Niemeyer defined by the constructive approach.
keywords Cognitive Process, Style, Synthetic Grammars, Design Goals, SemanticRules
series eCAADe
email rmayer@portoweb.com.br
last changed 2012/11/23 18:17

_id 1839
authors Papamichael, Konstantinos Michael
year 1991
title Design process and knowledge possibilities and limitations of computer-aided design
source University of California, Berkeley
summary An attempt to determine how computers can be used to assist designers resulted in the development of a design theory, according to which design is 'feeling and thinking while acting.' Design is theorized as living through one's imagination, however being continuously affected by real life itself. The design process is decomposed into elementary activities that are characterized with respect to the nature of knowledge requirements and the degree to which they can be specified and delegated to computers. The results are considered as criteria to determine possibilities and limitations of computer-aided design. An integration of a variety of computer applications tools is proposed towards the design and development of a computer-based Design Support Environment (DSE), that is applicable to any design domain. The proposed DSE automates all specifiable and delegable design activities, while assisting with the nondelegable ones through appropriate user interface. A DSE demonstration prototype is also presented in the Appendix. This prototype addresses the design of fenestration and electric lighting systems of office spaces with respect to comfort, energy and cost.
series thesis:PhD
email K_Papamichael@lbl.gov
last changed 2003/02/24 19:32

_id c65a
id c65a
authors Sanly, Suzan and Saglamer, Gulsun
year 1995
title An Architect/An Architectural Language and A Shape Grammar
source Sixth International Conference on Computer-Aided Architectural Design Futures [ISBN 9971-62-423-0] Singapore, 24-26 September 1995, pp. 453-467
summary Every architect, whose goal is to create valuable artifacts, should own a unique architectural language. This language is composed of a vocabulary and a set of grammar rules to combine them. In this study, a number of ground and first floor plans of single family houses designed by an individual architect are analyzed. Plan lay-outs are decomposed into their components, and the composition rules are examined. Vocabulary elements, and geometric and semantic relationships among these elements are specified and a shape grammar is formed. Finally, different design possibilities are generated in terms of the defined language rules.
keywords Architectural Language, Shape Grammar
series CAAD Futures
last changed 2003/09/01 13:35

_id b5be
authors Stok, Leon
year 1991
title Architectural synthesis and optimization of digital systems
source Eindhoven University of Technology
summary High level synthesis means going from an functional specification of a digits-system at the algorithmic level to a register transfer level structure. Different appli-cations will ask for different design styles. Despite this diversity in design styles many tasks in the synthesis will be similar. There is no need to write a new synthesis system for each design style. The best way to go seems a decomposition of the high level synthesis problems in several well defined subproblems. How the problem is decomposed depends heavily on a) the type of network architecture chosen, b) the constraints applied to the design and c) on the functional description itself. From this architecture style, the constraints and the functional description a synthesis scheme can be derived. Once this scheme is fixed, algorithms can be chosen which fit into this scheme and solve the subproblems in a fast and, when possible, optimal way. To support such a synthesis philosophy, a framework is needed in which all design information can be stored in a unique way during the various phases of the design process. This asks for a design data base capable of handling all design information with a formally defined interface to all design tools. This thesis gives a formal way to describe both the functional representation, the register transfer level structure and the controller and the relations between all three of them. Special attention has been paid to the efficient representation of mutual exclusive operations and array accesses. The scheduling and allocation problems are defined as mappings between these formal representations. Both the existing synthesis algorithms and the new algorithms described in this thesis fit into this framework. Three new allocation algorithms are presented in this thesis: an algorithm for optimal register allocation in cyclic data flow graphs, an exact polynomial algorithm to do the module allocation and a new scheme to minimize the number of interconnections during all stages of the data path allocation. Cyclic data flow graphs result from high level behavioral descriptions that contain loops. Algorithms for register allocation in high level synthesis published up till now, only considered loop free data flow graphs, When these algorithms are applied to data flow graphs with loops, unnecessary register transfer operations are introduced. A new algorithm is presented that performs a minimal register allocation and eliminates all superfluous register transfer operations. The problem is reformulated as a multicommodity network flow problem for which very efficient solutions exist. Experiments on a benchmark set have shown that in all test cases all register transfers could be eliminated at no increase in register cost. Only heuristic algorithms appeared in literature to solve the module allocation problem. The module allocation problem is usually defined as a clique cover problem on a so-called module allocation graph. It is shown that, under certain conditions, the module allocation graph belongs to the special class of comparability graphs. A polynomial time algorithm can optimally find a clique cover of such a graph. Even when interconnect weights are taken into account, this can be solved exactly. This problem can be transformed into a maximal cost network flow problem, which can be solved exactly in polynomial time. An algorithm is described which solves the module allocation problem with interconnect weights exactly, with a complexity O(kn2), where n is the number of operations In previous research, interconnection was optimized when the module allocation for the operations and the register allocation for the variables already had been done. However, the amount of multiplexing and interconnect are crucial factors to both the delay and the area of a circuit. A new scheme is presented to minimize the number of interconnections during the data path allocation. This scheme first groups all values based on their read and write times. Values belonging to the same group can share a register file. This minimizes the number of data transfers with different sources and destinations. Secondly, registers are allocated for each group separately. Finally the interconnect allocation is done. During the interconnect allocation, the module allocation is determined. The value grouping is based on edge coloring algorithms providing a sharp upper bound on the number of colors needed two techniques: splitting read and write phases of values and introducing serial (re-)write operations for the same value, make that even more efficient exact edge coloring algorithms can be used. It is shown that when variables are grouped into register files and operations are assigned to modules during the interconnection minimization, significant savings (20%) can be obtained in the number of local interconnections and the amount of global interconnect, at the expense of only slightly more register area.
keywords Digital Systems; Digital Systems
series thesis:PhD
email p.d.v.v.d.stok@tue.nl
last changed 2003/02/12 21:37

_id sigradi2009_951
id sigradi2009_951
authors Sá, Daniele Nunes Caetano de
year 2009
title Os Processos Projetuais na Arquitetura de Peter Eisenman [The Processes in the Architecture of Peter Eisenman]
source SIGraDi 2009 - Proceedings of the 13th Congress of the Iberoamerican Society of Digital Graphics, Sao Paulo, Brazil, November 16-18, 2009
summary In the dialectic formal Eisenman, the procedures for projecting initially start from the consideration of architectural form as a transformation of a solid geometric pre-existing. Subsequently, the form is timeless, decomposed into spatial entities, non-specific, requiring the intellectualization of the process as an alternative to emotion perception. From the eighties, mediated by computer resources, self-referentiality is the keynote of the representational process and architectural experience. The search houses poetic diagrams as procedures for projecting computer, tangent now the concept of trail’ Derrida responsible for the intelligibility and readability of architecture, sometimes grotesque, or a rationale that contains the irrational.
keywords Eisenman; representação; auto-referencialidade; diagramas
series SIGRADI
email danielecaetano@terra.com.br
last changed 2016/03/10 09:01

_id 8f9d
authors Wolchko, Matthew J.
year 1985
title Strategies Toward Architectural Knowledge Engineering
source ACADIA Workshop ‘85 [ACADIA Conference Proceedings] Tempe (Arizona / USA) 2-3 November 1985, pp. 69-82
summary Conventional CAD-drafting systems become more powerful modeling tools with the addition of a linked attribute spreadsheet module. This affords the designer the ability to make design decisions not only in the graphic environment, but also as a consequence of quantitative design constraints made apparent in the spreadsheet. While the spreadsheet interface is easily understood by the user, it suffers from two limitations: it lacks a variety of functional capabilities that would enable it to solve more complex design tasks; also, it can only report on existing conditions in the graphic environment. A proposal is made for the enhancement of the spreadsheet's programming power, creating an interface for the selection of program modules that can solve various architectural design tasks. Due to the complexity and graphic nature of architectural design, it is suggested that both procedural and propositional programming methods be used in concert within such a system. In the following, a suitable design task (artificial illumination-reflected ceiling layout) is selected, and then decomposed into two parts: the quantitative analysis (via the application of a procedural programming algorithm), and a logical model generation using shape grammar rules in a propositional framework.
series ACADIA
last changed 1999/01/01 17:51

No more hits.

HOMELOGIN (you are user _anon_361247 from group guest) CUMINCAD Papers Powered by SciX Open Publishing Services 1.002