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 77

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

_id	5509
authors	Koutamanis, Alexandros
year	1990
title	Development of a computerized handbook of architectural plans
source	Delft University of Technology
summary	The dissertation investigates an approach to the development of visual / spatial computer representations for architectural purposes through the development of the computerized handbook of architectural plans (chap), a knowledge-based computer system capable of recognizing the metric properties of architectural plans. This investigation can be summarized as an introduction of computer vision to the computerization of architectural representations: chap represents an attempt to automate recognition of the most essential among conventional architectural drawings, floor plans. The system accepts as input digitized images of architectural plans and recognizes their spatial primitives (locations) and their spatial articulation on a variety of abstraction levels. The final output of chap is a description of the plan in terms of the grouping formations detected in its spatial articulation. The overall structure of the description is based on an analysis of its conformity to the formal rules of its “stylistic” context (which in the initial version of chap is classical architecture). Chapter 1 suggests that the poor performance of computerized architectural drawing and design systems is among others evidence of the necessity to computerize visual / spatial architectural representations. A recognition system such as chap offers comprehensive means for the investigation of a methodology for the development and use of such representations. Chapter 2 describes a fundamental task of chap: recognition of the position and shape of locations, the atomic parts of the description of an architectural plan in chap. This operation represents the final and most significant part of the first stage in processing an image input in machine environment. Chapter 3 moves to the next significant problem, recognition of the spatial arrangement of locations in an architectural plan, that is, recognition of grouping relationships that determine the subdivision of a plan into parts. In the absence of systematic and exhaustive typologic studies of classical architecture that would allow us to define a repertory of the location group types possible in classical architectural plans, Chapter 3 follows a bottom-up approach based on grouping relationships derived from elementary architectural knowledge and formalized with assistance from Gestalt theory and its antecedents. The grouping process described in Chapter 3 corresponds both in purpose and in structure to the derivation of a description of an image in computer vision [Marr 1982]. Chapter 4 investigates the well-formedness of the description of a classical architectural plan in an analytical manner: each relevant level (or sublevel) of the classical canon according to Tzonis & Lefaivre [1986] is transformed into a single group of criteria of well-formedness which is investigated independently. The hierarchical structure of the classical canon determines the coordination of these criteria into a sequence of cognitive filters which progressively analyses the correspondence of the descriptions derived as in Chapter 3 to the constraints of the canon. The methodology and techniques presented in the dissertation are primarily considered with respect to chap, a specific recognition system. The resulting specification of chap gives a measure of the use of such a system within the context of a computerized collection of architectural precedents and also presents several extensions to other areas of architecture. Although these extensions are not considered as verifiable claims, Chapter 5 describes some of their implications, including on the role of architectural drawing in computerized design systems, on architectural typologies, and on the nature and structure of generative systems in architecture.
series	thesis:PhD
email
last changed	2003/02/12 22:37

_id	233c
authors	Udupa, Jayaram K., Srihari, Sargur N. and Herman, Gabor T.
year	1982
title	Boundary Detection in Multidimensions
source	IEEE Transactions on Pattern Analysis and Machine Intelligence. January, 1982. vol. PAM-4: pp. 41-50 : ill. includes bibliography
summary	The development of image processing algorithms for time varying imagery and computerized tomography data calls for generalization of the concepts of adjacency, connectivity, boundary, etc. to three and four dimensional discrete spaces. This paper defines these basic concepts in unified terminology and presents algorithms for a boundary detection task in multidimensional space. The performance of these algorithms is discussed with respect to theoretical maximum complexity, and is illustrated with simulated computerized tomography data
keywords	algorithms, image processing, performance, applications
series	CADline
last changed	2003/06/02 13:58

_id	452c
authors	Vanier, D. J. and Worling, Jamie
year	1986
title	Three-dimensional Visualization: A Case Study
source	Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 92-102
summary	Three-dimensional computer visualization has intrigued both building designers and computer scientists for decades. Research and conference papers present an extensive list of existing and potential uses for threedimensional geometric data for the building industry (Baer et al., 1979). Early studies on visualization include urban planning (Rogers, 1980), treeshading simulation (Schiler and Greenberg, 1980), sun studies (Anon, 1984), finite element analysis (Proulx, 1983), and facade texture rendering (Nizzolese, 1980). With the advent of better interfaces, faster computer processing speeds and better application packages, there had been interest on the part of both researchers and practitioners in three-dimensional -models for energy analysis (Pittman and Greenberg, 1980), modelling with transparencies (Hebert, 1982), super-realistic rendering (Greenberg, 1984), visual impact (Bridges, 1983), interference clash checking (Trickett, 1980), and complex object visualization (Haward, 1984). The Division of Building Research is currently investigating the application of geometric modelling in the building delivery process using sophisticated software (Evans, 1985). The first stage of the project (Vanier, 1985), a feasibility study, deals with the aesthetics of the mode. It identifies two significant requirements for geometric modelling systems: the need for a comprehensive data structure and the requirement for realistic accuracies and tolerances. This chapter presents the results of the second phase of this geometric modelling project, which is the construction of 'working' and 'presentation' models for a building.
series	CAAD Futures
email
last changed	2003/05/16 20:58

_id	666c
authors	Clark, K. and Tarnlund, S. (eds.)
year	1982
title	Logic Programming
source	366 p
summary	Orlando, Florida: Academic Press,Inc., 1982. includes bibliography and index p. [341]-361. Based on the proceedings of the first international workshop on logic programming held in Debrecen, Hungry. ( A.P.I.C. Studies in Data Processing No.16). The 23 papers cover issues like application of logic programming, implementation, control, and understanding natural languages
keywords	techniques, programming, logic, languages, symbolic, AI
series	CADline
last changed	2002/12/13 15:23

_id	sigradi2006_e183a
id	sigradi2006_e183a
authors	Costa Couceiro, Mauro
year	2006
title	La Arquitectura como Extensión Fenotípica Humana - Un Acercamiento Basado en Análisis Computacionales [Architecture as human phenotypic extension – An approach based on computational explorations]
source	SIGraDi 2006 - [Proceedings of the 10th Iberoamerican Congress of Digital Graphics] Santiago de Chile - Chile 21-23 November 2006, pp. 56-60
summary	The study describes some of the aspects tackled within a current Ph.D. research where architectural applications of constructive, structural and organization processes existing in biological systems are considered. The present information processing capacity of computers and the specific software development have allowed creating a bridge between two holistic nature disciplines: architecture and biology. The crossover between those disciplines entails a methodological paradigm change towards a new one based on the dynamical aspects of forms and compositions. Recent studies about artificial-natural intelligence (Hawkins, 2004) and developmental-evolutionary biology (Maturana, 2004) have added fundamental knowledge about the role of the analogy in the creative process and the relationship between forms and functions. The dimensions and restrictions of the Evo-Devo concepts are analyzed, developed and tested by software that combines parametric geometries, L-systems (Lindenmayer, 1990), shape-grammars (Stiny and Gips, 1971) and evolutionary algorithms (Holland, 1975) as a way of testing new architectural solutions within computable environments. It is pondered Lamarck´s (1744-1829) and Weismann (1834-1914) theoretical approaches to evolution where can be found significant opposing views. Lamarck´s theory assumes that an individual effort towards a specific evolutionary goal can cause change to descendents. On the other hand, Weismann defended that the germ cells are not affected by anything the body learns or any ability it acquires during its life, and cannot pass this information on to the next generation; this is called the Weismann barrier. Lamarck’s widely rejected theory has recently found a new place in artificial and natural intelligence researches as a valid explanation to some aspects of the human knowledge evolution phenomena, that is, the deliberate change of paradigms in the intentional research of solutions. As well as the analogy between genetics and architecture (Estévez and Shu, 2000) is useful in order to understand and program emergent complexity phenomena (Hopfield, 1982) for architectural solutions, also the consideration of architecture as a product of a human extended phenotype can help us to understand better its cultural dimension.
keywords	evolutionary computation; genetic architectures; artificial/natural intelligence
series	SIGRADI
email
last changed	2016/03/10 09:49

_id	8c27
authors	Kalay, Yehuda E.
year	1982
title	Determining the Spatial Containment of a Point in General Polyhedra
source	Computer graphics and Image Processing. 1982. vol. 19: pp. 303-334 : ill. includes bibliography. See also criticism and improvements in Orlowski, Marian
summary	Determining the inclusion of a point in volume-enclosing polyhedra (shapes) in 3D space is, in principle, the extension of the well-known problem of determining the inclusion of a point in a polygon in 2D space. However, the extra degree of freedom makes 3D point-polyhedron containment analysis much more difficult to solve than the 2D point polygon problem, mainly because of the nonsequential ordering of the shape elements, which requires global shape data to be applied for resolving special cases. Two general O(n) algorithms for solving the problem by reducing the 3D case into the solvable 2D case are presented. The first algorithm, denoted 'the projection method,' is applicable to any planar- faced polyhedron, reducing the dimensionality by employing parallel projection to generate planar images of the shape faces, together with an image of the point being tested for inclusion. The containment relationship of these images is used to increment a global parity-counter when appropriate, representing an abstraction for counting the intersections between the surface of the shape and a halfline extending from the point to infinity. An 'inside' relationship is established when the parity-count is odd. Special cases (coincidence of the halfline with edges or vertices of the shape) are resolved by eliminating the coincidental elements and re-projecting the merged faces. The second algorithm, denoted 'the intersection method,' is applicable to any well- formed shape, including curved-surfaced ones. It reduces the dimensionality by intersecting the polygonal trace of the shape surface at the plane of intersection, which is tested for containing the trace of the point in the plane, directly establishing the overall 3D containment relationship. A particular O(n) implementation of the 2D point-in-polygon inclusion algorithm, which is used for solving the problem once reduced in dimensionality, is also presented. The presentation is complemented by discussions of the problems associated with point-polyhedron relationship determination in general, and comparative analysis of the two particular algorithms presented
keywords	geometric modeling, point inclusion, polygons, polyhedra, computational geometry, algorithms, search, B-rep
series	CADline
email
last changed	2003/06/02 10:24

_id	fafa
authors	Marr, David
year	1982
title	Vision: A Computational Investigation into the Human Representation and Processing of Visual Information
source	New York, NY: W.H. Freeman and Company
summary	Marr's demonstrations that retinal receptive field geometry could be derived by Fourier transformation of spatial frequency sensitivity data, that edges and contours could be detected by finding zero crossings in the light gradient by taking the Laplacian or second directional derivative, that excitatory and inhibitory receptive fields could be constructed from "DOG" functions (the difference of two Gaussians), and that the visual system used a two-dimensional convolution integral with a Gaussian prefilter as an operator for bandwidth optimation on the retinal light distribution, were more powerful than anything that had been seen up to that time. It was as if vision research suddenly acquired its own Principia Mathematica, or perhaps General Relativity Theory, in terms of the new explanatory power Marr's theories provided. Truly an extraordinary book from an extraordinary thinker in the area of perception, vision, and the brain.
series	other
last changed	2003/04/23 15:14

_id	0c01
authors	Minsky, Marvin (editor)
year	1982
title	Semantic Information Processing
source	viii, 438 p. : ill. Cambridge, Mass.: the MIT Press, 1982, [c1968]. includes bibliography.--- 3rd. printing
summary	Most of the chapters are slightly edited Ph.D thesis directed toward making intelligent machines. Each solves different problems like resolving ambiguities in word meanings, finding analogies between things, making logical and nonlogical inference, resolving inconsistency in information engaging in coherent discourse with a person and more
keywords	perception, AI, reasoning, semantics
series	CADline
last changed	2003/06/02 13:58

_id	611a
authors	Newell, Allen
year	1982
title	The Knowledge Level
source	[2]. 46 p. : ill. Design Research Center, CMU, April, 1982. DRC-15-15-82. includes bibliography
summary	As the first AAAI Presidential Address, this paper focuses on a basic substantive problem: the nature of knowledge and representation. There are ample indications that artificial intelligence is in need of substantial work in this area, e.g., a recent SIGART special issue on Knowledge Representation edited by Ron Brachman and Brian Smith. The paper proposes a theory of the nature of knowledge, namely, that there is another computer system level immediately above the symbol (or program) level. The nature of computer system levels is reviewed, the new level proposed, and its definition is treated in detail. Knowledge itself is the processing medium at this level and the principle of rationality plays a central role. Some consequences of the existence of the knowledge level and some relations to other fields are discussed
keywords	knowledge, representation, AI
series	CADline
last changed	1999/02/12 15:09

_id	2243
authors	O'Rourke, J., Chien, C.-B. and Olson, Th. (et al)
year	1982
title	A New Linear Algorithm for Intersecting Convex Polygons
source	Computer Graphics and Image Processing. 1982. vol. 19: pp. 384-391 : ill. includes a short bibliography
summary	An algorithm is presented that computes the intersection of two convex polygons in linear time. The algorithm is fundamentally different from the only known linear algorithms for this problem, due to Shamos and to Hoey. These algorithms depend on a division of the plane into either angular sectors (Shamos) or parallel slabs (Hoey), and are mildly complex. The authors' algorithm searches for the intersection points of the polygons by advancing a single pointer around each polygon, and is very easy to program
keywords	algorithms, boolean operations, polygons, intersection, search
series	CADline
last changed	2003/06/02 14:42

_id	2786
authors	Woodwark, J.R.
year	1989
title	Splitting Set-Theoretic Solid Models into Connected Components
source	10 p. : ill. Winchester: IBM UK Scientific Center, IBM United Kingdom Laboratories Limited, June, 1989. IBM UKSC 210. includes bibliography In general, there is no way to tell how many pieces (connected components) a set-theoretic (CSG) solid model represents, except via conversion to a boundary model. Recent work on the elimination of redundant primitives has been linked with techniques for identifying connected components in quad-trees and oct-trees into a strategy to attack this problem. Some success has been achieved, and an experimental Prolog program, working in two dimensions, that finds connected components and determines the set-theoretic representation of each component, is reported, and further developments proposed. CSG / quadtree / octree / primitives / algorithms. 43. Woodwark, J. R. and Quinlan K. M. 'Reducing the Effect of Complexity on Volume Model Evaluation.' Computer Aided Design. April, 1982. pp. 89-95 : ill. includes bibliography.
summary	A major problem with volume modelling systems is that processing times may increase with model complexity in a worse than linear fashion. The authors have addressed this problem, for picture generation, by repeatedly dividing the space occupied by a model, and evaluating the sub-models created only when they meet a criterion of simplicity. Hidden surface elimination has been integrated with evaluation, in such a way that major portions of the model which are not visible are never evaluated. An example demonstrates a better than linear relationship between model complexity and computation time, and also shows the effect of picture complexity on the performance of the process
keywords	CAD, computational geometry, solid modeling, geometric modeling, algorithms, hidden surfaces, CSG
series	CADline
last changed	2003/06/02 13:58

_id	1b10
id	1b10
authors	Bay, Joo-Hwa
year	2001
title	Cognitive Biases - The case of tropical architecture
source	Delft University of Technology
summary	This dissertation investigates, i) How cognitive biases (or illusions) may lead to errors in design thinking, ii) Why architects use architectural precedents as heuristics despite such possible errors, and iii) Develops a design tool that can overcome this type of errors through the introduction of a rebuttal mechanism. The mechanism controls biases and improves accuracy in architectural thinking. // The research method applied is interdisciplinary. It employs knowledge from cognitive science, environmental engineering, and architectural theory. The case study approach is also used. The investigation is made in the case of tropical architecture. The investigation of architectural biases draws from work by A. Tversky and D. Kahneman in 1982 on “Heuristics and biases”. According to Tversky and Kahneman, the use of heuristics of representativeness (based on similarity) and availability (based on ease of recall and imaginability) for judgement of probability can result in cognitive biases of illusions of validity and biases due to imaginability respectively. This theory can be used analogically to understand how errors arise in the judgement of environmental behaviour anticipated from various spatial configurations, leading to designs with dysfunctional performances when built. Incomplete information, limited time, and human mental resources make design thinking in practice difficult and impossible to solve. It is not possible to analyse all possible alternative solutions, multiple contingencies, and multiple conflicting demands, as doing so will lead to combinatorial explosion. One of the ways to cope with the difficult design problem is to use precedents as heuristic devices, as shortcuts in design thinking, and at the risk of errors. This is done with analogical, pre-parametric, and qualitative means of thinking, without quantitative calculations. Heuristics can be efficient and reasonably effective, but may not always be good enough or even correct, because they can have associated cognitive biases that lead to errors. Several debiasing strategies are discussed, and one possibility is to introduce a rebuttal mechanism to refocus the designer’s thinking on the negative and opposite outcomes in his judgements, in order to debias these illusions. The research is carried out within the framework of design theory developed by the Design Knowledge System Research Centre, TUDelft. This strategy is tested with an experiment. The results show that the introduction of a rebuttal mechanism can debias and improve design judgements substantially in environmental control. The tool developed has possible applications in design practice and education, and in particular, in the designing of sustainable environments.
keywords	Design bias; Design knowledge; Design rebuttal; Design Precedent; Pre-parametric design; Tropical architecture; Sustainability
series	thesis:PhD
type	normal paper
email
last changed	2006/05/28 07:42

_id	eabb
authors	Boeykens, St. Geebelen, B. and Neuckermans, H.
year	2002
title	Design phase transitions in object-oriented modeling of architecture
source	Connecting the Real and the Virtual - design e-ducation [20th eCAADe Conference Proceedings / ISBN 0-9541183-0-8] Warsaw (Poland) 18-20 September 2002, pp. 310-313
doi	https://doi.org/10.52842/conf.ecaade.2002.310
summary	The project IDEA+ aims to develop an “Integrated Design Environment for Architecture”. Its goal is providing a tool for the designer-architect that can be of assistance in the early-design phases. It should provide the possibility to perform tests (like heat or cost calculations) and simple simulations in the different (early) design phases, without the need for a fully detailed design or remodeling in a different application. The test for daylighting is already in development (Geebelen, to be published). The conceptual foundation for this design environment has been laid out in a scheme in which different design phases and scales are defined, together with appropriate tests at the different levels (Neuckermans, 1992). It is a translation of the “designerly” way of thinking of the architect (Cross, 1982). This conceptual model has been translated into a “Core Object Model” (Hendricx, 2000), which defines a structured object model to describe the necessary building model. These developments form the theoretical basis for the implementation of IDEA+ (both the data structure & prototype software), which is currently in progress. The research project addresses some issues, which are at the forefront of the architect’s interest while designing with CAAD. These are treated from the point of view of a practicing architect.
series	eCAADe
email
last changed	2022/06/07 07:52

_id	8239
authors	Campello, Ruy Eduardo and Maculan, Nelson
year	1982
title	On Deep Disjunctive Cutting Planes for Set Partitioning : A Computationally Oriented Research.
source	Pittsburgh: Design Research Center, CMU [DRC-70-11-82], 10 p.
summary	Several mathematical programming problems can be formulated as Disjunctive Programming Problems. This approach offers a powerful procedure for the generation of new and strong cutting planes with desirable properties. For general integer programs, the traditional cutting plane methodologies proved less efficient than enumerative techniques. However, for certain classes of problems, such as set partitioning, cutting planes are known to be efficient. Since the disjunctive cuts are strong, they can be expected to perform better. This paper reports on computational results with disjunctive B(.) cuts for the set partitioning problem, evaluated in terms of computer resources and other independent measures in solving specific randomly generated test problems under controlled conditions. [includes bibliography].
keywords	Mathematics, Operations Research, Integer Programming, Optimization
series	CADline
last changed	1999/02/15 15:17

_id	e5c4
authors	Johnson-Laird
year	1983
title	Mental Models
source	Cambridge, MA: Harvard University Press
summary	As psychological representations of real, hypothetical, or imaginary situations, mental models were first postulated by the Scottish psychologist Kenneth Craik (1943), who wrote that the mind constructs "small-scale models" of reality to anticipate events, to reason, and to underlie . The models are constructed in working memory as a result of perception, the comprehension of discourse, or imagination (see 1982; Johnson-Laird 1983). A crucial feature is that their structure corresponds to the structure of what they represent. Mental models are accordingly akin to architects' models of buildings and to chemists' models of complex molecules.
series	other
last changed	2003/04/23 15:50

_id	ab39
authors	Kutay, Ali R.
year	1982
title	Abstractions and Transactions : A Solution for Structuring Complex Applications
source	March, 1982. [1] l, 14 p. includes bibliography
summary	In database systems when large applications are supported, their representation becomes a problem. A proposed model is to use the transaction concept and structure a large application as a nested transaction. This paper proposes to take advantage of abstraction techniques to avoid problems related to nested transactions. It first reviews the transition concept and restates the shortcomings. It then briefly states the available abstraction techniques in databases. It proposes to integrate transactions with abstraction levels and provide communication between the transactions instead of nesting them. It is argued that such a solution presents a better structure for applications and possible integration with abstract data types
keywords	abstraction, relational database, building
series	CADline
last changed	2003/06/02 13:58

_id	c361
authors	Logan, Brian S.
year	1986
title	Representing the Structure of Design Problems
source	Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 158-170
summary	In recent years several experimental CAD systems have emerged which, focus specifically on the structure of design problems rather than on solution generation or appraisal (Sussman and Steele, 1980; McCallum, 1982). However, the development of these systems has been hampered by the lack of an adequate theoretical basis. There is little or no argument as to what the statements comprising these models actually mean, or on the types of operations that should be provided. This chapter describes an attempt to develop a semantically adequate basis for a model of the structure of design problems and presents a representation of this model in formal logic.
series	CAAD Futures
last changed	1999/04/03 17:58

_id	maver_109
id	maver_109
authors	Maver, T.W. and Schijf R.
year	1982
title	International Implementation of a CAAD Project
summary	With funding from the European Cultural Committee, work is in hand to develop a modular course structure which will promote CAAD education in Schools of Architecture throughout Europe. The paper identifies the need for the course structure and describes the pilot work jointly carried out by the University of Strathclyded the Technical University of Delft. The course structure proposed in the paper will be the focus of discussion and elaboration at a meeting of European Schools of Architecture scheduled for October 1982, in Delft.
series	other
email
last changed	2003/09/03 15:36

_id	2f43
authors	Maver, T.W. and Schijf, R.
year	1982
title	International Implementation of a CAAD Project in Schools of Architecture
source	October, 1982. [14] p. : ill. includes bibliography
summary	With funding from the European Cultural Committee, work is in hand to develop a modular course structure which will promote CAAD education in Schools of Architecture throughout Europe. The paper identifies the need for the course structure and describes the pilot work jointly carried out by the University of Strathclyde and the Technical University of Delft. The course structure proposed in the paper will be the focus of discussion and elaboration at the meeting of European Schools of Architecture
keywords	CAD, architecture, education
series	CADline
email
last changed	2003/06/02 13:58

_id	4bae
authors	Rasdorf, William J. and Kutay, Ali R.
year	1982
title	Maintenance of Integrity During Concurrent Access in a Building Design Database
source	Computer Aided Design. Butterworth Scientific Ltd., July, 1982. vol. 14: pp. 201-207. includes bibliography
summary	This paper proposes a building design database model that insures database integrity in a highly flexible relational structure while supporting disciplinary and interdisciplinary concurrent use. The model strongly supports designer-database interaction by providing extremely versatile data access mechanisms and an associated concurrency control mechanism. Building design components are represented in terms of their location, their attribute values, and combinations of the two. Both the logical and physical database models are illustrated. The relational model is vital for achieving the greatest flexibility in representing and accessing building design data. Its standard relations are ideal for information representation. In addition, the operators provided by the model enable the engineer to readily restructure the database to support building design needs. This paper introduces a database structuring mechanism referred to as catalogs. Catalogs provide a highly versatile mechanism for accessing database information by grouping building components into data units called modules. The modules provide convenient access to multiple design entities. Also included is a protection relation that provides a concurrency control environment for the catalog relations. The module concept is particularly important in design because it enables the ad hoc groupings of data which are so often necessary to support the design process. The module is recommended as the level to which a locking concurrency control mechanism be applied. It is a small enough data unit to support concurrency for interdisciplinary design activities, yet not so small as to require extensive overhead in the concurrency control implementation. Two different modes of locking are recommended for the catalog relations of a building design database to achieve maximum concurrency and efficiency of access by designers
keywords	database, concurrency, access, constraints management
series	CADline
last changed	2003/06/02 13:58

For more results click below: