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

‘Writing’ through design, an active practice

Stemming from a collaborative research project ‘designing, writing’, this article outlines preliminary findings to the various ways that design practices and design processes contextualize and explicate an intellectual proposition, i.e. how design contributes to advancing knowledge. The overall aim of the research investigation is to disseminate current understanding and best practice on the relationships between designing and writing and their mutual interest in speculation, expression and research. While most discussions around this topic adopt one of two (often polarized) distinct positions – the written text as sole authority and a design object’s capacity to be read as a cultural artefact – our investigation looks at various media of design articulation directly linked to design as a system of inquiry including but not limited to diaries, diagrams and choreographic notation and comics. These media expose a potential to ‘write’ through design and expand design research as non-linear, theoretical and yet practical tools

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

Pole Dancing: 3D Morphs for Tree Drawings

We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with $O(\log n)$ steps, while for the latter $\Theta(n)$ steps are always sufficient and sometimes necessary.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

The Complexity of Separating Points in the Plane

We study the following separation problem: given n connected curves and two points s and t in the plane, compute the minimum number of curves one needs to retain so that any path connecting s to t intersects some of the retained curves. We give the first polynomial (O(n3)) time algorithm for the problem, assuming that the curves have reasonable computational properties. The algorithm is based on considering the intersection graph of the curves, defining an appropriate family of closed walks in the intersection graph that satisfies the 3-path-condition, and arguing that a shortest cycle in the family gives an optimal solution. The 3-path-condition has been used mainly in topological graph theory, and thus its use here makes the connection to topology clear. We also show that the generalized version, where several input points are to be separated, is NP-hard for natural families of curves, like segments in two directions or unit circles