@inproceedings{16896, author = {{Volbracht, S. and Domik, Gitta and Shahrbabaki, K. and Fels, G.}}, booktitle = {{Proceedings of IEEE Visualization }}, location = {{San Francisco, USA}}, pages = {{8--11}}, title = {{{An Experimental Comparison of 3D Display Modes}}}, year = {{1996}}, } @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}}, } @inproceedings{15293, author = {{Hüllermeier, Eyke}}, booktitle = {{International Symposium on Soft Computing, Reading U.K.}}, editor = {{Anderson, P.G. and Warwick, K.}}, pages = {{B230--B236}}, publisher = {{ICSC Academic Press}}, title = {{{A fuzzy simulation method}}}, year = {{1996}}, } @inproceedings{15304, author = {{Hüllermeier, Eyke}}, booktitle = {{in Proceedings Interval-96 international Conference on Interval Methods and Computer Aided Proofs in Science and Engineering, Würzburg}}, pages = {{54--55}}, title = {{{Hierarchical constraint propagation based on interval arithmetic}}}, year = {{1996}}, } @book{14894, author = {{Fosdick, Lloyd Dudley and Jessup, Elizabeth R and Schauble, Carolyn JC and Domik, Gitta}}, isbn = {{9780262061810}}, publisher = {{MIT Press}}, title = {{{An introduction to high-performance scientific computing}}}, year = {{1996}}, } @inproceedings{15056, author = {{Volbracht, Sabine and Shahrbabaki, Khatoun and Domik, Gitta and Fels, Gregor}}, booktitle = {{Proceedings 1996 IEEE Symposium on Visual Languages}}, pages = {{192--193}}, title = {{{Perspective viewing, Anaglyph stereo or Shutter glass stereo?}}}, year = {{1996}}, } @inproceedings{13602, author = {{Lind, Erich and Platzner, Marco and Rinner, Bernhard }}, booktitle = {{Proceedings of the 7th International Conference on Signal Processing Applications & Technology (ICSPAT)}}, title = {{{A Multi-DSP System with Dynamically Reconfigurable Processors}}}, year = {{1996}}, } @inproceedings{39513, author = {{Aisch, H. and Joosten, M. and Müller, Wolfgang and Buijs, F.}}, title = {{{Interaktiver Produktdatenaustausch mit EDIFACT}}}, year = {{1996}}, } @inproceedings{39521, abstract = {{Investigates the integration of an interactive constraint solver into an existing 2D real-time animation environment in order to achieve a better observability, traceability and stability of the individual graphical objects. We present two approaches for assigning constraints to the objects. The first approach assigns constraints to the objects when they are created, keeping them stable during their entire life-time. The second approach dynamically changes constraints before the computation of each frame. The investigation is based on our practical experience with the complete visual programming language Pictorial Janus and the parallel constraint solver Parcon.}}, author = {{Griebel, P. and Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C. and Uhr, H.}}, booktitle = {{Proceedings of the 1996 IEEE Symposium on Visual Languages}}, isbn = {{0-8186-7508-X}}, keywords = {{Animation, Layout, Computer languages, Visualization, Observability, Stability, Runtime, Costs, Graphics, Hardware}}, title = {{{Integrating a Constraint Solver into a Real-Time Animation Environment}}}, doi = {{10.1109/VL.1996.545262}}, year = {{1996}}, } @inproceedings{39517, author = {{Dücker, Marita and Lehrenfeld, Georg and Müller, Wolfgang}}, booktitle = {{Proceedings of the 10th European Simulation Multiconference (ESM'96)}}, title = {{{Specification and Analysis of Concurrent Systems in a Complete Visual Environment}}}, year = {{1996}}, } @inproceedings{39526, abstract = {{The main goal of the article is to evaluate the suitability of visual programming languages, i.e., Pictorial Janus (K. Kahn and V. Saraswat, 1990), for the modeling of complex systems and their control strategies. These systems can be seen as networks of communicating objects. Objects select strategies for suitable actions based on incoming messages. Our field of investigation is in computer integrated manufacturing considering the example of a car manufacturing cell. This color sorting assembly buffer (CSAB) schedules jobs in queues. The jobs represent car bodies scheduled in feeder lines for the enameling. Feeder lines collect raw bodies to blocks. Blocks are bodies which are to be enameled by the same color. This organization decreases the cost of expensive change-over-times when changing colors at the enamelling. Blocks of bodies are dislocated from the queue and enameled successively. Contradictory system goals, such as minimizing color changes and preserving the sequence of incoming jobs, have to be regarded by appropriate control strategies. Due to the complexity of this (NP complete) problem and to real time requirements for online control there are no optimal strategies on hand. Consequently, suitable heuristics have to be developed. Often they are designed applying a trial-and-error method. A modeling framework has to support the rapid prototyping of these systems as well as an expressive end user oriented representation. Both are essential requirements since end users need other visualization techniques than experienced designers due to their different knowledge and interests.}}, author = {{Geiger, Christian and Hunstock, R. and Lehrenfeld, Georg and Müller, Wolfgang and Quintanilla, J. and Tahedl, C. and Weber, A.}}, booktitle = {{Proceedings of the 1996 IEEE Symposium on Visual Languages}}, isbn = {{0-8186-7508-X}}, keywords = {{Computer integrated manufacturing, Job shop scheduling, Processor scheduling, Computer languages, Control system synthesis, Computer aided manufacturing, Sorting, Assembly, Costs, Control systems}}, title = {{{Visual Modeling and 3D-Representation with a Complete Visual Programming Language --- A Case Study in Manufacturing}}}, doi = {{10.1109/VL.1996.545302}}, year = {{1996}}, } @phdthesis{19623, author = {{Stemann, Volker}}, isbn = {{3-931466-02-7}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Contention Resolution in Hashing Based Shared Memory Simulations}}}, volume = {{3}}, year = {{1995}}, } @phdthesis{19627, author = {{Czumaj, Artur}}, isbn = {{3-931466-07-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations}}}, volume = {{8}}, year = {{1995}}, } @phdthesis{19630, author = {{Wachsmann, Alf}}, isbn = {{3-931466-05-1}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher}}}, volume = {{6}}, year = {{1995}}, } @phdthesis{19634, author = {{Ameur, Foued}}, isbn = {{3-931466-09-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Space-Bounded Learning Algorithms}}}, volume = {{10}}, year = {{1995}}, } @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}}, } @techreport{3038, author = {{Blömer, Johannes and Kalfane, Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman, David}}, title = {{{An XOR-based erasure-resilient coding scheme}}}, year = {{1995}}, } @inproceedings{17482, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, booktitle = {{Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures}}, pages = {{46----59}}, title = {{{Simulating shared memory in real time: On the computation power of reconfigurable meshes}}}, year = {{1995}}, } @inproceedings{21786, author = {{Kienegger-Domik, Gitta}}, booktitle = {{Proceedings of ED-MEDIA `95}}, editor = {{Maurer, H.}}, pages = {{17--22}}, publisher = {{AACE}}, title = {{{Intelligent visualization systems in educational environments}}}, year = {{1995}}, } @inproceedings{2187, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{ESA}}, pages = {{341----354}}, title = {{{Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}}}, doi = {{10.1007/3-540-60313-1_154}}, year = {{1995}}, }