Library

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2015-2019
  • 2000-2004  (57)
  • 1990-1994  (1,720)
  • 1945-1949
  • 1830-1839
  • 2004  (57)
  • 1991  (1,720)
  • General Chemistry  (1,091)
  • Engineering  (596)
  • Key words
  • apoptosis
  • ddc:000
Material
Years
  • 2015-2019
  • 2000-2004  (57)
  • 1990-1994  (1,720)
  • 1945-1949
  • 1830-1839
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: 2020-12-15
    Description: The present paper contains a generalization of a refinement of the Newton- Mysovskii theorem, recently obtained by the authors, to the case of Gauss-Newton procedures for solving nonlinear least-squares problems with full Jacobians. Invariant sufficient conditions are given that ensure the convergence of the Gauss-Newton iterates towards a solution of the problem, as well as the uniqueness of that solution in an explicitely defined neighborhood. It is shown by a counter- example that the results do not carry over to the rank deficient case.
    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: The breakdown voltage highly depends on the electric field in the depletion area whose computation is the most time consuming part of the simulation. We present a self adaptive Finite Element Method which reduces dramatically the required computation time compared to usual Finite Difference Methods. A numerical example illustrates the efficiency and reliability of the algorithm.
    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: Part III of the paper is devoted to the construction of an adaptive FEM solver in two spatial dimensions, which is able to handle the singularly perturbed elliptic problems arising from discretization in time. The problems of error estimation and multilevel iterative solution of the linear systems - both uniformly well behaved with respect to the time step - can be solved simultaneously within the framework of preconditioning. A multilevel nodal basis preconditioner able to handle highly nonuniform meshes is derived. As a numerical example an application of the method to the bioheat-transfer equation is included. {\bf AMS CLASSIFICATION:} 65F10, 65F35, 65M50, 65M60, 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 ...
  • 61
    Publication Date: 2020-09-24
    Description: Most nonlinear computations require the evaluation of first and higher derivatives of vector functions defined by computer programs. It is shown here how vectors of such partial derivatives can be obtained automatically and efficiently if the computer language allows overloading (as is or will be the case for C++, PASCAL-XSC, FORTRAN90, and other modern languages). Here, overloading facilitates the extension of arithmetic operations and univariate functions from real or complex arguments to truncated Taylor-series (or other user- defined types), and it generates instructions for the subsequent evaluation of adjoints. Similar effects can be achieved by precompilation of FORTRAN77 programs. The proposed differentiation algorithm yields gradients and higher derivatives at a small multiple of the run-time and RAM requirement of the original function evaluation program. {\bf Keywords:} Automatic Differentiation, Chain Rule, Overloading, Taylor Coefficients, Gradients, Hessians, Reverse Accumulation, Adjoint Equations. {\bf Abbreviated title:} Automatic Differentiation by Overloading.
    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 ...
  • 62
    Publication Date: 2014-02-26
    Description: The description of chain length distributions in macromolecular reaction kinetics leads to so-called countable systems of differential equations. In particular, when the appearing reaction rate coefficients depend on the chain length of the reacting macromolecules itself, an efficient numerical treatment of these systems is very difficult. Then even the evaluation of the right-hand side of the system can become prohibitively expensive with respect to computing time. In this paper we show how the discrete Galerkin method can be applied to such problems. The existing algorithm CODEX is improved by use of a multiplicative error correction scheme for time discretization and a new type of numerical preprocessing by means of a Gauss summation. Both ideas are exemplary for a wide class of approximation types and are described very briefly here. The new numerical techniques are tested on an example from soot formation, where the coagulation of molecules is modeled in terms of reaction coefficients depending on the surface of the particles and their collision frequency.
    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 ...
  • 63
    Publication Date: 2014-02-26
    Description: The numerical solution of optimal control problems by indirect methods (such as multiple shooting or collocation) requires a considerable amount of analytic calculation to establish a numerically tractable system. These analytic calculations, though being rather tedious in realistic examples, are nowadays mostly still done by hand-and thus prone to calculation errors. The paper aims at automating this analytic processing to a reasonable extent by means of a modern symbolic manipulation language (here: REDUCE). In its present stage of development the package OCCAL (mnemotechnically for \underline{O}ptimal \underline{C}ontrol \underline{CAL}culator) permits an interactive use, covering tasks like automatic determination of control and, in case of a singular control, of its order. In simpler problems, the present version of OCCAL automatically produces the full subroutine input for a MULtiple shooting code (MULCON) with adaptive numerical CONtinuation. In more complicate problems where singular sub-arcs may occur or where the sequence of sub-arcs of the optimal trajectory is unclear OCCAL is a significant help in reducing analytic pre-processing. Numerical examples illustrate the performance of OCCAL/MULCON.
    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: If $B$ is an arrangement of linear complex Hyperplanes in $C^d$, then the following can be constructed from knowledge of its intersection lattice: (a) the cohomology groups of the complement [Br], (b) the cohomology algebra of the complement [OS], (c) the fundamental group of the complement, if $d\le2$, (d) the singularity link up to homeomorphism, if $d\le3$, (e) the singularity link up to homotopy type [ZZ]. If $B'$ is, more generally, a 2-arrangement in $ R^{2d}$ (an arrangement of real subspaces of codimension 2 with even-dimensional intersections), then the intersection lattice still determines (a) the cohomology groups of the complement [GM] and (e) the homotopy type of the singularity link [ZZ]. We show, however, that for 2-arrangements the data (b), (c) and (d) are not determined by the intersection lattice. They require the knowledge of extra information on sign patterns, which can be computed as determinants of linear relations, or (equivalently) as linking coefficients in the sense of knot theory.
    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 ...
  • 65
    Publication Date: 2014-02-26
    Description: We prove combinatorial formulas for the homotopy type of the union of the subspaces in an (affine, compactified affine, spherical or projective) subspace arrangement. From these formulas we derive results of Goresky & MacPherson on the homology of the arrangement and the cohomology of its complement. The union of an arrangement can be interpreted as the direct limit of a diagram of spaces over the intersection poset. A closely related space is obtained by taking the homotopy direct limit of this diagram. Our method consists in constructing a combinatorial model diagram over the same poset, whose homotopy limit can be compared to the original one by usual homotopy comparison results for diagrams of spaces.
    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: A new adaptive multilevel approach for linear partial differential equations is presented, which is able to handle complicated space geometries, discontinuous coefficients, inconsistent initial data. Discretization in time first (Rothe's method) with order and stepsize control is perturbed by an adaptive finite element discretization of the elliptic subproblems, whose errors are controlled independently. Thus the high standards of solving adaptively ordinary differential equations and elliptic boundary value problems are combined. A theory of time discretization in Hilbert space is developed which yields to an optimal variable order method based on a multiplicative error correction. The problem of an efficient solution of the singularly perturbed elliptic subproblems and the problem of error estimation for them can be uniquely solved within the framework of preconditioning. A Multilevel nodal basis preconditioner is derived, which allows the use of highly nonuniform triangulations. Implementation issues are discussed in detail. Numerous numerical examples in one and two space dimensions clearly show the significant perspectives opened by the new algorithmic approach. Finally an application of the method is given in the area of hyperthermia, a recent clinical method for cancer therapy.
    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: 2020-03-06
    Description: NUMSIM 91 fand vom 6.-08. Mai 1991 im Wissenschaftlichen Kommunikations- & Konferenz- Zentrum der Humboldt-Universität in Gosen bei Berlin statt. Im Mittelpunkt dieses Seminars standen Probleme der numerischen Simulation von Ladungstransport- und Technologieprozessen der Mikro- und Optoelektronik. Es führte Spezialisten der physikalischen Modellierung, der numerischen Mathematik und mathematischen Analysis sowie Nutzer von Simulationsprogrammen aus dem deutschsprachigen Raum zusammen. Ziel war die Vermittlung und der Austausch von Erfahrungen, die Diskussion gemeinsamer Aufgabenstellungen und Projekte und - in Anbetracht der deutschen Vereinigung nicht zuletzt - das gegenseitige Kennen- und Verstehenlernen.
    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: 2014-03-06
    Description: The rapidly increasing number of AIDS cases requires a realistic estimation of the future development of the HIV/AIDS disease. For that purpose we develop a large system of coupled nonlinear differential equations describing simultaneously the dynamics of the development of the disease, the population size, the gender and age structure. A set of 1650 coupled equations are linked by balanced parameters. The balancing procedure is described by a set of (formally) 2,178,000 additional algebraic conditions. As the considered system is stiff, it requires new special extrapolation methods combined with techniquees of dynamical sparsing for the solution of sparsely filled systems. According to our simulations we expect 19,0,000 deaths caused by AIDS in the Federal Republic of Germany (former territories) in the year 2000. Such an epidemical spread would tie up about 4-7 percent of the actual health care workers.
    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 ...
  • 69
    Publication Date: 2014-02-26
    Description: In this paper we introduce a discontinuous finite element method. In our approach, it is possible to combine the advantages of finite element and finite difference methods. The main ingredients are numerical flux approximation and local orthogonal basis functions. The scheme is defined on arbitrary triangulations and can be easily extended to nonlinear problems. Two different error indicators are derived. Especially the second one is closely connected to our approach and able to handle arbitrary variing flow directions. Numerical results are given for boundary value problems in two dimensions. They demonstrate the performance of the scheme, combined with the two error indicators. {\bf Key words:} neutron transport equation, discontinuous finite element, adaptive grid refinement. {\bf Subject classifications:} AMS(MOS) 65N30, 65M15.
    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: In this paper it is shown that for highly nonuniformly refined triangulations the condition number of the BPX preconditioner for elliptic finite element problems grows at most linearly in the depth of refinement. This is achieved by viewing the computational available version of the BPX preconditioner as an abstract additive Schwarz method with exact solvers. {\bf AMS CLASSIFICATION:} 65F10, 65F35, 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 ...
  • 71
    Publication Date: 2014-02-26
    Description: We study the space of all extensions of a real hyperplane arrangement by a new pseudo- hyperplane, and, more generally, of an oriented matroid by a new element. The question whether this space has the homotopy type of a sphere is a special case of the "Generalized Baues Problem" of Billera, Kapranov & Sturmfels, via the Bohne-Dress Theorem on zonotopal tilings. We prove that the extension space is spherical for the class of strongly euclidean oriented matroids. This class includes the alternating matroids and all oriented matroids of rank at most 3 or of corank at most 2. In general it is not even known whether the extension space is connected. We show that the subspace of realizable extensions is always connected but not necessarily spherical.
    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
    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 ...
  • 73
    Publication Date: 2014-02-26
    Description: We consider such variational inequalities which either describe obstacle problems or result from an implicit time discretization of moving boundary problems of two phase Stefan type. Based on a discretization in space by means of continuous, piecewise linear finite elements with respect to a nested hierarchy of triangulations, in both cases we use iterative processes consisting of inner and outer iterations. The outer iterations are either active set strategies or generalized Newton methods while the inner iterations are preconditioned cg- iterations with multilevel preconditioners.
    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: One-step discretizations of order $p$ and step size $\varepsilon$ of ordinary differential equations can be viewed as time-$\varepsilon$ maps of \begin{displaymath} \dot{x} (t) = f(\lambda ,x(t)) + \varepsilon^p g(\varepsilon,\lambda,t/\varepsilon,x(t)), x \in R^N,\lambda \in R, \end{displaymath} where $g$ has period $\varepsilon$ in $t$. This is a rapidly forced nonautonomous system. We study the behavior of a homoclinit orbit $\Gamma$ for $\varepsilon = 0, \lambda =0$, under discretization. Under generic assumptions we show that $\Gamma$ becomes transverse for positive $\in$. The transversality effects are estimated from above to be exponentially small in $\in$. For example, the length $l(\varepsilon$) of the parameter interval of $\lambda$ for which $\Gamma$ persists can be estimated by \begin{displaymath} l(\varepsilon)\le Cexp(-2\pi\eta/\varepsilon), \end{displaymath} where $C,\eta$ are positive constants. The coefficient $\eta$ is related to the minimal distance from the real axis of the poles of $\Gamma(t)$ in the complex time domain. Likewise, the region where complicated, "chaotic" dynamics prevail is estimated to be exponentially small, provided $x \in R^2$ and the saddle quantity of the associated equilibrium is nonzero. Our results are visualized by high precision numerical experiments. The experiments show that, due to exponential smallness, homoclinic transversality becomes pratically invisible under normal circumstances, already for only moderately small step size. {\bf Keywords:} Homoclinic orbit, ordinary differential equations, discretization, transversality, averaging, exponential smallness, chaos. {\bf Subject Classifications:} (AMS): 34C15, 34C35, 58F14, 65L60
    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: We consider the discretization of obstacle problems for the Laplacian by piecewise linear finite elements. Assuming that the discrete problems are reduced to a sequence of linear problems by suitable active set strategies, the linear problems are solved iteratively by preconditioned c-g iterations. The proposed preconditioners are treated theoretically as abstract additive Schwarz methods and are implemented as truncated hierarchical basis preconditioners. To allow for local mesh refinement we derive semi-local and local a posteriori error estimates, providing lower and upper estimates for the discretization error. The theoretical results are illustrated by numerical computations.
    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 ...
  • 76
    Publication Date: 2014-02-26
    Description: Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and statistics. They can be considered as ordinary differential equations in sequence spaces. In this work, a fully adaptive algorithm for the computational treatment of such systems is developed. The method is based on a time discretization of an abstract Cauchy problem in Hilbert space and a discrete Galerkin approach for the discretization of the arising stationary subproblems. The Galerkin method uses 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 are solved adaptively either by use of analytical properties of the orthogonal functions or by an appropriate numerical summation. The resulting algorithm CODEX is applied to 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 ...
  • 77
    Publication Date: 2014-02-26
    Description: The deformation of a hexagonal lattice dome under an external load is an example of a parameter dependent system which is equivariant under the symmetry group of a regular hexagon. In this paper the mixed symbolic-numerical algorithm SYMCON is applied to analyze its steady state solutions automatically showing their different symmetry and stability properties.
    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 ...
  • 78
    Publication Date: 2014-02-26
    Description: We study the higher Bruhat orders $B(n,k)$ of Manin & Schechtman [MaS] and - characterize them in terms of inversion sets, - identify them with the posets $U(C^{n+1,r},n+1)$ of uniform extensions of the alternating oriented matroids $C^{n,r}$ for $r:=n-k$ (that is, with the extensions of a cyclic hyperplane arrangement by a new oriented pseudoplane), - show that $B(n,k)$ is a lattice for $k =1$ and for $r\le 3$, but not in general, - show that $B(n,k)$ is ordered by inclusion of inversion sets for $k=1$ and for $r\le 4$. However, $B(8,3)$ is not ordered by inclusion. This implies that the partial order $B_\subseteq (n,k)$ defined by inclusion of inversion sets differs from $B(n,k)$ in general. We show that the proper part of $B_\subseteq (n,k)$ is homotopy equivalent to $S^{r-2}$. Consequently, - $B(n,k)\simeq S^{r-2}$ for $k=1$ and for $r\le 4$. In contrast to this, we find that the uniform extension poset of an affine hyperplane arrangement is in general not graded and not a lattice even for $r=3$, and that the proper part is not always homotopy equivalent to $S^{r(M)-2}$.
    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 ...
  • 79
    Publication Date: 2019-05-10
    Description: The C-implementation of KASKADE, an adaptive solver for linear elliptic differential equations in 2D, is object of a set of numerical experiments to analyze the use of resources (time and memory) with respect to numerical accuracy. We study the dependency of the reliability, robustness, and efficiency of the program from the parameters controlling the algorithm.
    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 ...
  • 80
    Publication Date: 2014-02-26
    Description: A high resolution Godunov-type method is developed and applied to a two-dimensional version of the Burgers equation. On one-dimensional testproblems the scheme is second order accurate for smooth flow and resolves discontinuities sharply. On two-dimensional problems, however, large numerical oscillations are introduced when discontinuities traveling obliquely to the grid directions are present. These oscillations are caused by a Strang- type operator splitting, and cannot be eliminated using flux limiters or small timesteps. {\bf Keywords:} High resolution methods, Godunovs method, operator splitting, complex Burgers equation. {\bf AMS:} 35: A40, L45, L60, L65, L, 67. 65: M05, M10.
    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: For adaptive solution of convection- difussion problems with the streamline-diffusion finite element method, an error estimator based on interpolation techniques is developed. It can be shown that for correctness of this error estimator a restriction of the maximum angle is to be sufficient. Compared to usual methods, the adaptive process leads to more accurate solutions at much less computational cost. Numerical tests are enclosed. {\bf Keywords: } Adaptive finite elements, convection- diffusion equation, internal and boundary layers, streamline-diffusion. {\bf Subject Classifications:} AMS(MOS): 65N15, 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 ...
  • 82
    Publication Date: 2014-02-26
    Description: The success of the German Reunification requires a unique migration from the traditional Eastern Block system to a modern free society. The successful migration must include a shift from a low state of the art in technology to the high level of science and technology present in the Western Community. The role of supercomputing in this transition will include leading the process of organizational change in research and development. The paper contains a short overview on the current state of this evolution, on the currently used political and administrative tools to keep this evolution on track, and on the influence on the Konrad-Zuse-Zentrum, which is, as a Berlin institution, in the geographical and cultural center of this transformation.
    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 ...
  • 83
    Publication Date: 2014-02-26
    Description: The following report intends to provide a survey over the computational chemistry molecular structure software installed on CRAY X-MP/24 at ZIB. It shows what kind of problems can be tackled with the existing chemistry software, which covers a wide range of ab initio, semiempirical, molecular mechanics, and dynamics applications.
    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 ...
  • 84
    Publication Date: 2022-04-11
    Description: Mit zunehmender Dezentralisierung im Bereich des Wissenschaftlichen Rechnens steigt auch der Bedarf an Softwarequellen qualitativ hochwertiger mathematischer Algorithmen. Für den Software- und Informationsaustausch wird die Einrichtung öffentlicher, elektronischer Softwarebibliotheken vorgeschlagen. Am Beispiel der eLib des ZIB werden die notwendigen technischen Konzepte, die u.a. auch in den heutigen Gegebenheiten der technischen Kommunikation begründet sind, diskutiert. Die eLib ist fenster- und menüorientiert aufgebaut und folglich im Dialog sehr einfach zu benutzen. Sie kann aber auch mit ihrer Kommandosprache allein auf dem Wege über elektronische Post abgefragt werden. Über die eLib sind, nach dem Verbund mit den Netzbibliotheken NetLib und Reduce-NetLib jetzt etwa 6000 mathematische Programme und allgemeine Dokumente verfügbar. Das Dienstleistungsangebot der eLib setzt Beiträge aus einer aktiven Benutzergemeinschaft voraus. Es besteht die Hoffnung, daß durch den öffentlichen Softwareaustausch sich Entwickler und Anwender wechselseitig in ihrer Arbeit befruchten.
    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 ...
  • 85
    Publication Date: 2022-07-07
    Description: An adaptive approach to the numerical solution of the wave propagation in integrated optics devices with 1D cross sections is described. First, Fresnel's approximation of the exact wave equation resulting from Maxwell's equations is considered. A criterion to estimate the validity of this approximation is derived. Fresnel's wave equation being formally equivalent to Schroedinger's equation uniquely defines an initial-boundary-value problem, which is solved numerically by a stepwise calculation of the propagating field. Discretization in longitudinal direction first with stepsize control leads to a stationary subproblem for the transversal field distribution, which is then handled by an adaptive finite element method. Thus full adaptivity of the algorithm is realized. The numerical examples are concentrated on taper structures playing an essential role in integrated optics devices for telecommunication systems.
    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 ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Circuits, systems and signal processing 10 (1991), S. 455-470 
    ISSN: 1531-5878
    Keywords: 34A08 ; 93B07 ; 93B15 ; 93C15 ; 93C50 ; Key words ; Descriptor ; Singular ; Differential-algebraic ; Observability ; Controllability ; Duality ; Structural forms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract A characterization of observability for linear time-varying descriptor systemsE(t)x′(t)+F(t)x(t)=B(t)u(t), y(t)=C(t)x(t) was recently developed. NeitherE norC were required to have constant rank. This paper defines a dual system, and a type of controllability so that observability of the original system is equivalent to controllability of the dual system. Criteria for observability and controllability are given in terms of arrays of derivatives of the original coefficients. In addition, the duality results of this paper lead to an improvement on a previous fundamental structure result for solvable systems of the formE(t)x′(t)+F(t)x(t)=f(tt).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 87
    ISSN: 1573-0778
    Keywords: mouse-mouse hybridoma ; protein-free supplement ; basal medium ; apoptosis ; bioreactor culture
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract The iron-rich (500 μM ferric citrate) protein-free supplement was added to six different basal media. Cell growth and monoclonal antibody production of a mouse-mouse hybridoma were investigated in 1.3 1 batch cultures performed in a laboratory bioreactor with automatic control of pH and dissolved oxygen concentration. RPMI 1640 served as the control medium. Fortification of the basal medium by balanced mixtures of amino acids and vitamins showed higher positive effect than daily supplementation by glucose and glutamine. Strongly fortified medium, based on RPMI 1640, was found superior to other basal media. The viability index increased by a factor of 3.04 and the total antibody production by a factor of 2.82, relative to the control.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Plant and soil 133 (1991), S. 209-218 
    ISSN: 1573-5036
    Keywords: Key words ; anions ; chloride ; flowers ; fruit yield ; kiwifruit ; potassium ; sulphate
    Source: Springer Online Journal Archives 1860-2000
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Abstract The effects of K fertiliser (160 kg ha-1) applied with Cl- or SO4 2- as the accompanying anion on the K nutrition of kiwifruit (Actinidia deliciosa var. deliciosa) were assessed in a field experiment, using vines with varying degrees of K deficiency. Leaf K concentrations in spring were significantly higher for vines receiving KCl, compared to those receiving K2SO4. This effect did not interact significantly with the degree of K deficiency, and persisted for about 6 weeks. Subsequently there was no significant difference between the leaf K concentrations for the vines receiving KCl or K2SO4. Applying K as KCl increased the leaf Cl concentration, especially in spring, while applying K as K2SO4 had no significant effect on the leaf S concentration at that time. These results implied a greater requirement for organic acid anions for K+ uptake from K2SO4 than from KCl, and the importance of organic acid anions for K+ uptake from different sources of K fertiliser is discussed. This transient effect of the accompanying anion on leaf K status was associated with large effects on flowering, and fruit yields were about 28% higher for plants receiving KCl rather than K2SO4. The effects on growth and tissue nutrient composition of varying the concentrations of Cl-, NO3 -, SO4 2- and H2PO4 - around the roots of kiwifruit vines were examined in a solution culture experiment. For H2PO4 -, plant growth was very similar over a wide range of rates of addition. For the other anions, the range between deficiency and ‘toxicity’ was clearly delineated. For Cl- and NO3 -, toxicity was associated with high tissue concentrations of Cl and N, respectively, and was consistent with competition for uptake between Cl- and NO3 -. However, for SO4 2-, toxicity was associated with only a small increase in the tissue S concentration relative to that associated with maximum growth, and appeared to result more from effects on uptake of other anions and cations rather than from direct effects of high tissue S concentrations. It is concluded that the sensitivity of kiwifruit to the anion accompanying K+ in fertiliser may be related to the unusually high requirement for Cl previously reported for this species.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Plant and soil 137 (1991), S. 99-103 
    ISSN: 1573-5036
    Keywords: Key words ; Azospirillum ; beneficial bacteria ; membrance potential ; plant-bacteria interaction ; rhizosphere bacteria
    Source: Springer Online Journal Archives 1860-2000
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Abstract Inoculation of soybean seedlings withAzospirillum brasilense Cd significantly reduced the membrane potential in every root part and was being maximal in the root elongation zone. Monitoring the proton efflux pattern of inoculated wheat roots by severalA. brasilense strains and byPseudomonas sp. for prolonged periods (up to 200h) revealed a change from the bimodal pattern of proton efflux of non inoculated roots. This change was not related to root colonization ability but to bacterial capacity to induce changes in root surface area. Continuous perfusion of the plant nutrient solution with a fresh solution (from inoculation time), eliminated the enhancing effect of inoculation on proton efflux. We propose thatA. brasilense inoculation influences membrane activity and subsequently proton efflux in roots, probably through the release of an as yet unidentified bacterial signal.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Plant and soil 137 (1991), S. 127-134 
    ISSN: 1573-5036
    Keywords: Key words ; ammonium ; Azospirillum sp. ; dinitrogenase reductase ; ‘switch off’
    Source: Springer Online Journal Archives 1860-2000
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Abstract Many N2-fixing organisms can turn off nitrogenase activity in the presence of NH4 + and turn it on again when the NH4 + is exhausted. One of the most interesting systems for accomplishing this is by covalent modification of one subunit of dinitrogenase reductase by dinitrogenase reductase ADP-ribosyltransferase (DRAT). The system can be reactivated when NH4 + is exhausted, by dinitrogenase reductase activating glycohydrolase (DRAG) which removes the inactivating group. It is fascinating that some species of the genusAzospirillum possess the DRAT and DRAG systems (A. lipoferum andA. brasilense), whereasA. amazonense in the same genus lacks DRAT and DRAG.A. amazonense responds to NH4 + but does not exhibit modification of dinitrogenase reductase characteristic of the action of DRAT. However, it has been possible to clone DRAT and DRAG and to introduce them intoA. amazonense, whereupon they become functional in this organism. The DRAT and DRAG system does not appear to function inAcetobacter diazotrophicus, an organism isolated from sugar cane, that fixes N2 at a pH as low as 3.0.A. diazotrophicus does show a rather sluggish response to NH4 +. A level of about 10 μM NH4 + is required to ‘switch off’ the system. The response to NH4 + is influenced by the dissolved oxygen concentration (DOC) as has been reported forAzospirillum sp. A DOC in equilibrium with 0.1 to 0.2 kPa O2 seems optimal for the response inA. diazotrophicus.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 275-293 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The performance of multiplier algorithms for structural optimization has been significantly improved by using trust regions. The trust regions are constructed using analytical second order sensitivity, and within this region, the augmented Lagrangian φ is minimized subject to bounds. Evaluation of first and second derivatives of φ by the adjoint method does not require derivations of individual (implicit) constraint functions, which makes the method economical. Eight test problems are considered and a vast improvement over previously used multiplier algorithms has been noted. Also, the algorithm is robust with respect to scaling, input parameters and starting designs.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 223-253 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new class of predictor/corrector algorithms is proposed to solve the complex system of differential equations that arises from a Galerkin spatial discretization of the equations of motion in a recent formulation of dynamic vehicle/structure interaction. The applicability of the concept of a building-block vehicle/structure interaction model developed in our previous work - where the vehicle nominal motion is not prescribed a priori, but is part of the unknown motion of the system - is demonstrated through the construction of a simple vehicle model. In the new algorithms, the presence of the accelerations of the vehicle component is eliminated in the predictor structural equations, making these equations different from the corrector structural equations. The special treatment of the predicted axial motion that provides an artificial damping to eliminate unstable oscillations in the numerical results as proposed in the old algorithms is avoided. Accurate results from numerical simulations using the new algorithms are obtained, and there are no unstable oscillations that were observed in some other predictor/corrector schemes. The system energy balance is also better preserved compared with the old algorithms.
    Additional Material: 9 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
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 295-311 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents a new method for the direct and accurate evaluation of strongly singular integrals in the sense of Cauchy principal values and weakly singular integrals over quadratic boundary elements in three-dimensional stress analysis and quadratic internal cells in two-dimensional elastoplastic analysis by the boundary element method. A quadratic triangle polar co-ordinate transformation technique is applied to reduce the order of singularity of the singular integrals. Next, a form of Stokes' theorem is introduced in order to remove the singularity in the Cauchy principal value integrals; therefore, the evaluation of these integrals can be carried out by standard Gaussian quadrature. Numerical examples of 2-D elastoplastic problems and a 3-D elastic problem show the effectiveness and efficiency of the method.
    Additional Material: 10 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
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 363-383 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A numerical method for the solution of inverse heat conduction problems in two-dimensional rectangular domains is established and its performance is demonstrated by computational results. The present method extends Beck's8 method to two spatial dimensions and also utilizes future times in order to stabilize the ill-posedness of the underlying problems. The approach relies on a line approximation of the elliptic part of the parabolic differential equation leading to a system of one-dimensional problems which can be decoupled.
    Additional Material: 14 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
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 439-439 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 921-937 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Methods are described for adapting a structured grid in response to a numerical solution, so that grid nodes become clustered where ‘solution activity’ is high, the aim being to reduce solution truncation errors without increasing the number of grid nodes employed, or modifying their connectivity. After introducing the concept of ‘equidistribution’, and discussing options for the measurement of solution activity, the paper concentrates mainly on two alternative techniques for producing smooth, regular grids which apply constraints on this equidistribution. The first technique described is based on a spring analogy, and is demonstrated here with examples of two- and three-dimensional inviscid flows, and with two-dimensional viscous flows. The second technique employs a Poisson grid generator with adaptive terms included in the control functions, and is demonstrated with a two-dimensional inviscid flow. A third method is then introduced, termed the LPE method, which allows a compromise to be chosen between grids generated by solving Laplace equations, Poisson equations and equidistribution equations. Since this method is still being developed, results are currently limited and tentative.
    Additional Material: 13 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
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 957-967 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Bounds on eigenvalues of various finite element systems are analysed by using an element eigenvalue theorem together with the Global Eigenvalue Theorem. Both two dimensional continuum dynamics and heat conduction problems are considered. These bounds provide stable time steps for explict time integration schemes. A reduced eigenproblem at element quadrature point level, with all zero eigenvalues suppressed, is also presented in this paper. The simplified eigenproblem results in simple formulas for calculating the eigenvalues.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 1041-1055 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Based on the assumed element strain fields and the interrelated displacement-rotation interpolations, a four-node (12 dof) quadrilateral C0 finite element, designated as QCCP-2, for the analysis of thick/thin plates is developed in this paper. The four-node C0 plate element presented here possesses a linear bending strain field, and the element stiffness matrices are given explicitly. Therefore, the present four-node C0 plate element is more efficient and accurate than the existing four-node C0 plate elements where the constant strain stiffness matrices are obtained by numerical integration. By the use of the interrelated displacement-rotation interpolations, QCCP-2 is capable of automatically satisfying the Kirchhoff assumption for the case of thin plates. Consequently, QCCP-2 is not only free of shear locking, but also free from the numerical ill-conditioning. Furthermore, QCCP-2 passes the patch test of thin plates. The four-node quadrilateral C0 elements presented here can automatically reduce to the corresponding three-node triangular elements. Several numerical examples are given to demonstrate the efficiency and accuracy of the C0 plate bending element QCCP-2.
    Additional Material: 5 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
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 31 (1991), S. 1249-1252 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 32 (1991), S. 1189-1203 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The severe restrictions of the Babuška-Brezzi stability criteria permit only a limited number of interpolations for velocities (displacements) and pressure to be used for incompressible behaviour. These restrictions preclude the use of many useful elements. We show in this paper how such difficulties can be side-stepped by seeking the steady state solution through the use of various time marching schemes. This permits a simple iterative approach to incompressible (or nearly incompressible) problems of fluid mechanics or solid mechanics and provides a stimulus for the use of such procedures in metal forming flow, etc.
    Additional Material: 5 Ill.
    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...