TY - JOUR A1 - Voronin, V. P. T1 - Renovation's peculiarities of industrial enterprises in conditions of economic selfsufficiency N2 - Probleme of recrienfation of building complex, to the sharp increase of share of reconstruction works, capital repair and modernisation of in-dustrial plants are concidered in this work. The conception of develop-ment and creation of unitified system of expluatation and renovation of industrial plants are worded out. This system is based on date-computer technology and taking into conciderations of real economic relations. KW - Bauwerk KW - Rekonstruktion KW - Wirtschaftlichkeit Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5296 ER - TY - JOUR A1 - Semenov, Artem A1 - Melnikov, B. E. T1 - Multimodel Numerical Analysis of the Elasto-Visco-Plastic Deformation of Materials and Constructions N2 - At the present time there is no a generally accepted theory of visco-plasticity which is applicable for a wide class of materials and arbitrary paths of loading. The multimodel approach, based on the creation of hierarchical sequence of the models, is the most rational. The developed library of elasto-visco-plastic models includes both simplest and sophistic models demanding numerous experimental data. A unified general form of constitutive equations for all used elasto-visco-plastic models are presented based upon the concept of tensorial internal state variables. It permits to use unified algorithm of boundary tasks solution for different variants of material models. The developed selection criteria system generates the necessary conditions and provides the choice of the simplest variant of theory sufficient for correct problem solution. Formulation of the selection criteria system is based on peculiarities of viscoplastic materials behavior for the wide range thermomechanical loading and numerous computational experiments with structures different complexity levels. A set of effective schemes of integration stress-strain relations and non-linear finite element system solution are discussed for the considered class of material models. Application possibility of different material models is studied both for material element and for complicated structures. Application of the multimodel approach in numerical computations has demonstrated possibility of reliable prediction of stress-strain response under wide variety of combined loading. KW - Stoffgesetz KW - Elastoplastizität KW - Viskoplastizität Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5282 ER - TY - JOUR A1 - Minch, M. J. A1 - Trochanowski, A. T1 - The numerical Modelling and Analysis of RC cracked Structures N2 - The purpose of this paper is to review model for finite element techniques for non-linear crack analysis of reinforced concrete beams and slabs. The non-linear behaviour of concrete and steel were described. Some calculations of >self-stress< for concrete and reinforced concrete beam was made. Current computational aspects are discussed. Several remarks for future studies are also given. The numerical model of the concrete and reinforced concrete was described. The paper shows the results of calculations on a reinforced concrete plane stress panel with cracks. The non-linear, numerical model of calculations of reinforced concrete was assumed. Using finite elements method some calculations were made. The results of calculations like displacements, stresses and cracking are shown on diagrams. They were compared with experimental results and other finding. Some conclusions about the described model and results of calculation are shown. KW - Tragwerk KW - Stahlbeton KW - Rissbildung KW - Modellierung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5278 ER - TY - JOUR A1 - Berkowski, P. A1 - Boron, Jacek T1 - An Algorithm of compromise structural Optimisation of Bar Structures N2 - 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. KW - Stabwerk KW - Optimierung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5264 ER - TY - JOUR A1 - Kaiser, Wolfgang T1 - Die unbegrenzten Einsatzmöglichkeiten von 3D-Modellierern N2 - Der Funktionsumfang von 3D-Modellierern und die Leistung allgemein zur Verfügung stehender Rechnersysteme gestatten die Modellierung beliebiger Objekte in jeder nur denkbaren Fachdisziplin. Das potentielle Leistungsvermögen von 3D-Modellierern sollte Anreiz sein, sie so alltäglich einzusetzen, wie die etablierten Standardapplikationen. Die im Vortrag gezeigten Modelle umfassen ein kleines Spektrum der möglichen Anwendungsgebiete. Weder vom (Daten)Umfang noch von ihrem Kompliziertheitsgrad stellen sie etwas Besonderes dar. Sie sollen nur das Interesse für einen alltäglichen Einsatz von 3D-Modellierern wecken und eventuell vorhandenen Einsatzschwellen abbauen helfen. Die im Vortrag gezeigten Bildfolgen sind unter http://www.uni-weimar.de/animationen zu finden. KW - Dreidimensionales Modell KW - Anwendung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5257 ER - TY - JOUR A1 - Hering, F. T1 - Penrose-Pflasterungen in der Architektur - die künstlerische Umsetzung eines mathematischen Modells im Gemeindeverwaltungs-Zentrum von Bütgenbach, Belgien N2 - Der englische Physiker und Mathematiker Roger Penrose hat eine mathematische Pflasterung entdeckt, deren Formenreichtum neue Impulse in der Architektur setzen kann. In der Gemeinde Bütgenbach im Hohen Venn, Belgien, wurde das Verwaltungszentrum durch den Essener Architekten Ernst Burghartz mit mehrereren Penrose-Pflasterungen versehen. Diese beruhen auf einem Computer-Programm, welches der Vortragende zusammen mit Dr. Frank Martini entwickelt hat. Herr Burghartz hat jedoch diesen Vorentwurf nach seinen künstlerischen Vorstellungen abgewandelt. KW - Anwendung KW - Architektur KW - Pflasterungen (Mathematik) Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5247 ER - TY - JOUR A1 - Krebs, F. A1 - Brück, E. T1 - 3D-Computergrafik und -animation als Instrument der Visualisierung im Bereich Entwurf und Denkmalpflege N2 - Seit mehreren Jahren wird im Fachbereich Gestaltung, Studiengang Innenarchitektur 3D-Computergrafik und -animation in Lehrveranstaltungen ausgebildet und in Projekt- und Diplomarbeiten als Darstellungsmedium angewandt. Eine besondere Herausforderung stellen dabei die 3D-Visualisierungen von historischen Gebäuden dar. Mit den beiden nachfolgenden Beispielen soll der Einsatz und die curricularen Verknüpfung der CA-Technologie mit Studienarbeiten und Projekten zum Thema >Denkmalpflege< aufgezeigt werden. Rekonstruktion und Visualisierung des ehemaligen >Jagdschlosses Platte< bei Wiesbaden. Mit Unterstützung einer Kunsthistorikerin wurde in einer Studienarbeit das im Krieg zerstörte ehemalige Jagdschloß im Computer nachgebildet. Neben der Darstellung des Gebäudeäußeren und des zentralen Innenbereiches wurde eine Animation über die Triangulierung der klassizistischen Geometrie erstellt. Umnutzung historischer Bausubstanz am Beispiel der ehemaligen Klostersanlage >Schiffenberg< bei Gießen. Im Rahmen einer Projektarbeit wurden mehrer Konzepte entwickelt, Entwürfe erstellt und mittels Computeranimationen öffentlich präsentiert. In Kooperation mit dem Studiengang Fernsehtechnik (FH-Wiesbaden) wurde von zwei Studenten eine Videodokumentation über den gesamten Projektverlauf erstellt. Neben dem Aufzeigen der Arbeitsprozesse und dem Vorstellen des Lehrkonzeptes für die curriculare Einbindung der CA-Technologie werden aktuelle Studienergebnisse anhand von Videoprojektionen vorgestellt. KW - Architektur KW - Visualisierung KW - Dreidimensionales Modell KW - Computergraphik Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5235 ER - TY - JOUR A1 - Vaarmann, Otu T1 - A class of rapidly convergent interative Methods for Problems in mathematical Modelling N2 - Methods with the convergence order p 2 (Newton`s, tangent hyperbolas, tangent parabolas etc.) and their approximate variants are studied. Conditions are presented under which the approximate variants preserve their convergence rate intrinsic to these methods and some computational aspects (possibilities to organize parallel computation, globalization of a method, the solution of the linear equations versus the matrix inversion at every iteration etc.) are discussed. Polyalgorithmic computational schemes (hybrid methods) combining the best features of various methods are developed and possibilities of their application to numerical solution of two-point boundary-value problem in ordinary differential equations and decomposition-coordination problem in convex programming are analyzed. KW - Mathematisches Modell KW - Dialogsystem Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5223 ER - TY - JOUR A1 - Kazakevitch, M. I. A1 - Kulyabko, V. V. A1 - Dubichvost, A. A. T1 - The discrete dynamic Models of the Interaction of complex - composite Structures with the dynamic Loads N2 - In the given paper the generalized formulation of the problem of computer modelling of the complex-composite structure interaction with different types of dynamic loads and effects is discussed. Here the analysis is given as for the usage of some universal computing systems for the solution of such problems. Also if is shown that the quantification of the dynamic models of the complex-composite systems with the variable structure, depending on the character and intensivity of the effects, is necessary. The different variants of the joint and the space structure element modelling are gested. It allows to consider the complex modes of the joint bending-torsional oscillations of such structures as bridges, towers, high-rise buildings. The peculiarities of the modelling and testing of some problems of the objects aerodynamics and the interaction of the frameworks constructions with shock and movable loads are considered. In this paper the examples of the complex-composite structure dynamic analysis are shown. It is achieved by means of some special methods of the input of the real inducements and loads of the exploitated analog-object into the computing model. The suggested models found a wide use both at the design of new structures and the dynamic monitoring of the exploitated structures. KW - Verbundtragwerk KW - Dynamische Belastung KW - Wechselwirkung KW - Modellierung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5219 ER - TY - JOUR A1 - Kämmerer, Lutz A1 - Hempel, Lorenz T1 - Eine Heuristik zur Lösung von Stapelproblemen N2 - Bei der Betrachtung von Stapelproblemen ergibt sich unter anderem folgendes Problem: Ein gegebener Stapel - bestehend aus den Elementen v i der Menge V - soll an anderer Stelle in einer vorgeschriebenen, veränderten Struktur wieder aufgebaut werden. Dazu stehen Hilfsstapelplätze zur Verfügung. Die Optimierung dieses Problems hinsichtlich der Anzahl der benötigten Hilfsstapelplätze ist NP-vollständig. Es werden Erfahrungen mit einem Branch-and-Bound Algorithmus zur Lösung des Problems vorgestellt sowie ein heuristischer Algorithmus diskutiert KW - Stapelproblem KW - Heuristik Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5207 ER - TY - JOUR A1 - Schreier, H. T1 - Näherungsverfahren zur Lösung eines Transportproblems der diskreten Schüttgutoptimierung N2 - Gegenstand der Betrachtung ist ein spezielles Tourenproblem der Schüttgutoptimierung. Man stelle sich als Realitätsbezug ein Transportunternehmen vor, das eine Anzahl von gleichartigen Fahrzeugen in einem Fuhrpark stationiert hat. Vorgegebene Mengen von Schüttgut müssen von einer Kiesgrube zu mehreren Baustellen transportiert werden. Dabei sind Be- und Entladezeiten, unterschiedliche mittlere Geschwindigkeiten für Leer- bzw. Lastfahrten und Schichtzeiten zu berücksichtigen. Gesucht ist eine optimale Anzahl von einzusetzenden Fahrzeugen und die zugehörigen Tourenpläne mit dem Ziel der Minimierung der Transportkosten unter Beachtung der Lieferverträge. Die Lösung des Problems erfolgt in zwei Phasen. Zuerst wird die Frage geklärt, wieviele Fahrzeuge bei minimalem Kostenniveau einzusetzen und welche zu den Leerfahrten gehörigen Teilstrecken wie oft zu befahren sind. Anschließend wird mit heuristischen Verfahren versucht, die Menge der zu fahrenden Teilstrecken so auf die Fahrzeuge aufzuteilen, daß für jedes Fahrzeug eine zulässige Tour entsteht. Zur komplexen Lösung einer denkbaren Aufgabe liegt ein Programm in der Programmiersprache PASCAL vor. Die erzielten numerischen Resultate belegen, daß auch für Probleme größerer Dimension eine Optimallösung oder sehr gute Näherungen in vernünftiger Zeit gefunden werden. KW - Transportproblem Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5195 ER - TY - JOUR A1 - Neumann, K. T1 - Heuristics and applications for Ressource-Constrained Project Scheduling with Minimal and Maximal Time Lags N2 - Priority-rule methods for approximately minimizing the duration of a project subject to minimal and maximal time lags between the activities of the project and limited availability of renewable resources are considered. Such a project can be modelled by a cyclic activity-on-node network. Two generation schemes for constructing feasible schedules are discussed: the serial and parallel schemes. Two different kinds of heuristic procedures are proposed. The sequential or direct method processes the activities or respectively nodes of the project network one after another without considering the strong components separately. The contraction method uses a bottom-up technique. First, a feasible subschedule is determined for each strong component. Second, each strong component is replaced by a single node and the resulting acyclic network is treated by the direct method. In conclusion, some results from an experimental performance analysis of the heuristics are given using a new network generator. KW - Ablaufplanung KW - Beschränkung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5186 ER - TY - JOUR A1 - Girlich, E. A1 - Kovalev, M. A1 - Zaporozhets, A. T1 - Standardization problem: Ressource Allocation in a Network N2 - We consider the standardization problem (SP) which can be formulated as follows. It is known demand bi in each type i in {1, 2, ..., n} of items. Production of yi items of the ith type brings a profit fi (yi), where fi is a nondecreasing concave function for each i in {1, 2, ..., n}.It is necessary to satisfy the demand and to maximize the total profit provided that there exist >standardization possibilities< . These possibilities means that some types of items can be replaced by some another types. We introduce generalized standardization problem (GSP) in which titems demand is given as the set of admissible demand vectors. We show that GSP and SP are special cases of the resource allocation problem over a network polymatroid. Ibasing on this observation we propose a polynomial time solution algorithm for GSP and SP. KW - Ressourcenallokation KW - Standardisierung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5172 ER - TY - JOUR A1 - Perepelitsa, V. A. A1 - Pinchuk, V. P. A1 - Sergeeva, L. N. A1 - Pozdnjakova, A. J. T1 - Fractal Graphs and their Properties N2 - The idea of representing urban structure and various communication systems (water and energy supply, telephone and cable TV networks) as fractal objects is not absolutely new. However, known works, devoted to this problem use models and approaches from fractal physics. For example, to simulate urban growth Diffusion Limited Aggregation (DLA) model and Dielectric Breakdown (DB) model are used. This study introduces a different approach. Net structure of communication system is described by a graph of special type called regular G(l,r,n)-graph. Authors provide description of such graph, develop iterative process for its generation and prove its self-similarity, i.e. that every regular graph is a pre-fractal. After the infinite number of steps this process generates a fractal. The devised algorithm for generation and grathical representation of regular G(l,r,n)-graphs with different values of l,r and n has been programmed to receive computer simulations. For optimal graphic presentation of pre-fractals the Optimal Space Ordering method was suggested. It is based on the minimization of the >graph energy< value about vertices' coordinates. The effective procedure for optimization was developed that takes into account specific properties of graph energy as objective function For the fractal graph introduced the Hausdorff-Besikovich and similarity dimensions were calculated. It has been shown that >graph energy< is directly related to the graph's fractal properties. For G(3,3,n) and G(4,4,n) graphs fractal dimensions calculated by different methods are the same (D=1,5 and D=2 respectively), while topological dimension of both graphs is 1. KW - Versorgungsnetz KW - Fraktal KW - Graphentheorie Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5166 ER - TY - JOUR A1 - Bakurova, A. V. A1 - Perepelitsa, V. A. A1 - Zin'kovskaya, J. S. T1 - Research of Stability of Vector Problem of spanning Tree with topological Criteria N2 - A multicriterial statement of the above mentioned problem is presented. It differes from the classical statement of Spanning Tree problem. The quality of solution is estimated by vector objective function which contains weight criteria as well as topological criteria (degree and diameter of tree). Many real processes are not determined yet. And that is why the investigation of the stability is very important. Many errors are connected with calculations. The stability analysis of vector combinatorial problems allows to discover the value of changes in the initial data for which the optimal solution is not changed. Furthermore, the investigation of the stability allows to construct the class of the problems on base of the one problem by means of the parameter variations. Analysis of the problems with belong to this class allows to obtaine axact and adecuate discription of model KW - Spannender Baum KW - Vektorfunktion KW - Stabilität Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5159 ER - TY - JOUR A1 - Emelichev, V. A. A1 - Girlich, E. A1 - Podkopaev, D. P. T1 - Several kinds of Stability of efficient Solutions in Vector Trajectorial discrete Optimization Problem N2 - This work was partially supported by DAAD, Fundamental Researches Foundation of Belarus and International Soros Science Education Program We consider a vector discrete optimization problem on a system of non- empty subsets (trajectories) of a finite set. The vector criterion of the pro- blem consists partial criterias of the kinds MINSUM, MINMAX and MIN- MIN. The stability of eficient (Pareto optimal, Slater optimal and Smale op- timal) trajectories to perturbations of vector criterion parameters has been investigated. Suficient and necessary conditions of eficient trajectories local stability have been obtained. Lower evaluations of eficient trajectories sta- bility radii, and formulas in several cases, have been found for the case when l(inf) -norm is defined in the space of vector criterion parameters. KW - Diskrete Optimierung KW - Stabilität KW - Trajektorie (Mathematik) Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5030 ER - TY - JOUR A1 - Venturino, Ezio A1 - Raciti, F. T1 - Quaternion methods for random matrices in quantum physics N2 - The theory of random matrices, or random matrix theory, RMT in what follows, has been developed at the beginning of the fties to describe the sta- tistical properties of energy levels of complex quantum systems, [1], [2], [3]. In the early eighties it has enjoyed renewed interest since it has been recognized as a very useful tool in the study of numerous physical systems. Specically, it is very useful in the analysis of chaotic quantum systems. In fact, in the last years many papers appeared about the problem of quantum chaos which implies the quantization of systems whose underlying classical dynamics is irregular (i.e. chaotic). The simplest models considered in this eld are billi- ards of various shapes. From the the classical point of view, a point particle in a 2-dimensional billiard displays regular or irregular motion depending on the shape of the billiard; for instance motion in a rectangular or circular billi- ard is regular thanks to the symmetries of the boundary. On the other hand, billiards of arbitrary shapes imply chaotic motion, i.e. exponential diver- gence of initially nearby trajectories. In order to study quantum billiards we have to consider the Schroedinger equation in various 2-dimensional domains. The eigenvalues of the Schroedinger equation represent the allowed energy levels of our quantum particle in the billiard under consideration, while the eigenfunction norms represent the probability density of nding the particle in a certain position. The question of quantum chaos is whether the charac- ter of the classical motion (regular or chaotic) can in uence some properties KW - Quantenphysik KW - Quaternion Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5029 ER - TY - JOUR A1 - Kähler, Uwe T1 - On the solution of spatial generalizations of Beltrami equations N2 - With the help of functional analytical methods complex analysis is a powerful tool in treating non-linear first-order partial differential equations in the plane. Some of the most important of these equations are the Beltrami equations. This is due to the fact that the theory of Beltrami systems is related to many problems of geometry and analysis, like non-linear subsonic two-dimensional hydrodynamics, problems of conformal and quasiconformal mappings of two-dimensional Riemannian manifolds, or complex analytic dynamics. The theory of Beltrami equations is strongly connected with the -operator. This singular integral operator is immediately recognized as two-dimensional Hilbert-transform, known also under the name of integral operator with Beurling kernel, acting as an isometry of L2(C) onto L2(C). In hypercomplex function theory the Beltrami equations have not yet this importance, but nevertheless, they are a basic condition for the transfer of complex methods and efforts for solving partial differential equations, especially of non-linear type, to the spatial case. Here we deal with hypercomplex Beltrami systems. For this we restrict ourselves to the quaternionic case, but without any loss of generality. We will show how a spatial generalization of the complex -operator can be used to solve systems of non-linear partial differential equations, in particular different types of spatial Beltrami systems. Also, the for practical purposes so important norm estimates will be derived. Some of our results are stronger as known results in the complex case, but they are applicable in the complex situation, too. KW - Beltrami-Gleichung Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5018 ER - TY - JOUR A1 - Caetano, A. M. T1 - Eigenvalue Distribution for the Stokes Operator N2 - 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. KW - Stokes-Problem KW - Eigenwert Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-5005 ER - TY - JOUR A1 - Ngo, D. Q. A1 - Rüppel, Uwe T1 - BINAS - Ein Entscheidungshilfesystem für die Bestandsanalyse von Bauwerken N2 - Bauwerke sind in ihrer Betriebszeit vielen nutzungseinschränkenden Einflüssen ausgesetzt. Die dadurch erforderliche Instandhaltung dient zur Gewährleistung und zur Erhöhung der geplanten Nutzungsfähigkeit sowie Dauerhaftigkeit von Bauwerken. Sie spielt eine immer größere Rolle im Bauwesen. Die Kosten der Bauwerksinstandhaltung betragen je nach Art des Bauwerkes in Deutschland pro Jahr ca. 1-6% des Wiederbeschaffungswertes. Die Reduzierung des Instandhaltungsaufwandes durch Technik- und Management-Maßnahmen ist daher wirtschaftlich sinnvoll. Der Einsatz moderner Informations- und Kommunikationstechnologie auf dem Gebiet der Bestandsaufnahme und -analyse ist erforderlich, um einerseits die Bearbeitung von multimedialen Informationen über Ist- und Soll-Zustände von Bauwerken effektiver durchzuführen und um andererseits die Analyse von Schäden im Sinne einer Entscheidungshilfe zu unterstützen. Durch den Einsatz der WWW-Technologie kann die Bearbeitung auch verteilt im Datennetz über ferne Rechner hinweg erfolgen. Im Beitrag werden die Konzeptionierung und Implementierung des WWW-fähigen DV-Systems BINAS zur Unterstützung der Bestandsaufnahme und -analyse sowie die dafür erforderlichen Methoden und Werkzeuge vorgestellt. KW - Bauwerk KW - Bauschaden KW - Instandhaltung KW - Entscheidungsunterstützungssystem Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20111215-4994 ER -