@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}
}
@inproceedings{DoganArditiGunaydin,
  author    = {Dogan, Sevgi Zeynep and Arditi, D. and Gunaydin, H. Murat},
  title     = {COMPARISON OF ANN AND CBR MODELS FOR EARLY COST PREDICTION OF STRUCTURAL SYSTEMS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2942},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29421},
  abstract  = {Reasonably accurate cost estimation of the structural system is quite desirable at the early stages of the design process of a construction project. However, the numerous interactions among the many cost-variables make the prediction difficult. Artificial neural networks (ANN) and case-based reasoning (CBR) are reported to overcome this difficulty. This paper presents a comparison of CBR and ANN augmented by genetic algorithms (GA) conducted by using spreadsheet simulations. GA was used to determine the optimum weights for the ANN and CBR models. The cost data of twenty-nine actual cases of residential building projects were used as an example application. Two different sets of cases were randomly selected from the data set for training and testing purposes. Prediction rates of 84\% in the GA/CBR study and 89\% in the GA/ANN study were obtained. The advantages and disadvantages of the two approaches are discussed in the light of the experiments and the findings. It appears that GA/ANN is a more suitable model for this example of cost estimation where the prediction of numerical values is required and only a limited number of cases exist. The integration of GA into CBR and ANN in a spreadsheet format is likely to improve the prediction rates.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{DeaconvanRooyen,
  author    = {Deacon, Michael-John and van Rooyen, G.C.},
  title     = {DISTRIBUTED COLLABORATION: ENGINEERING PRACTICE REQUIREMENTS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2941},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29410},
  pages     = {8},
  abstract  = {Designing a structure follows a pattern of creating a structural design concept, executing a finite element analysis and developing a design model. A project was undertaken to create computer support for executing these tasks within a collaborative environment. This study focuses on developing a software architecture that integrates the various structural design aspects into a seamless functional collaboratory that satisfies engineering practice requirements. The collaboratory is to support both homogeneous collaboration i.e. between users operating on the same model and heterogeneous collaboration i.e. between users operating on different model types. Collaboration can take place synchronously or asynchronously, and the information exchange is done either at the granularity of objects or at the granularity of models. The objective is to determine from practicing engineers which configurations they regard as best and what features are essential for working in a collaborative environment. Based on the suggestions of these engineers a specification of a collaboration configuration that satisfies engineering practice requirements will be developed.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{CruzFalcaoMalonek,
  author    = {Cruz, J. F. and Falc{\~a}o, M. Irene and Malonek, Helmuth Robert},
  title     = {3D-MAPPINGS AND THEIR APPROXIMATION BY SERIES OF POWERS OF A SMALL PARAMETER},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2940},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29406},
  pages     = {14},
  abstract  = {In classical complex function theory the geometric mapping property of conformality is closely linked with complex differentiability. In contrast to the planar case, in higher dimensions the set of conformal mappings is only the set of M{\"o}bius transformations. Unfortunately, the theory of generalized holomorphic functions (by historical reasons they are called monogenic functions) developed on the basis of Clifford algebras does not cover the set of M{\"o}bius transformations in higher dimensions, since M{\"o}bius transformations are not monogenic. But on the other side, monogenic functions are hypercomplex differentiable functions and the question arises if from this point of view they can still play a special role for other types of 3D-mappings, for instance, for quasi-conformal ones. On the occasion of the 16th IKM 3D-mapping methods based on the application of Bergman's reproducing kernel approach (BKM) have been discussed. Almost all authors working before that with BKM in the Clifford setting were only concerned with the general algebraic and functional analytic background which allows the explicit determination of the kernel in special situations. The main goal of the abovementioned contribution was the numerical experiment by using a Maple software specially developed for that purpose. Since BKM is only one of a great variety of concrete numerical methods developed for mapping problems, our goal is to present a complete different from BKM approach to 3D-mappings. In fact, it is an extension of ideas of L. V. Kantorovich to the 3-dimensional case by using reduced quaternions and some suitable series of powers of a small parameter. Whereas until now in the Clifford case of BKM the recovering of the mapping function itself and its relation to the monogenic kernel function is still an open problem, this approach avoids such difficulties and leads to an approximation by monogenic polynomials depending on that small parameter.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{FalcaoCruzMalonek,
  author    = {Falc{\~a}o, M. Irene and Cruz, J. F. and Malonek, Helmuth Robert},
  title     = {REMARKS ON THE GENERATION OF MONOGENIC FUNCTIONS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2939},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29390},
  pages     = {18},
  abstract  = { In this paper we consider three different methods for generating monogenic functions. The first one is related to Fueter's well known approach to the generation of monogenic quaternion-valued functions by means of holomorphic functions, the second one is based on the solution of hypercomplex differential equations and finally the third one is a direct series approach, based on the use of special homogeneous polynomials. We illustrate the theory by generating three different exponential functions and discuss some of their properties. Formula que se usa em preprints e artigos da nossa UI\&D (acho demasiado completo): Partially supported by the R\\&D unit \emph{Matem\'atica a Aplica\c\~es} (UIMA) of the University of Aveiro, through the Portuguese Foundation for Science and Technology (FCT), co-financed by the European Community fund FEDER.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}
@inproceedings{ConstalesKrausshar,
  author    = {Constales, Denis and Kraußhar, Rolf S{\"o}ren},
  title     = {ON THE NAVIER-STOKES EQUATION WITH FREE CONVECTION IN STRIP DOMAINS AND 3D TRIANGULAR CHANNELS},
  editor    = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
  organization    = {Bauhaus-Universit{\"a}t Weimar},
  doi       = {10.25643/bauhaus-universitaet.2938},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170327-29387},
  pages     = {12},
  abstract  = {The Navier-Stokes equations and related ones can be treated very elegantly with the quaternionic operator calculus developed in a series of works by K. Guerlebeck, W. Sproeossig and others. This study will be extended in this paper. In order to apply the quaternionic operator calculus to solve these types of boundary value problems fully explicitly, one basically needs to evaluate two types of integral operators: the Teodorescu operator and the quaternionic Bergman projector. While the integral kernel of the Teodorescu transform is universal for all domains, the kernel function of the Bergman projector, called the Bergman kernel, depends on the geometry of the domain. With special variants of quaternionic holomorphic multiperiodic functions we obtain explicit formulas for three dimensional parallel plate channels, rectangular block domains and regular triangular channels. The explicit knowledge of the integral kernels makes it then possible to evaluate the operator equations in order to determine the solutions of the boundary value problem explicitly.},
  subject      = {Architektur <Informatik>},
  language  = {en}
}