Verfahrenskonzept zur Abtrennung des radioaktiven Kryptons aus demAuflöserabgas mittels Adsorption

A method for separating radioactive krypton from the off-gas of a dissolver is being described, which is based on the principle of adsorption and desorption on adsorbents. The basis for the development of the process concept are laboratory experiments corroborating the feasibility of the individual process steps. Moreover, the different adsorption processes for krypton separation described in the past are taken into account. The entire process essentially consists of three stages which are coupled together: - Retention of NO$_{x}$ residues from the off-gas on molecular sieve and recycling the NO$_{x}$ with part of the waste gas into the dissolver - Deposition of xenon on activated charcoal with simultaneous concentration of krypton in the off-gas - Deposition of krypton from the remaining offgas by means of preparative gas chromatography with coupled filling of pure crypton into storage cylinders containing activated charcoal

Deep levels in a-plane, high Mg-content MgxZn1-xO epitaxial layers grown by molecular beam epitaxy

Deep level defects in n-type unintentionally doped a-plane MgxZn1−xO, grown by molecular beam epitaxy on r-plane sapphire were fully characterized using deep level optical spectroscopy (DLOS) and related methods. Four compositions of MgxZn1−xO were examined with x = 0.31, 0.44, 0.52, and 0.56 together with a control ZnO sample. DLOS measurements revealed the presence of five deep levels in each Mg-containing sample, having energy levels of Ec − 1.4 eV, 2.1 eV, 2.6 V, and Ev + 0.3 eV and 0.6 eV. For all Mg compositions, the activation energies of the first three states were constant with respect to the conduction band edge, whereas the latter two revealed constant activation energies with respect to the valence band edge. In contrast to the ternary materials, only three levels, at Ec − 2.1 eV, Ev + 0.3 eV, and 0.6 eV, were observed for the ZnO control sample in this systematically grown series of samples. Substantially higher concentrations of the deep levels at Ev + 0.3 eV and Ec − 2.1 eV were observed in ZnO compared to the Mg alloyed samples. Moreover, there is a general invariance of trap concentration of the Ev + 0.3 eV and 0.6 eV levels on Mg content, while at least and order of magnitude dependency of the Ec − 1.4 eV and Ec − 2.6 eV levels in Mg alloyed samples

Semi-invariants of symmetric quivers of tame type

A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form on a representation $V$ of $Q$. We shall say that $V$ is orthogonal if is symmetric and symplectic if $$ is skew-symmetric. Moreover, we define an action of products of classical groups on the space of orthogonal representations and on the space of symplectic representations. So we prove that if $(Q,\sigma)$ is a symmetric quiver of tame type then the rings of semi-invariants for this action are spanned by the semi-invariants of determinantal type $c^V$ and, when matrix defining $c^V$ is skew-symmetric, by the Pfaffians $pf^V$. To prove it, moreover, we describe the symplectic and orthogonal generic decomposition of a symmetric dimension vector

The double Ringel-Hall algebra on a hereditary abelian finitary length category

In this paper, we study the category $\mathscr{H}^{(\rho)}$ of semi-stable coherent sheaves of a fixed slope $\rho$ over a weighted projective curve. This category has nice properties: it is a hereditary abelian finitary length category. We will define the Ringel-Hall algebra of $\mathscr{H}^{(\rho)}$ and relate it to generalized Kac-Moody Lie algebras. Finally we obtain the Kac type theorem to describe the indecomposable objects in this category, i.e. the indecomposable semi-stable sheaves.Comment: 29 page

Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Re-embedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). This is an extended abstract. For a full version of this paper, see Hong S-H, Nagamochi H.: Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time, Technical Report TR 2016-002, Department of Applied Mathematics and Physics, Kyoto University (2016

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs of crossing edges share a vertex. A 1-planar drawing is NIC-planar if no two pairs of crossing edges share two vertices. We study the relations of these beyond-planar graph classes (beyond-planar graphs is a collective term for the primary attempts to generalize the planar graphs) to right-angle crossing (RAC) graphs that admit compact drawings on the grid with few bends. We present four drawing algorithms that preserve the given embeddings. First, we show that every $n$-vertex NIC-planar graph admits a NIC-planar RAC drawing with at most one bend per edge on a grid of size $O(n) \times O(n)$. Then, we show that every $n$-vertex 1-planar graph admits a 1-planar RAC drawing with at most two bends per edge on a grid of size $O(n^3) \times O(n^3)$. Finally, we make two known algorithms embedding-preserving; for drawing 1-planar RAC graphs with at most one bend per edge and for drawing IC-planar RAC graphs straight-line

Contact Representations of Graphs in 3D

We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a representation. This result extends the existing primal-dual contact representations of planar graphs in 2D using circles and triangles. While contact graphs in 2D directly correspond to planar graphs, we next study representations of non-planar graphs in 3D. In particular we consider representations of optimal 1-planar graphs. A graph is 1-planar if there exists a drawing in the plane where each edge is crossed at most once, and an optimal n-vertex 1-planar graph has the maximum (4n - 8) number of edges. We describe a linear-time algorithm for representing optimal 1-planar graphs without separating 4-cycles with 3D boxes. However, not every optimal 1-planar graph admits a representation with boxes. Hence, we consider contact representations with the next simplest axis-aligned 3D object, L-shaped polyhedra. We provide a quadratic-time algorithm for representing optimal 1-planar graph with L-shaped polyhedra

Semi-invariants of symmetric quivers of finite type

Let $(Q,\sigma)$ be a symmetric quiver, where $Q=(Q_0,Q_1)$ is a finite quiver without oriented cycles and $\sigma$ is a contravariant involution on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form on a representation $V$ of $Q$. We shall call the representation orthogonal if is symmetric and symplectic if $$ is skew-symmetric. Moreover we can define an action of products of classical groups on the space of orthogonal representations and on the space of symplectic representations. For symmetric quivers of finite type, we prove that the rings of semi-invariants for this action are spanned by the semi-invariants of determinantal type $c^V$ and, in the case when matrix defining $c^V$ is skew-symmetric, by the Pfaffians $pf^V$