@inproceedings{ErlemannHartmann,
  author    = {Erlemann, Kai and Hartmann, Dietrich},
  title     = {PARALLELIZATION OF A MICROSCOPIC TRAFFIC SIMULATION SYSTEM USING MPIJAVA},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2951},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29516},
  pages     = {8},
  abstract  = {Traffic simulation is a valuable tool for the design and evaluation of road networks. Over the years, the level of detail to which urban and freeway traffic can be simulated has increased steadily, shifting from a merely qualitative macroscopic perspective to a very detailed microscopic view, where the behavior of individual vehicles is emulated realistically. With the improvement of behavioral models, however, the computational complexity has also steadily increased, as more and more aspects of real-life traffic have to be considered by the simulation environment. Despite the constant increase in computing power of modern personal computers, microscopic simulation stays computationally expensive, limiting the maximum network size than can be simulated on a single-processor computer in reasonable time. Parallelization can distribute the computing load from a single computer system to a cluster of several computing nodes. To this end, the exisiting simulation framework had to be adapted to allow for a distributed approach. As the simulation is ultimately targeted to be executed in real-time, incorporating real traffic data, only a spatial partition of the simulation was considered, meaning the road network has to be partitioned into subnets of comparable complexity, to ensure a homogenous load balancing. The partition process must also ensure, that the division between subnets does only occur in regions, where no strong interaction between the separated road segments occurs (i.e. not in the direct vicinity of junctions). In this paper, we describe a new microscopic reasoning voting strategy, and discuss in how far the increasing computational costs of these more complex behaviors lend themselves to a parallelized approach. We show the parallel architecture employed, the communication between computing units using MPIJava, and the benefits and pitfalls of adapting a single computer application to be used on a multi-node computing cluster.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{ErikssonKettunen,
  author    = {Eriksson, Sirkka-Liisa and Kettunen, Jarkko},
  title     = {HYPERMONOGENIC POLYNOMIALS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2950},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29509},
  pages     = {22},
  abstract  = {It is well know that the power function is not monogenic. There are basically two ways to include the power function into the set of solutions: The hypermonogenic functions or holomorphic Cliffordian functions. L. Pernas has found out the dimension of the space of homogenous holomorphic Cliffordian polynomials of degree m, but his approach did not include a basis. It is known that the hypermonogenic functions are included in the space of holomorphic Cliffordian functions. As our main result we show that we can construct a basis for the right module of homogeneous holomorphic Cliffordian polynomials of degree m using hypermonogenic polynomials and their derivatives. To that end we first recall the function spaces of monogenic, hypermonogenic and holomorphic Cliffordian functions and give the results needed in the proof of our main theorem. We list some basic polynomials and their properties for the various function spaces. In particular, we consider recursive formulas, rules of differentiation and properties of linear independency for the polynomials.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{EiermannErnstUllmann,
  author    = {Eiermann, Michael and Ernst, O. and Ullmann, Elisabeth},
  title     = {SOLUTION STRATEGIES FOR STOCHASTIC FINITE ELEMENT DISCRETIZATIONS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2949},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29493},
  pages     = {11},
  abstract  = {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{\`e}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.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{Eickelkamp,
  author    = {Eickelkamp, Jens Peter},
  title     = {LIQUIDIT{\"A}TSPLANUNG VON BAUPROJEKTEN},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2948},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29483},
  pages     = {12},
  abstract  = {Die Liquidit{\"a}tsplanung von Bauunternehmen XE "Liquidit{\"a}tsplanung" gilt als ein wesentliches Steuerungs-, Kontroll- sowie Informationsinstrument f{\"u}r interne und externe Adressaten und {\"u}bt eine Entscheidungsunterst{\"u}tzungsfunktion aus. Da die einzelnen Bauprojekte einen wesentlichen Anteil an den Gesamtkosten des Unternehmens ausmachen, besitzen diese auch einen erheblichen Einfluß auf die Liquidit{\"a}t und die Zahlungsf{\"a}higkeit der Bauunternehmung. Dem folgend ist es in der Baupraxis eine {\"u}bliche Verfahrensweise, die Liquidit{\"a}tsplanung zuerst projektbezogen zu erstellen und anschließend auf Unternehmensebene zu verdichten. Ziel der Ausf{\"u}hrungen ist es, die Zusammenh{\"a}nge von Arbeitskalkulation XE "Arbeitskalkulation" , Ergebnisrechnung XE "Ergebnisrechnung" und Finanzrechnung XE "Finanzrechnung" in Form eines deterministischen XE "Erkl{\"a}rungsmodells" Planungsmodells auf Projektebene darzustellen. Hierbei soll das Verst{\"a}ndnis und die Bedeutung der Verkn{\"u}pfungen zwischen dem technisch-orientierten Bauablauf und dessen Darstellung im Rechnungs- und Finanzwesen herausgestellt werden. Die Vorg{\"a}nge aus der Bauabwicklung, das heißt die Abarbeitung der Bauleistungsverzeichnispositionen und deren zeitliche Darstellung in einem Bauzeitenplan sind periodisiert in Gr{\"o}ßen der Betriebsbuchhaltung (Leistung, Kosten) zu transformieren und anschließend in der Finanzrechnung (Einzahlungen., Auszahlungen) nach Kreditoren und Debitoren aufzuschl{\"u}sseln.},
  subject      = {Architektur <Informatik>},
  language  = {de}
}
@inproceedings{EckardtKoenke,
  author    = {Eckardt, Stefan and K{\"o}nke, Carsten},
  title     = {ADAPTIVE SIMULATION OF THE DAMAGE BEHAVIOR OF CONCRETE USING HETEROGENEOUS MULTISCALE MODELS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2947},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29478},
  pages     = {15},
  abstract  = {In this paper an adaptive heterogeneous multiscale model, which couples two substructures with different length scales into one numerical model is introduced for the simulation of damage in concrete. In the presented approach the initiation, propagation and coalescence of microcracks is simulated using a mesoscale model, which explicitly represents the heterogeneous material structure of concrete. The mesoscale model is restricted to the damaged parts of the structure, whereas the undamaged regions are simulated on the macroscale. As a result an adaptive enlargement of the mesoscale model during the simulation is necessary. In the first part of the paper the generation of the heterogeneous mesoscopic structure of concrete, the finite element discretization of the mesoscale model, the applied isotropic damage model and the cohesive zone model are briefly introduced. Furthermore the mesoscale simulation of a uniaxial tension test of a concrete prism is presented and own obtained numerical results are compared to experimental results. The second part is focused on the adaptive heterogeneous multiscale approach. Indicators for the model adaptation and for the coupling between the different numerical models will be introduced. The transfer from the macroscale to the mesoscale and the adaptive enlargement of the mesoscale substructure will be presented in detail. A nonlinear simulation of a realistic structure using an adaptive heterogeneous multiscale model is presented at the end of the paper to show the applicability of the proposed approach to large-scale structures.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{EblingScheuermann,
  author    = {Ebling, Julia and Scheuermann, G.},
  title     = {TEMPLATE MATCHING ON VECTOR FIELDS USING CLIFFORD ALGEBRA},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2946},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29464},
  pages     = {25},
  abstract  = {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.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{EbertLenzen,
  author    = {Ebert, Carsten and Lenzen, Armin},
  title     = {OUTPUT-ONLY ANALYSIS FOR EXPERIMENTAL DAMAGE DETECTION OF A TIED-ARCH BRIDGE},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2945},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29452},
  pages     = {13},
  abstract  = {In civil engineering it is very difficult and often expensive to excite constructions such as bridges and buildings with an impulse hammer or shaker. This problem can be avoided with the output-only method as special feature of stochastic system identification. The permanently existing ambient noise (e.g. wind, traffic, waves) is sufficient to excite the structures in their operational conditions. The output-only method is able to estimate the observable part of a state-space-model which contains the dynamic characteristics of the measured mechanical system. Because of the assumption that the ambient excitation is white there is no requirement to measure the input. Another advantage of the output-only method is the possibility to get high detailed models by a special method, called polyreference setup. To pretend the availability of a much larger set of sensors the data from varying sensor locations will be collected. Several successive data sets are recorded with sensors at different locations (moving sensors) and fixed locations (reference sensors). The covariance functions of the reference sensors are bases to normalize the moving sensors. The result of the following subspace-based system identification is a high detailed black-box-model that contains the weighting function including the well-known dynamic parameters eigenfrequencies and mode shapes of the mechanical system. Emphasis of this lecture is the presentation of an extensive damage detection experiment. A 53-year old prestressed concrete tied-arch-bridge in H{\"u}nxe (Germany) was deconstructed in 2005. Preliminary numerous vibration measurements were accomplished. The first experiment for system modification was an additional support near the bridge bearing of one main girder. During a further experiment one hanger from one tied arch was cut through as an induced damage. Some first outcomes of the described experiments will be presented.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{DzwigonHempel,
  author    = {Dzwigon, Wieslaw and Hempel, Lorenz},
  title     = {ZUR SYNCHRONISATION VON LINIEN IM {\"O}PNV},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2944},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29442},
  pages     = {12},
  abstract  = {Wir betrachten im {\"O}PNV ({\"O}ffentlichen Personennahverkehr) diejenige Situation, daß zwei Bus- oder Straßenbahnlinien gemeinsame Haltestellen haben. Ziel unserer Untersuchungen ist es, f{\"u}r beide Linien einen solchen Fahrplan zu finden, der f{\"u}r die Fahrg{\"a}ste m{\"o}glichst viel Bequemlichkeit bietet. Die Bedarfsstruktur - die Anzahl von Personen, die die beiden Linien benutzen - setzt dabei gewisse Beschr{\"a}nkungen f{\"u}r die Taktzeiten der beiden Linien. Die verbleibenden Entscheidungsfreiheiten sollen im Sinne der Zielstellung ausgenutzt werden. Im Vortrag wird folgenden Fragen nachgegangen: - nach welchen Kriterien kann man die "Bequemlichkeit" oder die "Synchonisationsg{\"u}te" messen? - wie kann man die einzelnen "Synchronisationsmaße" berechnen ? - wie kann man die verbleibenden Entscheidungsfreiheiten nutzen, um eine m{\"o}glichst gute Synchronisation zu erreichen ? Die Ergebnisse werden dann auf einige Beispiele angewandt und mit den bereitgestellten Methoden L{\"o}sungsvorschl{\"a}ge unterbreitet.},
  subject      = {Architektur <Informatik>},
  language  = {de}
}
@inproceedings{DudekRichter,
  author    = {Dudek, Mariusz and Richter, Matthias},
  title     = {UNTERSUCHUNGEN ZUR ZUVERL{\"A}SSIGKEIT DES STRAßENBAHNNETZES IN KRAKAU},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2943},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29432},
  pages     = {19},
  abstract  = {Der Begriff der Zuverl{\"a}ssigkeit spielt eine zentrale Rolle bei der Bewertung von Verkehrsnetzen. Aus der Sicht der Nutzer des {\"o}ffentlichen Personennahverkehrs ({\"O}PNV) ist eines der wichtigsten Kriterien zur Beurteilung der Qualit{\"a}t des Liniennetzes, ob es m{\"o}glich ist, mit einer großen Sicherheit das Reiseziel in einer vorgegebenen Zeit zu erreichen. Im Vortrag soll dieser Zuverl{\"a}ssigkeitsbegriff mathematisch gefasst werden. Dabei wird zun{\"a}chst auf den {\"u}blichen Begriff der Zuverl{\"a}ssigkeit eines Netzes im Sinne paarweiser Zusammenhangswahrscheinlichkeiten eingegangen. Dieser Begriff wird erweitert durch die Betrachtung der Zuverl{\"a}ssigkeit unter Einbeziehung einer maximal zul{\"a}ssigen Reisezeit. In vergangenen Arbeiten hat sich die Ring-Radius-Struktur als bew{\"a}hrtes Modell f{\"u}r die theoretische Beschreibung von Verkehrsnetzen erwiesen. Diese {\"U}berlegungen sollen nun durch Einbeziehung realer Verkehrsnetzstrukturen erweitert werden. Als konkretes Beispiel dient das Straßenbahnnetz von Krakau. Hier soll insbesondere untersucht werden, welche Auswirkungen ein geplanter Ausbau des Netzes auf die Zuverl{\"a}ssigkeit haben wird. 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.},
  subject      = {Architektur <Informatik>},
  language  = {de}
}