TY - CHAP A1 - Lavicka, Roman A1 - Delanghe, Richard A1 - Soucek, Vladimir ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - THE HOWE DUALITY FOR HODGE SYSTEMS N2 - In this note, we describe quite explicitly the Howe duality for Hodge systems and connect it with the well-known facts of harmonic analysis and Clifford analysis. In Section 2, we recall briefly the Fisher decomposition and the Howe duality for harmonic analysis. In Section 3, the well-known fact that Clifford analysis is a real refinement of harmonic analysis is illustrated by the Fisher decomposition and the Howe duality for the space of spinor-valued polynomials in the Euclidean space under the so-called L-action. On the other hand, for Clifford algebra valued polynomials, we can consider another action, called in Clifford analysis the H-action. In the last section, we recall the Fisher decomposition for the H-action obtained recently. As in Clifford analysis the prominent role plays the Dirac equation in this case the basic set of equations is formed by the Hodge system. Moreover, analysis of Hodge systems can be viewed even as a refinement of Clifford analysis. In this note, we describe the Howe duality for the H-action. In particular, in Proposition 1, we recognize the Howe dual partner of the orthogonal group O(m) in this case as the Lie superalgebra sl(2 1). Furthermore, Theorem 2 gives the corresponding multiplicity free decomposition with an explicit description of irreducible pieces. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28669 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - De Schepper, Nele A1 - Brackx, Fred A1 - Sommen, Frank ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - THE FOURIER-BESSEL TRANSFORM N2 - In this paper we devise a new multi-dimensional integral transform within the Clifford analysis setting, the so-called Fourier-Bessel transform. It appears that in the two-dimensional case, it coincides with the Clifford-Fourier and cylindrical Fourier transforms introduced earlier. We show that this new integral transform satisfies operational formulae which are similar to those of the classical tensorial Fourier transform. Moreover the L2-basis elements consisting of generalized Clifford-Hermite functions appear to be eigenfunctions of the Fourier-Bessel transform. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28387 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Djordjevic, Djordje A1 - Petkovic, Dusan A1 - Zivkovic, Darko ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - THE APPLICATION OF INTERVAL CALCULUS TO ESTIMATION OF PLATE DEFLECTION BY SOLVING POISSON’S PARTIAL DIFFERENTIAL EQUATION N2 - This paper describes the application of interval calculus to calculation of plate deflection, taking in account inevitable and acceptable tolerance of input data (input parameters). The simply supported reinforced concrete plate was taken as an example. The plate was loaded by uniformly distributed loads. Several parameters that influence the plate deflection are given as certain closed intervals. Accordingly, the results are obtained as intervals so it was possible to follow the direct influence of a change of one or more input parameters on output (in our example, deflection) values by using one model and one computing procedure. The described procedure could be applied to any FEM calculation in order to keep calculation tolerances, ISO-tolerances, and production tolerances in close limits (admissible limits). The Wolfram Mathematica has been used as tool for interval calculation. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28397 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Ebling, Julia A1 - Scheuermann, G. ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - TEMPLATE MATCHING ON VECTOR FIELDS USING CLIFFORD ALGEBRA N2 - Due to the amount of flow simulation and measurement data, automatic detection, classification and visualization of features is necessary for an inspection. Therefore, many automated feature detection methods have been developed in recent years. However, only one feature class is visualized afterwards in most cases, and many algorithms have problems in the presence of noise or superposition effects. In contrast, image processing and computer vision have robust methods for feature extraction and computation of derivatives of scalar fields. Furthermore, interpolation and other filter can be analyzed in detail. An application of these methods to vector fields would provide a solid theoretical basis for feature extraction. The authors suggest Clifford algebra as a mathematical framework for this task. Clifford algebra provides a unified notation for scalars and vectors as well as a multiplication of all basis elements. The Clifford product of two vectors provides the complete geometric information of the relative positions of these vectors. Integration of this product results in Clifford correlation and convolution which can be used for template matching of vector fields. For frequency analysis of vector fields and the behavior of vector-valued filters, a Clifford Fourier transform has been derived for 2D and 3D. Convolution and other theorems have been proved, and fast algorithms for the computation of the Clifford Fourier transform exist. Therefore the computation of Clifford convolution can be accelerated by computing it in Clifford Fourier domain. Clifford convolution and Fourier transform can be used for a thorough analysis and subsequent visualization of flow fields. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29464 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Bultheel, Adhemar A1 - Jansen, M. A1 - Maes, J. A1 - Van Aerschot, W. A1 - Vanraes, E. ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SUBDIVIDE AND CONQUER RESOLUTION N2 - This contribution will be freewheeling in the domain of signal, image and surface processing and touch briefly upon some topics that have been close to the heart of people in our research group. A lot of the research of the last 20 years in this domain that has been carried out world wide is dealing with multiresolution. Multiresolution allows to represent a function (in the broadest sense) at different levels of detail. This was not only applied in signals and images but also when solving all kinds of complex numerical problems. Since wavelets came into play in the 1980's, this idea was applied and generalized by many researchers. Therefore we use this as the central idea throughout this text. Wavelets, subdivision and hierarchical bases are the appropriate tools to obtain these multiresolution effects. We shall introduce some of the concepts in a rather informal way and show that the same concepts will work in one, two and three dimensions. The applications in the three cases are however quite different, and thus one wants to achieve very different goals when dealing with signals, images or surfaces. Because completeness in our treatment is impossible, we have chosen to describe two case studies after introducing some concepts in signal processing. These case studies are still the subject of current research. The first one attempts to solve a problem in image processing: how to approximate an edge in an image efficiently by subdivision. The method is based on normal offsets. The second case is the use of Powell-Sabin splines to give a smooth multiresolution representation of a surface. In this context we also illustrate the general method of construction of a spline wavelet basis using a lifting scheme. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29091 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Szolomicki, Jerzy Pawel ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - STRUCTURAL BEHAVIOUR OF MASONRY VAULTS N2 - This paper deals with the modelling and the analysis of masonry vaults. Numerical FEM analyses are performed using LUSAS code. Two vault typologies are analysed (barrel and cross-ribbed vaults) parametrically varying geometrical proportions and constraints. The proposed model and the developed numerical procedure are implemented in a computer analysis. Numerical applications are developed to assess the model effectiveness and the efficiency of the numerical procedure. The main object of the present paper is the development of a computational procedure which allows to define 3D structural behaviour of masonry vaults. For each investigated example, the homogenized limit analysis approach has been employed to predict ultimate load and failure mechanisms. Finally, both a mesh dependence study and a sensitivity analysis are reported. Sensitivity analysis is conducted varying in a wide range mortar tensile strength and mortar friction angle with the aim of investigating the influence of the mechanical properties of joints on collapse load and failure mechanisms. The proposed computer model is validated by a comparison with experimental results available in the literature. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28966 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Broßmann, Marko A1 - Müller, Karl-Heinz ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - STOCHASTISCHE ANALYSE VON STAHLBETONBALKEN IM GRENZZUSTAND DER ADAPTION UNTER BERüCKSICHTIGUNG DER STEIFIGKEITSDEGRADATION N2 - Am Beispiel eines 3-feldrigen Durchlaufträgers wird die Versagenswahrscheinlichkeit von wechselnd belasteten Stahlbetonbalken bezüglich des Grenzzustandes der Adaption (Einspielen, shakedown) untersucht. Die Adaptionsanalyse erfolgt unter Berücksichtigung der beanspruchungschabhängigen Degradation der Biegesteifigkeit infolge Rissbildung. Die damit verbundene mechanische Problemstellung kann auf die Adaptionsanalyse linear elastisch - ideal plastischer Balkentragwerke mit unbekannter aber begrenzter Biegesteifigkeit zurückgeführt werden. Die Versagenswahrscheinlichkeit wird unter Berücksichtigung stochastischer Tragwerks- und Belastungsgrößen berechnet. Tragwerkseigenschaften und ständige Lasten gelten als zeitunabhängige Zufallsgrößen. Zeitlich veränderliche Lasten werden als nutzungsdauerbezogene Extremwerte POISSONscher Rechteck-Pulsprozesse unter Berücksichtigung zeitlicher Überlagerungseffekte modelliert, so dass die Versagenswahrscheinlichkeit ebenfalls eine nutzungsdauerbezogene Größe ist. Die mechanischen Problemstellungen werden numerisch mit der mathematischen Optimierung gelöst. Die Versagenswahrscheinlichkeit wird auf statistischem Weg mit der Monte-Carlo-Methode geschätzt. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29341 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Bauer, Marek A1 - Richter, Matthias ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - STATISTICAL ANALYSIS OF TIME LOST BY TRAMS BEFORE DEPARTURE FROM STOPS N2 - The ride of the tram along the line, defined by a time-table, consists of the travel time between the subsequent sections and the time spent by tram on the stops. In the paper, statistical data collected in the city of Krakow is presented and evaluated. In polish conditions, for trams the time spent on stops makes up the remarkable amount of 30 % of the total time of tram line operation. Moreover, this time is characterized by large variability. The time spent by tram on a stop consists of alighting and boarding time and time lost by tram on stop after alighting and boarding time ending, but before departure. Alighting and boarding time itself usually depends on the random number of alighting and boarding passengers and also on the number of passengers which are inside the vehicle. However, the time spent by tram on stop after alighting and boarding time ending is an effect of certain random events, mainly because of impossibility of departure from stop, caused by lack of priorities for public transport vehicles. The main focus of the talk lies on the description and the modelling of these effects. This paper is involved with CIVITAS-CARAVEL project: "Clean and better transport in cites". The project has received research funding from the Community's Sixth Framework Programme. The paper reflects only the author's views and the Community is not liable for any use that may be made of the information contained therein. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29226 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Petrova, Lyllia B. ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - STATIC ANALYSIS ON MODELS OF CONTINUOUS ORTHOTROPIC THIN-WALLED PRISMATIC SHELL STRUCTURES N2 - The paper presents a linear static analysis on continuous orthotropic thin-walled shell structures simply supported at the transverse ends with a random deformable contour of the cross section. The external loads can be random as well. The class of this structures involves most of the bridges, scaffold bridges, some roof structures etc. A numerical example of steel continuous structures on five spans with an open contour of the cross-section has been solved. The examination of the structure has used the following two computation models: a prismatic structure consisting of isotropic strips, a plates and ribs, with considering their real interaction, and a smooth orthotropic plate equivalent to the structure in the first model. The displacements and forces of the structure characterizing its stressed and deformed condition have been determined. The results obtained from the two solutions have been analyzed. The study on the structure is made with the force method in combination with the analytical finite strip method (AFSM) in displacements. The basic system is obtained by separating the superstructure from the understructure at the places of intermediate supports and consists of two parts. The first part is a single span thin-walled prismatic shell structure; the second part presents supports (columns, space frames etc.). The connection between the superstructure and intermediate supports is made under random supporting conditions. The forces at the supporting points in the direction of the connections removed are assumed to be the basic unknowns of the force method. The solution of the superstructure has been accomplished by the AFSM in displacements. The structure is divided in only one (transverse) direction into a finite number of plain strips connected to each other in longitudinal linear nodes. The three displacements of the points on the node lines and the rotation around those lines have been assumed to be the basic unknown in each node. The boundary conditions of each strip of the basic system correspond to the simply support along the transverse ends and the restraint along the longitudinal ones. The particular strip of the basic system has been solved by the method of the single trigonometric series. The method is reduced to solving a discrete structure in displacements and restoring its continuity at the places of the sections made in respect to both the displacements and forces. The two parts of the basic system have been solved in sequence under the action of single values of each of the basic unknowns and with the external load. The solution of the support part is accomplished using software for analyzing structures by the FEM. The basic unknown forces have been determined from system of canonic equations, the conditions of the deformations continuity on the places of the removed connections under superstructure and intermediate supports. The final displacements and forces at a random point of a continuous superstructure have been determined using the principle of superposition. The computations have been carried by software developed with Visual Fortran version 5.0 for PC. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-30007 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Malonek, Helmuth Robert ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SPECIAL FUNCTIONS VERSUS ELEMENTARY FUNCTIONS IN HYPERCOMPLEX FUNCTION THEORY N2 - In recent years special hypercomplex Appell polynomials have been introduced by several authors and their main properties have been studied by different methods and with different objectives. Like in the classical theory of Appell polynomials, their generating function is a hypercomplex exponential function. The observation that this generalized exponential function has, for example, a close relationship with Bessel functions confirmed the practical significance of such an approach to special classes of hypercomplex differentiable functions. Its usefulness for combinatorial studies has also been investigated. Moreover, an extension of those ideas led to the construction of complete sets of hypercomplex Appell polynomial sequences. Here we show how this opens the way for a more systematic study of the relation between some classes of Special Functions and Elementary Functions in Hypercomplex Function Theory. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28702 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Schrader, Kai A1 - Könke, Carsten ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SPARSE APPROXIMATE COMPUTATION OF SADDLE POINT PROBLEMS ARISING FROM FETI-DP DISCRETIZATION N2 - The numerical simulation of microstructure models in 3D requires, due to enormous d.o.f., significant resources of memory as well as parallel computational power. Compared to homogeneous materials, the material hetrogeneity on microscale induced by different material phases demand for adequate computational methods for discretization and solution process of the resulting highly nonlinear problem. To enable an efficient/scalable solution process of the linearized equation systems the heterogeneous FE problem will be described by a FETI-DP (Finite Element Tearing and Interconnecting - Dual Primal) discretization. The fundamental FETI-DP equation can be solved by a number of different approaches. In our approach the FETI-DP problem will be reformulated as Saddle Point system, by eliminating the primal and Lagrangian variables. For the reduced Saddle Point system, only defined by interior and dual variables, special Uzawa algorithms can be adapted for iteratively solving the FETI-DP saddle-point equation system (FETI-DP SPE). A conjugate gradient version of the Uzawa algorithm will be shown as well as some numerical tests regarding to FETI-DP discretization of small examples using the presented solution technique. Furthermore the inversion of the interior-dual Schur complement operator can be approximated using different techniques building an adequate preconditioning matrix and therewith leading to substantial gains in computing time efficiency. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28874 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Lömker, Thorsten Michael ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SOLVING REVITALIZATION-PROBLEMS BY THE USE OF A CONSTRAINT PROGRAMING LANGUAGE N2 - This research focuses on an approach to describe principles in architectural layout planning within the domain of revitalization. With the aid of mathematical rules, which are executed by a computer, solutions to design problems are generated. Provided that "design" is in principle a combinatorial problem, i.e. a constraint-based search for an overall optimal solution of a problem, an exemplary method will be described to solve such problems in architectural layout planning. To avoid conflicts relating to theoretical subtleness, a customary approach adopted from Operations Research has been chosen in this work. In this approach, design is a synonym for planning, which could be described as a systematic and methodical course of action for the analysis and solution of current or future problems. The planning task is defined as an analysis of a problem with the aim to prepare optimal decisions by the use of mathematical methods. The decision problem of a planning task is represented by an optimization model and the application of an efficient algorithm in order to aid finding one or more solutions to the problem. The basic principle underlying the approach presented herein is the understanding of design in terms of searching for solutions that fulfill specific criteria. This search is executed by the use of a constraint programming language. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29874 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Perepelitsa, V. A. A1 - Tebueva, F.B. A1 - Shenkao, Timour ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SOLVABILITY EXPLORATION OF SEGMENTATION PROBLEM WITH LINEAR CONVOLUTION ALGORITHMS N2 - The paper is dedicated to decidability exploration of market segmentation problem with the help of linear convolution algorithms. Mathematical formulation of this problem represents interval task of bipartite graph cover by stars. Vertices of the first partition correspond to types of commodities, vertices of the second – to customers groups. Appropriate method is offered for interval problem reduction to two-criterion task that has one implemented linear convolution algorithm. Unsolvability with the help of linear convolution algorithm of multicriterion, and consequently interval, market segmentation problem is proved. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29999 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Eiermann, Michael A1 - Ernst, O. A1 - Ullmann, Elisabeth ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SOLUTION STRATEGIES FOR STOCHASTIC FINITE ELEMENT DISCRETIZATIONS N2 - We consider efficient numerical methods for the solution of partial differential equations with stochastic coefficients or right hand side. The discretization is performed by the stochastic finite element method (SFEM). Separation of spatial and stochastic variables in the random input data is achieved via a Karhunen-Loève expansion or Wiener's polynomial chaos expansion. We discuss solution strategies for the Galerkin system that take advantage of the special structure of the system matrix. For stochastic coefficients linear in a set of independent random variables we employ Krylov subspace recycling techniques after having decoupled the large SFEM stiffness matrix. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29493 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Beran, Václav A1 - Hromada, E. ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SOFTWARE FOR PROJECT RELIABILITY ESTIMATION AND RISK EVALUATION N2 - The contribution presents a model that is able to simulate construction duration and cost for a building project. This model predicts set of expected project costs and duration schedule depending on input parameters such as production speed, scope of work, time schedule, bonding conditions and maximum and minimum deviations from scope of work and production speed. The simulation model is able to calculate, on the basis of input level of probability, the adequate construction cost and time duration of a project. The reciprocal view attends to finding out the adequate level of probability for construction cost and activity durations. Among interpretive outputs of the application software belongs the compilation of a presumed dynamic progress chart. This progress chart represents the expected scenario of development of a building project with the mapping of potential time dislocations for particular activities. The calculation of a presumed dynamic progress chart is based on an algorithm, which calculates mean values as a partial result of the simulated building project. Construction cost and time models are, in many ways, useful tools in project management. Clients are able to make proper decisions about the time and cost schedules of their investments. Consequently, building contractors are able to schedule predicted project cost and duration before any decision is finalized. KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-29255 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER - TY - CHAP A1 - Hamm, Matthias A1 - Beißert, Ulrike A1 - König, Markus ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SIMULATION-BASED OPTIMIZATION OF CONSTRUCTION SCHEDULES BY USING PARETO SIMULATED ANNEALING N2 - Within the scheduling of construction projects, different, partly conflicting objectives have to be considered. The specification of an efficient construction schedule is a challenging task, which leads to a NP-hard multi-criteria optimization problem. In the past decades, so-called metaheuristics have been developed for scheduling problems to find near-optimal solutions in reasonable time. This paper presents a Simulated Annealing concept to determine near-optimal construction schedules. Simulated Annealing is a well-known metaheuristic optimization approach for solving complex combinatorial problems. To enable dealing with several optimization objectives the Pareto optimization concept is applied. Thus, the optimization result is a set of Pareto-optimal schedules, which can be analyzed for selecting exactly one practicable and reasonable schedule. A flexible constraint-based simulation approach is used to generate possible neighboring solutions very quickly during the optimization process. The essential aspects of the developed Pareto Simulated Annealing concept are presented in detail. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28499 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Vorechovský, Miroslav ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SIMULATION OF SIMPLY CROSS CORRELATED RANDOM FIELDS BY SERIES EXPANSION METHODS N2 - A practical framework for generating cross correlated fields with a specified marginal distribution function, an autocorrelation function and cross correlation coefficients is presented in the paper. The contribution promotes a recent journal paper [1]. The approach relies on well known series expansion methods for simulation of a Gaussian random field. The proposed method requires all cross correlated fields over the domain to share an identical autocorrelation function and the cross correlation structure between each pair of simulated fields to be simply defined by a cross correlation coefficient. Such relations result in specific properties of eigenvectors of covariance matrices of discretized field over the domain. These properties are used to decompose the eigenproblem which must normally be solved in computing the series expansion into two smaller eigenproblems. Such decomposition represents a significant reduction of computational effort. Non-Gaussian components of a multivariate random field are proposed to be simulated via memoryless transformation of underlying Gaussian random fields for which the Nataf model is employed to modify the correlation structure. In this method, the autocorrelation structure of each field is fulfilled exactly while the cross correlation is only approximated. The associated errors can be computed before performing simulations and it is shown that the errors happen especially in the cross correlation between distant points and that they are negligibly small in practical situations. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28995 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Bauer, Marek A1 - Richter, Matthias A1 - Weiß, Hendrik ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SIMULATION MODEL OF TRAM ROUTE OPERATION N2 - From passenger’s perspective, punctuality is one of the most important features of tram route operation. We present a stochastic simulation model with special focus on determining important factors of influence. The statistical analysis bases on large samples (sample size is nearly 2000) accumulated from comprehensive measurements on eight tram routes in Cracow. For the simulation, we are not only interested in average values but also in stochastic characteristics like the variance and other properties of the distribution. A realization of trams operations is assumed to be a sequence of running times between successive stops and times spent by tram at the stops divided in passengers alighting and boarding times and times waiting for possibility of departure . The running time depends on the kind of track separation including the priorities in traffic lights, the length of the section and the number of intersections. For every type of section, a linear mixed regression model describes the average running time and its variance as functions of the length of the section and the number of intersections. The regression coefficients are estimated by the iterative re-weighted least square method. Alighting and boarding time mainly depends on type of vehicle, number of passengers alighting and boarding and occupancy of vehicle. For the distribution of the time waiting for possibility of departure suitable distributions like Gamma distribution and Lognormal distribution are fitted. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28295 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Flaig, Thomas A1 - Apel, Thomas ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SIMULATION AND MATHEMATICAL OPTIMIZATION OF THE HYDRATION OF CONCRETE FOR AVOIDING THERMAL CRACKS N2 - After mixing of concrete, the hardening starts by an exothermic chemical reaction known as hydration. As the reaction rate depends on the temperature the time in the description of the hydration is replaced by the maturity which is defined as an integral over a certain function depending on the temperature. The temperature distribution is governed by the heat equation with a right hand side depending on the maturity and the temperature itself. We compare of the performance of different time integration schemes of higher order with an automatic time step control. The simulation of the heat distribution is of importance as the development of mechanical properties is driven by the hydration. During this process it is possible that the tensile stresses exceed the tensile strength and cracks occur. The goal is to produce cheap concrete without cracks. Simple crack-criterions use only temperature differences, more involved ones are based on thermal stresses. If the criterion predicts cracks some changes in the input data are needed. This can be interpreted as optimization. The final goal will be to adopt model based optimization (in contrast to simulation based optimization) to the problem of the hydration of young concrete and the avoidance of cracks. The first step is the simulation of the hydration, which we focus in this paper. KW - Angewandte Informatik KW - Angewandte Mathematik KW - Architektur KW - Computerunterstütztes Verfahren KW - Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170314-28424 UR - http://euklid.bauing.uni-weimar.de/ikm2009/paper.html SN - 1611-4086 ER - TY - CHAP A1 - Weitzmann, Rüdiger ED - Gürlebeck, Klaus ED - Könke, Carsten T1 - SIMPLIFIED CYCLE-BASED DESIGN OF EXTREMELY LOADED STRUCTURES N2 - The design of safety-critical structures, exposed to cyclic excitations demands for non-degrading or limited-degrading behavior during extreme events. Among others, the structural behavior is mainly determined by the amount of plastic cycles, completed during the excitation. Existing simplified methods often ignore this dependency, or assume/request sufficient cyclic capacity. The paper introduces a new performance based design method that considers explicitly a predefined number of re-plastifications. Hereby approaches from the shakedown theory and signal processing methods are utilized. The paper introduces the theoretical background, explains the steps of the design procedure and demonstrates the applicability with help of an example. This project was supported by German Science Foundation (Deutsche Forschungsgemeinschaft, DFG) KW - Architektur KW - CAD KW - Computerunterstütztes Verfahren Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:gbv:wim2-20170327-30338 UR - http://euklid.bauing.uni-weimar.de/ikm2006/index.php_lang=de&what=papers.html ER -