--- _id: '26263' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA. ; 2003:47-64.' apa: Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model. Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64. bibtex: '@inproceedings{Ziegler_2003, title={Stability versus Speed in a Computable Algebraic Model}, booktitle={Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA}, author={Ziegler, Martin}, year={2003}, pages={47–64} }' chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” In Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64, 2003. ieee: M. Ziegler, “Stability versus Speed in a Computable Algebraic Model,” in Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64. mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64. short: 'M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64.' date_created: 2021-10-15T11:00:14Z date_updated: 2022-01-06T06:57:18Z department: - _id: '63' - _id: '26' language: - iso: eng page: 47-64 publication: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA status: public title: Stability versus Speed in a Computable Algebraic Model type: conference user_id: '15415' year: '2003' ... --- _id: '26277' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Computable Operators on Regular Sets. In: Computability and Complexity in Analysis. Vol 302-8/2003. Informatik Berichte. ; 2003:389-406.' apa: Ziegler, M. (2003). Computable Operators on Regular Sets. Computability and Complexity in Analysis, 302-8/2003, 389–406. bibtex: '@inproceedings{Ziegler_2003, series={Informatik Berichte}, title={Computable Operators on Regular Sets}, volume={302–8/2003}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406}, collection={Informatik Berichte} }' chicago: Ziegler, Martin. “Computable Operators on Regular Sets.” In Computability and Complexity in Analysis, 302-8/2003:389–406. Informatik Berichte, 2003. ieee: M. Ziegler, “Computable Operators on Regular Sets,” in Computability and Complexity in Analysis, 2003, vol. 302–8/2003, pp. 389–406. mla: Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and Complexity in Analysis, vol. 302-8/2003, 2003, pp. 389–406. short: 'M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.' date_created: 2021-10-15T12:13:22Z date_updated: 2022-01-06T06:57:18Z department: - _id: '63' - _id: '26' language: - iso: eng page: 389-406 publication: Computability and Complexity in Analysis series_title: Informatik Berichte status: public title: Computable Operators on Regular Sets type: conference user_id: '15415' volume: 302-8/2003 year: '2003' ... --- _id: '2128' author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17' apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17 bibtex: '@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }' chicago: Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17. ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171. mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17. short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.' date_created: 2018-04-03T05:37:10Z date_updated: 2022-01-06T06:54:52Z department: - _id: '79' - _id: '63' doi: 10.1007/978-3-540-39658-1_17 intvolume: ' 2832' language: - iso: eng page: 161--171 publication: ESA publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Smoothed Motion Complexity type: conference user_id: '14955' volume: 2832 year: '2003' ... --- _id: '2129' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.' apa: 'Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.' bibtex: '@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }' chicago: 'Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.' ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.' mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.' short: 'B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.' date_created: 2018-04-03T05:38:36Z date_updated: 2022-01-06T06:54:53Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:04:48Z date_updated: 2018-04-12T09:04:48Z file_id: '2307' file_name: ICALP-03.pdf file_size: 154427 relation: main_file file_date_updated: 2018-04-12T09:04:48Z has_accepted_license: '1' intvolume: ' 2719' language: - iso: eng oa: '1' page: 1153--1168 publication: ICALP publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'Anycasting in Adversarial Systems: Routing and Admission Control' type: conference urn: '21297' user_id: '14955' volume: 2719 year: '2003' ... --- _id: '17423' author: - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: 15th European Simulation Symposium (ESS 2003). SCS - Europe; 2003:367-371.' apa: Mueck, B., Dangelmaier, W., & Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In 15th European Simulation Symposium (ESS 2003) (pp. 367–371). SCS - Europe. bibtex: '@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}, booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003}, pages={367–371} }' chicago: Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In 15th European Simulation Symposium (ESS 2003), 367–71. SCS - Europe, 2003. ieee: B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in 15th European Simulation Symposium (ESS 2003), 2003, pp. 367–371. mla: Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–71. short: 'B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371.' date_created: 2020-07-28T08:05:14Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' language: - iso: eng page: 367-371 publication: 15th European Simulation Symposium (ESS 2003) publisher: SCS - Europe status: public title: Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment type: conference user_id: '15415' year: '2003' ... --- _id: '18791' abstract: - lang: eng text: We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when 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 + ε using only \~{O}(√ poly(1/ε)) 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 neighbors queries. author: - first_name: Avner full_name: Magen, Avner last_name: Magen - first_name: Funda full_name: Ergun, Funda last_name: Ergun - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Ronitt full_name: Rubinfeld, Ronitt last_name: Rubinfeld - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Ilan full_name: Newman, Ilan last_name: Newman - first_name: Lance full_name: Fortnow, Lance last_name: Fortnow citation: ama: 'Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003:813–822.' apa: Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., & Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) (pp. 813–822). bibtex: '@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003, title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }' chicago: Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 813–822, 2003. ieee: A. Magen et al., “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822. mla: Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822. short: 'A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.' date_created: 2020-09-01T14:15:33Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 813–822 publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) publication_identifier: isbn: - '0898715385' status: public title: Sublinear Approximation of Euclidean Minimum Spanning Tree type: conference user_id: '15415' year: '2003' ... --- _id: '18907' abstract: - lang: eng text: In a (randomized) oblivious routing scheme the path chosen for a request
between a source $s$ and a target $t$ is independent from the current traffic
in the network. Hence, such a scheme consists of probability distributions
over $s-t$ paths for every source-target pair $s,t$ in the network.

In a recent result citeR02 it was shown that for any undirected network
there is an oblivious routing scheme that achieves a polylogarithmic
competitive ratio with respect to congestion. Subsequently, Azar et
al. citeACF+03 gave a polynomial time algorithm that for a given network
constructs the best oblivious routing scheme, i.e. the scheme that guarantees
the best possible competitive ratio.
Unfortunately, the latter result is based on the Ellipsoid algorithm; hence
it is unpractical for large networks.

In this paper we present a combinatorial algorithm for constructing an
oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$
for undirected networks. Furthermore, our approach yields a proof
for the existence of an oblivious routing scheme with competitive ratio
$O(log^3n)$, which is much simpler than the original proof from citeR02. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Harald full_name: Räcke, Harald last_name: Räcke citation: ama: 'Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. ; 2003. doi:10.1145/777412.777418' apa: Bienkowski, M., Korzeniowski, M., & Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. https://doi.org/10.1145/777412.777418 bibtex: '@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm for constructing oblivious routing schemes}, DOI={10.1145/777412.777418}, booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, year={2003} }' chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003. https://doi.org/10.1145/777412.777418. ieee: M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03, 2003. mla: Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003, doi:10.1145/777412.777418. short: 'M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.' date_created: 2020-09-03T07:44:01Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1145/777412.777418 language: - iso: eng publication: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03 publication_identifier: isbn: - '1581136617' publication_status: published status: public title: A practical algorithm for constructing oblivious routing schemes type: conference user_id: '15415' year: '2003' ... --- _id: '18947' abstract: - lang: eng text: In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents. author: - first_name: Carsten full_name: Rust, Carsten last_name: Rust - first_name: Friedhelm full_name: Stappert, Friedhelm last_name: Stappert - first_name: Tamás full_name: Lukovszki, Tamás last_name: Lukovszki citation: ama: 'Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: 7th World Multiconference on Systemics, Cybernetics and Informatics. ; 2003.' apa: Rust, C., Stappert, F., & Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference on Systemics, Cybernetics and Informatics. bibtex: '@inproceedings{Rust_Stappert_Lukovszki_2003, title={A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}, booktitle={7th World Multiconference on Systemics, Cybernetics and Informatics}, author={Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}, year={2003} }' chicago: Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” In 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003. ieee: C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003. mla: Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003. short: 'C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.' date_created: 2020-09-03T11:50:06Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' language: - iso: eng publication: 7th World Multiconference on Systemics, Cybernetics and Informatics status: public title: A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture type: conference user_id: '15415' year: '2003' ... --- _id: '18960' abstract: - lang: eng text: We investigate distributed algorithms for mobile ad hoc networks for moving radio stations with adjustable transmission power in a worst case scenario. We consider two models to find a reasonable restriction on the worst-case mobility. In the pedestrian model we assume a maximum speed $v_max$ of the radio stations, while in the vehicular model we assume a maximum acceleration $a_max$ of the points. Our goal is to maintain persistent routes with nice communication network properties like hop-distance, energy-consumption, congestion and number of interferences. A route is persistent, if we can guarantee that all edges of this route can be uphold for a given time span $Delta$, which is a parameter denoting the minimum time the mobile network needs to adopt changes, i.e. update routing tables, change directory entries, etc. This $Delta$ can be used as the length of an update interval for a proactive routing scheme. We extend some known notions such as transmission range, interferences, spanner, power spanner and congestion to both mobility models and introduce a new parameter called crowdedness that states a lower bound on the number of radio interferences. Then we prove that a mobile spanner hosts a path system that polylogarithmically approximates the optimal congestion. We present distributed algorithms based on a grid clustering technique and a high-dimensional representation of the dynamical start situation which construct mobile spanners with low congestion, low interference number, low energy-consumption, and low degree. We measure the optimality of the output of our algorithm by comparing it with the optimal choice of persistent routes under the same circumstances with respect to pedestrian or vehicular worst-case movements. Finally, we present solutions for dynamic position information management under our mobility models. author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Tamás full_name: Lukovszki, Tamás last_name: Lukovszki - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: 'Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03). ; 2003. doi:10.1145/777412.777448' apa: Schindelhauer, C., Lukovszki, T., Rührup, S., & Volbert, K. (2003). Worst case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03). https://doi.org/10.1145/777412.777448 bibtex: '@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={10.1145/777412.777448}, booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, year={2003} }' chicago: Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003. https://doi.org/10.1145/777412.777448. ieee: C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003. mla: Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003, doi:10.1145/777412.777448. short: 'C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.' date_created: 2020-09-03T13:10:50Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' doi: 10.1145/777412.777448 language: - iso: eng publication: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03) publication_identifier: isbn: - '1581136617' publication_status: published status: public title: Worst case mobility in ad hoc networks type: conference user_id: '15415' year: '2003' ... --- _id: '18966' abstract: - lang: eng text: A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network. author: - first_name: Yossi full_name: Azar, Yossi last_name: Azar - first_name: Edith full_name: Cohen, Edith last_name: Cohen - first_name: Amos full_name: Fiat, Amos last_name: Fiat - first_name: Haim full_name: Kaplan, Haim last_name: Kaplan - first_name: Harald full_name: Racke, Harald last_name: Racke citation: ama: 'Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03. ; 2003. doi:10.1145/780542.780599' apa: Azar, Y., Cohen, E., Fiat, A., Kaplan, H., & Racke, H. (2003). Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03. https://doi.org/10.1145/780542.780599 bibtex: '@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious routing in polynomial time}, DOI={10.1145/780542.780599}, booktitle={Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03}, author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}, year={2003} }' chicago: Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003. https://doi.org/10.1145/780542.780599. ieee: Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03, 2003. mla: Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003, doi:10.1145/780542.780599. short: 'Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.' date_created: 2020-09-03T14:34:33Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' doi: 10.1145/780542.780599 language: - iso: eng publication: Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 publication_identifier: isbn: - '1581136749' publication_status: published status: public title: Optimal oblivious routing in polynomial time type: conference user_id: '15415' year: '2003' ... --- _id: '18982' abstract: - lang: ger text: In dieser Studienarbeit wurde ein System entworfen und implementiert, das der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch, dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet verteilt sind.
Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server "häppchenweise" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren. author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler citation: ama: Gehweiler J. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. Universität Paderborn; 2003. apa: Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn. bibtex: '@book{Gehweiler_2003, place={Universität Paderborn}, title={Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}, author={Gehweiler, Joachim}, year={2003} }' chicago: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. Universität Paderborn, 2003. ieee: J. Gehweiler, Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn, 2003. mla: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. 2003. short: J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java, Universität Paderborn, 2003. date_created: 2020-09-04T08:03:37Z date_updated: 2022-01-06T06:53:56Z ddc: - '004' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-09-04T08:03:11Z date_updated: 2020-09-04T08:03:11Z file_id: '18985' file_name: pub-hni-2464.pdf file_size: 703144 relation: main_file success: 1 file_date_updated: 2020-09-04T08:03:11Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn status: public title: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java type: mastersthesis user_id: '15415' year: '2003' ... --- _id: '20435' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems. 2003;14(3):263--268. apa: Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems, 14(3), 263--268. bibtex: '@article{Hamann_2003, title={Definition and Behavior of Langton’s Ant in Three Dimensions}, volume={14}, number={3}, journal={Complex Systems}, author={Hamann, Heiko}, year={2003}, pages={263--268} }' chicago: 'Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems 14, no. 3 (2003): 263--268.' ieee: H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” Complex Systems, vol. 14, no. 3, pp. 263--268, 2003. mla: Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems, vol. 14, no. 3, 2003, pp. 263--268. short: H. Hamann, Complex Systems 14 (2003) 263--268. date_created: 2020-11-19T12:15:45Z date_updated: 2022-01-06T06:54:27Z department: - _id: '63' - _id: '238' intvolume: ' 14' issue: '3' language: - iso: eng page: 263--268 publication: Complex Systems status: public title: Definition and Behavior of Langton's Ant in Three Dimensions type: journal_article user_id: '15415' volume: 14 year: '2003' ... --- _id: '18196' abstract: - lang: eng text: Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors. author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03). Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:10.1007/978-3-540-24587-2_72' apa: Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03) (pp. 705–715). https://doi.org/10.1007/978-3-540-24587-2_72 bibtex: '@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion Polynomials}, DOI={10.1007/978-3-540-24587-2_72}, booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }' chicago: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-24587-2_72. ieee: M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715. mla: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–15, doi:10.1007/978-3-540-24587-2_72. short: 'M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.' date_created: 2020-08-24T14:18:19Z date_updated: 2022-01-06T06:53:27Z department: - _id: '63' doi: 10.1007/978-3-540-24587-2_72 language: - iso: eng page: 705-715 publication: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03) publication_identifier: isbn: - '9783540206958' - '9783540245872' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg status: public title: Quasi-optimal Arithmetic for Quaternion Polynomials type: conference user_id: '15415' year: '2003' ... --- _id: '18258' abstract: - lang: eng text: Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N). author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. Lecture Notes in Computer Science. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:10.1007/978-3-540-45078-8_13' apa: 'Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, & Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-45078-8_13' bibtex: '@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Fast Relative Approximation of Potential Fields}, volume={2748}, DOI={10.1007/978-3-540-45078-8_13}, booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler, Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer Science} }' chicago: 'Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45078-8_13.' ieee: 'M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.' mla: Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” Lecture Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:10.1007/978-3-540-45078-8_13. short: 'M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.' corporate_editor: - Algorithms and Data Structures. WADS 2003 date_created: 2020-08-25T10:15:14Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/978-3-540-45078-8_13 editor: - first_name: F. full_name: Dehne, F. last_name: Dehne - first_name: JR. full_name: Sack, JR. last_name: Sack - first_name: M. full_name: Smid, M. last_name: Smid intvolume: ' 2748' language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540405450' - '9783540450788' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Fast Relative Approximation of Potential Fields type: book_chapter user_id: '15415' volume: 2748 year: '2003' ... --- _id: '18367' abstract: - lang: eng text: "Unternehmen operieren zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu; die Produktlebenszyklen werden kürzer; gleichzeitig werden die Produkte komplexer; der harte Wettbewerb zwingt die Unternehmen, auf Marktveränderungen zu reagieren. Aus dieser Entwicklung resultieren hohe Anforderungen an die Gestaltung der Fertigungsprozesse. Im Wesentlichen kommt es darauf an, die Fertigungsprozesse möglichst rasch an die neuen Gegebenheiten anzupassen, bzw. neue Fertigungsprozesse so zu planen, dass sie auf Anhieb die erforderlichen Resultate bringen.\r\nEin wichtiges Mittel hierfür der Einsatz von Materialflusssimulationen. Hierzu ist zunächst die Erstellung eines Simulationsmodells notwendig. Dafür wird in einem ersten Schritt das zu betrachtende System analysiert und ein rechnerinternes Modell erzeugt. Dieses beinhaltet die Modellierung von Funktionen, Prozessen, Verhaltensweisen oder Regeln, die im Modell die tatsächlichen Wirkzusammenhänge im Unternehmen widerspiegeln sollen. Die so modellierten Aspekte sind untereinander so vernetzt, dass alle Funktionen des Modells ein Ganzes ergeben. Für viele Fragenstellungen werden umfangreiche Modelle mit einem komplexen Verhalten benötigt. Andererseits steigt mit zunehmender Größe und Komplexität des Simulationsmodells auch der Modellierungsaufwand, die Fehleranfälligkeit, die Laufzeit und der Interpretationsaufwand bei der Ergebnisauswertung. Fehler bei der Modellbildung führen bei der Simulation zu Fehlinterpretationen und falschen Ergebnissen.\r\nEinen wesentlichen Anteil daran hat die Gestaltung der Benutzungsschnittstelle: Das übliche, wenig intuitive WIMP-Interface (Windows, Icons, Mouse, Pointer) erfordert sehr gut geschulte Benutzer, sodass die Erzeugung der meist komplexen Simulationsmodelle mit großen Zeitaufwand verbunden ist. Die Präsentation der Simulationsergebnisse erfolgt in Form von Wertetabellen und zweidimensionalen, abstrakten Darstellungen des Fertigungssystems. Für die Simulationsexperten erscheint dies ausreichend, für ein aus verschiedenen Bereichen und Disziplinen zusammengesetztes Planungsteam ist das aber nicht akzeptabel. So können Fehlinterpretationen aufgrund der unklaren Darstellungen auftreten.\r\nDurch eine durchgängige Unterstützung von der Modellierung über die Ausführung bis zur Analyse von Simulationen durch Augmented-Reality und Virtual-Reality werden viele dieser Probleme überwunden aber viele neue Probleme entstehen.\r\nMarktgängige Simulatoren unterstützen zwar z.T. schon Virtual Reality; eine durchgängige Simulationsunterstützung wird aber in der Virtuellen Umgebung nicht geboten. Argumented Reality-Komponenten sind bisher nicht bekannt.\r\nIn diesem Artikel werden nach einer Analyse der benötigten Technologien die Nutzenpotentiale insb. durch den Einsatz von AR ausgelotet.\r\n" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Michael full_name: Grafe, Michael last_name: Grafe - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Michael full_name: Schoo, Michael last_name: Schoo citation: ama: 'Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management. Vol 5. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag; 2003:170-177.' apa: 'Fischer, M., Grafe, M., Matysczok, C., Mueck, B., & Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag.' bibtex: '@inproceedings{Fischer_Grafe_Matysczok_Mueck_Schoo_2003, place={Karlsruhe}, series={ESIM - European Series in Industrial Management}, title={Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation}, volume={5}, booktitle={Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management}, publisher={Shaker Verlag}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt and Schoo, Michael}, year={2003}, pages={170–177}, collection={ESIM - European Series in Industrial Management} }' chicago: 'Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and Michael Schoo. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” In Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, 5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag, 2003.' ieee: M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation,” in Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, 2003, vol. 5, pp. 170–177. mla: Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, vol. 5, Shaker Verlag, 2003, pp. 170–77. short: 'M. Fischer, M. Grafe, C. Matysczok, B. Mueck, M. Schoo, in: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, Shaker Verlag, Karlsruhe, 2003, pp. 170–177.' date_created: 2020-08-26T12:53:13Z date_updated: 2022-01-06T06:53:30Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T12:52:18Z date_updated: 2020-08-26T12:52:18Z file_id: '18368' file_name: hni-id-1445.pdf file_size: 221846 relation: main_file success: 1 file_date_updated: 2020-08-26T12:52:18Z has_accepted_license: '1' intvolume: ' 5' language: - iso: eng page: 170-177 place: Karlsruhe publication: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management publisher: Shaker Verlag series_title: ESIM - European Series in Industrial Management status: public title: Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation type: conference user_id: '15415' volume: 5 year: '2003' ... --- _id: '18372' abstract: - lang: ger text: "Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben. Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam zu werden und diese zu entschärfen.\r\nEs wird der Entwurf eines Werkzeugs beschrieben, dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung (Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren. Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation die kritische Situation experimentell untersuchen können. Da der kritische Moment in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten zurück zu setzen.\r\nDie virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt, an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität und Darstellungsperformance zu erreichen.\r\n" author: - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Werner full_name: ' Franke, Werner' last_name: ' Franke' - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Dangelmaier W, Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.' apa: Dangelmaier, W., Franke, W., Mueck, B., & Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 123, pp. 141–151). bibtex: '@inproceedings{Dangelmaier_ Franke_Mueck_Fischer_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen}, volume={123}, booktitle={2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, author={Dangelmaier, Wilhelm and Franke, Werner and Mueck, Bengt and Fischer, Matthias}, year={2003}, pages={141–151}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Dangelmaier, Wilhelm, Werner Franke, Bengt Mueck, and Matthias Fischer. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” In 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 123:141–51. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2003. ieee: W. Dangelmaier, W. Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 141–151. mla: Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 123, 2003, pp. 141–51. short: 'W. Dangelmaier, W. Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.' date_created: 2020-08-26T13:16:08Z date_updated: 2022-01-06T06:53:31Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T13:15:56Z date_updated: 2020-08-26T13:15:56Z file_id: '18373' file_name: hni-id-1340.pdf file_size: 166316 relation: main_file success: 1 file_date_updated: 2020-08-26T13:15:56Z has_accepted_license: '1' intvolume: ' 123' language: - iso: eng page: 141-151 publication: 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen type: conference user_id: '15415' volume: 123 year: '2003' ... --- _id: '18374' abstract: - lang: ger text: 'In der heutigen Zeit operieren Unternehmen zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu und die Produktlebenszyklen werden kürzer. Daraus resultieren hohe Anforderungen an die Planung von Fertigungssysteme. Um diesen Prozess zu unterstützen, sollen die Technologien Augmented Reality und Virtual Reality in einem integrierten System genutzt werden. Dieses System unterstützt den Anwender bei der Modellbildung, der Validierung des Simulationsmodells sowie der folgenden Optimierung des Fertigungssystems. Durch die Entwicklung geeigneter Kopplungs- bzw. Integrationsmechanismen wird eine durchgängige Nutzung der Technologien AR, VR und Simulation realisiert. Die Visualisierung der anfallenden 3D-Daten innerhalb der VR- und ARUmgebungen erfolgt mittels einer 3D-Renderinglibrary, die es durch den Einsatz von neuen entwickelten Verfahren ermöglicht, die verwendeten 3D-Modelle weitgehend automatisiert aus unternehmensinternen 3D-CAD-Modellen zu generieren.' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Michael full_name: Grafe, Michael last_name: Grafe - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok - first_name: Michael full_name: Schoo, Michael last_name: Schoo - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck citation: ama: 'Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003:153-166.' apa: Fischer, M., Grafe, M., Matysczok, C., Schoo, M., & Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 123, 153–166. bibtex: '@inproceedings{Fischer_Grafe_Matysczok_Schoo_Mueck_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation}, volume={123}, booktitle={2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Schoo, Michael and Mueck, Bengt}, year={2003}, pages={153–166}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” In 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003. ieee: M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 153–166. mla: Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 123, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66. short: 'M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.' date_created: 2020-08-26T13:24:57Z date_updated: 2022-01-06T06:53:31Z ddc: - '000' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T13:24:28Z date_updated: 2020-08-26T13:24:28Z file_id: '18375' file_name: hni-id-1343.pdf file_size: 906882 relation: main_file success: 1 file_date_updated: 2020-08-26T13:24:28Z has_accepted_license: '1' intvolume: ' 123' language: - iso: eng page: 153-166 publication: 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation type: conference user_id: '5786' volume: 123 year: '2003' ... --- _id: '18567' author: - first_name: Micah full_name: Adler, Micah last_name: Adler - first_name: Berthold full_name: Vöcking, Berthold last_name: Vöcking - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Naveen full_name: Sivadasan, Naveen last_name: Sivadasan citation: ama: Adler M, Vöcking B, Sohler C, Räcke H, Sivadasan N. Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability & Computing. 2003:225-244. apa: Adler, M., Vöcking, B., Sohler, C., Räcke, H., & Sivadasan, N. (2003). Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability & Computing, 225–244. bibtex: '@article{Adler_Vöcking_Sohler_Räcke_Sivadasan_2003, title={Randomized Pursuit-Evasion in Graphs}, journal={Combinatorics, Probability & Computing}, author={Adler, Micah and Vöcking, Berthold and Sohler, Christian and Räcke, Harald and Sivadasan, Naveen}, year={2003}, pages={225–244} }' chicago: Adler, Micah, Berthold Vöcking, Christian Sohler, Harald Räcke, and Naveen Sivadasan. “Randomized Pursuit-Evasion in Graphs.” Combinatorics, Probability & Computing, 2003, 225–44. ieee: M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion in Graphs,” Combinatorics, Probability & Computing, pp. 225–244, 2003. mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Combinatorics, Probability & Computing, 2003, pp. 225–44. short: M. Adler, B. Vöcking, C. Sohler, H. Räcke, N. Sivadasan, Combinatorics, Probability & Computing (2003) 225–244. date_created: 2020-08-28T12:14:18Z date_updated: 2022-01-06T06:53:40Z department: - _id: '63' language: - iso: eng page: 225-244 publication: Combinatorics, Probability & Computing status: public title: Randomized Pursuit-Evasion in Graphs type: journal_article user_id: '15415' year: '2003' ... --- _id: '18573' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Sohler C. Property Testing and Geometry. Vol 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003. apa: Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Sohler_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Property Testing and Geometry}, volume={119}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Sohler, Christian}, year={2003}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Sohler, Christian. Property Testing and Geometry. Vol. 119. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003. ieee: C. Sohler, Property Testing and Geometry, vol. 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003. mla: Sohler, Christian. Property Testing and Geometry. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003. short: C. Sohler, Property Testing and Geometry, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003. date_created: 2020-08-28T13:11:56Z date_updated: 2022-01-06T06:53:40Z department: - _id: '63' - _id: '26' intvolume: ' 119' language: - iso: eng publication_identifier: isbn: - 3-935433-28-X publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101281 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Property Testing and Geometry type: dissertation user_id: '5786' volume: 119 year: '2003' ... --- _id: '16481' abstract: - lang: eng text: 'ZusammenfassungVernetzte Systeme sind zu unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner, als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten Datenservern führen.' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). it - Information Technology. 2003. doi:10.1524/itit.45.2.108.19606' apa: 'Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). It - Information Technology. https://doi.org/10.1524/itit.45.2.108.19606' bibtex: '@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)}, DOI={10.1524/itit.45.2.108.19606}, journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm}, year={2003} }' chicago: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” It - Information Technology, 2003. https://doi.org/10.1524/itit.45.2.108.19606.' ieee: 'F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications),” it - Information Technology, 2003.' mla: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.' short: F. Meyer auf der Heide, It - Information Technology (2003). date_created: 2020-04-09T07:27:56Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1524/itit.45.2.108.19606 language: - iso: eng publication: it - Information Technology publication_identifier: issn: - 2196-7032 - 1611-2776 publication_status: published status: public title: 'Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)' type: journal_article user_id: '15415' year: '2003' ...