Is zero focalization reducible to variable internal and external focalization?

Ist Nullfokalisierung etwas anderes als (variable) interne und/oder externe Fokalisierung? Der Beitrag argumentiert, dass dies durchaus der Fall ist: Legt man die durch Genette popularisierte Theorie von Fokalisierungstypen zugrunde, so ist Nullfokalisierung nicht auf interne oder externe Fokalisierung zurückführbar. Dasselbe gilt, wenn die Genette'sche Theorie der Fokalisierung durch eine plausiblere Alternativtheorie ersetzt wird. Der Beitrag erläutert und begründet diese Thesen

Software for cut-generating functions in the Gomory--Johnson model and beyond

We present software for investigations with cut generating functions in the Gomory-Johnson model and extensions, implemented in the computer algebra system SageMath.Comment: 8 pages, 3 figures; to appear in Proc. International Congress on Mathematical Software 201

Dynamic-explicit finite element simulation of complex problems in civil engineering by parallel computing

The paper deals with the simulation of the non-linear and time dependent behaviour of complex structures in engineering. Such simulations have to provide high accuracy in the prediction of deformations and stability, by taking into account the long term influences of the non-linear behaviour of the material as well as the large deformation and contact conditions. The limiting factors of the computer simulation are the computer run time and the memory requirement during solving large scale problems. To overcome these problems we use a dynamic-explicit time integration procedure for the solution of the semi-discrete equations of motion, which is very suited for parallel processing. In the paper at first we give a brief review of the theoretical background of the mechanical modelling and the dynamic-explicit technique for the solution of the semi-discrete equations of motion. Then the concept of parallel processing will be discussed . A test example concludes the paper

Core Hole Double-Excitation and Atomiclike Auger Decay in N₂

Core hole decay spectra of the free N2 molecule show evidence for hitherto unobserved molecular resonances both below and above the K-shell photoionization threshold. Based on earlier calculations they are assigned to doubly excited neutral states which could not be seen below threshold in recent high resolution absorption spectra because of the more intense core-to-Rydberg excitations. By calculating the Auger spectrum of core-excited nitrogen atoms, we show that the features are atomiclike

Integer Polynomial Optimization in Fixed Dimension

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials that are non-negative over the polytope, these sequences of bounds lead to a fully polynomial-time approximation scheme for the optimization problem.Comment: In this revised version we include a stronger complexity bound on our algorithm. Our algorithm is in fact an FPTAS (fully polynomial-time approximation scheme) to maximize a non-negative integer polynomial over the lattice points of a polytop

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed. Moreover, using a weaker notion of approximation, we show the existence of a fully polynomial-time approximation scheme for the problem of maximizing or minimizing an arbitrary polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.Comment: 16 pages, 4 figures; to appear in Mathematical Programmin

High-resolution C 1s photoelectron spectra of methane

The C 1s partial photoionization cross section and photoelectron angular distribution of methane (CH4) have been measured with high-energy resolution between threshold and 385 eV photon energy. From the analysis of the vibrational fine structure on the C 1s−1 photoelectron line a vibrational energy of 396±2 meV and an equilibrium bond length of 1.039(±0.001) Å for the CH+4 ion have been determined. The lifetime broadening was found to be 83(±10) meV. The weak feature in the photoabsorption cross section just above threshold does not influence the vibrational fine structure in a way typical for a shape resonance. We therefore suggest that it is due to doubly excited states of the type C (1s)−1(Val)−1(Ryd)1a(Ryd)1b, an assignment which is supported by recent Auger decay studies. Measurements of the shakeup structure revealed six satellite lines, one of which increases strongly in intensity at threshold, thus pointing to the existence of a conjugate shakeup process

A parametric integer programming algorithm for bilevel mixed integer programs

We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time polynomial in the logarithm of the relative precision. For the pure integer case where the leader's variables are integer, and hence optimal solutions are guaranteed to exist, we present two algorithms which run in polynomial time when the total number of variables is fixed.Comment: 11 page