Homology class of a Lagrangian Klein bottle

It is shown that an embedded Lagrangian Klein bottle represents a non-trivial mod 2 homology class in a compact symplectic four-manifold $(X,\omega)$ with $c_1(X)\cdot[\omega]>0$. (In versions 1 and 2, the last assumption was missing. A counterexample to this general claim and the first proof of the corrected result have been found by Vsevolod Shevchishin.) As a corollary one obtains that the Klein bottle does not admit a Lagrangian embedding into the standard symplectic four-space.Comment: Version 3 - completely rewritten to correct a mistake; Version 4 - minor edits, added references; AMSLaTeX, 6 page

Data Integration Driven Ontology Design, Case Study Smart City

Methods to design of formal ontologies have been in focus of research since the early nineties when their importance and conceivable practical application in engineering sciences had been understood. However, often significant customization of generic methodologies is required when they are applied in tangible scenarios. In this paper, we present a methodology for ontology design developed in the context of data integration. In this scenario, a targeting ontology is applied as a mediator for distinct schemas of individual data sources and, furthermore, as a reference schema for federated data queries. The methodology has been used and evaluated in a case study aiming at integration of buildings' energy and carbon emission related data. We claim that we have made the design process much more efficient and that there is a high potential to reuse the methodology

Verifiable conditions of ℓ1\ell_1-recovery of sparse signals with sign restrictions

We propose necessary and sufficient conditions for a sensing matrix to be "s-semigood" -- to allow for exact $\ell_1$-recovery of sparse signals with at most $s$ nonzero entries under sign restrictions on part of the entries. We express the error bounds for imperfect $\ell_1$-recovery in terms of the characteristics underlying these conditions. Furthermore, we demonstrate that these characteristics, although difficult to evaluate, lead to verifiable sufficient conditions for exact sparse $\ell_1$-recovery and to efficiently computable upper bounds on those $s$ for which a given sensing matrix is $s$-semigood. We concentrate on the properties of proposed verifiable sufficient conditions of $s$-semigoodness and describe their limits of performance

Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints

We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, for the listed different settings, a Mirror Descent with adaptive stepsizes and adaptive stopping rule. This means that neither stepsize nor stopping rule require to know the Lipschitz constant of the objective or constraint. We also construct Mirror Descent for problems with objective function, which is not Lipschitz continuous, e.g. is a quadratic function. Besides that, we address the problem of recovering the solution of the dual problem

Mirror-Descent Methods in Mixed-Integer Convex Optimization

In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the problem can be solved in polynomial time as well. For problems with two integer variables, we show that the oracle can be implemented efficiently, that is, in O(ln(B)) approximate minimizations of f over the continuous variables, where B is a known bound on the absolute value of the integer variables.Our algorithm can be adapted to find the second best point of a purely integer convex optimization problem in two dimensions, and more generally its k-th best point. This observation allows us to formulate a finite-time algorithm for mixed-integer convex optimization

Detailed Studies of Pixelated CZT Detectors Grown with the Modified Horizontal Bridgman Method

The detector material Cadmium Zinc Telluride (CZT), known for its high resolution over a broad energy range, is produced mainly by two methods: the Modified High-Pressure Bridgman (MHB) and the High-Pressure Bridgman (HPB) process. This study is based on MHB CZT substrates from the company Orbotech Medical Solutions Ltd. with a detector size of 2.0x2.0x0.5 cm^3, 8x8 pixels and a pitch of 2.46 mm. Former studies have emphasized only on the cathode material showing that high-work-function improve the energy resolution at lower energies. Therfore, we studied the influence of the anode material while keeping the cathode material constant. We used four different materials: Indium, Titanium, Chromium and Gold with work-functions between 4.1 eV and 5.1 eV. The low work-function materials Indium and Titanium achieved the best performance with energy resolutions: 2.0 keV (at 59 keV) and 1.9 keV (at 122 keV) for Titanium; 2.1 keV (at 59 keV) and 2.9 keV (at 122 keV) for Indium. These detectors are very competitive compared with the more expensive ones based on HPB material if one takes the large pixel pitch of 2.46 mm into account. We present a detailed comparison of our detector response with 3-D simulations, from which we determined the mobility-lifetime-products for electrons and holes. Finally, we evaluated the temperature dependency of the detector performance and mobility-lifetime-products, which is important for many applications. With decreasing temperature down to -30C the breakdown voltage increases and the electron mobility-lifetime-product decreases by about 30% over a range from 20C to -30C. This causes the energy resolution to deteriorate, but the concomitantly increasing breakdown voltage makes it possible to increase the applied bias voltage and restore the full performance.Comment: Accepted for publication in Astroparticle Physics, 25 pages, 13 figure

Intersections of quadrics, moment-angle manifolds, and Hamiltonian-minimal Lagrangian embeddings

We study the topology of Hamiltonian-minimal Lagrangian submanifolds N in C^m constructed from intersections of real quadrics in a work of the first author. This construction is linked via an embedding criterion to the well-known Delzant construction of Hamiltonian toric manifolds. We establish the following topological properties of N: every N embeds as a submanifold in the corresponding moment-angle manifold Z, and every N is the total space of two different fibrations, one over the torus T^{m-n} with fibre a real moment-angle manifold R, and another over a quotient of R by a finite group with fibre a torus. These properties are used to produce new examples of Hamiltonian-minimal Lagrangian submanifolds with quite complicated topology.Comment: 14 pages, published version (minor changes

Freezing of Spinodal Decompostion by Irreversible Chemical Growth Reaction

We present a description of the freezing of spinodal decomposition in systems, which contain simultaneous irreversible chemical reactions, in the hydrodynamic limit approximation. From own results we conclude, that the chemical reaction leads to an onset of spinodal decomposition also in the case of an initial system which is completely miscible and can lead to an extreme retardation of the dynamics of the spinodal decomposition, with the probability of a general freezing of this process, which can be experimetally observed in simultaneous IPN formation.Comment: 10 page