An Operationally Based Vision Assessment Simulator for Domes

The Operational Based Vision Assessment (OBVA) simulator was designed and built by NASA and the United States Air Force (USAF) to provide the Air Force School of Aerospace Medicine (USAFSAM) with a scientific testing laboratory to study human vision and testing standards in an operationally relevant environment. This paper describes the general design objectives and implementation characteristics of the simulator visual system being created to meet these requirements. A key design objective for the OBVA research simulator is to develop a real-time computer image generator (IG) and display subsystem that can display and update at 120 frame s per second (design target), or at a minimum, 60 frames per second, with minimal transport delay using commercial off-the-shelf (COTS) technology. There are three key parts of the OBVA simulator that are described in this paper: i) the real-time computer image generator, ii) the various COTS technology used to construct the simulator, and iii) the spherical dome display and real-time distortion correction subsystem. We describe the various issues, possible COTS solutions, and remaining problem areas identified by NASA and the USAF while designing and building the simulator for future vision research. We also describe the critically important relationship of the physical display components including distortion correction for the dome consistent with an objective of minimizing latency in the system. The performance of the automatic calibration system used in the dome is also described. Various recommendations for possible future implementations shall also be discussed

Square Integer Heffter Arrays with Empty Cells

A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and $iii)$ no element from $\{x,-x\}$ appears twice. Heffter arrays are useful in embedding the complete graph $K_{2nm+1}$ on an orientable surface where the embedding has the property that each edge borders exactly one $s-$cycle and one $t-$cycle. Archdeacon, Boothby and Dinitz proved that these arrays can be constructed in the case when $s=m$, i.e. every cell is filled. In this paper we concentrate on square arrays with empty cells where every row sum and every column sum is $0$ in $\mathbb{Z}$. We solve most of the instances of this case.Comment: 20 pages, including 2 figure

On Hardness of the Joint Crossing Number

The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with diagonal flips in triangulations of surfaces, and subsequently investigated in a general form for small-genus surfaces. We prove that all of the commonly considered variants of this problem are NP-hard already in the orientable surface of genus 6, by a reduction from a special variant of the anchored crossing number problem of Cabello and Mohar

A single amino acid substitution beyond the C2H2-zinc finger in Ros derepresses virulence and T-DNA genes in Agrobacterium tumefaciens

Ros is a chromosomally-encoded repressor containing a novel C2H2 zinc finger in Agrobacterium tumefaciens. Ros regulates the expression of six virulence genes and an oncogene on the Ti plasmid. Constitutive expression of these genes occurs in the spontaneous mutant 4011R derived from the octopine strain Ach-5, resulting in T-DNA processing in the absence of induction, and in the biosynthesis of cytokinin. Interestingly, the mutation in 4011R is an Arg to Cys conversion at amino acid residue 125 near the C-terminus well outside the zinc finger of Ros. Yet, Ros bearing this mutation is unable to bind to the Ros-box and is unable to complement other ros mutant

Clusters of Cycles

A {\it cluster of cycles} (or {\it $(r,q)$-polycycle}) is a simple planar 2--co nnected finite or countable graph $G$ of girth $r$ and maximal vertex-degree $q$, which admits {\it $(r,q)$-polycyclic realization} on the plane, denote it by $P(G)$, i.e. such that: (i) all interior vertices are of degree $q$, (ii) all interior faces (denote their number by $p_r$) are combinatorial $r$-gons and (implied by (i), (ii)) (iii) all vertices, edges and interior faces form a cell-complex. An example of $(r,q)$-polycycle is the skeleton of $(r^q)$, i.e. of the $q$-valent partition of the sphere $S^2$, Euclidean plane $R^2$ or hyperbolic plane $H^2$ by regular $r$-gons. Call {\it spheric} pairs $(r,q)=(3,3),(3,4),(4,3),(3,5),(5,3)$; for those five pairs $P(r^q)$ is $(r^q)$ without the exterior face; otherwise $P(r^q)=(r^q)$. We give here a compact survey of results on $(r,q)$-polycycles.Comment: 21. to in appear in Journal of Geometry and Physic