TY - GEN A1 - Zöckler, Malte A1 - Rein, Karlheinz A1 - Brandt, Robert A1 - Stalling, Detlev A1 - Hege, Hans-Christian T1 - Creating Virtual Insect Brains with Amira N2 - By combining techniques of preparation, histology, confocal microscopy, data visualization and data processing, we have created and recently published a standard brain model for drosophila and honey bee brains. This report describes the algorithms and implementation of the corresponding software modules. At the same time it serves as a user's guide for scientist who want to reproduce the results for differerent species or mutants. T3 - ZIB-Report - 01-32 KW - visualization KW - anatomical atlas Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6589 ER - TY - GEN A1 - Kober, Cornelia A1 - Sader, Robert A1 - Zeilhofer, Hans-Florian A1 - Prohaska, Steffen A1 - Zachow, Stefan A1 - Deuflhard, Peter T1 - Anisotrope Materialmodellierung für den menschlichen Unterkiefer N2 - Im Rahmen der biomechanischen Simulation knöcherner Organe ist die Frage nach einer befriedigenden Materialbeschreibung nach wie vor ungelöst. Computertomographische Datensätze liefern eine räumliche Verteilung der (Röntgen-)Dichte und ermöglichen damit eine gute Darstellung der individuellen Geometrie. Weiter können die verschiedenen Materialbestandteile des Knochens, Spongiosa und Kortikalis, voneinander getrennt werden. Aber die richtungsabängige Information der Materialanisotropie ist verloren. In dieser Arbeit wird ein Ansatz für eine anisotrope Materialbeschreibung vorgestellt, die es ermöglicht, den Einfluss der individuellen knöchernen Struktur auf das makroskopische Materialverhalten abzuschätzen. T3 - ZIB-Report - 01-31 KW - menschlicher Unterkiefer KW - Simulation mit der Methode der finiten Elemente KW - innerer Aufbau des Knochens KW - anisotrope Elastizität Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6574 ER - TY - GEN A1 - Kähler, Ralf A1 - Hege, Hans-Christian T1 - Interactive Volume Rendering of Adaptive Mesh Refinement Data N2 - Many phenomena in nature and engineering happen simultaneously on rather diverse spatial and temporal scales, i.e.\ exhibit a multi-scale character. Therefore various hierarchical data structures and numerical schemes have been devised to represent quantitatively such phenomena. A special numerical multilevel technique, associated with a particular hierarchical data structure, is so-called Adaptive Mesh Refinement (AMR). This scheme achieves locally very high spatial and temporal resolutions. Due to its popularity, many scientists are in need of interactive visualization tools for AMR data. In this article we present a 3D texture-based volume rendering algorithm for AMR data, that directly utilizes the hierarchical structure. Thereby interactive rendering even for large data sets is achieved. In particular the problems of interpolation artifacts, opacity corrections, and texture memory limitations are addressed. The algorithm's value in practice is demonstrated with simulation and image data. T3 - ZIB-Report - 01-30 KW - Scalar field visualization KW - multiresolution volume rendering KW - AMR hierarchies KW - 3D texture mapping Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6561 ER - TY - GEN A1 - Grötschel, Martin T1 - Telota - was soll das? N2 - Telota ist ein Kunstwort, das für alle Aktivitäten der Berlin-Brandenburgischen Akademie der Wissenschaften steht, die der Förderung von Forschung, Kommunikation und Präsentation durch elektronische Medien dienen. In diesem Artikel werden die Entstehung des Telota-Projektes geschildert und die Ziele diskutiert, die mit diesem Projekt erreicht werden sollen. Es geht darum, moderne Informationstechnik bewusst, geplant und nachhaltig für alle Belange der {\rm BBAW} einzusetzen. Informationstechnische Werkzeuge sollen für die wissenschaftliche Arbeit effizient genutzt werden; die Information nach innen und nach außen soll deutlich verbessert werden; eine bessere Kommunikationsinfrastuktur soll die Zusammenarbeit fördern. T3 - ZIB-Report - 01-27 KW - BBAW KW - Telota-Projekt KW - elektronische Publikation Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6538 ER - TY - GEN A1 - Grötschel, Martin T1 - Empfehlungen des Wissenschaftsrates zur digitalen Informationsversorgung durch Hochschulbibliotheken N2 - Der Wissenschaftsrat hat in seiner Juli-Sitzung 2001 \glqq Empfehlungen zur digitalen Informationsversorgung durch Hochschulbibliotheken \grqq verabschiedet. Einige der Vorschläge des Wissenschaftsrates können, falls sie von den angesprochenen Institutionen aufgenommen werden, zu einer nachhaltigen Veränderung der wissenschaftlichen Informationslandschaft führen. In meinem kurzen Kommentar zu diesem Papier möchte ich auf einige dieser Anregungen hinweisen. T3 - ZIB-Report - 01-28 KW - Wissenschaftsrat KW - digitale Informationsversorgung KW - Hochschulbibliotheken Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6546 ER - TY - GEN A1 - Grötschel, Martin T1 - Mein digitaler Traum N2 - Von welcher "Informationsumwelt" träumt jemand, der für seine wissenschaftliche (und sonstige) Arbeit digitale Informationstechnologie intensiv einsetzt? In diesem Artikel beschreibe ich meinen "digitalen Traum". Er ist ganz einfach zu formulieren:"Ich will alles und zwar sofort, jederzeit, "überall" und kostenlos zur Verfügung haben." Ich schildere, was davon heute schon (fast) realisiert ist und was noch fehlt. Ich skizziere einige zentrale Schwierigkeiten der vollständigen Realisierung und skizziere mögliche Lösungen. T3 - ZIB-Report - 01-29 KW - digitale Informationstechnologie KW - digitale Information KW - BBAW Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6558 ER - TY - GEN A1 - Helmberg, Christoph T1 - A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations N2 - The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to a primal optimal solution. Separating with respect to these approximations gives rise to a cutting plane algorithm that converges to the optimal solution under reasonable assumptions on the separation oracle and the feasible set. We have implemented a practical variant of the cutting plane algorithm for improving semidefinite relaxations of constrained quadratic 0-1 programming problems by odd-cycle inequalities. We also consider separating odd-cycle inequalities with respect to a larger support than given by the cost matrix and present a heuristic for selecting this support. Our preliminary computational results for max-cut instances on toroidal grid graphs and balanced bisection instances indicate that warm start is highly efficient and that enlarging the support may sometimes improve the quality of relaxations considerably. T3 - ZIB-Report - 01-26 KW - bisection KW - equicut KW - max-cut KW - semidefinite programming KW - spectral bundle method KW - subgradient method KW - quadratic 0-1 programming Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6527 ER - TY - GEN A1 - Steinbach, Marc T1 - General Information Constraints in Stochastic Programs N2 - Scenario tree models of stochastic programs arise naturally under standard nonanticipativity assumptions. We demonstrate how tree-sparse programs cover the general case, with \emph{arbitrary} information constraints. Detailed examples and intuitive interpretations illuminate the basic thoughts behind the abstract but elementary construction. T3 - ZIB-Report - 01-24 KW - information constraints KW - general nonanticipativity KW - sigma-fields KW - filtrations KW - scenarios KW - stochastic programs KW - tree-sparse programs Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6502 ER - TY - GEN A1 - Kähler, Ralf A1 - Simon, Mark A1 - Hege, Hans-Christian T1 - Fast Volume Rendering of Sparse High-Resolution Datasets Using Adaptive Mesh Refinement Hierarchies N2 - In this paper we present an algorithm that accelerates 3D texture-based volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and the number of texture bricks -- a prerequisite for fast rendering. Comparing our approach to an octree based algorithm we show that our algorithm increases rendering performance significantly for sparse data. A further advantage is that less parameter tuning is necessary. T3 - ZIB-Report - 01-25 KW - scalar field visualization KW - volume visualization KW - volume rendering KW - 3D texture mapping KW - hierarchical space partitioning KW - AMR tree KW - octree KW - spar Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6516 ER - TY - GEN A1 - Hohage, Thorsten A1 - Schmidt, Frank A1 - Zschiedrich, Lin T1 - Solving time-harmonic scattering problems based on the pole condition: Convergence of the PML method N2 - In this paper we study the PML method for Helmholtz-type scattering problems with radially symmetric potential. The PML method consists in surrounding the computational domain by a \textbf{P}erfectly \textbf{M}atched sponge \textbf{L}ayer. We prove that the approximate solution obtained by the PML method converges exponentially fast to the true solution in the computational domain as the thickness of the sponge layer tends to infinity. This is a generalization of results by Lassas and Somersalo based on boundary integral eqaution techniques. Here we use techniques based on the pole condition instead. This makes it possible to treat problems without an explicitly known fundamental solution. T3 - ZIB-Report - 01-23 KW - transparent boundary conditions KW - PML KW - pole condition Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6494 ER -