Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201

Simultaneous Orthogonal Planarity

We introduce and study the $\textit{OrthoSEFE}-k$ problem: Given $k$ planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces a planar orthogonal drawing of each of the $k$ graphs? We show that the problem is NP-complete for $k \geq 3$ even if the shared graph is a Hamiltonian cycle and has sunflower intersection and for $k \geq 2$ even if the shared graph consists of a cycle and of isolated vertices. Whereas the problem is polynomial-time solvable for $k=2$ when the union graph has maximum degree five and the shared graph is biconnected. Further, when the shared graph is biconnected and has sunflower intersection, we show that every positive instance has an OrthoSEFE with at most three bends per edge.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Which diagnostic tests are most useful in a chest pain unit protocol?

Background The chest pain unit (CPU) provides rapid diagnostic assessment for patients with acute, undifferentiated chest pain, using a combination of electrocardiographic (ECG) recording, biochemical markers and provocative cardiac testing. We aimed to identify which elements of a CPU protocol were most diagnostically and prognostically useful. Methods The Northern General Hospital CPU uses 2–6 hours of serial ECG / ST segment monitoring, CK-MB(mass) on arrival and at least two hours later, troponin T at least six hours after worst pain and exercise treadmill testing. Data were prospectively collected over an eighteen-month period from patients managed on the CPU. Patients discharged after CPU assessment were invited to attend a follow-up appointment 72 hours later for ECG and troponin T measurement. Hospital records of all patients were reviewed to identify adverse cardiac events over the subsequent six months. Diagnostic accuracy of each test was estimated by calculating sensitivity and specificity for: 1) acute coronary syndrome (ACS) with clinical myocardial infarction and 2) ACS with myocyte necrosis. Prognostic value was estimated by calculating the relative risk of an adverse cardiac event following a positive result. Results Of the 706 patients, 30 (4.2%) were diagnosed as ACS with myocardial infarction, 30 (4.2%) as ACS with myocyte necrosis, and 32 (4.5%) suffered an adverse cardiac event. Sensitivities for ACS with myocardial infarction and myocyte necrosis respectively were: serial ECG / ST segment monitoring 33% and 23%; CK-MB(mass) 96% and 63%; troponin T (using 0.03 ng/ml threshold) 96% and 90%. The only test that added useful prognostic information was exercise treadmill testing (relative risk 6 for cardiac death, non-fatal myocardial infarction or arrhythmia over six months). Conclusion Serial ECG / ST monitoring, as used in our protocol, adds little diagnostic or prognostic value in patients with a normal or non-diagnostic initial ECG. CK-MB(mass) can rule out ACS with clinical myocardial infarction but not myocyte necrosis(defined as a troponin elevation without myocardial infarction). Using a low threshold for positivity for troponin T improves sensitivity of this test for myocardial infarction and myocardial necrosis. Exercise treadmill testing predicts subsequent adverse cardiac events

Navy Junior Reserve Officer Training Corps (NJROTC): The Impact of NJROTC Participation on Naval Accessions and Retentions

Officially, the Navy Junior Reserve Officer Training Corps\u27 (NJROTC) mission is to educate high school students on the value of citizenship, public service, and personal responsibility. Since 1916, proponents and opponents have debated the value of the various Junior ROTC programs; however, there has been little empirical research that describes the extent to which these programs have actually benefited the services. As such, the purpose of this study was to examine the NJROTC program by analyzing the impact program participation has on Navy accessions and retentions from 2001 to 2005. The methodology used in this study was an exclusively quantitative analysis of pre-existing data from two large population databases: The Navy JROTC Unit Management System, which included career intent information on 39,745 NJROTC graduates from 2001 to 2005; the other database, from the Defense Management Data Center, provided demographic data on 211,076 Navy accessions from 2001 to 2005. Analysis of these databases revealed that NJROTC graduates\u27 intent to join the military clearly benefits the Navy as a resource for recruiting; specifically, while there were small but positive differences in Naval accessions for most NJROTC participants, there were larger positive differences for women and African-American participants. In the final part of the analysis, a binary logistic regression model was created analyzing retention among several predictor variables; results indicated that the primary predictor variable, NJROTC accessions, were 45 percent more likely to be retained than non-NJROTC accessions after holding all other predictor variables constant. Taken together, the findings of this study have demonstrated that during the 2001–2005 period, NJROTC operated as both a citizenship training program and a source of recruiting for the Navy. As such, there are a number of recommendations for further research; the first, and perhaps most immediate would be for the Navy to conduct a cost-benefit analysis to determine geographically where it makes sense to grant full participation to the 198 schools on the waiting list; the second, and perhaps most important, would involve survey research that targets NJROTC stakeholders to find out what the response would be if the Navy openly declared NJROTC as a recruiting tool

Optimization of an axial fan for air cooled condensers

We report on the low noise optimization of an axial fan specifically designed for the cooling of CSP power plants. The duty point presents an uncommon combination of a load coefficient of 0.11, a flow coefficient of 0.23 and a static efficiency ηstat > 0.6. Calculated fan Reynolds number is equal to Re = 2.85 x 107. Here we present a process used to optimize and numerically verify the fan performance. The optimization of the blade was carried out with a Python code through a brute-force-search algorithm. Using this approach the chord and pitch distributions of the original blade are varied under geometrical constraints, generating a population of over 24000 different possible individuals. Each individual was then tested using an axisymmetric Python code. The software is based on a blade element axisymmetric principle whereby the rotor blade is divided into a number of streamlines. For each of these streamlines, relationships for velocity and pressure are derived from conservation laws for mass, tangential momentum and energy of incompressible flows. The final geometry was eventually chosen among the individuals with the maximum efficiency. The final design performance was then validated through with a CFD simulation. The simulation was carried out using a RANS approach, with the cubic k -  low Reynolds turbulence closure of Lien et al. The numerical simulation was able to verify the air performance of the fan and was used to derive blade-to-blade distributions of design parameters such as flow deviation, velocity components, specific work and diffusion factor of the optimized blade. All the computations were performed in OpenFoam, an open source C++- based CFD library. This work was carried out under MinWaterCSP project, funded by EU H2020 programme

Natural clustering: the modularity approach

We show that modularity, a quantity introduced in the study of networked systems, can be generalized and used in the clustering problem as an indicator for the quality of the solution. The introduction of this measure arises very naturally in the case of clustering algorithms that are rooted in Statistical Mechanics and use the analogy with a physical system.Comment: 11 pages, 5 figure enlarged versio

Probing the Low Mass X-ray Binaries/Globular Cluster connection in NGC1399

We present a wide field study of the Globular Clusters/Low Mass X-ray Binaries connection in the cD elliptical NGC1399, combining HST/ACS and Chandra high resolution data. We find evidence that LMXB formation likelihood is influenced by GCs structural parameters, in addition to the well known effects of mass and metallicity, independently from galactocentric distance.Comment: in press in the Proceedings of the X-ray 2009 Conference, 7-11 September 2009, Bologna, Ital

Monotone Grid Drawings of Planar Graphs

A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this paper we study monotone grid drawings of planar graphs in a variable embedding setting. We show that every connected planar graph of $n$ vertices has a monotone grid drawing on a grid of size $O(n)\times O(n^2)$, and such a drawing can be found in O(n) time

Euclidean Greedy Drawings of Trees

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that admit Euclidean greedy embeddings.Comment: Expanded version of a paper to appear in the 21st European Symposium on Algorithms (ESA 2013). 24 pages, 20 figure