Refine
Document Type
- Article (119)
- Conference Proceeding (39)
- Doctoral Thesis (7)
Institute
- Professur Informatik im Bauwesen (106)
- Professur Theorie und Geschichte der modernen Architektur (51)
- In Zusammenarbeit mit der Bauhaus-Universität Weimar (1)
- Professur Allgemeine Baustoffkunde (1)
- Professur Baumechanik (1)
- Professur Denkmalpflege und Baugeschichte (1)
- Professur Entwerfen und Architekturtheorie (1)
- Professur Informations- und Wissensverarbeitung (1)
- Professur Stahlbau (1)
- Professur Vernetzte Medien (1)
Keywords
- Weimar (52)
- 1996 (51)
- Bauhaus-Kolloquium (51)
- Architektur (35)
- Technologie (21)
- CAD (18)
- Modellierung (14)
- Fiktion (13)
- Finite-Elemente-Methode (12)
- Bauwerk (10)
Year of publication
- 1997 (165) (remove)
Authors' own research in applied unicriterial and multicriterial optimisation of bar structures, and also an analysis of accessible bibliography on structural synthesis allows to present herein an attempt to define a general algorithm for proceeding in formulation of a structural optimisation problem. A practical aspect of such an algorithm consists, in author's opinion, in enabling a designer a correct creation of a mathematical model of synthesis problems, independently of known mathematical methods employed to looking for an unconditional extremum of function of several variables. A proposed algorithm is not a ready-for-use tool for solving all the optimisation problems, but it constitutes an easy-to-expand theoretical basis. This basis should allow a designer to create a proper set of compromises on the way to construct a mathematical model of a specific optimisation problem. The algorithm, presented in the paper, is constructed as a sequence of the one-after-another problem questions, on which the designer answers: yes or no, and a set of selections from the knowledge base consisting of the elements of an optimisation problem components. The order of making questions adopted by the authors in the algorithm is subjective, however it is supported by their experience, both in applied optimisation and in designing of structures like trusses or frames.
Die Informatik im Bauwesen oder kurz Bauinformatik hat sich in den vergangenen Jahren in Deutschland kontinuierlich entwickelt und sie hat einen festen Platz in den Fakultäten im Bauingenieurwesen an den deutschen Universitäten erhalten. Diese Entwicklung war anfänglich sehr stark fixiert auf die Berechnungen des physikalischen Verhaltens von Bauwerken. In den letzten Jahren kamen weitere Gebiete hinzu. Hier ist vor allem die Zeichnungserstellung (CAD) hervorzuheben. Diese Entwicklungen haben einen großen Reifegrad erlangt und sie haben einen festen Platz in Lehre und Forschung in der Bauinformatik. Die Rolle der Bauinformatik allgemein hat in den letzten Jahren eine stürmische Entwicklung genommen. Die Breite der Anwendungen hat ständig zugenommen und die Forderung nach einer durchgängigen Nutzbarkeit aller Informationen, die in diesem Zusammenhang bearbeitet werden, wird immer stärker gestellt. Besonders zwei Problemstellungen stehen im Mittelpunkt vieler Entwicklungen in der Bauindustrie und in den entsprechenden Softwarehäusern. Dies sind die Entwicklung und Nutzung technischer Modelle zur Unterstützung des Bauprozesses und die Unterstützung betriebswirtschaftlicher Anforderungen in der Bauindustrie. Vor allem die zweite Anforderung war bisher kaum Gegenstand der Bauinformatik. Aktuelle Bestrebungen vor allem aus der Praxis wirken darauf hin, diesen Zustand zu ändern. Die Fakultät Bauingenieurwesen an der Bauhaus-Universität beginnt diesen Anforderungen dadurch Rechnung zu tragen, daß kontinuierlich die notwendigen Voraussetzungen geschaffen werden, um diese Thematik in Lehre und Forschung kompetent aufnehmen zu können. Externe Referenten, die an der Spitze entsprechender Entwicklungen sind, werden in die Lehre mit eingebunden. Dies soll eine kontinuierliche Weiterentwicklung einleiten, die helfen soll, eine zeitgemäße Ausbildung der zukünftigen Bauingenieure sicherzustellen.
SLang - the Structural Language : Solving Nonlinear and Stochastic Problems in Structural Mechanics
(1997)
Recent developments in structural mechanics indicate an increasing need of numerical methods to deal with stochasticity. This process started with the modeling of loading uncertainties. More recently, also system uncertainty, such as physical or geometrical imperfections are modeled in probabilistic terms. Clearly, this task requires close connenction of structural modeling with probabilistic modeling. Nonlinear effects are essential for a realistic description of the structural behavior. Since modern structural analysis relies quite heavily on the Finite Element Method, it seems to be quite reasonable to base stochastic structural analysis on this method. Commercially available software packages can cover deterministic structural analysis in a very wide range. However, the applicability of these packages to stochastic problems is rather limited. On the other hand, there is a number of highly specialized programs for probabilistic or reliability problems which can be used only in connection with rather simplistic structural models. In principle, there is the possibility to combine both kinds of software in order to achieve the goal. The major difficulty which then arises in practical computation is to define the most suitable way of transferring data between the programs. In order to circumvent these problems, the software package SLang (Structural Language) has been developed. SLang is a command interpreter which acts on a set of relatively complex commands. Each command takes input from and gives output to simple data structures (data objects), such as vectors and matrices. All commands communicate via these data objects which are stored in memory or on disk. The paper will show applications to structural engineering problems, in particular failure analysis of frames and shell structures with random loads and random imperfections. Both geometrical and physical nonlinearities are taken into account.
The aim of this talk is to show that the methods used by Métivier and Lapidus to study the eigenvalue distribution of elliptic operators (e.g., of the Dirichlet Laplacian) can be adapted to the study of the similar problem for the Stokes operator. In this way we get asymptotic formulae for the eigenvalues of the latter operator even in the case when the underlying domain has an extremely irregular (fractal) boundary. In the case the boundary is not that irregular (e.g., when it is Lipschitz) the estimates we obtain are much better than the ones we can find in the current literature.
The paper describes a development of the analytical finite strip method (FSM) in displacements for linear elastic static analysis of simply supported at their transverse ends complex orthotropic prismatic shell structures with arbitrary open or closed deformable contour of the cross-section under general external loads. A number of bridge top structures, some roof structures and others are related to the studied class. By longitudinal sections the prismatic thin-walled structure is discretized to a limited number of plane straight strips which are connected continuously at their longitudinal ends to linear joints. As basic unknowns are assumed the three displacements of points from the joint lines and the rotation to these lines. In longitudinal direction of the strips the unknown quantities and external loads are presented by single Fourier series. In transverse direction of each strips the unknown values are expressed by hyperbolic functions presenting an exact solution of the corresponding differential equations of the plane straight strip. The basic equations and relations for the membrane state, for the bending state and for the total state of the finite strip are obtained. The rigidity matrix of the strip in the local and global co-ordinate systems is derived. The basic relations of the structure are given and the general stages of the analytical FSM are traced. For long structures FSM is more efficient than the classic finite element method (FEM), since the problem dimension is reduced by one and the number of unknowns decreases. In comparison with the semi-analytical FSM, the analytical FSM leads to a practically precise solution, especially for wider strips, and provides compatibility of the displacements and internal forces along the longitudinal linear joints.
Designing lightings in a 3D-scene is a general complex task for building conception as it is submitted to many constraints such as aesthetics or ergonomics. This is often achieved by experimental trials until reaching an acceptable result. Several rendering softwares (such as Radiance) allow an accurate computation of lighting for each point in a scene, but this is a long process and any modification requires the whole scene to be rendered again to get the result. The first guess is empirical, provided by experience of the operator and rarely submitted to scientific considerations. Our aim is to provide a tool for helping designers to achieve this work in the scope of global illumination. We consider the problem when some data are asked for : on one hand the mean lighting in some zones (for example on a desktop) and on the other hand some qualitative information about location of sources (spotlights on the ceiling, halogens on north wall,...). The system we are conceiving computes the number of light sources, their position and intensities, in order to obtain the lighting effects defined by the user. The algorithms that we use bind together radiosity computations with resolution of a system of constraints.
Das Ziel dieser Arbeit war es, durch Verwendung geeigneter vorhandener CAD-Pläne die Bearbeitung neuer CAD-Pläne zu unterstützen. Entstanden ist ein generischer Ansatz zum fallbasierten Schließens. Da in CAD-Plänen die räumliche Struktur eine wichtige Rolle spielt, ist das Konzept auf strukturorientierte Anwendungen ausgerichtet. Deshalb bezeichne ich es als ein Konzept zum " strukturorientierten fallbasierten Schließen". Die Arbeit spezifiziert das Minimum an Wissen, welches zur Suche und Wiederverwendung von Fällen benötigt wird, wie das darüber hinausgehende Wissen verarbeitet wird, welche Zusammenhänge es zum Beispiel zwischen Vergleichs- und Anpassungswissen gibt und wie man das Wissen modellieren kann. Zur Erläuterung wird das benötigte Wissen anhand verschiedener Anwendungen dargestellt. Das in der Arbeit vorgestellte Konzept erlaubt die Ergänzung, Detaillierung und Korrektur einer Anfrage. Die beiden entscheidenden Algorithmen dienen dem Vergleich von Anfrage und Fall und der Anpassung der Information des Falles zur Modifikation der Anfrage.