@phdthesis{50339, author = {{Solbach, Fabian}}, title = {{{Anwendungspotenzial fuzzybasierter Kosten- und Investitionsentscheidungen im Projektmanagement}}}, year = {{2007}}, } @inproceedings{13206, author = {{Trier, Matthias and Richter, Alexander and Mörl, Susanne and Koch, Michael}}, booktitle = {{10th International Conference on Wirtschaftsinformatik}}, editor = {{Bernstein, A and Schwabe, G}}, title = {{{Anwendungsszenarien als Werkzeug zur (V) Ermittlung des Nutzens von corporate social software}}}, year = {{2011}}, } @inproceedings{13345, author = {{Richter, Alexander and Mörl, Susanne and Trier, Matthias and Koch, Michael}}, pages = {{1104--1113}}, title = {{{Anwendungsszenarien als Werkzeug zur (V)Ermittlung des Nutzens von Corporate Social Software}}}, year = {{2011}}, } @article{19218, abstract = {{ The radial part of the Klein–Gordon equation for the Woods–Saxon potential is solved. In our calculations, we have applied the Nikiforov–Uvarov method by using the Pekeris approximation to the centrifugal potential for any l-states. The exact bound state energy eigenvalues and the corresponding eigenfunctions are obtained on the various values of the quantum numbers n and l. The nonrelativistic limit of the bound state energy spectrum was also found. }}, author = {{BADALOV, V. H. and AHMADOV, H. I. and BADALOV, S. V.}}, issn = {{0218-3013}}, journal = {{International Journal of Modern Physics E}}, pages = {{1463--1475}}, title = {{{ANY l-STATE ANALYTICAL SOLUTIONS OF THE KLEIN–GORDON EQUATION FOR THE WOODS–SAXON POTENTIAL}}}, doi = {{10.1142/s0218301310015862}}, year = {{2010}}, } @inproceedings{19850, author = {{Wanka, Rolf}}, booktitle = {{Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}}, isbn = {{9783540003311}}, issn = {{0302-9743}}, pages = {{413--420}}, title = {{{Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}}}, doi = {{10.1007/3-540-36379-3_36}}, year = {{2002}}, } @inproceedings{42891, author = {{Matzner, Tobias and Hitzler, Pascal}}, booktitle = {{Proceedings of the 30th Annual German Conference on Artificial Intelligence. Osnabrück, Germany}}, pages = {{84--9}}, publisher = {{Springer}}, title = {{{Any-World Access to OWL from Prolog}}}, year = {{2007}}, } @inproceedings{2129, author = {{Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}}, booktitle = {{ICALP}}, pages = {{1153----1168}}, publisher = {{Springer}}, title = {{{Anycasting in Adversarial Systems: Routing and Admission Control}}}, volume = {{2719}}, year = {{2003}}, } @inproceedings{46324, abstract = {{The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.}}, author = {{Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}}, booktitle = {{Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}}, pages = {{1–8}}, publisher = {{IEEE}}, title = {{{Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}}}, year = {{2020}}, } @inproceedings{48844, abstract = {{The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.}}, author = {{Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}}, booktitle = {{2020 IEEE Congress on Evolutionary Computation (CEC)}}, pages = {{1–8}}, publisher = {{IEEE Press}}, title = {{{Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}}}, doi = {{10.1109/CEC48606.2020.9185613}}, year = {{2020}}, } @inproceedings{38360, author = {{Koch, B. and Noé, Reinhold and Mirvoda, V. and Sandel, D. and Panhwar, M. F.}}, booktitle = {{2014 OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE AND AUSTRALIAN CONFERENCE ON OPTICAL FIBRE TECHNOLOGY (OECC/ACOFT 2014)}}, isbn = {{978-1-922107-21-3}}, pages = {{643--645}}, title = {{{APD-BASED INTERFERENCE DETECTORS YIELD 7-dB DYNAMIC RANGE OF 70-krad/s PDM-DPSK ENDLESS POLARIZATION DEMULTIPLEXER}}}, year = {{2014}}, } @inproceedings{38310, author = {{Koch, B. and Noé, Reinhold and Mirvoda, V. and Sandel, D. and Panhwar, M. F.}}, booktitle = {{2014 OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE AND AUSTRALIAN CONFERENCE ON OPTICAL FIBRE TECHNOLOGY (OECC/ACOFT 2014)}}, isbn = {{978-1-922107-21-3}}, pages = {{643--645}}, title = {{{APD-BASED INTERFERENCE DETECTORS YIELD 7-dB DYNAMIC RANGE OF 70-krad/s PDM-DPSK ENDLESS POLARIZATION DEMULTIPLEXER}}}, year = {{2014}}, } @book{49521, editor = {{Meyer zu Hörste-Bührer, R.J. and Müller-Salo, J. and Neumann, N.}}, title = {{{Apocalypse Now (Again)!, Spielarten der Apokalypse in ethischen Kontexten.}}}, year = {{2023}}, } @inbook{49513, author = {{Süwolto, Leonie}}, booktitle = {{Werke im Dialog. (Virtuelle) Begegnungen in 40 Jahren ‚Paderborner Gastdozentur für Schriftstellerinnen und Schriftsteller‘}}, editor = {{Eke, Norbert Otto and Elit, Stefan}}, pages = {{205--225}}, publisher = {{Erich Schmidt}}, title = {{{Apocalypse Now? Endzeitphantasmen bei Wilhelm Genazino und Markus Orths}}}, volume = {{Sonderheft zum Band 142}}, year = {{2023}}, } @inbook{33431, author = {{Kißling, Magdalena}}, booktitle = {{Rassismussensibler Literaturunterricht – Grundlagen, Dimensionen, Herausforderungen, Möglichkeiten}}, editor = {{Becker, Karina and Hofmann, Michael}}, pages = {{235--251}}, publisher = {{Königshausen & Neumann }}, title = {{{Apologie für das Nebensächliche. Prinzipien einer intersektional orientierten Unterrichtsmodel-lierung am Beispiel von Aneignungsperspektiven zu einer jugendpopulären Fernsehserie}}}, year = {{2023}}, } @article{49459, author = {{Masuch, K. and Greve, M. and Trang, S.}}, journal = {{Computers & Security}}, title = {{{Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies}}}, volume = {{12}}, year = {{2022}}, } @misc{30362, author = {{Schafmeister, Frank}}, pages = {{39}}, title = {{{Apparatus and method for charging an electric battery vehicle}}}, year = {{2020}}, } @article{13168, author = {{Dubberke, Frithjof H. and Rasche, David B. and Baumhögger, Elmar and Vrabec, Jadran}}, issn = {{0034-6748}}, journal = {{Review of Scientific Instruments}}, title = {{{Apparatus for the measurement of the speed of sound of ammonia up to high temperatures and pressures}}}, doi = {{10.1063/1.4891795}}, year = {{2014}}, } @article{30678, author = {{Javed, Muhammad Ali and Vater, Sebastian and Baumhögger, Elmar and Windmann, Thorsten and Vrabec, Jadran}}, issn = {{0021-9614}}, journal = {{The Journal of Chemical Thermodynamics}}, keywords = {{Physical and Theoretical Chemistry, General Materials Science, Atomic and Molecular Physics, and Optics}}, publisher = {{Elsevier BV}}, title = {{{Apparatus for the measurement of the thermodynamic speed of sound of diethylene glycol and triethylene glycol}}}, doi = {{10.1016/j.jct.2022.106766}}, year = {{2022}}, } @inproceedings{45055, author = {{Knickenberg, Margarita and Chantal, Hinni}}, location = {{Aachen}}, title = {{{Applicability of ESM in School: Quality of students' social interaction}}}, year = {{2019}}, } @article{34089, author = {{Riedl, Thomas and Lindner, Jörg}}, issn = {{0038-1098}}, journal = {{Solid State Communications}}, keywords = {{Materials Chemistry, Condensed Matter Physics, General Chemistry}}, publisher = {{Elsevier BV}}, title = {{{Applicability of molecular statics simulation to partial dislocations in GaAs}}}, doi = {{10.1016/j.ssc.2020.113927}}, volume = {{314-315}}, year = {{2020}}, } @article{34090, author = {{Riedl, Thomas and Lindner, Jörg}}, issn = {{0038-1098}}, journal = {{Solid State Communications}}, keywords = {{Materials Chemistry, Condensed Matter Physics, General Chemistry}}, publisher = {{Elsevier BV}}, title = {{{Applicability of molecular statics simulation to partial dislocations in GaAs}}}, doi = {{10.1016/j.ssc.2020.113927}}, volume = {{314-315}}, year = {{2020}}, } @inproceedings{6295, author = {{Wehner, M C and Giardini, A and Kabst, Rüdiger}}, title = {{{Applicant reactions to outsourcing of the recruitment: Does corporate image compensate for negative applicant reactions?}}}, year = {{2011}}, } @inbook{20914, abstract = {{This chapter summarizes the application and evaluation of the SPES engineering methodology in the automotive domain. After introducing the particular domain characteristics, we state some research questions that we have investigated. Some of the activities that address these research questions are presented in detail. We conclude that the SPES engineering methodology is a good basis for the development of automotive systems, but could be further refined to fit the particular needs of the domain.}}, author = {{Fockel, Markus and Heidl, Peter and Höfflinger, Jens and Hönninger, Harald and Holtmann, Jörg and Horn, Wilfried and Meyer, Jan and Meyer, Matthias and Schäuffele, Jörg}}, booktitle = {{Model-Based Engineering of Embedded Systems}}, isbn = {{9783642346132}}, title = {{{Application and Evaluation in the Automotive Domain}}}, doi = {{10.1007/978-3-642-34614-9_12}}, year = {{2012}}, } @inproceedings{39922, abstract = {{The paper gives an overview on some of the most important artificial neural networks and their implementation as integrated circuits. The performances of these networks are dicussed with regard to the potential of current and future technologies. The overview closes with some possible applications of neural networks in microelectronics.}}, author = {{Goser, K. and Hilleringmann, Ulrich and Rückert, U.}}, booktitle = {{Artificial Neural Networks}}, editor = {{Prieto, Alberto}}, isbn = {{978-3-540-38460-1}}, pages = {{243–259}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Application and implementation of neural networks in microelectronics}}}, year = {{1991}}, } @inproceedings{25265, abstract = {{Waveguide-based methods can be used for the non-destructive determination of acoustic material parameters. One of these methods is based on transmission measurements of cylindrical polymeric specimens. Here, the experimental setup consists of two transducers, which excite and receive the waveguide modes at the faces of the cylinder. The measurement, as well as a forward model, are used to determine material parameters of the polymeric specimen in an inverse approach. 1-3 piezoelectric composites are used as an active element because they can be approximated by a thickness vibration only. This allows an easy identification of Mason model parameters to characterise the transducers’ vibration behaviour. However, sensitivity analysis shows a high uncertainty in the determination of the mechanical shear parameters due to the uniform excitation. To increase the sensitivity to these shear motions, arbitrary excitations were investigated by means of numerical simulation. In order to be able to realise the determined optimal excitation, new transducer prototypes were designed. By subdividing the electrodes of the active element, for example, ring-shaped excitation is feasible. Furthermore, it can be shown that modelling these transducers with a one-dimensional Mason model is sufficient.}}, author = {{Dreiling, Dmitrij and Itner, Dominik and Feldmann, Nadine and Scheidemann, Claus and Gravenkamp, Hauke and Henning, Bernd}}, booktitle = {{Fortschritte der Akustik - DAGA 2021}}, location = {{Wien}}, publisher = {{Deutsche Gesellschaft für Akustik e.V. (DEGA)}}, title = {{{Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes}}}, year = {{2021}}, } @phdthesis{220, author = {{Keller, Matthias}}, publisher = {{Universität Paderborn}}, title = {{{Application Deployment at Distributed Clouds}}}, year = {{2016}}, } @inproceedings{34720, author = {{Schöppner, Volker and Köllermeier, Jonas}}, location = {{Fukuoka}}, title = {{{Application of a Dynamic Approach to Determine the Optimal Barrel Temperature of Single Screw Extruders}}}, year = {{2022}}, } @article{43371, abstract = {{Laser structuring to improve the adhesion properties of steel substrates in fiber-metal laminates offers many advantages that are highly suitable for modern industrial requirements. Maintenance and energy costs are relatively low, it is easy to automate, and there are no by-products such as chemicals or abrasives to dispose of or recycle. This makes laser structuring a particularly environmentally friendly process, which is nowadays more important than ever. On the other hand, the process time for laser structuring is much higher than for chemical pre-treatment, for example. In past studies, the time and cost efficiency of the laser structuring process has tended to play a minor role. However, there are approaches in which laser structured surfaces are adapted to the shear stress peaks occurring within the adhesive layer, thus requiring only partial structuring of the area to be bonded, potentially saving process time. In this experimental study, electrolytically galvanized steel substrates were partially laser structured to match the shear stress distribution and then bonded to a carbon fiber-reinforced plastic. The adhesion properties achieved were characterized using shear tensile tests and compared with the properties of the fully structured ones. With the partial laser structuring, a saving of 66 % of the conventional process time was achieved while maintaining 95 % of the same shear strength.}}, author = {{Voswinkel, Dietrich}}, journal = {{Journal of Manufacturing Processes}}, keywords = {{Laser treatment Adhesive bonding Surface technology Hybrid materials}}, pages = {{10--19}}, publisher = {{Elsevier}}, title = {{{Application of a new strategy for time-efficient laser treatment of galvanized steel substrates to improve the adhesion properties}}}, doi = {{/10.1016/j.jmapro.2023.03.056}}, volume = {{94}}, year = {{2023}}, } @article{30640, abstract = {{Surface determination is an essential step of the measurement process in industrial X-ray computed tomography (XCT). The starting point of the surface determination process step is a single grey value threshold within a voxel volume in conventional surface determination methods. However, this value is not always found in the reconstructed volume in the local environment of the surface of the measurement object due to various artefacts, so that none or incorrect surfaces are determined. In order to find surfaces independently of a single grey value, a three-dimensional approach of the initial contour determination based on a Prewitt edge detection algorithm is presented in this work. This method is applied to different test specimens and specimen compositions which, due to their material or material constellation, their geometric properties with regard to surfaces and interfaces as well as their calibrated size and length dimensions, embody relevant properties in the examination of joining connections. It is shown that by using the surface determination method in the measurement process, both a higher metrological structure resolution and interface structure resolution can be achieved. Surface artefacts can be reduced by the application and it is also an approach to improved surface finding for the multi-material components that are challenging for XCT.}}, author = {{Busch, M. and Hausotte, T.}}, journal = {{Production Engineering}}, title = {{{Application of an edge detection algorithm for surface determination in industrial X-ray computed tomography}}}, doi = {{10.1007/s11740-021-01100-z}}, year = {{2022}}, } @misc{13220, author = {{Webersen, Manuel and Bause, Fabian and Henning, Bernd}}, title = {{{Application of Automatic Differentiation for the inverse parameter identification of complex-valued forward models}}}, year = {{2015}}, } @inproceedings{11757, abstract = {{Clustering techniques have been integrated at different levels into the training procedure of a continuous-density hidden Markov model (HMM) speech recognizer. These clustering techniques can be used in two ways. First acoustically similar states are tied together. It will help to reduce the number of parameters but also allow to train otherwise rarely seen states together with more robust ones (state-tying). Secondly densities are clustered across states, this reduces the number of densities while at the same time keeping the best performances of our recognizer (density-clustering). We have applied these techniques both to word-based small-vocabulary and phoneme-based large-vocabulary recognition tasks. On the WSJ task, we could achieve a reduction of the word error rate by 7%. On the TI/NIST-connected digit task, the number of parameters was reduced by a factor 2-3 while keeping the same string error rate.}}, author = {{Dugast, Christian and Beyerlein, Peter and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP, Detroit}}, title = {{{Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition}}}, year = {{1995}}, } @inproceedings{29471, author = {{Gehler, M. and Ober-Blöbaum, Sina and Dachwald, B.}}, booktitle = {{Procceedings of the 60th International Astronautical Congress}}, location = {{Daejeon, Republic of Korea}}, title = {{{Application of discrete mechanics and optimal control to spacecraft in non-Keplerian motion around small solar systems}}}, year = {{2009}}, } @article{41909, abstract = {{The continuous development of medical methods in recent decades has achieved measurable improvement. The interdisciplinary cooperation of engineers and physicians is a forward-looking component of this development. However, this cooperation also results in new interfaces on the communication and software level, which must be defined by implementing a systematic workflow. In this paper, the step-by-step implementation of engineering methods into the surgical workflow is shown. The focus is on the basic requirements and the necessary exchange of information. Additively manufactured models for preoperative elucidation of the patient are used as a psychological added value to increase the transparency of the surgical procedure. In addition, the models serve to train young surgeons and provide the opportunity to plan advanced surgical techniques.}}, author = {{Risse, Lena and Kullmer, Gunter}}, issn = {{2059-4755}}, journal = {{Journal of 3D Printing in Medicine}}, keywords = {{General Medicine}}, number = {{2}}, pages = {{111--121}}, publisher = {{Future Medicine Ltd}}, title = {{{Application of engineering methods in the planning process of surgical treatments}}}, doi = {{10.2217/3dp-2020-0020}}, volume = {{5}}, year = {{2021}}, } @article{9808, abstract = {{This study presents the methods employed by a team from the department of Mechatronics and Dynamics at the University of Paderborn, Germany for the 2013 PHM data challenge. The focus of the challenge was on maintenance action recommendation for an industrial machinery based on remote monitoring and diagnosis. Since an ensemble of data driven methods has been considered as the state of the art approach in diagnosis and prognosis, the first approach was to evaluate the performance of an ensemble of data driven methods using the parametric data as input and problems (recommended maintenance action) as the output. Due to close correlation of parametric data of different problems, this approach produced high misclassification rate. Event-based decision trees were then constructed to identify problems associated with particular events. To distinguish between problems associated with events that appeared in multiple problems, support vector machine (SVM) with parameters optimally tuned using particle swarm optimization (PSO) was employed. Parametric data was used as the input to the SVM algorithm and majority voting was employed to determine the final decision for cases with multiple events. A total of 165 SVM models were constructed. This approach improved the overall score from 21 to 48. The method was further enhanced by employing an ensemble of three data driven methods, that is, SVM, random forests (RF) and bagged trees (BT), to build the event based models. With this approach, a score of 51 was obtained . The results demonstrate that the proposed event based method can be effective in maintenance action recommendation based on events codes and parametric data acquired remotely from an industrial equipment.}}, author = {{Kimotho, James Kuria and Sondermann-Wölke, Chritoph and Meyer, Tobias and Sextro, Walter}}, journal = {{International Journal of Prognostics and Health Management}}, keywords = {{maintenance decision, Bagged trees, Decision trees, PSO-SVM, Random forests}}, number = {{2}}, title = {{{Application of Event Based Decision Tree and Ensemble of Data Driven Methods for Maintenance Action Recommendation}}}, volume = {{4}}, year = {{2013}}, } @inproceedings{7921, author = {{Heckel, Reiko and Cherchago, Alexey}}, booktitle = {{Proceedings of the seminar on Language Engineering for Model-Driven Software Development (2003), Dagstuhl (Germany)}}, publisher = {{Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI)}}, title = {{{Application of Graph Transformation for Automating Web Service Discovery}}}, year = {{2004}}, } @article{25619, author = {{Schöppner, Volker and Dörner, M. and Marschik, C. and Roland, W. and Miethlinger, J. and Steinbichler, G.}}, journal = {{Polymers}}, pages = {{1488--1515}}, title = {{{Application of Network Analysis to Flow Systems with Alternating Wave Channels: Part A (Pressure Flows).}}}, year = {{2019}}, } @article{24207, author = {{Schöppner, Volker and Dörner, M. and Marschik, C. and Roland, W. and Schaufler, S. and Steinbichler, G.}}, journal = {{Polymers}}, number = {{12(9)}}, pages = {{1900}}, title = {{{Application of Network Analysis to Flow Systems with Alternating Wave Channels: Part B. (Superimposed Drag-Pressure Flows in Extrusion)}}}, year = {{2020}}, } @inproceedings{29994, author = {{Scheffler, Sebastian and Böcker, Joachim}}, booktitle = {{Applications of Neural Adaptive Control Technology}}, isbn = {{981-02-3151-2}}, location = {{Berlin, Germany}}, pages = {{281--302}}, publisher = {{World Scientific}}, title = {{{Application of Neural Networks for Control of Four-Quadrant Converters in Railway Propulsion Systems Applications of Neural Adaptive Control Technology}}}, volume = {{17}}, year = {{1997}}, } @article{30700, author = {{Zirngibl, C. and Dworschak, F. and Schleich, B. and Wartzack, S.}}, journal = {{Production Engineering}}, title = {{{Application of reinforcement learning for the optimization of clinch joint characteristics}}}, doi = {{10.1007/s11740-021-01098-4}}, year = {{2021}}, } @book{22393, author = {{Hölscher, Christian and Keßler, Jan Henning and Meyer, Tobias and Rasche, Christoph and Reinold, Peter and Sextro, Walter}}, isbn = {{978-3-642-53741-7}}, pages = {{16--21}}, publisher = {{Springer Verlag (Lecture Notes in Mechanical Engineering)}}, title = {{{Application of Self-optimizing Systems}}}, doi = {{10.1007/978-3-642-53742-4}}, year = {{2014}}, } @article{19755, author = {{Meyer, Sebastian and Meschut, Gerson and Vogt, Hendrik and Behrens, Bernd-Arno and Hübner, Sven and Neumann, André}}, issn = {{0043-2288}}, journal = {{Welding in the World}}, pages = {{565--574}}, title = {{{Application of self-piercing nuts during hot forming of 22MNB5}}}, doi = {{10.1007/s40194-018-00688-8}}, year = {{2018}}, } @article{14887, author = {{Chen, Mei-Hua and Chen, Wei-Fan and Ku, Lun-Wei}}, journal = {{IEEE Access}}, pages = {{24433--24442}}, publisher = {{IEEE}}, title = {{{Application of Sentiment Analysis to Language Learning}}}, volume = {{6}}, year = {{2018}}, } @inproceedings{39492, author = {{Hilleringmann, Ulrich and Vidor, F.F. and Assion, F.}}, booktitle = {{Proceedings of the 2nd Pan African International Conference on Science, Computing and Telecommunications (PACT 2014)}}, publisher = {{IEEE}}, title = {{{Application of side-wall deposition and etch-back technology for nanometer scale device integration}}}, doi = {{10.1109/scat.2014.7055128}}, year = {{2015}}, } @article{4044, abstract = {{A simulation environment for metallic nanostructures based on the Discontinuous Galerkin Time Domain method is presented. The model is used to compute the linear and nonlinear optical response of split ring resonators and to study physical mechanisms that contribute to second harmonic generation.}}, author = {{Grynko, Yevgen and Förstner, Jens and Meier, Torsten}}, issn = {{1825-1242}}, journal = {{AAPP | Atti della Accademia Peloritana dei Pericolanti}}, keywords = {{tet_topic_numerics, tet_topic_shg, tet_topic_meta}}, number = {{1}}, title = {{{Application of the discontinous Galerkin time domain method to the optics of metallic nanostructures}}}, doi = {{10.1478/C1V89S1P041}}, volume = {{89}}, year = {{2011}}, } @inproceedings{4581, author = {{Grynko, Yevgen and Förstner, Jens}}, booktitle = {{2018 IEEE 17th International Conference on Mathematical Methods in Electromagnetic Theory (MMET)}}, isbn = {{9781538654385}}, keywords = {{tet_topic_numerics, tet_topic_shg}}, publisher = {{IEEE}}, title = {{{Application of the Discontinuous Galerkin Time Domain Method in Nonlinear Nanoplasmonics}}}, doi = {{10.1109/mmet.2018.8460261}}, year = {{2018}}, } @inproceedings{4042, abstract = {{A simulation environment for metallic nanostructures based on the Discontinuous Galerkin Time Domain method is presented. It is used to model optical transmission by silver bi‐chiral plasmonic crystals. The results of simulations qualitatively and quantitavely agree with experimental measurements of transmitted circular polarization.}}, author = {{Grynko, Yevgen and Förstner, Jens and Meier, Torsten and Radke, André and Gissibl, Timo and Braun, Paul V. and Giessen, Harald}}, editor = {{Chigrin, Dmitry N.}}, keywords = {{tet_topic_meta}}, number = {{1}}, pages = {{76--78}}, publisher = {{AIP}}, title = {{{Application of the Discontinuous Galerkin Time Domain Method to the Optics of Bi-Chiral Plasmonic Crystals}}}, doi = {{10.1063/1.3644217}}, volume = {{1398}}, year = {{2011}}, } @inproceedings{7851, author = {{Cherchago, Alexey}}, booktitle = {{Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference "New Information Technologies in Scientific Researches and in Education" (Ryazan, Russia)}}, title = {{{Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development}}}, year = {{1999}}, } @inproceedings{42894, author = {{Kirchgässner, Wilhelm and Wöckinger, Daniel and Wallscheid, Oliver and Bramerdorfer, Gerd and Böcker, Joachim}}, booktitle = {{IKMT 2022; 13. GMM/ETG-Symposium}}, pages = {{1--6}}, title = {{{Application of Thermal Neural Networks on a Small-Scale Electric Motor}}}, year = {{2022}}, } @inproceedings{23564, author = {{Gräßler, Iris and Hentze, Julian}}, booktitle = {{Proceedings of 11th CIRP Conference on Intelligent Computation in Manufacturing Engineering, Ischia, 19. - 21. Jul. 2017 (CIRP) Center for international research in production}}, publisher = {{Procedia CIRP}}, title = {{{Application Potentials of Systems Engineering for small and middle-sized Enterprises}}}, doi = {{10.1016/j.procir.2017.12.253}}, year = {{2017}}, } @misc{25812, author = {{Dangelmaier, Wilhelm}}, title = {{{Application relevance of dissertations}}}, year = {{2012}}, } @inproceedings{30412, author = {{Yang, B. and Grotstollen, H.}}, booktitle = {{EPE-PEMC 2002, Dubrovnik & Cavta}}, title = {{{Application, Calculation and Analysis of the Doubly Fed Longstator Linear Motor for the Wheel-on-Rail NBP Test Track}}}, year = {{2002}}, } @inbook{20760, author = {{Schubert, David and Eikerling, Hendrik and Holtmann, Jörg}}, booktitle = {{17th escar Europe : embedded security in cars}}, publisher = {{Ruhr-University Bochum, University Library}}, title = {{{Application-aware Intrusion Detection: A Systematic Literature Review and Implications for Automotive Systems}}}, year = {{2019}}, } @article{23526, abstract = {{Modern and flexible application-level software platforms increase the attack surface of connected vehicles and thereby require automotive engineers to adopt additional security control techniques. These techniques encompass host-based intrusion detection systems (HIDSs) that detect suspicious activities in application contexts. Such application-aware HIDSs originate in information and communications technology systems and have a great potential to deal with the flexible nature of application-level software platforms. However, the elementary characteristics of known application-aware HIDS approaches and thereby the implications for their transfer to the automotive sector are unclear. In previous work, we presented a systematic literature review (SLR) covering the state of the art of application-aware HIDS approaches. We synthesized our findings by means of a fine-grained classification for each approach specified through a feature model and corresponding variant models. These models represent the approaches’ elementary characteristics. Furthermore, we summarized key findings and inferred implications for the transfer of application-aware HIDSs to the automotive sector. In this article, we extend the previous work by several aspects. We adjust the quality evaluation process within the SLR to be able to consider high quality conference publications, which results in an extended final pool of publications. For supporting HIDS developers on the task of configuring HIDS analysis techniques based on machine learning, we report on initial results on the applicability of AutoML. Furthermore, we present lessons learned regarding the application of the feature and variant model approach for SLRs. Finally, we more thoroughly describe the SLR study design.}}, author = {{Schubert, David and Eikerling, Hendrik and Holtmann, Jörg}}, issn = {{2624-9898}}, journal = {{Frontiers in Computer Science}}, publisher = {{Frontiers Media}}, title = {{{Application-Aware Intrusion Detection: A Systematic Literature Review, Implications for Automotive Systems, and Applicability of AutoML}}}, doi = {{10.3389/fcomp.2021.567873}}, volume = {{3}}, year = {{2021}}, } @inproceedings{47138, author = {{Hetkämper, Tim and Koch, Kevin and Webersen, Manuel and Claes, Leander}}, booktitle = {{SEFI 51th Annual Conference Proceedings - Engineering Education for Sustainability}}, publisher = {{SEFI}}, title = {{{Application-based learning of signal analysis methods with the help of a graphical open-source software}}}, doi = {{10.21427/159K-G445}}, year = {{2023}}, } @inproceedings{22277, author = {{Böhne, Christoph and Biegler, Max and Meschut, Gerson and Rethmeier, Michael}}, location = {{virtual conference}}, title = {{{Application-oriented avoidance of liquid metal embrittlement during resistance spot welding of zinc-coated advanced high strenght steels}}}, year = {{2021}}, } @inproceedings{39923, author = {{Goser, K. and Hilleringmann, Ulrich and Rueckert, U.}}, booktitle = {{[1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications}}, publisher = {{IEEE Comput. Soc. Press}}, title = {{{Applications and implementations of neural networks in microelectronics-overview and status}}}, doi = {{10.1109/cmpeur.1991.257442}}, year = {{2002}}, } @book{46335, author = {{Trautmann, Heike}}, isbn = {{978-3-030-25147-5}}, publisher = {{Springer International Publishing}}, title = {{{Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement}}}, year = {{2019}}, } @book{10756, author = {{I. Esparcia-Alc{\'a}zar, Anna and Eiben, A.E. and Agapitos, Alexandros and Sim{\~o}es, Anabela and G.B. Tettamanzi, Andrea and Della Cioppa, Antonio and M. Mora, Antonio and Cotta, Carlos and Tarantino, Ernesto and Haasdijk, Evert and Divina, Federico and Fern{\'a}ndez de Vega, Francisco and Squillero, Giovanni and De Falco, Ivanoe and Ignacio Hidalgo, J. and Sim, Kevin and Glette, Kyrre and Zhang, Mengjie and Urquhart, Neil and Burelli, Paolo and Kaufmann, Paul and Po{\v s}{\'\i}k, Petr and Schaefer, Robert and Drechsler, Rolf and Antipolis, Sophia and Cagnoni, Stefano and Thanh Nguyen, Trung and S. Bush (editors), William}}, publisher = {{Springer}}, title = {{{Applications of Evolutionary Computation - 17th European Conference, EvoApplications}}}, volume = {{8602}}, year = {{2014}}, } @book{10757, author = {{M. Mora, Antonio and Squillero, Giovanni and Agapitos, Alexandros and Burelli, Paolo and S. Bush, William and Cagnoni, Stefano and Cotta, Carlos and De Falco, Ivanoe and Della Cioppa, Antonio and Divina, Federico and Eiben, A.E. and I. Esparcia-Alc{\'a}zar, Anna and Fern{\'a}ndez de Vega, Francisco and Glette, Kyrre and Haasdijk, Evert and Ignacio Hidalgo, J. and Kampouridis, Michael and Kaufmann, Paul and Mavrovouniotis, Michalis and Thanh Nguyen, Trung and Schaefer, Robert and Sim, Kevin and Tarantino, Ernesto and Urquhart, Neil and Zhang (editors), Mengjie}}, publisher = {{Springer}}, title = {{{Applications of Evolutionary Computation - 18th European Conference, EvoApplications}}}, volume = {{9028}}, year = {{2015}}, } @book{10758, author = {{Squillero, Giovanni and Burelli, Paolo and M. Mora, Antonio and Agapitos, Alexandros and S. Bush, William and Cagnoni, Stefano and Cotta, Carlos and De Falco, Ivanoe and Della Cioppa, Antonio and Divina, Federico and Eiben, A.E. and I. Esparcia-Alc{\'a}zar, Anna and Fern{\'a}ndez de Vega, Francisco and Glette, Kyrre and Haasdijk, Evert and Ignacio Hidalgo, J. and Kampouridis, Michael and Kaufmann, Paul and Mavrovouniotis, Michalis and Thanh Nguyen, Trung and Schaefer, Robert and Sim, Kevin and Tarantino, Ernesto and Urquhart, Neil and Zhang (editors), Mengjie}}, publisher = {{Springer}}, title = {{{Applications of Evolutionary Computation - 19th European Conference, EvoApplications}}}, volume = {{9597}}, year = {{2016}}, } @book{10759, author = {{Squillero, Giovanni and Burelli, Paolo and M. Mora, Antonio and Agapitos, Alexandros and S. Bush, William and Cagnoni, Stefano and Cotta, Carlos and De Falco, Ivanoe and Della Cioppa, Antonio and Divina, Federico and Eiben, A.E. and I. Esparcia-Alc{\'a}zar, Anna and Fern{\'a}ndez de Vega, Francisco and Glette, Kyrre and Haasdijk, Evert and Ignacio Hidalgo, J. and Kampouridis, Michael and Kaufmann, Paul and Mavrovouniotis, Michalis and Thanh Nguyen, Trung and Schaefer, Robert and Sim, Kevin and Tarantino, Ernesto and Urquhart, Neil and Zhang (editors), Mengjie}}, publisher = {{Springer}}, title = {{{Applications of Evolutionary Computation - 20th European Conference, EvoApplications}}}, year = {{2017}}, } @inproceedings{15393, author = {{Domik, Gitta and Brugel, EW and Stencel, RE and Vasudevan, S and Pang, J}}, booktitle = {{Bulletin of the American Astronomical Society}}, pages = {{828}}, title = {{{Applications of IRAS Preprocessing at the Workstation}}}, volume = {{22}}, year = {{1990}}, } @inbook{51484, author = {{Hilgert, Joachim}}, booktitle = {{The Analytical and Topological Theory of Semigroups}}, editor = {{Hofmann, K.H.}}, publisher = {{De Gruyter}}, title = {{{Applications of Lie Semigroups in Analysis}}}, year = {{1990}}, } @inbook{23149, author = {{Hölscher, Christian and Kessler, Jan Henning and Meyer, Tobias and Rasche, Christoph and Reinold, Peter and Sextro, Walter and Sondermann-Wölke, Christoph and Zimmer, Detmar}}, booktitle = {{Dependability of Self-Optimizing Mechatronic Systems}}, pages = {{16--22}}, publisher = {{Springer-Verlag, Heidelberg, Germany}}, title = {{{Applications of Self-Optimizing Systems}}}, year = {{2013}}, } @inproceedings{8954, author = {{Kliensieck, Katrin and John, Thomas and Kundisch, Dennis}}, booktitle = {{11th Biennial Procrastination Research Conference}}, location = {{Sheffield, United Kingdom}}, title = {{{Applied procrastination research: Tackling procrastination by gamification}}}, year = {{2019}}, } @inproceedings{868, author = {{Kubisch, Martin and Mengesha, Seble and Hollos, Daniel and Karl, Holger and Wolisz, Adam}}, booktitle = {{Kommunikation in Verteilten Systemen KiVS, 13. Fachtagung Kommunikation in Verteilten Systemen. KiVS 2003, 25.-28. Februar 2003, Leipzig, Eine Veranstaltung der Informationstechnischen Gesellschaft (ITG/VDE) unter Beteiligung der Gesellschaft für Informatik (GI) Ausgerichtet von der Universität Leipzig}}, pages = {{195----206}}, title = {{{Applying ad-hoc relaying to improve capacity, energy efficiency, and immission in infrastructure-based WLANs}}}, doi = {{10.1007/978-3-642-55569-5_16}}, year = {{2003}}, } @inproceedings{25333, author = {{Georgala, Kleanthi and Ahmed Sherif, Mohamed and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 15th International Workshop on Ontology Matching co-located with the 19th International Semantic Web Conference {(ISWC} 2020), Virtual conference (originally planned to be in Athens, Greece), November 2, 2020}}, editor = {{Shvaiko, Pavel and Euzenat, Jérôme and Jimenez-Ruiz, Ernesto and Hassanzadeh, Oktie and Trojahn, Cássia}}, pages = {{36--47}}, publisher = {{CEUR-WS.org}}, title = {{{Applying edge-counting semantic similarities to link discovery: scalability and accuracy}}}, volume = {{2788}}, year = {{2020}}, } @inproceedings{29009, abstract = {{With the growth in number and variety of RDF datasets comes an in- creasing need for both scalable and accurate solutions to support link discovery at instance level within and across these datasets. In contrast to ontology matching, most linking frameworks rely solely on string similarities to this end. The limited use of semantic similarities when linking instances is partly due to the current literature stating that they (1) do not improve the F-measure of instance linking approaches and (2) are impractical to use because they lack time efficiency. We revisit the combination of string and semantic similarities for linking instances. Contrary to the literature, our results suggest that this combination can improve the F-measure achieved by instance linking systems when the combination of the measures is performed by a machine learning approach. To achieve this in- sight, we had to address the scalability of semantic similarities. We hence present a framework for the rapid computation of semantic similarities based on edge counting. This runtime improvement allowed us to run an evaluation of 5 bench- mark datasets. Our results suggest that combining string and semantic similarities can improve the F-measure by up to 6% absolute.}}, author = {{Georgala, Kleanthi and Röder, Michael and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of Ontology Matching Workshop 2020}}, keywords = {{2020 dice simba sherif hecate ngonga knowgraphs sys:relevantFor:limboproject limboproject sys:relevantFor:infai sys:relevantFor:bis limes limbo opal roeder georgala}}, title = {{{Applying edge-counting semantic similarities to Link Discovery: Scalability and Accuracy}}}, year = {{2020}}, } @inproceedings{25599, author = {{Lauck, Sebastian and Boxnick, Simon and Kopecki, Lukas}}, booktitle = {{Proceedings of the IEEE Asia-Pacific World Congress on Computer Science and Engineering 2014 (APWC on CSE 2014)}}, pages = {{276--284}}, title = {{{Applying GPU Programming to Obtain Average AS/RS Performance in Optimal Zoned Aisles}}}, year = {{2014}}, } @inproceedings{24722, author = {{Röder, Michael and Frerk, Philip and Conrads, Felix and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings}}, editor = {{Verborgh, Ruben and Hose, Katja and Paulheim, Heiko and Champin, Pierre-Antoine and Maleshkova, Maria and Corcho, Oscar and Ristoski, Petar and Alam, Mehwish}}, pages = {{93--108}}, publisher = {{Springer}}, title = {{{Applying Grammar-Based Compression to RDF}}}, doi = {{10.1007/978-3-030-77385-4\_6}}, volume = {{12731}}, year = {{2021}}, } @inproceedings{5685, abstract = {{In double-sided markets for computing resources an optimal allocation schedule among job offers and requests subject to relevant capacity constraints can be determined. With increasing storage demands and emerging storage services the question how to schedule storage jobs becomes more and more interesting. Since such scheduling problems are often in the class NP-complete an exact computation is not feasible in practice. On the other hand an approximation to the optimal solution can easily be found by means of using heuristics. The problem with this attempt is that the suggested solution may not be exactly optimal and is thus less satisfying. Considering the two above mentioned solution approaches one can clearly find a trade-off between the optimality of the solution and the efficiency to get to a solution at all. This work proposes to apply and combine heuristics in optimization to gain from both of their benefits while reducing the problematic aspects. Following this method it is assumed to get closer to the optimal solution in a shorter time compared to a full optimization.}}, author = {{Finkbeiner, Josef and Bodenstein, Christian and Schryen, Guido and Neumann, Dirk}}, booktitle = {{18th European Conference on Information Systems (ECIS 2010)}}, keywords = {{Decision Support System, Algorithms, Optimization, Market Engineering}}, title = {{{Applying heuristic methods for job scheduling in storage markets}}}, year = {{2010}}, } @inproceedings{22889, author = {{Tschirner, Christian and Bretz, Lukas Helmut and Dumitrescu, Roman and Gausemeier, Jürgen}}, booktitle = {{1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015}}, title = {{{Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application}}}, year = {{2015}}, } @inproceedings{25404, author = {{Hoehndorf, Robert and Ngonga Ngomo, Axel-Cyrille and Pyysalo, Sampo and Ohta, Tomoko and Oellrich, Anika and Rebholz-Schuhmann, Dietrich}}, booktitle = {{Proceedings of the Fourth International Symposium for Semantic Mining in Biomedicine, Cambridge, United Kingdom, October, 2010}}, editor = {{Collier, Nigel and Hahn, Udo and Rebholz-Schuhmann, Dietrich and Rinaldi, Fabio and Pyysalo, Sampo}}, publisher = {{CEUR-WS.org}}, title = {{{Applying ontology design patterns to the implementation of relations in GENIA}}}, volume = {{714}}, year = {{2010}}, } @inproceedings{27143, author = {{Pieper, Thorsten and Echterfeld, Julian and Koldewey, Christian}}, booktitle = {{Book of Abstracts of the 16th International Open and User Innovation Conference, 6. - 8. Aug. 2018}}, title = {{{Applying Open Innovation in the Field of Aircraft MRO - Insights from the LOMIS Project}}}, year = {{2018}}, } @inproceedings{22755, author = {{Pieper, Thorsten and Echterfeld, Julian and Koldewey, Christian}}, booktitle = {{Book of Abstracts of the 16th International Open and User Innovation Conference, 6. - 8. Aug. 2018}}, title = {{{Applying Open Innovation in the Field of Aircraft MRO - Insights from the LOMIS Project }}}, year = {{2018}}, } @inproceedings{25115, abstract = {{Automatically composing service-based software solutions is still a challenging task. Functional as well as nonfunctional properties have to be considered in order to satisfy individual user requests. Regarding non-functional properties, the composition process can be modeled as optimization problem and solved accordingly. Functional properties, in turn, can be described by means of a formal specification language. Statespace based planning approaches can then be applied to solve the underlying composition problem. However, depending on the expressiveness of the applied formalism and the completeness of the functional descriptions, formally equivalent services may still differ with respect to their implemented functionality. As a consequence, the most appropriate solution for a desired functionality can hardly be determined without considering additional information. In this paper, we demonstrate how to overcome this lack of information by means of Reinforcement Learning. In order to resolve ambiguity, we expand state-space based service composition by a recommendation mechanism that supports decision-making beyond formal specifications. The recommendation mechanism adjusts its recommendation strategy based on feedback from previous composition runs. Image processing serves as case study. Experimental results show the benefit of our proposed solution.}}, author = {{Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd}}, booktitle = {{Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)}}, pages = {{105--112}}, publisher = {{IEEE Computer Society}}, title = {{{Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}}}, year = {{2014}}, } @inproceedings{457, abstract = {{Automatically composing service-based software solutionsis still a challenging task. Functional as well as nonfunctionalproperties have to be considered in order to satisfyindividual user requests. Regarding non-functional properties,the composition process can be modeled as optimization problemand solved accordingly. Functional properties, in turn, can bedescribed by means of a formal specification language. Statespacebased planning approaches can then be applied to solvethe underlying composition problem. However, depending on theexpressiveness of the applied formalism and the completenessof the functional descriptions, formally equivalent services maystill differ with respect to their implemented functionality. As aconsequence, the most appropriate solution for a desired functionalitycan hardly be determined without considering additionalinformation. In this paper, we demonstrate how to overcome thislack of information by means of Reinforcement Learning. Inorder to resolve ambiguity, we expand state-space based servicecomposition by a recommendation mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism adjusts its recommendation strategy basedon feedback from previous composition runs. Image processingserves as case study. Experimental results show the benefit of ourproposed solution.}}, author = {{Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd }}, booktitle = {{Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)}}, pages = {{105--112}}, title = {{{Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}}}, doi = {{10.1109/SOCA.2014.48}}, year = {{2014}}, } @inproceedings{2387, author = {{Battre, Dominic and Birkenheuer, Georg and Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}}, booktitle = {{Proc. Cracow Grid Workshop (CGW)}}, title = {{{Applying Risk Management to Support SLA Provisioning}}}, year = {{2008}}, } @inproceedings{26365, abstract = {{This paper describes how methods and techniques from different fields of research can be combined to evaluate cost-intensive and business-critical decisions regarding future market development. In their concrete application a leading company from the construction supply industry has to make a decision on setting up of a spare part logistic. Three future alternatives (negative, constant, positive market growth) on market trends are simulated with a Monte Carlo simulation by considering a given demand history and possible locations for storage facilities were isolated by applying the Steiner-Weber method. Finally solving a mixed-integer formulation of the Uncapacitated-Facility-Location-Problem gives information on opening/closing new/existing storage facilities by minimizing all relevant costs. The results of this approach, containing information about a cost-based evaluation of all business related decision criteria, were examined with a sensitivity analysis. }}, author = {{Dangelmaier, Wilhelm and Laroque, Christoph and Delius, Robin and Streichhan, Jenny}}, booktitle = {{Proceedings of The Third International Conference on Advances}}, pages = {{162--168}}, publisher = {{Xpert Publishing Services}}, title = {{{Applying Simulation and Mathematical Programming on a Business Case Analysis for Setting up a Spare Part Logistics in the Construction Supply Industry}}}, year = {{2011}}, } @article{25402, author = {{Hoehndorf, Robert and Ngonga Ngomo, Axel-Cyrille and Kelso, Janet}}, journal = {{J. Biomed. Semant.}}, pages = {{4}}, title = {{{Applying the functional abnormality ontology pattern to anatomical functions}}}, doi = {{10.1186/2041-1480-1-4}}, volume = {{1}}, year = {{2010}}, } @article{37138, abstract = {{AbstractAssuming that potential biases of Artificial Intelligence (AI)-based systems can be identified and controlled for (e.g., by providing high quality training data), employing such systems to augment human resource (HR)-decision makers in candidate selection provides an opportunity to make selection processes more objective. However, as the final hiring decision is likely to remain with humans, prevalent human biases could still cause discrimination. This work investigates the impact of an AI-based system’s candidate recommendations on humans’ hiring decisions and how this relation could be moderated by an Explainable AI (XAI) approach. We used a self-developed platform and conducted an online experiment with 194 participants. Our quantitative and qualitative findings suggest that the recommendations of an AI-based system can reduce discrimination against older and female candidates but appear to cause fewer selections of foreign-race candidates. Contrary to our expectations, the same XAI approach moderated these effects differently depending on the context.}}, author = {{Hofeditz, Lennart and Clausen, Sünje and Rieß, Alexander and Mirbabaie, Milad and Stieglitz, Stefan}}, issn = {{1019-6781}}, journal = {{Electronic Markets (ELMA)}}, keywords = {{Management of Technology and Innovation, Marketing, Computer Science Applications, Economics and Econometrics, Business and International Management}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Applying XAI to an AI-based system for candidate management to mitigate bias and discrimination in hiring}}}, doi = {{10.1007/s12525-022-00600-9}}, year = {{2022}}, } @inproceedings{26830, author = {{Mager, Thomas and Jürgenhake, Christoph and Dumitrescu, Roman}}, booktitle = {{14th International Congress Molded Interconnect Devices (MID)}}, location = {{Amberg}}, pages = {{1--9}}, title = {{{Approach for a modular design methodology for an efficient development of 3D MID components}}}, year = {{2021}}, } @article{17393, author = {{Lehner, Anne-Christin and Koldewey, Christian and Gausemeier, Jürgen}}, issn = {{1927-0321}}, journal = {{Technology Innovation Management Review}}, pages = {{14--27}}, title = {{{Approach for a Pattern-Based Development of Frugal Innovations}}}, doi = {{10.22215/timreview/1149}}, year = {{2018}}, } @article{27146, author = {{Lehner, Anne-Christin and Koldewey, Christian and Gausemeier, Jürgen}}, journal = {{Technology Innovation Management Review 8(4)}}, pages = {{14--27}}, title = {{{Approach for a Pattern-Based Development of Frugal Innovations}}}, year = {{2018}}, } @article{52677, abstract = {{Several modules in automotive are usually modified and adapted for various project-specific applications. Due to a standardized safety concept a high reusability is accessible. A safety element out of context (SEooC) according to ISO 26262 can be a suitable approach. Based on the same safety concept and analysis, common modules can reach high reusability. For developing according to a module out of context, an appropriate and detailed development approach is required. This paper shows how to deduce this development processes for platform modules. Therefore, the detailed approach of the SEooC is derived. The aim is to create a detailed workflow for all phases of the development and integration of any kind of system modules. As an application example, an automotive project for an actuator control module is considered.}}, author = {{Noun, H. and Mozgova, Iryna and Abdelfattah, M. and Zeller, G. and Rajesh, G. and Lachmayer, R.}}, journal = {{International Journal of Industrial and Manufacturing Engineering}}, number = {{6}}, pages = {{237--243}}, title = {{{Approach for a Safety Element out of Context for an Actuator Circuit Control Module}}}, volume = {{17}}, year = {{2023}}, } @inproceedings{44220, author = {{Uhe, Benedikt and Kuball, Clara-Maria and Merklein, Marion and Meschut, Gerson}}, location = {{Nürnberg}}, publisher = {{Materials Research Proceedings}}, title = {{{Approach for a sustainable process chain in manufacturing of fasteners for mechanical joining}}}, doi = {{10.21741/9781644902417-49}}, year = {{2023}}, } @inproceedings{23137, author = {{Bauer, Frank and Gausemeier, Jürgen and Köchling, Daniel and Oestersötebier, Felix}}, booktitle = {{Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference}}, publisher = {{Springer Berlin/Heidelberg}}, title = {{{Approach for an Early Validation of Mechatronic Systems using Idealized Simulation Models within the Conceptual Design}}}, year = {{2013}}, } @inproceedings{28549, author = {{Bauer, Frank and Gausemeier, J{\"u}rgen and K{\"o}chling, Daniel and Oesters{\"o}tebier, Felix}}, publisher = {{Springer Berlin/Heidelberg}}, title = {{{Approach for an Early Validation of Mechatronic Systems using Idealized Simulation Models within the Conceptual Design}}}, year = {{2013}}, } @inproceedings{23036, author = {{Oestersötebier, Felix and Abrishamchian, Farisoroosh and Lankeit, Christopher and Just, Viktor and Trächtler, Ansgar}}, booktitle = {{Proceedings of the 3rd International Conference on System-Integrated Intelligence}}, publisher = {{Elsevier}}, title = {{{Approach for an Integrated Model-Based System Design of Intelligent Dynamic Systems Using Solution and System Knowledge}}}, year = {{2016}}, } @misc{22901, author = {{Kliewe, Daniel and Kaiser, Lydia and Dumitrescu, Roman and Gausemeier, Jürgen}}, booktitle = {{Jurnal Teknologi}}, number = {{4}}, pages = {{7--11}}, title = {{{Approach for identifying components worthy of protection of Cyber-Physical Systems (CPS) based on a system model}}}, volume = {{76 (4)}}, year = {{2015}}, } @inproceedings{28195, author = {{Schneider, Marcel and Gausemeier, J{\"u}rgen and Schmuedderich, Tanja and Tr{\"a}chtler, Ansgar}}, booktitle = {{Proceedings of the DESIGN 2014 - 13th INTERNATIONAL DESIGN CONFERENCE}}, editor = {{Marjanovic, Dorian and Storga, Mario and Pavkovic, Neven and Bojcetic, Nenad}}, issn = {{1847-9073}}, pages = {{1339 -- 1347}}, publisher = {{Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb / The Design Society, Glasgow}}, title = {{{Approach for Scenario-Based Test Specifications for Virtual Commissioning}}}, volume = {{2}}, year = {{2014}}, } @article{30695, abstract = {{Due to their cost-efficiency and environmental friendliness, the demand of mechanical joining processes is constantly rising. However, the dimensioning and design of joints and suitable processes are mainly based on expert knowledge and few experimental data. Therefore, the performance of numerical and experimental studies enables the generation of optimized joining geometries. However, the manual evaluation of the results of such studies is often highly time-consuming. As a novel solution, image segmentation and machine learning algorithm provide methods to automate the analysis process. Motivated by this, the paper presents an approach for the automated analysis of geometrical characteristics using clinching as an example. }}, author = {{Zirngibl, C. and Schleich, B.}}, journal = {{Key Engineering Materials}}, pages = {{105}}, title = {{{Approach for the automated analysis of geometrical clinch joint characteristics}}}, doi = {{10.4028/www.scientific.net/KEM.883.105}}, volume = {{883 KEM}}, year = {{2021}}, } @article{30696, author = {{Zirngibl, C. and Schleich, B. and Wartzack, S.}}, journal = {{Proceedings of the Design Society}}, pages = {{521}}, title = {{{Approach for the automated and data-based design of mechanical joints}}}, doi = {{10.1017/pds.2021.52}}, volume = {{1}}, year = {{2021}}, } @inproceedings{28190, author = {{K{\"o}chling, Daniel and Gausemeier, J{\"u}rgen}}, title = {{{Approach for the Realization of a Self-Optimizing Production System}}}, year = {{2014}}, } @inproceedings{15381, abstract = {{Currently there are ultrasonic sensors to measure flow, liquid level, concentrations or to monitor the process course. In several processes the investigated media is a mixture of liquid and solid ingredients. The use of ultrasonic sensor systems will become very complicated if gas bubbles appear at the measurement place caused by chemical reactions, high temperature or fast flow this means under typical process conditions. The appearance of gas bubbles falsifies the measured absorption and also the velocity. The sound propagation in liquid mixtures is influenced in a complex manner for instance by solid particles, rapid changes of temperature, and liquid droplets of other density in the measured liquid simultaneously. For the detailed investigation of the influence of bubbles on sound propagation, an experimental setup was build. This setup permits the comprehensive processing of transmitted and scattered signals. Using a smart signal processing it is possible to find a reliable indication for gas bubbles.}}, author = {{Gulsch, Michael and Henning, Bernd and Prange, Stefan and Auge, Jörg}}, editor = {{Cassereau, Didier}}, location = {{Paris, France}}, pages = {{243--246}}, title = {{{Approach of continuous characterisation of liquid multi-component mixtures}}}, year = {{2003}}, } @inproceedings{36473, abstract = {{Destructive micrograph analysis (MA) is the standard method for the assessment of clinched joints. However, during the joint preparation for the MA, geometric features of the joint can change due to elastic effects and closing cracks. X-ray computed tomography (CT) is a promising alternative to investigate the joint non-destructively. However, if the material properties of similar joining partners are the same, the CT is not able to correctly resolve surfaces in the joint that are close to or pressing onto each other. These surfaces are relevant for the determination of characteristic dimensions such as neck thickness and undercut. By placing a thin, highly radiopaque tin layer between the joining partners, the interfacial area in the reconstructed volume can be highlighted. In this work, a method for the localisation of the tin layer inside the joint as well as threshold value procedures for the outer joint contour in cross section images are investigated. The measured characteristic dimensions are compared with measured values from MA of the same samples and of samples without tin layer. In addition, possible effects of the tin layer on the joining point characteristics as well as problems of the MA are discussed.}}, author = {{Busch, Matthias and Köhler, Daniel and Hausotte, Tino and Kupfer, Robert and Troschitz, Juliane and Gude, Maik }}, title = {{{Approach to Determine the Characteristic Dimensions of Clinched Joints by Industrial X-ray Computed Tomography}}}, year = {{2022}}, } @article{51192, abstract = {{ Destructive micrograph analysis (MA) is the standard method for the assessment of clinched joints. However, during the joint preparation for the MA, geometric features of the joint can change due to elastic effects and closing cracks. X-ray computed tomography (CT) is a promising alternative to investigate the joint non-estructively. However, if the material properties of similar joining partners are the same, the CT is not able to correctly resolve surfaces in the joint that are close to or pressing onto each other. These surfaces are relevant for the determination of characteristic dimensions such as neck thickness and undercut. By placing a thin, highly radiopaque tin layer between the joining partners, the interfacial area in the reconstructed volume can be highlighted. In this work, a method for the localisation of the tin layer inside the joint as well as threshold value procedures for the outer joint contour in cross section images are investigated. The measured characteristic dimensions are compared with measured values from MA of the same samples and of samples without tin layer. In addition, possible effects of the tin layer on the joining point characteristics as well as problems of the MA are discussed. }}, author = {{Busch, Matthias and Köhler, Daniel and Hausotte, Tino and Kupfer, Robert and Troschitz, Juliane and Gude, Maik}}, issn = {{1435-4934}}, journal = {{e-Journal of Nondestructive Testing}}, number = {{12}}, publisher = {{NDT.net}}, title = {{{Approach to Determine the Characteristic Dimensions of Clinched Joints by Industrial X-ray Computed Tomography}}}, doi = {{10.58286/27519}}, volume = {{27}}, year = {{2022}}, } @article{17813, author = {{Hielscher, Christian and Grenz, Julian and Camberg, Alan Adam and Wingenbach, Nils}}, issn = {{2192-9076}}, journal = {{ATZ worldwide}}, pages = {{58--61}}, title = {{{Approach to More Efficient Design of Hybrid Components}}}, doi = {{10.1007/s38311-020-0267-0}}, year = {{2020}}, } @article{31691, abstract = {{Sustainable product engineering is becoming increasingly important. This includes the development of environmentally friendly products and the design for recycling. In this paper a holistic method for the assessment of solution alternatives is presented, in which the stakeholder perspectives along the generic product lifecycle are taken into account. Finally, a new visualization is presented. By visualizing the results in the integrated sustainability triangle, decision-makers in product development can holistically assess the sustainability of the solution alternatives.}}, author = {{Gräßler, Iris and Hesse, Philipp}}, issn = {{2732-527X}}, journal = {{Proceedings of the Design Society}}, keywords = {{sustainability, decision making, generic product lifecycle, design analysis, ecodesign}}, pages = {{1001--1010}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{Approach to Sustainability-Based Assessment of Solution Alternatives in Early Stages of Product Engineering}}}, doi = {{10.1017/pds.2022.102}}, volume = {{2}}, year = {{2022}}, } @inbook{5653, author = {{Schryen, Guido}}, booktitle = {{Spam: An Introduction}}, editor = {{Satesh, D. and Prabhakar, R.}}, pages = {{41--57}}, publisher = {{ICFAI University Press}}, title = {{{Approaches Addressing Spam}}}, year = {{2007}}, } @inproceedings{27168, author = {{Keil, Reinhard and Winkelnkemper, Felix}}, pages = {{131--142}}, publisher = {{Society for Informatics}}, title = {{{Approaches for an informational separation of powers in learning platforms}}}, year = {{2013}}, } @inproceedings{2768, author = {{Kundisch, Dennis and John, Thomas and Honnacker, Jörg and Meier, Christian}}, booktitle = {{Proceedings of the Multikonferenz Wirtschaftsinformatik (MKWI)}}, location = {{Braunschweig, Germany}}, title = {{{Approaches for Business Model Representation: An Overview}}}, year = {{2012}}, } @inproceedings{17667, abstract = {{Resolving distributed attacks benefits from collaboration between networks. We present three approaches for the same multi-domain defensive action that can be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures, and 3) Minimize Propagation. First, we provide a formula to compute efficiency of a defense; then we use this formula to compute the efficiency of the approaches under various circumstances. Finally, we discuss how task execution order and timing influence defense efficiency. Our results show that the Minimize Propagation approach is the most efficient method when defending against the chosen attack.}}, author = {{Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}}, booktitle = {{2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}}, issn = {{null}}, keywords = {{computer network security, multinetwork environments, multidomain defensive action, task execution order, timing influence defense efficiency, distributed attacks, collaborative security defence approach, minimize propagation approach, minimize countermeasure approach, counteract everywhere approach, Conferences, Cloud computing, Computer crime, Edge computing, Security, Defense Approaches, Multi-Domain Defense, Collaborative Defense, Defense Algorithms, Computer Networks}}, pages = {{113--123}}, title = {{{Approaches for Collaborative Security Defences in Multi Network Environments}}}, doi = {{10.1109/CSCloud/EdgeCom.2019.000-9}}, year = {{2019}}, } @misc{18066, author = {{Skowronek, Michael}}, publisher = {{Universität Paderborn}}, title = {{{Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}}}, year = {{2020}}, } @inproceedings{23535, author = {{Neubauer, Georg and Rainer, Karin and Pottebaum, Jens and Knesic, Snjezana and Baucic, Martina}}, booktitle = {{IDIMT-2018. Strategic modeling in management, economy and society : 26th Interdisciplinary Information Management Talks, Band 47}}, editor = {{Doucek, Petr and Chroust, Gerhard and Oskrdal, Václav}}, location = {{Kutná Hora, Czech Republic, 5. - 7. Sep. 2018}}, pages = {{189--195}}, publisher = {{Trauner Verlag}}, title = {{{Approaches on How to analyse Terms and Definitions Applied in the Domain of Crisis and Disaster Management}}}, volume = {{47}}, year = {{2018}}, } @inproceedings{33490, abstract = {{Algorithmic fairness in Information Systems (IS) is a concept that aims to mitigate systematic discrimination and bias in automated decision-making. However, previous research argued that different fairness criteria are often incompatible. In hiring, AI is used to assess and rank applicants according to their fit for vacant positions. However, various types of bias also exist for AI-based algorithms (e.g., using biased historical data). To reduce AI’s bias and thereby unfair treatment, we conducted a systematic literature review to identify suitable strategies for the context of hiring. We identified nine fundamental articles in this context and extracted four types of approaches to address unfairness in AI, namely pre-process, in-process, post-process, and feature selection. Based on our findings, we (a) derived a research agenda for future studies and (b) proposed strategies for practitioners who design and develop AIs for hiring purposes.}}, author = {{Rieskamp, Jonas and Hofeditz, Lennart and Mirbabaie, Milad and Stieglitz, Stefan}}, booktitle = {{Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)}}, keywords = {{fairness in AI, SLR, hiring, AI implementation, AI-based algorithms}}, title = {{{Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research}}}, year = {{2023}}, } @article{11937, abstract = {{In automatic speech recognition, hidden Markov models (HMMs) are commonly used for speech decoding, while switching linear dynamic models (SLDMs) can be employed for a preceding model-based speech feature enhancement. In this paper, these model types are combined in order to obtain a novel iterative speech feature enhancement and recognition architecture. It is shown that speech feature enhancement with SLDMs can be improved by feeding back information from the HMM to the enhancement stage. Two different feedback structures are derived. In the first, the posteriors of the HMM states are used to control the model probabilities of the SLDMs, while in the second they are employed to directly influence the estimate of the speech feature distribution. Both approaches lead to improvements in recognition accuracy both on the AURORA2 and AURORA4 databases compared to non-iterative speech feature enhancement with SLDMs. It is also shown that a combination with uncertainty decoding further enhances performance.}}, author = {{Windmann, Stefan and Haeb-Umbach, Reinhold}}, journal = {{IEEE Transactions on Audio, Speech, and Language Processing}}, keywords = {{AURORA2 databases, AURORA4 databases, automatic speech recognition, feedback structures, hidden Markov models, HMM, iterative methods, iterative speech feature enhancement, model probabilities, speech decoding, speech enhancement, speech feature distribution, speech recognition, switching linear dynamic models}}, number = {{5}}, pages = {{974--984}}, title = {{{Approaches to Iterative Speech Feature Enhancement and Recognition}}}, doi = {{10.1109/TASL.2009.2014894}}, volume = {{17}}, year = {{2009}}, } @inproceedings{44248, author = {{Behler, Felix}}, booktitle = {{Bridges and Barriers, Interdisziplinäre studentische Konferenz. Organisation: Felix Behler, Yvonne K. Jende, Lisa-Marie Büsken, Cecilie Rasmussen (University of Paderborn)}}, location = {{Paderborn}}, title = {{{Approaching Barriers of Representation: Speaking Trauma through Verse}}}, year = {{2021}}, } @inproceedings{20624, author = {{Schubert, M and Hansmeier, T and Koutsandreou, F and Reinecke, K and Weiß, M and Baumeister, Jochen}}, title = {{{Approaching effective connectivity measures in exercise neuroscience}}}, year = {{2012}}, } @inproceedings{22744, author = {{Lehrig, Sebastian and Becker, Matthias}}, booktitle = {{{Proceedings of the Symposium on Software Performance (SOSP)}}}, title = {{{Approaching the Cloud: Using Palladio for Scalability, Elasticity, and Efficiency Analyses}}}, year = {{2014}}, } @inproceedings{39580, author = {{Müller, Wolfgang}}, booktitle = {{Proc. of the 1st Asian Pacific Conference on Hardware Description Languages, Standards and Applications}}, title = {{{Approaching the Denotational Semantics of Behavioral VHDL Descriptions}}}, year = {{1993}}, } @inproceedings{15292, author = {{Hüllermeier, Eyke}}, booktitle = {{in Proceedings EUFIT-96 4th European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany}}, editor = {{Zimmermann, H.J.}}, title = {{{Approminate probabilistic reasoning with fuzzy constraints}}}, year = {{1996}}, } @article{17250, abstract = {{Based on the observation that human-robot interaction is often laborious because the robot's interactional abilities fail to meet the user's expectations, we argue that feedback can play a central role in regulating expectations and mitigating unnecessary disruptions in the flow of conversation. For feedback to be appropriate in this sense, it needs to take situational information into account. This idea stems from interviews with persons with hearing and mental impairments who display perceptual limitations similar to a robot. The results of these interviews indicated that, depending on the goals of the situation, people with hearing impairments used either mediation (clarification) or concealment strategies to keep the interaction going. With this idea in mind, we analyzed human-robot interactions in two different situations - more task-oriented interactions versus more socially driven interactions - and we observed different feedback behaviors in users and their reactions to the robot's behavior. We use these results to derive a scaffold for modeling appropriate feedback in asymmetric interactions (i.e., in human-robot interactions) and briefly discuss some consequences for both the design of human-robot interaction and for theories of grounding. (c) 2010 Elsevier B.V. All rights reserved.}}, author = {{Wrede, Britta and Kopp, Stefan and Rohlfing, Katharina and Lohse, Manja and Muhl, Claudia}}, issn = {{0378-2166}}, journal = {{Journal of Pragmatics}}, number = {{9}}, pages = {{2369--2384}}, publisher = {{Elsevier }}, title = {{{Appropriate Feedback in Asymmetric Interactions}}}, doi = {{10.1016/j.pragma.2010.01.003}}, volume = {{42}}, year = {{2010}}, } @article{17772, author = {{Mindt, Ilka}}, journal = {{Journal of Pragmatics }}, pages = {{1503 -- 1520}}, title = {{{Appropriateness in Discourse: The adjectives surprised and surprising in monologue and dialogue}}}, volume = {{40,9}}, year = {{2008}}, } @inbook{42371, author = {{Fuchs, Christian}}, booktitle = {{Digital Objects, Digital Subjects: Interdisciplinary Perspectives on Capitalism, Labour and Politics in the Age of Big Data}}, editor = {{Chandler, David and Fuchs, Christian}}, pages = {{ 215--221}}, publisher = {{University of Westminster Press}}, title = {{{Appropriation of Digital Machines and Appropriation of Fixed Capital as the Real Appropriation of Social Being: Reflections on Toni Negri’s Chapter}}}, doi = {{https://doi.org/10.16997/book29.s}}, year = {{2019}}, } @inproceedings{16063, author = {{Ahlers, Dominik and Tröster, Thomas}}, location = {{Austin, Texas, USA}}, title = {{{Approve of porostiy for increasing process speed in the laser melting process of Ti6Al4V}}}, year = {{2017}}, } @article{40699, author = {{Xiao, Y-.H. and Huang, L. and Xie, J. and So, H. C.}}, journal = {{IEEE Transactions on Information Theory}}, number = {{3}}, pages = {{1784–1799}}, title = {{{Approximate Asymptotic Distribution of Locally Most Powerful Invariant Test for Independence Complex Case}}}, volume = {{64}}, year = {{2018}}, } @article{19213, author = {{Ahmadov, A.I. and Aslanova, S.M. and Orujova, M.Sh. and Badalov, S.V. and Dong, Shi-Hai}}, issn = {{0375-9601}}, journal = {{Physics Letters A}}, number = {{24}}, pages = {{3010--3017}}, publisher = {{Elsevier}}, title = {{{Approximate bound state solutions of the Klein-Gordon equation with the linear combination of Hulthén and Yukawa potentials}}}, doi = {{10.1016/j.physleta.2019.06.043}}, volume = {{383}}, year = {{2019}}, } @inproceedings{41875, author = {{Badran, Abdalrhman and Sadeghi-Kohan, Somayeh and Reimer, Jan Dennis and Hellebrand, Sybille}}, booktitle = {{28th IEEE European Test Symposium (ETS'23), May 2023}}, title = {{{Approximate Computing: Balancing Performance, Power, Reliability, and Safety}}}, year = {{2023}}, } @inproceedings{632, abstract = {{Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.}}, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}}, pages = {{800--810}}, title = {{{Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}}}, doi = {{10.1137/1.9781611973099.64}}, year = {{2012}}, } @techreport{19688, abstract = {{We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case.}}, author = {{Briest, Patrick and Goldberg, Paul W. and Roeglin, Heiko}}, title = {{{Approximate Equilibria in Games with Few Players}}}, year = {{2008}}, } @article{3037, abstract = {{For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster algorithms as the one for the general problem are obtained for special cases, namely thatI is restricted to translations or even to translations only in one specified direction. It turns out that determining pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant factor, can be done much more efficiently than determining optimal solutions. In the most general case, the algorithm for the pseudo-optimal solution is based on the surprising fact that for the optimal possible match betweenP and an imageI(Q) ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q) is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also shown that the Hausdorff distance between two polygons can be determined in timeO(n logn), wheren is the total number of vertices.}}, author = {{Alt, Helmut and Behrends, Bernd and Blömer, Johannes}}, issn = {{1573-7470}}, journal = {{Annals of Mathematics and Artificial Intelligence}}, number = {{3}}, title = {{{Approximate matching of polygonal shapes}}}, volume = {{13}}, year = {{1995}}, } @inproceedings{3048, author = {{Alt, Helmut and Behrends, Bernd and Blömer, Johannes}}, booktitle = {{Proceedings of the seventh annual symposium on Computational geometry - SCG '91}}, isbn = {{0897914260}}, publisher = {{ACM Press}}, title = {{{Approximate matching of polygonal shapes (extended abstract)}}}, doi = {{10.1145/109648.109669}}, year = {{1991}}, } @article{23473, author = {{Belobo, Didier Belobo and Meier, Torsten}}, issn = {{1367-2630}}, journal = {{New Journal of Physics}}, title = {{{Approximate nonlinear wave solutions of the coupled two-component Gross–Pitaevskii equations with spin–orbit interaction}}}, doi = {{10.1088/1367-2630/abf3ed}}, volume = {{23}}, year = {{2021}}, } @phdthesis{8080, abstract = {{This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.}}, author = {{Feldotto, Matthias}}, title = {{{Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}}}, doi = {{10.17619/UNIPB/1-588}}, year = {{2019}}, } @inproceedings{456, abstract = {{We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19].}}, author = {{Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}}, pages = {{480 -- 485}}, title = {{{Approximate pure Nash equilibria in Social Context Congestion Games}}}, doi = {{10.1007/978-3-319-13129-0_43}}, year = {{2014}}, } @inproceedings{455, abstract = {{We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions.}}, author = {{Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}}, booktitle = {{Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}}, pages = {{242 -- 257}}, title = {{{Approximate pure Nash equilibria in weighted congestion games}}}, doi = {{10.4230/LIPIcs.APPROX-RANDOM.2014.242}}, year = {{2014}}, } @article{320, abstract = {{We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.}}, author = {{Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}}, journal = {{Transactions on Economics and Computation}}, number = {{1}}, publisher = {{ACM}}, title = {{{Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}}}, doi = {{10.1145/2614687}}, volume = {{3}}, year = {{2015}}, } @inproceedings{50076, author = {{Bührmann, Tobias and Magyar, Balázs}}, booktitle = {{64. Tribologie-Fachtagung 2023}}, location = {{Göttingen}}, title = {{{Approximate simulation of the hysteresis friction of radial shaft seals}}}, year = {{2023}}, } @article{52254, author = {{Bührmann, Tobias and Magyar, Balázs}}, isbn = {{978-3-381-10091-0}}, journal = {{Tribologie und Schmierungstechnik}}, number = {{6/23}}, pages = {{34--42}}, title = {{{Approximate simulation of the hysteresis friction of radial shaft seals}}}, doi = {{10.24053/TuS-2023-0034}}, volume = {{70. Jahrgang}}, year = {{2023}}, } @inproceedings{15296, author = {{Hüllermeier, Eyke}}, booktitle = {{in Proceedings EUFIT-94 2nd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany}}, editor = {{Zimmermann, H.J.}}, pages = {{195--199}}, title = {{{Approximate solution of a linear programming problem using a modified perceptron-algorithm.}}}, year = {{1994}}, } @inproceedings{44326, abstract = {{Low-quality models that miss relevant dynamics lead to major challenges in modelbased state estimation. We address this issue by simultaneously estimating the system’s states and its model inaccuracies by a square root unscented Kalman filter (SRUKF). Concretely, we augment the state with the parameter vector of a linear combination containing suitable functions that approximate the lacking dynamics. Presuming that only a few dynamical terms are relevant, the parameter vector is claimed to be sparse. In Bayesian setting, properties like sparsity are expressed by a prior distribution. One common choice for sparsity is a Laplace distribution. However, due to disadvantages of a Laplacian prior in regards to the SRUKF, the regularized horseshoe distribution, a Gaussian that approximately features sparsity, is applied instead. Results exhibit small estimation errors with model improvements detected by an automated model reduction technique.}}, author = {{Götte, Ricarda-Samantha and Timmermann, Julia}}, booktitle = {{IFAC-PapersOnLine}}, keywords = {{joint estimation, unscented Kalman filter, sparsity, Laplacian prior, regularized horseshoe, principal component analysis}}, location = {{Yokohama, Japan}}, number = {{2}}, pages = {{869--874}}, title = {{{Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF}}}, volume = {{56}}, year = {{2023}}, } @article{18855, abstract = {{We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries. Read More: https://epubs.siam.org/doi/10.1137/S0097539703435297 }}, author = {{Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, number = {{1}}, pages = {{91--109}}, title = {{{Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}}}, doi = {{10.1137/s0097539703435297}}, volume = {{35}}, year = {{2005}}, } @article{10142, author = {{Steffen, Eckhard}}, journal = {{Australasian Journal of Combinatorics}}, number = {{1}}, pages = {{153--160}}, title = {{{Approximating Vizing’s independence number conjecture}}}, volume = {{71}}, year = {{2018}}, } @inproceedings{13868, author = {{Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}}, title = {{{Approximating Weighted Completion Time for Order Scheduling with Setup Times}}}, year = {{2020}}, } @inproceedings{45695, author = {{Hotegni, Sedjro Salomon and Mahabadi, Sepideh and Vakilian, Ali}}, booktitle = {{Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, USA. PMLR 202, 2023.}}, keywords = {{Fair range clustering}}, location = {{Honolulu, Hawaii, USA}}, title = {{{Approximation Algorithms for Fair Range Clustering}}}, year = {{2023}}, } @inbook{16658, author = {{Preis, Robert and Monien, Burkhard and Schamberger, Stefan}}, booktitle = {{Handbook of Approximation Algorithms and Metaheuristics}}, isbn = {{9781584885504}}, issn = {{2154-4573}}, title = {{{Approximation Algorithms for Multilevel Graph Partitioning}}}, doi = {{10.1201/9781420010749.ch60}}, year = {{2007}}, } @article{8175, abstract = {{Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem (where QMA stands for Quantum Merlin Arthur) and initiate its study. We present two main results. The first shows that a nontrivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one) gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the “exhaustive sampling method” by Arora, Karger, and Karpinski [J. Comput. System Sci., 58 (1999), p. 193] to the quantum setting and might be of independent interest.}}, author = {{Gharibian, Sevag and Kempe, Julia}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, number = {{4}}, pages = {{1028--1050}}, publisher = {{Society for Industrial & Applied Mathematics (SIAM)}}, title = {{{Approximation Algorithms for QMA-Complete Problems}}}, doi = {{10.1137/110842272}}, volume = {{41}}, year = {{2012}}, } @inproceedings{8176, abstract = {{Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.}}, author = {{Gharibian, Sevag and Kempe, Julia}}, booktitle = {{IEEE Annual Conference on Computational Complexity (CCC 2011)}}, isbn = {{9781457701795}}, location = {{San Jose, USA}}, publisher = {{IEEE}}, title = {{{Approximation Algorithms for QMA-Complete Problems}}}, doi = {{10.1109/ccc.2011.15}}, year = {{2011}}, } @misc{555, author = {{Setzer, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}}}, year = {{2013}}, } @unpublished{16452, abstract = {{We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. Distributed algorithms for this problem are of practical significance due to the dynamic nature of ad-hoc networks. We present a first distributed approximation algorithm, with a constant approximation factor and O(Diam) running time, where Diam is the diameter of the graph. Moreover we present a simple heuristic algorithm and conduct an extensive simulation study showing that our heuristic outperforms previously known approaches for the problem.}}, author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, booktitle = {{arXiv:1510.01866}}, title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks}}}, year = {{2015}}, } @article{2849, author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, journal = {{Theory of Computing Systems}}, publisher = {{Springer}}, title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}}}, doi = {{10.1007/s00224-017-9836-z}}, year = {{2018}}, } @inbook{3050, author = {{Alt, Helmut and Blömer, Johannes and Wagener, Hubert}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{3540528261}}, pages = {{703--716}}, publisher = {{Springer-Verlag}}, title = {{{Approximation of convex polygons}}}, doi = {{10.1007/bfb0032068}}, year = {{1990}}, } @inproceedings{22339, author = {{Adelt, Philipp and Schmidt, Alexander and Esau, Natascha and Kleinjohann, Lisa and Kleinjohann, Bernd and Rose, Mirko}}, booktitle = {{MSC2008}}, isbn = {{978-1-4244-2224-1}}, pages = {{619--624}}, title = {{{Approximation of Environment Models for an Air Gap Adjustment System in a Hybrid Planning Context}}}, doi = {{10.1109/ISIC.2008.4635937}}, year = {{2008}}, } @inproceedings{15291, author = {{Hüllermeier, Eyke}}, booktitle = {{in Proceedings 4.Internationaler Workshop Fuzzy-Neuro-Systeme. Soest Germany}}, editor = {{Grauel, A. and Becker, W. and Belli, F.}}, pages = {{374--381}}, title = {{{Approximation of fuzzy functions}}}, year = {{1997}}, } @inproceedings{23162, author = {{Krüger, Martin and Trächtler, Ansgar}}, booktitle = {{7th Vienna International Conference on Mathematical Modelling}}, title = {{{Approximation of Pareto-Optimal Systems using Parametric Model-Order Reduction}}}, year = {{2012}}, } @article{24708, author = {{Widany, Kai-Uwe and Mahnken, Rolf}}, issn = {{1617-7061}}, journal = {{PAMM}}, pages = {{273--274}}, title = {{{Approximation of the dual problem for error estimation in inelastic problems}}}, doi = {{10.1002/pamm.201410124}}, year = {{2014}}, } @article{16200, author = {{Hüllermeier, Eyke}}, journal = {{Fuzzy Sets and Systems}}, number = {{2}}, pages = {{227--240}}, title = {{{Approximation of uncertain funtional relationships}}}, volume = {{101}}, year = {{1999}}, } @article{23739, abstract = {{This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle. }}, author = {{Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{1587--1622}}, title = {{{Approximation Techniques for Utilitarian Mechanism Design}}}, doi = {{10.1137/090772988}}, year = {{2011}}, } @phdthesis{8425, abstract = {{This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time (classical) approximation algorithm for dense instances of the canonical QMA-complete quantum constraint satisfaction problem, the local Hamiltonian problem. In the opposite direction, we next introduce a quantum generalization of the polynomial-time hierarchy, and define problems which we prove are not only complete for the second level of this hierarchy, but are in fact hard to approximate. In the second area, we study variants of the interesting and stubbornly open question of whether a quantum proof system with multiple unentangled quantum provers is equal in expressive power to a proof system with a single quantum prover. Our results concern classes such as BellQMA(poly), and include a novel proof of perfect parallel repetition for SepQMA(m) based on cone programming duality. In the third area, we study non-classical quantum correlations beyond entanglement, often dubbed "non-classicality". Among our results are two novel schemes for quantifying non-classicality: The first proposes the new paradigm of exploiting local unitary operations to study non-classical correlations, and the second introduces a protocol through which non-classical correlations in a starting system can be "activated" into distillable entanglement with an ancilla system. An introduction to all required linear algebra and quantum mechanics is included.}}, author = {{Gharibian, Sevag}}, pages = {{240}}, title = {{{Approximation, Proof Systems, and Correlations in a Quantum World}}}, year = {{2013}}, } @inproceedings{17420, abstract = {{Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models’ original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects’ approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an object’s shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects. }}, author = {{Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada}}, editor = {{Brooks, Stephen and Irani, Pourang}}, pages = {{79----86}}, publisher = {{Canadian Human-Computer Communications Society}}, title = {{{Approximative occlusion culling using the hull tree}}}, year = {{2011}}, } @misc{47650, author = {{Ziegert, Steffen}}, title = {{{Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem}}}, year = {{2007}}, } @unpublished{23534, abstract = {{In recent years, the World Economic Forum has identified software security as the most significant technological risk to the world's population, as software-intensive systems process critical data and provide critical services. This raises the question of the extent to which German companies are addressing software security in developing and operating their software products. This paper reports on the results of an extensive study among developers, product owners, and managers to answer this question. Our results show that ensuring security is a multi-faceted challenge for companies, involving low awareness, inaccurate self-assessment, and a lack of competence on the topic of secure software development among all stakeholders. The current situation in software development is therefore detrimental to the security of software products in the medium and long term.}}, author = {{Dziwok, Stefan and Koch, Thorsten and Merschjohann, Sven and Budweg, Boris and Leuer, Sebastian}}, booktitle = {{arXiv:2108.11752}}, title = {{{AppSecure.nrw Software Security Study}}}, year = {{2021}}, } @article{46015, author = {{Morrien, Rita}}, journal = {{Weimarer Beiträge}}, pages = {{118--133}}, publisher = {{Passagen Verlag}}, title = {{{Aquatische Relektüre: Christian Petzolds "Undine" erklärt Berlin und geht}}}, volume = {{1}}, year = {{2023}}, } @inproceedings{15037, author = {{Hinn, Robert and Redmer, Benedikt and Domik, Gitta}}, booktitle = {{The First IEEE International Workshop Agumented Reality Toolkit,}}, pages = {{2--pp}}, title = {{{AR-campus}}}, year = {{2002}}, } @misc{18684, author = {{Peckhaus, Volker}}, booktitle = {{Zentralblatt für Mathematik und ihre Grenzgebiete}}, title = {{{Arai, Toshiyasu, “Progress in the Proof Theory Related to Hilbert’s Second Problem”, In: Sugaku Expositions 57 (2008), 83–96}}}, year = {{2011}}, } @misc{44876, author = {{Peckhaus, Volker}}, booktitle = {{Mathematical Reviews MR4451488}}, title = {{{Aranda, Victor. Completeness: From Husserl to Carnap. Logica Universalis 16 (2022), 57–83}}}, year = {{2023}}, } @article{39678, author = {{Morrien, Rita}}, journal = {{Schriften der Theodor-Storm-Gesellschaft }}, pages = {{23--35}}, publisher = {{Boyens}}, title = {{{Arbeit “in Kontrasten” – Künstler- und Vaterschaft in Theodor Storms Novelle Eine Malerarbeit}}}, volume = {{50}}, year = {{2001}}, } @inbook{27139, author = {{Foullois, Marc and Kato-Beiderwieden, Anna-Lena and Mlekus, Lisa and Maier, Günter W. and Jenderny, Sascha and Röcker, Carsten and Dietz, Oliver and Pretzlaff, Matthias and Huxdorf, Oliver and von Dungern, Friedrich and Bräutigam, Dieter and Seifert, Lars and Dumitrescu, Roman}}, booktitle = {{Arbeit in der digitalisierten Welt - Praxisbeispiele und Gestaltungslösungen aus dem BMBF-Förderschwerpunkt}}, editor = {{Bauer, Wilhelm and Mütze-Niewöhner, Susanne and Stowasser, Sascha and Zanker, Claus and Müller, Nadine}}, pages = {{239--255}}, publisher = {{Springer Vieweg, Berlin, Heidelberg}}, title = {{{Arbeit 4.0 in der Produktentstehung mit IviPep}}}, year = {{2021}}, } @inbook{19177, abstract = {{Angaben zu den Herausgebern und zur Mitarbeit: Hg. von Carsten Rohde, Thorsten Valk und Mathias Mayer. Unter Mitarbeit von Annette Schöneck.}}, author = {{Eke, Norbert Otto}}, booktitle = {{Faust-Handbuch: Konstellationen – Diskurse – Medien}}, editor = {{Rohde, Carsten and Valk, Thorsten and Mayer, Mathias and Schöneck, Annette}}, pages = {{451--459}}, publisher = {{Metzler}}, title = {{{Arbeit am Mythos: Emphase und Ernüchterung – Faust nach 1945: Theater}}}, year = {{2018}}, } @inbook{32968, author = {{Öhlschläger, Claudia and Encke, Julia }}, booktitle = {{Fischer-Lichte Performativität und Ereignis}}, editor = {{Fischer-Lichte , Erika}}, pages = {{135--148}}, publisher = {{Francke }}, title = {{{Arbeit am Unverfügbaren. Ernst Jünger und die Szene des Ereignisses}}}, year = {{2003}}, } @book{49072, author = {{Schulze, Max}}, publisher = {{Selbstverlag}}, title = {{{Arbeit auf Papier 2002}}}, year = {{2002}}, } @phdthesis{46618, author = {{Vöing, Nerea}}, isbn = {{9783839448168}}, publisher = {{transcript Verlag}}, title = {{{Arbeit und Melancholie}}}, doi = {{10.1515/9783839448168}}, year = {{2021}}, } @inbook{34620, author = {{Alpsancar, Suzana}}, booktitle = {{Ernst Kapp und die Anthropologie der Medien}}, editor = {{Maye, Harun and Scholz, Leander}}, isbn = {{978-3-86599-380-9 }}, pages = {{104 -- 122}}, publisher = {{Kadmos}}, title = {{{Arbeit und Technik? Zur Anschlussfähigkeit des Arbeitsparadigmas am Beispiel Ernst Kapp}}}, year = {{2019}}, } @book{50639, editor = {{Albus, Vanessa and Draken, Klaus}}, title = {{{Arbeit, Zeitschrift für Didaktik der Philosophie und Ethik}}}, volume = {{ 2}}, year = {{2022}}, } @article{35252, author = {{Laubenstein, Désirée and Heger, M.}}, journal = {{In: Teilhabe, 49. Jahrgang, Nr. 3}}, pages = {{110--116}}, title = {{{Arbeiten auf dem allgemeinen Arbeitsmarkt für Menschen mit geistiger Behinderung durch „Übergang Schule-Beruf“}}}, year = {{2010}}, } @article{3644, author = {{Gruber, Hans and Harteis, Christian and Rehrl, Monika}}, journal = {{Blick in die Wissenschaft}}, number = {{17}}, pages = {{18----25}}, title = {{{Arbeiten und Lernen zugleich? Die Analyse von Professional Learning}}}, year = {{2005}}, } @article{5526, author = {{Baum, M and Kabst, Rüdiger}}, journal = {{Zeitschrift für Betriebswirtschaft (ZfB).}}, number = {{3}}, pages = {{327--349}}, title = {{{Arbeitgebermarkenaufbau durch informelle Hochschul-Personalmarketingmaßnahmen: Eine empirische Analyse im deutschen Mittelstand.}}}, volume = {{81}}, year = {{2011}}, } @misc{32138, author = {{Herrmann, Barbara and Niederhaus, Constanze and Parádi, Zsuzsa and Sebestyén, Katalin}}, title = {{{Arbeitsblätter für den fachsprachlichen Deutschunterricht im Fach Elektrotechnik am Shanghai Hamburg College}}}, year = {{2008}}, } @book{28253, abstract = {{In diesem Arbeitsbuch werden die Wege der 1959 in Westfalen geborenen und heute v.a. in Berlin lebenden Judith Kuckart zurückverfolgt – und zwar in den Gattungen Prosa, Theater, Hör-Feature und Film sowie im Bereich Tanz: In all diesen Gattungen hat die Künstlerin seit den 1980er Jahren ein umfassendes OEuvre entwickelt. Im vorliegenden Band werden erstmals alle ihre Schaffensbereiche thematisiert und in ihren Zusammenhängen betrachtet. Dies geschieht mittels wissenschaftlicher Essays, künstlerischer und persönlicher Kurzbeiträge sowie ausführlicher Gespräche mit Judith Kuckart. Ihr künstlerisches Leben und Werk wird auf diese Weise in seinen vielfältigen Aspekten erfasst und der wissenschaftlichen und kulturellen Öffentlichkeit präsentiert.}}, editor = {{Elit, Stefan and Canaris, Johanna}}, isbn = {{9783631843079}}, keywords = {{Erzählverfahren deutschsprachige Gegenwartsliteratur Tanztheater Westfalen Heimat Hörspiel}}, pages = {{358}}, publisher = {{Peter Lang}}, title = {{{Arbeitsbuch Judith Kuckart. Erzählen – Theater – Tanz}}}, volume = {{9}}, year = {{2021}}, } @book{51490, editor = {{Hilgert, Joachim}}, publisher = {{Springer Spektrum}}, title = {{{Arbeitsbuch Mathematik für das erste Studienjahr}}}, year = {{2013}}, } @book{4911, author = {{Zimmermann, Klaus F and Bauer, Thomas K and Bonin, Holger and Fahr, Rene and Hinte, Holger}}, title = {{{Arbeitskräftebedarf bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept für Deutschland}}}, year = {{2013}}, } @techreport{49474, author = {{Staffel, Florian Lukas}}, title = {{{Arbeitskreis für Historische Belgienforschung: Vierter Workshop}}}, year = {{2017}}, } @inproceedings{51855, author = {{Niemann, Jan and Raneck-Kuhlmann, A. and Drossel, Kerstin and Eickelmann, Birgit and Buhl, Heike M.}}, booktitle = {{Vortrag im Rahmen des QLB-Programmworkshops, Bergische Universität Wuppertal}}, location = {{Bergische Universität Wuppertal}}, title = {{{Arbeitsprozessstrukturen in phasenübergreifenden Communities of Practice als Determinanten der Professionalisierung von Lehrkräfteausbildner*innen}}}, year = {{2023}}, } @inproceedings{1946, author = {{Krimphove, Dieter}}, publisher = {{Editions Juridiques Bruylant}}, title = {{{Arbeitsrecht / Europäische Vorgaben der Unternehmensansiedlung}}}, year = {{1999}}, } @article{1667, author = {{Krimphove, Dieter}}, journal = {{Neue Zeitschrift für Arbeitsrecht (NZA)}}, number = {{Heft 13}}, pages = {{724 ff.}}, publisher = {{Verlag C.H. Beck}}, title = {{{Arbeitsrecht und Betriebsgröße}}}, year = {{2002}}, } @article{1652, author = {{Krimphove, Dieter}}, journal = {{Sächsisches Genossenschaftsblatt }}, number = {{11}}, pages = {{50 ff.}}, title = {{{Arbeitsrechtliche Aspekte der Verschmelzung von Genossenschaften }}}, year = {{1992}}, } @article{13989, author = {{Krimphove, Dieter}}, journal = {{ArbR – Arbeitsrecht Aktuell}}, pages = {{27--29}}, publisher = {{Beck online}}, title = {{{Arbeitsrechtliche Rechtsprechung des EuGH im Jahre 2018}}}, volume = {{2}}, year = {{2019}}, } @article{15633, author = {{Krimphove, Dieter}}, journal = {{ArbR – Arbeitsrecht Aktuell}}, pages = {{1--4}}, publisher = {{C. H. Beck}}, title = {{{Arbeitsrechtliche Rechtsprechung des EuGH im Jahre 2019}}}, volume = {{1}}, year = {{2020}}, } @article{36212, author = {{Krimphove, Dieter}}, journal = {{ArbR - Arbeitsrecht Aktuell}}, number = {{26}}, pages = {{679 ff.}}, title = {{{Arbeitsrechtliche Rechtsprechung des EuGH im Jahre 2021}}}, year = {{2021}}, } @article{36191, author = {{Krimphove, Dieter}}, journal = {{ArbR - Arbeitsrecht Aktuell}}, number = {{1}}, pages = {{1 ff.}}, title = {{{Arbeitsrechtliche Rechtssprechung des EuGH im Jahre 2020}}}, year = {{2021}}, } @article{34449, author = {{Crépellière, Tommy and Pelster, Matthias and Zeisberger, Stefan}}, journal = {{Journal of Financial Markets}}, title = {{{Arbitrage in the Market for Cryptocurrencies}}}, doi = {{10.1016/j.finmar.2023.100817}}, year = {{2022}}, } @misc{8482, author = {{Jurgelucks, Benjamin and Schulze, Veronika and Feldmann, Nadine and Claes, Leander}}, title = {{{Arbitrary sensitivity for inverse problems in piezoelectricity}}}, year = {{2019}}, } @misc{34602, author = {{Kamp, Hermann}}, booktitle = {{Medieval Warfare and Military Technology}}, editor = {{von Rodgers, Clifford}}, title = {{{Arbitration and Peacemaking}}}, volume = {{3}}, year = {{2010}}, } @inproceedings{34532, abstract = {{This report presents the results of a friendly competition for formal verification and policy synthesis of stochastic models. It also introduces new benchmarks and their properties within this category and recommends next steps for this category towards next year’s edition of the competition. In comparison with tools on non-probabilistic models, the tools for stochastic models are at the early stages of development that do not allow full competition on a standard set of benchmarks. We report on an initiative to collect a set of minimal benchmarks that all such tools can run, thus facilitating the comparison between efficiency of the implemented techniques. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in Summer 2022.}}, author = {{Abate, Alessandro and Blom, Henk and Delicaris, Joanna and Haesaert, Sofie and Hartmanns, Arnd and van Huijgevoort, Birgit and Lavaei, Abolfazl and Ma, Hao and Niehage, Mathis and Remke, Anne and Schön, Oliver and Schupp, Stefan and Soudjani, Sadegh and Willemsen, Lisa}}, booktitle = {{EPiC Series in Computing}}, issn = {{2398-7340}}, publisher = {{EasyChair}}, title = {{{ARCH-COMP22 Category Report: Stochastic Models}}}, doi = {{10.29007/lsvc}}, year = {{2022}}, } @misc{30981, author = {{Schubert, Katrin}}, booktitle = {{WSK Band 6 (Wörterbücher zur Sprach- und Kommunikationswissenschaft): Text- und Diskurslinguistik.}}, editor = {{Gansel, Christina and Spieß, Constanze}}, title = {{{Archaismus}}}, volume = {{Band 6}}, year = {{2020}}, } @misc{33015, author = {{Markewitz, Friedrich}}, booktitle = {{WSK Band 6 (Wörterbücher zur Sprach- und Kommunikationswissenschaft): Text- und Diskurslinguistik}}, editor = {{Gansel, Christina and Spieß, Constanze }}, publisher = {{Walter de Gruyter }}, title = {{{Archäologie}}}, year = {{2020}}, } @article{32970, author = {{Öhlschläger, Claudia}}, journal = {{Einsichten 2/2003 (Forschungen an der Ludwig- Maximilians-Universität München)}}, pages = {{38--41}}, title = {{{Archäologie der Zerstörung. W.G. Sebalds kombinatorische Gedächtniskunst}}}, year = {{2003}}, } @article{49191, author = {{Gretz, Daniela}}, journal = {{Sprache und Literatur}}, pages = {{89‒107}}, title = {{{Archen in der Papierflut der Gegenwart. Zur medialen Selbstinszenierung von Zeitschriften als Archiven in der »Bildungspresse« des 19. Jahrhunderts}}}, year = {{2014}}, } @book{49830, author = {{Diedrich, Alena and Penke, Niels and Hoffmann, Julia}}, isbn = {{9783631624623}}, publisher = {{Peter Lang}}, title = {{{Archetypen, Artefakte. Komparatistische Beiträge zur kulturellen und literarischen Repräsentation von Tieren}}}, year = {{2013}}, } @inproceedings{631, abstract = {{Maintaining software systems requires up-to-date models of these systems to systematically plan, analyze, and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist.Thus, a reverse engineering step is needed that recovers the system's components, subsystems, and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix enables the reengineer to detect the most relevant deficiencies with respect to a reverseengineered component-based architecture and supports him by presenting the architectural consequences of removinga given deficiency.}}, author = {{von Detten, Markus}}, booktitle = {{Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)}}, pages = {{503 -- 504 }}, title = {{{Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}}}, doi = {{10.1109/WCRE.2012.61}}, year = {{2012}}, } @inproceedings{630, abstract = {{Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture.}}, author = {{Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}}, booktitle = {{Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}}, pages = {{255--264}}, title = {{{Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}}}, doi = {{10.1109/CSMR.2012.33}}, year = {{2012}}, } @inproceedings{24305, abstract = {{Energy efficiency drives the development of more and more complex low-power designs. Based on dynamic power management techniques, multiple voltage islands as well as a huge amount of power states are specified that have to be tested carefully. In this context, low-power design should start at an early stage using state-of-the-art system-level modeling and simulation techniques. However, there is neither a programming language nor any modeling standard that reflects variable power together with its functional side effects in a well-suited abstract manner. To overcome this limitation, we present a modeling approach on top of SystemC TLM to capture low-power design characteristics at electronic system-level. We demonstrate the usability by means of an existing open-source low-power design. The experimental results show that appropriate TLM instrumentation cause only minimal simulation overhead, but offer sufficient details to identify common low-power design errors.}}, author = {{Mischkalla, Fabian and Müller, Wolfgang}}, booktitle = {{Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV)}}, publisher = {{IEEE}}, title = {{{Architectural Low-Power Design Using Transaction-Based System Modeling and Simulation}}}, doi = {{10.1109/SAMOS.2014.6893219}}, year = {{2014}}, } @inproceedings{25120, author = {{Mischkalla, Fabian and Müller, Wolfgang}}, booktitle = {{Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV)}}, location = {{Greece, Sep. 2014, IEEE}}, publisher = {{IEEE}}, title = {{{Architectural Low-Power Design Using Transaction-Based System Simulation}}}, year = {{2014}}, } @inproceedings{219, abstract = {{Existing software markets like Google Play allow users to search among available Apps and select one based on the description provided for the App or based on its rating. Future software markets facilitate on-the-fly composition of such Apps based on users’ individual wishes. Realizing such On-The-Fly Computing (OTF) markets requires support of sophisticated software features. In addition, suitable orchestration among such features needs to ensure well-alignment of business and IT aspects in case of run-time changes like market dynamics. However, all these introduce new architectural and management complexities, which are specific to such markets. An architecture framework for OTF markets will include design solutions to overcome these complexities. In my PhD, I aim at identifying an architecture framework for OTF markets including main architectural building blocks and a systematic development process. Such an architecture framework enables the development of OTF markets in the future. Furthermore, this knowledge can be used as a basis to improve existing software markets by integrating missing functionalities.}}, author = {{Jazayeri, Bahar}}, booktitle = {{Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)}}, pages = {{42}}, publisher = {{ACM}}, title = {{{Architectural Management of On-The-Fly Computing Markets}}}, doi = {{10.1145/2993412.3010821}}, year = {{2016}}, } @inbook{45897, author = {{Gottschalk, Sebastian and Vorbohle, Christian and Kundisch, Dennis and Engels, Gregor and Wünderlich, Nacy V.}}, booktitle = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}}, editor = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}}, pages = {{203--224}}, publisher = {{Heinz Nixdorf Institut, Universität Paderborn}}, title = {{{Architectural Management of OTF Computing Markets}}}, doi = {{10.5281/zenodo.8068691}}, volume = {{412}}, year = {{2023}}, } @article{7270, author = {{Grieger, Marvin and Sauer, Stefan and Klenke, Markus}}, journal = {{Softwaretechnik-Trends, Proceedings of the 2nd Workshop Model-Based and Model-Driven Software Modernization (MMSM)}}, number = {{2}}, pages = {{44--45}}, title = {{{Architectural Restructuring by Semi-Automatic Clustering to Facilitate Migration towards a Service-oriented Architecture}}}, volume = {{34}}, year = {{2014}}, } @inproceedings{20525, author = {{Stockmann, Lars and Laux, Sven and Bodden, Eric}}, booktitle = {{2019 IEEE International Conference on Software Architecture Companion (ICSA-C)}}, pages = {{77--84}}, title = {{{Architectural Runtime Verification}}}, doi = {{10.1109/ICSA-C.2019.00021}}, year = {{2019}}, } @inproceedings{7938, author = {{Guo, Ping and Engels, Gregor and Heckel, Reiko}}, booktitle = {{Proceedings of the 12th Asia-Pacific Software Engineering Conference (APSEC 2005), Taipei (Taiwan)}}, pages = {{367--374}}, publisher = {{IEEE Computer Society}}, title = {{{Architectural Style - Based Modeling and Simulation of Complex Software Systems}}}, doi = {{http://dx.doi.org/10.1109/APSEC.2005.41}}, year = {{2005}}, } @phdthesis{7579, abstract = {{Today, mobility is one of the most important market and technology trend within information and communication technology. As the demand for rapid deployment of dependable mobile applications increases, middleware for mobile systems is emerging as one of the most active areas of system research in mobility. The middleware is a set of distributed software services that exists between distributed operating systems and mobile applications. The key to the middleware is to provide support across the mobile application domains, help application developers overcome the complexity and problems brought by mobility, and enhance dependability and usability of developed mobile applications. The criticality and pervasiveness of middleware for mobile systems is continually growing. However, the design and development of the middleware are difficult tasks, and it is not easy to ensure the quality of a developed middleware. This is mainly caused by the increasing complexity of the middleware. In addition, the great diversity of this area makes it very difficult for the designers to reuse the already established design knowledge or successful experience when building new systems. All these make the design process quite inefficient and unpredictable, and therefore risking the project. “One man’s magic is another man’s engineering”. Engineering design is much more routine than innovative. Founding on this fundamental notion in software engineering, we develop an architectural style-based approach to deal with the problems in the thesis. We build architectural styles for a class of related middleware. The style represents a common form of design, which originates from the results that practitioners have achieved in one area. The style is formulated to repeat successes and avoid failures from previous projects. When building a new middleware, the designers and developers do not need to explore all possible alternatives for its supported architecture. Instead, they can use the architectural style that is effective for the middleware. They can define the design as instances of the style, or they can use the style as a reference model for further improvement and development. By structuring the design space for a family of related middleware, the style can drastically simplify the process of building a middleware, reduce costs of implementation through reusable infrastructure, and improve system integrity through style-specific analysis and checks. We develop the approach based on UML-like meta modeling and graph transformation techniques to support sound methodological principles, powerful modeling, formal analysis and refinement. The approach consists of several main parts: the modeling language that supports specification of the style and mobility, the refinement formalization that ensures that an abstract style is correctly refined to a concrete one, as well as the consistency check framework that validates behavioral consistency between two styles on different abstract layers. With the Fujaba simulation tool support, we also develop a style-based engineering process that helps us to efficiently develop correct and consistent styles. Besides, it allows a seamless integration of our approach into the well-known object oriented design. By providing a concrete example of how to construct the style for a class of related middleware, and how to use the style to help the design and development of a new middleware, we show that the architectural style-based approach is useful and practical.}}, author = {{Guo, Ping}}, title = {{{Architectural Style-based Modeling and Simulation of Middleware for Mobile Systems}}}, year = {{2007}}, }