Library

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2000-2004  (57)
  • 1990-1994  (1,818)
  • 1920-1924
  • 2004  (57)
  • 1990  (1,818)
  • Life and Medical Sciences  (1,788)
  • ddc:000
Material
Years
  • 2000-2004  (57)
  • 1990-1994  (1,818)
  • 1920-1924
Year
Language
  • 1
    Publication Date: 2020-03-23
    Description: Die harmonische Integration der Navigation und Suche in lizenzierten Journalen und gleichzeitig in freien digitalen Dokumenten unter einer einheitlichen konsistenten Nutzeroberflache ist eines der ungelösten F&E-Probleme der Fachinformation. Hierfür sollen Elemente des Invisible Web und des Visible Web unter Berücksichtigung offener Standards nahtlos #I miteinander verbunden werden. Dem Projekt liegt ein Modell mit Internet-Index, Metasuche und Open Linking über verteilten heterogenen Speichern #I zu Grunde: Verschiedenste Server, digitale Referenzen in Artikeln und Dokumenten, Links in Datenbanken und auf Bestelldienste sollen unter Berücksichtigung von Standort-, Studien- und Lernbedingungen kooperativ miteinander vernetzt werden. Die Leistungsfähigkeit des Modells soll in Pilotimplementierungen getestet und für eine breite Anwendung vorbereitet werden. Auf dieser Basis soll das Vorhaben Verteilter Zeitschriftenserver der AG der Verbundsysteme in eigenen Teilprojekten kooperativ initiiert werden, das jetzt in das Vorhaben Verteilter Dokumentenserver von vascoda integriert ist.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2014-02-26
    Description: The mathematical modeling of a special modular catalytic reactor kit leads to a system of partial differential equation in two space dimensions. As customary, this model contains unconfident physical parameters, which may be adapted to fit experimental data. To solve this nonlinear least squares problem we apply a damped Gauss-Newton method. A method of lines approach is used to evaluate the associated model equations. By an a priori spatial discretization a large DAE system is derived and integrated with an adaptive, linearly-implicit extrapolation method. For sensitivity evaluation we apply an internal numerical differentiation technique, which reuses linear algebra information from the model integration. In order not to interfere the control of the Gauss-Newton iteration these computations are done usually very accurately and, therefore, very costly. To overcome this difficulty, we discuss several accuracy adaptation strategies, e.g., a master-slave mode. Finally, we present some numerical experiments.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    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
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2014-02-26
    Description: We present an integer linear programming model for the design of multi-layer telecommunication networks. The formulation integrates hardware, capacity, routing, and grooming decisions in \emph{any} n umber of network layers. Practical hardware restrictions and cost can accurately be taken into account for technologies based on connection-oriented routing protocols.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2014-02-26
    Description: We introduce FreeLence, a lossless single-rate connectivity compression algorithm for triangle surface meshes. Based upon a geometry-driven traversal scheme we present two novel and simple concepts: free-valence connectivity encoding and entropy coding based on geometric context. Together these techniques yield significantly smaller rates for connectivity compression than current state of the art approaches - valence-based algorithms and Angle- Analyzer, with an average of $36\%$ improvement over the former and an average of $18\%$ over the latter on benchmark 3D models, combined with the ability to well adapt to the regularity of meshes. We also prove that our algorithm exhibits a smaller worst case entropy for a class of "'well-behaved"' triangle meshes than valence-driven connectivity encoding approaches.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    facet.materialart.
    Unknown
    Publication Date: 2019-10-24
    Keywords: ddc:000
    Language: German
    Type: annualzib , doc-type:report
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2020-02-11
    Description: In this article, we present a mathematical model and an algorithm to support one of the central strategic planning decisions of network operators: How to organize a large number of locations into a hierarchical network? We propose a solution approach that is based on mixed-integer programming and Lagrangian relaxation techniques. As major advantage, our approach provides not only solutions but also worst-case quality guarantees. Real-world scenarios with more than 750 locations have been solved within 30 minutes to less than 1\% off optimality.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2020-02-11
    Description: This paper is concerned with UMTS radio network design. Our task is to reconfigure antennas and the related cells as to improve network quality. In contrast to second generation GSM networks, \emph{interference} plays a paramount role when designing third generation radio networks. A known compact formulation for assessing the interference characteristics of a radio network as coupling relations between cells based on user snapshots is generalized to statistical average load. This enables us to overcome the notorious difficulties of snapshot-based network optimization approaches. We recall a mixed-integer programming model for the network design problem that is based on user snapshots and contrast it with a new network design model based on the average coupling formulation. Exemplarily focusing on the important problem of optimizing antenna tilts, we give computational results for a fast local search algorithm and the application of a MIP solver to both models. These results demonstrate that our new average-based approaches outperform state-of-the-art snapshot models for UMTS radio network optimization.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2021-08-05
    Description: Constraint Programs and Mixed Integer Programs are closely related optimization problems originating from different scientific areas. Today's state-of-the-art algorithms of both fields have several strategies in common, in particular the branch-and-bound process to recursively divide the problem into smaller sub problems. On the other hand, the main techniques to process each sub problem are different, and it was observed that they have complementary strenghts. We propose a programming framework {\sffamily SCIP} that integrates techniques from both fields in order to exploit the strenghts of both, Constraint Programming and Mixed Integer Programming. In contrast to other proposals of recent years to combine both fields, {\sffamily SCIP} does not focus on easy implementation and rapid prototyping, but is tailored towards expert users in need of full, in-depth control and high performance.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2018-12-06
    Description: In this paper we describe the semantic analysis of differential equations given in the ubiquitous semi-structured formats MathML and OpenMath. The analysis is integrated in a deployed Web indexing framework. Starting from basic classifications for differential equations the proposed system architecture is amenable to extensions for further reconstruction of mathematical content on the Web. The syntactic analysis of mathematical formulae given in the considered formats must overcome ambiguities that stem from the fact that formula particles may have different encodings, which are in principle completely arbitrary. However, it turns out that the syntactic analysis can be done straightforward given some natural heuristic assumptions.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 11
    Publication Date: 2014-02-26
    Description: A new method for noise removal of arbitrary surfaces meshes is presented which focuses on the preservation and sharpening of non-linear geometric features such as curved surface regions and feature lines. Our method uses a prescribed mean curvature flow (PMC) for simplicial surfaces which is based on three new contributions: 1. the definition and efficient calculation of a discrete shape operator and principal curvature properties on simplicial surfaces that is fully consistent with the well-known discrete mean curvature formula, 2. an anisotropic discrete mean curvature vector that combines the advantages of the mean curvature normal with the special anisotropic behaviour along feature lines of a surface, and 3. an anisotropic prescribed mean curvature flow which converges to surfaces with an estimated mean curvature distribution and with preserved non-linear features. Additionally, the PMC flow prevents boundary shrinkage at constrained and free boundary segments.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    Publication Date: 2019-01-29
    Description: A primal-dual interior point method for optimal control problems with PDE constraints is considered. The algorithm is directly applied to the infinite dimensional problem. Existence and convergence of the central path are analyzed. Numerical results from an inexact continuation method applied to a model problem are shown.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    Publication Date: 2014-02-26
    Description: Die in der Arbeitsgemeinschaft der Verbundsysteme zusammengeschlossenen deutschen Verbundsysteme kooperieren zur Realisierung eines die Länder und Verbundregionen übergreifenden offenen Netzwerkes einer offenen digitalen Bibliothek, dem Verteilten Dokumentenserver (VDS). Wesentliche Bestandteile des VDS sind die in den lokalen Bibliotheken und Verbundsystemen verteilten Dokumentenspeicher. Beim Aufbau des VDS verfolgen die deutschen Verbundsysteme für ihre digitalen Ressourcen, Zeitschriften und Dokumente, folgende Ziele [AGV03]: \begin{itemize} \item{Erhalt und dauerhafte Sicherung einmal erworbener Rechte} \item{Bessere Erschließung und Integration in das eigene Angebot} \item{Nahtlose Navigation in lokalen Zeitschriften- und Dokumentenservern und zwischen digitalen Artikeln und Zeitschriften, Dokumenten und Servern} \item{Dauerhafte Sicherung des Zugriffs und perspektivisch Langzeitverfügbarkeit} \end{itemize} Die Verbundsysteme streben an, die Speicherung, Erschließung und das Angebot ihrer digitalen Materialien in einer nationalen Kooperation durchzuführen. Sie entwickeln und betreiben zu diesem Zweck Portal- und Querschnittstechnologien zur Integration ihrer dezentral gespeicherten digitalen Ressourcen mittels Internet-Technologien.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    Publication Date: 2014-02-26
    Description: In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concept of utility functions, where each source uses a utility function to evaluate the benefit from achieving a transmission rate, we interpret the resource allocation problem as a global optimization problem. The solution to this problem is characterized by a new fairness criterion, \e{utility proportional fairness}. We argue that it is an application level performance measure, i.e. the utility that should be shared fairly among users. As a result of our analysis, we obtain congestion control laws at links and sources that are globally stable and provide a utility proportional fair resource allocation in equilibrium. We show that a utility proportional fair resource allocation also ensures utility max-min fairness for all users sharing a single path in the network. As a special case of our framework, we incorporate utility max-min fairness for the entire network. To implement our approach, neither per-flow state at the routers nor explicit feedback beside ECN (Explicit Congestion Notification) from the routers to the end-systems is required.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    Publication Date: 2014-02-26
    Description: Wie findet man den optimalen Weg im U-Bahnnetz? Das Problem wird als Graph modelliert und dann eine Breitensuche durchgeführt. Will man Weglängen oder Fahrzeiten mitberücksichtigen, so braucht man den Algorithmus von Dijkstra für gewichtige Graphen. Beim Nachdenken über diese Algorithmen werden auch Fragestellungen der Graphentheorie berührt. In einem zweiten Abschnitt werden methodische Hinweise für den Unterricht in der Sekundarstufe I und II gegeben, insbesondere, wie man Lernende dazu bringen kann, ihre Ideen für Algorithmen präzise zu analysieren und zu Papier zu bringen.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    Publication Date: 2014-02-26
    Description: The problem of clustering data can be formulated as a graph partitioning problem. Spectral methods for obtaining optimal solutions have reveceived a lot of attention recently. We describe Perron Cluster Cluster Analysis (PCCA) and, for the first time, establish a connection to spectral graph partitioning. We show that in our approach a clustering can be efficiently computed using a simple linear map of the eigenvector data. To deal with the prevalent problem of noisy and possibly overlapping data we introduce the min Chi indicator which helps in selecting the number of clusters and confirming the existence of a partition of the data. This gives a non-probabilistic alternative to statistical mixture-models. We close with showing favorable results on the analysis of gene expressi on data for two different cancer types.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Publication Date: 2014-02-26
    Description: In this paper, we study the conflict-free assignment of wavelengths to lightpaths in an optical network with the opportunity to place wavelength converters. To benchmark heuristics for the problem, we develop integer programming formulations and study their properties. Moreover, we study the computational performance of the column generation algorithm for solving the linear relaxation of the most promising formulation. In many cases, a non-zero lower bound on the number of required converters is generated this way. For several instances, we in fact prove optimality since the lower bound equals the best known solution value.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    Publication Date: 2021-02-01
    Description: Operative planning in gas distribution networks leads to large-scale mixed-integer optimization problems involving a hyperbolic PDE defined on a graph. We consider the NLP obtained under prescribed combinatorial decisions---or as relaxation in a branch and bound framework, addressing in particular the KKT systems arising in primal-dual interior methods. We propose a custom solution algorithm using sparse local projections, based on the KKT systems' structual properties induced by the discretized gas flow equations in combination with the underlying network topology. The numerical efficiency and accuracy of the algorithm are investigated, and detailed computational comparisons with a control space method and with the multifrontal solver MA27 are provided.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    Publication Date: 2021-02-01
    Description: The topic of this paper is minimum cost operative planning of pressurized water supply networks over a finite horizon and under reliable demand forecast. Since this is a very hard problem, it is desirable to employ sophisticated mathematical algorithms, which in turn calls for carefully designed models with suitable properties. The paper develops a nonlinear mixed integer model and a nonlinear programming model with favorable properties for gradient-based optimization methods, based on smooth component models for the network elements. In combination with further nonlinear programming techniques (to be reported elsewhere), practically satisfactory near-optimum solutions even for large networks can be generated in acceptable time using standard optimization software on a PC workstation. Such an optimization system is in operation at Berliner Wasserbetriebe.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    Publication Date: 2014-02-26
    Description: Im Rahmen von Problemstellungen der kombinatorischen Optimierung können Schülerinnen und Schüler lernen, Algorithmen selber zu entwickeln. Gleichzeitig lernen sie dabei moderne Mathematik in ihren Anwendungen kennen und erleben die Mathematik als lebendige Wissenschaft.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 21
    Publication Date: 2020-12-15
    Description: Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral results for the corresponding polytope and report on computational results.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 22
    Publication Date: 2014-02-26
    Description: In this paper, we study the minimum converter wavelength assignment problem in optical networks. To benchmark the quality of solutions obtained by heuristics, we derive an integer programming formula tion by generalizing the formulation of Mehrotra and Trick (1996) for the vertex coloring problem. To handle the exponential number of variables, we propose a column generation approach. Computational experiments show that the value of the linear relaxation states a good lower bound and can often prove optimality of the best solution generated heuristically.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 23
    Publication Date: 2014-11-10
    Description: The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in (Bodlaender, Koster, Wolle, 2004). In experiments it was shown that this lower bound improves upon other treewidth lower bounds. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, block s of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy and another lower bound for treewidth. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 24
    Publication Date: 2014-11-10
    Description: The Maximum Cardinality Search algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbors becomes visited. An MCS-ordering of a graph is an ordering of the vertices that can be generated by the Maximum Cardinality Search algorithm. The visited degree of a vertex $v$ in an MCS-ordering is the number of neighbors of $v$ that are before $v$ in the ordering. The visited degree of an MCS-ordering $\psi$ of $G$ is the maximum visited degree over all vertices $v$ in $\psi$. The maximum visited degree over all MCS-orderings of graph $G$ is called its {\em maximum visited degree}. Lucena (2003) showed that the treewidth of a graph $G$ is at least its maximum visited degree. We show that the maximum visited degree is of size $O(\log n)$ for planar graphs, and give examples of planar graphs $G$ with maximum visited degree $k$ with $O(k!)$ vertices, for all $k\in \Bbb{N}$. Given a graph $G$, it is NP-complete to determine if its maximum visited degree is at least $k$, for any fixed $k\geq 7$. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete. We also propose and experimentally analyses some heuristics for the problem. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 25
    Publication Date: 2014-02-26
    Description: A new and time efficient model to evaluate the free energy of solvation has been developed. The solvation free energy is separated into an electrostatic term, a hydrogen bond term, and a rest-term, combining both entropic and van der Waals effects. The electrostatic contribution is evaluated with a simplified boundary element method using the partial charges of the MMFF94 force field. The number of hydrogen bonds and the solvent excluded surface area over the surface atoms are used in a linear model to estimate the non-electrostatic contribution. This model is applied to a set of 213 small and mostly organic molecules, yielding an rmsd of 0.87kcal/mol and a correlation with experimental data of r=0.951. The model is applied as a supplementary component of the free energy of binding to estimate binding constants of protein ligand complexes. The intermolecular interaction energy is evaluated by using the MMFF94 force field.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 26
    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
    BibTip Others were also interested in ...
  • 27
    Publication Date: 2014-02-26
    Description: Molecular dynamics simulations of possible ligands for proteins yield large amounts of data in the form of trajectories which are further processed in order to find metastable conformations. These conformations can then be used for docking between ligand and protein. Around this core computation procedure lots of other data have to be managed. It should also be possible for external users not involved in program development to perform computations. As a paradigm for other fields where a similar constitution of program usage and data processing is found we present a software architecture for data generation, access and management. Requirements for this system include: Ease of use, graphical user interface, persistent storage of data concerning molecules, users, programs, program parameters, metadata, and results. A mere storage in the file system would render a quick overview of data more or less impossible. On the other hand, storing large amounts of binary data in a database doesn't yield any advantage concerning speed of access. Therefore, a hybrid approach combining file system and database is appropriate. The system should be easily extensible by inserting new applications which can be controlled and whose results can be collected and stored. The software system described here consists of different components, the presentation layer (graphical user interface), the business logic, the persistence layer (relational database plus file system), and an interface to the compute cluster (batch system for parallel processing). We will discuss the alternatives and take a closer look at the components.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 28
    Publication Date: 2020-03-09
    Description: We propose an approach for transforming the sampling of a molecular conformation distribution into an analytical model based on Hidden Markov Models. The model describes the sampled shape density as a mixture of multivariate unimodal densities. Thus, it delivers an interpretation of the sampled density as a set of typical shapes that appear with different probabilities and are characterized by their geometry, their variability and transition probabilities between the shapes. The gained model is used to identify atom groups of constant shape that are connected by metastable torsion angles. Based on this description an alignment for the original sampling is computed. As it takes into account the different shapes contained in the sampled set, this alignment allows to compute reasonable average shapes and meaningful shape density plots. Furthermore, it enables us to visualize typical conformations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 29
    Publication Date: 2020-02-11
    Description: We present publicly available data sets related to research on wireless networks. The scenarios contain a wide range of data and are detailed in all aspects. To our knowledge, this is the most realistic, comprehensive, and detailed \emph{public} data collection on mobile networking. We indicate example uses of this data collection in applications related tu UMTS.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 30
    Publication Date: 2020-12-15
    Description: The \emph{line planning problem} is one of the fundamental problems in strategic planning of public and rail transport. It consists of finding lines and corresponding frequencies in a public transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize its operating cost; the passengers request short travel times. We propose two new multi-commodity flow models for line planning. Their main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 31
    Publication Date: 2014-02-26
    Description: The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres with dihedral or cyclic symmetry on few vertices, and we present an infinite series of vertex-transitive nearly neighborly centrally symmetric 3-spheres.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 32
    Publication Date: 2019-05-10
    Description: We focus on the role of anisotropic elasticity in the simulation of the load distribution in a human mandible due to a lateral bite on the leftmost premolar. Based on experimental evidence, we adopt ``local''" orthotropy of the elastic properties of the bone tissue. Since the trajectories of anisotropic elasticity are not accessible from Computer Tomographic (CT) data, they will be reconstructed from (i) the organ's geometry and (ii) from coherent structures which can be recognized from the spatial distribution of the CT values. A sensitivity analysis comprising various 3D FE simulations reveals the relevance of elastic anisotropy for the load carrying behavior of a human mandible: Comparison of the load distributions in isotropic and anisotropic simulations indicates that anisotropy seems to ``spare''" the mandible from loading. Moreover, a maximum degree of anisotropy leads to kind of an load minimization of the mandible, expressed by a minimum of different norms of local strain, evaluated throughout the organ. Thus, we may suggest that anisotropy is not only relevant, but also in some sense ``optimal''.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 33
    Publication Date: 2019-05-10
    Description: The paper extends affine conjugate Newton methods from convex to nonconvex minimization, with particular emphasis on PDE problems originating from compressible hyperelasticity. Based on well-known schemes from finite dimensional nonlinear optimization, three different algorithmic variants are worked out in a function space setting, which permits an adaptive multilevel finite element implementation. These algorithms are tested on two well-known 3D test problems and a real-life example from surgical operation planning.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 34
    Publication Date: 2014-02-26
    Description: We present formulae for the corner points of the multidimensional Hausdorff and Dale Polytopes and show how these results can be used to improve linear programming models for computing e.\,g.\ moments of exit distribution of diffusion processes. Specifically, we compute the mean exit time of twodimensional Brownian motion from the unit square and the unit triangle, as well as higher moments of the exit time of time space Brownian motion from a triangle.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 35
    Publication Date: 2014-11-10
    Description: Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admits a clique cover $\cal Q$ and a stable set cover $\cal S$ s.t.~every clique in $\cal Q$ intersects every stable set in $\cal S$. Normal graphs can be considered as closure of perfect graphs by means of co-normal products (Körner 1973) and graph entropy (Czisz\'ar et al. 1990). Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs (Strong Perfect Graph Theorem, Chudnovsky et al. 2002). Körner and de Simone observed that $C_5$, $C_7$, and $\overline C_7$ are minimal not normal and conjectured, as generalization of the Strong Perfect Graph Theorem, that every $C_5$, $C_7$, $\overline C_7$- free graph is normal (Normal Graph Conjecture, Körner and de Simone 1999). We prove this conjecture for a first class of graphs that generalize both odd holes and odd antiholes, the circulants, by characterizing all the normal circulants.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 36
    Publication Date: 2014-02-26
    Description: It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with a various interesting combinatorial and topological properties. In particular, infinitely many non-PL spheres as well as contactible simplicial complexes with a vertex-transitive group of automorphisms cab be contained in this way.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 37
    Publication Date: 2020-03-10
    Description: This paper presents an automatic approach for segmentation of the liver from computer tomography (CT) images based on a 3D statistical shape model. Segmentation of the liver is an important prerequisite in liver surgery planning. One of the major challenges in building a 3D shape model from a training set of segmented instances of an object is the determination of the correspondence between different surfaces. We propose to use a geometric approach that is based on minimizing the distortion of the correspondence mapping between two different surfaces. For the adaption of the shape model to the image data a profile model based on the grey value appearance of the liver and its surrounding tissues in contrast enhanced CT data was developed. The robustness of this method results from a previous nonlinear diffusion filtering of the image data. Special focus is turned to the quantitative evaluation of the segmentation process. Several different error measures are discussed and implemented in a study involving more than 30 livers.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 38
    Publication Date: 2021-08-05
    Description: Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called {\sl reliability branching} of today's state-of-the-art {\sl strong branching} and {\sl pseudocost branching} strategies for linear programming based branch-and-bound algorithms. After reviewing commonly used branching strategies and performing extensive computational studies we compare different parameter settings and show the superiority of our proposed newstrategy.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 39
    Publication Date: 2020-03-09
    Description: This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on the proximal bundle method for the solution of concave decomposable functions, which is adapted for the approximate evaluation of the vehicle and duty scheduling components. The primal and dual information generated by the bundle method is used to guide a branch-and-bound type algorithm. Computational results for large-scale real-world integrated vehicle and duty scheduling problems with up to 1,500 timetabled trips are reported. Compared with the results of a classical sequential approach and with reference solutions, integrated scheduling offers remarkable potentials in savings and drivers' satisfaction.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 40
    Publication Date: 2019-05-10
    Description: Structural mechanics simulation of bony organs is of general medical and biomechanical interest, because of the interdependence of the inner architecture of bone and its functional loading already stated by Wolff in 1892. This work is part of a detailed research project concerning the human mandible. By adaptive finite element techniques, stress/strain profiles occurring in the bony structure under biting were simulated. Estimates of the discretization errors, local grid refinement, and multilevel techniques guarantee the reliability and efficiency of the method. In general, our simulation requires a representation of the organ's geometry, an appropriate material description, and the load case due to teeth, muscle, or joint forces. In this paper, we want to focus on the influence of the masticatory system. Our goal is to capture the physiological situation as far as possible. By means of visualization techniques developed by the group, we are able to extract individual muscle fibres from computed tomography data. By a special algorithm, the fibres are expanded to fanlike (esp. for the musc. temporalis) coherent vector fields similar to the anatomical reality. The activity of the fibres can be adapted according to compartmentalisation of the muscles as measured by electromyological experiments. A refined sensitivity analysis proved remarkable impact of the presented approach on the simulation results.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 41
    Publication Date: 2021-02-01
    Description: Operative planning in gas networks with prescribed binary decisions yields large scale nonlinear programs defined on graphs. We study the structure of the KKT systems arising in interior methods and present a customized direct solution algorithm. Computational results indicate that the algorithm is suitable for optimization in small and medium-sized gas networks.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 42
    Publication Date: 2021-02-05
    Description: Der Kooperative Bibliotheksverbund Berlin-Brandenburg (KOBV) verzichtet auf eine einheitliche zentrale Verbunddatenbank zugunsten einer dezentralen, verteilten Struktur. In dieser Architektur erhält die Art der Indexierung der angesprochenen Online-Kataloge eine besondere Bedeutung. So werden sowohl Bibliotheksmitarbeiter als auch Bibliotheksbenutzer immer wieder mit der Recherche in fremden Katalogen konfrontiert, in denen unterschiedliche Indexierungsverfahren realisiert sein können. Ein abgestimmtes Indexierungskonzept verfolgt zwei grundsätzliche Ziele. Einerseits soll durch eine vereinheitlichte Indexierung die Qualität und Zuverlässigkeit der Rechercheergebnisse in der parallelen Suche in mehreren Katalogen über die KOBV-Suchmaschine erhöht werden. Gleichzeitig soll durch eine vereinheitlichte Indexierung die Akzeptanz von Suchen in entfernten Katalogen prinzipiell gesteigert und damit die Bedingungen für die gegenseitige Übernahme von Titeldaten erleichtert werden. Für die Indexierung muss zunächst die Art und der Umfang der im OPAC aufzubauenden Indices festgelegt werden. Aus Sicht des Nutzers entspricht diese Definition den möglichen Sucheinstiegen. Hat man dann entschieden, welche Indexterme aus welchen Feldern in die jeweiligen Indices einfließen sollen, muss bestimmt werden, nach welchen Regeln die Terme behandelt werden. Hier stellt sich insbesondere das Problem der Sonderzeichen wie Bindestriche, Apostrophe und Punkte oder Ziffern in Zeichenketten. Das vorliegende Konzept entstand in Zusammenarbeit der großen Universitätsbibliotheken in Berlin (der Freien Universität, der Humboldt-Universität, der Technischen Universität, der Universität der Künste) mit der KOBV-Verbundzentrale am ZIB.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 43
    Publication Date: 2014-02-26
    Description: We investigate a special class of quadratic Hamiltonians on $so(4)$ and $so(3,1)$ and describe Hamiltonians that have additional polynomial integrals. One of the main results is a new integrable case with an integral of sixth degree.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 44
    Publication Date: 2020-11-16
    Description: We present a graph theoretical model for scheduling trains on a single unidirectional track between two stations. The set of departures of all possible train types at all possible (discrete) points of time is turned into an undirected graph $\Gneu$ by joining two nodes if the corresponding departures are in conflict. This graph $\Gneu$ has no odd antiholes and no $k$-holes for any integer $k\geq 5$. In particular, any finite, node induced subgraph of $\Gneu$ is perfect. For any integer $r\geq 2$ we construct minimal headways for $r$ train types so that the resulting graph $\Gneu$ has $2r$-antiholes and $4$-holes at the same time. Hence, $\Gneu$ is neither a chordal graph nor the complement of a chordal graph, in general. At the end we analyse the maximal cliques in $G$.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 45
    Publication Date: 2021-02-01
    Description: Unnecessarily conservative behavior of standard process control techniques can be avoided by stochastic programming models when the distribution of random disturbances is known. In an earlier study we have investigated such an approach for tank level constraints of a distillation process. Here we address techniques that have accelerated the numerical solution of the large and expensive stochastic programs by a factor of six, and then present a refined optimization model for the same application.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 46
    Publication Date: 2014-02-26
    Description: We investigate the impact of hop-limited routing paths on the total cost of a telecommunication network. For different survivability settings (dedicated protection, link and path restoration), the optimal network cost without restrictions on the admissible path set is compared to the results obtained with two strategies to impose hop limits on routing paths. In a thorough computational study on optimal solutions for nine real-world based problem instances, we show that hop limits should be avoided if the technology allows it and network cost is a major planning issue. In this case, column generation should be employed to deal with all routing paths. If hop-limits are required, these should be defined for each demand individually and as large as possible.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 47
    Publication Date: 2020-11-13
    Description: Under high load, the automated dispatching of service vehicles for the German Automobile Association (ADAC) must reoptimize a dispatch for 100--150 vehicles and 400 requests in about ten seconds to near optimality. In the presence of service contractors, this can be achieved by the column generation algorithm ZIBDIP. In metropolitan areas, however, service contractors cannot be dispatched automatically because they may decline. The problem: a model without contractors yields larger optimality gaps within ten seconds. One way-out are simplified reoptimization models. These compute a short-term dispatch containing only some of the requests: unknown future requests will influence future service anyway. The simpler the models the better the gaps, but also the larger the model error. What is more significant: reoptimization gap or reoptimization model error? We answer this question in simulations on real-world ADAC data: only the new model ZIBDIP{\footnotesize dummy} can keep up with ZIBDIP.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 48
    Publication Date: 2020-11-13
    Description: Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction degeneracy: the maximum over all minors of the minimum degree. We show that the contraction degeneracy problem is NP-complete, even for bipartite graphs, but for fixed $k$, it is polynomial time decidable if a given graph $G$ has contraction degeneracy at least $k$. Heuristics for computing the contraction degeneracy are proposed and evaluated. It is shown that these can lead in practice to considerable improvements of the lower bound for treewidth, but can perform arbitrarily bad on some examples. A study is also made for the combination of contraction with Lucena's lower bound based on Maximum Cardinality Search (Lucena, 2003). Finally, heuristics for the treewidth are proposed and! evaluated that combine contraction with a treewidth lower bound technique by Clautiaux et al (2003).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 49
    Publication Date: 2020-11-13
    Description: \documentclass[12pt]{article} \usepackage{german} \parindent=0pt \begin{document} Der Kooperative Bibliotheksverbund Berlin-Brandenburg (KOBV) hat in den Jahren 2001 bis 2003 im Rahmen des Entwicklungsprojektes ''KOBV-Informationsportal`` ein regionales Portal aufgebaut, in dem integrierte Informationsdienste fr die regionalen Bibliotheken zur Verfügung gestellt werden. Das ''KOBV-Portal - Digitale Bibliothek Berlin-Brandenburg`` wurde im Dezember 2003 in Betrieb genommen. Das KOBV-Portal bietet in seiner ersten Ausbaustufe den Nachweis über die in den großen Bibliotheken lizenzierten Ressourcen und elektronischen Zeitschriften, zudem die nahtlose Navigation mittels des Reference-Linking-Werkzeuges SFX zu verschiedenen Diensten wie Fernleihe, Subito und freien Volltexten im Internet sowie zu frei zugänglichen elektronischen Zeitschriften. Realisiert wurden ferner die Remote-Authentifizierung, mit der sich ein Nutzer, der online eine Fernleih-Bestellung aufgeben möchte, über das Internet in seiner Heimatbibliothek authentifizieren kann. Des weiteren ist der Zugriff auf lizenzierte Bestände im Campus einer Hochschule mittels IP-Checking möglich. Als weiteren wesentlichen Bestandteil des KOBV-Portals hat die KOBV-Zentrale mit den Bibliotheken einen Workflow für ein Metadata-Sharing abgestimmt und für die Adaption und Normalisierung lokaler Metadaten aus lokalen Bibliothekssystemen und -Portalen den KOBV-Metadaten-Austausch-Parser (KMA-Parser) entwickelt. Damit Bibliotheken, deren Metadaten bislang lediglich in unstrukturierter Form vorliegen, strukturierte Metadaten anlegen, liefern und nachnutzen können, hat die KOBV-Zentrale das mit einer Web-Katalogisierungsschnittstelle ausgestattete ''Metadata-Tool`` entwickelt. Die für das Metadata-Sharing entwickelten Komponenten und Module sollen den Bibliotheken die Mehrfacherfassung ersparen und ihnen die Möglichkeit der wechselseitigen Nachnutzung der Metadaten eröffnen. Der vorliegende Projekt-Abschlussbericht gibt einen Überblick über die während der Projektlaufzeit realisierten Dienste des KOBV-Portals. \end{document}
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 50
    Publication Date: 2014-02-26
    Description: Kürzeste Wege tauchen fast überall im Alltag auf. Daher eignet sich dieses Optimierungsproblem gut für den Unterricht. Modellierung und heuristische Vorgehensweisen werden geübt, um schließlich die klassischen kürzesten Wege-Algorithmen selbst zu erfinden. In diesem Artikel werden die Inhalte vorgestellt und konkrete Hinweise zum Unterricht in der Schule gegeben.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 51
    Publication Date: 2019-01-29
    Description: A primal interior point method for control constrained optimal control problems with PDE constraints is considered. Pointwise elimination of the control leads to a homotopy in the remaining state and dual variables, which is addressed by a short step pathfollowing method. The algorithm is applied to the continuous, infinite dimensional problem, where discretization is performed only in the innermost loop when solving linear equations. The a priori elimination of the least regular control permits to obtain the required accuracy with comparable coarse meshes. Convergence of the method and discretization errors are studied, and the method is illustrated at two numerical examples.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 52
    Publication Date: 2020-02-11
    Description: In this article, strategical infrastructure planning problems in the design of large-scale telecommunication networks are discussed based on experiences from three projects with industrial partners: The access network planning of the German Gigabit-Wissenschaftsnetz (G-WiN) for DFN (Verein zur Förderung eines Deutschen Forschungsnetzes e.V.), the mobile network switching center location planning project for E-Plus Mobilfunk, and the fixed network switching center location planning project for TELEKOM AUSTRIA. We introduce a mathematical model for a hierarchical multi-commodity capacitated facility location problem, present adaptions of this basic model to the specific requirements within the different projects and discuss the individual peculiarities and model decisions made. Eventually, we present and discuss computational results of three associated case studies, illustrating '"how we did the job`` with mathematical methods.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 53
    Publication Date: 2014-11-10
    Description: Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they all are the vertex-degree of some vertex in a subgra ph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 54
    Publication Date: 2019-01-29
    Description: The paper addresses primal interior point method for state constrained PDE optimal control problems. By a Lavrentiev regularization, the state constraint is transformed to a mixed control-state constraint with bounded Lagrange multiplier. Existence and convergence of the central path are established, and linear convergence of a short-step pathfollowing method is shown. The behaviour of the regularizations are demonstrated by numerical examples.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 55
    Publication Date: 2014-02-26
    Description: In [7,8,12] homogenization techniques are applied to derive an anisotropic variant of the bio-heat transfer equation as asymptotic result of boundary value problems providing a microscopic description for microvascular tissue. In view of a future application on treatment planning in hyperthermia, we investigate here the homogenization limit for a coupling model, which takes additionally into account the influence of convective heat transfer in medium size blood vessels. This leads to second order elliptic boundary value problems with nonlocal boundary conditions on parts of the boundary. Moreover, we present asymptotic estimates for first order correctors.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 56
    Publication Date: 2014-02-26
    Description: Our main result is that every $n$-dimensional polytope can be described by at most $2n-1$ polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an $n$-dimensional pointed polyhedral cone we prove the bound $2n-2$ and for arbitrary polyhedra we get a constructible representation by $2n$ polynomial inequalities.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 57
    Publication Date: 2023-10-05
    Description: Das KOBV-Metadaten-Schema ist von der KOBV-Zentrale entwickelt worden, um Ressourcen im Sinn von Informationskollektionen wie Datenbanken oder Fachportale zu beschreiben. Es ist ein wichtiger Bestandteil des KOBV-Portals, das die in der Region verf"ugbaren Ressourcen nachweist. Das KOBV-Metadaten-Schema dient den Bibliotheken zur Handreichung, um dem KOBV-Portal die Ressourcen mit den standardisierten und individuellen Angaben zu melden, so dass die Ressourcebeschreibungen einem austauschbaren Format entsprechen. Auf diese Weise k"onnen Ressourcebeschreibungen von anderen Bibliotheken mitgenutzt werden und ein Metadata-Sharing in der Region Berlin-Brandenburg praktiziert werden, um in diesem Bereich doppelte Arbeiten zu sparen.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 58
    Publication Date: 2014-02-26
    Description: A family of secant methods based on general rank-1 updates has been revisited in view of the construction of iterative solvers for large non- Hermitian linear systems. As it turns out, both Broydens "good" and "bad" update techniques play a special role - but should be associated with two different line search principles. For Broydens "bad" update technique, a minimum residual principle is natural - thus making it theorectically comparable with a series of well-known algorithms like GMRES. Broydens "good" update technique, however, is shown to be naturally linked with a minimum "next correction" principle - which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized PDE's of convection diffusion type in 2-D with internal layers give a first impression of the possible power of the derived "good" Broyden variant. {\bf Key Words:} nonsymmetric linear system, secant method, rank-1 update, Broydens method, line search, GMRES. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 59
    Publication Date: 2014-02-26
    Description: A new adaptive multilevel approach for parabolic PDE's is presented. Full adaptivity of the algorithm is realized by combining multilevel time discretization, better known as extrapolation methods, and multilevel finite element space discretization. In the theoretical part of the paper the existence of asymptotic expansions in terms of time-steps for single-step methods in Hilbert space is established. Finite element approximation then leads to perturbed expansions, whose perturbations, however, can be pushed below a necessary level by means of an adaptive grid control. The theoretical presentation is independent of space dimension. In this part I of the paper details of the algorithm and numerical examples are given for the 1D case only. The numerical results clearly show the significant perspectives opened by the new algorithmic approach.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 60
    Publication Date: 2014-02-26
    Description: In this paper we consider symplectic difference schemes for perturbed Hamiltonian systems of integrable ones, which can cover many important problems. Symplectic difference schemes for general Hamiltonian systems can also be used to these problems. But the perturbation property has not been paid proper attention to, which is important in the method proposed here. Numerical simulation shows that, for this method the time step size can be taken quite large and the qualitative property , such as preserving invariant tori, is also better than usual symplectic difference schemes.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 61
    Publication Date: 2014-02-26
    Description: $G$-invariant cubature formulas for numerical integration over n-dimensional, $G$- invariant integration regions are computed symbolically. The nodes are the common zeros of some $d$-orthogonal polynomials which build an $H$-basis of an ideal. Approaches for these polynomials depending on parameters are made with the help of the theory of linear representations of a group $G$. This theory is also used for the effective computation of necessary conditions which determines the parameters. Another approach uses invariant theory and gröbner bases.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 62
    Publication Date: 2020-03-09
    Description: The FORTRAN preprocessor fpp in the newly introduced Autotasking System of CRAY Research allows automatic vectorization and parallelization on basis of a data dependence analysis. An introduction into data dependence analysis is given, showing how data dependence graphs unveil opportunities for program transformations like vectorization and concurrentization. The report contains a complete description of the preprocessors functionality, its options and directives for increasing the effectiveness of the dependence analyzer and steering the code transformations. Finally, some advice is given for the practical use of fpp on CRAY computers.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 63
    Publication Date: 2014-02-26
    Description: Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and medicine. They can be considered as ordinary differential equations in sequence spaces. In this work, a full adaptive algorithm for the computational treatment of such systems is developed. The method combines time discretization with extrapolation in Hilbert spaces with a discrete Galerkin approach as discretization of the stationary subproblems. The Galerkin method is based on orthogonal functions of a discrete variable , which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations can be assembled either by use of analytical properties of the orthogonal functions or numerically by a multilevel summation algorithm. The resulting algorithm CODEX is applied to many examples of technological interest, in particular from polymer chemistry.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 64
    Publication Date: 2014-02-26
    Description: Parameter-dependent systems of nonlinear equations with symmetry are treated by a combination of symbolic and numerical computations. In the symbolic part of the algorithm the complete analysis of the symmetry occurs, and it is here where symmetrical normal forms, symmetry reduced systems, and block diagonal Jacobians are computed. Given a particular problem, the symbolic algorithm can create and compute through the list of possible bifurcations thereby forming a so-called tree of decisions correlated to the different types of symmetry breaking bifurcation points. The remaining part of the algorithm deals with the numerical pathfollowing based on the implicit reparametrisation as suggested and worked out by Deuflhard/Fiedler/Kunkel. The symmetry preserving bifurcation points are computed using recently developed augmented systems incorporating the use of symmetry. {\bf Keywords:} pathfollowing, mixed symbolic-numeric algorithm, parameter-dependent, nonlinear systems, linear representations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 65
    Publication Date: 2014-02-26
    Description: Systems of polynomial equations often have symmetry. The Buchberger algorithm which may be used for the solution ignores this symmetry. It is restricted to moderate problems unless factorizing polynomials are found leading to several smaller systems. Therefore two methods are presented which use the symmetry to find factorizing polynomials, decompose the ideal and thus decrease the complexitiy of the system a lot. In a first approach projections determine factorizing polynomials as input for the solution process, if the group contains reflections with respect to a hyperplane. Two different ways are described for the symmetric group Sm and the dihedral group Dm. While for Sm subsystems are ignored if they have the same zeros modulo G as another subsystem, for the dihedral group Dm polynomials with more than two factors are generated with the help of the theory of linear representations and restrictions are used as well. These decomposition algorithms are independent of the finally used solution technique. We used the REDUCE package Groebner to solve examples from CAPRASSE, DEMARET and NOONBURG which illustrate the efficiency of our REDUCE program. A short introduction to the theory of linear representations is given. In a second approach problems of another class are transformed such that more factors are found during the computation; these transformations are based on the theory of linear representations. Examples illustrate these approaches. The range of solvable problems is enlarged significantly.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 66
    Publication Date: 2014-02-26
    Description: Symplectic difference schemes have been shown to be a right formalism for numerical computation of Hamiltonian systems. They are suitable to long time computation and of good qualitative properties. These properties are ensured by the fact that a symplectic difference scheme approximating to a time-independent Hamiltonian system can be regarded as a perturbed time-dependent Hamiltonian system of the original one. That is, a solution of a symplectic difference scheme is a solution of a certain perturbed time dependent Hamiltonian system evaluated at discrete (time) points. This is the main result of the paper. Moreover, linear symplectic difference schemes approximating to a linear time-independent Hamiltonian system can be regarded as a perturbed time-independent Hamiltonian system. So it has all properties that a linear Hamiltonian system has. Based on these results, stochastic webs and chaos in symplectic difference schemes are also discussed. They will appear in numerical simulation for Hamiltonian systems, even with one degree of freedom.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 67
    Publication Date: 2014-02-26
    Description: The potential distribution of reverse biased pn-junctions can be described by a double obstacle problem for the Laplacian. This problem is solved by a self adaptive Finite Element Method involving automatic termination criteria for the iterative solver, local error estimation and local mesh refinement. Special attention is paid to the efficient resolution of the geometries typically arising in semiconductor device simulation. The algorithm is applied to a reverse biased pn- junction with multi-step field plate and stop- electrode to illustrate its efficiency and reliability.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 68
    Publication Date: 2020-12-15
    Description: The paper presents a theoretical characterization of the often observed asymptotic mesh independence of Newton's method, which means that Newton's method applied to discretized operator equations behaves essentially the same for all sufficiently fine discretizations. The theory does not need any uniform Lipschitz assumptions that were necessary in comparable earlier treatments. The refined Newton-Mysovskii theorem, which will be of interest in a wider context, gives both existence and uniqueness of the solution and quadratic convergence for sufficiently good starting points. Attention is restricted to Galerkin approximations even though similar results should hold for finite difference methods - but corresponding proofs would certainly be more technical. As an illustrative example, adaptive 1-D collocation methods are discussed.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 69
    Publication Date: 2014-02-26
    Description: Oxidation mechanisms even for rather simple hydrocarbons like heptane consist due to the occurrence of many isomeric structures of thousands of reactions of hundreds of species. The automatic generation of these reaction mechanisms using artificial intelligence means is described. Results are presented for n-heptane-air mixtures, where a hand-written reaction mechanism tested against experimental data is available.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 70
    Publication Date: 2014-02-26
    Description: The paper surveys three aspects of chemical computing, which seem to play a role in recent developments. First, extrapolation methods for the numerical treatment of differential- algebraic equations are introduced. The associated extrapolation code LIMEX has reached a certain level of sophistication, which makes it a real competitor to the elsewhere widely used multi-step code DASSL of Petzold. Second, adaptive methods of lines for partial differential equations such as those arising in combustion problems are treated. Both static and dynamic regridding techniques are discussed in some detail. Finally, some new ideas about the treatment of the kinetic equations arising from polymer reactions are presented. The new feature of the suggested approach is the application of a Galerkin procedure using sets of orthogonal polynomials over a discrete variable (which, of course, in the case of polymer reactions is the polymer degree). The new approach may open the door to a new reliable low dimensional treatment of complex polymer reactions.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 71
    Publication Date: 2014-02-26
    Description: The discrete Galerkin method developed by the authors has turned out to be an efficient tool for the computational treatment of very large scale ODE systems arising in polyreaction kinetics. Up to now, this approach has been worked out in detail for homogeneous polymer reactions. The present paper deals with one line of possible extensions of the method to the case of so-called heterogeneous processes, which may appear e. g. in smog reactions. The associated mathematical models involve reaction coefficients depending on the chain length of the reacting polymer. The herein suggested extension is worked out in some detail on the basis of the earlier paper. In addition, a numerical example describing polymer degradation is included.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 72
    Publication Date: 2014-02-26
    Description: Newton methods for nonlinear problems are known to require the solution of a sequence of linear problems of the same type. For very large scale problems, as understood herein, the arising linear systems can only be solved by iterative methods. Then Newtons iteration appears as outer iteration. The question of interest will be to control the accuracy of the inner iteration such that the convergence speed of Newtons method is preserved. The purpose of the paper is to combine the concept of inexact Newton methods with the concept of the affine invariant exact Newton methods - which is important for problems with ill- conditioned Jacobian matrices (such as typical 2-D or 3-D discretized partial differential equations).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 73
    Publication Date: 2014-02-26
    Description: A variety of secant methods has been revisited in view of the construction of iterative solvers for large nonsymmetric linear systems $ Ax = b $ stemming from the discretization of convection diffusion equations. In the first section, we tried to approximate $ A ^{-1} $ directly. Since the sparsity structure of A- is not known, additional storage vectors are needed during the iteration. In the next section, an incomplete factorization $ LU $ of $ A $ is the starting point and we tried to improve this easy invertible approximation of $ A $. The update is constructed in such a way that the sparsity structure of $ L $ and $ U $ is maintained. Two different sparsity preserving updates are investigated from theoretical and practical point of view. Numerical experiments on discretized PDEs of convection diffusion type in 2- D with internal layers and on "arbitrary" matrices with symmetric sparsity structure are given. {\bf Key words:} nonsymmetric linear system, sparse secant method, Broyden's method, incomplete factorization.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 74
    Publication Date: 2014-02-26
    Description: The mathematical modeling of macromolecular reactions leads to countable (possibly infinite) systems of ordinary differential equations (CODE's). This paper reviews two recent developments of the so-called discrete Galerkin method, which has been developed for the numerical treatment of countable systems, which arise e.g. in polymer chemistry. The first approach can be considered as a method of lines with moving basis functions and has been implemented recently in the program package MACRON. The second type of the Galerkin method is characterized by a so-called outer time discretization of the complete problem and an appropriate and efficient solution of the arising subproblems. This method is realized in the research code CODEX.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 75
    Publication Date: 2014-02-26
    Description: In continuation of part I this paper develops a variable-order time discretization in Hilbert space based on a multiplicative error correction. Matching of time and space errors as explained in part I allows to construct an adaptive multilevel discretization of the parabolic problem. In contrast to the extrapolation method in time, which has been used in part I, the new time discretization allows to separate space and time errors and further to solve fewer elliptic subproblems with less effort, which is essential in view of the application to space dimension greater than one. Numerical examples for space dimension one are included which clearly indicate the improvement.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 76
    Publication Date: 2014-02-26
    Description: In the present paper, the improvement of an incomplete factorization of a non-symmetric matrix A is discussed. Starting from the ideas of sparsity preserving quasi-Newton methods, an algorithm is developed which improves the approximation of A by the incomplete factorization maintaining the sparsity structure of the matrices. No renumbering of the unknowns or the admittance of additional fill-in is necessary. The linear convergence of the algorithm is proved under the assumption, that $ L $ and $ U $* have the same sparsity structure and an incomplete factorization with some reasonable approximation property exits. In combination with this algorithm, the method of incomplete factorization and its several modifications are applicable to a wider class of problems with improved convergence qualities. This is shown by a numerical example. {\bf Key Words:} non-symmetric linear system, sparse secant method, incomplete factorization. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20, 65N30.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 77
    Publication Date: 2014-02-26
    Description: Das CRAY-Handbuch des ZIB beschreibt nach einer grundlegenden bersicht detailliert die Handhabung von UNICOS-Dateien, die Verwendung von UNICOS-Kommandos und schließlich die (für Benutzer allein zugelassene) Ausführung von Batchjobs auf der CRAY. Neben der Erreichbarkeit der CRAY über das TCP/IP-Netz werden die Compiler FORTRAN, PASCAL und C beschrieben und schließlich auf die Optimierung der Rechenzeit ebenso wie auf die Fehlersuche eingegangen. Ein umfangreicher Anhang führt bereitgestellte Programmpakete, weiterführende Literatur, Zahlenbereiche und Zeichendarstellung an der CRAY auf.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 78
    Publication Date: 2014-02-26
    Description: Diese Vorlesung ist eine Einführung in die Numerische Mathematik als einem der drei Bereiche (neben den Naturwissenschaften und der Informatik) des am besten mit dem Begriff Scientific Computing charakterisierten Forschungsgebietes. Aufgabe dieser relativ jungen Wissenschaft ist die Entwicklung von Rechenverfahren für Probleme aus den Naturwissenschaften mit Hilfe mathematischer Methoden.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 79
    Publication Date: 2014-02-26
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 80
    Publication Date: 2014-02-26
    Description: This paper presents the new program package MACRON for the simulation of macromolecular kinetics including standard chemical reactions. Such problems lead to countable (possibly) infinite systems of ordinary differential equations (CODE's), which are numerically treated by the so-called discrete Galerkin method here. By a chemical compiler the required analytical preprocessing is performed, such that the complete reaction system, standard kinetics as well as macromolecular reactions, can be entered in the chemical formalism. Typical macromolecular reaction steps are chain addition, termination, chain transfer and degradation (cracking). In order to ensure efficiency and reliability, high sophisticated numerical routines are built within the package. MACRON can be used without a detailed knowledge of the used numerical methods. As an illustration the application of MACRON to some realistic problems is presented.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 81
    Publication Date: 2014-02-26
    Description: We study the power-law type solutions of the fourth order field equations derived from a generic quadratic Lagrangian density in the case of multidimensional Bianchi I cosmological models. All the solutions of the system of algebraic equations have been found, using computer algebra, from a search of the Groebner bases associated to it. While, in space dimension $ d = 3 $ , the Einsteinian Kasner metric is still the most general power-law type solution, for $ d 〉 3 $ , no solution, other than the Minkowski space-time, is common to the three systems of equations associated with the three contributions to the Lagrangian density. In the case of a pure Riemann-squared contribution (suggested by a recent calculation of the effective action for the heterotic string), the possibility exists to realize a splitting of the $ d $-dimensional space into a ( $ d - 3 $)-dimensional internal space and a physical 3- dimensional space, the latter expanding in time as a power bigger than 2 (about 4.5 when $ d = 9 $).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 82
    Publication Date: 2014-02-26
    Description: Im vorliegenden Bericht wird die Parallelisierung zweier numerischer Algorithmen zur Lösung gewöhnlicher Differentialgleichungssysteme 1.Ordnung (explizite und semi-implizite Euler- Diskretisierung und $h$-Extrapolation) beschrieben. Implementiert wurden die Algorithmen mit OCCAM2 unter TDS (Transputer Development System) mit bis zu 4 Transputern T800. Meßwerte für die erreichten Beschleunigungen werden anhand mehrer Beispiele von Differentialgleichungs-systemen angegeben. {\bf Schlüsselwörter:} Adaptive, parallele Systeme; OCCAM2; Transputer; numerische Gleichungslöser; Euler-Diskretisierung; $h$-Extrapolation.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 83
    Publication Date: 2014-02-26
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 84
    Publication Date: 2014-02-26
    Description: BOXES computes a triangulation from a 2D domain description which consists of an arbitrary set of rectangles. Each rectangle may have attributes to control the triangulating process, define subdomain classes, or specify boundary conditions. The output of the program can be used as a coarse grid for KASKADE or one of its variants. Additional features are extensive checking of the user input, graphical display, and simple editing.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 85
    Publication Date: 2014-02-26
    Description: This report presents the final realization and implementation of a global inexact Newton method proposed by Deuflhard. In order to create a complete piece of software, a recently developed iterative solver (program GBIT) due to Deuflhard, Freund, Walter is adapted and serves as the standard iterative linear solver. Alternative linear iterative solvers may be adapted as well, e.g. the widely distributed code GMRES. The new software package GIANT (Global Inexact Affine Invariant Newton Techniques) allows an efficient and robust numerical solution of very large scale highly nonlinear systems. Due to the user friendly interface and its modular design, the software package is open for an easy adaptation to specific problems. Numerical experiments for some selected problems illustrate performance and usage of the package.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 86
    facet.materialart.
    Unknown
    Publication Date: 2019-10-24
    Keywords: ddc:000
    Language: German
    Type: annualzib , doc-type:report
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 87
    Publication Date: 2022-07-19
    Description: Efficient implementations of irregular problems on vector and parallel architectures are generally hard to realize. An important class of problems are Gauß-Seidel iteration schemes applied to irregular data sets. The unstructured data dependences arising there prevent restructuring compilers from generating efficient code for vector or parallel machines. It is shown, how to structure the data dependences by decomposing the underlying data set using graph coloring techniques and by specifying a particular execution order already on the algorithm level. Methods to master the irregularities originating from different types of tasks are proposed. An application is given and some open issues and future developments are discussed.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 21-34 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: During postnatal development of the pigeon, a large portion of the skeleton becomes pneumatized, displacing the hemopoietic bone marrow. The consequences of pneumatization on distribution and quantity of bone marrow as well as the availability of other sites for hemopoiesis have been investigated. Hemopoietic marrow of differently aged pigeons divided into five groups from 1 week posthatching (p.h.) up to 6 months p.h. was labeled with Fe-59 and examined by serial whole-body sections. Autoradiography and morphometry as well as scintillation counts of single bones and organs were also carried out. No sign of a reactivation of embryonic sites of erythropoiesis was found. Bone marrow weight and its proportion of whole-body weight increased during the first 4 weeks p.h. from 0.54% to 2.44% and decreased in the following months to about 1.0%. The developing bone marrow showed a progressive distribution during the first months of life, eventually being distributed proportionally over the entire skeleton, except for the skull. At the age of 6 months p.h. bone marrow had been displaced, its volume decreasing in correlation to increasing pneumaticity and conversion to fatty marrow. This generates the characteristic pattern of bone marrow distribution in adult pigeons, which shows hemopoietic bone marrow in ulna, radius, femur, tibiotarsus, scapula, furcula, and the caudal vertebrae.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 35-39 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: Artificially incubated fertile eggs from wild alligators have a significantly better hatch rate than those of captive, pen-reared alligators, possibly due to differences in the morphology of the eggshells. We compared the morphology of eggshells of wild alligators to those of captive alligators living in semi-natural environmental pens. Lengths and widths of eggs were measured and volume was determined, assuming an ellipsoid shape. Eggs were also evaluated for the quality of the eggshell (the presence or absence of rough deposits). Pieces of shell were cut from unincubated eggs and from eggs incubated for 55 days (just before hatching) and examined by scanning electron microscopy. Open pores on the outer surface of the shells were counted and thickness of the pieces was measured from micrographs. Results indicated that the number of pores on eggshells was lowest in eggs of captive alligators with early embryonic death. The number of pores was intermediate in eggs with early embryonic death from wild alligators, and the number of pores was highest in eggs with full-term embryos from wild or captive alligators. It is suggested that decreased porosity of eggshells may be associated with early embryonic death, is more prevalent in captive animals, and may, therefore, be related to poor hatch rate among penreared alligators.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 11-19 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: Adult hornets (Vespa orientalis; Hymenoptera, Vespinae) build the brood combs out of organic or mineral matter. The cement that serves to glue the building material together is secreted in their saliva, the latter hardening within seconds to form fibers or plates. This saliva-derived spittle overlies and unites the building particles laminally and vertically. The hornet larvae spin a cocoon within the brood cells, which is largely fastened to and supported by the cell walls and is composed of a network of silk fibers and interlinking flat surfaces. On the outside of the cocoon fibers are spherical button-like structures that are very rich in phosphorus. The chemical composition of the adult salivary cement and the larval cocoon fibers is similar: both contain the elements P, Mg, S, Cl, K, and Ca. The possible biological significance of these findings is discussed.Among social insects belonging to the Hymenoptera, there are three main groups that build a multitude of cells, namely, the paper wasps (Polistinae), the other social wasps or hornets (Vespinae), and the social bees (Apinae). The constructed cells serve mainly for rearing the brood, but in many instances (particularly among various Apinae) they also serve for storing honey and pollen. For building material, Apinae rely primarily on beeswax (a product secreted by the bee itself to which various amounts of plant resins are added). On the other hand, wasps (Polistinae and Vespinae) build mainly from matter collected in the nearby environment, be it organic matter such as tree bark, mineral matter, or a combination of the two.Much information has accumulated on comb and cell building among these insect groups (e.g., Wheeler, '23; Van der Vecht, '57, '65; Lindauer, '61; Michener, '61; Kemper and Döhring, '67; Wilson, '71; Guiglia, '72; Spradbery, '73; Edwards, '80; Brian, '83; Schremmer et al., '85). Species of Polistinae and Vespinae are prevalent in forest areas in Southeast Asia and in central and South America or in the temperate regions in both the northern and southern hemispheres, and they mainly use vegetable matter to build their combs. In contrast, species prevalent in the Mediterranean region, which is dry and relatively unvegetated during the wasp and hornet active season, rely more on nearby mineral than on plant matter. Comb building in the Oriental hornet is well known (Darchen, '64; Ishay et al., '67; Schaudinischky and Ishay, '68; Ishay, '73, '75a, b, '76; Ishay and Sadeh, '75, '76; Ishay and Perna, '79; Ishay et al., '82). Recently Ganor et al. ('86) described the cell wall in the V. orientalis comb, showing it to be composed of mineral particles collected near the subterranean nest, in contrast to the comb of two European species (V. crabro and Vespula) (Paravespula) germanica, which is built primarily of organic matter. Regardless of whether the building material is mineral or organic, the hornets utilize particles of sand or other minerals or pieces of wood wrapped and melded together by saliva. However, nothing is known about the cement or mortar used to glue together these “bricks.” The present investigation was initiated to increase our knowledge of this cementing substance.Combs of V. orientalis were collected from fields in the Tel-Aviv district in 1987 during the active season, which extends over most of the summer months. Because the combs are easily damaged, care was taken to remove them intact from the natural nest. Once removed, the combs were cleared of the existing brood (eggs, larvae, or pupae) and then stored carefully in dry glass vessels until examined. For the present study, combs were collected only from nests in Khamra soil, which is common in the Tel-Aviv district and along the coastal area of Israel. To investigate the morphology of the cement material in the comb, strips of comb wall as well as segments of the pupal silk dome were removed from each comb and prepared for examination. The comb wall strips were cut to a size of 3 × 6 mm and fastened to the stub of a scanning electron microscope (SEM). The silk pieces were processed in two ways: (1)strips of 3 × 4 mm were fastened onto a stub with the convex (outer surface) facing up or (2) with the concave (interior) side upward.Silk strips were boiled for 2 hours in distilled water to remove all impurities, such as foreign matter adhering to the silk secreted by the larvae. Examination of these silk fibres was carried out in the three ways: (1)SEM micrography of the exterior (white portion) of the silk dome; (2) micrography of the interior; (3) micrography of both exterior and interior aspects after boiling for 2 hours in distilled water to remove water-suspended foreign materials that may have clung to the silk dome in the course of ordinary nest activity.The chemical composition of selected specimens was investigated by x-ray analysis. They were done on JEOL 840 Scanning Electron Microscope (SEM) equipped with Link 10,000 Energy-Dispersive System (EDS). (With the EDS System, the spectrometer separates the elements according to energy rather than wavelength). Quantitative analysis was by ZAF4 program. Five strips of comb cell wall were examined from a randomly selected comb, each comb from a different nest. Micrographs were taken of isolated silk samples from each of the examined combs.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 122-122 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 107-116 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: Dissections were performed to document buccal anatomy in three species of the pulmonate genus Helisoma Swainson, 1840. The 28 muscles which are responsible for radular feeding in these animals are organized in three concentric and integrated envelopes. The deepest of these includes muscles which manipulate the radula about the odontophoral cartilage. Elements of the middle envelope direct movements of the cartilage within the buccal cavity, and muscles of the outer envelope control movements of the buccal mass within the cephalic haemocoel. Motion analysis by videomicrography showed that muscles of the middle and outer envelopes contribute to the action of radular feeding by acting as antagonists to other muscles and to hydrostatic elements of the buccal apparatus. Observations of radular dentition showed that although each of the three species examined has a unique radula, especially with regard to the specific details of tooth shape, all resemble a radula characteristic of the Planorbidae with regard to other, more general, aspects of ribbon architecture.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 151-164 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: Crocodilians and birds are the extant representatives of a monophyletic taxon known as archosaurs. Their limbs are highly derived in terms of reduction in number of skeletal elements in both the carpus and the tarsus. It is necessary to have a detailed description of crocodilian limb ontogeny to address the evolutionary issue dealing with the origin and organization of the avian limb. In this paper, we present an analysis of the early development of the crocodilian limb skeleton. Contrasting with earlier observations, we redefine the number and composition of carpal, tarsal, and phalangeal elements. This ontogenetic information is then used to introduce a revision of the homologies of the skeletal elements in the crocodilian limb. Some invariances are pointed out in the developmental organization of tetrapod limbs and this evidence serves to readdress several issues concerning the evolution of the avian limb. We present further embryological data in support of the hypothesis that digits 2-3-4 are the components of the wing skeleton in birds. In general, our comparative survey indicates that the elements that appear late in ontogeny are the ones lost in phylogeny. By comparing turtle (primitive) limb development with crocodilian and bird development, we propose a hypothesis in which the derived skeletal patterns found in crocodilians and birds have originated by a heterochronic process of paedomorphosis.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 211-217 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: A unique pathway that utilizes endoplasmic reticulum (ER) networks is proposed for screening pigment granule formation in the retina of adult Eumesosoma roeweri. Smooth endoplasmic reticulum (SER) functions to transport pigment particles to the formative site. Each site is composed of concentric, interconnected rings of SER that are filled with dense-cored, spherical pigment particles. Formation of the screening pigment granule begins by the release of particles from the innermost rings of carrier SER. Continued release followed by fusion and condensation of the pigment particles results in the formation of a mature pigment granule.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 165-179 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: Light and scanning electron microscopy of vascular replicas from the facultative air-breathing fish Heteropneustes fossilis show modifications in the macrocirculation of the respiratory organs and systemic circulation, whereas, gill microcirculation is similar to that found in typical water-breathing fish. Three and sometimes four ventral aortae arise directly from the bulbus. The most ventral vessel supplies the first pair of arches. Dorsal to this another aorta supplies the second gill arches, and a third, dorsal to, and larger than the other two, supplies the third and fourth arches and the air sacs. Occasionally a small vessel that may be the remnant of a primitive aortic arch arises from the first ventral aorta and proceeds directly to the mandibular region without perfusing gill tissue. The air sac is perfused by a large-diameter extension of the afferent branchial artery of the fourth gill arch and its circulation is in parallel with the gill arches. Blood drains from the air sac into the fourth arch epibranchial artery. A number of arteries also provide direct communication between the efferent air sac artery and the dorsal aorta. All four gill arches are well developed and contain respiratory (lamellar) and nonrespiratory (interlamellar and nutrient) networks common to gills of water-breathing fish. Air sac lamellae are reduced in size. The outer 30% of the air sac lamellar sinusoids are organized into thoroughfare channels; the remaining vasculature, normally embedded in the air sac parenchyma, is discontinuous. A gill-type interlamellar vasculature is lacking in the air sac circulation. Despite the elaborate development of the ventral aortae, there is little other anatomical evidence to suggest that gill and air sac outflow are separated and that dorsal aortic oxygen tensions are maintained when the gills are in a hypoxic environment. Physiological adjustments to hypoxic water conditions probably include temporal regulation of gill and air sac perfusion to be effective, if indeed they are so.
    Additional Material: 25 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 203-209 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: The antennae of adult Damalinia ovis, the sheep louse, were studied using light and scanning electron microscopy. Sensory structures are located on all three antennal segments with the predominant sensilla type being tactile. Nine different types of sensilla are described on the basis of external appearance. One of the sensilla, designated a “pit organ” because of its unusual shape, has not been described previously. A pair of these sensilla are present on each antenna, and their function is unknown. A group of 11 sensilla on the tip of each antenna contains olfactory and chemosensory pegs, and a possible thermohygroreceptor. The antennae are sexually dimorphic, the male having more tactile sensilla, two well-developed terminal hooks, and a different cuticular architecture on the posterior surface of antennal segment 1.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990) 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 247-282 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: The formation of the unpaired structure ventral to the basibranchial region, the so-called urohyal, differs within osteichthyans. A cartilaginous preformed, unpaired “urohyal” is present in sarcopterygians. A three-tendon ossification is present in Polypterus. An “urohyal” or urohyal is absent in both Amia and Lepisosteus. The urohyal formed as an unpaired ossification of the tendon of the sternohyoideus muscle is a feature of teleosts. A new structure, the parurohyal, arises as a double ossification of the tendon of the sternohyoideus muscle in siluroids; during ontogeny an anterodorsal crest or cup-like structure derives from the anterior basibranchial region and the tendon bone; therefore, the parurohyal is compound in origin. Judging from their formation and their distribution within osteichthyans the cartilaginous preformed “urohyal” and the teleostean urohyal are nonhomologous, whereas the urohyal and parurohyal are homologous. The urohyal is connected by ligaments with the ventral hypohyals in most teleosts, whereas it articulates with the ventral hypohyals in teleosts such as Anguilla and Chanos. The parurohyal is a synapomorphy of siluroids. The parurohyal in siluroids is articulated with both ventral and dorsal hypohyals, and with the basibranchial region in catfishes such as diplomystids and ictalurids, whereas it articulates only with the ventral hypohyals in other catfishes such as trichomycterines. The passage of the hypobranchial artery through the hypobranchial foramen of the parurohyal is a unique feature of siluroids, like the absence of the basihyal bone.An ossified dorsal hypohyal appears late in ontogeny in Amia, as do tooth plates related to the medial side of the hyoid arch and branchiostegal rays in Amia, and tooth plates on the hyoid arch and branchiostegal rays in Elops (unique features within extant teleosts). Two ossified hypohyals, a synapomorphy of teleosts, are present early in ontogeny.There is intraspecific variation in the onset of ossification of the bones of the head, but the sequence of ossification between bones in a defined structural system is conserved (e.g., branchiostegal rays ossify first, then bones of the hyoid arch).
    Additional Material: 20 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 321-330 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: The vas deferens of Ambystoma macrodactylum is composed of a peritoneal epithelium, connective tissue layer with fibroblasts, circular smooth muscle, capillaries, cells containing lipid, and a luminal epithelium composed of a single layer of cuboidal cells covered by a net of interconnected ciliated squamous cells. The cuboidal cells have abundant rough endoplasmic reticulum, mitochondria, and PAS + secretory vesicles. Squamous cells of breeding males consistently have tufts of ∼100 cilia located at one end of the long axis of each cell. These cilia may help distribute secretory products. The squamous cells, absent in post-breeding males, are apparently sloughed into the lumen. Lipid vesicles are present throughout the cytoplasm of the cuboidal and squamous epithelial cells and are also in some cells of the connective tissue layer. These vesicles increase dramatically in number during the first 4 weeks after breeding and may serve as an energy pool for the next breeding season. Enzyme-histochemical tests for testosterone synthesis were negative. In addition to the accumulation of lipid and the loss of squamous cells in the vas deferens, after breeding PAS + vesicle production is terminated. These alterations appear to represent energy conservation strategies employed by the sperm-depleted vas deferens.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal of Morphology 203 (1990), S. 345-359 
    ISSN: 0362-2525
    Keywords: Life and Medical Sciences ; Cell & Developmental Biology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Medicine
    Notes: The concept of parallel muscle combinations, in which spindle density is significantly higher in small muscles compared to their larger counterparts in large-small muscle combinations acting across a joint, is supported by the results of this study regardless of the joint. Analysis of the canine data as well as previously published guinea pig forelimb and human pelvic limb data revealed no significant difference in spindle density between antigravity and non-antigravity muscles. Furthermore, a gradual increase in spindle density from proximal to distal on the limb was not found, although spindle density was significantly higher in the intrinsic manus or pes muscles compared to more proximal limb muscles in all three species. The significant differences in spindle densities in parallel muscle combinations and in manus/pes versus proximal muscles are discussed relative to their possible role in the control of locomotion.
    Additional Material: 11 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...