Bibliothek

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 2000-2004  (56)
  • 1990-1994  (10.409)
  • 1985-1989
  • 1980-1984
  • 1970-1974
  • 1950-1954  (5.692)
  • 1900-1904
  • 1880-1889
  • 1860-1869
  • 2002  (56)
  • 1990  (10.409)
  • 1954  (2.016)
  • 1953  (1.822)
  • 1950  (1.854)
  • Chemistry  (15.383)
  • Organic Chemistry  (2.123)
  • Chemical Engineering  (674)
  • Engineering  (558)
  • Engineering General  (524)
  • ddc:000
Materialart
Erscheinungszeitraum
  • 2000-2004  (56)
  • 1990-1994  (10.409)
  • 1985-1989
  • 1980-1984
  • 1970-1974
  • +
Jahr
Schlagwörter
Sprache
  • 1
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: Zeitschriften und andere Medien werden in wachsendem Maße elektronisch publiziert. Hier entsteht für die Bibliotheken, welche diese Online-Publikationen ihren Lesern zur Verfügung stellen, ein neuer Bereich der Informationsvermittlung. Mit dem aufkommenden Standard der OpenURL ergeben sich neue Möglichkeiten, dem Benutzer weiterführende Links und Dienste anzubieten. Das Document-Linking-System SFX der Firma Ex Libris ist die erste und bekannteste Anwendung, die ein Managementsystem fr die Auswertung der OpenURL implementiert. Im Rahmen eines Projektes hat die Zentrale des Kooperativen Bibliotheksverbundes Berlin-Brandenburg (KOBV) eine Evaluation von SFX durchgeführt. Als Ergebnis der Evaluation sollten Einsatzmöglichkeiten von SFX für die KOBV-Suchmaschine und in den lokalen Bibliothekssystemen und Informationsportalen aufgezeigt werden. Im Verlauf des Projektes hat sich das Produkt SFX als eine stabile Anwendung erwiesen, die dem Benutzer interessante zusätzliche Dienste bieten kann.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Publikationsdatum: 2014-02-26
    Beschreibung: In this work we present an approach for the sensitivity analysis of linearly-implicit differential-algebraic equation systems. Solutions for both, states and sensitivities are obtained by applying an extrapolated linearly implicit Euler discretization scheme. This approach is compared to the widely used sensitivity extensions of multi-step BDF methods by means of case studies. Especially, we point out the benefit of this method in the context of dynamic optimization using the sequential approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Publikationsdatum: 2014-09-30
    Beschreibung: Decomposition of the high dimensional conformational space of bio-molecules into metastable subsets is used for data reduction of long molecular trajectories in order to facilitate chemical analysis and to improve convergence of simulations within these subsets. The metastability is identified by the Perron-cluster cluster analysis of a Markov process that generates the thermodynamic distribution. A necessary prerequisite of this analysis is the discretization of the conformational space. A combinatorial approach via discretization of each degree of freedom will end in the so called ''curse of dimension''. In the following paper we analyze Hybrid Monte Carlo simulations of small, drug-like biomolecules and focus on the dihedral degrees of freedom as indicators of conformational changes. To avoid the ''curse of dimension'', the projection of the underlying Markov operator on each dihedral is analyzed according to its metastability. In each decomposition step of a recursive procedure, those significant dihedrals, which indicate high metastability, are used for further decomposition. The procedure is introduced as part of a hierarchical protocol of simulations at different temperatures. The convergence of simulations within metastable subsets is used as an ''a posteriori'' criterion for a successful identification of metastability. All results are presented with the visualization program AmiraMol.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2019-05-10
    Beschreibung: The adaptive finite element code {\sc Kardos} solves nonlinear parabolic systems of partial differential equations. It is applied to a wide range of problems from physics, chemistry, and engineering in one, two, or three space dimensions. The implementation is based on the programming language C. Adaptive finite element techniques are employed to provide solvers of optimal complexity. This implies a posteriori error estimation, local mesh refinement, and preconditioning of linear systems. Linearely implicit time integrators of {\em Rosenbrock} type allow for controlling the time steps adaptively and for solving nonlinear problems without using {\em Newton's} iterations. The program has proved to be robust and reliable. The user's guide explains all details a user of {\sc Kardos} has to consider: the description of the partial differential equations with their boundary and initial conditions, the triangulation of the domain, and the setting of parameters controlling the numerical algorithm. A couple of examples makes familiar to problems which were treated with {\sc Kardos}. We are extending this guide continuously. The latest version is available by network: {\begin{rawhtml} 〈A href="http://www.zib.de/Numerik/software/kardos/"〉 〈i〉 Downloads.〈/i〉〈/a〉 \end{rawhtml}}
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Publikationsdatum: 2016-06-09
    Beschreibung: This article studies the relation of the two scientific languages Chemistry and Mathematics via three selected comparisons: (a) QSSA versus dynamic ILDM in reaction kinetics, (b) lumping versus discrete Galerkin methods in polymer chemistry, and (c) geometrical conformations versus metastable conformations in drug design. The common clear message from these comparisons is that chemical intuition may pave the way for mathematical concepts just as chemical concepts may gain from mathematical precisioning. Along this line, significant improvements in chemical research and engineering have already been possible -- and can be further expected in the future from the dialogue between the two scientific languages.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Publikationsdatum: 2014-11-10
    Beschreibung: Several sets of reductions rules are known for preprocessing a graph when computing its treewidth. In this paper, we give reduction rules for a weighted variant of treewidth, motivated by the analysis of algorithms for probabilistic networks. We present two general reduction rules that are safe for weighted treewidth. They generalise many of the existing reduction rules for treewidth. Experimental results show that these reduction rules can significantly reduce the problem size for several instances of real-life probabilistic networks.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Publikationsdatum: 2014-02-26
    Beschreibung: Signaling is crucial to the operation of modern telecommunication networks. A breakdown in the signaling infrastructure typically causes customer service failures, incurs revenue losses, and hampers the company image. Therefore, the signaling network has to be highest reliability and survivability. This in particular holds for the routers in such a network, called \textit{signaling transfer points\/} (STPs). The robustness of an STP can be improved by equally distributing the load over the internal processing units. Several constraints have to be taken into account. The load of the links connected to a processing unit changes over time introducing an imbalance of the load. In this paper, we show how integer linear programming can be applied to reduce the imbalance within an STP, while keeping the number of changes small. Two alternative models are presented. Computational experiments validate the integer programming approach in practice. The GSM network operator E-Plus saves substantial amounts of time and money by employing the proposed approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2019-10-24
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: annualzib , doc-type:report
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Publikationsdatum: 2020-11-13
    Beschreibung: In the problem of \emph{Online Call Admission in Optical Networks}, briefly called \textsc{oca}, we are given a graph $G=(V,E)$ together with a set of wavelengths~$W$ and a finite sequence $\sigma=r_1,r_2,\dots$ of calls which arrive in an online fashion. Each call~$r_j$ specifies a pair of nodes to be connected and an integral demand indicating the number of required lightpaths. A lightpath is a path in~$G$ together with a wavelength~$\lambda \in W$. Upon arrival of a call, an online algorithm must decide immediately and irrevocably whether to accept or to reject the call without any knowledge of calls which appear later in the sequence. If the call is accepted, the algorithm must provide the requested number of lightpaths to connect the specified nodes. The essential restriction is the wavelength conflict constraint: each wavelength is available only once per edge, which implies that two lightpaths sharing an edge must have different wavelengths. Each accepted call contributes a benefit equal to its demand to the overall profit. The objective in \textsc{oca} is to maximize the overall profit. Competitive algorithms for \textsc{oca} have been known for the special case where every call requests just a single lightpath. In this paper we present the first competitive online algorithms for the general case of larger demands.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2020-11-13
    Beschreibung: Traditional optimization techniques assume, in general, knowledge of all data of a problem instance. There are many cases in practice, however, where decisions have to be made before complete information about the data is available. In fact, it may be necessary to produce a part of the problem solution as soon as a new piece of information becomes known. This is called an \emph{online situation}, and an algorithm is termed \emph{online}, if it makes a decision (computes a partial solution) whenever a new piece of data requests an action. \emph{Competitive analysis} has become a standard yardstick to measure the quality of online algorithms. One compares the solution produced by an online algorithm to that of an optimal (clairvoyant) offline algorithm. An online algorithm is called $c$-competitive if on every input the solution it produces has cost'' at most $c$~times that of the optimal offline algorithm. This situation can be imagined as a game between an online player and a malicious adversary. Although competitive analysis is a worst-case analysis and henceforth pessimistic, it often allows important insights into the problem structure. One can obtain an idea about what kind of strategies are promising for real-world systems and why. On the other hand there are also cases where the offline adversary is simply too powerful and allows only trivial competitiveness results. This phenomenon is called hitting the triviality barrier''. We investigate several online problems by means of competitive analysis. We also introduce new concepts to overcome the weaknesses of the standard approach and to go beyond the triviality barrier.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper deals with the two-class priority M/M/1 system, where the prioritized class-1 customers are served under FCFS preemptive resume discipline and may become impatient during their waiting for service with generally distributed maximal waiting times but finite expectation. The class-2 customers have no impatience. The required mean service times may depend on the class of the customer. As the dynamics of class-1 customers are related to the well analyzed M/M/1+GI system, our aim is to derive characteristics for class-2 customers and for the whole system. The solution of the balance equations for the partial probability generating functions of the detailed system state process is given in terms of the weak solution of a family of boundary value problems for ordinary differential equations. By means of this solution formulae for the joint occupancy distribution and for the sojourn and waiting times of class-2 customers are derived generalizing results recently obtained by Choi et al. in case of deterministic maximal waiting times. For deterministic maximal waiting times partially new explicit formulae are given.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Publikationsdatum: 2016-06-09
    Beschreibung: The bio-heat transfer equation is a macroscopic model for describing the heat transfer in microvascular tissue. So far the deduction of the Helmholtz term in the bio-heat transfer equation is not co role. In view of a future numerical application of this new mathematical model to treatment planning in hyperthermia we derive asymptotic estimates for first and second order correctors.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Publikationsdatum: 2021-08-05
    Beschreibung: Mixed integer programs ($MIPs$) are commonly solved with branch and bound algorithms based on linear programming. The success and the speed of the algorithm strongly depends on the strategy used to select the branching variables. Today's state-of-the-art strategy is called \emph{pseudocost branching} and uses information of previous branchings to determine the current branching. We propose a modification of \emph{pseudocost branching} which we call \emph{history branching}. This strategy has been implemented in $SIP$, a state-of-the-art $MIP$ solver. We give computational results that show the superiority of the new strategy.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Publikationsdatum: 2020-11-13
    Beschreibung: We consider the design of transparent optical networks from a practical perspective. Network operators aim at satisfying the communication demands at minimum cost. Such an optimization involves three interdependent planning issues: the dimensioning of the physical topology, the routing of lightpaths, and the wavelength assignment. Further topics include the reliability of the configuration and sparse wavelength conversion for efficient use of the capacities. In this paper, we investigate this extensive optical network design task. Using a flexible device-based model, we present an integer programming formulation that supports greenfield planning as well as expansion planning on top of an existing network. As solution method, we propose a suitable decomposition approach that separates the wavelength assignment from the dimensioning and routing. Our method in particular provides a lower bound on the total cost which allows to rate the solution quality. Computational experiments on realistic networks approve the solution approach to be appropriate.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Publikationsdatum: 2020-11-13
    Beschreibung: Today's telecommunication networks are configured statically. Whenever a connection is established, the customer has permanent access to it. However, it is observed that usually the connection is not used continuously. At this point, dynamic provisioning could increase the utilization of network resources. WDM based Optical Transport Networks (OTNs) will shortly allow for fast dynamic network reconfiguration. This enables optical broadband leased line services on demand. Since service requests competing for network resources may lead to service blocking, it is vital to use appropriate strategies for routing and wavelength assignment in transparent optical networks. We simulate the service blocking probabilities of various dynamic algorithms for this problem using a well-founded traffic model for two realistic networks. One of the algorithms using shortest path routings performs best on all instances. Surprisingly, the tie-breaking rule between equally short paths in different wavelengths decides between success or failure.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Publikationsdatum: 2020-11-13
    Beschreibung: Nachdem mit der KOBV-Suchmaschine die Online-Recherche in den wichtigsten Berliner und Brandenburgischen Bibliotheken realisiert ist, gehört der Aufbau der Online-Fernleihe als einer neuen, nutzerfreundlichen Dienstleistung zu den drängendsten Desideraten des KOBV. Dem Nutzer soll ein komfortabler Service geboten werden, der ihm im Anschluss an eine erfolgreiche Recherche die nahtlose - per Knopfdruck ausgelöste - Fernleih-Bestellung auf das gewünschte Medium erlaubt. Gleichzeitig trägt die Ablösung des traditionellen, per Post und Bücherauto versandten Roten Fernleihscheines durch eine sekundenschnelle Online-Kommunikation zu einer erheblichen Beschleunigung des Fernleih-Verfahrens bei. Der KOBV beteiligt sich an der Initiative der deutschen Bibliotheksverbünde zur Automatisierung und Beschleunigung der Fernleihe. Die Realisierung soll im KOBV in einem zweistufigen Verfahren erfolgen: (1) verbundinterne Fernleihe im KOBV und (2) verbundübergreifende Fernleihe in der Zusammenarbeit mit den anderen Verbünden. Eine Verbund-Fernleih-Software für den KOBV muss insbesondere den KOBV-spezifischen Gegebenheiten genügen, die in dieser Form in den anderen deutschen Verbünden nicht anzutreffen sind. Im Jahre 2001 hat eine KOBV-Arbeitsgruppe Spezifikationen für eine Verbund-Fernleih-Software erarbeitet, in der die Besonderheiten des KOBV mit berücksichtigt sind. Beim Aufbau der automatisierten Fernleihe als einer regulären KOBV-Dienstleistung geht es nicht allein darum, einen schnellen, komfortablen Service für Nutzer einzurichten, sondern darüber hinaus um eine weitreichende Rationalisierung innerhalb der Bibliotheken. Das vorliegende Spezifikationspapier zielt auf beide Faktoren ab, indem es die Fernleihe als integrierten Dienst entwirft, der von der Bestellung bis zur Bereitstellung des Mediums in der gebenden Bibliothek automatisiert - ohne manuelles Eingreifen der Fernleihstelle - abläuft: die jetzige manuell durchgeführte Fernleihe wird durch die automatisierte Fernleihe abgelöst.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Publikationsdatum: 2020-12-14
    Beschreibung: In the online traveling salesman problem $OLTSP$ requests for visits to cities arrive online while the salesman is traveling. We study the $F{\_max}-OLTSP$ where the objective is to minimize the maximum flow time. This objective is particularly interesting for applications. Unfortunately, there can be no competitive algorithm, neither deterministic nor randomized. Hence, competitive analysis fails to distinguish online algorithms. Not even resource augmentation which is helpful in scheduling works as a remedy. This unsatisfactory situation motivates the search for alternative analysis methods. We introduce a natural restriction on the adversary for the $F{\_max}-OLTSP$ on the real line. A \emph{non-abusive adversary} may only move in a direction if there are yet unserved requests on this side. Our main result is an algorithm which achieves a constant competitive ratio against the non-abusive adversary.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Publikationsdatum: 2016-06-30
    Beschreibung: While attribute-value pairs are a popular method to name objects, information retrieval from those attribute-based namespaces is not an easy task. The user has to recall correct attribute names and values and master the syntax and semantics of query formulation. This paper describes hierarchical structures in attribute-based namespaces, shows how to extract them efficiently and evaluates the quality of these structures in an user experiment. It proposes an user interface for browsing attribute-named object sets which makes this task resemble todays file-system browsers and compares the usability of this interface to normal form-based methods in an user study.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper, we quantify and discuss the physical and surface chemical processes leading to the formation, temporal evolution and sedimentation of dust grains in brown dwarf and giant gas planet atmospheres: nucleation, growth, evaporation and gravitational settling. Considering dust particles of arbitrary sizes in the different hydrodynamical regimes (free molecular flow, laminar flow, turbulent flow), we evaluate the equilibrium drift velocities (final fall speeds) and the growth rates of the particles due to accretion of molecules. We show that a depth-dependent maximum size of the order of $a_{\rm max}\!\approx\!1\,\mu{\rm m\,(upper\ regions)} \ldots 100\,\mu{\rm m\,(lower\ regions)}$ exists, which depends on the condensate and the stellar parameters, beyond which gravitational settling is faster than growth. Larger particles can probably not be formed and sustained in brown dwarf atmospheres. We furthermore argue that the acceleration towards equilibrium drift is always very fast and that the temperature increase of the grains due to the release of latent heat during the growth process is negligible. Based on these findings, we formulate the problem of dust formation coupled to the local element depletion/enrichment of the gas in brown dwarf atmospheres by means of a system of partial differential equations. These equations state an extension of the moment method developed by Gail\plus Sedlmayr\,(1988) with an additional advective term to account for the effect of size-dependent drift velocities of the grains. A dimensionless analysis of the new equations reveals a hierarchy of nucleation $\to$ growth $\to$ drift $\to$ evaporation, which characterises the life cycle of dust grains in brown dwarf atmospheres. The developed moment equations can be included into hydrodynamics or classical stellar atmosphere models. Applications of this description will be presented in a forthcoming paper of this series.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Publikationsdatum: 2021-01-21
    Beschreibung: Global grid environments do not only provide massive aggregated computing power but also an unprecedented amount of distributed storage space. Unfortunately, dynamic changes caused by component failures, local decisions, and irregular data updates make it difficult to efficiently use this capacity. In this paper, we address the problem of improving data availability in the presence of unreliable components. We present an analytical model for determining an optimal combination of distributed replica catalogs, catalog sizes, and replica servers. Empirical simulation results confirm the accuracy of our theoretical analysis. Our model captures the characteristics of highly dynamic environments like peer-to-peer networks, but it can also be applied to more centralized, less dynamic grid environments like the European {\em DataGrid}.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    Publikationsdatum: 2021-01-22
    Beschreibung: Das Management von großen Datenmengen spielt eine immer wichtigere Rolle, wie aktuelle Entwicklungen in der Hochenergiephysik [2] zeigen. Für das DataGrid-Projekt zum Beispiel ist es notwendig, große Datenmengen auf mehrere Rechenzentren in Europa zu verteilen und die Daten untereinander zu synchronisieren. Auch innerhalb von Clustern gewinnen mit zunehmender Anzahl der Knoten Werkzeuge zur effizienten Synchronisation und Verteilung von Daten an Bedeutung. Im Rahmen dieser Arbeit wurde ein effizientes Verfahren zur Synchronisation von verteilten Verzeichnisstrukturen entwickelt und implementiert. Mit diesem Verfahren ist es möglich, unabhängige Änderungen an beliebigen Repositories gleichzeitig durchzuführen. Das Verfahren benötigt keine zentrale Instanz, wodurch eine gegenüber vielen existierenden Verfahren verbesserte Skalierbarkeit erreicht werden konnte. Dabei wurden Erkenntnisse aus der Graphentheorie eingesetzt und weiterentwickelt, um die Netzwerktopolo-gie und -handbreiten zwischen den Rechnern zu berücksichtigen. Durch die Verwendung einer Offline-Synchronisation werden Änderungen erst dann an andere Rechner propagiert, wenn der Nutzer dies anstößt. Das kann zum Beispiel nach einer abgeschlossenen Transaktion, die Änderungen an mehreren Dateien beinhaltet, angemessen sein.
    Beschreibung: Current developments in high energy physics [2] show that the management of large datasets plays an important role. For the DataGrid project it is necessary to distribute large datasets over several computing centers all over Europe and to synchronize these datasets. Within clusters tools for efficient synchronization and distribution of data become more important, too. In this thesis, a method to synchronize distributed directory structures was developed and implemented which makes it possible to perform independent changes to arbitrary repositories simultaneously. This method needs no central instance and therefore the presented system achieves a better scalability than many existing systems. Knowledge from graph theory was used and improved to take the network topology and the network bandwidth between the computers into account. By using offline synchronization, changes will only be propagated when the user initiates it. This can be reasonable after a completed transaction which consists of changes on several files.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Publikationsdatum: 2020-11-17
    Beschreibung: An instance of the \emph{maximum coverage} problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground elements is specified by the nodes of a graph, while the family of covering sets is restricted to connected subgraphs. We show that on general graphs the problem is polynomial time solvable if restricted to sets of size at most~$2$, but becomes NP-hard if sets of size~$3$ are permitted. On trees, we prove polynomial time solvability if each node appears in a fixed number of sets. In contrast, if vertices are allowed to appear an unbounded number of times, the problem is NP-hard even on stars. We finally give polynomial time algorithms for special cases where the subgraphs form paths and the host graph is a line, a cycle or a star.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: Hinter der für den Uneingeweihten etwas kryptischen Frage "P = NP?" verbirgt sich das derzeit wichtigste Problem der Komplexitätstheorie. Dieser Artikel erläutert einige Aspekte der Theorie und erklärt informell, was "P = NP?" bedeutet. Es geht nicht nur um komplizierte algorithmische Mathematik und Informatik, sondern um grundsätzliche Fragen unserer Lebensumwelt. Kann man vielleicht beweisen, dass es für viele Probleme unseres Alltags keine effizienten Lösungsmethoden gibt?
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Publikationsdatum: 2020-03-11
    Beschreibung: The Cooperative Library Network Berlin-Brandenburg (KOBV) has set the development of a genuine library information portal for the two German Lander (federal states) Berlin and Brandenburg as its main task for the next years. This joined effort is driven by the vision of an user friendly Internet information portal which is accessible anytime, from anywhere in the world. The idea of a regional information portal can be understood as the logically consistent development of the basic ideas of the KOBV. Starting in 1997, the consortia has set the implementation of a virtual OPAC instead of a physical union catalogue as its goal. The result was the KOBV-Search Engine which already has some qualities of a portal itself. The paper begins with initial remarks about the German library world, which do form the background for the project and its initiator - the KOBV consortia. After this preliminary part, different types of portals are introduced. The basic features of the KOBV-Search Engine as one of the cornerstones of the future portal are discussed in the following. The information portal will be much richer in content and services for the end-user. Two aspects are focused on in more detail: the presentation of resources, which becomes a compelling requirement because of the broader range of content and the personalization of services, as one important feature to suit user's individual needs.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 25
    Publikationsdatum: 2019-01-29
    Beschreibung: The paper presents a particle method framework for resolving molecular dynamics. Error estimators for both the temporal and spatial discretization are advocated and facilitate a fully adaptive propagation. For time integration, the implicit trapezoidal rule is employed, where an explicit predictor enables large time steps. The framework is developed and exemplified in the context of the classical Liouville equation, where Gaussian phase-space packets are used as particles. Simplified variants are discussed shortly, which should prove to be easily implementable in common molecular dynamics codes. A concept is illustrated by numerical examples for one-dimensional dynamics in double well potential.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 26
    Publikationsdatum: 2019-01-29
    Beschreibung: The paper deals with three different Newton algorithms that have recently been worked out in the general frame of affine invariance. Of particular interest is their performance in the numerical solution of discretized boundary value problems (BVPs) for nonlinear partial differential equations (PDEs). Exact Newton methods, where the arising linear systems are solved by direct elimination, and inexact Newton methods, where an inner iteration is used instead, are synoptically presented, both in affine invariant convergence theory and in numerical experiments. The three types of algorithms are: (a) affine covariant (formerly just called affine invariant) Newton algorithms, oriented toward the iterative errors, (b) affine contravariant Newton algorithms, based on iterative residual norms, and (c) affine conjugate Newton algorithms for convex optimization problems and discrete nonlinear elliptic PDEs.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 27
    Publikationsdatum: 2014-02-26
    Beschreibung: In Analogie zu den Elektrizitätsnetzen electricity grid), von denen die technische Revolution ausging, wurde der Begriff Computational Grid (kurz Grid) geprägt. Ein wichtiger Bestandteil des Systems liegt im benutzerfreundlichen Zugang und der koordinierten Nutzung der weltweit verteilten Speicherressourcen und Rechnerkapazitäten. Bei der Entwicklung dazu notwendiger Technologien und Software (Middleware) profitiert man von Kenntnissen und Erfahrungen bei der Entwicklung verteilter Algorithmen, dem Software-Engineering und dem Supercomputing.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 28
    Publikationsdatum: 2020-02-11
    Beschreibung: In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the demands between them, the possible connections and hardware configurations, and various other technical and administrational constraints, the goal is to decide, which node is assigned to which network level, how the nodes are connected, what hardware must be installed, and how traffic is routed in the backbone. Mixed integer linear programming models and solution methods are presented for both the access and the backbone network design problem. The focus is on the design of IP-over-SDH networks, but the access network design model and large parts of the backbone network design models are general and also applicable for other types of communication networks. Results obtained with these methods in the planning of the German research network are presented.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 29
    Publikationsdatum: 2021-02-19
    Beschreibung: We present an online algorithm for a real-world vehicle dispatching problem at ADAC, the German Automobile Association.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 30
    Publikationsdatum: 2020-03-11
    Beschreibung: Eine fremddatengestützte Katalogisierung bedeutet für die einzelne Bibliothek unbestritten eine Zeit- und Kostenersparnis. Dieser Report beleuchtet die unterschiedlichen Faktoren technischer und organisatorischer Natur, die die Fremddatennutzung in der dezentralen Struktur des Kooperativen Bibliotheksverbundes Berlin-Brandenburg (KOBV) beeinflussen. Die Ausführungen stützen sich im Wesentlichen auf eine Umfrage, die die Autoren im Mai / Juni 2002 unter KOBV-Mitgliedsbibliotheken zum Thema Fremddatennutzung durchgeführt haben. Dargelegt wird, wie komfortabel die in den KOBV-Bibliotheken eingesetzten Bibliotheksinformationssysteme eine fremddatengestützte Katalogisierung erlauben. Diskutiert wird zudem die Software ZACK, die sich als Alternative zu einem eigenen Z39.50-Client zur Datenübernahme anbietet. Erstmals seit Bestehen des Verbundes werden Zahlen veröffentlicht über den Anteil der Bibliotheken, die Fremddaten nutzen und denjenigen, die dieses Angebot nicht wahrnehmen. Dabei wird die Fremddatenutzung differenziert sowohl für den Bereich der Neuaufnahmen als auch für die Retrokatalogisierung. In der weiteren Analyse werden zusätzliche Aspekte betrachtet wie z.B. die verfügbaren bzw. gewünschten Datenbanken im Verhältnis zum sprachlichen Spektrum des erworbenen Katalogisierungsgutes. Eingegangen wird auch auf die von den Bibliotheken genannten Hauptproblemen und die gewünschten zusätzlichen Serviceleistungen auf Seiten der KOBV-Verbundzentrale. Als Ergebnis dieses Status-Quo-Berichts legt das Autorenteam eine Reihe von Empfehlungen vor, die darauf abzielen, auch für KOBV-Bibliotheken in Zukunft eine Fremddatennutzungsquote von 70 - 75 % zu erreichen.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 31
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: Substellar atmospheres are cool and dense enough that dust forms very efficiently. As soon as these particles are formed, they sizedependently precipitate due to the large gravity of the objects. Arriving in hot atmospheric layers, the dust evaporates and enriches the gas by those elements from which it has formed. The upper atmospheric layers are depleted by the same elements. Non-continuous and spatially inhomogeneous convective element replenishment, generating a turbulent fluid field, completes the circuit of dust. The formation of dust in substellar atmosphere is described by extending the classical theory of Gail\plus Sedlmayr for the case of different gas and dust velocities. Turbulence is modeled in different scale regimes which reveals turbulence as trigger for dust formation in hot environments. Both mechanisms cause the dust to be present in else wise dust-hostile region: precipitation transports the dust into hot regions, and turbulence allows the formation of dust in there.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 32
    Publikationsdatum: 2014-02-26
    Beschreibung: The talk given by the author at the CRM workshop on Superintegrability in Sep.\ 2002 and this related paper report on work in two subjects. One is the collaboration with Vladimir Sokolov and Takayuki Tsuchida in an effort to classify polynomial integrable vector evolution equations. The other is the computer algebra package {\sc Crack} which did the main computations in solving large bi-linear algebraic systems. Although originally designed to solve over-determined systems of partial differential equations a number of extensions made {\sc Crack} a powerful tool for solving systems of bi-linear algebraic equations. Such systems turn up in many different classification problems some of which were investigated by other participants of this workshop. Two additional applications are outlined. In the talk on which this article is based a method to reduce the length of equations was presented which proved to be useful in solving the bi-linear algebraic systems. Due to numerous asked questions about the computer program, a more complete overview is given in the appendix.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 33
    Publikationsdatum: 2020-11-13
    Beschreibung: Die KOBV-Suchmaschine hat seit ihrer Inbetriebnahme Ende 1999 entscheidend zur Verbesserung der Informationsinfrastruktur in Berlin und Brandenburg beigetragen. Auf der Basis der offenen Plattform KOBV-Suchmaschine wird die KOBV-Zentrale gemeinsam mit den Bibliotheken in den nächsten Jahren das Dienstleistungsangebot des KOBV und seiner Bibliotheken kontinuierlich erweitern. Dabei sollen die Prinzipien des KOBV - Offenheit, Heterogenität und Dezentralität auf technischer und organisatorischer Ebene - gewahrt bleiben. Die einzelnen KOBV-Bibliotheken werden sich mit ihren Angeboten in unterschiedlicher Weise im Web positionieren. Die Integration auf regionaler Ebene kann und soll die lokalen Angebote nicht künstlich vereinheitlichen. Das kooperative Portal, das in der Region aufgebaut wird, ist als System geplant, in dem zentrales Portal und lokale Portale nicht hierarchisch einander zugeordnet, sondern miteinander vernetzt sind. Das \glqq KOBV-Informationsportal \grqq soll in der KOBV-Zentrale im Rahmen eines wissenschaftlichen Projektes von Mitte 2001 bis Ende 2003 aufgebaut werden. Das vorliegende Papier gibt einen ersten allgemeinen Einblick, welche Funktionen das \glqq KOBV-Informationsporta \grqq umfassen soll und stellt die Teilprojekte der 1. Stufe vor.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 34
    Publikationsdatum: 2014-11-10
    Beschreibung: Oriented matroids are combinatorial structures that encode the combinatorics of point configurations. The set of all triangulations of a point configuration depends only on its oriented matroid. We survey the most important ingredients necessary to exploit oriented matroids as a data structure for computing all triangulations of a point configuration, and report on experience with an implementation of these concepts in the software package TOPCOM. Next, we briefly overview the construction and an application of the secondary polytope of a point configuration, and calculate some examples illustrating how our tools were integrated into the {\sc polymake} framework.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 35
    Publikationsdatum: 2014-11-10
    Beschreibung: For all perfect graphs, the stable set polytope STAB$(G)$ coincides with the fractional stable set polytope QSTAB$(G)$, whereas STAB$(G) \subset$ QSTAB$(G)$ holds iff $G$ is imperfect. Padberg asked in the early seventies for ``almost'' perfect graphs. He characterized those graphs for which the difference between STAB$(G)$ and QSTAB$(G)$ is smallest possible. We develop this idea further and define three polytopes between STAB$(G)$ and QSTAB$(G)$ by allowing certain sets of cutting planes only to cut off all the fractional vertices of QSTAB$(G)$. The difference between QSTAB$(G)$ and the largest of the three polytopes coinciding with STAB$(G)$ gives some information on the stage of imperfectness of the graph~$G$. We obtain a nested collection of three superclasses of perfect graphs and survey which graphs are known to belong to one of those three superclasses. This answers the question: which graphs are ``almost'' perfect?
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 36
    Publikationsdatum: 2020-11-13
    Beschreibung: Die Automatisierung von innerbetrieblicher Logistik erfordert -- über die physikalische Steuerung von Geräten hinaus -- auch eine effiziente Organisation der Transporte: ein Aufgabenfeld der kombinatorischen Optimierung. Dieser Artikel illustriert anhand von konkreten Aufgabenstellungen die Online-Problematik (unvollständiges Wissen) sowie die Echtzeit-Problematik (beschränkte Rechenzeit), auf die man in der innerbetrieblichen Logistik trifft. Der Text gibt einen Überblick über allgemeine Konstruktionsprinzipien für Online-Algorithmen und Bewertungsmethoden, die bei der Entscheidung helfen, welche Algorithmen für eine vorliegende Problemstellung geeignet sind.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 37
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-11-10
    Beschreibung: \We discuss a nested collection of three superclasses of perfect graphs: near-perfect, rank-perfect, and weakly rank-perfect graphs. For that, we start with the description of the stable set polytope for perfect graphs and allow stepwise more general facets for the stable set polytopes of the graphs in each superclass. Membership in those three classes indicates how far a graph is away from being perfect. We investigate for webs and antiwebs to which of the three classes they belong. We provide a complete description of the facets of the stable set polytope for antiwebs (with help of a result due to Shepherd on near-bipartite graphs). The main result is that antiwebs are rankperfect.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 38
    Publikationsdatum: 2021-01-21
    Beschreibung: \textsf{\itshape{GuiGen}} is a comprehensive set of tools for creating customized graphical user interfaces (GUIs). It draws from the concept of computing portals, which are here seen as interfaces to application-specific computing services for user communities. While \textsf{\itshape{GuiGen}} was originally designed for the use in computational grids, it can be used in client/server environments as well. Compared to other GUI generators, \textsf{\itshape{GuiGen}} is more versatile and more portable. It can be employed in many different application domains and on different target platforms. With \textsf{\itshape{GuiGen}}, application experts (rather than computer scientists) are able to create their own individually tailored GUIs.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 39
    Publikationsdatum: 2014-02-26
    Beschreibung: The purpose of the paper is to formulate and use syzygies for systems of linear PDEs. The computation of an equivalent of a GCD for linear partial differential operators will save us their factorization which is otherwise only possible algorithmically in special cases. After showing the computation with the new and the traditional method and comparing both in the next three sections, the algorithm is explained in general and an overview is given.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 40
    Publikationsdatum: 2020-11-13
    Beschreibung: Telekommunikation ist seit Jahren \glqq in\grqq. Zunächst gab es einen enormen Aufschwung; neue Technologien und Dienste haben eine überwältigende, nicht vorhersehbare Akzeptanz gefunden. Derzeit ist -- ausgelöst durch die UMTS-Lizenzversteigerungen, Rezessions- und Sättigungstendenzen -- eine Krise zu verzeichnen. Viele (auch wir) sind davon überzeugt, dass technischer Fortschritt und nützliche Dienste demnächst die Stimmung wieder ändern werden. Wenigen ist allerdings bewusst, welche Rolle Mathematik bei der Entwicklung und dem effizienten Einsatz vieler der neuen Kommunikationstechnologien spielt. In diesem Artikel soll kein Überblick über diesen umfangreichen Themenkreis gegeben werden. Wir zeigen lediglich an einem konkreten Beispiel aus dem Mobilfunk, der Frequenzplanung in GSM-Funknetzen, was man durch geeignete Modellierung der praktischen Fragestellung und den Einsatz problemadäquater Algorithmen erreichen kann.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 41
    Publikationsdatum: 2020-03-09
    Beschreibung: Wir beschreiben einen Ansatz zur integrierten Umlauf- und Dienstplanung im öffentlichen Nahverkehr. Der Ansatz zielt auf die Verbesserung des Gesamtwirkungsgrades dieser beiden Planungsschritte und auf die besondere Planungsproblematik im Regionalverkehr. Wir entwickeln dazu mathematische Optimierungstechniken für den Einsatz in den Planungssystemen MICROBUS II und DIVA.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 42
    Publikationsdatum: 2014-02-26
    Beschreibung: A graph property is called elusive (or evasive) if every algorithm for testing this property has to read in the worst case $n\choose 2$ entries of the adjacency matrix of the given graph. Several graph properties have been shown to be elusive, e.g. planarity (Best et al) or $k$-colorability (Bollobas). A famous conjecture of Karp says that every non-trivial monotone graph property is elusive. We prove that a non-monotone but hereditary graph property is elusive: perfectness.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 43
    Publikationsdatum: 2014-02-26
    Beschreibung: Recently, a novel approach for the analysis of molecular dynamics on the basis of a transfer operator has been introduced. Therein conformations are considered to be disjoint metastable clusters within position space of a molecule. These clusters are defined by almost invariant characteristic functions that can be computed via {\em Perron Cluster} analysis. The present paper suggests to replace crisp clusters with {\em fuzzy} clusters, i.e. to replace characteristic functions with membership functions. This allows a more sufficient characterization of transiton states between different confor conformations and therefore leads to a better understanding of molecular dynamics. Fur thermore, an indicator for the uniqueness of metastable fuzzy clusters and a fast algorithm for the computation of these clusters are described. Numerical examples are included.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 44
    Publikationsdatum: 2019-01-29
    Beschreibung: The paper provides a detailed analysis of a short step interior point algorithm applied to linear control constrained optimal control problems. Using an affine invariant local norm and an inexact Newton corrector, the well-known convergence results from finite dimensional linear programming can be extended to the infinite dimensional setting of optimal control. The present work complements a recent paper of Weiser and Deuflhard, where convergence rates have not been derived. The choice of free parameters, i.e. the corrector accuracy and the number of corrector steps, is discussed.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 45
    Publikationsdatum: 2017-02-21
    Beschreibung: Pseudo--transient continuation methods are quite popular for the numerical solution of steady state problems, typically in PDEs. They are based on an embedding into a time dependent initial value problem. In the presence of dynamical invariants the Jacobian matrix of the nonlinear equation system is bound to be singular. The paper presents a convergence analysis which takes this property into account -- in contrast to known approaches. On the basis of the new analysis adaptive algorithms are suggested in detail. These include a variant with Jacobian approximations as well as inexact pseudo--transient continuation, both of which play an important role in discretized PDEs. Numerical experiments are left to future work.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 46
    Publikationsdatum: 2014-02-26
    Beschreibung: A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most $d(d+1)/2$ polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the 2- and 3-dimensional case we get the expected number $d(d+1)/2$.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 47
    Publikationsdatum: 2014-11-10
    Beschreibung: TOPCOM is a package for computing triangulations of point configurations and oriented matroids. For example, for a point configuration one can compute the chirotope, components of the flip graph of triangulations, enumerate all triangulations. The core algorithms implemented in TOPCOM are described, and implentation issues are discussed.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 48
    Publikationsdatum: 2020-11-13
    Beschreibung: A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 49
    Publikationsdatum: 2016-06-09
    Beschreibung: Computational drug design studies molecular recognition in the {\em virtual lab}. The arising Hamiltonian dynamics is known to be chaotic and ill-conditioned already after picoseconds, whereas times are $msec$ up to $min$. Classical molecular dynamics with long term trajectory computation gives, at best, information about time and statistical ensemble averages. The present paper surveys a recent new modeling approach called {\em conformational dynamics}, which is due to the author and Ch. Schütte. This approach achieves information about the dy time scales by telescoping a short term deterministic model with a statistical model. Examples of small biomolecules are included.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 50
    Publikationsdatum: 2021-02-19
    Beschreibung: Combinatorial online optimization is an area with lots of applications and potential for significant progress, both in theory and practice. In this short note we sketch the ADACproblem, a typical large-scale online optimization problem, discuss some theoretical and pratical issues coming up, and explain, very briefly, how we approach this problem mathematically. Online problems are a battlefield of heuristics with many strong claims about their solution quality. We indicate that a stronger problem orientation and the use of a little more mathematics may yield.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 51
    Publikationsdatum: 2014-02-26
    Beschreibung: A subset ${\cal C}$ of the power set of a finite set $E$ is called cardinality homogeneous if, whenever ${\cal C}$ contains some set $F$, ${\cal C}$ contains all subsets of $E$ of cardinality $|F|$. Examples of such set systems ${\cal C}$ are the sets of circuits and the sets of cycles of uniform matroids and the sets of all even or of all odd cardinality subsets of $E$. With each cardinality homogeneous set system ${\cal C}$, we associate the polytope $P({\cal C})$, the convex hull of the incidence vectors of all sets in ${\cal C}$, and provide a complete and nonredundant linear description of $P({\cal C})$. We show that a greedy algorithm optimizes any linear function over $P({\cal C})$, give an explicit optimum solution of the dual linear program, and provide a polynomial time separation algorithm for the class of polytopes of type $P({\cal C})$.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 52
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: Die Bibliotheken des KOBV haben im Jahr 2001 die Entwicklung der KOBV-Suchmaschine zu einem gemeinsamen Informationsportal Berlin-Brandenburg und den Aufbau lokaler Bibliotheksportale als Hauptentwicklungsziele des KOBV definiert. Diese Informationsportale sollen mit Standardsoftware realisiert werden. Um die Auswahl eines Systems zu unterstützen, wurde in der Zentrale des KOBV ausgewählte Systeme untersucht. In der Arbeit werden zahlreiche Kriterien vorgestellt, auf Grund derer die betreffenden Systeme beurteilt werden. Die Kriterien umfassen sowohl Aspekte aus der Sicht der Benutzer als auch Kriterien aus der Sicht der Betreiber eines solchen Systems. Wesentliche Funktionen und die Realisierung von verschiedenen Merkmalen werden im Bericht ausführlich beschrieben. Daneben liefert eine Tabelle mit allen betrachteten Kriterien eine Übersicht über vorhandene Merkmale und der Art der Realisierung.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 53
    Publikationsdatum: 2021-03-16
    Beschreibung: In the cake cutting problem, $n\ge2$ players want to cut a cake into $n$ pieces so that every player gets a ``fair'' share of the cake by his own measure. We describe a protocol with $n-1$~cuts in which each player can enforce to get a share of at least~$1/(2n-2)$. Moreover we show that no protocol with $n-1$~cuts can guarantee a better fraction.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 54
    Publikationsdatum: 2022-07-07
    Beschreibung: We present a new efficient algorithm for the solution of direct time-harmonic scattering problems based on the Laplace transform. This method does not rely on an explicit knowledge of a Green function or a series representation of the solution, and it can be used for the solution of problems with radially symmetric potentials and problems with waveguides. The starting point is an alternative characterization of outgoing waves called \emph{pole condition}, which is equivalent to Sommerfeld's radiation condition for problems with radially symmetric potentials. We obtain a new representation formula, which can be used for a numerical evaluation of the exterior field in a postprocessing step. Based on previous theoretical studies, we discuss the numerical realization of our algorithm and compare its performance to the PML method.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 55
    Publikationsdatum: 2022-07-07
    Beschreibung: The aim of this paper is to develop fast methods for the solution of nonlinear Schrödinger type equations in fiber optics. Using the method of lines we have to solve a stiff system of ordinary differential equations where the eigenvalues of the Jacobian are close to the imaginary axis. This is usually done by a Split Step method. Here we consider the extrapolation of Split Step methods with adaptive order and step size control. For more complicated nonlinearities, in particular stimulated Raman scattering, Split Step methods are less efficient since symmetry is either destroyed or requires much additional effort. In this case we use implicit Runge Kutta formulas of Gauß type. The key point for the efficient implementation of these methods is that the system of nonlinear algebraic equations can be solved without setting up the Jacobian. The proposed methods are compared to other methods, in particular exponential integrators, the method of Marcuse, and the method of Blow and Wood.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 56
    Publikationsdatum: 2022-07-07
    Beschreibung: The work presents a new approach to the numerical solution of time-harmonic and time-dependent scattering problems. We replace Sommerfeld's radiation condition valid for the Helmholtz equation by a more general concept called pole condition. The pole condition is based on the Laplace transform of the exterior solution and allows a characterization of outgoing waves. Both new insight into the analysis of scattering problems as well as new numerical algorithms are obtained.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 57
    Publikationsdatum: 2014-02-26
    Beschreibung: A family of secant methods based on general rank-1 updates has been revisited in view of the construction of iterative solvers for large non- Hermitian linear systems. As it turns out, both Broydens "good" and "bad" update techniques play a special role - but should be associated with two different line search principles. For Broydens "bad" update technique, a minimum residual principle is natural - thus making it theorectically comparable with a series of well-known algorithms like GMRES. Broydens "good" update technique, however, is shown to be naturally linked with a minimum "next correction" principle - which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized PDE's of convection diffusion type in 2-D with internal layers give a first impression of the possible power of the derived "good" Broyden variant. {\bf Key Words:} nonsymmetric linear system, secant method, rank-1 update, Broydens method, line search, GMRES. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 58
    Publikationsdatum: 2014-02-26
    Beschreibung: A new adaptive multilevel approach for parabolic PDE's is presented. Full adaptivity of the algorithm is realized by combining multilevel time discretization, better known as extrapolation methods, and multilevel finite element space discretization. In the theoretical part of the paper the existence of asymptotic expansions in terms of time-steps for single-step methods in Hilbert space is established. Finite element approximation then leads to perturbed expansions, whose perturbations, however, can be pushed below a necessary level by means of an adaptive grid control. The theoretical presentation is independent of space dimension. In this part I of the paper details of the algorithm and numerical examples are given for the 1D case only. The numerical results clearly show the significant perspectives opened by the new algorithmic approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 59
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper we consider symplectic difference schemes for perturbed Hamiltonian systems of integrable ones, which can cover many important problems. Symplectic difference schemes for general Hamiltonian systems can also be used to these problems. But the perturbation property has not been paid proper attention to, which is important in the method proposed here. Numerical simulation shows that, for this method the time step size can be taken quite large and the qualitative property , such as preserving invariant tori, is also better than usual symplectic difference schemes.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 60
    Publikationsdatum: 2014-02-26
    Beschreibung: $G$-invariant cubature formulas for numerical integration over n-dimensional, $G$- invariant integration regions are computed symbolically. The nodes are the common zeros of some $d$-orthogonal polynomials which build an $H$-basis of an ideal. Approaches for these polynomials depending on parameters are made with the help of the theory of linear representations of a group $G$. This theory is also used for the effective computation of necessary conditions which determines the parameters. Another approach uses invariant theory and gröbner bases.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 61
    Publikationsdatum: 2020-03-09
    Beschreibung: The FORTRAN preprocessor fpp in the newly introduced Autotasking System of CRAY Research allows automatic vectorization and parallelization on basis of a data dependence analysis. An introduction into data dependence analysis is given, showing how data dependence graphs unveil opportunities for program transformations like vectorization and concurrentization. The report contains a complete description of the preprocessors functionality, its options and directives for increasing the effectiveness of the dependence analyzer and steering the code transformations. Finally, some advice is given for the practical use of fpp on CRAY computers.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 62
    Publikationsdatum: 2014-02-26
    Beschreibung: Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and medicine. They can be considered as ordinary differential equations in sequence spaces. In this work, a full adaptive algorithm for the computational treatment of such systems is developed. The method combines time discretization with extrapolation in Hilbert spaces with a discrete Galerkin approach as discretization of the stationary subproblems. The Galerkin method is based on orthogonal functions of a discrete variable , which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations can be assembled either by use of analytical properties of the orthogonal functions or numerically by a multilevel summation algorithm. The resulting algorithm CODEX is applied to many examples of technological interest, in particular from polymer chemistry.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 63
    Publikationsdatum: 2014-02-26
    Beschreibung: Parameter-dependent systems of nonlinear equations with symmetry are treated by a combination of symbolic and numerical computations. In the symbolic part of the algorithm the complete analysis of the symmetry occurs, and it is here where symmetrical normal forms, symmetry reduced systems, and block diagonal Jacobians are computed. Given a particular problem, the symbolic algorithm can create and compute through the list of possible bifurcations thereby forming a so-called tree of decisions correlated to the different types of symmetry breaking bifurcation points. The remaining part of the algorithm deals with the numerical pathfollowing based on the implicit reparametrisation as suggested and worked out by Deuflhard/Fiedler/Kunkel. The symmetry preserving bifurcation points are computed using recently developed augmented systems incorporating the use of symmetry. {\bf Keywords:} pathfollowing, mixed symbolic-numeric algorithm, parameter-dependent, nonlinear systems, linear representations.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 64
    Publikationsdatum: 2014-02-26
    Beschreibung: Systems of polynomial equations often have symmetry. The Buchberger algorithm which may be used for the solution ignores this symmetry. It is restricted to moderate problems unless factorizing polynomials are found leading to several smaller systems. Therefore two methods are presented which use the symmetry to find factorizing polynomials, decompose the ideal and thus decrease the complexitiy of the system a lot. In a first approach projections determine factorizing polynomials as input for the solution process, if the group contains reflections with respect to a hyperplane. Two different ways are described for the symmetric group Sm and the dihedral group Dm. While for Sm subsystems are ignored if they have the same zeros modulo G as another subsystem, for the dihedral group Dm polynomials with more than two factors are generated with the help of the theory of linear representations and restrictions are used as well. These decomposition algorithms are independent of the finally used solution technique. We used the REDUCE package Groebner to solve examples from CAPRASSE, DEMARET and NOONBURG which illustrate the efficiency of our REDUCE program. A short introduction to the theory of linear representations is given. In a second approach problems of another class are transformed such that more factors are found during the computation; these transformations are based on the theory of linear representations. Examples illustrate these approaches. The range of solvable problems is enlarged significantly.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 65
    Publikationsdatum: 2014-02-26
    Beschreibung: Symplectic difference schemes have been shown to be a right formalism for numerical computation of Hamiltonian systems. They are suitable to long time computation and of good qualitative properties. These properties are ensured by the fact that a symplectic difference scheme approximating to a time-independent Hamiltonian system can be regarded as a perturbed time-dependent Hamiltonian system of the original one. That is, a solution of a symplectic difference scheme is a solution of a certain perturbed time dependent Hamiltonian system evaluated at discrete (time) points. This is the main result of the paper. Moreover, linear symplectic difference schemes approximating to a linear time-independent Hamiltonian system can be regarded as a perturbed time-independent Hamiltonian system. So it has all properties that a linear Hamiltonian system has. Based on these results, stochastic webs and chaos in symplectic difference schemes are also discussed. They will appear in numerical simulation for Hamiltonian systems, even with one degree of freedom.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 66
    Publikationsdatum: 2014-02-26
    Beschreibung: The potential distribution of reverse biased pn-junctions can be described by a double obstacle problem for the Laplacian. This problem is solved by a self adaptive Finite Element Method involving automatic termination criteria for the iterative solver, local error estimation and local mesh refinement. Special attention is paid to the efficient resolution of the geometries typically arising in semiconductor device simulation. The algorithm is applied to a reverse biased pn- junction with multi-step field plate and stop- electrode to illustrate its efficiency and reliability.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 67
    Publikationsdatum: 2020-12-15
    Beschreibung: The paper presents a theoretical characterization of the often observed asymptotic mesh independence of Newton's method, which means that Newton's method applied to discretized operator equations behaves essentially the same for all sufficiently fine discretizations. The theory does not need any uniform Lipschitz assumptions that were necessary in comparable earlier treatments. The refined Newton-Mysovskii theorem, which will be of interest in a wider context, gives both existence and uniqueness of the solution and quadratic convergence for sufficiently good starting points. Attention is restricted to Galerkin approximations even though similar results should hold for finite difference methods - but corresponding proofs would certainly be more technical. As an illustrative example, adaptive 1-D collocation methods are discussed.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 68
    Publikationsdatum: 2014-02-26
    Beschreibung: Oxidation mechanisms even for rather simple hydrocarbons like heptane consist due to the occurrence of many isomeric structures of thousands of reactions of hundreds of species. The automatic generation of these reaction mechanisms using artificial intelligence means is described. Results are presented for n-heptane-air mixtures, where a hand-written reaction mechanism tested against experimental data is available.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 69
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper surveys three aspects of chemical computing, which seem to play a role in recent developments. First, extrapolation methods for the numerical treatment of differential- algebraic equations are introduced. The associated extrapolation code LIMEX has reached a certain level of sophistication, which makes it a real competitor to the elsewhere widely used multi-step code DASSL of Petzold. Second, adaptive methods of lines for partial differential equations such as those arising in combustion problems are treated. Both static and dynamic regridding techniques are discussed in some detail. Finally, some new ideas about the treatment of the kinetic equations arising from polymer reactions are presented. The new feature of the suggested approach is the application of a Galerkin procedure using sets of orthogonal polynomials over a discrete variable (which, of course, in the case of polymer reactions is the polymer degree). The new approach may open the door to a new reliable low dimensional treatment of complex polymer reactions.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 70
    Publikationsdatum: 2014-02-26
    Beschreibung: The discrete Galerkin method developed by the authors has turned out to be an efficient tool for the computational treatment of very large scale ODE systems arising in polyreaction kinetics. Up to now, this approach has been worked out in detail for homogeneous polymer reactions. The present paper deals with one line of possible extensions of the method to the case of so-called heterogeneous processes, which may appear e. g. in smog reactions. The associated mathematical models involve reaction coefficients depending on the chain length of the reacting polymer. The herein suggested extension is worked out in some detail on the basis of the earlier paper. In addition, a numerical example describing polymer degradation is included.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 71
    Publikationsdatum: 2014-02-26
    Beschreibung: Newton methods for nonlinear problems are known to require the solution of a sequence of linear problems of the same type. For very large scale problems, as understood herein, the arising linear systems can only be solved by iterative methods. Then Newtons iteration appears as outer iteration. The question of interest will be to control the accuracy of the inner iteration such that the convergence speed of Newtons method is preserved. The purpose of the paper is to combine the concept of inexact Newton methods with the concept of the affine invariant exact Newton methods - which is important for problems with ill- conditioned Jacobian matrices (such as typical 2-D or 3-D discretized partial differential equations).
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 72
    Publikationsdatum: 2014-02-26
    Beschreibung: A variety of secant methods has been revisited in view of the construction of iterative solvers for large nonsymmetric linear systems $ Ax = b $ stemming from the discretization of convection diffusion equations. In the first section, we tried to approximate $ A ^{-1} $ directly. Since the sparsity structure of A- is not known, additional storage vectors are needed during the iteration. In the next section, an incomplete factorization $ LU $ of $ A $ is the starting point and we tried to improve this easy invertible approximation of $ A $. The update is constructed in such a way that the sparsity structure of $ L $ and $ U $ is maintained. Two different sparsity preserving updates are investigated from theoretical and practical point of view. Numerical experiments on discretized PDEs of convection diffusion type in 2- D with internal layers and on "arbitrary" matrices with symmetric sparsity structure are given. {\bf Key words:} nonsymmetric linear system, sparse secant method, Broyden's method, incomplete factorization.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 73
    Publikationsdatum: 2014-02-26
    Beschreibung: The mathematical modeling of macromolecular reactions leads to countable (possibly infinite) systems of ordinary differential equations (CODE's). This paper reviews two recent developments of the so-called discrete Galerkin method, which has been developed for the numerical treatment of countable systems, which arise e.g. in polymer chemistry. The first approach can be considered as a method of lines with moving basis functions and has been implemented recently in the program package MACRON. The second type of the Galerkin method is characterized by a so-called outer time discretization of the complete problem and an appropriate and efficient solution of the arising subproblems. This method is realized in the research code CODEX.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 74
    Publikationsdatum: 2014-02-26
    Beschreibung: In continuation of part I this paper develops a variable-order time discretization in Hilbert space based on a multiplicative error correction. Matching of time and space errors as explained in part I allows to construct an adaptive multilevel discretization of the parabolic problem. In contrast to the extrapolation method in time, which has been used in part I, the new time discretization allows to separate space and time errors and further to solve fewer elliptic subproblems with less effort, which is essential in view of the application to space dimension greater than one. Numerical examples for space dimension one are included which clearly indicate the improvement.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 75
    Publikationsdatum: 2014-02-26
    Beschreibung: In the present paper, the improvement of an incomplete factorization of a non-symmetric matrix A is discussed. Starting from the ideas of sparsity preserving quasi-Newton methods, an algorithm is developed which improves the approximation of A by the incomplete factorization maintaining the sparsity structure of the matrices. No renumbering of the unknowns or the admittance of additional fill-in is necessary. The linear convergence of the algorithm is proved under the assumption, that $ L $ and $ U $* have the same sparsity structure and an incomplete factorization with some reasonable approximation property exits. In combination with this algorithm, the method of incomplete factorization and its several modifications are applicable to a wider class of problems with improved convergence qualities. This is shown by a numerical example. {\bf Key Words:} non-symmetric linear system, sparse secant method, incomplete factorization. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20, 65N30.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 76
    Publikationsdatum: 2014-02-26
    Beschreibung: Das CRAY-Handbuch des ZIB beschreibt nach einer grundlegenden bersicht detailliert die Handhabung von UNICOS-Dateien, die Verwendung von UNICOS-Kommandos und schließlich die (für Benutzer allein zugelassene) Ausführung von Batchjobs auf der CRAY. Neben der Erreichbarkeit der CRAY über das TCP/IP-Netz werden die Compiler FORTRAN, PASCAL und C beschrieben und schließlich auf die Optimierung der Rechenzeit ebenso wie auf die Fehlersuche eingegangen. Ein umfangreicher Anhang führt bereitgestellte Programmpakete, weiterführende Literatur, Zahlenbereiche und Zeichendarstellung an der CRAY auf.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 77
    Publikationsdatum: 2014-02-26
    Beschreibung: Diese Vorlesung ist eine Einführung in die Numerische Mathematik als einem der drei Bereiche (neben den Naturwissenschaften und der Informatik) des am besten mit dem Begriff Scientific Computing charakterisierten Forschungsgebietes. Aufgabe dieser relativ jungen Wissenschaft ist die Entwicklung von Rechenverfahren für Probleme aus den Naturwissenschaften mit Hilfe mathematischer Methoden.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 78
    Publikationsdatum: 2014-02-26
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 79
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper presents the new program package MACRON for the simulation of macromolecular kinetics including standard chemical reactions. Such problems lead to countable (possibly) infinite systems of ordinary differential equations (CODE's), which are numerically treated by the so-called discrete Galerkin method here. By a chemical compiler the required analytical preprocessing is performed, such that the complete reaction system, standard kinetics as well as macromolecular reactions, can be entered in the chemical formalism. Typical macromolecular reaction steps are chain addition, termination, chain transfer and degradation (cracking). In order to ensure efficiency and reliability, high sophisticated numerical routines are built within the package. MACRON can be used without a detailed knowledge of the used numerical methods. As an illustration the application of MACRON to some realistic problems is presented.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 80
    Publikationsdatum: 2014-02-26
    Beschreibung: We study the power-law type solutions of the fourth order field equations derived from a generic quadratic Lagrangian density in the case of multidimensional Bianchi I cosmological models. All the solutions of the system of algebraic equations have been found, using computer algebra, from a search of the Groebner bases associated to it. While, in space dimension $ d = 3 $ , the Einsteinian Kasner metric is still the most general power-law type solution, for $ d 〉 3 $ , no solution, other than the Minkowski space-time, is common to the three systems of equations associated with the three contributions to the Lagrangian density. In the case of a pure Riemann-squared contribution (suggested by a recent calculation of the effective action for the heterotic string), the possibility exists to realize a splitting of the $ d $-dimensional space into a ( $ d - 3 $)-dimensional internal space and a physical 3- dimensional space, the latter expanding in time as a power bigger than 2 (about 4.5 when $ d = 9 $).
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 81
    Publikationsdatum: 2014-02-26
    Beschreibung: Im vorliegenden Bericht wird die Parallelisierung zweier numerischer Algorithmen zur Lösung gewöhnlicher Differentialgleichungssysteme 1.Ordnung (explizite und semi-implizite Euler- Diskretisierung und $h$-Extrapolation) beschrieben. Implementiert wurden die Algorithmen mit OCCAM2 unter TDS (Transputer Development System) mit bis zu 4 Transputern T800. Meßwerte für die erreichten Beschleunigungen werden anhand mehrer Beispiele von Differentialgleichungs-systemen angegeben. {\bf Schlüsselwörter:} Adaptive, parallele Systeme; OCCAM2; Transputer; numerische Gleichungslöser; Euler-Diskretisierung; $h$-Extrapolation.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 82
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 83
    Publikationsdatum: 2014-02-26
    Beschreibung: BOXES computes a triangulation from a 2D domain description which consists of an arbitrary set of rectangles. Each rectangle may have attributes to control the triangulating process, define subdomain classes, or specify boundary conditions. The output of the program can be used as a coarse grid for KASKADE or one of its variants. Additional features are extensive checking of the user input, graphical display, and simple editing.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 84
    Publikationsdatum: 2014-02-26
    Beschreibung: This report presents the final realization and implementation of a global inexact Newton method proposed by Deuflhard. In order to create a complete piece of software, a recently developed iterative solver (program GBIT) due to Deuflhard, Freund, Walter is adapted and serves as the standard iterative linear solver. Alternative linear iterative solvers may be adapted as well, e.g. the widely distributed code GMRES. The new software package GIANT (Global Inexact Affine Invariant Newton Techniques) allows an efficient and robust numerical solution of very large scale highly nonlinear systems. Due to the user friendly interface and its modular design, the software package is open for an easy adaptation to specific problems. Numerical experiments for some selected problems illustrate performance and usage of the package.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 85
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2019-10-24
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: annualzib , doc-type:report
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 86
    Publikationsdatum: 2022-07-19
    Beschreibung: Efficient implementations of irregular problems on vector and parallel architectures are generally hard to realize. An important class of problems are Gauß-Seidel iteration schemes applied to irregular data sets. The unstructured data dependences arising there prevent restructuring compilers from generating efficient code for vector or parallel machines. It is shown, how to structure the data dependences by decomposing the underlying data set using graph coloring techniques and by specifying a particular execution order already on the algorithm level. Methods to master the irregularities originating from different types of tasks are proposed. An application is given and some open issues and future developments are discussed.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 87
    Digitale Medien
    Digitale Medien
    Springer
    Anatomy and embryology 182 (1990), S. 517-528 
    ISSN: 1432-0568
    Schlagwort(e): Gap junction ; Structure ; Function ; Molecular biology ; Chemistry
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Medizin
    Notizen: Summary Gap junctions are aggregates of transmembranous channels which bypass the extracellular space by transporting messenger molecules and ions from one cytoplasmic source to an adjacent cytoplasmic interior. The channels join the plasma membranes of adjacent cells by bridging the extracellular space between them. Thereby, cellular “compartments” which were once considered to be individual units are, in actuality, interconnected by a system of pathways which form a functional cellular syncytium. The evolutionary importance of a generalized intercellular communication system can be appreciated when one considers the widespread prevalence of gap junctions within animals of all multicellular phyla, and within almost all tissues of vertebrates. Only a few population of cells such as skeletal muscle cells (which are fused to form functional syncytia) and circulating blood cells are not equipped with gap junctions. This paper provides a brief review of the diverse structural, molecular and functional aspects of gap junctions as revealed by current research.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 88
    Digitale Medien
    Digitale Medien
    Springer
    Plant systematics and evolution 171 (1990), S. 1-14 
    ISSN: 1615-6110
    Schlagwort(e): Angiosperms ; Compositae ; Chemistry ; systematics ; evolution
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie
    Notizen: Abstract The broad knowledge of the chemistry of theCompositae allows the discussion of its relevance for the systematics and evolution within the family. Furthermore a separation into subfamilies can be supported by the observed differences in the distribution of the main constituents in the tribes.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 89
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 175 (1990), S. 107-116 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Zur Beschreibung der Polymerisationsgeschwindigkeit der radikalischen Fallungspolymerisation von Acrylsäure in Toluol wurde ein Modell entewickelt. Die experimentelle Überprüfung des Modells erfolgte durch Messungen in einem isotherm betriebenen Reaktionskalorimeter. Das Modell beschreibt die Polymerisationsgeschwindigkeit bis zum vollständigen Umsatz in einem Temperaturbereich von 40 bis 60°C.
    Notizen: A kinetic model for the free-radical precipitation polymerization of acrylic acid in toluene was developed and verified experimentally by using an isothermal reaction calorimeter. The model predicts the rate of polymerization accurately up to complete conversion in the temperature range of 40 to 60°C.
    Zusätzliches Material: 3 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 90
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 175 (1990), S. 157-168 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Es wird über Untersuchungen an Legierungen aus isotaktischem Polypropylen und EPDM-Elastomer berichtet, die mit hochenergetischen Elektronen bestrahlt worden waren. Die Mischungsverhältnisse in den Proben überstrichen sowohl den für elastomermodifizierte Thermoplaste typischen Bereich als auch den der thermoplasticschen Elastomeren. Eine Vernetzung der Komponenten über die Grenzfläche hinweg wurde nachgewiesen. Diese grenzflächenübergreifende Vernetzung bewirkte eine merkliche Verbesserung der mechanischen Eigenschaften insbesondere des thermoplastischen Elastomeren.
    Notizen: Blends of isotactic polypropylene and EPDM rubber have been treated by electron irradiation in the composition range of rubber modification and in the thermoplastic rubber composition range as well. Mutual crosslinking of the components through the interface could be detected. This intercrosslinking caused a remarkable improvement of the mechanical properties particularly of the thermoplastic rubber.
    Zusätzliches Material: 4 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 91
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 175 (1990), S. 205-205 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 92
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Notizen: The mechanisms of photooxidation usually envisaged, are perfected by taking into account photoreactions of peroxy radicals. They involve interaction of a peroxy radical with the polymer to yield a hydroperoxy radical and a pair of macroradicals. After peroxidation, this pair will usually undergo bimolecular termination. The influence of such a reaction on photooxidation kinetics is particularly important for polyethylene. Then, chain termination occurs mainly by interaction of two hydroperoxy radicals or of a hydroperoxy radical with a macroperoxy radical. The reaction does not only affect kinetics of photooxidation but also the nature of the photooxidation products. The latter is more important for polypropylene than for polyethylene.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 93
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Notizen: Isothermal Differential Thermal Analysis was used to test the thermooxidative stability of pipes of polybutene during internal pressure tests at 110°C. At low hoop stresses and long testing times pipe failure was exclusively caused by thermooxidative degradation of the polymer.The stabilizer distribution in the initial state and its alteration during the pressure tests could easily be measured by isothermal DTA. Leaching of antioxidants from pipe walls could be detected. The decrease of residual thermooxidative stability was degressive.Degradation of pipe material started from the exterior pipe wall. Molecular weight of polybutene decreased rapidly after stabilizer exhaustion which could be observed by isothermal DTA.
    Zusätzliches Material: 6 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 94
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Notizen: A base of experimental data on the ageing of commerial grade plastics is created. In includes assorted physical and chemical properties of plastics and their changes at natural ageing. An automated system for storing and processing of the experimental data is designed. Processing involves mathematical modeling of the changes in properties that aids in empirical prediction. The possibilities of the system are verified with experimental results from a 5-year ageing period of PE-LD and PE-HD. The results show a good agreement between the predicted and real data for selected models.
    Zusätzliches Material: 1 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 95
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 179 (1990), S. 35-56 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Die Morphologie von Polypropylen-Spritzgußteilen mit Bindenaht wurde mit Röntgenweit-und Kleinwinkelstreuung, Lichtstreuung und Polarisationsmikroskopie untersucht. Die erhaltenen morphologischen Daten wurden mit mechanischen Werten aus Zugversuchen korreliert. Es wird gefunden, daß die mechanischen Eigenschaften der untersuchten Proben im wesentlichen von der sphärolithstruktur beeinflußt werden. Anhäufungen von Sphärolithen mit Kristallen der hexagonalen β-Modifikation und eine starke Inhomogenität der Sphärolithstruktur senkrecht zur Bindenaht sind der wesentliche Grund für die verschlechterten mechanischen Eigenschaften. Diese Sphärolithstruktur wird durch die Temperatur des Spritzgußwerkzeugs stark beeinflußt. Die Lamellen-Überstruktur hat dagegen einen vernachlässigbar kleinen Einfluß auf das mechanische Verhalten.
    Notizen: The morphology of polypropylene plaques containing a weld line, has been investigated by x-ray wide and small angle scattering, light scattering and polarization microscopy. The results are correlated to mechanical values obtained from tensile tests. While the lamellar morphology is of neglectable influence, it is found, that the mechanical properties of the samples are strongly influenced by the spherulitic structure. Clustering of β-type spherulites and strong morphological inhomogeneities in the vicinity of the weld line are the primary reason for the mechanical weakening of the plaques. The temperature of the mould has a strong effect on the spherulitic structure and thus on the tensile properties of the samples.
    Zusätzliches Material: 17 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 96
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 179 (1990), S. 77-85 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Füllstoffe für PVC- und PP-Formmassen wurden mit Mikrowellenplasma behandelt. Photoakustische FT-IR-Spektren zeigen, daß die Plasma-Polymerhülle auf der Füllstoffoberfläche —C=C—, —CH2—, CH3— und andere Gruppen enthält. Aus Röntgenelektronenspektren geht hervor, daß zwischen Siliciumdioxid und der organischen Beschichtung chemische Bindungen existieren. Durch Compoundieren von plasmabehandelten Füllstoffen mit PVC und PP werden Materialien mit guten mechanischen Eigenschaften bei niedrigen Kosten erhalten.
    Notizen: Fillers for PVC and PP compounds have been treated by microwave plasma. FT-IR photoacoustic spectroscopy studies show that the plasma polymer sheath on filler's surface contains —C=C—, —CH2—, —CH3 groups, etc. X-ray photoelectron spectroscopy studies reveal that interfacial chemical bondings exist between silica and the organic coating. Application of plasma-treated fillers in PVC and PP compounds gives rise to materials of good mechanical properties and low cost.
    Zusätzliches Material: 5 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 97
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 179 (1990), S. 135-148 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Poly-(alkylenadipat)-diole mit Molmassen von 1500, 2000 und 3000 wurden bei Temperaturen von 25 und 60°C in Gegenwart verschiedener Alkohole und unterschiedlicher PUR-Katalysatoren (1,4-Diazabicyclo[2.2.2]octan (DABCO), Dibutylzinndilaurat (DBTL),Dibutylzinndiethoxid (DBTEO) und Dibutylzinnoxid (DBTO)) in Ethylacetat bzw. Toluol gelagert und die Alkoholyse verfolgt. Die erhaltenen Ergebnisse werden mit dem Alkoholyseverhalten verschiedener Dialkyladipate sowie des Lösungsmittels Ethylacetat unter den selben Bedingungen verglichen. Die Alkoholyse verlauft in Gegenwart der zinnorganischen Verbindungen etwa mit gleicher Geschwindigkeit, ohne daß diese selbst signifikant zersetzt werden, wahrend DABCO praktisch inaktiv ist. Die Aktivitat der Alkohole ist starker von ihrer sterischen Struktur als von ihrer Basizitat abhangig. Die Stabilität der Polyalkylenadipate gegenüber einer Umesterung nimmt mit der Lange der Diolalkyleneinheiten des Polyols zu. Die Umesterung von Adipinsäuredialkylestern findet auch partiell in Anwesenheit eines großen Uberschusses an Ethylacetat statt.
    Notizen: Poly(alkylene adipate)diols having molar masses of 1500, 2000 and 3000 were stored at temperatures of 25 and 60°C in the presence of low amounts of different alcohols and some polyurethane (PUR) catalysts, such as dibutyltindilaurate (DBTL), dibutyltindiethoxide (DBTEO), dibutyltinoxide (DBTO), and 1,4-diazabicyclo[2.2.2]octane (DABCO). Alcoholysis was studied using either ethyl acetate (EA) or toluene as solvent. The results were compared with those obtained by examining the behaviour of several dialkyl adipates and ethyl acetate under identical conditions. The alcoholysis in the presence of the tin catalysts proceeds at the same reaction rate without significant decomposition of the catalyst, whereas DABCO is practically inactive. The nucleophilic activity of the alcohols depends on their bulk size rather than their basicity. The resistance of polyalkylene adipates to transesterification increases with the increasing alkyl chain length of diol units in polyester. A partial transesterification of dialkyl adipates takes place too, in spite of ethyl acetate being present in excess.
    Zusätzliches Material: 9 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 98
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 179 (1990), S. 157-171 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Es wurde das Permeations- und Trennverhalten von Alkohol/Wasser-Systemen durch poröse PVA-Membranen untersucht. PVA-Membranen mit unterschiedlicher Anzahl und Große von Poren wurden über Mischungen in Lösung mit verschiedenen synthetisierten Polymeren und Copolymeren, wie Polyacrylsäure, Polyacrylnitril, Polyacrylamid, Poly(Methylmethacrylat-co-Maleinsäureanhydrid) etc., anschließendes Gießen von Filmen und Extraktion der Polymeren oder Copolymeren durch Lösungsmittel hergestellt. Die Abhängigkeit der Durchlässigkeit und Trennwirkung von der Größe und Form der permeierenden Moleköle wurde qualitativ diskutiert. Des weiteren wurde die Selektivität der Trennwirkung in Abhangigkeit von der Zusammensetzung von Alkohol/Wasser-Gemischen und von der Größe und Anzahl der Poren untersucht. Es wurde gefunden, daß die Selektivität von der Menge und dem Molekulargewicht der in die Membranen eingebrachten Polymeren abhängt. Wenn der Gewichtsanteil des verwendeten Polymeren größer als 0,1 war, permeierte bevorzugt der Alkoholanteil bei methanolischen Msungen, wobei der Trennfaktor mit steigender Methanolkonzentration anstieg. In Gemischen mit anderen Alkoholen zeigten die Membranen andererseits eine selektive Durchlässigkeit für Wasser. Der Einfluß der Versuchsbedingungen wurde ebenfalls untersucht.
    Notizen: The permeation and separation characteristics of alcohol/water systems through porous PVA membranes were investigated. Porous PVA membranes with different pore size and number were prepared by solution blending of PVA with several synthesized polymers or copolymers, such as polyacrylic acid, polyacrylamide, polyacrylonitrile, and methylmethacrylate-co-maleic anhydride, etc. Then casting, and finally extracting the blended polymers or copolymers by solvent from the membranes. The dependency of both permeation and separation on the molecular size and shape of the permeating species was dicussed qualitatively. Moreover, the permselectivity was investigated with attention to the feed composition of alcohol/water mixture and the effect of pore size and number. The selectivity was found to depend on the weight ratio and the molecular weight of polymer introduced to the membrane. When the weight ratio of polymer introduced into the membrane was larger than 0.1, methanol was permeated through membrane preferentially in methanol/water system, and the separation factor increased with increasing the methanol feed concentration. On the other hand, membrane had a selective permeability for water in the other alcohol/water systems. The influence of operating conditions was also studied.
    Zusätzliches Material: 7 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 99
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 175 (1990), S. 29-38 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Die Temperatur des T1-Minimums für die Segmentbewegung in Polypropylen, das einen hohen ataktischen Anteil besitzt, ist niedriger als die in isotaktischem Polypropylen. Ein kurzes T1, T1s, tritt bei beiden Materialien auf. Bei Temperaturerhöhung nimmt T2a (T2 der beweglichen amorphen Bezirke) stark und T2m (T2 der dazwischen liegenden Bezirke) leicht zu, während sich T2c (T2 der steifen kristallinen Bezirke) kaum ändert. T2a in Polypropylen mit hohem ataktischem Anteil ist länger als in isotaktischem Polypropylen.Der Massenbruch der kristallinen Bezirke, Fc, nimmt bei Temperaturerhöhung ab und der der amorphen Bezirke, Fa, zu. Die Relaxationsgeschwindigkeit, 1/ (T1min), steigt linear mit Zunahme des amorphen Anteils an, außer bei der mit siedendem n-Heptan extrahierten Probe. Mit Zunahme der Peaktemperatur von tan δ fällt T2a nahezu linear ab, während die Temperatur des T1-Minimums zunimmt.
    Notizen: The temperature of the T1 minimum for the segmental motion in polypropylene containing a lot of atactic fraction is lower than that in isotactic polypropylene. A short T1, T1s, appears for both materials. As the temperature is raised, there is a large increase in T2a (T2 of the mobile amorphous regions), and a mild increase in T2m (T2 of the intermediate regions), while there is no substantial change in T2c (T2 of the rigid crystalline regions). T2a in polypropylene containing a lot of atactic fraction is longer than that in isotactic polypropylene.The mass fraction of crystalline regions, Fc, decreases and that of the amorphous regions, Fa, increases as the temperature is raised. There is a linear increase in the relaxation rate, 1/(T1min), as the amorphous fraction is increased, except for the sample extracted with boiling n-heptane. With increase of the peak temperature of tanδ, T2a decreases nearly linearly, while the temperature of the T1 minimum increases.
    Zusätzliches Material: 7 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 100
    Digitale Medien
    Digitale Medien
    Weinheim : Wiley-Blackwell
    Angewandte Makromolekulare Chemie 180 (1990), S. 191-198 
    ISSN: 0003-3146
    Schlagwort(e): Chemistry ; Polymer and Materials Science
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Physik
    Beschreibung / Inhaltsverzeichnis: Die Bestrahlung von PTFE mit Elektronen niedriger Energie führt zur Abspaltung von Fluor und zum Einbau von Sauerstoff in die Polymeroberfläche. Es wird gezeigt, daß das Ausmaß der Oberflächenveränderungen hauptsächlich von der Zahl und kaum von der Energie der Elektronen abhängt, die die Oberfläche erreichen. Änderungen in der Oberflächenenergie resultieren in unterschiedlichem Benetzungsverhalten. Kontaktwinkelmessungen und Kurvenanalysen der C-1s-Peaks aus Röntgenphotonenspektroskopiemessungen zeigen, daß der am wenigsten benetzbare Teil der bestrahlten Oberflächen in den meisten Fällen aus —CF2 —CF-Einheiten besteht. Werden bei der Bestrahlung nahezu alle Fluoratome abgespalten, bleiben nur isolierte —CF2-oder —CF-Gruppen zurück. Die „receding“-Winkel werden mit zunehmender Sauerstoffkonzentration in der Oberfläche kleiner, was auf die Bildung stark oxidierter Bereiche hinweist. Die Unabhängigkeit der Kontaktwinkel von der Alterungsdauer deutet auf eine sehr geringe Beweglichkeit der Makromoleküle hin, was mit einer starken Vernet-zung an der Oberfläche zusammenhängen könnte.
    Notizen: Low energy electron irradiation of PTFE induced fluorine depletion and introduction of oxygen on the surface. The effect on surface chemistry was shown to be dependent mostly on the amount of electrons reaching the sample, rather than on their energy.Changes in surface energy resulted in different wetting behaviors. The measurement of advancing water contact angles and the analysis of XPS C-1s peak shapes showed that the least wettable portion of irradiated surfaces is made in most cases of —CF2—CF — units. When the treatment caused a nearly complete fluorine depletion, only isolated —CF2— or —CF— groups are present. Receding angle values decreased linearly depending on the amount of oxygen introduced on the sample during the treatment, suggesting the formation of strongly oxidized polymer islets. The invariance of contact angles with aging time indicated very low macromolecular mobility, probably related to extensive surface crosslinking.
    Zusätzliches Material: 6 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...