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 111

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

_id	e118
authors	Balas, Egon
year	1983
title	Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
source	December, 1983. 38 p. : ill. includes bibliography
summary	The author discuss a new conceptual framework for the convexification of discrete optimization problems, and a general technique for obtaining approximations to the convex hull of the feasible set. The concepts come from disjunctive programming and the key tool is a description of the convex hull of a union of polyhedra in terms of a higher dimensional polyhedron. Although this description was known for several years, only recently was it shown by Jeroslow and Lowe to yield improved representations of discrete optimization problems. The author expresses the feasible set of a discrete optimization problem as the intersection (conjunction) of unions of polyhedra, and define an operation that takes one such expression into another, equivalent one, with fewer conjuncts. He then introduces a class of relaxations based on replacing each conjunct (union of polyhedra) by its convex hull. The strength of the relaxations increases as the number of conjuncts decreases, and the class of relaxations forms a hierarchy that spans the spectrum between the common linear programming relaxation, and the convex hull of the feasible set itself. Instances where this approach presents advantages include critical path problems in disjunctive graphs, network synthesis problems, certain fixed charge network flow problems, etc. The approach on the first of these problems is illustrated, which is a model for machine sequencing
keywords	polyhedra, computational geometry, optimization, programming, convex hull, graphs
series	CADline
last changed	1999/02/12 15:07

_id	e7b8
authors	Dahl, Veronica
year	1983
title	Logic Programming as a Representation of Knowledge
source	IEEE Computer. IEEE Computer Society, October, 1983. vol. 16: pp. 106-110 : ill. includes bibliography
summary	Logic has traditionally provided a firm conceptual framework for representing knowledge. As it can formally deal with the notion of logical consequence, the introduction of Prolog has made it possible to represent knowledge in terms of logic and also to expect appropriate inferences to be drawn from it automatically. This article illustrates and explores these ideas with respect to two central representational issues: problem solving knowledge and database knowledge. The technical aspects of both subjects have been covered elsewhere (Kowalski, R. Logic for problem solving, North- Holland pub. 1979 ; Dahl, V. on database system development through logic ACM Trans.vol.7/no.3/Mar.1982 pp.102). This explanation uses simple, nontechnical terms
keywords	PROLOG, knowledge, representation, logic, programming, problem solving, database
series	CADline
last changed	1999/02/12 15:08

_id	40bf
authors	Funt, Brian V.
year	1983
title	Analogical Modes of Reasoning and Process Modeling
source	IEEE Computer. IEEE computer society, October, 1983. vol. 16: pp. 99-103 : ill. includes bibliography
summary	Analogical reasoning can be incorporated into AI problem- solving systems, representing data in a form amenable to parallel processing. One program using analog is Whisper, an AI problem-solving system, which uses a diagram to predict the collapse of a structure constructed from a set of blocks
keywords	AI, parallel processing, reasoning, problem solving
series	CADline
last changed	2003/06/02 13:58

_id	0f6e
authors	Kalay, Yehuda E.
year	1983
title	Modular Menu Mapping and Hit-Testing
source	1983? 17 p. : ill. includes bibliography
summary	This paper introduces a method called MODULAR MENU MAPPING, which rationalizes menu layout and trades menu hit-test time with a look up table, thereby reducing the cost of determining the menu box inclusion of the cursor to a single unit of time. To overcome the problem of space required to store the look-up table, a hybrid method called RUN-LENGTH ENCODING is introduced. It reduces the storage space requirements by substituting the two-dimensional look-up table with a linear vector. It does however, require some search, which is nevertheless still much cheaper then the full search of a non-mapped menu
keywords	user interface, computer graphics
series	CADline
email
last changed	2003/06/02 13:58

_id	21d8
authors	Balas, Egon and Toth, Paolo
year	1983
title	Branch and Bound Methods for the Traveling Salesman Problem
source	December, 1983, 65 p. : ill., tables. Includes bibliography
summary	This paper reviews the state of the art in enumerative solution methods for the traveling salesman problem (TSP). The introduction (Section 1) discusses the main ingredients of branch and bound methods for the TSP. Sections 2,3 and 4 discuss classes of methods based on three different relaxation of the TSP: the assignment problem with the TSP cost function, the 1-tree problem with a Lagrangean objective function, and the assignment problem with a lagrangean objective function. Section 5 briefly reviews some other relaxations of the TSP, while section 6 discusses the performance of some state of the art computer codes. Besides material from the literature, the paper also includes the results and statistical analysis of some computational experiments designed for the purposes of this review
keywords	relaxation, branch-and-bound, algorithms, applications
series	CADline
last changed	2003/06/02 13:58

_id	41af
authors	Barnhill, Robert E.
year	1983
title	A Survey of the Representation and Design of Surfaces
source	IEEE Computer Graphics and Applications. October, 1983. vol. 3: pp. 9-16 : ill. includes bibliography
summary	The approach of devising robust surface methods applicable to arbitrarily located data was taken by the CAGD Group at the University of Utah. Adopting two broad classes of methods suitable for solving the problems (i.e., problems for which simplifying geometric assumptions cannot be made): (1) surface interpolants defined over triangles or tetrahedra and (2) distance-weighted interpolants. Interactive computer graphics was used to display surfaces for adequate visualization. Although some figures were given, it must be kept in mind that some 3-D medium, or at least motion, is necessary to understand surfaces
keywords	computational geometry, computer graphics, representation, curved surfaces, mathematics
series	CADline
last changed	2003/06/02 10:24

_id	8c67
authors	Brachman, Ronald J., Levesque, Hector J. and Fikes, Richard E.
year	1983
title	Krypton : A Functional Approach to Knowledge Representation
source	IEEE Computer. IEEE Computer Society, October, 1983. vol. 16: pp. 67-73 : ill. includes bibliography
summary	While the basic ideas of frame systems are straight forward, complication arise in their design. A design strategy was developed and have been implemented in a representation system called Krypton. Krypton distinguishes between definitional and factual information by using both frame- based and logic-based languages. The result is a system defined in functional not structural terms
keywords	AI, frames, knowledge, representation, systems
series	CADline
last changed	2003/06/02 10:24

_id	8e02
authors	Brown, A.G.P. and Coenen, F.P.
year	2000
title	Spatial reasoning: improving computational efficiency
source	Automation in Construction 9 (4) (2000) pp. 361-367
summary	When spatial data is analysed the result is often very computer intensive: even by the standards of contemporary technologies, the machine power needed is great and the processing times significant. This is particularly so in 3-D and 4-D scenarios. What we describe here is a technique, which tackles this and associated problems. The technique is founded in the idea of quad-tesseral addressing; a technique, which was originally applied to the analysis of atomic structures. It is based on ideas concerning Hierarchical clustering developed in the 1960s and 1970s to improve data access time [G.M. Morton, A computer oriented geodetic database and a new technique on file sequencing, IBM Canada, 1996.], and on atomic isohedral (same shape) tiling strategies developed in the 1970s and 1980s concerned with group theory [B. Grunbaum, G.C. Shephard, Tilings and Patterns, Freeman, New York, 1987.]. The technique was first suggested as a suitable representation for GIS in the early 1980s when the two strands were brought together and a tesseral arithmetic applied [F.C. Holdroyd, The Geometry of Tiling Hierarchies, Ars Combanitoria 16B (1983) 211–244.; S.B.M. Bell, B.M. Diaz, F.C. Holroyd, M.J.J. Jackson, Spatially referenced methods of processing raster and vector data, Image and Vision Computing 1 (4) (1983) 211–220.; Diaz, S.B.M. Bell, Spatial Data Processing Using Tesseral Methods, Natural Environment Research Council, Swindon, 1986.]. Here, we describe how that technique can equally be applied to the analysis of environmental interaction with built forms. The way in which the technique deals with the problems described is first to linearise the three-dimensional (3-D) space being investigated. Then, the reasoning applied to that space is applied within the same environment as the definition of the problem data. We show, with an illustrative example, how the technique can be applied. The problem then remains of how to visualise the results of the analysis so undertaken. We show how this has been accomplished so that the 3-D space and the results are represented in a way which facilitates rapid interpretation of the analysis, which has been carried out.
series	journal paper
more	http://www.elsevier.com/locate/autcon
last changed	2003/05/15 21:22

_id	0f34
authors	Brown, P.J.
year	1983
title	Error Messages : The Neglected Area of the Man / Machine Interface?
source	communications of the ACMò. April, 1983. vol. 26: pp. 246-249. includes bibliography
summary	The quality of error messages produced by software used in the field was tested by a simple experiment; it was found to be far from adequate. The results of the experiment are analyzed, and some responses which tend to corroborate the original findings are discussed. Finally some suggestions are made for improving the quality of error messages
keywords	reliability, user interface, software, management
series	CADline
last changed	2003/06/02 13:58

_id	6647
authors	Buxton, W., M.R. Lamb and Sherman, D. (et al)
year	1983
title	Towards a Comprehensive User Interface Management System
source	computer Graphics. July, 1983. vol. 17: pp. 35-42 : ill. includes bibliography
summary	A UIMS developed at the University of Toronto is presented. The system has two main components. The first is a set of tools to support the design and implementation of interactive graphics programs. The second is a run-time support package which handles interactions between the system and the user (things such as hit detection, event detection, screen updates, and procedure invocation), and provides facilities for logging user interactions for later protocol analysis. The design / implementation tool is a preprocessor, called MENULAY, which permits the applications programmer to use interactive graphics techniques to design graphics menus and their functionality. The output of this preprocessor is high- level code which can be compiled with application-specific routines. User interactions with the resulting executable module are then handled by the run-time support package. The presentation works through an example from design to execution in a step-by-step manner
keywords	software, user interface, management, computer graphics
series	CADline
last changed	2003/06/02 13:58

_id	88b6
authors	Campello, Ruy Eduardo and Maculan, Nelson
year	1983
title	A Lower Bound to the Set Partitioning Problem with Side Constraints
source	24 p. : ill. Pittsburgh: Design Research Center, CMU, December, 1983 DRC-70-20-83. includes bibliography.
summary	A Lagrangean relaxation approach is proposed to provide a lower bound on the optimal solution of the set partitioning problem with side constraints, which is a general methodology to solve a combinatorial optimization problem. This Lagrangean relaxation approach is accomplished by a subgradient optimization procedure which solves at each iteration a special 0-1 knapsack problem. The approach seems to be promising since it produces feasible integer solutions to the side constraints that can hopefully be the optimal solution to most of the instances of the set partitioning problem with side constraints
keywords	mathematics, operations research, relaxation, algorithms, combinatorics, optimization, constraints
series	CADline
last changed	2003/06/02 13:58

_id	8b75
authors	Cullen, Ian
year	1983
title	Expert Systems in Architectural and Planning Education
doi	https://doi.org/10.52842/conf.ecaade.1983.x.a7j
source	Proceedings of the International Conference eCAADe [European Computer Aided Architectural Design Education] Brussels (Belgium) 1983, pp. IV.1-IV.15
summary	The paper discusses the problems and possibilities of a project initiated recently within the Bartlett in the general area of knowledge engineering. The aim is to assemble a set of knowledge bases which may be explored interactively by students. The system will differ from traditional CAL packages in that it will be both problem oriented - designed to extract from the students the information required to reach a specific decision - and capable of providing an explanation of its approach at any point.
keywords	Knowledge Engineering
series	eCAADe
last changed	2022/06/07 07:50

_id	0d6d
authors	Doyle, Jon
year	1983
title	Admissible State Semantics for Representational Systems
source	IEEE Computer. IEEE computer society, October, 1983. vol. 16: pp. 119-122. includes bibliography
summary	A clear semantic is one of the most important requirements in designing representational systems. This article indicates how many kinds of informal semantics can be transformed directly into formal semantics of no greater complexity. The author focuses on the meaning rather than on the expression within a particular logical language. The distinction of the meaning of mental components from general ecological meaning is done by the name admissible state semantics, leaving the specification of external meaning to the standard tools of model theory. The method of admissible state semantic is simple, resembling the usual explanations of intended meanings given by system designers. The designer explains the meaning of one representation in terms of its relations to other representation in the system. Examples are given
keywords	logic, languages, representation, systems, semantics
series	CADline
last changed	1999/02/12 15:08

_id	ab23
authors	Dromey, Geoff R.
year	1983
title	Before Programming : On Teaching Introductory Computing
source	1983? 10 p. includes bibliography
summary	In comparison with most other human intellectual activities, computing is in its infancy despite the progress we seem to have made in such a short time. Consequently, there has been insufficient time for the evolution of 'best ways' to transmit computing concepts and skills. It is therefore prudent to look to more mature disciplines for some guidelines on effective ways to introduce computing to beginners. In this respect the discipline of teaching people to read and write in a natural language is highly relevant. A fundamental characteristic of this latter discipline is that a substantial amount of time is devoted to teaching people to read long before they are asked to write stories, essays, etc. In teaching computing people seem to have overlooked or neglected what corresponds to the reading stage in the process of learning to read and write. In the discussion which follows the author looks at ways of economically giving students the 'computer-reading experience' and preparing them for the more difficult tasks of algorithm design and computer problem-solving
keywords	programming, education,
series	CADline
last changed	2003/06/02 13:58

_id	273f
authors	Elcock, E.W.
year	1983
title	How Complete are Knowledge Representation Systems?
source	IEEE Computer. IEEE computer society, October, 1983. vol. 16: pp. 114-118. includes bibliography
summary	Prolog, the most feasible of the first-order logic systems, has intriguing analogies with Absys, short for Aberdeen System, an assertative programming system developed in 1968. In this article, the issue of incompleteness is explored by comparing aspects of the two systems, and the incompleteness resulting from any serious use of Prolog as a vehicle for a knowledge-based system is addressed
keywords	PROLOG, algorithms, knowledge, systems, languages
series	CADline
last changed	2003/06/02 13:58

_id	620a
authors	Galle, Per
year	1983
title	A Theorem Relating to Exhaustive Generation of Floor Plans
source	Bulletin of Computer Aided Architectural Design. May, 1983. pp. 30-33 : ill
summary	Many problems arise in connection with automated design of architectural floor plans. If modular grids are used, one problem is to avoid repeated generation of the same plan on different modular grids. Using the concept of 'modular complexity,' the paper presents and proves a theorem which offers a solution to this problem
keywords	automation, design, planning, architecture, floor plans, grids, search, synthesis
series	CADline
last changed	1999/02/12 15:08

_id	60c5
authors	Gordon, William J.
year	1983
title	An Operator Calculus for Surface and Volume Modeling
source	IEEE Computer Graphics and Applications October, 1983. vol. 3: pp. 18-22 : ill. includes bibliography.
summary	This article briefly describes the mathematical techniques underlying surface and volume modeling techniques in current practice. The first part outlines what might be termed an operator calculus for the approximation and interpolation of functions of more than one independent variable. This operator calculus uses operator multiplication and Boolean addition to compound the linear operators associated with simple bivariate and multivariate interpolation/approximation schemes. The result is a distributive lattice of approximation operators. The other two sections of the article contain specific examples of how this operator calculus leads to practical techniques for sculptured surface and volume modeling
keywords	curved surfaces, representation, solid modeling, boolean operations
series	CADline
last changed	2003/06/02 13:58

_id	a456
authors	Gould, J.D., Conti, J. and Hovanyecz, T.
year	1983
title	Composing Letters with a Simulated Listening Typewriter
source	Communications of the ACM. April, 1983. vol. 26: pp. 295-308 : ill. graphs, tables. includes bibliography
summary	With a listening typewriter, what an author says would be automatically recognized and displayed in front of him or her. However, speech recognition is not yet advanced enough to provide people with a reliable listening typewriter. An aim of the authors' experiments was to determine if an imperfect listening typewriter would be useful for composing letters. Participants dictated letters, either in isolated words or in consecutive word speech. They did this with simulations of listening typewriters that recognized either a limited vocabulary (1000 or 5000 words) or an unlimited vocabulary. Results suggest that some versions, even upon first using them, could be at least as good as traditional methods of handwriting and dictating. Isolated word speech with large vocabularies may provide the basis for a useful listening typewriter
keywords	natural languages, applications, systems, business, AI
series	CADline
last changed	2003/06/02 14:41

_id	sigradi2006_e028c
id	sigradi2006_e028c
authors	Griffith, Kenfield; Sass, Larry and Michaud, Dennis
year	2006
title	A strategy for complex-curved building design:Design structure with Bi-lateral contouring as integrally connected ribs
source	SIGraDi 2006 - [Proceedings of the 10th Iberoamerican Congress of Digital Graphics] Santiago de Chile - Chile 21-23 November 2006, pp. 465-469
summary	Shapes in designs created by architects such as Gehry Partners (Shelden, 2002), Foster and Partners, and Kohn Peterson and Fox rely on computational processes for rationalizing complex geometry for building construction. Rationalization is the reduction of a complete geometric shape into discrete components. Unfortunately, for many architects the rationalization is limited reducing solid models to surfaces or data on spread sheets for contractors to follow. Rationalized models produced by the firms listed above do not offer strategies for construction or digital fabrication. For the physical production of CAD description an alternative to the rationalized description is needed. This paper examines the coupling of digital rationalization and digital fabrication with physical mockups (Rich, 1989). Our aim is to explore complex relationships found in early and mid stage design phases when digital fabrication is used to produce design outcomes. Results of our investigation will aid architects and engineers in addressing the complications found in the translation of design models embedded with precision to constructible geometries. We present an algorithmically based approach to design rationalization that supports physical production as well as surface production of desktop models. Our approach is an alternative to conventional rapid prototyping that builds objects by assembly of laterally sliced contours from a solid model. We explored an improved product description for rapid manufacture as bilateral contouring for structure and panelling for strength (Kolarevic, 2003). Infrastructure typically found within aerospace, automotive, and shipbuilding industries, bilateral contouring is an organized matrix of horizontal and vertical interlocking ribs evenly distributed along a surface. These structures are monocoque and semi-monocoque assemblies composed of structural ribs and skinning attached by rivets and adhesives. Alternative, bi-lateral contouring discussed is an interlocking matrix of plywood strips having integral joinery for assembly. Unlike traditional methods of building representations through malleable materials for creating tangible objects (Friedman, 2002), this approach constructs with the implication for building life-size solutions. Three algorithms are presented as examples of rationalized design production with physical results. The first algorithm [Figure 1] deconstructs an initial 2D curved form into ribbed slices to be assembled through integral connections constructed as part of the rib solution. The second algorithm [Figure 2] deconstructs curved forms of greater complexity. The algorithm walks along the surface extracting surface information along horizontal and vertical axes saving surface information resulting in a ribbed structure of slight double curvature. The final algorithm [Figure 3] is expressed as plug-in software for Rhino that deconstructs a design to components for assembly as rib structures. The plug-in also translates geometries to a flatten position for 2D fabrication. The software demonstrates the full scope of the research exploration. Studies published by Dodgson argued that innovation technology (IvT) (Dodgson, Gann, Salter, 2004) helped in solving projects like the Guggenheim in Bilbao, the leaning Tower of Pisa in Italy, and the Millennium Bridge in London. Similarly, the method discussed in this paper will aid in solving physical production problems with complex building forms. References Bentley, P.J. (Ed.). Evolutionary Design by Computers. Morgan Kaufman Publishers Inc. San Francisco, CA, 1-73 Celani, G, (2004) “From simple to complex: using AutoCAD to build generative design systems” in: L. Caldas and J. Duarte (org.) Implementations issues in generative design systems. First Intl. Conference on Design Computing and Cognition, July 2004 Dodgson M, Gann D.M., Salter A, (2004), “Impact of Innovation Technology on Engineering Problem Solving: Lessons from High Profile Public Projects,” Industrial Dynamics, Innovation and Development, 2004 Dristas, (2004) “Design Operators.” Thesis. Massachusetts Institute of Technology, Cambridge, MA, 2004 Friedman, M, (2002), Gehry Talks: Architecture + Practice, Universe Publishing, New York, NY, 2002 Kolarevic, B, (2003), Architecture in the Digital Age: Design and Manufacturing, Spon Press, London, UK, 2003 Opas J, Bochnick H, Tuomi J, (1994), “Manufacturability Analysis as a Part of CAD/CAM Integration”, Intelligent Systems in Design and Manufacturing, 261-292 Rudolph S, Alber R, (2002), “An Evolutionary Approach to the Inverse Problem in Rule-Based Design Representations”, Artificial Intelligence in Design ’02, 329-350 Rich M, (1989), Digital Mockup, American Institute of Aeronautics and Astronautics, Reston, VA, 1989 Schön, D., The Reflective Practitioner: How Professional Think in Action. Basic Books. 1983 Shelden, D, (2003), “Digital Surface Representation and the Constructability of Gehry’s Architecture.” Diss. Massachusetts Institute of Technology, Cambridge, MA, 2003 Smithers T, Conkie A, Doheny J, Logan B, Millington K, (1989), “Design as Intelligent Behaviour: An AI in Design Thesis Programme”, Artificial Intelligence in Design, 293-334 Smithers T, (2002), “Synthesis in Designing”, Artificial Intelligence in Design ’02, 3-24 Stiny, G, (1977), “Ice-ray: a note on the generation of Chinese lattice designs” Environmental and Planning B, volume 4, pp. 89-98
keywords	Digital fabrication; bilateral contouring; integral connection; complex-curve
series	SIGRADI
email
last changed	2016/03/10 09:52

_id	11b4
authors	Hall, Theodore W.
year	2001
title	2001: An Acadia Odyssey
doi	https://doi.org/10.52842/conf.acadia.2001.006
source	ACADIA Quarterly, vol. 20, pp. 6-7
summary	ACADIA marked the dawn of its third decade last October, at its 21st annual conference, the 20th anniversary of its birth. If the numbers seem inconsistent at first, recall that the association was born at its 1st conference, its 0th anniversary, in 1981. Of the twenty-four founding members, only a few are still active. I joined at the third conference, in 1983, and I’ve never met half the founders. Perhaps they never expected the association to last two years, let alone two decades. In the meantime, an entire generation has come of age and begun to take the reins. ACADIA is alive and well, thank you very much.
series	ACADIA
email
last changed	2022/06/07 07:50

For more results click below: