# Library

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
• 1
Electronic Resource
Springer
The visual computer 2 (1986), S. 298-306
ISSN: 1432-2315
Keywords: Light reflectance models ; Radiosity ; Computer animation
Source: Springer Online Journal Archives 1860-2000
Topics: Computer Science
Notes: Abstract An efficient algorithm is introduced for the production of realistic image sequences of dynamic environments. The practicality of the radiosity method, which computes the interreflection of light within complex diffuse environments independent of viewpoint, is extended to dynamic environments where the paths of moving objects have been predefined. The algorithm takes advantage of the object coherence between static portions of an environment. A preprocessing stage executes once for a given image sequence and precalculates constant geometrical relationships in the environment. When the environment geometry changes, an update stage determines the global illumination using information provided by the preprocessor and the current positions of all moving objects. Test environments show speedups of at least twenty-five times over previous radiosity methods.
Type of Medium: Electronic Resource
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 2
Book
Title: Finding All Maximal Cliques of a Family of Induced Subgraphs /; ZIB-Report 03-53
Author: Baum, Daniel
Year of publication: 2003
Pages: 16 S.
Series Statement: ZIB-Report ZIB-Report 03-53
ISSN: 1438-0064
Type of Medium: Book
Language: English
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 3
Book
Title: Multiple Semi-flexible 3D Superposition of Drug-sized Molecules /; ZIB-Report 04-52
Author: Baum, Daniel
Year of publication: 2004
Pages: 20 S.
Series Statement: ZIB-Report ZIB-Report 04-52
ISSN: 1438-0064
Type of Medium: Book
Language: English
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 4
Title: ¬A¬ point-based algorithm for multiple 3D surface alignment of drug-sized molecules /
Author: Baum, Daniel
Year of publication: 2007
Pages: VIII, 186 S. : , graph. Darst.
Dissertation note: Berlin, Freie Univ., Diss., 2007
Type of Medium: Book
Language: English
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 5
Publication Date: 2020-03-06
Description: Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is to find large sets of points satisfying some mutual relationship. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each point onto a vertex of the graph and connecting any two vertices by an edge whose corresponding points satisfy our desired relationship. Clique detection has been widely studied and there exist efficient algorithms. In this paper we study a related problem, where all points have a set of binary attributes, each of which is either 0 or 1. This is only a small limitation, since all discrete properties can be mapped onto binary attributes. In our case, we want to find large sets of points not only satisfying some mutual relationship; but, in addition, all points of a set also need to have at least one common attribute with value 1. The problem we described can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute $i$, its associated subgraph contains those vertices corresponding to the points with attribute $i$ set to 1. We introduce the notion of a maximal clique of a family, $\mathcal{G}$, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of $\mathcal{G}$ solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of $\mathcal{G}$. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm.
Keywords: ddc:000
Language: English
Type: reportzib , doc-type:preprint
Format: application/postscript
Format: application/pdf
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 6
Publication Date: 2020-03-06
Description: In this paper we describe a new algorithm for multiple semi-flexible superpositioning of drug-sized molecules. The algorithm identifies structural similarities of two or more molecules. When comparing a set of molecules on the basis of their three-dimensional structures, one is faced with two main problems. (1) Molecular structures are not fixed but flexible, i.e., a molecule adopts different forms. To address this problem, we consider a set of conformers per molecule. As conformers we use representatives of conformational ensembles, generated by the program ZIBMol. (2) The degree of similarity may vary considerably among the molecules. This problem is addressed by searching for similar substructures present in arbitrary subsets of the given set of molecules. The algorithm requires to preselect a reference molecule. All molecules are compared to this reference molecule. For this pairwise comparison we use a two-step approach. Clique detection on the correspondence graph of the molecular structures is used to generate start transformations, which are then iteratively improved to compute large common substructures. The results of the pairwise comparisons are efficiently merged using binary matching trees. All common substructures that were found, whether they are common to all or only a few molecules, are ranked according to different criteria, such as number of molecules containing the substructure, size of substructure, and geometric fit. For evaluating the geometric fit, we extend a known scoring function by introducing weights which allow to favor potential pharmacophore points. Despite considering the full atomic information for identifying multiple structural similarities, our algorithm is quite fast. Thus it is well suited as an interactive tool for the exploration of structural similarities of drug-sized molecules.
Keywords: ddc:000
Language: English
Type: reportzib , doc-type:preprint
Format: application/postscript
Format: application/pdf
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 7
Unknown
Publication Date: 2022-03-11
Language: English
Type: article , doc-type:article
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 8
Unknown
Publication Date: 2022-03-11
Description: For mating, leafhoppers (Cicadellidae) use substrate-borne vibrational signals to communicate. We provide the first complete description of the abdominal chordotonal organs that enable the perception of these signals. This supplementary data provides the aligned stack of 450 semithin serial sections of the first and second abdominal segment of an adult male Rhododendron leafhopper (Graphocephala fennahi). Further, this supplementary data comprises the segmentation files of five chordotonal organs, the exoskeleton, the segmental nerves and the spiracles of the first and the second abdominal segment. Due to time limitations, the structures of only one half of the body were segmented. The specimen was caught by hand net in September 2018 in Berlin-Tiergarten, Germany. Samples were embedded in Araldite® 502 resin and cut transversally in 1 μm thick sections using a Leica ultramicrotome and a DIATOME Histo Jumbo 6.0 mm diamond knife. Sections were placed on microscopic slides and stained with methylene blue/azur II. The images were taken by means of a 3DHISTECH PANNORAMIC SCAN II slide scanner in the Institute of Pathology Charité in Berlin-Mitte, Germany. Images with a voxel size of 0.273809 μm x 0.273809 μm x 1 μm where obtained. The images were converted from MRXS-files to TIFF-files with the 3DHistech software Slide Converter 2.3. Using Photoshop, the images were cropped to the same canvas size and artefacts were removed. All further steps, such as alignment and segmentation, were done with the software Amira. In order to facilitate the further processing of the dataset, the voxels where resampled to a size of 0.547619 μm x 0.547619 μm x 1 μm.
Language: English
Type: researchdata , doc-type:ResearchData
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 9
Unknown
Publication Date: 2020-03-11
Description: Die nachhaltige Sicherung und Bereitstellung von Forschungsdaten dienen nicht nur der Reproduzierbarkeit früherer Ergebnisse, sondern in hohem Maße auch der Erzielung künftiger Ergebnisse mit dem Ziel, die Qualität, Produktivität und Wettbewerbsfähigkeit der Wissenschaft zu fördern. Die folgenden Grundsätze gelten als Leitlinien zur Handhabung von Forschungsdaten im ZIB.
Language: German
Type: other , doc-type:Other
Format: application/pdf
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 10
Unknown
Publication Date: 2022-04-19