Library

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2025-2025
  • 2010-2014
  • 2005-2009  (51)
  • 1965-1969  (502)
  • 1930-1934
  • 1890-1899  (18)
  • 1850-1859
  • 1840-1849
  • 1830-1839
  • 1810-1819
  • 2015
  • 2006  (51)
  • 1969  (502)
  • 1892  (18)
  • 1841
  • 1834
  • Cell & Developmental Biology  (416)
  • Computational Chemistry and Molecular Modeling  (104)
  • ddc:000  (51)
Material
Years
  • 2025-2025
  • 2010-2014
  • 2005-2009  (51)
  • 1965-1969  (502)
  • 1930-1934
  • +
Year
Language
  • 1
    facet.materialart.
    Unknown
    Publication Date: 2019-10-24
    Keywords: ddc:000
    Language: German
    Type: annualzib , doc-type:report
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2014-02-26
    Description: We propose a variant of the control reduced interior point method for the solution of state constrained problems. We show convergence of the corresponding interior point pathfollowing algorithm in function space. Morever, we provide error bounds for the iterates.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2014-02-26
    Description: This paper aims at presenting the complex coupled network of the human menstrual cycle to the interested community. Beyond the presently popular smaller models, where important network components arise only as extremely simplified source terms, we add: the GnRH pulse generator in the hypothalamus, receptor binding, and the biosynthesis in the ovaries. Simulation and parameter identification are left to a forthcoming paper.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2014-02-26
    Description: This work explores two applications of a classical result on the continuity of Nemyckii operators to optimal control with PDEs. First, we present an alternative approach to the analysis of Newton's method for function space problems involving semi-smooth Nemyckii operators. A concise proof for superlinear convergence is presented, and sharpened bounds on the rate of convergence are derived. Second, we derive second order sufficient conditions for problems, where the underlying PDE has poor regularity properties. We point out that the analytical structure in both topics is essentially the same.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2014-02-26
    Description: In this paper, we study the efficiency of Nash equilibria for a sequence of nonatomic routing games. We assume that the games are played consecutively in time in an online fashion: by the time of playing game $i$, future games $i+1,\dots,n$ are not known, and, once players of game $i$ are in equilibrium, their corresponding strategies and costs remain fixed. Given a sequence of games, the cost for the sequence of Nash equilibria is defined as the sum of the cost of each game. We analyze the efficiency of a sequence of Nash equilibria in terms of competitive analysis arising in the online optimization field. Our main result states that the online algorithm $\sl {SeqNash}$ consisting of the sequence of Nash equilibria is $\frac{4n}{2+n}$-competitive for affine linear latency functions. For $n=1$, this result contains the bound on the price of anarchy of $\frac{4}{3}$ for affine linear latency functions of Roughgarden and Tardos [2002] as a special case. Furthermore, we analyze a problem variant with a modified cost function that reflects the total congestion cost, when all games have been played. In this case, we prove an upper bound of $\frac{4n}{2+n}$ on the competitive ratio of $\sl {SeqNash}$. We further prove a lower bound of $\frac{3n-2}{n}$ of $\sl {SeqNash}$ showing that for $n=2$ our upper bound is tight.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2016-06-09
    Description: To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing $N$ steps requires only $O(N\log N)$ operations and $O(\log N)$ active memory, in place of $O(N^2)$ operations and $O(N)$ memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a blow-up example originating from a Schrödinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2020-11-13
    Description: This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, we present three heuristics for solving important subproblems, two of which solve a sub-MIP. On multi-layer planning instances with many parallel logical links, we show the effectiveness of our heuristics in finding good solutions early in the branch-and-cut search tree.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2019-05-10
    Description: The dynamics of ventricular fibrillation caused by irregular excitation is simulated in the frame of the monodomain model with an action potential model due to Aliev-Panfilov for a human 3D geometry. The numerical solution of this multiscale reaction-diffusion problem is attacked by algorithms which are fully adaptive in both space and time (code library {\sc Kardos}). The obtained results clearly demonstrate an accurate resolution of the cardiac potential during the excitation and the plateau phases (in the regular cycle) as well as after a reentrant excitation (in the irregular cycle).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2020-12-15
    Description: The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the permutation of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branch-and-cut tree. We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving this kind of symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the branch-and-cut tree, removes redundant parts of the tree produced by the above mentioned permutations. The method relies on certain polyhedra, called orbitopes, which have been investigated in (Kaibel and Pfetsch (2006)). However, it does not add inequalities to the model, and thus, it does not increase the difficulty of solving the linear programming relaxations. We demonstrate the computational power of orbitopal fixing at the example of a graph partitioning problem motivated from frequency planning in mobile telecommunication networks.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2014-11-10
    Description: In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph $D=(V,A)$ and a set $K$ of directed commodities, an USPR is a set of flow paths $\Phi_{(s,t)}$, $(s,t)\in K$, such that there exists a metric $\lambda=(\lambda_a)\in \mathbb{Z}^A_+$ with respect to which each $\Phi_{(s,t)}$ is the unique shortest $(s,t)$-path. In the \textsc{Min-Con-USPR} problem, we seek for an USPR that minimizes the maximum congestion over all arcs. We show that this problem is hard to approximate within a factor of $\mathcal{O}(|V|^{1-\epsilon})$, but easily approximable within min$(|A|,|K|)$ in general and within $\mathcal{O}(1)$ if the underlying graph is an undirected cycle or a bidirected ring. We also construct examples where the minimum congestion that can be obtained by USPR is a factor of $\Omega(|V|^2)$ larger than that achievable by unsplittable flow routing or by shortest multi-path routing, and a factor of $\Omega(|V|)$ larger than by unsplittable source-invariant routing. In the CAP-USPR problem, we seek for a minimum cost installation of integer arc capacities that admit an USPR of the given commodities. We prove that this problem is $\mathcal{NP}$-hard to approximate within $2-\epsilon$ (even in the undirected case), and we devise approximation algorithms for various special cases. The fixed charge network design problem \textsc{Cap-USPR}, where the task is to find a minimum cost subgraph of $D$ whose fixed arc capacities admit an USPR of the commodities, is shown to be $\mathcal{NPO}$-complete. All three problems are of great practical interest in the planning of telecommunication networks that are based on shortest path routing protocols. Our results indicate that they are harder than the corresponding unsplittable flow or shortest multi-path routing problems.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 11
    Publication Date: 2014-11-11
    Description: In this paper, we investigate the connection availabilities for the new protection scheme Demand-wise Shared Protection (DSP) and describe an appropriate approach for their computation. The exemplary case study on two realistic network scenarios shows that in most cases the availabilities for DSP are comparable with that for 1+1 path protection and better than in case of shared path protection.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    Publication Date: 2016-06-30
    Description: THESEUS, the ZIB threading environment, is a parallel implementation of a protein threading based on a multi-queued branch-and-bound optimal search algorithm to find the best sequence-to-structure alignment through a library of template structures. THESEUS uses a template core model based on secondary structure definition and a scoring function based on knowledge-based potentials reflecting pairwise interactions and the chemical environment, as well as pseudo energies for homology detection, loop alignment, and secondary structure matching. The threading core is implemented in C++ as a SPMD parallization architecture using MPI for communication. The environment is designed for generic testing of different scoring functions, e.g. different secondary structure prediction terms, different scoring matrices and information derived from multiple sequence alignments. A validaton of the structure prediction results has been done on the basis of standard threading benchmark sets. THESEUS successfully participated in the 6th Critical Assessment of Techniques for Protein Structure Prediction (CASP) 2004.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    Publication Date: 2014-02-26
    Description: We consider a multi-queue multi-server system with $n$ servers (processors) and $m$ queues. At the system there arrives a stationary and ergodic stream of $m$ different types of requests with service requirements which are served according to the following $k$-limited head of the line processor sharing discipline: The first $k$ requests at the head of the $m$ queues are served in processor sharing by the $n$ processors, where each request may receive at most the capacity of one processor. By means of sample path analysis and Loynes' monotonicity method, a stationary and ergodic state process is constructed, and a necessary as well as a sufficient condition for the stability of the $m$ separate queues are given, which are tight within the class of all stationary ergodic inputs. These conditions lead to tight necessary and sufficient conditions for the whole system, also in case of permanent customers, generalizing an earlier result by the authors for the case of $n$=$k$=1.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    Publication Date: 2014-02-26
    Description: In order to compute the thermodynamic weights of the different metastable conformations of a molecule, we want to approximate the molecule's Boltzmann distribution in a reasonable time. This is an essential issue in computational drug design. The energy landscape of active biomolecules is generally very rough with a lot of high barriers and low regions. Many of the algorithms that perform such samplings (e.g. the hybrid Monte Carlo method) have difficulties with such landscapes. They are trapped in low-energy regions for a very long time and cannot overcome high barriers. Moving from one low-energy region to another is a very rare event. For these reasons, the distribution of the generated sampling points converges very slowly against the thermodynamically correct distribution of the molecule. The idea of ConfJump is to use $a~priori$ knowledge of the localization of low-energy regions to enhance the sampling with artificial jumps between these low-energy regions. The artificial jumps are combined with the hybrid Monte Carlo method. This allows the computation of some dynamical properties of the molecule. In ConfJump, the detailed balance condition is satisfied and the mathematically correct molecular distribution is sampled.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    Publication Date: 2020-02-11
    Description: "`Volkssport Sudoku"' titelt der Stern in seiner Ausgabe vom 24. Mai2006. In der Tat traut sich derzeit kaum noch eine Zeitung, ohne Sudoku zu erscheinen. Die Begeisterung am Lösen dieser Zahlenrätsel offenbart eine unvermutete Freude am algorithmischen Arbeiten. Mathematisch kann man Sudokus als lineare diophantische Gleichungssysteme mit Nichtnegativitätsbedingungen formulieren. Solche ganzzahligen linearen Programme sind die wichtigsten Modellierungswerkzeuge in zahlreichen Anwendungsgebieten wie z.B. der Optimierung von Telekommunikations- und Verkehrsnetzen. Moderne Verfahren zur Lösung dieser Optimierungsprobleme sind durch Sudokus allerdings deutlich weniger zu beeindrucken als Zeitungsleser.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    Publication Date: 2020-02-11
    Description: This article surveys mathematical models and methods used for physical PCB layout, i.e., component placement and wire routing. The main concepts are briefly described together with relevant references.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Publication Date: 2020-12-15
    Description: We study online multicommodity minimum cost routing problems in networks, where commodities have to be routed sequentially. Arcs are equipped with load dependent price functions defining the routing weights. We discuss an online algorithm that routes each commodity by minimizing a convex cost function that depends on the demands that are previously routed. We present a competitive analysis of this algorithm showing that for affine linear price functions this algorithm is $4K/2+K$-competitive, where $K$ is the number of commodities. For the parallel arc case this algorithm is optimal. Without restrictions on the price functions and network, no algorithm is competitive. Finally, we investigate a variant in which the demands have to be routed unsplittably.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    Publication Date: 2021-03-16
    Description: Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations w.r.t different concepts. Perfect graphs are, e.g., characterized as precisely those graphs $G$ where the stable set polytope STAB$(G)$ coincides with the clique constraint stable set polytope QSTAB$(G)$. For all imperfect graphs STAB$(G) \subset$ QSTAB$(G)$ holds and, therefore, it is natural to measure imperfection in terms of the difference between STAB$(G)$ and QSTAB$(G)$. Several concepts have been developed in this direction, for instance the dilation ratio of STAB$(G)$ and QSTAB$(G)$ which is equivalent to the imperfection ratio imp$(G)$ of $G$. To determine imp$(G)$, both knowledge on the facets of STAB$(G)$ and the extreme points of QSTAB$(G)$ is required. The anti-blocking theory of polyhedra yields all {\em dominating} extreme points of QSTAB$(G)$, provided a complete description of the facets of STAB$(\overline G)$ is known. As this is typically not the case, we extend the result on anti-blocking polyhedra to a {\em complete} characterization of the extreme points of QSTAB$(G)$ by establishing a 1-1 correspondence to the facet-defining subgraphs of $\overline G$. We discuss several consequences, in particular, we give alternative proofs of several famous results.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    Publication Date: 2014-11-10
    Description: We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time $O^\ast(2^n)$. This algorithm is based on the old dynamic programming method introduced by Held and Karp for the {\sc Tra veling Salesman} problem. We use some optimizations that do not affect the worst case running time but improve on the running time on actual instances and can be seen to be practical for small instances. However, our experiments show that the space use d by the algorithm is an important factor to what input sizes the algorithm is effective. For this purpose, we settle the problem of computing treewidth under the restriction that the space used is only polynomial. In this direction we give a simple $O^\ast(4^n)$ al gorithm that requires {\em polynomial} space. We also show that with a more complicated algorithm, using balanced separators, {\sc Treewidth} can be computed in $O^\ast(2.9512^n)$ time and polynomial space.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    Publication Date: 2014-03-10
    Description: The dynamic behavior of molecules can often be described by Markov processes. From computational molecular simulations one can derive transition rates or transition probabilities between subsets of the discretized conformational space. On the basis of this dynamic information, the spatial subsets are combined into a small number of so-called metastable molecular conformations. This is done by clustering methods like the Robust Perron Cluster Analysis (PCCA+). Up to now it is an open question how this coarse graining in space can be transformed to a coarse graining of the Markov chain while preserving the essential dynamic information. In the following article we aim at a consistent coarse graining of transition probabilities or rates on the basis of metastable conformations such that important physical and mathematical relations are preserved. This approach is new because PCCA+ computes molecular conformations as linear combinations of the dominant eigenvectors of the transition matrix which does not hold for other clustering methods.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 21
    Publication Date: 2014-02-26
    Description: Das deutschsprachige Bibliothekswesen verfügt mit den \glqq Regeln für den Schlagwortkatalog \grqq (RSWK) unter Verwendung der \glqq Schlagwortnormdatei \grqq (SWD) über ein Instrumentarium, welches zusammen mit einem \glqq Faceted Browsing \grqq das bisher bestehende Angebot für ein Information Retrieval optimal ergänzen kann. Die Verbindung zwischen Standardvokabular (SWD) und Kettenbildung (RSWK) einerseits und eine nach Facetten-Eigenschaften gegliederte Navigation andererseits unterstützt bestmöglich eine inhaltlich bezogene Recherche. Die Stärken und Schwächen der RSWK/SWD werden erörtert und auch Klassifikationen (DDC und RVK) als mögliche Facetten diskutiert.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 22
    Publication Date: 2016-06-09
    Keywords: ddc:000
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 23
    Publication Date: 2022-03-14
    Description: A lot of problems arising in Combinatorial Optimization and Operations Research can be formulated as Mixed Integer Programs (MIP). Although MIP-solving is an NP-hard optimization problem, many practically relevant instances can be solved in reasonable time. In modern MIP-solvers like the branch-cut-and-price-framework SCIP, primal heuristics play a major role in finding and improving feasible solutions at the early steps of the solution process. This helps to reduce the overall computational effort, guides the remaining search process, and proves the feasibility of the MIP model. Furthermore, a heuristic solution with a small gap to optimality often is sufficient in practice. We investigate 16 different heuristics, all of which are available in SCIP. Four of them arise from the literature of the last decade, nine are specific implementations of general heuristic ideas, three have been newly developed. We present an improved version of the feasibility pump heuristic by Fischetti et al., which in experiments produced solutions with only a third of the optimality gap compared to the original version. Furthermore, we introduce two new Large Neighborhood Search (LNS) heuristics. Crossover is an LNS improvement heuristic making use of similarities of diverse MIP solutions to generate new incumbent solutions. RENS is an LNS rounding heuristic which evaluates the space of all possible roundings of a fractional LP-solution. This heuristic makes it possible to determine whether a point can be rounded to an integer solution and which is the best possible rounding. We conclude with a computational comparison of all described heuristics. It points out that a single heuristic on its own has only a slight impact on the overall performance of SCIP, but the combination of all of them reduces the running time by a factor of two compared to a version without any heuristics.
    Keywords: ddc:000
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 24
    Publication Date: 2014-02-26
    Description: We present a finite volume method for the solution of the two-dimensional Poisson equation $ \nabla\cdot( \beta( {\mbox{\boldmath $x$}}) \nabla u({\mbox{\boldmath $x$}})) = f(\mbox{\boldmath $x$}) $ with variable, discontinuous coefficients and solution discontinuities on irregular domains. The method uses bilinear ansatz functions on Cartesian grids for the solution $u({\mbox{\boldmath $x$})$ resulting in a compact nine-point stencil. The resulting linear problem has been solved with a standard multigrid solver. Singularities associated with vanishing partial volumes of intersected grid cells or the dual bilinear ansatz itself are removed by a two-step asymptotic approach. The method achieves second order of accuracy in the $L^\infty$ and $L^2$ norm.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 25
    Publication Date: 2014-11-11
    Description: In this article we aim at an efficient sampling of the stationary distribution of dynamical systems in the presence of metastabilities. In the past decade many sophisticated algorithms have been inven ted in this field. We do not want to simply add a further one. We address the problem that one has applied a sampling algorithm for a dynamical system many times. This leads to different samplings which more or less represent the stationary distribution partially very well, but which are still far away from ergodicity or from the global stationary distribution. We will show how these samplings can be joined together in order to get one global sampling of the stationary distribution.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 26
    Publication Date: 2014-02-26
    Description: The concept of jump system, introduced by Buchet and Cunningham (1995), is a set of integer points with a certain exchange property. In this paper, we discuss several linear and convex optimization problems on jump systems and show that these problems can be solved in polynomial time under the assumption that a membership oracle for a jump system is available. We firstly present a polynomial-time implementation of the greedy algorithm for the minimization of a linear function. We then consider the minimization of a separable-convex function on a jump system, and propose the first polynomial-time algorithm for this problem. The algorithm is based on the domain reduction approach developed in Shioura (1998). We finally consider the concept of M-convex functions on constant-parity jump systems which has been recently proposed by Murota (2006). It is shown that the minimization of an M-convex function can be solved in polynomial time by the domain reduction approach.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 27
    Publication Date: 2020-12-15
    Description: We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at most or exactly one 1-entry in each row, respectively. The goal of investigating these polytopes is to gain insight into ways of breaking certain symmetries in integer programs by adding constraints, e.g., for a well-known formulation of the graph coloring problem. We provide a thorough polyhedral investigation of packing and partitioning orbitopes for the cases in which the group acting on the columns is the cyclic group or the symmetric group. Our main results are complete linear inequality descriptions of these polytopes by facet-defining inequalities. For the cyclic group case, the descriptions turn out to be totally unimodular, while for the symmetric group case, both the description and the proof are more involved. The associated separation problems can be solved in linear time.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 28
    Publication Date: 2014-11-21
    Description: The standard computational methods for computing the optimal value functions of Markov Decision Problems (MDP) require the exploration of the entire state space. This is practically infeasible for applications with huge numbers of states as they arise, e.\,g., from modeling the decisions in online optimization problems by MDPs. Exploiting column generation techniques, we propose and apply an LP-based method to determine an $\varepsilon$-approximation of the optimal value function at a given state by inspecting only states in a small neighborhood. In the context of online optimization problems, we use these methods in order to evaluate the quality of concrete policies with respect to given initial states. Moreover, the tools can also be used to obtain evidence of the impact of single decisions. This way, they can be utilized in the design of policies.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 29
    Publication Date: 2014-11-21
    Description: Wir beschäftigen uns mit dem Problem der Betriebsplanung von Laserschweißrobotern im Karosseriebau. Gegeben ist eine Menge von Schweißnähten, die innerhalb einer Fertigungszelle an einem Karosserieteil gefertigt werden müssen. Die Schweißnähte werden durch mehrere parallel betriebene Roboter bearbeitet. Die Aufgabe besteht darin, für jeden Roboter eine Reihenfolge und eine zeitliche Koordinierung seiner Bewegungen zu finden, so dass alle Schweißnähte innerhalb der Taktzeit der Fertigungszelle bearbeitet werden und so wenig Laserquellen wie möglich eingesetzt werden. Dabei müssen einige Nebenbedingungen berücksichtigt werden. Für dieses spezielle Schweißproblem haben wir eine Formulierung als gemischt-ganzzahliges lineares Programm entwickelt, welches sich für die untersuchten praktischen Fälle sehr schnell lösen lässt.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 30
    Publication Date: 2021-08-05
    Description: Modern applications of mathematical programming must take into account a multitude of technical details, business demands, and legal requirements. Teaching the mathematical modeling of such issues and their interrelations requires real-world examples that are well beyond the toy sizes that can be tackled with the student editions of most commercial software packages. We present a new tool, which is freely available for academic use including complete source code. It consists of an algebraic modeling language and a linear mixed integer programming solver. The performance and features of the tool are in the range of current state-of-the-art commercial tools, though not in all aspects as good as the best ones. Our tool does allow the execution and analysis of large real-world instances in the classroom and can therefore enhance the teaching of problem solving issues. Teaching experience has been gathered and practical usability was tested in classes at several universities and a two week intensive block course at TU Berlin. The feedback from students and teachers has been very positive.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 31
    Publication Date: 2014-11-21
    Description: The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze the complexity of the problem, its relation to the Shortest Path Problem, and the impact of the underlying machine/computation model.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 32
    Publication Date: 2014-02-26
    Description: We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lov\´{a}sz. The class comprises examples of Stiefel manifolds, series of spheres and products of spheres, cubical surfaces, as well as examples of Seifert manifolds. Asymptotically, graph coloring manifolds provide examples of highly connected, highly symmetric manifolds.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 33
    Publication Date: 2014-02-26
    Description: We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 34
    Publication Date: 2014-02-26
    Description: Biochemical interactions are determined by the 3D-structure of the involved components - thus the identification of conformations is a key for many applications in rational drug design. {\sf ConFlow} is a new multilevel approach to conformational analysis with main focus on completeness in investigation of conformational space. In contrast to known conformational analysis, the starting point for design is a space-based description of conformational areas. A tight integration of sampling and analysis leads to an identification of conformational areas simultaneously during sampling. An incremental decomposition of high-dimensional conformational space is used to guide the analysis. A new concept for the description of conformations and their path connected components based on convex hulls and {\em Hypercubes}is developed. The first results of the {\sf ConFlow} application constitute a 'proof of concept' and are further more highly encouraging. In comparison to conventional industrial applications, {\sf ConFlow} achieves higher accuracy and a specified degree of completeness with comparable effort.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 35
    Publication Date: 2014-02-26
    Description: We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algorithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively moderate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In certain cases, i.e. for special families of convex constraints, weak convergence implies norm convergence. The presented approach covers a wide range of problems, e.g. Besov- or BV-restoration for which we present also numerical experiments in the context of image processing.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 36
    Publication Date: 2014-03-10
    Description: Whenever the invariant stationary density of metastable dynamical systems decomposes into almost invariant partial densities, its computation as eigenvector of some transition probability matrix is an ill-conditioned problem. In order to avoid this computational difficulty, we suggest to apply an aggregation/disaggregation method which only addresses wellconditioned sub-problems and thus results in a stable algorithm. In contrast to existing methods, the aggregation step is done via a sampling algorithm which covers only small patches of the sampling space. Finally, the theoretical analysis is illustrated by two biomolecular examples.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 37
    Publication Date: 2016-02-29
    Description: \noindent We give a partial description of the $(s,t)-p$-path polytope of a directed graph $D$ which is the convex hull of the incidence vectors of simple directed $(s,t)$-paths in $D$ of length $p$. First, we point out how the $(s,t)-p$-path polytope is located in the family of path and cycle polyhedra. Next, we give some classes of valid inequalities which are very similar to inequalities which are valid for the $p$-cycle polytope, that is, the convex hull of the incidence vectors of simple cycles of length $p$ in $D$. We give necessary and sufficient conditions for these inequalities to be facet defining. Furthermore, we consider a class of inequalities that has been identifie d to be valid for $(s,t)$-paths of cardinality at most $p$. Finally, we transfer the results to related polytopes, in particular, the undirected counterpart of the $(s,t)-p$-path polytope.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 38
    Publication Date: 2020-11-13
    Description: The numerical integration of dynamical contact problems often leads to instabilities at contact boundaries caused by the non-penetration condition between bodies in contact. Even a recent energy dissipative modification due to Kane et al. (1999), which discretizes the non-penetration constraints implicitly, is not able to circumvent artificial oscillations. For this reason, the present paper suggests a contact stabilization which avoids artificial oscillations at contact interfaces and is also energy dissipative. The key idea of this contact stabilization is an additional $L^2$-projection at contact interfaces, which can easily be added to any existing time integration scheme. In case of a lumped mass matrix, this projection can be carried out completely locally, thus creating only negligible additional numerical cost. For the new scheme, an elementary analysis is given, which is confirmed by numerical findings in an illustrative test example (Hertzian two body contact).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 39
    Publication Date: 2016-06-30
    Keywords: ddc:000
    Language: German
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 40
    Publication Date: 2014-02-26
    Description: We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can be obtained by choosing coordinates randomly.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 41
    Publication Date: 2014-02-26
    Description: The concept of L##-convexity is introduced by Fujishige--Murota (2000) as a discrete convexity for functions defined over the integer lattice. The main aim of this note is to understand the difference of the two algorithms for L##-convex function minimization: Murota's steepest descent algorithm (2003) and Kolmogorov's primal algorithm (2005).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 42
    Publication Date: 2014-02-26
    Description: In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 43
    Publication Date: 2020-02-11
    Description: This paper concerns the problem of operating a landside container exchange area that is serviced by multiple semi-automated rail mounted gantry cranes (RMGs) that are moving on a single bi-directional traveling lane. Such a facility is being built by Patrick Corporation at the Port Botany terminal in Sydney. The gantry cranes are a scarce resource and handle the bulk of container movements. Thus, they require a sophisticated analysis to achieve near optimal utilization. We present a three stage algorithm to manage the container exchange facility, including the scheduling of cranes, the control of associated short-term container stacking, and the allocation of delivery locations for trucks and other container transporters. The key components of our approach are a time scale decomposition, whereby an integer program controls decisions across a long time horizon to produce a balanced plan that is fed to a series of short time scale online subproblems, and a highly efficient space-time divisioning of short term storage areas. A computational evaluation shows that our heuristic can find effective solutions for the planning problem; on real-world data it yields a solution at most~8\% above a lower bound on optimal RMG utilization.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 44
    Publication Date: 2014-02-26
    Description: We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of actions of groups of small order, the enumeration is extended to 14 and 15 vertices.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 45
    Publication Date: 2014-02-26
    Description: We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 46
    Publication Date: 2014-02-26
    Description: We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2 x S^1$ and 615 triangulations of the twisted sphere product $S^2 \underline{x} S^1$. An analysis of the 3-spheres with up to 10 vertices shows that all these spheres are shellable, but that there are 29 vertex-minimal non-shellable 3-balls with 9 vertices.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 47
    Publication Date: 2019-05-10
    Description: Adaptive numerical methods in time and space are introduced and studied for linear poroelastic models in two and three space dimensions. We present equivalent models for linear poroelasticity and choose both the {\em displacement--pressure} and the {\em stress--pressure} formulation for our computations. Their discretizations are provided by means of linearly implicit schemes in time and linear finite elements in space. Our concept of adaptivity opens a way to a fast and reliable simulation of different loading cases defined by corresponding boundary conditions. We present some examples using our code {\sf Kardos} and show that the method works efficiently. In particular, it could be used in the simulation of some bone healing models.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 48
    Publication Date: 2016-06-30
    Description: During the last few years more and more functionalities of RNA have been discovered that were previously thought of being carried out by proteins alone. One of the most striking discoveries was the de tection of microRNAs, a class of noncoding RNAs that play an important role in post-transcriptional gene regulation. Large-scale analyses are needed for the still increasingly growing amount of sequen ce data derived from new experimental technologies. In this paper we present a framework for the detection of the distinctive precursor structure of microRNAS that is based on the well-known Smith-Wat erman algorithm and various filtering steps. We conducted experiments on real genomic data and we found several new putative hits for microRNA precursor structures.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 49
    Publication Date: 2014-02-26
    Description: Wir erleben zu Beginn des aufkommenden Informationszeitalters mit dem Siegeszug von Google und anderen Internet-Technologien einen Wandel im Verhalten von Wissenschaftlern und Studenten, der mit dem Einsatz von {\sl Google Scholar} und {\sl Google Book Search} einen Paradigmenwechsel für Bibliotheken und Informationsversorger gleichkommt. Der Artikel untersucht die technischen Hintergründe für den Erfolg dieser besonderen Art des Information Retrievals: Fulltext Indexing und Citation Ranking als besondere Form des Information Minig. Er diskutiert Stärken und auch Schwächen des Google-Ansatzes. Der Autor stellt sich auch der Frage, unter welchen Bedingungen es möglich ist, ein zu {\sl Google Scholar} und der {\sl Google Book Search} konkurrenzfähiges Retrieval in der Landschaft der Bibliotheken und Bibliotheksverbünde zu entrichten. Die These ist, dass dieses unter Einsatz des {\sl Open Source} Indexierers {\sl Lucene} und des Web-Robots {\sl Nutch} möglich ist. Bibliotheken können durch gezielten Einsatz solcher Internet-Technologien dem Nutzer die Leistungen, welche Google uns mit seinen Tools im {\sl Visible Web} und mit Referenzen auf {\sl Citations} in der Welt der Literatur zur Verfügung stellt, in vergleichbarer Art auch für ihre eigenen durch Lizenzen geschützten digitalen Journale und ihre speziellen lokal verfügbaren Ressourcen, auf die Internet-Suchmaschinen keine Zugriff haben, anbieten. Es besteht die Hoffnung, dass Nutzer dann nicht - wie in einer kürzlichen Studie des OCLC konstatiert - überwiegend im Internet verbleiben, sondern bei ihrer Suche auch den Weg zu den Angeboten der örtlichen Bibliothek attraktiv finden.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 50
    Publication Date: 2014-02-26
    Description: We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. According to the generalized processor sharing discipline, each request in the system receives a fraction of the capacity of one processor which depends on the actual number of requests in the system. We derive systems of ordinary differential equations for the LST and for the moments of the conditional waiting time of a request with given required service time as well as a stable and fast recursive algorithm for the LST of the second moment of the conditional waiting time, which in particular yields the second moment of the unconditional waiting time. Moreover, asymptotically tight upper bounds for the moments of the conditional waiting time are given. The presented numerical results for the first two moments of the sojourn times in the $M/M/m-PS$ system show that the proposed algorithms work well.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 51
    Publication Date: 2022-07-07
    Description: We present a domain decomposition approach for the computation of the electromagnetic field within periodic structures. We use a Schwarz method with transparent boundary conditions at the interfaces of the domains. Transparent boundary conditions are approximated by the perfectly matched layer method (PML). To cope with Wood anomalies appearing in periodic structures an adaptive strategy to determine optimal PML parameters is developed. We focus on the application to typical EUV lithography line masks. Light propagation within the multi-layer stack of the EUV mask is treated analytically. This results in a drastic reduction of the computational costs and allows for the simulation of next generation lithography masks on a standard personal computer.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 131-139 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: An analytical approximation for the hypersurface E (pr-approximation) is given using the two- and three-center-functions pλμ and rμνλ, which is valid for any number N of atoms and is invariant with respect to the number of centers in its analytical structure (rule of construction). This is valid too if N is reduced either by the association of atoms or by transitions to infinity. pλμ can be fixed by two-center-systems. But rμνλ is still free except for the fulfilling of some simple requirements. The rule of construction proposed for E is an example for using so-called analytical computers.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 149-167 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The general formulas which are convenient for cluster analysis of a configuration interaction wave function are presented. These formulas are then used for cluster analysis of the “complete” configuration interaction wave functions of the π-electronic models of benzene and butadiene obtained with a semiempirical method of the Pariser-Parr-Pople type using three different parameterizations. For butadiene the calculations are carried out with Hückel, Hartree-Fock, and Brueckner molecular orbitals. The results clearly indicate that Sinanoǧlu's statement [1, 2], concerning the relative unimportance of the linked parts of the tetraexcited state coefficients in the ci expansion, is justified for these delocalized systems.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 219-224 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Some calculations are presented on the hydrogen bond using a perturbation theory approach. Results confirm indications of earlier work that perturbation theory is capable of giving a reasonable description of hydrogen bonded systems.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 55
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969) 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 297-301 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The expansion of the wave function for the 23S state of the two-electron atom in the neighbourhood of the singularity at r1 = r2 = 0 is considered. The restrictions imposed on the variational functions by this expansion are discussed. For the 23S state of He, Li+, N5+ the behaviour of the variational function based on the Fock expansion in the neighbourhood of this singularity is investigated. The agreement of the variational coefficients with the theoretical coefficients is satisfactory. The calculated values of E and 〈δ(r2)〉 for He, Li+, N5+ are given.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 317-325 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A method of calculating the energy of the long-range interaction between atoms and charges is presented. Simplification of the solution of the perturbation equations is achieved by a formal use of the “Double-Perturbation Method”. Numerical results for the energies of the 2pσ state of HeH+2 are obtained.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969) 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 445-483 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: An earlier analysis of the canonical form of a pair of invertible operators obeying the exchange rule \documentclass{article}\pagestyle{empty}\begin{document}$$ AB = \omega BA $$\end{document} is extended to cover a set of operators, between each pair of which a relation of this type exists; and for which a power of each operator is the unit matrix. Such relations define a system which may be regarded as a generalization of the Dirac matrices of relativistic quantum mechanics. We concentrate upon the group theoretic aspects of such a system and its matrix representations. Applications arise from the fact that all projective representations of finite abelian groups take the form of a Dirac Group. In particular, the representations of the magnetic space groups, which are projective representations of the lattice groups, arise in this manner.
    Additional Material: 6 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 13-15 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 62
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The π-electronic properties of furan, oxazole, benzofuran, benzoxazole, anthranil, and dibenzofuran are calculated by the semiempirical self-consistent-field molecular orbital method. A single set of parameters is found which satisfactorily reproduces the π → π* electronic transition energies and other π-electronic properties.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 67-71 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Alternatives to the Mulliken method of partitioning the overlap charge density in self-consistent charge molecular-orbital calculations are examined. It is found that more realistic methods may lead to significantly different self-consistent charges, and different ordering of the electronic energy levels.
    Additional Material: 2 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 621-634 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Generalizing the method of Hirschfelder, Curtiss and Bird for the calculation of the polarizability of molecules, we have calculated both the diagonal and off-diagonal polarizability tensor elements of the nucleotide bases and base pairs. In the course of calculations also the components of the permanent dipole moments have been computed for these systems.On the basis of the results obtained we have determined also the critical field strengths necessary to break off a base pair and thus to induce the unwinding of the DNA double helix. According to the data obtained, a field strength of the order 108 V/cm can induce the unwinding of DNA if its direction lies in the plane of the base pairs.
    Additional Material: 3 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 65
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The electronic spectrum of biphenylene has been studied theoretically. The investigation is based on the semi-empirical LCAO SCF MO method with various degrees of approximations. The results have been analysed with regard to the following two factors: (a) The difference in effective electronegativity between the carbon atoms in the four-membered ring and the other carbon atoms in the molecule. (b) The inclusion of doubly excited configurations in the description of the π-electronic molecular states. The theory satisfactorily interprets the excitation energies and the nature of the electronic transitions. The predictions are particularly affected by the inclusion of the doubly excited configurations. On the basis of these results, the empirical parameters used are discussed.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 73-78 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: An adiabetic theory of spin lattice relaxation is proposed. It is shown that if one takes account of the adiabatic adaptation of the electrons to the motion of the ionic complex the motor of the relaxation is not the crystalline potential modulation but the fluctuation of the effective magnetic field produced by the complex near the paramagnetic system.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 107-113 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Using the natural orbital representation and optimizing the exponents in the Slater-type orbital basis, configuration interaction type wave functions for the helium atom are given which combine compactness and high accuracy.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 141-143 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 185-194 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Polarization is shown to play a non-negligible role in two properties of the ground state of benzene-iodine type complexes: their dipole moment, and the halogen infrared spectrum. These results, compared with preceding results concerning π-π complexes, suggest that the ground-state properties of charge-transfer complexes should not be interpreted exclusively by the usual resonance mode.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 225-230 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The zero-field splitting parameters D, E, and D* are calculated theoretically for four phenyl naphthalenes. Esr measurements show that the theoretical calculations are in good agreement with experiment. Comparison of the theoretical and experimental results gives some insight into the geometry of these molecules in their lowest triplet state.
    Additional Material: 2 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 71
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The quantum theory of the Faraday effect or magnetic rotatory power is set up for diamagnetic molecules and is based upon a variation-perturbation method which, unlike the usual Dirac perturbation theory, needs only the knowledge of the wave function ψ0(0) of the ground state of the non-perturbed molecule. The principle of this theory includes in the expression of the perturbed wave function, vectors which characterize the contribution of the different fields of perturbation. The quantities which descríbe the Faraday effect, obtained from the calculation of the electric and magnetic macroscopic dipole moments, are expressed from ψ0(0) and the vectors precedently introduced. They are determined by a variation calculus.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 503-511 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The ground state wave-function of a two electrons atom may be represented to any accuracy by a 1S projected Slater determinant built on hypercomplex spin-orbitals.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 535-535 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 553-568 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Single-exponential functions of the forms 1s̄ = 1s, 2s̄ = N1(2s + b1s + a3s), 2p̄ = N2(2p + c3p) are introduced as an alternative to the Slater orbitals 1s, 2s, 2p for the atoms of the first period. The orbitals are intended for molecular calculations and the parameters a and c should be chosen in order to make the basis consistent with a given preliminary description of the molecule: see Part I, G. Del Re, Intern. J. Quantum Chem. 1, 293 (1967), but, first of all, a study of their behavior in atomic systems is necessary. Therefore orbital exponents and total atomic energies are determined by optimization: the promotion coefficients a and c are zero for best-atoms and the functions become strictly hydrogen-like orbitals. Comparisons are allowed with Slater's, Roothaan's, Ransil's and SCF orbitals.Given promoted 2s̄ and 2p̄ orbitals on carbon atoms in a carbon-carbon sigma bond, we fix the coefficient a and c in order to obtain one center sp orbitals orthogonal to one another. These are discussed, mapped and compared with the two center hybrids obtained by the Löwdin orthogonalization.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 75
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Procedures are presented which are expected to produce good numerical lower bounds to eigenvalues for Hamiltonians having continuous spectra. Further, it is observed how these lower bounds can be utilized in other estimation methods.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 76
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A general formalism is presented for the determination of the optimum natural orbitals within the various strongly orthogonal geminals of a wavefunction describing a 2N-electron closed-shell molecule or atom. The relationship to Hartree-Fock-Roothaan theory is established; the algorithm that is developed is quadratically convergent to the desired result, and does not ignore off diagonal Lagrangian multipliers, or require an infinite series of 2 × 2 orthogonal transformations of the original basis.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 711-722 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The generalized algebraic eigenvalue problem (A - λB)x = 0 arises in the use of the variation method in quantum mechanics. If, within the limitations of the computer word-length, the basis set used to expand the trial wave function is linearly dependent, the matrix B becomes singular. Three different algorithms designed to deal with this difficulty have been investigated, paying special attention to the problem of identifying which members of the basis set are effectively linearly dependent. The advantages and limitations of each method are discussed.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 78
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Using the Rayleigh-Schrödinger perturbation formalism, expressions are obtained for the nth order energy and the nth order wave function. No restrictions are placed on the degeneracy of the state or the order of perturbation in which the degeneracies are resolved. By the use of suitable operators, the formulae are expressed in compact form.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 823-849 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The long range intermolecular forces in terms of the interaction energies between two conjugated molecules are computed and discussed for the cases: (a) a point charge and ethylene, (b) two ethylene molecules, (c) two hexatriene molecules, (d) two benzene molecules, (e) two naphthalene molecules, and (f) two polar merocyanine molecules. The calculations are based on Buckingham's theory of long range intermolecular forces and the author's values for multipole moments and polarizabilities presented previously. The advantage of the treatment is: asymmetric molecules are correctly described and the intermolecular potential is better approximated than by the usual dipole approximation.
    Additional Material: 17 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969) 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 781-793 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Radiation damping of three atoms in a radiation field is studied for both a linear and closed-chain configuration. One atom of the system is initially excited. Use is made of the Heitler-Ma perturbation procedure up to second order. The discussion is developed in terms of the symmetry of the interactions within the system. The interactions arising from dipole transitions perpendicular to the plane of the closed chain are shown to be similar to the interactions in a two-atom system, and the results are extended to cover larger rings.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1064-1066 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1-2 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 45-56 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The configuration interaction method has been applied to the H2 and H3 systems. The effect of increasing the size of the atomic Slater-type orbital basis has been studied. A minimization procedure with respect to orbital exponents has been carried out.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 93-105 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The rotational projection operator previously introduced [12] serves here to build up an explicit formula for the non-relativistic energy associated with a spin-projected determinant. Corresponding orbitals are used throughout, and interchange of configuration space and Euler angles integrations provides rapidly an energy expression previously obtained either by use of Löwdin's projector (via first- and second-order density matrices (8)) or by mixed space and spin permutation operator (GF method (9)).
    Additional Material: 2 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 893-901 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The protonic conductivity in ice crystals is considered within the framework of strong coupling developed earlier by the present authors for semiconductors with narrow bands and strong coupling of electrons with phonons. The generalization for a two-band model is developed. The model used is the one described by Gosar and Pintar, the principal feature of which is the concept of the protonic conduction bands. The analytical expression for the protonic mobility is given. The results of the theory are in qualitative agreement with the experimental data.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 931-943 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: An extended method of calculation for two shells of atomic electrons, based upon the use of non-orthogonal radial orbitals, is presented. The rules for going over from the radial integrals of the ordinary method of calculation to the linear combinations of radial integrals of the extended method of calculation are given. The numerical calculations are carried out for the ground states of lithium- and beryllium-like atomic systems.
    Additional Material: 2 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1013-1025 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: All-electron SCF-LCAO-MO computations for diazomethane, ketene and allene are presented. The basis functions are contracted Gaussian orbitals. Theoretical results are discussed and related to available experimental data.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1055-1058 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1067-1068 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969) 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 92
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A method for the determination of the virtual orbitals for configuration interaction is described. This method is a generalization of the one used by Watson in 1960 for the ground state of the beryllium atom. The important point in the method is to complete the set of functions used successively. As an illustration the method is applied to the ground state of the beryllium atom. The method seems to be efficient.
    Additional Material: 6 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 57-66 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Variational upper and lower bounds for the overlap between an approximate and the true wave function are proposed, and it is shown that the error bounds introduced recently by Gordon are special cases of the variational formulas.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 79-92 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The π-electron distributions, spin densities, and energies of the first triplets of the nucleotide bases, uracil, thymine, cytosine, adenine, and guanine, were investigated in various semiempirical approximations. Results are presented for calculations using the semiempirical form of the closed-shell SCF configuration interaction method, of the different orbitals for different spins (unrestricted Hartree-Fock) treatment, with and without spin projection, and of the Roothaan's open-shell procedure.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 635-650 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Iterative methods for the calculation of the lowest eigenvalue and the corresponding eigenvector are derived from the partitioned Schrödinger equation in matrix form. While they have a formal similarity to the Brillouin-Wigner perturbation expansion, they converge for a much wider class of matrices. The double iteration methods (DIM and DIMA) lead to a series of upper and lower bounds to the desired lowest eigenvalue in accordance with Löwdin's bracketing theorem and can be used in a strategy which insures convergence to the solution for arbitrarily large perturbations. A much more efficient single iteration method (SIMA) produces the proper solution even for numerically very ill-conditioned matrices (large offdiagonal elements and small separation of the diagonal elements from the lowest). An important feature of the iterative methods is their insensitivity toward roundoff errors which makes them especially suited for very large matrices, where direct diagonalisation, for example by the Jacobi method, is impracticable.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 699-710 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A generalization of a theorem on off-diagonal hypervirial relations is obtained and is used to demonstrate when to expect exact solutions of eigenvalue problems using the hypervirial method. Links are established between the hypervirial method and other approximation methods. The harmonic oscillator and hydrogen atom problems are given as examples.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 750-750 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1001-1012 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The mirror reflection symmetry which consists in the correlation of the substitution j → -j -1 with the reflection of the coordinate system and of m → -m with the reflection of the space with respect to the xy-plane has been applied to the quasi-spin formalism. The phases of the wave functions of the shell of equivalent atomic electrons treated as partially filled, as they relate to those when the same shell is treated as almost filled, have been established. The mirror reflection symmetry has been generalized for the supplementary quantum numbers used for distinguishing the terms of the same kind. The phases of the coefficients of fractional parentage of almost filled shell enabling us to determine them from those of partially filled shell have been specified. Corresponding phase relations for the matrix elements of operators have also been considered.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 1058-1061 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Quantum Chemistry 3 (1969), S. 749-749 
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...