Could Nano-Structured Materials Enable the Improved Pressure Vessels for Deep Atmospheric Probes?

A viewgraph presentation on the use of Nano-Structured Materials to enable pressure vessel structures for deep atmospheric probes is shown. The topics include: 1) High Temperature/Pressure in Key X-Environments; 2) The Case for Use of Nano-Structured Materials Pressure Vessel Design; 3) Carbon based Nanomaterials; 4) Nanotube production & purification; 5) Nanomechanics of Carbon Nanotubes; 6) CNT-composites: Example (Polymer); 7) Effect of Loading sequence on Composite with 8% by volume; 8) Models for Particulate Reinforced Composites; 9) Fullerene/Ti Composite for High Strength-Insulating Layer; 10) Fullerene/Epoxy Composite for High Strength-Insulating Layer; 11) Models for Continuous Fiber Reinforced Composites; 12) Tensile Strength for Discontinuous Fiber Composite; 13) Ti + SWNT Composites: Thermal/Mechanical; 14) Ti + SWNT Composites: Tensile Strength; and 15) Nano-structured Shell for Pressure Vessels

The Complexity of Drawing Graphs on Few Lines and Few Planes

It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines in $\mathbb{R}^d$ that together can cover all edges of a drawing of $G$. For $d=2$, $G$ must be planar. We investigate the complexity of computing these parameters and obtain the following hardness and algorithmic results. - For $d\in\{2,3\}$, we prove that deciding whether $\rho^1_d(G)\le k$ for a given graph $G$ and integer $k$ is ${\exists\mathbb{R}}$-complete. - Since $\mathrm{NP}\subseteq{\exists\mathbb{R}}$, deciding $\rho^1_d(G)\le k$ is NP-hard for $d\in\{2,3\}$. On the positive side, we show that the problem is fixed-parameter tractable with respect to $k$. - Since ${\exists\mathbb{R}}\subseteq\mathrm{PSPACE}$, both $\rho^1_2(G)$ and $\rho^1_3(G)$ are computable in polynomial space. On the negative side, we show that drawings that are optimal with respect to $\rho^1_2$ or $\rho^1_3$ sometimes require irrational coordinates. - Let $\rho^2_3(G)$ be the minimum number of planes in $\mathbb{R}^3$ needed to cover a straight-line drawing of a graph $G$. We prove that deciding whether $\rho^2_3(G)\le k$ is NP-hard for any fixed $k \ge 2$. Hence, the problem is not fixed-parameter tractable with respect to $k$ unless $\mathrm{P}=\mathrm{NP}$

Recognizing hyperelliptic graphs in polynomial time

Recently, a new set of multigraph parameters was defined, called "gonalities". Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number theory and multigraph algorithms. Multigraphs of gonality 1 are trees. We consider so-called "hyperelliptic graphs" (multigraphs of gonality 2) and provide a safe and complete sets of reduction rules for such multigraphs, showing that for three of the flavors of gonality, we can recognize hyperelliptic graphs in O(n log n+m) time, where n is the number of vertices and m the number of edges of the multigraph.Comment: 33 pages, 8 figure

A Unifying Model of Genome Evolution Under Parsimony

We present a data structure called a history graph that offers a practical basis for the analysis of genome evolution. It conceptually simplifies the study of parsimonious evolutionary histories by representing both substitutions and double cut and join (DCJ) rearrangements in the presence of duplications. The problem of constructing parsimonious history graphs thus subsumes related maximum parsimony problems in the fields of phylogenetic reconstruction and genome rearrangement. We show that tractable functions can be used to define upper and lower bounds on the minimum number of substitutions and DCJ rearrangements needed to explain any history graph. These bounds become tight for a special type of unambiguous history graph called an ancestral variation graph (AVG), which constrains in its combinatorial structure the number of operations required. We finally demonstrate that for a given history graph $G$, a finite set of AVGs describe all parsimonious interpretations of $G$, and this set can be explored with a few sampling moves.Comment: 52 pages, 24 figure

Approximation algorithms for general cluster routing problem

Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we study constant approximation algorithms for some variations of the general cluster routing problem. In this problem, we are given an edge-weighted complete undirected graph $G=(V,E,c),$ whose vertex set is partitioned into clusters $C_{1},\dots ,C_{k}.$ We are also given a subset $V'$ of $V$ and a subset $E'$ of $E.$ The weight function $c$ satisfies the triangle inequality. The goal is to find a minimum cost walk $T$ that visits each vertex in $V'$ only once, traverses every edge in $E'$ at least once and for every $i\in [k]$ all vertices of $C_i$ are traversed consecutively.Comment: In COCOON 202

Team Objective Structured Bedside Assessment (TOSBA) as formative assessment in undergraduate Obstetrics and Gynaecology: a cohort study.

BACKGROUND: Team Objective Structured Bedside Assessment (TOSBA) is a learning approach in which a team of medical students undertake a set of structured clinical tasks with real patients in order to reach a diagnosis and formulate a management plan and receive immediate feedback on their performance from a facilitator. TOSBA was introduced as formative assessment to an 8-week undergraduate teaching programme in Obstetrics and Gynaecology (O\u26G) in 2013/14. Each student completed 5 TOSBA sessions during the rotation. The aim of the study was to evaluate TOSBA as a teaching method to provide formative assessment for medical students during their clinical rotation. The research questions were: Does TOSBA improve clinical, communication and/or reasoning skills? Does TOSBA provide quality feedback? METHODS: A prospective cohort study was conducted over a full academic year (2013/14). The study used 2 methods to evaluate TOSBA as a teaching method to provide formative assessment: (1) an online survey of TOSBA at the end of the rotation and (2) a comparison of the student performance in TOSBA with their performance in the final summative examination. RESULTS: During the 2013/14 academic year, 157 students completed the O\u26G programme and the final summative examination . Each student completed the required 5 TOSBA tasks. The response rate to the student survey was 68 % (n = 107/157). Students reported that TOSBA was a beneficial learning experience with a positive impact on clinical, communication and reasoning skills. Students rated the quality of feedback provided by TOSBA as high. Students identified the observation of the performance and feedback of other students within their TOSBA team as key features. High achieving students performed well in both TOSBA and summative assessments. The majority of students who performed poorly in TOSBA subsequently passed the summative assessments (n = 20/21, 95 %). Conversely, the majority of students who failed the summative assessments had satisfactory scores in TOSBA (n = 6/7, 86 %). CONCLUSIONS: TOSBA has a positive impact on the clinical, communication and reasoning skills of medical students through the provision of high-quality feedback. The use of structured pre-defined tasks, the observation of the performance and feedback of other students and the use of real patients are key elements of TOSBA. Avoiding student complacency and providing accurate feedback from TOSBA are on-going challenges

Business Models and E-Services: an Ontological Approach in a Cross-border Environment

Monograph's chapter