Nuclear electric propulsion development and qualification facilities

This paper summarizes the findings of a Tri-Agency panel consisting of members from the National Aeronautics and Space Administration (NASA), U.S. Department of Energy (DOE), and U.S. Department of Defense (DOD) that were charged with reviewing the status and availability of facilities to test components and subsystems for megawatt-class nuclear electric propulsion (NEP) systems. The facilities required to support development of NEP are available in NASA centers, DOE laboratories, and industry. However, several key facilities require significant and near-term modification in order to perform the testing required to meet a 2014 launch date. For the higher powered Mars cargo and piloted missions, the priority established for facility preparation is: (1) a thruster developmental testing facility, (2) a thruster lifetime testing facility, (3) a dynamic energy conversion development and demonstration facility, and (4) an advanced reactor testing facility (if required to demonstrate an advanced multiwatt power system). Facilities to support development of the power conditioning and heat rejection subsystems are available in industry, federal laboratories, and universities. In addition to the development facilities, a new preflight qualifications and acceptance testing facility will be required to support the deployment of NEP systems for precursor, cargo, or piloted Mars missions. Because the deployment strategy for NEP involves early demonstration missions, the demonstration of the SP-100 power system is needed by the early 2000's

Iridium Corroles Exhibit Weak Near-Infrared Phosphorescence but Efficiently Sensitize Singlet Oxygen Formation.

Six-coordinate iridium(III) triarylcorrole derivatives, Ir[TpXPC)]L2, where TpXPC = tris(para-X-phenyl)corrole (X = CF3, H, Me, and OCH3) and L = pyridine (py), trimethylamine (tma), isoquinoline (isoq), 4-dimethylaminopyridine (dmap), and 4-picolinic acid (4pa), have been examined, with a view to identifying axial ligands most conducive to near-infrared phosphorescence. Disappointingly, the phosphorescence quantum yield invariably turned out to be very low, about 0.02 - 0.04% at ambient temperature, with about a two-fold increase at 77 K. Phosphorescence decay times were found to be around ~5 µs at 295 K and ~10 µs at 77 K. Fortunately, two of the Ir[TpCF3PC)]L2 derivatives, which were tested for their ability to sensitize singlet oxygen formation, were found to do so efficiently with quantum yields Φ(1O2) = 0.71 and 0.38 for L = py and 4pa, respectively. Iridium corroles thus may hold promise as photosensitizers in photodynamic therapy (PDT). The possibility of varying the axial ligand and of attaching biotargeting groups at the axial positions makes iridium corroles particularly exciting as PDT drug candidates

Box representations of embedded graphs

A $d$-box is the cartesian product of $d$ intervals of $\mathbb{R}$ and a $d$-box representation of a graph $G$ is a representation of $G$ as the intersection graph of a set of $d$-boxes in $\mathbb{R}^d$. It was proved by Thomassen in 1986 that every planar graph has a 3-box representation. In this paper we prove that every graph embedded in a fixed orientable surface, without short non-contractible cycles, has a 5-box representation. This directly implies that there is a function $f$, such that in every graph of genus $g$, a set of at most $f(g)$ vertices can be removed so that the resulting graph has a 5-box representation. We show that such a function $f$ can be made linear in $g$. Finally, we prove that for any proper minor-closed class $\mathcal{F}$, there is a constant $c(\mathcal{F})$ such that every graph of $\mathcal{F}$ without cycles of length less than $c(\mathcal{F})$ has a 3-box representation, which is best possible.Comment: 16 pages, 6 figures - revised versio

Hamiltonicity of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are Hamiltonian. As a consequence we obtain that if a vertex-transitive graph is isomorphic to the 3-arc graph of a connected arc-transitive graph of degree at least three, then it is Hamiltonian. This confirms the well known conjecture, that all vertex-transitive graphs with finitely many exceptions are Hamiltonian, for a large family of vertex-transitive graphs. We also prove that if a graph with at least four vertices is Hamilton-connected, then so are its iterative 3-arc graphs.Comment: in press Graphs and Combinatorics, 201

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of rectangles intersects. First, we investigate combinatorial contact arrangements, i.e., arrangements of interior-disjoint rectangles, with a triangle-free intersection graph. We show that such rectangle arrangements are in bijection with the 4-orientations of an underlying planar multigraph and prove that there is a corresponding geometric rectangle contact arrangement. Moreover, we prove that every triangle-free planar graph is the contact graph of such an arrangement. Secondly, we introduce the question whether a given rectangle arrangement has a combinatorially equivalent square arrangement. In addition to some necessary conditions and counterexamples, we show that rectangle arrangements pierced by a horizontal line are squarable under certain sufficient conditions.Comment: 15 pages, 13 figures, extended version of a paper to appear at the International Symposium on Graph Drawing and Network Visualization (GD) 201

Plasmas and Controlled Nuclear Fusion

Contains reports on two research projects.U. S. Atomic Energy Commission (Contract AT(11-1)-3070

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of classic and parametrized algorithms. Several computational complexity results are also presented, which improve on the previous results found in the literature. We propose the new structural parameter for undirected, simple graphs -- the triangle-free chromatic number $\chi_3$. We bound $\chi_3$ by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observation about our problem. We give/ask several conjectures/questions throughout this paper to encourage new research in the area of graph coloring.Comment: Extended abstrac

A Planarity Test via Construction Sequences

Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple reduction from planarity testing to the problem of computing a certain construction of a 3-connected graph. The approach is different from previous planarity tests; as key concept, we maintain a planar embedding that is 3-connected at each point in time. The algorithm runs in linear time and computes a planar embedding if the input graph is planar and a Kuratowski-subdivision otherwise

Local Ties as Self-Reported Constraints to Internal Migration in Spain

The internal migration literature has identified various factors that deter migration and encourage staying, but has been less concerned with people’s own reports about what makes it difficult for them to migrate or makes them want to stay. We explore factors that make it difficult to change the place of residence—from here on denoted as constraints—reported in the Spanish survey on Attitudes and Expectations of Spatial Mobility in the Labour Force (N = 3892). These constraints were uniquely asked from all respondents through an open-ended question, regardless of their migration intentions. We find that many self-reported constraints correspond to factors that have previously been associated with decreased migration propensities. In order of frequency, respondents reported ties to family and friends, ties to their residential environment, financial limitations, and ties to work as constraints to migration. Our results further show that the likelihood of mentioning ties to family and friends as constraints decreased with age, was higher for women than for men and for people who lived close to most of their social network than for those who did not. Mentioning ties to the residential environment as constraints was positively associated with being partnered, and also with living in one’s birthplace. People who were unemployed were less likely to mention ties to work and were more likely to report financial limitations as constraints than people who had a permanent contract—whereas being self-employed was positively associated with mentioning ties to the residential environment