The Flow of South Carolina Harvested Seafood Products through South Carolina Markets

Marketing,

Octilinear Force-Directed Layout with Mental Map Preservation for Schematic Diagrams

We present an algorithm for automatically laying out metro map style schematics using a force-directed approach, where we use a localized version of the standard spring embedder forces combined with an octilinear magnetic force. The two types of forces used during layout are naturally conflicting, and the existing method of simply combining these to generate a resultant force does not give satisfactory results. Hence we vary the forces, emphasizing the standard forces in the beginning to produce a well distributed graph, with the octilinear forces becoming prevalent at the end of the layout, to ensure that the key requirement of line angles at intervals of 45? is obtained. Our method is considerably faster than the more commonly used search-based approaches, and we believe the results are superior to the previous force-directed approach. We have further developed this technique to address the issues of dynamic schematic layout. We use a Delaunay triangulation to construct a schematic “frame”, which is used to retain relative node positions and permits full control of the level of mental map preservation. This technique is the first to combine mental map preservation techniques with the additional layout criteria of schematic diagrams. To conclude, we present the results of a study to investigate the relationship between the level of mental map preservation and the user response time and accuracy

Systematic study of the decay rates of antiprotonic helium states

A systematic study of the decay rates of antiprotonic helium (\pbhef and \pbhet) at CERN AD (Antiproton Decelerator) has been made by a laser spectroscopic method. The decay rates of some of its short-lived states, namely those for which the Auger rates $\gamma_{\mathrm{A}}$ are much larger than their radiative decay rates ($\gamma_{\mathrm{rad}} \sim 1$ $\mu$s$^{-1}$), were determined from the time distributions of the antiproton annihilation signals induced by laser beams, and the widths of the atomic resonance lines. The magnitude of the decay rates, especially their relation with the transition multipolarity, is discussed and compared with theoretical calculations.Comment: 6 pages, 5 figures, and 1 tabl

Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Re-embedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). This is an extended abstract. For a full version of this paper, see Hong S-H, Nagamochi H.: Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time, Technical Report TR 2016-002, Department of Applied Mathematics and Physics, Kyoto University (2016

Participant preferences for an aboriginal-specific fall prevention program: Measuring the value of culturally-appropriate care

© 2018 Angell et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Background Culturally-specific services are central to efforts to improve the health of Aboriginal Australians. Few empirical studies have demonstrated the value of such services relative to mainstream alternatives. Objective To assess the preferences and willingness to pay (WTP) of participants for attending a class and the relative importance of transport, cost and cultural-appropriateness in the choices made by participants. Design A discrete choice experiment (DCE) was conducted alongside a study of a culturally-specific fall-prevention service. Attributes that were assessed were out-of-pocket costs, whether transport was provided and whether the class was Aboriginal-specific. Choices of participants were modelled using panel-mixed logit methods. Results 60 patients completed the DCE. Attending a service was strongly preferred over no service (selected 99% of the time). Assuming equivalent efficacy of fall-prevention programs, participants indicated a preference for services that were culturally-specific (OR 1.25 95% CI: 1.00–1.55) and incurred lower out-of-pocket participant costs (OR 1.19 95% CI 1.11–1.27). The provision of transport did not have a statistically significant influence on service choice (p = 0.57). Discussion and conclusions This represents the first published DCE in the health field examining preferences amongst an Aboriginal population. The results empirically demonstrate the value of the culturally-specific element of a program has to this cohort and the potential that stated-preference methods can have in incorporating the preferences of Aboriginal Australians and valuing cultural components of health services. Note on terminology As the majority of the NSW Aboriginal and Torres Strait Islander population is Aboriginal (97.2%), this population will be referred to as ‘Aboriginal’ in this manuscript

Demographic drivers of the growth of the number of Aboriginal and Torres Strait Islander people living with dementia, 2016–2051

Objective: To examine the demographic drivers that contribute to the future growth in the population of Aboriginal and Torres Strait Islander peoples living with dementia in Australia. Methods: Design: Multistate, Indigenous status, cohort component, population projection model. Setting: National-level, Aboriginal and Torres Strait Islander population. Data: Data prepared by the Australian Bureau of Statistics on births, deaths, migration and identification change. Australian Institute of Health and Welfare estimates of dementia prevalence alongside estimates from several studies. Major outcome measures: Number of older people living with dementia alongside a decomposition of demographic drivers of growth. Results: By 2051, the relative growth in the number of Aboriginal and Torres Strait Islander peoples aged 50+ with dementia ranges from 4½ to 5½ times (under three prevalence scenarios) its 2016 estimate. Cohort flow (the gradual movement of younger cohorts into the 50+ age group, and the depletion of older cohorts from death, over time) is a key driver of the growth in the number of older people living with dementia. Conclusions: High growth in the number of people living with dementia poses implications for culturally appropriate care, health-care access and support for Aboriginal and Torres Strait Islander families, carers and their communities

Hyperfine structure of antiprotonic helium revealed by a laser-microwave-laser resonance method

Using a newly developed laser-microwave-laser resonance method, we observed a pair of microwave transitions between hyperfine levels of the $(n,L)=(37,35)$ state of antiprotonic helium. This experiment confirms the quadruplet hyperfine structure due to the interaction of the antiproton orbital angular momentum, the electron spin and the antiproton spin as predicted by Bakalov and Korobov. The measured frequencies of $\nu_{\text HF}^+ =12.89596 \pm 0.00034$ GHz and $\nu_{\text HF}^- =12.92467 \pm 0.00029$ GHz agree with recent theoretical calculations on a level of $6 \times10^{-5}$.Comment: 4 pages, 4 figures, 1 tabl

On the Maximum Crossing Number

Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any graph has a \emph{convex} straight-line drawing, e.g., a drawing with vertices in convex position, that maximizes the number of edge crossings. We disprove this conjecture by constructing a planar graph on twelve vertices that allows a non-convex drawing with more crossings than any convex one. Bald et al. [Proc. COCOON, 2016] showed that it is NP-hard to compute the maximum number of crossings of a geometric graph and that the weighted geometric case is NP-hard to approximate. We strengthen these results by showing hardness of approximation even for the unweighted geometric case and prove that the unweighted topological case is NP-hard.Comment: 16 pages, 5 figure

A Generalization of the Directed Graph Layering Problem

The Directed Layering Problem (DLP) solves a step of the widely used layer-based layout approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, classically a preprocessing step is used that solves the Feedback Arc Set Problem (FASP)to make the graph acyclic before a layering is determined. Here, we present the Generalized Layering Problem (GLP) which solves the combination of DLP and FASP simultaneously, allowing general graphs as input. We show GLP to be NP- complete, present integer programming models to solve it, and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the layer- based approach. We observe that GLP reduces the number of dummy nodes significantly, can produce more compact drawings and improves on graphs where DLP yields poor aspect ratios

Parameterized Complexity of 1-Planarity

We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter tractable algorithms. However, the problem remains NP-complete for graphs of bounded bandwidth, pathwidth, or treewidth.Comment: WADS 201