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 2687

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

_id	4580
authors	Borgerson, B. R. and Johnson, Robert H.
year	1980
title	Beyond CAD to Computer Aided Engineering
source	(8) p. : ill. Manufacturing Data Systems Incorporated, 1980? includes bibliography
summary	Current CAD systems significantly aid the drafting function and many provide some aid to selected design activities. For the development of mechanical systems, much more can be done. Future systems will aid the interactive engineering process of design, analysis, control, documentation, and manufacturing engineering. Computer based systems which address this broader spectrum of engineering activities are referred to as `Computer Aided Engineering,' or `CAE,' systems. CAE systems will use volumetric techniques to create and evaluate the individual components of a machine design in conjunction with data base management schemas to support the interrelationships of the components of machines. This paper focuses on computer assistance to the engineering of mechanical systems
keywords	mechanical engineering, CAE, solid modeling, objects
series	CADline
last changed	2003/06/02 13:58

_id	ddss2004_ra-33
id	ddss2004_ra-33
authors	Diappi, L., P. Bolchim, and M. Buscema
year	2004
title	Improved Understanding of Urban Sprawl Using Neural Networks
source	Van Leeuwen, J.P. and H.J.P. Timmermans (eds.) Recent Advances in Design & Decision Support Systems in Architecture and Urban Planning, Dordrecht: Kluwer Academic Publishers, ISBN: 14020-2408-8, p. 33-49
summary	It is widely accepted that the spatial pattern of settlements is a crucial factor affecting quality of life and environmental sustainability, but few recent studies have attempted to examine the phenomenon of sprawl by modelling the process rather than adopting a descriptive approach. The issue was partly addressed by models of land use and transportation which were mainly developed in the UK and US in the 1970s and 1980s, but the major advances were made in the area of modelling transportation, while very little was achieved in the area of spatial and temporal land use. Models of land use and transportation are well-established tools, based on explicit, exogenouslyformulated rules within a theoretical framework. The new approaches of artificial intelligence, and in particular, systems involving parallel processing, (Neural Networks, Cellular Automata and Multi-Agent Systems) defined by the expression “Neurocomputing”, allow problems to be approached in the reverse, bottom-up, direction by discovering rules, relationships and scenarios from a database. In this article we examine the hypothesis that territorial micro-transformations occur according to a local logic, i.e. according to use, accessibility, the presence of services and conditions of centrality, periphericity or isolation of each territorial “cell” relative to its surroundings. The prediction capabilities of different architectures of supervised Neural networks are implemented to the south Metropolitan area of Milan at two different temporal thresholds and discussed. Starting from data on land use in 1980 and 1994 and by subdividing the area into square cells on an orthogonal grid, the model produces a spatial and functional map of urbanisation in 2008. An implementation of the SOM (Self Organizing Map) processing to the Data Base allows the typologies of transformation to be identified, i.e. the classes of area which are transformed in the same way and which give rise to territorial morphologies; this is an interesting by-product of the approach.
keywords	Neural Networks, Self-Organizing Maps, Land-Use Dynamics, Supervised Networks
series	DDSS
last changed	2004/07/03 22:13

_id	ddss2006-hb-187
id	DDSS2006-HB-187
authors	Lidia Diappi and Paola Bolchi
year	2006
title	Gentrification Waves in the Inner-City of Milan - A multi agent / cellular automata model based on Smith's Rent Gap theory
source	Van Leeuwen, J.P. and H.J.P. Timmermans (eds.) 2006, Innovations in Design & Decision Support Systems in Architecture and Urban Planning, Dordrecht: Springer, ISBN-10: 1-4020-5059-3, ISBN-13: 978-1-4020-5059-6, p. 187-201
summary	The aim of this paper is to investigate the gentrification process by applying an urban spatial model of gentrification, based on Smith's (1979; 1987; 1996) Rent Gap theory. The rich sociological literature on the topic mainly assumes gentrification to be a cultural phenomenon, namely the result of a demand pressure of the suburban middle and upper class, willing to return to the city (Ley, 1980; Lipton, 1977, May, 1996). Little attempt has been made to investigate and build a sound economic explanation on the causes of the process. The Rent Gap theory (RGT) of Neil Smith still represents an important contribution in this direction. At the heart of Smith's argument there is the assumption that gentrification takes place because capitals return to the inner city, creating opportunities for residential relocation and profit. This paper illustrates a dynamic model of Smith's theory through a multi-agent/ cellular automata system approach (Batty, 2005) developed on a Netlogo platform. A set of behavioural rules for each agent involved (homeowner, landlord, tenant and developer, and the passive 'dwelling' agent with their rent and level of decay) are formalised. The simulations show the surge of neighbouring degradation or renovation and population turn over, starting with different initial states of decay and estate rent values. Consistent with a Self Organized Criticality approach, the model shows that non linear interactions at local level may produce different configurations of the system at macro level. This paper represents a further development of a previous version of the model (Diappi, Bolchi, 2005). The model proposed here includes some more realistic factors inspired by the features of housing market dynamics in the city of Milan. It includes the shape of the potential rent according to city form and functions, the subdivision in areal submarkets according to the current rents, and their maintenance levels. The model has a more realistic visualisation of the city and its form, and is able to show the different dynamics of the emergent neighbourhoods in the last ten years in Milan.
keywords	Multi agent systems, Housing market, Gentrification, Emergent systems
series	DDSS
last changed	2006/08/29 12:55

_id	a9d9
authors	Rosenthal, David S.H.
year	1980
title	Tools for Constructing User Interfaces
source	1980? 11 p. includes bibliography
summary	A review of the tools available for easing the tasks of constructing and modifying the user interface of CAD application programs
keywords	user interface, programming, tools, CAD
series	CADline
last changed	2003/06/02 13:58

_id	7a2a
authors	Minsky, M.
year	1975
title	A framework for representing knowledge
source	P.H. Winston (ed.), The Psychology of Computer Vision, McGraw-Hill, New York, pp. 211-277
summary	Briefly describes frame systems as a formalism for representing knowledge and then concentrates on the issue of what the content of knowledge should be in specific domains. Argues that vision should be viewed symbolically with an emphasis on forming expectations and then using details to fill in slots in those expectations. Discusses the enormous problem of the volume of background common sense knowledge required to understand even very simple natural language texts and suggests that networks of frames are a reasonable approach to represent such knowledge. Discusses the concept of expectation further including ways to adapt to and understand expectation failures. Argues that numerical approaches to knowledge representation are inherently limited.
series	other
email
last changed	2003/04/23 15:14

_id	0830
authors	Ball, A. A.
year	1980
title	How to Make the Bicubic Patch Work Using Reparametrisation
source	1980 ? 11 p. includes bibliography
summary	This paper comprises a series of examples in numerical surface definition, loosely strung together, to show the practical limitations of the bicubic patch and how they can be overcome by reparametrisation. The concept of reparametrisation is more general than that used in computer- aided geometric design insofar as the reparametrisation is modeled in addition to the basic parametric equation
keywords	CAD, computational geometry, curved surfaces, parametrization
series	CADline
last changed	2003/06/02 13:58

_id	2fdd
authors	Barsky, Brian A. and Thomas, Spencer W.
year	1980
title	Transpline Curve Representation System
source	April, 1980. 19 p. : ill. includes bibliography
summary	An interactive curve representation system has been developed based on the concept of transforming among several parametric spline curve formulations. The available formulations are the interpolatory spline, uniform B-spline, spline under tension, and NU-spline. The system implementation is described in the context of a sample design session
keywords	computational geometry, curves, representation, splines
series	CADline
last changed	2003/06/02 13:58

_id	a24e
authors	Barstow, David R.
year	1980
title	Knowledge Based Program Construction
source	The Computer Science Library, 34 p.
summary	Some aspects of the implementation of the reachability algorithm are presented.
keywords	Knowledge Base, Programming, Graphs, LISP
series	CADline
last changed	1999/02/15 14:58

_id	8a27
authors	Bentley, Jon L. and Carruthers, Wendy
year	1980
title	Algorithms for Testing the Inclusion of Points in Polygons
source	Allertorn Conference on Communication, Control and Computing (18th : 1980). (10) p. includes bibliography
summary	Determining whether a given point lies inside or outside a simple polygon is an important problem in many applications, including computer vision systems and computer-assisted political redistricting systems. In this paper the authors give algorithms for inclusion problems that are efficient for polygons that are 'close to convex' in a certain precise sense. An empirical study of polygons that arise in several applications shows that typical polygons are indeed 'close to convex,' and a program implementing the algorithm shows that is extremely efficient on point sets of practical sizes
keywords	point inclusion, polygons, algorithms, computational geometry
series	CADline
last changed	2003/06/02 13:58

_id	8593
authors	Braid, I.C.
year	1980
title	Superficial Blends in Geometric Modelling
source	12 p. : ill. February, 1980. Document No. 105. includes bibliography
summary	In engineering practice, many blended surfaces are both indicated and manufactured by rounding off a sharp edge. The authors term them `superficial' blends in contrast to `designed' blends for which existing surface techniques are appropriate. The provision of superficial blends in a geometric modeling system is explained, and a method is given for drawing objects containing blended edges
keywords	geometric modeling, CAD, representation, solids
series	CADline
last changed	2003/06/02 13:58

_id	0189
authors	Brodlie, K.W. (editor)
year	1980
title	Mathematical Methods in Computer Graphics and Design
source	xi, 147 p. : ill. New York: Academic Press, 1980. includes subject index
summary	Based on the proceeding of the conference on mathematical methods in computer graphics and design, organized by the Institute of Mathematics and Its Applications and held at the university of Leicester on september 28th, 1978
keywords	algorithms, geometric modeling, techniques, computer graphics, mathematics
series	CADline
last changed	2003/06/02 13:58

_id	cff2
authors	Callen, John N.
year	1980
title	Man-Machine Interfaces and their Constraints within Interactive CAD
source	June, 1980. 18, [16] p. includes bibliography
summary	As CAD systems becomes more widely accepted in the design environment, the interaction between the designer and the system as supported by interfaces should be analyzed to insure the most natural means of communication. The purpose of this paper is to present various inherent constraints in users, CAD software/hardware and in the design process so that designers of CAD systems could more clearly recognize these constraints and produce a more suitable interface design
keywords	CAD, user interface, design, constraints
series	CADline
last changed	2003/06/02 10:24

_id	e952
authors	Carrara, Gianfranco and Paoluzzi, Alberto
year	1980
title	A Systems Approach to Building Program Planning
source	computer Aided Building Design Laboratory Research Report. 80 p. : ill. Rome, Italy: December, 1980. CABD LAB RR. 80-02. includes bibliography
summary	In this paper problems of design performance and of building program planning are considered from the view point of the general system theory. After having formalized the concept of requirement, performance and performance specification, it is shown that a set of building objects (spaces and constructive elements) foreseeable within a program is a semilattice, and that therefore the ordering of constructive elements and spaces corresponds to an ordering of relations among feasible 'behaviors.' A set of feasible behaviors is then presented as an abstract system, eventually discussing some assumptions on which to base an input-state-output representation of it
keywords	theory, methods, problem solving, architecture, design, knowledge
series	CADline
last changed	2003/06/02 13:58

_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	e49f
authors	Freeman, Herbert (editor)
year	1980
title	Interactive Computer Graphics : Tutorial and Selected Reading
source	COMPCON 80. proceedings February 1980. ix, 415 p. : ill.
summary	New York: IEEE computer society, includes bibliography: p. 407-409. 44 articles relating to computer graphics: Computer graphic proper, computer image processing, computer-aided design and display system technology. They reflect both historical development and the current
keywords	algorithms, computer graphics, CAD, technology
series	CADline
last changed	2003/06/02 13:58

_id	c46e
authors	Fuchs, H., Kedem, Z.M. and Naylor, B.F.
year	1980
title	On Visible Surface Generation by a Priori Tree Structures
source	SIGGRAPH '80 Conference Proceedings. July, 1980. vol. 14 ; no. 3: pp. 124-133 : ill. includes bibliography
summary	This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3-D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static. It is attempted to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a 'binary space partitioning' tree whose inorder traversal of visibility priority at run-time will produce a linear order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surface problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be sufficient to solve completely the hidden surface problem
keywords	hidden lines, hidden surfaces, algorithms, computer graphics, polygons
series	CADline
last changed	2003/06/02 14:42

_id	0a4c
authors	Holt, R.C. and Hume, J.N.P.
year	1980
title	Programming Standard PASCAL
source	x, 381 p. Reston, Verginia: Reston Publishing Company, Inc., 1980. includes index
summary	A comprehensive look at data structures, records, files, pointers and more, for effective programming using PASCAL. A practical guide book from an introduction level through advanced coverage of numerical methods, assembly language programming and compiler construction
keywords	PASCAL, programming, languages, education
series	CADline
last changed	2003/06/02 13:58

_id	c3f4
authors	Joy, William
year	1980
title	An Introduction to Display Editing with VI
source	September, 1980. 30 p
summary	VI (Visual) is a display oriented interactive text editor. When using VI the screen of the terminal acts as a window into the file which is being editing. Changes which made to the file are reflected in what is seen. Using VI the user can insert new text any place in the file quite easily. Most of the commands to VI move the cursor around in the file. There are commands to move the cursor forward and backward in units of characters, words, sentences and paragraphs. A small set of operators, like d for delete and c for change, are combined with the motion commands to form operations such as delete word or change paragraph, in a simple and natural way. This regularity and the mnemonic assignment of commands to keys makes the editor command set easy to remember and to use. VI works on a large number of display terminals, and new terminals are easily driven after editing a terminal description file. While it is advantageous to have an intelligent terminal which can locally insert and delete lines and characters from the display, the editor will function quite well on dumb terminals over slow phone lines. The editor makes allowances for the low bandwidth in these situations and uses smaller window sizes and different display updating algorithms to make best use of the limited speed available. It is also possible to use the command set of VI on hardcopy terminals, storage tubes and 'glass ty's' using a one line editing window; thus VI's command set is available on all terminals. The full command set of the more traditional, line oriented editor ED is available within VI; it is quite simple to switch between the two modes of editing
keywords	UNIX, display, word processing, software
series	CADline
last changed	1999/02/12 15:08

_id	67c9
authors	Lipski, Witold Jr. and Preparata, Franco P.
year	1980
title	Finding the Contour of a Union of Iso-Oriented Rectangles
source	Journal of Algorithms. Academic Press Inc., January, 1980. pp. 235-246 : some ill. a short bibliography
summary	In this paper the following geometric problem is considered. Let R1,...,Rm be rectangles on the plane with sides parallel to the coordinate axes. An algorithm is described for finding the contour of F = R1, U...U Rm, in O(m log m+p log(2m2/p)) time, where p is the number of edges in the contour. This is O(m2) in the general case, and o(m log m) when F is without holes (then p < 8m - 4); both of these performances are optimal
keywords	rectangles, geometry, computational geometry, algorithms
series	CADline
last changed	2003/06/02 10:24

_id	caadria2014_102
id	caadria2014_102
authors	Lopes, João V.; Alexandra C. Paio and José P. Sousa
year	2014
title	Parametric Urban Models Based on Frei Otto’s Generative Form-Finding Processes
doi	https://doi.org/10.52842/conf.caadria.2014.595
source	Rethinking Comprehensive Design: Speculative Counterculture, Proceedings of the 19th International Conference on Computer-Aided Architectural Design Research in Asia (CAADRIA 2014) / Kyoto 14-16 May 2014, pp. 595–604
summary	Presently there is a progressive tendency to incorporate parametric design strategies in urban planning and design. Although the computational technologies that allow it are recent, fundamental theories and thinking processes behind it can be traced back to the work conducted at the Institute for Lightweight Structures (IL) in Stuttgart, between the 1960’s and 1980’s. This paper describes an experimental urban research work based on Frei Otto and Eda Schaur's thoughts on unplanned settlements, and on the form-finding experiences carried out at IL. By exploring the digital development of parametric and algorithmic interactive models, two urban design proposals were developed for a site in Porto city. Out of this experience, this paper suggests that today the act of design can benefit from a deeper understanding of the natural processes of occupation and connection.
keywords	Parametric urbanism; generative design; form-finding; Frei Otto
series	CAADRIA
email
last changed	2022/06/07 07:59

For more results click below: