Cumincad : CUMINCAD Papers : Search Results

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 20 of 58

Reformat results as: short short into frame detailed detailed into frame

_id	0cb0
authors	Paul, Richard P.
year	1981
title	Robot Manipulators : Mathematics, Programming and Control
source	279 p. Boston: The MIT press, 1981. include bibliography and index.-- (The MIT series in Artificial Intelligence)
summary	The book covers several aspects of computer control of mechanical manipulators
keywords	robotics, programming, AI
series	CADline
last changed	2003/06/02 10:24

_id	8d0f
authors	Pattis, Richard E.
year	1981
title	Karel the Robot : A Gentle Introduction to the Art of Programming
source	New York: John Wiley & sons Inc., 1981
summary	An introduction to programming in PASCAL. The book is arranged as a full programming course including homework problems for the students
keywords	programming, languages, PASCAL
series	CADline
last changed	2003/06/02 10:24

_id	a5c3
authors	Er, M.C.
year	1981
title	The Relations of the Computation of Fibonnaci Numbers with the Polyphase Sort
source	8 p. Wollongong: Department of Computing Science, University of Wollongong, September, 1981. includes bibliography
summary	The theory of polyphase sort has simplified the mathematical derivations of Wilson and Shortt's (1980) algorithm, and offered an intuitive explanation of why Gries and Levin's (1980), and Urbanek's (1980) algorithms work. The computation of order-k Fibonacci numbers is equivalent to moving a window of matrix upwards in a series of ideal distributions
keywords	Fibonacci, sorting, mathematics, algorithms
series	CADline
last changed	2003/06/02 13:58

_id	0776
authors	Er, M.C.
year	1981
title	Matrices of Fibonacci Numbers
source	12 p. Wollongong: Department of Computing Science, University of Wollongong, October, 1981. includes bibliography
summary	The matrices of Fibonacci numbers (called windows) possess some unusual properties which are not shared by normal matrices, such as commutativity under multiplication and +1 for all determinants. The beauty of multiplicative closure lends a hand to the fast computation of generalized order-k Fibonacci numbers in O(k2 log n) time
keywords	Fibonacci, mathematics
series	CADline
last changed	2003/06/02 13:58

_id	4555
authors	Bergland, Glenn D. and Gordon, Ronald D.
year	1981
title	Tutorial : Software Design Strategies.--2nd. ed
source	vi, 479 p. Los Angeles: IEEE Computer Society Press, 1981. includes bibliography and permuted title index p.449-477
summary	A tutorial text attempting to clarify and focus on aspects of software design that have direct effect on the structure of the final program. Several major design strategies are developed and compared, including: traditional forms of functional decomposition, the data structure design method of Michael Jeckson, the data-flow design method of Larry Constantine, and the programming calculus of Edsger Dijkstra. The process of organizing and coordinating the efforts of the design team is also studied especially practices of top-down development, code walkthroughs, and design reviews are presented and evaluated
keywords	software, design, programming, techniques
series	CADline
last changed	2003/06/02 13:58

_id	a8d1
authors	Galle, Per
year	1981
title	An Algorithm for Exhaustive Generation of Building Floor Plans
source	Communications of the ACM December, 1981. vol. 2: pp.813-823, [3] : ill. includes bibliography.
summary	The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The paper describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only, such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems up to ten rooms have been solved in modest length of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed
keywords	architecture, floor plans, automation, design, planning, algorithms, combinatorics, grids, constraints, synthesis
series	CADline
last changed	1999/02/12 15:08

_id	eced
authors	Gries, David
year	1981
title	The Science of programming
source	xiii, 366 p. New York: Springer-Verlag, 1981. include bibliography: p. [355]- 357 and index. -- (Texts and Monographs in Computer Science)
summary	Part 1 is an introduction to the propositional and predicate calculi. Part 2 defines a small language in terms of weakest preconditions. Part 3 is the heart of the book, where the reader is asked questions and is expected to answer. Not all answers are given
keywords	programming, techniques
series	CADline
last changed	1999/02/12 15:08

_id	2430
authors	Kernighan, Brian W. and Plauger, P.J.
year	1981
title	Software Tools in Pascal
source	ix, 366 p. Reading,Mass.: Addison-Wesley Pu. Co., 1981. includes bibliography and index
summary	How to write programs that make good tools, and how to program well in the process are the two main concepts. Structured programming and top down design are emphasized and applied to every program as are principles of design, testing efficiency and portability
keywords	programming, PASCAL, education
series	CADline
last changed	2003/06/02 13:58

_id	4140
authors	Koffman, Elliot B.
year	1981
title	Problem Solving and Structured Programming in PASCAL
source	82 p. in various paging reading Reading, Mass.: Addison-Wesley Pub. Co. Inc., 1981. include index.
summary	-- (Addison-wesley Series in Computer Science and Information Processing). A one semester introductory course in computer programming. Teaches problem solving through the technique of stepwise algorithms development. Most of the features of standard PASCAL are covered in detail. Separate chapters are devoted to a discussion of advanced data structures like files, multidimensional arrays, and lists and trees. There is an appendix that discusses string processing in UCSD PASCAL
keywords	PASCAL, programming, problem solving, education, languages
series	CADline
last changed	2003/06/02 13:58

_id	2c6a
authors	Rosenbloom, Paul S.
year	1981
title	A World-Championship-Level Othello Program
source	Pittsburgh, PA: Department of Computer Science, CMU, August, 1981. [4], 47 p. : ill. and graphs. include bibliography
summary	Othello is a recent addition to the collection of games that have been examined within artificial intelligence. Advances have been rapid, yielding programs that have reached the level of world-championship play. This article describes the current champion Othello program, Iago. The work described here includes: (1) a task analysis of Othello; (2) the implementation of a program based on this analysis and state- of-the-art AI game-playing techniques; and (3) an evaluation of the program's performance through games played against other programs and comparisons with expert human play
keywords	AI, programming, games, systems
series	CADline
last changed	2003/06/02 10:24

_id	82a8
authors	Kutay, Ali R.
year	1981
title	Multi-User Concurrent Design Databases
source	May 14, 1981. [1] 27 p. includes bibliography
summary	Developing comprehensive computer models of engineering systems is an important research effort. These models are planned to support design, analysis, optimization and production of these systems by providing a common integrated source of data. They are also expected to support multiple users accessing them concurrently so that parallel development of the system is enabled. This paper looks at the concurrency control problem in computer models of engineering design. It reviews the major aspects of database systems which are the tools of modelling, and identifies different representations used in the design process. With this as the context, the paper surveys the basic mechanisms for concurrency control in database systems. It then classifies the different degrees of concurrency in different representations of the design process
keywords	engineering, design, database, concurrency, CAD
series	CADline
last changed	2003/06/02 13:58

_id	sigradi2008_166
id	sigradi2008_166
authors	Papanikolaou, Dimitris
year	2008
title	Digital Fabrication Production System Theory: Towards an Integrated Environment for Design and Production of Assemblies
source	SIGraDi 2008 - [Proceedings of the 12th Iberoamerican Congress of Digital Graphics] La Habana - Cuba 1-5 December 2008
summary	A Digital Fabrication Production System (DFPS) is a concept describing a set of processes, tools, and resources that will be able to produce an artifact according to a design, fast, cheap, and easy, independently of location. A DFPS project is a complex assembly of custom parts that is delivered by a network of fabrication and assembly processes. This network is called the value chain. The workflow concept of a DFPS is the following: begin design process with a custom geometric form; decompose it into constructible parts; send the part files for fabrication to various locations; transport all parts at the construction site at the right time; finally, assemble the final artifact. Conceptually it means that based on a well structured value chain we could build anything we want, at anyplace, at controllable cost and quality. The goals of a DFPS are the following: custom shapes, controllable lead time, controllable quality, controllable cost, easiness of fabrication, and easiness of assembly. Simply stated this means to build any form, anywhere, accurately, cheap, fast, and easy. Unfortunately, the reality with current Digital Fabrication (DF) projects is rather disappointing: They take more time than what was planned, they get more expensive than what was expected, they involve great risk and uncertainty, and finally they are too complex to plan, understand, and manage. Moreover, most of these problems are discovered during production when it is already late for correction. However, there is currently no systematic approach to evaluate difficulty of production of DF projects in Architecture. Most of current risk assessment methods are based on experience gathered from previous similar cases. But it is the premise of mass customization that projects can be radically different. Assembly incompatibilities are currently addressed by building physical mockups. But physical mockups cause a significant loss in both time and cost. All these problems suggest that an introduction of a DFPS for mass customization in architecture needs first an integrated theory of assembly and management control. Evaluating feasibility of a DF project has two main problems: first, how to evaluate assemblability of the design; second, how to evaluate performance of the value chain. Assemblability is a system’s structure problem, while performance is a system’s dynamics problem. Structure of systems has been studied in the field of Systems Engineering by Network Analysis methods such as the Design Structure Matrix (DSM) (Steward 1981), and the liaison graph (Whitney 2004), while dynamics of systems have been studied by System Dynamics (Forrester 1961). Can we define a formal method to evaluate the difficulty of production of an artifact if we know the artifact’s design and the production system’s structure? This paper formulates Attribute Process Methodology (APM); a method for assessing feasibility of a DFPS project that combines Network Analysis to evaluate assemblability of the design with System Dynamics to evaluate performance of the value chain.
keywords	Digital Fabrication, Production System, System Dynamics, Network Analysis, Assembly
series	SIGRADI
email
last changed	2016/03/10 09:57

_id	01bb
authors	Er, M.C.
year	1981
title	A Representation Approach to the Tower of Hanoi Problem
source	22 p. : ill. Wollongong: Department of Computing Science, University of Wollongong, August, 1981. includes bibliography
summary	By making the moving direction of each disc explicit in the representation, a bit-string so constructed can be used to drive the Tower of Hanoi algorithm. The behavior of disc moves is further analyzed based on the bit-string representation. It has been shown that the bit-string for moving n discs can be used to generate successively the Gray codes of n bits
keywords	representation, programming, combinatorics, algorithms, recursion
series	CADline
last changed	2003/06/02 13:58

_id	eb23
authors	Akin, Omer
year	1981
title	Efficient Computer-User Interface in Electronic Mail Systems
source	Department of Computer Science, April, 1981. ii, 24 p. includes bibliography
summary	This research explores the question of improving user- computer interface. The approach is one of observing and codifying various parameters that influence the efficiency of interface in the context of electronic mail tasks. In the paper the authors observe 'expert' and 'regular' users of a mail system and analyze the sources of efficiency. It is clear that experts use a different, more specialized, set of commands in performing standard mail tasks. While experts perform these tasks with fewer errors and more 'completely,' it is not clear that they achieve this any faster than regular users. Recommendations for design are made
keywords	user interface, protocol analysis
series	CADline
email
last changed	2003/05/17 10:09

_id	c9dc
authors	Avron, Barr and Feigenbaum, Edward A. (editors)
year	1981
title	The Handbook of Artificial Intelligence
source	xiv, 409 p. Stanford, California: HeurisTech Press., 1981. vol. 1 of 3: includes bibliography p.[365]-388 and indexes
summary	Part 1 of a three volume set that contains some 200 articles on AI. Volume 1 discusses the goals of AI research, the history of the field and the current active areas of research. It explains how the book is organized, and the literature of the field. How to access journal articles and technical reports for further reading
keywords	AI
series	CADline
last changed	2003/06/02 13:58

_id	barakat_theses_eaea2007
id	barakat_theses_eaea2007
authors	Barakat, Husam
year	2008
title	Analytical Study of the Projects of Students in the Architectural Design - Comparision Between Physical and Digital Models
source	Proceedings of the 8th European Architectural Endoscopy Association Conference
summary	Since its foundation in 1981, Architectural faculty has adopted traditional teaching methods for practical subjects such as architectural design and Urban planning. In these subjects, students submitted their projects and exams on (chanson) and (calk) sheets using various drawing tools. Such tools are still in use by students up to date in manually architectural concept presentation. This comes after the students pass a number of subjects related to art and engineering drawing that help the students in gaining drawing representation and rendering skills.
keywords	architectural concept, traditional teaching, computer technology
series	EAEA
email
more	http://info.tuwien.ac.at/eaea
last changed	2008/04/29 20:46

_id	c0ee
authors	Bentley, Jon L. and Ottmann, Thomas
year	1981
title	The Complexity of Manipulating Hierarchically Defined Sets of Rectangles
source	40 p. : ill. Pittsburgh, PA: Department of Computer Science, CMU., April, 1981. CMU-CS-81-109. includes bibliography
summary	Algorithms that manipulate sets of rectangles are of great practical importance in VLSI design systems and other applications. Although much theoretical work has appeared recently on the complexity of rectangle problems, it has assumed that the inputs are given as a list of rectangles. In this paper the authors study the complexity of rectangle problems when the inputs are given in a hierarchical language that allows the designer to build large designs by replicating small designs. They show that while most of the problems are NP-hard in the general case, there are O(N log N) algorithms that process inputs obeying certain restrictions
keywords	rectangles, algorithms, computational geometry, data structures
series	CADline
last changed	2003/06/02 10:24

_id	bf5a
authors	Botman, J.J.
year	1981
title	Dynamics of Housing and Planning: A Regional Simulation Model
source	Delft University of Technology - Martinus Nijhoff Publishers, Dordrecht (ISBN 90-247-2499-6)
series	thesis:PhD
email
last changed	2003/02/12 22:37

_id	a6f1
authors	Bridges, A.H.
year	1986
title	Any Progress in Systematic Design?
source	Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 5-15
summary	In order to discuss this question it is necessary to reflect awhile on design methods in general. The usual categorization discusses 'generations' of design methods, but Levy (1981) proposes an alternative approach. He identifies five paradigm shifts during the course of the twentieth century which have influenced design methods debate. The first paradigm shift was achieved by 1920, when concern with industrial arts could be seen to have replaced concern with craftsmanship. The second shift, occurring in the early 1930s, resulted in the conception of a design profession. The third happened in the 1950s, when the design methods debate emerged; the fourth took place around 1970 and saw the establishment of 'design research'. Now, in the 1980s, we are going through the fifth paradigm shift, associated with the adoption of a holistic approach to design theory and with the emergence of the concept of design ideology. A major point in Levy's paper was the observation that most of these paradigm shifts were associated with radical social reforms or political upheavals. For instance, we may associate concern about public participation with the 1970s shift and the possible use (or misuse) of knowledge, information and power with the 1980s shift. What has emerged, however, from the work of colleagues engaged since the 1970s in attempting to underpin the practice of design with a coherent body of design theory is increasing evidence of the fundamental nature of a person's engagement with the design activity. This includes evidence of the existence of two distinctive modes of thought, one of which can be described as cognitive modelling and the other which can be described as rational thinking. Cognitive modelling is imagining, seeing in the mind's eye. Rational thinking is linguistic thinking, engaging in a form of internal debate. Cognitive modelling is externalized through action, and through the construction of external representations, especially drawings. Rational thinking is externalized through verbal language and, more formally, through mathematical and scientific notations. Cognitive modelling is analogic, presentational, holistic, integrative and based upon pattern recognition and pattern manipulation. Rational thinking is digital, sequential, analytical, explicatory and based upon categorization and logical inference. There is some relationship between the evidence for two distinctive modes of thought and the evidence of specialization in cerebral hemispheres (Cross, 1984). Design methods have tended to focus upon the rational aspects of design and have, therefore, neglected the cognitive aspects. By recognizing that there are peculiar 'designerly' ways of thinking combining both types of thought process used to perceive, construct and comprehend design representations mentally and then transform them into an external manifestation current work in design theory is promising at last to have some relevance to design practice.
series	CAAD Futures
email
last changed	2003/11/21 15:16

_id	91c4
authors	Checkland, P.
year	1981
title	Systems Thinking, Systems Practice
source	John Wiley & Sons, Chichester
summary	Whether by design, accident or merely synchronicity, Checkland appears to have developed a habit of writing seminal publications near the start of each decade which establish the basis and framework for systems methodology research for that decade."" Hamish Rennie, Journal of the Operational Research Society, 1992 Thirty years ago Peter Checkland set out to test whether the Systems Engineering (SE) approach, highly successful in technical problems, could be used by managers coping with the unfolding complexities of organizational life. The straightforward transfer of SE to the broader situations of management was not possible, but by insisting on a combination of systems thinking strongly linked to real-world practice Checkland and his collaborators developed an alternative approach - Soft Systems Methodology (SSM) - which enables managers of all kinds and at any level to deal with the subtleties and confusions of the situations they face. This work established the now accepted distinction between hard systems thinking, in which parts of the world are taken to be systems which can be engineered, and soft systems thinking in which the focus is on making sure the process of inquiry into real-world complexity is itself a system for learning. Systems Thinking, Systems Practice (1981) and Soft Systems Methodology in Action (1990) together with an earlier paper Towards a Systems-based Methodology for Real-World Problem Solving (1972) have long been recognized as classics in the field. Now Peter Checkland has looked back over the three decades of SSM development, brought the account of it up to date, and reflected on the whole evolutionary process which has produced a mature SSM. SSM: A 30-Year Retrospective, here included with Systems Thinking, Systems Practice closes a chapter on what is undoubtedly the most significant single research programme on the use of systems ideas in problem solving. Now retired from full-time university work, Peter Checkland continues his research as a Leverhulme Emeritus Fellow. "
series	other
last changed	2003/04/23 15:14

For more results click below: