The "path" not taken: exploring structural differences in mapped- versus shortest-network-path school travel routes.

PubMed

Buliung, Ron N; Larsen, Kristian; Faulkner, Guy E J; Stone, Michelle R

2013-09-01

School route measurement often involves estimating the shortest network path. We challenged the relatively uncritical adoption of this method in school travel research and tested the route discordance hypothesis that several types of difference exist between shortest network paths and reported school routes. We constructed the mapped and shortest path through network routes for a sample of 759 children aged 9 to 13 years in grades 5 and 6 (boys = 45%, girls = 54%, unreported gender = 1%), in Toronto, Ontario, Canada. We used Wilcoxon signed-rank tests to compare reported with shortest-path route measures including distance, route directness, intersection crossings, and route overlap. Measurement difference was explored by mode and location. We found statistical evidence of route discordance for walkers and children who were driven and detected it more often for inner suburban cases. Evidence of route discordance varied by mode and school location. We found statistically significant differences for route structure and built environment variables measured along reported and geographic information systems-based shortest-path school routes. Uncertainty produced by the shortest-path approach challenges its conceptual and empirical validity in school travel research.

The “Path” Not Taken: Exploring Structural Differences in Mapped- Versus Shortest-Network-Path School Travel Routes

PubMed Central

Larsen, Kristian; Faulkner, Guy E. J.; Stone, Michelle R.

2013-01-01

Objectives. School route measurement often involves estimating the shortest network path. We challenged the relatively uncritical adoption of this method in school travel research and tested the route discordance hypothesis that several types of difference exist between shortest network paths and reported school routes. Methods. We constructed the mapped and shortest path through network routes for a sample of 759 children aged 9 to 13 years in grades 5 and 6 (boys = 45%, girls = 54%, unreported gender = 1%), in Toronto, Ontario, Canada. We used Wilcoxon signed-rank tests to compare reported with shortest-path route measures including distance, route directness, intersection crossings, and route overlap. Measurement difference was explored by mode and location. Results. We found statistical evidence of route discordance for walkers and children who were driven and detected it more often for inner suburban cases. Evidence of route discordance varied by mode and school location. Conclusions. We found statistically significant differences for route structure and built environment variables measured along reported and geographic information systems–based shortest-path school routes. Uncertainty produced by the shortest-path approach challenges its conceptual and empirical validity in school travel research. PMID:23865648

26 CFR 1.217-2 - Deduction for moving expenses paid or incurred in taxable years beginning after December 31, 1969.

Code of Federal Regulations, 2010 CFR

2010-04-01

... of transportation actually used and in the shortest period of time commonly required to travel the... that the taxpayer and all members of his household travel together or at the same time. (5) Expenses of... travel together or at the same time. Moreover, a trip need not result in acquisition of a lease of...

Combat Trauma -- Placing Surgeons to Save the Most Lives

DTIC Science & Technology

2007-11-06

principles, and contradicts common beliefs passed down through generations of military personnel. The approach is to first discuss the...to get the patient to the right care in the shortest amount of time. For example, taking a patient with penetrating head trauma to a general ...The volume and synergy facilitate good outcomes and develop future generations of combat surgeons. Another counter intuitive concept of

Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.

PubMed

Qu, Hong; Yi, Zhang; Yang, Simon X

2013-06-01

Shortest path tree (SPT) computation is a critical issue for routers using link-state routing protocols, such as the most commonly used open shortest path first and intermediate system to intermediate system. Each router needs to recompute a new SPT rooted from itself whenever a change happens in the link state. Most commercial routers do this computation by deleting the current SPT and building a new one using static algorithms such as the Dijkstra algorithm at the beginning. Such recomputation of an entire SPT is inefficient, which may consume a considerable amount of CPU time and result in a time delay in the network. Some dynamic updating methods using the information in the updated SPT have been proposed in recent years. However, there are still many limitations in those dynamic algorithms. In this paper, a new modified model of pulse-coupled neural networks (M-PCNNs) is proposed for the SPT computation. It is rigorously proved that the proposed model is capable of solving some optimization problems, such as the SPT. A static algorithm is proposed based on the M-PCNNs to compute the SPT efficiently for large-scale problems. In addition, a dynamic algorithm that makes use of the structure of the previously computed SPT is proposed, which significantly improves the efficiency of the algorithm. Simulation results demonstrate the effective and efficient performance of the proposed approach.

Differences in physical environmental characteristics between adolescents' actual and shortest cycling routes: a study using a Google Street View-based audit.

PubMed

Verhoeven, Hannah; Van Hecke, Linde; Van Dyck, Delfien; Baert, Tim; Van de Weghe, Nico; Clarys, Peter; Deforche, Benedicte; Van Cauwenberg, Jelle

2018-05-29

The objective evaluation of the physical environmental characteristics (e.g. speed limit, cycling infrastructure) along adolescents' actual cycling routes remains understudied, although it may provide important insights into why adolescents prefer one cycling route over another. The present study aims to gain insight into the physical environmental characteristics determining the route choice of adolescent cyclists by comparing differences in physical environmental characteristics between their actual cycling routes and the shortest possible cycling routes. Adolescents (n = 204; 46.5% boys; 14.4 ± 1.2 years) recruited at secondary schools in and around Ghent (city in Flanders, northern part of Belgium) were instructed to wear a Global Positioning System device in order to identify cycling trips. For all identified cycling trips, the shortest possible route that could have been taken was calculated. Actual cycling routes that were not the shortest possible cycling routes were divided into street segments. Segments were audited with a Google Street View-based tool to assess physical environmental characteristics along actual and shortest cycling routes. Out of 160 actual cycling trips, 73.1% did not differ from the shortest possible cycling route. For actual cycling routes that were not the shortest cycling route, a speed limit of 30 km/h, roads having few buildings with windows on the street side and roads without cycle lane were more frequently present compared to the shortest possible cycling routes. A mixed land use, roads with commercial destinations, arterial roads, cycle lanes separated from traffic by white lines, small cycle lanes and cycle lanes covered by lighting were less frequently present along actual cycling routes compared to the shortest possible cycling routes. Results showed that distance mainly determines the route along which adolescents cycle. In addition, adolescents cycled more along residential streets (even if no cycle lane was present) and less along busy, arterial roads. Local authorities should provide shortcuts free from motorised traffic to meet adolescents' preference to cycle along the shortest route and to avoid cycling along arterial roads.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

NASA Astrophysics Data System (ADS)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

The Shortest QRS Duration of an Electrocardiogram Might Be an Optimal Electrocardiographic Predictor for Response to Cardiac Resynchronization Therapy.

PubMed

Chen, Jan-Yow; Lin, Kuo-Hung; Chang, Kuan-Cheng; Chou, Che-Yi

2017-08-03

QRS duration has been associated with the response to cardiac resynchronization therapy (CRT). However, the methods for defining QRS duration to predict the outcome of CRT have discrepancies in previous reports. The aim of this study was to determine an optimal measurement of QRS duration to predict the response to CRT.Sixty-one patients who received CRT were analyzed. All patients had class III-IV heart failure, left ventricular ejection fraction not more than 35%, and complete left bundle branch block. The shortest, longest, and average QRS durations from the 12 leads of each electrocardiogram (ECG) were measured. The responses to CRT were determined using the changes in echocardiography after 6 months. Thirty-five (57.4%) patients were responders and 26 (42.6%) patients were non-responders. The pre-procedure shortest, average, and longest QRS durations and the QRS shortening (ΔQRS) of the shortest QRS duration were significantly associated with the response to CRT in a univariate logistic regression analysis (P = 0.002, P = 0.03, P = 0.04 and P = 0.04, respectively). Based on the measurement of the area under curve of the receiver operating characteristic curve, only the pre-procedure shortest QRS duration and the ΔQRS of the shortest QRS duration showed significant discrimination for the response to CRT (P = 0.002 and P = 0.038, respectively). Multivariable logistic regression showed the pre-procedure shortest QRS duration is an independent predictor for the response to CRT.The shortest QRS duration from the 12 leads of the electrocardiogram might be an optimal measurement to predict the response to CRT.

Whither a Common Security for Southeast Asia?

DTIC Science & Technology

1998-06-05

Southeast Asian countries to directly and indirectly influence any passage through them between the Pacific Ocean, North Asia, and Indian Ocean regions. A...most important of these sea-lanes is the Malacca Straits, which is the shortest route between the Indian and Pacific Oceans. The alternatives to the...accelerated via the sea routes. In the old days, the region straddled the major trade route between the Far East and Europe through the Indian Ocean

Spreading paths in partially observed social networks

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Spreading paths in partially observed social networks.

PubMed

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

DTIC Science & Technology

2015-03-26

forces which could act as intermediate destinations or obstacles to movement through the network. This is similar to a traveling salesman problem ...118 Abstract The shortest path problem of finding the optimal path through a complex network is well-studied in the field of operations research. This...research presents an applica- tion of the shortest path problem to a customizable map with terrain features and enemy engagement risk. The PathFinder

Assessment of Oropharyngeal Dysphagia in Patients With Parkinson Disease: Use of Ultrasonography.

PubMed

Oh, Eun Hyun; Seo, Jin Seok; Kang, Hyo Jung

2016-04-01

To compare tongue thickness, the shortest hyoid-thyroid approximation (distance between the hyoid bone and thyroid cartilage), and the time interval between the initiation of tongue movement and the time of the shortest hyoid-thyroid approximation, by using ultrasonography in healthy controls and patients with Parkinson disease (PD). Healthy controls and PD patients with dysphagia were compared. Ultrasonography was performed 3 times for the evaluation of tongue thickness, the shortest hyoid-thyroid approximation, and the time between the initiation of tongue movement and the shortest hyoid-thyroid approximation. A total of 24 healthy controls and 24 PD patients with dysphagia were enrolled. No significant differences were demonstrated between the two groups for the shortest hyoid-thyroid approximation (controls, 1.19±0.34 cm; PD patients, 1.37±0.5 cm; p=0.15) and tongue thickness (controls, 4.42±0.46 cm; PD patients, 4.27±0.51 cm; p=0.3). In contrast, the time to the shortest hyoid-thyroid approximation was significantly different between the two groups (controls, 1.53±0.87 ms; PD patients, 2.4±1.4 ms, p=0.048). Ultrasonography can be useful in evaluating dysphagia in patients with PD by direct visualization and measurement of the hyoid bone. Moreover, ultrasonography might contribute to a greater understanding of the pathophysiology of dysphagia in PD.

Pneumodissection for skin protection in image-guided cryoablation of superficial musculoskeletal tumours.

PubMed

Maybody, Majid; Tang, Peter Q; Moskowitz, Chaya S; Hsu, Meier; Yarmohammadi, Hooman; Boas, F Edward

2017-03-01

Pneumodissection is described as a simple method for preventing skin injury during cryoablation of superficial musculoskeletal tumours. Superficial tumour cryoablations performed from 2009 to 2015 were retrospectively reviewed. Pneumodissection was performed in 13 patients when the shortest tumour-skin distance was less than 25 mm. Indications were pain palliation (n = 9) and local tumour control (n = 4). Patients, target tumours, technical characteristics and complications up to 60 days post ablation were reviewed. The ice ball-skin distances with and without pneumodissection were compared by a paired t-test and further assessed for association with covariates using ANCOVA. Technical success for ablation was 12 of 13. The mean shortest tumour-skin distance was 15.0 mm (3.2-24.5 mm). The mean thickness of pneumodissection was 9.6 mm (5.2-16.6 mm) resulting in mean elevation of skin of 3.4 mm (1.2-5.3 mm). Mean shortest ice ball-skin distance after pneumodissection was 10.5 mm (4.2-19.7 mm). No infection or systemic air embolism was noted. No intraprocedural frostbite was observed. Pneumodissection is feasible, effective and safe in protecting the skin during image-guided cryoablation of superficial tumours. • Frostbite during image-guided cryoablation of superficial tumours is commonly under-reported. • Frostbites are painful and may introduce infection into the superficial ablation zone. • Warm compress, saline and CO 2 have shortcomings in protecting the skin. • Pneumodissection is free, readily available, easy to use and safe and effective.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

47 CFR 22.971 - Obligation to abate unacceptable interference.

Code of Federal Regulations, 2010 CFR

2010-10-01

... interference, with full cooperation and utmost diligence, in the shortest time practicable. Interfering... severally responsible for abating interference, with full cooperation and utmost diligence, in the shortest...

Computing the Length of the Shortest Telomere in the Nucleus

NASA Astrophysics Data System (ADS)

Dao Duc, K.; Holcman, D.

2013-11-01

The telomere length can either be shortened or elongated by an enzyme called telomerase after each cell division. Interestingly, the shortest telomere is involved in controlling the ability of a cell to divide. Yet, its dynamics remains elusive. We present here a stochastic approach where we model this dynamics using a Markov jump process. We solve the forward Fokker-Planck equation to obtain the steady state distribution and the statistical moments of telomere lengths. We focus specifically on the shortest one and we estimate its length difference with the second shortest telomere. After extracting key parameters such as elongation and shortening dynamics from experimental data, we compute the length of telomeres in yeast and obtain as a possible prediction the minimum concentration of telomerase required to ensure a proper cell division.

Is a wind turbine a point source? (L).

PubMed

Makarewicz, Rufin

2011-02-01

Measurements show that practically all noise of wind turbine noise is produced by turbine blades, sometimes a few tens of meters long, despite that the model of a point source located at the hub height is commonly used. The plane of rotating blades is the critical location of the receiver because the distances to the blades are the shortest. It is shown that such location requires certain condition to be met. The model is valid far away from the wind turbine as well.

Octave-spanning carrier-envelope phase stabilized visible pulse with sub-3-fs pulse duration.

PubMed

Okamura, Kotaro; Kobayashi, Takayoshi

2011-01-15

The visible second harmonic of the idler output from a noncollinear optical parametric amplifier was compressed using adaptive dispersion control with a deformable mirror. The amplifier was pumped by and seeded in the signal path by a common 400 nm second-harmonic pulse from a Ti:sapphire regenerative amplifier. Thus, both the idler output and the second harmonic of the idler were passively carrier-envelope phase stabilized. The shortest pulse duration achieved was below 3 fs.

The first sub-70 min non-interacting WD-BD system: EPIC212235321

NASA Astrophysics Data System (ADS)

Casewell, S. L.; Braker, I. P.; Parsons, S. G.; Hermes, J. J.; Burleigh, M. R.; Belardi, C.; Chaushev, A.; Finch, N. L.; Roy, M.; Littlefair, S. P.; Goad, M.; Dennihy, E.

2018-05-01

We present the discovery of the shortest period, non-interacting, white dwarf-brown dwarf post-common-envelope binary known. The K2 light curve shows the system, EPIC 21223532 has a period of 68.2 min and is not eclipsing, but does show a large reflection effect due to the irradiation of the brown dwarf by the white dwarf primary. Spectra show hydrogen, magnesium, and calcium emission features from the brown dwarf's irradiated hemisphere, and the mass indicates the spectral type is likely to be L3. Despite having a period substantially lower than the cataclysmic variable period minimum, this system is likely a pre-cataclysmic binary, recently emerged from the common-envelope. These systems are rare, but provide limits on the lowest mass object that can survive common-envelope evolution, and information about the evolution of white dwarf progenitors, and post-common-envelope evolution.

New insights on Prestosuchus chiniquensis Huene, 1942 (Pseudosuchia, Loricata) based on new specimens from the “Tree Sanga” Outcrop, Chiniquá Region, Rio Grande do Sul, Brazil

PubMed Central

Mastrantonio, Bianca M.; Fortier, Daniel C.; Schultz, Cesar L.

2016-01-01

The ‘rauisuchians’ are a group of Triassic pseudosuchian archosaurs that displayed a near global distribution. Their problematic taxonomic resolution comes from the fact that most taxa are represented only by a few and/or mostly incomplete specimens. In the last few decades, renewed interest in early archosaur evolution has helped to clarify some of these problems, but further studies on the taxonomic and paleobiological aspects are still needed. In the present work, we describe new material attributed to the ‘rauisuchian’ taxon Prestosuchus chiniquensis, of the Dinodontosaurus Assemblage Zone, Middle Triassic (Ladinian) of the Santa Maria Supersequence of southern Brazil, based on a comparative osteologic analysis. Additionally, we present well supported evidence that these represent juvenile forms, due to differences in osteological features (i.e., a subnarial fenestra) that when compared to previously described specimens can be attributed to ontogeny and indicate variation within a single taxon of a problematic but important osteological structure in the study of ‘rauisuchians.’ PMID:26855866

A parallel algorithm for finding the shortest exit paths in mines

NASA Astrophysics Data System (ADS)

Jastrzab, Tomasz; Buchcik, Agata

2017-11-01

In the paper we study the problem of finding the shortest exit path in an underground mine in case of emergency. Since emergency situations, such as underground fires, can put the miners' lives at risk, the ability to quickly determine the safest exit path is crucial. We propose a parallel algorithm capable of finding the shortest path between the safe exit point and any other point in the mine. The algorithm is also able to take into account the characteristics of individual miners, to make the path determination more reliable.

Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

PubMed

Teichroeb, Julie A

2015-10-01

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

The approach for shortest paths in fire succor based on component GIS technology

NASA Astrophysics Data System (ADS)

Han, Jie; Zhao, Yong; Dai, K. W.

2007-06-01

Fire safety is an important issue for the national economy and people's living. Efficiency and exactness of fire department succor directly relate to safety of peoples' lives and property. Many disadvantages of the traditional fire system have been emerged in practical applications. The preparation of pumpers is guided by wireless communication or wire communication, so its real-time and accurate performances are much poorer. The information about the reported fire, such as the position, disaster and map, et al., for alarm and command was processed by persons, which slows the reaction speed and delays the combat opportunity. In order to solve these disadvantages, it has an important role to construct a modern fire command center based on high technology. The construction of modern fire command center can realize the modernization and automation of fire command and management. It will play a great role in protecting safety of peoples' lives and property. The center can enhance battle ability and can reduce the direct and indirect loss of fire damage at most. With the development of science technology, Geographic Information System (GIS) has becoming a new information industry for hardware production, software development, data collection, space analysis and counseling. With the popularization of computers and the development of GIS, GIS has gained increasing broad applications for its strong functionality. Network analysis is one of the most important functions of GIS, and the most elementary and pivotal issue of network analysis is the calculation of shortest paths. The shortest paths are mostly applied to some emergent systems such as 119 fire alarms. These systems mainly require that the computation time of the optimal path should be 1-3 seconds. And during traveling, the next running path of the vehicles should be calculated in time. So the implement of the shortest paths must have a high efficiency. In this paper, the component GIS technology was applied to collect and record the data information (such as, the situation of this disaster, map and road status et al) of the reported fire firstly. The ant colony optimization was used to calculate the shortest path of fire succor secondly. The optimization results were sent to the pumpers, which can let pumpers choose the shortest paths intelligently and come to fire position with least time. The programming method for shortest paths is proposed in section 3. There are three parts in this section. The elementary framework of the proposed programming method is presented in part one. The systematic framework of GIS component is described in part two. The ant colony optimization employed is presented in part three. In section 4, a simple application instance was presented to demonstrate the proposed programming method. There are three parts in this section. The distributed Web application based on component GIS was described in part one. The optimization results without traffic constraint were presented in part two. The optimization results with traffic constraint were presented in part three. The contributions of this paper can be summarized as follows. (1) It proposed an effective approach for shortest paths in fire succor based on component GIS technology. This proposed approach can achieve the real-time decisions of shortest paths for fire succor. (2) It applied the ant colony optimization to implement the shortest path decision. The traffic information was considered in the shortest path decision using ant colony optimization. The final application instance suggests that the proposed approach is feasible, correct and valid.

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

Comparison of Perturbed Pathways in Two Different Cell Models for Parkinson's Disease with Structural Equation Model.

PubMed

Pepe, Daniele; Do, Jin Hwan

2015-12-16

Increasing evidence indicates that different morphological types of cell death coexist in the brain of patients with Parkinson's disease (PD), but the molecular explanation for this is still under investigation. In this study, we identified perturbed pathways in two different cell models for PD through the following procedures: (1) enrichment pathway analysis with differentially expressed genes and the Reactome pathway database, and (2) construction of the shortest path model for the enriched pathway and detection of significant shortest path model with fitting time-course microarray data of each PD cell model to structural equation model. Two PD cell models constructed by the same neurotoxin showed different perturbed pathways. That is, one showed perturbation of three Reactome pathways, including cellular senescence, chromatin modifying enzymes, and chromatin organization, while six modules within metabolism pathway represented perturbation in the other. This suggests that the activation of common upstream cell death pathways in PD may result in various down-stream processes, which might be associated with different morphological types of cell death. In addition, our results might provide molecular clues for coexistence of different morphological types of cell death in PD patients.

Environmental risk factors for allergy and socioeconomic status in a birth cohort (BAMSE).

PubMed

Lannerö, E; Kull, I; Wickman, M; Pershagen, G; Nordvall, S L

2002-06-01

Associations between parental educational level and possible risk factors for atopic disease during the first months of life were explored in a cohort of 4089 neonate children born 1994-96 in Stockholm, Sweden. Reports concerning a number of life style factors during pregnancy and after the baby was born were obtained by questionnaire. There was a strong negative association between duration of education and maternal smoking during pregnancy, parental smoking after the baby was born and keeping of cat and dog (p-trend < 0.001), respectively. For example, smoking during pregnancy was reported by 6.7% (95% CI 5.5-7.9) of mothers with college or university degree and by 22.2% (95% CI 20.1-24.5) of those with the shortest education. Indicators of dampness and poor ventilation were also more common in homes of those with the shortest education. The results show that the educational level has an influence on risk factors for development of atopic disease in childhood and indicates a need of deeper understanding of life style in different socioeconomic groups. The data also indicate that various possible confounding factors need to be thoroughly investigated when analysing studies of risk factors for allergic disease in childhood.

Nearby Search Indekos Based Android Using A Star (A*) Algorithm

NASA Astrophysics Data System (ADS)

Siregar, B.; Nababan, EB; Rumahorbo, JA; Andayani, U.; Fahmi, F.

2018-03-01

Indekos or rented room is a temporary residence for months or years. Society of academicians who come from out of town need a temporary residence, such as Indekos or rented room during their education, teaching, or duties. They are often found difficulty in finding a Indekos because lack of information about the Indekos. Besides, new society of academicians don’t recognize the areas around the campus and desire the shortest path from Indekos to get to the campus. The problem can be solved by implementing A Star (A*) algorithm. This algorithm is one of the shortest path algorithm to a finding shortest path from campus to the Indekos application, where the faculties in the campus as the starting point of the finding. Determination of the starting point used in this study aims to allow students to determine the starting point in finding the Indekos. The mobile based application facilitates the finding anytime and anywhere. Based on the experimental results, A* algorithm can find the shortest path with 86,67% accuracy.

Detecting duplicate biological entities using Shortest Path Edit Distance.

PubMed

Rudniy, Alex; Song, Min; Geller, James

2010-01-01

Duplicate entity detection in biological data is an important research task. In this paper, we propose a novel and context-sensitive Shortest Path Edit Distance (SPED) extending and supplementing our previous work on Markov Random Field-based Edit Distance (MRFED). SPED transforms the edit distance computational problem to the calculation of the shortest path among two selected vertices of a graph. We produce several modifications of SPED by applying Levenshtein, arithmetic mean, histogram difference and TFIDF techniques to solve subtasks. We compare SPED performance to other well-known distance algorithms for biological entity matching. The experimental results show that SPED produces competitive outcomes.

The cost of the muse: poets die young.

PubMed

Kaufman, James C

2003-11-01

Although several investigations have found that poets tend to die younger than other types of writers, these studies often do not take into account variables of gender and culture. This study examines 1,987 deceased writers from four different cultures: American, Chinese, Turkish, and Eastern European. Both male and female poets had the shortest life spans of all four types of writers (fiction writers, poets, playwrights, and non-fiction writers), and poets had the shortest life spans in three of the four cultures (and the second shortest life span among Eastern European writers). Possible reasons for the poet's shorter life span are then discussed.

Anthropometric Study of the Piriformis Muscle and Sciatic Nerve: A Morphological Analysis in a Polish Population

PubMed Central

Haładaj, Robert; Pingot, Mariusz; Polguj, Michał; Wysiadecki, Grzegorz; Topol, Mirosław

2015-01-01

Background The aim of this study was to determine relationships between piriformis muscle (PM) and sciatic nerve (SN) with reference to sex and anatomical variations. Material/Methods Deep dissection of the gluteal region was performed on 30 randomized, formalin-fixed human lower limbs of adults of both sexes of the Polish population. Anthropometric measurements were taken and then statistically analyzed. Results The conducted research revealed that, apart from the typical structure of the piriformis muscle, the most common variation was division of the piriformis muscle into two heads, with the common peroneal nerve running between them (20%). The group with anatomical variations of the sciatic nerve course displayed greater diversity of morphometric measurement results. There was a statistically significant correlation between the lower limb length and the distance from the sciatic nerve to the greater trochanter in the male specimens. On the other hand, in the female specimens, a statistically significant correlation was observed between the lower limb length and the distance from the sciatic nerve to the ischial tuberosity. The shortest distance from the sciatic nerve to the greater trochanter measured at the level of the inferior edge of the piriformis was 21 mm, while the shortest distance to the ischial tuberosity was 63 mm. Such correlations should be taken into account during invasive medical procedures performed in the gluteal region. Conclusions It is possible to distinguish several anatomical variations of the sciatic nerve course within the deep gluteal region. The statistically significant correlations between some anthropometric measurements were only present within particular groups of male and female limbs. PMID:26629744

A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

NASA Astrophysics Data System (ADS)

Dash, S.; Mishra, G. P.

2015-09-01

A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed.

Wildfires in the Triassic of Gondwana Paraná Basin

NASA Astrophysics Data System (ADS)

Cardoso, Daiane dos Santos; Mizusaki, Ana Maria Pimentel; Guerra-Sommer, Margot; Menegat, Rualdo; Barili, Rosalia; Jasper, André; Uhl, Dieter

2018-03-01

This first report of wildfires from an association of facies containing a Dicroidium flora is made from the Upper Triassic (Carnian age) in the southern part of the Paraná Basin (Santa Maria Supersequence, Rio Grande do Sul state). The geographical extension of the Dicroidium plant assemblage is augmented in Brazilian Gondwana. Field work followed by organic petrography (inertinite reflectance), scanning electron microscopy (SEM) and field emission gun scanning electron microscopy (FEG-SEM), revealed charcoal presence in a section located in Pinheiro Machado town. Macroscopic charcoal is represented by three-dimensional wood specimens assigned to gymnosperms, with coniferous affinities and by flattened, thin, elongated remains corresponding to rachises of Dicroidium. Average reflectance values between 2.80 and 6.61 %Ro measured in the macroscopic charcoals evidence high temperature burning processes, involving fires both in the crown and in the crown-surface interface. The occurrence of charcoal in distinct and subsequent facies of the studied section indicates wildfires, which affected hinterland, meso-xerophyllous coniferous assemblages and marginal hygro-mesophyllous Dicroidium-like assemblages. The integration of results from the charcoal analyses is consistent with an atmospheric oxygen content higher than 18.5% and fuel enough to generate wildfires during the Triassic of Gondwana.

Spatial Interpolation of Fine Particulate Matter Concentrations Using the Shortest Wind-Field Path Distance

PubMed Central

Li, Longxiang; Gong, Jianhua; Zhou, Jieping

2014-01-01

Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW) with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health. PMID:24798197

Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

PubMed

Li, Longxiang; Gong, Jianhua; Zhou, Jieping

2014-01-01

Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW) with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

Link prediction based on local community properties

NASA Astrophysics Data System (ADS)

Yang, Xu-Hua; Zhang, Hai-Feng; Ling, Fei; Cheng, Zhi; Weng, Guo-Qing; Huang, Yu-Jiao

2016-09-01

The link prediction algorithm is one of the key technologies to reveal the inherent rule of network evolution. This paper proposes a novel link prediction algorithm based on the properties of the local community, which is composed of the common neighbor nodes of any two nodes in the network and the links between these nodes. By referring to the node degree and the condition of assortativity or disassortativity in a network, we comprehensively consider the effect of the shortest path and edge clustering coefficient within the local community on node similarity. We numerically show the proposed method provide good link prediction results.

Anatomic Location of Tumor Predicts the Accuracy of Motor Function Localization in Diffuse Lower-Grade Gliomas Involving the Hand Knob Area.

PubMed

Fang, S; Liang, J; Qian, T; Wang, Y; Liu, X; Fan, X; Li, S; Wang, Y; Jiang, T

2017-10-01

The accuracy of preoperative blood oxygen level-dependent fMRI remains controversial. This study assessed the association between the anatomic location of a tumor and the accuracy of fMRI-based motor function mapping in diffuse lower-grade gliomas. Thirty-five patients with lower-grade gliomas involving motor areas underwent preoperative blood oxygen level-dependent fMRI scans with grasping tasks and received intraoperative direct cortical stimulation. Patients were classified into an overlapping group and a nonoverlapping group, depending on the extent to which blood oxygen level-dependent fMRI and direct cortical stimulation results concurred. Tumor location was quantitatively measured, including the shortest distance from the tumor to the hand knob and the deviation distance of the midpoint of the hand knob in the lesion hemisphere relative to the midline compared with the normal contralateral hemisphere. A 4-mm shortest distance from the tumor to the hand knob value was identified as optimal for differentiating the overlapping and nonoverlapping group with the receiver operating characteristic curve (sensitivity, 84.6%; specificity, 77.8%). The shortest distances from the tumor to the hand knob of ≤4 mm were associated with inaccurate fMRI-based localizations of the hand motor cortex. The shortest distances from the tumor to the hand knob were larger ( P = .002), and the deviation distances for the midpoint of the hand knob in the lesion hemisphere were smaller ( P = .003) in the overlapping group than in the nonoverlapping group. This study suggests that the shortest distance from the tumor to the hand knob and the deviation distance for the midpoint of the hand knob on the lesion hemisphere are predictive of the accuracy of blood oxygen level-dependent fMRI results. Smaller shortest distances from the tumor to the hand knob and larger deviation distances for the midpoint of hand knob on the lesion hemisphere are associated with less accuracy of motor cortex localization with blood oxygen level-dependent fMRI. Preoperative fMRI data for surgical planning should be used cautiously when the shortest distance from the tumor to the hand knob is ≤4 mm, especially for lower-grade gliomas anterior to the central sulcus. © 2017 by American Journal of Neuroradiology.

Approaching the Brachistochrone Using Inclined Planes--Striving for Shortest or Equal Travelling Times

ERIC Educational Resources Information Center

Theilmann, Florian

2017-01-01

The classical "brachistochrone" problem asks for the path on which a mobile point M just driven by its own gravity will travel in the shortest possible time between two given points "A" and "B." The resulting curve, the cycloid, will also be the "tautochrone" curve, i.e. the travelling time of the mobile…

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

The drug target genes show higher evolutionary conservation than non-target genes.

PubMed

Lv, Wenhua; Xu, Yongdeng; Guo, Yiying; Yu, Ziqi; Feng, Guanglong; Liu, Panpan; Luan, Meiwei; Zhu, Hongjie; Liu, Guiyou; Zhang, Mingming; Lv, Hongchao; Duan, Lian; Shang, Zhenwei; Li, Jin; Jiang, Yongshuai; Zhang, Ruijie

2016-01-26

Although evidence indicates that drug target genes share some common evolutionary features, there have been few studies analyzing evolutionary features of drug targets from an overall level. Therefore, we conducted an analysis which aimed to investigate the evolutionary characteristics of drug target genes. We compared the evolutionary conservation between human drug target genes and non-target genes by combining both the evolutionary features and network topological properties in human protein-protein interaction network. The evolution rate, conservation score and the percentage of orthologous genes of 21 species were included in our study. Meanwhile, four topological features including the average shortest path length, betweenness centrality, clustering coefficient and degree were considered for comparison analysis. Then we got four results as following: compared with non-drug target genes, 1) drug target genes had lower evolutionary rates; 2) drug target genes had higher conservation scores; 3) drug target genes had higher percentages of orthologous genes and 4) drug target genes had a tighter network structure including higher degrees, betweenness centrality, clustering coefficients and lower average shortest path lengths. These results demonstrate that drug target genes are more evolutionarily conserved than non-drug target genes. We hope that our study will provide valuable information for other researchers who are interested in evolutionary conservation of drug targets.

The relationship between partial upper-airway obstruction and inter-breath transition period during sleep.

PubMed

Mann, Dwayne L; Edwards, Bradley A; Joosten, Simon A; Hamilton, Garun S; Landry, Shane; Sands, Scott A; Wilson, Stephen J; Terrill, Philip I

2017-10-01

Short pauses or "transition-periods" at the end of expiration and prior to subsequent inspiration are commonly observed during sleep in humans. However, the role of transition periods in regulating ventilation during physiological challenges such as partial airway obstruction (PAO) has not been investigated. Twenty-nine obstructive sleep apnea patients and eight controls underwent overnight polysomnography with an epiglottic catheter. Sustained-PAO segments (increased epiglottic pressure over ≥5 breaths without increased peak inspiratory flow) and unobstructed reference segments were manually scored during apnea-free non-REM sleep. Nasal pressure data was computationally segmented into inspiratory (T I , shortest period achieving 95% inspiratory volume), expiratory (T E , shortest period achieving 95% expiratory volume), and inter-breath transition period (T Trans , period between T E and subsequent T I ). Compared with reference segments, sustained-PAO segments had a mean relative reduction in T Trans (-24.7±17.6%, P<0.001), elevated T I (11.8±10.5%, P<0.001), and a small reduction in T E (-3.9±8.0, P≤0.05). Compensatory increases in inspiratory period during PAO are primarily explained by reduced transition period and not by reduced expiratory period. Copyright © 2017 Elsevier B.V. All rights reserved.

Seismic wavefield propagation in 2D anisotropic media: Ray theory versus wave-equation simulation

NASA Astrophysics Data System (ADS)

Bai, Chao-ying; Hu, Guang-yi; Zhang, Yan-teng; Li, Zhong-sheng

2014-05-01

Despite the ray theory that is based on the high frequency assumption of the elastic wave-equation, the ray theory and the wave-equation simulation methods should be mutually proof of each other and hence jointly developed, but in fact parallel independent progressively. For this reason, in this paper we try an alternative way to mutually verify and test the computational accuracy and the solution correctness of both the ray theory (the multistage irregular shortest-path method) and the wave-equation simulation method (both the staggered finite difference method and the pseudo-spectral method) in anisotropic VTI and TTI media. Through the analysis and comparison of wavefield snapshot, common source gather profile and synthetic seismogram, it is able not only to verify the accuracy and correctness of each of the methods at least for kinematic features, but also to thoroughly understand the kinematic and dynamic features of the wave propagation in anisotropic media. The results show that both the staggered finite difference method and the pseudo-spectral method are able to yield the same results even for complex anisotropic media (such as a fault model); the multistage irregular shortest-path method is capable of predicting similar kinematic features as the wave-equation simulation method does, which can be used to mutually test each other for methodology accuracy and solution correctness. In addition, with the aid of the ray tracing results, it is easy to identify the multi-phases (or multiples) in the wavefield snapshot, common source point gather seismic section and synthetic seismogram predicted by the wave-equation simulation method, which is a key issue for later seismic application.

Families of Graph Algorithms: SSSP Case Study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kanewala Appuhamilage, Thejaka Amila Jay; Zalewski, Marcin J.; Lumsdaine, Andrew

2017-08-28

Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploringmore » semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.« less

[Surgical site infections: antibiotic prophylaxis in surgery].

PubMed

Asensio, Angel

2014-01-01

Surgical site infections (SSI) are very common, and represent more than 20% of all hospital-acquired infections. SSIs are associated with a higher mortality, as well as to an extended hospital stay and costs, depending on the surgical procedure and type of SSI. Advances in control practices for these infections include improvement in operating room ventilation, sterilization methods, barriers, and surgical techniques, as well as in surgical antimicrobial prophylaxis. For the latter, the antimicrobial agent should: be active against the most common pathogens, be administered in an appropriate dosage and in a time frame to ensure serum and tissue concentrations over the period of potential contamination, be safe, and be administered over the shortest effective time period to minimize adverse events, development of resistances, and cost. Copyright © 2013 Elsevier España, S.L. All rights reserved.

A combined NLP-differential evolution algorithm approach for the optimization of looped water distribution systems

NASA Astrophysics Data System (ADS)

Zheng, Feifei; Simpson, Angus R.; Zecchin, Aaron C.

2011-08-01

This paper proposes a novel optimization approach for the least cost design of looped water distribution systems (WDSs). Three distinct steps are involved in the proposed optimization approach. In the first step, the shortest-distance tree within the looped network is identified using the Dijkstra graph theory algorithm, for which an extension is proposed to find the shortest-distance tree for multisource WDSs. In the second step, a nonlinear programming (NLP) solver is employed to optimize the pipe diameters for the shortest-distance tree (chords of the shortest-distance tree are allocated the minimum allowable pipe sizes). Finally, in the third step, the original looped water network is optimized using a differential evolution (DE) algorithm seeded with diameters in the proximity of the continuous pipe sizes obtained in step two. As such, the proposed optimization approach combines the traditional deterministic optimization technique of NLP with the emerging evolutionary algorithm DE via the proposed network decomposition. The proposed methodology has been tested on four looped WDSs with the number of decision variables ranging from 21 to 454. Results obtained show the proposed approach is able to find optimal solutions with significantly less computational effort than other optimization techniques.

Identification of influential nodes in complex networks: Method from spreading probability viewpoint

NASA Astrophysics Data System (ADS)

Bao, Zhong-Kui; Ma, Chuang; Xiang, Bing-Bing; Zhang, Hai-Feng

2017-02-01

The problem of identifying influential nodes in complex networks has attracted much attention owing to its wide applications, including how to maximize the information diffusion, boost product promotion in a viral marketing campaign, prevent a large scale epidemic and so on. From spreading viewpoint, the probability of one node propagating its information to one other node is closely related to the shortest distance between them, the number of shortest paths and the transmission rate. However, it is difficult to obtain the values of transmission rates for different cases, to overcome such a difficulty, we use the reciprocal of average degree to approximate the transmission rate. Then a semi-local centrality index is proposed to incorporate the shortest distance, the number of shortest paths and the reciprocal of average degree simultaneously. By implementing simulations in real networks as well as synthetic networks, we verify that our proposed centrality can outperform well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, k-shell centrality, and nonbacktracking centrality. In particular, our findings indicate that the performance of our method is the most significant when the transmission rate nears to the epidemic threshold, which is the most meaningful region for the identification of influential nodes.

FAST TRACK COMMUNICATION: Suppressing anomalous diffusion by cooperation

NASA Astrophysics Data System (ADS)

Dybiec, Bartłomiej

2010-08-01

Within a continuous time random walk scenario we consider a motion of a complex of particles which moves coherently. The motion of every particle is characterized by the waiting time and jump length distributions which are of the power-law type. Due to the interactions between particles it is assumed that the waiting time is adjusted to the shortest or to the longest waiting time. Analogously, the jump length is adjusted to the shortest or to the longest jump length. We show that adjustment to the shortest waiting time can suppress the subdiffusive behavior even in situations when the exponent characterizing the waiting time distribution assures subdiffusive motion of a single particle. Finally, we demonstrate that the characteristic of the motion depends on the number of particles building a complex.

Modeling the average shortest-path length in growth of word-adjacency networks

NASA Astrophysics Data System (ADS)

Kulig, Andrzej; DroŻdŻ, Stanisław; Kwapień, Jarosław; OświÈ©cimka, Paweł

2015-03-01

We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest-path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest-path length. Then, we identify the local chainlike linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained.

A link-adding strategy for transport efficiency of complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Han, Weizhan; Guo, Qing; Wang, Zhenyong; Zhang, Shuai

2016-12-01

The transport efficiency is one of the critical parameters to evaluate the performance of a network. In this paper, we propose an improved efficient (IE) strategy to enhance the network transport efficiency of complex networks by adding a fraction of links to an existing network based on the node’s local degree centrality and the shortest path length. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy under the shortest path routing protocol. It is found that the proposed strategy is beneficial to the improvement of overall traffic handling and delivering ability of the network. This study can alleviate the congestion in networks, and is helpful to design and optimize realistic networks.

The Thinnest Path Problem

DTIC Science & Technology

2016-07-22

their corresponding transmission powers . At first glance, one may wonder whether the thinnest path problem is simply a shortest path problem with the...nature of the shortest path problem. Another aspect that complicates the problem is the choice of the transmission power at each node (within a maximum...fixed transmission power at each node (in this case, the resulting hypergraph degenerates to a standard graph), the thinnest path problem is NP

Logistic Problem Connected with Removing Asbestos as Dangerous Waste from Terrains of Country Communes

NASA Astrophysics Data System (ADS)

Parkitny, Waldemar; Wojcik, Weronika; Generowicz, Agnieszka

2017-12-01

Asbestos is a common term referring to certain mineral groups having the form of fibers with a length to fibre diameter of at least 100: 1. The specific properties of asbestos - flammability, mechanical strength and thermal and flexibility - meant that asbestos has been widely used in various types of industrial technologies. It is classified as hazardous waste and therefore requires special methods for collection, export and disposal. The article proposes a model of logistics exports of asbestos from selected villages, in order to guarantee the shortest route, while maintaining the ecological safety and the rules of transportation of hazardous waste.

Seamless Image Mosaicking via Synchronization

NASA Astrophysics Data System (ADS)

Santellani, E.; Maset, E.; Fusiello, A.

2018-05-01

This paper proposes an innovative method to create high-quality seamless planar mosaics. The developed pipeline ensures good robustness against many common mosaicking problems (e.g., misalignments, colour distortion, moving objects, parallax) and differs from other works in the literature because a global approach, known as synchronization, is used for image registration and colour correction. To better conceal the mosaic seamlines, images are cut along specific paths, computed using a Voronoi decomposition of the mosaic area and a shortest path algorithm. Results obtained on challenging real datasets show that the colour correction mitigates significantly the colour variations between the original images and the seams on the final mosaic are not evident.

Effects of the distance between small intramural uterine fibroids and the endometrium on the pregnancy outcomes of in vitro fertilization-embryo transfer.

PubMed

Lu, Na; Wang, Yang; Su, Ying-chun; Sun, Ying-pu; Guo, Yi-hong

2015-01-01

To explore the effects of the distance between small intramural uterine fibroids (≤4 cm) and the endometrium on the outcomes of in vitro fertilization-embryo transfer (IVF-ET). We prospectively analyzed pregnancy outcomes in 117 infertile women with small intramural uterine fibroids and 117 infertile women without uterine fibroids who all underwent IVF-ET. The size and number of small intramural uterine fibroids and the shortest distance between the small intramural uterine fibroids and the endometrium were measured by transvaginal three-dimensional ultrasound. The endometrial and subendometrial blood flow parameters, implantation rate, clinical pregnancy rate, abortion rate and live birth rate were compared between the women with and without small uterine fibroids and among the different shortest distances (≤1, 1-3 and >3 mm). The effects of the size and number of small intramural uterine fibroids on IVF-ET outcomes were observed. The endometrial volume on ET day, the implantation rate and the live birth rate were significantly lower, but the abortion rate was significantly higher, in the women with small intramural uterine fibroids than in those without uterine fibroids (p < 0.05). The endometrial flow index was higher in the shortest distance ≤1-mm group than in the groups with 1-3 and >3 mm, and the implantation rate was higher in ≤1-mm group than in the >3-mm group (p < 0.05). There were no significant differences in clinical outcomes between different sizes and numbers of small intramural uterine fibroids. Small intramural uterine fibroids can affect IVF-ET outcomes. Compared with other shortest distances (1-3 and >3 mm), the shortest distance of ≤1 mm has a higher implantation rate. © 2014 S. Karger AG, Basel.

Applications to determine the shortest tower BTS distance using Dijkstra algorithm

NASA Astrophysics Data System (ADS)

Mardana, Herwin; Maharani, Septya; Hatta, Heliza Rahmania

2017-02-01

Telecommunications Tower or so-called BTS (Base Transceiver System) Toweris one of the main components in the network infrastructure that has experienced an increase in the number of construction. Telecommunications tower function as a place to put the antenna signal transmitter (access network) to provide communication services to customers around the tower. In addition, other use of telecommunications tower also to place the transmission signal antenna (transport network using microwave technology) for connecting customers with a central area. Therefore, in needed of a decision support system that can provide recommendations planting route of fiber optic cable with the shortest distance in purpose the use of fiber optic cable becoming more efficient. The results of the research were the shortest rule information, showing the distance to be travelled and the map view to enabling users to look at these.

Distribution of shortest cycle lengths in random networks

NASA Astrophysics Data System (ADS)

Bonneau, Haggai; Hassid, Aviv; Biham, Ofer; Kühn, Reimer; Katzav, Eytan

2017-12-01

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution of shortest path lengths (DSPL). We apply this approach to configuration model networks, for which analytical results for the DSPL were obtained before. We first calculate the fraction of nodes in the network which reside on at least one cycle. Conditioning on being on a cycle, we provide the DSCL over ensembles of configuration model networks with degree distributions which follow a Poisson distribution (Erdős-Rényi network), degenerate distribution (random regular graph), and a power-law distribution (scale-free network). The mean and variance of the DSCL are calculated. The analytical results are found to be in very good agreement with the results of computer simulations.

Physarum can compute shortest paths.

PubMed

Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish

2012-09-21

Physarum polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by Tero et al. (Journal of Theoretical Biology, 244, 2007, pp. 553-564) to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s(0) and s(1). We prove that, under this model, the mass of the mold will eventually converge to the shortest s(0)-s(1) path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by Tero et al. and can be seen as an example of a "natural algorithm", that is, an algorithm developed by evolution over millions of years. Copyright © 2012 Elsevier Ltd. All rights reserved.

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

Common Amino Acid Subsequences in a Universal Proteome—Relevance for Food Science

PubMed Central

Minkiewicz, Piotr; Darewicz, Małgorzata; Iwaniak, Anna; Sokołowska, Jolanta; Starowicz, Piotr; Bucholska, Justyna; Hrynkiewicz, Monika

2015-01-01

A common subsequence is a fragment of the amino acid chain that occurs in more than one protein. Common subsequences may be an object of interest for food scientists as biologically active peptides, epitopes, and/or protein markers that are used in comparative proteomics. An individual bioactive fragment, in particular the shortest fragment containing two or three amino acid residues, may occur in many protein sequences. An individual linear epitope may also be present in multiple sequences of precursor proteins. Although recent recommendations for prediction of allergenicity and cross-reactivity include not only sequence identity, but also similarities in secondary and tertiary structures surrounding the common fragment, local sequence identity may be used to screen protein sequence databases for potential allergens in silico. The main weakness of the screening process is that it overlooks allergens and cross-reactivity cases without identical fragments corresponding to linear epitopes. A single peptide may also serve as a marker of a group of allergens that belong to the same family and, possibly, reveal cross-reactivity. This review article discusses the benefits for food scientists that follow from the common subsequences concept. PMID:26340620

Comparing the Relationship Between Age and Length of Disability Across Common Chronic Conditions

PubMed Central

Jetha, Arif; Besen, Elyssa; Smith, Peter M.

2016-01-01

Objective: The aim of this study was to compare the association between age and disability length across common chronic conditions. Methods: Analysis of 39,915 nonwork-related disability claims with a diagnosis of arthritis, diabetes, hypertension, coronary artery disease, depression, low back pain, chronic pulmonary disease, or cancer. Ordinary least squares regression models examined age-length of disability association across chronic conditions. Results: Arthritis (76.6 days), depression (63.2 days), and cancer (64.9 days) were associated with longest mean disability lengths; hypertension was related to shortest disability lengths (41.5 days). Across chronic conditions, older age was significantly associated with longer work disability. The age–length of disability association was most significant for chronic pulmonary disease and cancer. The relationship between age and length of work disability was linear among most chronic conditions. Conclusions: Work disability prevention strategies should consider both employee age and chronic condition diagnosis. PMID:27164446

Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle

PubMed Central

Zhu, Shanjiang; Levinson, David

2015-01-01

Most recent route choice models, following either the random utility maximization or rule-based paradigm, require explicit enumeration of feasible routes. The quality of model estimation and prediction is sensitive to the appropriateness of the consideration set. However, few empirical studies of revealed route characteristics have been reported in the literature. This study evaluates the widely applied shortest path assumption by evaluating routes followed by residents of the Minneapolis—St. Paul metropolitan area. Accurate Global Positioning System (GPS) and Geographic Information System (GIS) data were employed to reveal routes people used over an eight to thirteen week period. Most people did not choose the shortest path. Using three weeks of that data, we find that current route choice set generation algorithms do not reveal the majority of paths that individuals took. Findings from this study may guide future efforts in building better route choice models. PMID:26267756

Label-based routing for a family of small-world Farey graphs.

PubMed

Zhai, Yinhu; Wang, Yinhe

2016-05-11

We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

DiversePathsJ: diverse shortest paths for bioimage analysis.

PubMed

Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

2018-02-01

We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

Label-based routing for a family of small-world Farey graphs

NASA Astrophysics Data System (ADS)

Zhai, Yinhu; Wang, Yinhe

2016-05-01

We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

Hopfield networks for solving Tower of Hanoi problems

NASA Astrophysics Data System (ADS)

Kaplan, G. B.; Güzeliş, Cüneyt

2001-08-01

In this paper, Hopfield neural networks have been considered in solving the Tower of Hanoi test which is used in the determining of deficit of planning capability of the human prefrontal cortex. The main difference between this paper and the ones in the literature which use neural networks is that the Tower of Hanoi problem has been formulated here as a special shortest-path problem. In the literature, some Hopfield networks are developed for solving the shortest path problem which is a combinatorial optimization problem having a diverse field of application. The approach given in this paper gives the possibility of solving the Tower of Hanoi problem using these Hopfield networks. Also, the paper proposes new Hopfield network models for the shortest path and hence the Tower of Hanoi problems and compares them to the available ones in terms of the memory and time (number of steps) needed in the simulations.

Maze-solving by chemotaxis

NASA Astrophysics Data System (ADS)

Reynolds, A. M.

2010-06-01

Here, we report on numerical simulations showing that chemotaxis will take a body through a maze via the shortest possible route to the source of a chemoattractant. This is a robust finding that does not depend on the geometrical makeup of the maze. The predictions are supported by recent experimental studies which have shown that by moving down gradients in pH , a droplet of organic solvent can find the shortest of multiple possible paths through a maze to an acid-soaked exit. They are also consistent with numerical and experimental evidence that plant-parasitic nematodes take the shortest route through the labyrinth of air-filled pores within soil to preferred host plants that produce volatile chemoattractants. The predictions support the view that maze-solving is a robust property of chemotaxis and is not specific to particular kinds of maze or to the fractal structure of air-filled channels within soils.

Children's route choice during active transportation to school: difference between shortest and actual route.

PubMed

Dessing, Dirk; de Vries, Sanne I; Hegeman, Geertje; Verhagen, Evert; van Mechelen, Willem; Pierik, Frank H

2016-04-12

The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible route to school. Children (n = 184; 86 boys, 98 girls; age range: 8-12 years) from seven schools in suburban municipalities in the Netherlands participated in the study. Actual walking and cycling routes to school were measured with a GPS-device that children wore during an entire school week. Measurements were conducted in the period April-June 2014. Route characteristics for both actual and shortest routes between home and school were determined for a buffer of 25 m from the routes and divided into four categories: Land use (residential, commercial, recreational, traffic areas), Aesthetics (presence of greenery/natural water ways along route), Traffic (safety measures such as traffic lights, zebra crossings, speed bumps) and Type of street (pedestrian, cycling, residential streets, arterial roads). Comparison of characteristics of shortest and actual routes was performed with conditional logistic regression models. Median distance of the actual walking routes was 390.1 m, whereas median distance of actual cycling routes was 673.9 m. Actual walking and cycling routes were not significantly longer than the shortest possible routes. Children mainly traveled through residential areas on their way to school (>80% of the route). Traffic lights were found to be positively associated with route choice during ATS. Zebra crossings were less often present along the actual routes (walking: OR = 0.17, 95% CI = 0.05-0.58; cycling: OR = 0.31, 95% CI = 0.14-0.67), and streets with a high occurrence of accidents were less often used during cycling to school (OR = 0.57, 95% CI = 0.43-0.76). Moreover, percentage of visible surface water along the actual route was higher compared to the shortest routes (walking: OR = 1.04, 95% CI = 1.01-1.07; cycling: OR = 1.03, 95% CI = 1.01-1.05). This study showed a novel approach to examine built environmental exposure during active transport to school. Most of the results of the study suggest that children avoid to walk or cycle along busy roads on their way to school.

An improved global dynamic routing strategy for scale-free network with tunable clustering

NASA Astrophysics Data System (ADS)

Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

2016-08-01

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

Calculating Least Risk Paths in 3d Indoor Space

NASA Astrophysics Data System (ADS)

Vanclooster, A.; De Maeyer, Ph.; Fack, V.; Van de Weghe, N.

2013-08-01

Over the last couple of years, research on indoor environments has gained a fresh impetus; more specifically applications that support navigation and wayfinding have become one of the booming industries. Indoor navigation research currently covers the technological aspect of indoor positioning and the modelling of indoor space. The algorithmic development to support navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. However, alternative algorithms for outdoor navigation have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behaviour (e.g. simplest paths, least risk paths). These algorithms are currently restricted to outdoor applications. The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). As such, the clarity and easiness of route instructions is of paramount importance when distributing indoor routes. A shortest or fastest path indoors not necessarily aligns with the cognitive mapping of the building. Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-storey building. The results of several least risk path calculations are compared to the shortest paths in indoor environments in terms of total length, improvement in route description complexity and number of turns. Several scenarios are tested in this comparison: paths covering a single floor, paths crossing several building wings and/or floors. Adjustments to the algorithm are proposed to be more aligned to the specific structure of indoor environments (e.g. no turn restrictions, restricted usage of rooms, vertical movement) and common wayfinding strategies indoors. In a later stage, other cognitive algorithms will be implemented and tested in both an indoor and combined indoor-outdoor setting, in an effort to improve the overall user experience during navigation in indoor environments.

Floyd-warshall algorithm to determine the shortest path based on android

NASA Astrophysics Data System (ADS)

Ramadiani; Bukhori, D.; Azainil; Dengen, N.

2018-04-01

The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever get lost to a destination even to foreign places or that have never been visited before. The reasons why many institutions and business entities use technology to improve services to consumers and to streamline the production process undertaken and so forth. Speaking of the efficient, there are many elements related to efficiency in navigation systems, and one of them is the efficiency in terms of distance. The shortest distance determination algorithm required in this research is used Floyd-Warshall Algorithm. Floyd-Warshall algorithm is the algorithm to find the fastest path and the shortest distance between 2 nodes, while the program is intended to find the path of more than 2 nodes.

Shortest recurrence periods of novae

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kato, Mariko; Saio, Hideyuki; Hachisu, Izumi

Stimulated by the recent discovery of the 1 yr recurrence period nova M31N 2008-12a, we examined the shortest recurrence periods of hydrogen shell flashes on mass-accreting white dwarfs (WDs). We discuss the mechanism that yields a finite minimum recurrence period for a given WD mass. Calculating the unstable flashes for various WD masses and mass accretion rates, we identified a shortest recurrence period of about two months for a non-rotating 1.38 M {sub ☉} WD with a mass accretion rate of 3.6 × 10{sup –7} M {sub ☉} yr{sup –1}. A 1 yr recurrence period is realized for very massivemore » (≳ 1.3 M {sub ☉}) WDs with very high accretion rates (≳ 1.5 × 10{sup –7} M {sub ☉} yr{sup –1}). We revised our stability limit of hydrogen shell burning, which will be useful for binary evolution calculations toward Type Ia supernovae.« less

Visually based path-planning by Japanese monkeys.

PubMed

Mushiake, H; Saito, N; Sakamoto, K; Sato, Y; Tanji, J

2001-03-01

To construct an animal model of strategy formation, we designed a maze path-finding task. First, we asked monkeys to capture a goal in the maze by moving a cursor on the screen. Cursor movement was linked to movements of each wrist. When the animals learned the association between cursor movement and wrist movement, we established a start and a goal in the maze, and asked them to find a path between them. We found that the animals took the shortest pathway, rather than approaching the goal randomly. We further found that the animals adopted a strategy of selecting a fixed intermediate point in the visually presented maze to select one of the shortest pathways, suggesting a visually based path planning. To examine their capacity to use that strategy flexibly, we transformed the task by blocking pathways in the maze, providing a problem to solve. The animals then developed a strategy of solving the problem by planning a novel shortest path from the start to the goal and rerouting the path to bypass the obstacle.

Effects of amyloid and small vessel disease on white matter network disruption.

PubMed

Kim, Hee Jin; Im, Kiho; Kwon, Hunki; Lee, Jong Min; Ye, Byoung Seok; Kim, Yeo Jin; Cho, Hanna; Choe, Yearn Seong; Lee, Kyung Han; Kim, Sung Tae; Kim, Jae Seung; Lee, Jae Hong; Na, Duk L; Seo, Sang Won

2015-01-01

There is growing evidence that the human brain is a large scale complex network. The structural network is reported to be disrupted in cognitively impaired patients. However, there have been few studies evaluating the effects of amyloid and small vessel disease (SVD) markers, the common causes of cognitive impairment, on structural networks. Thus, we evaluated the association between amyloid and SVD burdens and structural networks using diffusion tensor imaging (DTI). Furthermore, we determined if network parameters predict cognitive impairments. Graph theoretical analysis was applied to DTI data from 232 cognitively impaired patients with varying degrees of amyloid and SVD burdens. All patients underwent Pittsburgh compound-B (PiB) PET to detect amyloid burden, MRI to detect markers of SVD, including the volume of white matter hyperintensities and the number of lacunes, and detailed neuropsychological testing. The whole-brain network was assessed by network parameters of integration (shortest path length, global efficiency) and segregation (clustering coefficient, transitivity, modularity). PiB retention ratio was not associated with any white matter network parameters. Greater white matter hyperintensity volumes or lacunae numbers were significantly associated with decreased network integration (increased shortest path length, decreased global efficiency) and increased network segregation (increased clustering coefficient, increased transitivity, increased modularity). Decreased network integration or increased network segregation were associated with poor performances in attention, language, visuospatial, memory, and frontal-executive functions. Our results suggest that SVD alters white matter network integration and segregation, which further predicts cognitive dysfunction.

Sorting by Cuts, Joins, and Whole Chromosome Duplications.

PubMed

Zeira, Ron; Shamir, Ron

2017-02-01

Genome rearrangement problems have been extensively studied due to their importance in biology. Most studied models assumed a single copy per gene. However, in reality, duplicated genes are common, most notably in cancer. In this study, we make a step toward handling duplicated genes by considering a model that allows the atomic operations of cut, join, and whole chromosome duplication. Given two linear genomes, [Formula: see text] with one copy per gene and [Formula: see text] with two copies per gene, we give a linear time algorithm for computing a shortest sequence of operations transforming [Formula: see text] into [Formula: see text] such that all intermediate genomes are linear. We also show that computing an optimal sequence with fewest duplications is NP-hard.

A Routing Protocol for Packet Radio Networks

DTIC Science & Technology

1995-01-01

table of node K is a matrix containing, for each destination L and each neighbor of K (say M ), the distance to L ( NEOPRQ ) and the predecessor ( S OP Q...identifier T The distance to the destination ( N OP ) T The predecessor of the shortest path chosen toward L ( S OP ) T The successor ( U OP ) of the shortest...P and the predecessor is updated as S OP À ¾ S Q P . Thus, a node can determine whether or not an update received from M affects its other distance

Comparison of Dijkstra's algorithm and dynamic programming method in finding shortest path for order picker in a warehouse

NASA Astrophysics Data System (ADS)

Nordin, Noraimi Azlin Mohd; Omar, Mohd; Sharif, S. Sarifah Radiah

2017-04-01

Companies are looking forward to improve their productivity within their warehouse operations and distribution centres. In a typical warehouse operation, order picking contributes more than half percentage of the operating costs. Order picking is a benchmark in measuring the performance and productivity improvement of any warehouse management. Solving order picking problem is crucial in reducing response time and waiting time of a customer in receiving his demands. To reduce the response time, proper routing for picking orders is vital. Moreover, in production line, it is vital to always make sure the supplies arrive on time. Hence, a sample routing network will be applied on EP Manufacturing Berhad (EPMB) as a case study. The Dijkstra's algorithm and Dynamic Programming method are applied to find the shortest distance for an order picker in order picking. The results show that the Dynamic programming method is a simple yet competent approach in finding the shortest distance to pick an order that is applicable in a warehouse within a short time period.

Stabilization of a locally minimal forest

NASA Astrophysics Data System (ADS)

Ivanov, A. O.; Mel'nikova, A. E.; Tuzhilin, A. A.

2014-03-01

The method of partial stabilization of locally minimal networks, which was invented by Ivanov and Tuzhilin to construct examples of shortest trees with given topology, is developed. According to this method, boundary vertices of degree 2 are not added to all edges of the original locally minimal tree, but only to some of them. The problem of partial stabilization of locally minimal trees in a finite-dimensional Euclidean space is solved completely in the paper, that is, without any restrictions imposed on the number of edges remaining free of subdivision. A criterion for the realizability of such stabilization is established. In addition, the general problem of searching for the shortest forest connecting a finite family of boundary compact sets in an arbitrary metric space is formalized; it is shown that such forests exist for any family of compact sets if and only if for any finite subset of the ambient space there exists a shortest tree connecting it. The theory developed here allows us to establish further generalizations of the stabilization theorem both for arbitrary metric spaces and for metric spaces with some special properties. Bibliography: 10 titles.

Is short stature associated with short cervical length?

PubMed

Gagel, Caroline K; Rafael, Timothy J; Berghella, Vincenzo

2010-10-01

We sought to estimate if there is a correlation between maternal height and cervical length in women at high risk for preterm birth. We studied a retrospective cohort of women with singleton gestation and risk factors for preterm birth. Maternal height was categorized as short (<157.5 cm) or not short stature (≥157.5 cm). Cervical length at 14 to 24 weeks was evaluated. Primary outcomes were incidence of initial cervical length <30 mm and incidence of shortest cervical length <25 mm. Four hundred sixteen women met the inclusion criteria. Twenty-two (22.6%) of the short women and 79 (24.5%) of the nonshort women had an initial cervical length <30 mm ( P = 0.81). Twenty-two (23.7%) of the short women and 104 (32.2%) of the nonshort women had a cervical length <25 mm for shortest cervical length measurement ( P = 0.15). In women with singleton gestation and risk factors for preterm birth, no statistically significant relationship exists between maternal height and initial or shortest cervical length. © Thieme Medical Publishers.

Deletion mapping of 22q11 in CATCH22 syndrome: Identification of a second critical region

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurahashi, Hiroki; Nakayama, Takahiro; Nishisho, Isamu

1996-06-01

The deletion at 22q11.2 implicates a variety of congenital anomaly syndromes, for which the acronym CATCH22 has been proposed . Most patients with these syndromes share the common large deletion spanning 1-2 Mb, while the phenotypic variability of the patients does not seem to correlate with the extent of the deletions. On the basis of the deletions of rare cases with unbalanced translocation, the shortest region of overlap (SRO) had been identified in the most-centromeric region of the common large deletion. One patient (ADU) has been reported to carry a balanced translocation with the breakpoint located in the SRO. Recently,more » three transcripts were identified at or very close to the ADU breakpoint (ADUBP), making them strong candidates for CATCH22 syndrome. Here, we describe one patient with a unique deletion at 22q11.2 revealed by quantitative hybridization and/or FISH with six DNA markers in the common large deletion. The patient was dizygous at loci within the SRO and hemizygous only at the most-telomeric locus in the common large deletion. This finding suggests that there must be another critical region in the common large deletion besides the breakpoint of the ADU and that haploinsufficiency of genes in this deletion may also play a major role in CATCH22 pathogenesis. 15 refs., 3 figs.« less

Estimating a structural bottle neck for eye-brain transfer of visual information from 3D-volumes of the optic nerve head from a commercial OCT device

NASA Astrophysics Data System (ADS)

Malmberg, Filip; Sandberg-Melin, Camilla; Söderberg, Per G.

2016-03-01

The aim of this project was to investigate the possibility of using OCT optic nerve head 3D information captured with a Topcon OCT 2000 device for detection of the shortest distance between the inner limit of the retina and the central limit of the pigment epithelium around the circumference of the optic nerve head. The shortest distance between these boundaries reflects the nerve fiber layer thickness and measurement of this distance is interesting for follow-up of glaucoma.

Shortest path problem on a grid network with unordered intermediate points

NASA Astrophysics Data System (ADS)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

Incidence and Human Papillomavirus (HPV) Type Distribution of Genital Warts in a Multinational Cohort of Men: The HPV in Men Study

PubMed Central

Anic, Gabriella M.; Lee, Ji–Hyun; Stockwell, Heather; Rollison, Dana E.; Wu, Yougui; Papenfuss, Mary R.; Villa, Luisa L.; Lazcano-Ponce, Eduardo; Gage, Christine; Silva, Roberto José C.; Baggio, Maria L.; Quiterio, Manuel; Salmerón, Jorge; Abrahamsen, Martha

2011-01-01

Background. Data on the natural history of human papillomavirus (HPV)–related genital warts (GWs) in men are sparse. We described the distribution of HPV types in incident GWs and estimated GW incidence and time from type-specific incident HPV infections to GW detection in a multinational cohort of men aged 18–70 years. Methods. Participants included 2487 men examined for GWs and tested for HPV every 6 months and followed up for a median of 17.9 months. Samples were taken from 112 men with incident GWs to test for HPV DNA by polymerase chain reaction. Results. Incidence of GWs was 2.35 cases per 1000 person-years, with highest incidence among men aged 18–30 years (3.43 cases per 1000 person-years). HPV 6 (43.8%), HPV 11 (10.7%), and HPV 16 (9.8%) were the genotypes most commonly detected in GWs. The 24-month cumulative incidence of GWs among men with incident HPV 6/11 infections was 14.6% (95% confidence interval [CI], 7.5%–21.1%). Median time to GW detection was 17.1 months (95% CI, 12.4–19.3 months), with shortest time to detection among men with incident infections with HPV 6/11 only (6.2 months; 95% CI, 5.6–24.2 months). Conclusions. HPV 6/11 plays an important role in GW development, with the highest incidence and shortest time to detection among men with incident HPV 6/11 infection. PMID:22013227

Spatially-global integration of closed, fragmented contours by finding the shortest-path in a log-polar representation

PubMed Central

Kwon, TaeKyu; Agrawal, Kunal; Li, Yunfeng; Pizlo, Zygmunt

2015-01-01

Finding the occluding contours of objects in real 2D retinal images of natural 3D scenes is done by determining, which contour fragments are relevant, and the order in which they should be connected. We developed a model that finds the closed contour represented in the image by solving a shortest path problem that uses a log-polar representation of the image; the kind of representation known to exist in area V1 of the primate cortex. The shortest path in a log-polar representation favors the smooth, convex and closed contours in the retinal image that have the smallest number of gaps. This approach is practical because finding a globally-optimal solution to a shortest path problem is computationally easy. Our model was tested in four psychophysical experiments. In the first two experiments, the subject was presented with a fragmented convex or concave polygon target among a large number of unrelated pieces of contour (distracters). The density of these pieces of contour was uniform all over the screen to minimize spatially-local cues. The orientation of each target contour fragment was randomly perturbed by varying the levels of jitter. Subjects drew a closed contour that represented the target’s contour on a screen. The subjects’ performance was nearly perfect when the jitter-level was low. Their performance deteriorated as jitter-levels were increased. The performance of our model was very similar to our subjects’. In two subsequent experiments, the subject was asked to discriminate a briefly-presented egg-shaped object while maintaining fixation at several different positions relative to the closed contour of the shape. The subject’s discrimination performance was affected by the fixation position in much the same way as the model’s. PMID:26241462

The "Body Mass Index" of Flexible Ureteroscopes.

PubMed

Proietti, Silvia; Somani, Bhaskar; Sofer, Mario; Pietropaolo, Amelia; Rosso, Marco; Saitta, Giuseppe; Gaboardi, Franco; Traxer, Olivier; Giusti, Guido

2017-10-01

To assess the "body mass index" (BMI) (weight and length) of 12 flexible ureteroscopes (digital and fiber optic) along with the light cables and camera heads, to make the best use of our instruments. Twelve different brand-new flexible ureteroscopes from four different manufacturers, along with eight camera heads and three light cables were evaluated. Each ureteroscope, camera head, and light cable was weighted; the total length of each ureteroscope, shaft, handle, flexible end-tip, and cable were all measured. According to our measurements (in grams [g]), the lightest ureteroscope was the LithoVue (277.5 g), while the heaviest was the URF-V2 (942.5 g). The lightest fiber optic endoscope was the Viper (309 g), while the heaviest was the Cobra (351.5 g). Taking into account the entirety of the endoscopes, the lightest ureteroscope was the Lithovue and the heaviest was the Wolf Cobra with the Wolf camera "3 CHIP HD KAMERA KOPF ENDOCAM LOGIC HD" (1474 g). The longest ureteroscope was the URF-P6 (101.6 cm) and the shortest was the LithoVue (95.5 cm); whereas the Viper and Cobra had the longest shaft (69 cm) and URF-V had the shortest shaft (67.2 cm). The URF-V2 had the longest flexible end-tip (7.6 cm), while the LithoVue had the shortest end-tip (5.7 cm) in both directions (up/down), while the URF-V had the shortest upward deflection (3.7 cm). Newer more versatile digital endoscopes were lighter than their traditional fiber optic counterparts in their entirety, with disposable endoscope having a clear advantage over other reusable ureteroscopes. Knowing the "BMI" of our flexible ureteroscopes is an important information that every endourologist should always take into consideration.

A phylogenetic analysis of the Gruiformes (Aves) based on morphological characters, with an emphasis on the rails (Rallidae)

PubMed Central

C.Livezey, B.

1998-01-01

The order Gruiformes, for which even familial composition remains controversial, is perhaps the least well understood avian order from a phylogenetic perspective. The history of the systematics of the order is presented, and the ecological and biogeographic characteristics of its members are summarized. Using cladistic techniques, phylogenetic relationships among fossil and modern genera of the Gruiformes were estimated based on 381 primarily osteological characters; relationships among modern species of Grues (Psophiidae, Aramidae, Gruidae, Heliornithidae and Rallidae) were assessed based on these characters augmented by 189 characters of the definitive integument. A strict consensus tree for 20,000 shortest trees compiled for the matrix of gruiform genera (length = 967, CI = 0.517) revealed a number of nodes common to the solution set, many of which were robust to bootstrapping and had substantial support (Bremer) indices. Robust nodes included those supporting: a sister relationship between the Pedionomidae and Turnicidae; monophyly of the Gruiformes exclusive of the Pedionomidae and Turnicidae; a sister relationship between the Cariamidae and Phorusrhacoidea; a sister relationship between a clade comprising Eurypyga and Messelornis and one comprising Rhynochetos and Aptornis; monophyly of the Grues (Psophiidae, Aramidae, Gruidae, Heliornithidae and Rallidae); monophyly of a clade (Gruoidea) comprising (in order of increasingly close relationship) Psophia, Aramus, Balearica and other Gruidae, with monophyly of each member in this series confirmed; a sister relationship between the Heliornithidae and Rallidae; and monophyly of the Rallidae exclusive of Himantornis. Autapomorphic divergence was comparatively high for Pedionomus, Eurypyga, Psophia, Himantornis and Fulica; extreme autapomorphy, much of which is unique for the order, characterized the extinct, flightless Aptornis. In the species-level analysis of modern Grues, special efforts were made to limit the analytical impacts of homoplasy related to flightlessness in a number of rallid lineages. A strict consensus tree of 20,000 shortest trees compiled (length = 1232, CI = 0.463) confirmed the interfamilial relationships resolved in the ordinal analysis and established a number of other, variably supported groups within the Rallidae. Groupings within the Rallidae included: monophyly of Rallidae exclusive of Himantornis and a clade comprising Porphyrio (including Notornis) and Porphyrula; a poorly resolved, basal group of genera including Gymnocrex, Habroptila, Eulabeornis, Aramides, Canirallus and Mentocrex; an intermediate grade comprising Anurolimnas, Amaurolimnas, and Rougetius; monophyly of two major subdivisions of remaining rallids, one comprising Rallina (paraphyletic), Rallicula, and Sarothrura, and the other comprising the apparently paraphyletic 'long-billed' rails (e.g. Pardirallus, Cyanolimnas, Rallus, Gallirallus and Cabalus and a variably resolved clade comprising 'crakes' (e.g. Atlantisia, Laterallus and Porzana, waterhens (Amaurornis), moorhens (Gallinula and allied genera) and coots (Fulica). Relationships among 'crakes' remain poorly resolved; Laterallus may be paraphyletic, and Porzana is evidently polyphyletic and poses substantial challenges for reconciliation with current taxonomy. Relationships among the species of waterhens, moorhens and coots, however, were comparatively well resolved, and exhaustive, fine-scale analyses of several genera (Grus, Porphyrio, Aramides, Rallus, Laterallus and Fulica) and species complexes (Porphyrio porphyrio -group,Gallirallus philippensis -group and Fulica americana -group) revealed additional topological likelihoods. Many nodes shared by a majority of the shortest trees under equal weighting were common to all shortest trees found following one or two iterations of successive weighting of characters. Provisional placements of selected subfossil rallids (e.g. Diaphorapteryx, Aphanapteryx and Capellirallus ) were based on separate heuristic searches using the strict consensus tree for modern rallids as a backbone constraint. These analyses were considered with respect to assessments of robustness, homoplasy related to flightlessness, challenges and importance of fossils in cladistic analysis, previously published studies and biogeography, and an annotated phylogenetic classification of the Gruiformes is proposed.

Toxicity of pyrolysis gases from some cellular polymers

NASA Technical Reports Server (NTRS)

Hilado, C. J.; Machado, A. M.

1978-01-01

Various samples of cellular polymers were evaluated for toxicity of pyrolysis gases, using the screening test method developed at the University of San Francisco. The cellular polymer samples included polyimide, polymethacrylimide, polybismaleimide, polyurethane, polyisocyanurate, polyethylene, polychloroprene, polyvinyl chloride, polystyrene, polysiloxane, and polyphosphazene. The cellular polymers exhibited varying levels of toxicity under these test conditions. Among the rigid cellular polymers, times to death were shortest with the imide type foams and longest with polyvinyl chloride and polystyrene. Among the flexible cellular polymers, times to death were shortest with polyimide and polyester, and longest with polychloroprene and polysiloxane. Increased char yield was not necessarily associated with reduced toxicity.

Genetic Algorithm for Solving Fuzzy Shortest Path Problem in a Network with mixed fuzzy arc lengths

NASA Astrophysics Data System (ADS)

Mahdavi, Iraj; Tajdin, Ali; Hassanzadeh, Reza; Mahdavi-Amiri, Nezam; Shafieian, Hosna

2011-06-01

We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α -cuts by proposing a linear least squares model to obtain membership functions for the considered additions. Then, using a recently proposed distance function for comparison of fuzzy numbers. we propose a new approach to solve the fuzzy APSPP using of genetic algorithm. Examples are worked out to illustrate the applicability of the proposed model.

Dijkstra Methode for Optimalize Recommendation System of Garbage Transportation Time in Surakarta City

NASA Astrophysics Data System (ADS)

Hartatik; Purbayu, A.; Triyono, L.

2018-03-01

Major problem that often occurs in waste transportation in each region is the route of garbage transportation. Determination of this route should become a major concern because it affects fuel consumption and also the working time from the employee. Therefore, in this research we will develop an application to optimize with pigeonhole and dijsktra algorithm. Pigeonhole algorithm is used to determine which garbage trucks should be taken in a particular TPS. Time optimization is done by determining the shortest path that can be skipped for each garbage truck. Data generated from Pigeonhole then used to determine the shortest path by using Dijkstra algorithm.

Path querying system on mobile devices

NASA Astrophysics Data System (ADS)

Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun

2006-01-01

Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.

Longest jobs first algorithm in solving job shop scheduling using adaptive genetic algorithm (GA)

NASA Astrophysics Data System (ADS)

Alizadeh Sahzabi, Vahid; Karimi, Iman; Alizadeh Sahzabi, Navid; Mamaani Barnaghi, Peiman

2012-01-01

In this paper, genetic algorithm was used to solve job shop scheduling problems. One example discussed in JSSP (Job Shop Scheduling Problem) and I described how we can solve such these problems by genetic algorithm. The goal in JSSP is to gain the shortest process time. Furthermore I proposed a method to obtain best performance on performing all jobs in shortest time. The method mainly, is according to Genetic algorithm (GA) and crossing over between parents always follows the rule which the longest process is at the first in the job queue. In the other word chromosomes is suggested to sorts based on the longest processes to shortest i.e. "longest job first" says firstly look which machine contains most processing time during its performing all its jobs and that is the bottleneck. Secondly, start sort those jobs which are belonging to that specific machine descending. Based on the achieved results," longest jobs first" is the optimized status in job shop scheduling problems. In our results the accuracy would grow up to 94.7% for total processing time and the method improved 4% the accuracy of performing all jobs in the presented example.

Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

PubMed

Wang, Ping; Jiang, Jin-Yang; Li, Na; Luo, Han-Wu; Li, Fang; Cui, Shi-Gang

2017-07-01

It is possible to recover a signal below the Nyquist sampling limit using a compressive sensing technique in ultrasound imaging. However, the reconstruction enabled by common sparse transform approaches does not achieve satisfactory results. Considering the ultrasound echo signal's features of attenuation, repetition, and superposition, a sparse dictionary with the emission pulse signal is proposed. Sparse coefficients in the proposed dictionary have high sparsity. Images reconstructed with this dictionary were compared with those obtained with the three other common transforms, namely, discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. The performance of the proposed dictionary was analyzed via a simulation and experimental data. The mean absolute error (MAE) was used to quantify the quality of the reconstructions. Experimental results indicate that the MAE associated with the proposed dictionary was always the smallest, the reconstruction time required was the shortest, and the lateral resolution and contrast of the reconstructed images were also the closest to the original images. The proposed sparse dictionary performed better than the other three sparse transforms. With the same sampling rate, the proposed dictionary achieved excellent reconstruction quality.

Dose-response effects of corneal anesthetics.

PubMed

Polse, K A; Keener, R J; Jauregui, M J

1978-01-01

With double-masking procedures, the dose-response curves for 0.1, 0.2, and 0.4% benoxinate and 0.125, 0.25, and 0.50% proparacaine hydrochloride were determined by monitoring changes in corneal touch threshold after applying each anesthetic. The level of corneal anesthesia necessary for applanation tonometry was also determined. The maximum increase in threshold that could be measured following instillation of 50 microliter of the drug was 200 mg/mm2 All 6 anesthetic solutions produced this amount of decreased corneal sensitivity. Recovery from the anesthetic was exponential for all concentrations; however, the lower doses had the shortest duration. For applanation tonometry, the corneal threshold for touch must be 75 mg/mm2 or higher. We conclude that a quarter to a half of the commonly used anesthetic dose is sufficient for routine tonometric evaluation.

Imaging of Pericardiophrenic Bundles Using Multislice Spiral Computed Tomography for Phrenic Nerve Anatomy.

PubMed

Wang, Yan-Jing; Liu, Lin; Zhang, Meng-Chao; Sun, Huan; Zeng, Hong; Yang, Ping

2016-08-01

Phrenic nerve injury and diaphragmatic stimulation are common complications following arrhythmia ablation and pacing therapies. Preoperative comprehension of phrenic nerve anatomy via non-invasive CT imaging may help to minimize the electrophysiological procedure-related complications. Coronary CT angiography data of 121 consecutive patients were collected. Imaging of left and right pericardiophrenic bundles was performed with volume rendering and multi-planar reformation techniques. The shortest spatial distances between phrenic nerves and key electrophysiology-related structures were determined. The frequencies of the shortest distances ≤5 mm, >5 mm and direct contact between phrenic nerves and adjacent structures were calculated. Left and right pericardiophrenic bundles were identified in 86.8% and 51.2% of the patients, respectively. The right phrenic nerve was <5 mm from right superior and inferior pulmonary veins in 92.0% and 3.2% of the patients, respectively. The percentage of right phrenic nerve, <5 mm from right atrium, superior caval vein, and superior caval vein-right atrium junction was 87.1%, 100%, and 62.9%, respectively. Left phrenic nerve was <5 mm from left atrial appendage, great cardiac vein, anterior and posterior interventricular veins, and left ventricular posterior veins in 81.9%, 1.0%, 39.1%, 28.6%, and 91.4% of the patients, respectively. Merely 0.06% left phrenic nerve had a distance <5 mm with left superior pulmonary vein, and none left phrenic nerve showed a distance <5 mm with left inferior pulmonary vein. One-stop enhanced CT scanning enabled detection of phrenic nerve anatomy, which might facilitate avoidance of the phrenic nerve-related complications in interventional electrophysiology. © 2016 Wiley Periodicals, Inc.

Anomalous perovskite PbRuO3 stabilized under high pressure

PubMed Central

Cheng, J.-G.; Kweon, K. E.; Zhou, J.-S.; Alonso, J. A.; Kong, P.-P.; Liu, Y.; Jin, Changqing; Wu, Junjie; Lin, Jung-Fu; Larregola, S. A.; Yang, Wenge; Shen, Guoyin; MacDonald, A. H.; Manthiram, Arumugam; Hwang, G. S.; Goodenough, John B.

2013-01-01

Perovskite oxides ABO3 are important materials used as components in electronic devices. The highly compact crystal structure consists of a framework of corner-shared BO6 octahedra enclosing the A-site cations. Because of these structural features, forming a strong bond between A and B cations is highly unlikely and has not been reported in the literature. Here we report a pressure-induced first-order transition in PbRuO3 from a common orthorhombic phase (Pbnm) to an orthorhombic phase (Pbn21) at 32 GPa by using synchrotron X-ray diffraction. This transition has been further verified with resistivity measurements and Raman spectra under high pressure. In contrast to most well-studied perovskites under high pressure, the Pbn21 phase of PbRuO3 stabilized at high pressure is a polar perovskite. More interestingly, the Pbn21 phase has the most distorted octahedra and a shortest Pb—Ru bond length relative to the average Pb—Ru bond length that has ever been reported in a perovskite structure. We have also simulated the behavior of the PbRuO3 perovskite under high pressure by first principles calculations. The calculated critical pressure for the phase transition and evolution of lattice parameters under pressure match the experimental results quantitatively. Our calculations also reveal that the hybridization between a Ru:t2g orbital and an sp hybrid on Pb increases dramatically in the Pbnm phase under pressure. This pressure-induced change destabilizes the Pbnm phase to give a phase transition to the Pbn21 phase where electrons in the overlapping orbitals form bonding and antibonding states along the shortest Ru—Pb direction at P > Pc. PMID:24277807

Metabolic PathFinding: inferring relevant pathways in biochemical networks.

PubMed

Croes, Didier; Couche, Fabian; Wodak, Shoshana J; van Helden, Jacques

2005-07-01

Our knowledge of metabolism can be represented as a network comprising several thousands of nodes (compounds and reactions). Several groups applied graph theory to analyse the topological properties of this network and to infer metabolic pathways by path finding. This is, however, not straightforward, with a major problem caused by traversing irrelevant shortcuts through highly connected nodes, which correspond to pool metabolites and co-factors (e.g. H2O, NADP and H+). In this study, we present a web server implementing two simple approaches, which circumvent this problem, thereby improving the relevance of the inferred pathways. In the simplest approach, the shortest path is computed, while filtering out the selection of highly connected compounds. In the second approach, the shortest path is computed on the weighted metabolic graph where each compound is assigned a weight equal to its connectivity in the network. This approach significantly increases the accuracy of the inferred pathways, enabling the correct inference of relatively long pathways (e.g. with as many as eight intermediate reactions). Available options include the calculation of the k-shortest paths between two specified seed nodes (either compounds or reactions). Multiple requests can be submitted in a queue. Results are returned by email, in textual as well as graphical formats (available in http://www.scmbb.ulb.ac.be/pathfinding/).

Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

NASA Astrophysics Data System (ADS)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

Short superstrings and the structure of overlapping strings.

PubMed

Armen, C; Stein, C

1995-01-01

Given a collection of strings S = [s1,...,sn] over an alphabet sigma, a superstring alpha of S is a string containing each si as a substring, that is, for each i, 1 < or = i < or = n, alpha contains a block of magnitude of si consecutive characters that match si exactly. The shortest superstring problem is the problem of finding a superstring alpha of minimum length. The shortest superstring problem has applications in both computational biology and data compression. The shortest superstring problem is NP-hard (Gallant et al., 1980); in fact, it was recently shown to be MAX SNP-hard (Blum et al., 1994). Given the importance of the applications, several heuristics and approximation algorithms have been proposed. Constant factor approximation algorithms have been given in Blum et al. (1994) (factor of 3), Teng and Yao (1993) (factor of 2 8/9), Czumaj et al. (1994) (factor of 2 5/6), and Kosaraju et al. (1994) (factor of 2 50/63). Informally, the key to any algorithm for the shortest superstring problem is to identify sets of strings with large amounts of similarity, or overlap. Although the previous algorithms and their analyses have grown increasingly sophisticated, they reveal remarkably little about the structure of strings with large amounts of overlap. In this sense, they are solving a more general problem than the one at hand. In this paper, we study the structure of strings with large amounts of overlap and use our understanding to give an algorithm that finds a superstring whose length is no more than 2 3/4 times that of the optimal superstring. Our algorithm runs in O(magnitude of S + n3) time, which matches that of previous algorithms. We prove several interesting properties about short periodic strings, allowing us to answer questions of the following form: Given a string with some periodic structure, characterize all the possible periodic strings that can have a large amount of overlap with the first string.

Variations in rupture process with recurrence interval in a repeated small earthquake

USGS Publications Warehouse

Vidale, J.E.; Ellsworth, W.L.; Cole, A.; Marone, Chris

1994-01-01

In theory and in laboratory experiments, friction on sliding surfaces such as rock, glass and metal increases with time since the previous episode of slip. This time dependence is a central pillar of the friction laws widely used to model earthquake phenomena. On natural faults, other properties, such as rupture velocity, porosity and fluid pressure, may also vary with the recurrence interval. Eighteen repetitions of the same small earthquake, separated by intervals ranging from a few days to several years, allow us to test these laboratory predictions in situ. The events with the longest time since the previous earthquake tend to have about 15% larger seismic moment than those with the shortest intervals, although this trend is weak. In addition, the rupture durations of the events with the longest recurrence intervals are more than a factor of two shorter than for the events with the shortest intervals. Both decreased duration and increased friction are consistent with progressive fault healing during the time of stationary contact.In theory and in laboratory experiments, friction on sliding surfaces such as rock, glass and metal increases with time since the previous episode of slip. This time dependence is a central pillar of the friction laws widely used to model earthquake phenomena. On natural faults, other properties, such as rupture velocity, porosity and fluid pressure, may also vary with the recurrence interval. Eighteen repetitions of the same small earthquake, separated by intervals ranging from a few days to several years, allow us to test these laboratory predictions in situ. The events with the longest time since the previous earthquake tend to have about 15% larger seismic moment than those with the shortest intervals, although this trend is weak. In addition, the rupture durations of the events with the longest recurrence intervals are more than a factor of two shorter than for the events with the shortest intervals. Both decreased duration and increased friction are consistent with progressive fault healing during the time of stationary contact.

Alternating Acetaminophen and Ibuprofen versus Monotherapies in Improvements of Distress and Reducing Refractory Fever in Febrile Children: A Randomized Controlled Trial.

PubMed

Luo, Shuanghong; Ran, Mengdong; Luo, Qiuhong; Shu, Min; Guo, Qin; Zhu, Yu; Xie, Xiaoping; Zhang, Chongfan; Wan, Chaomin

2017-10-01

No evidence can be found in the medical literature about the efficacy of alternating acetaminophen and ibuprofen treatment in children with refractory fever. Our objective was to assess the effect of alternating acetaminophen and ibuprofen therapy on distress and refractory fever compared with acetaminophen or ibuprofen as monotherapy in febrile children. A total of 474 febrile children with axillary temperature ≥38.5 °C and fever history ≤3 days in a tertiary hospital were randomly assigned to receive either (1) alternating acetaminophen and ibuprofen (acetaminophen 10 mg/kg per dose with shortest interval of 4 h and ibuprofen 10 mg/kg per dose with shortest interval of 6 h and the shortest interval between acetaminophen and ibuprofen ≥2 h; n = 158), (2) acetaminophen monotherapy (10 mg/kg per dose with shortest interval of 4 h; n = 158), or (3) ibuprofen monotherapy (10 mg/kg per dose with shortest interval of 6 h; n = 158). The mean Non-Communicating Children's Pain Checklist (NCCPC) score was measured every 4 h, and axillary temperatures were measured every 2 h. In total, 471 children were included in an intention-to-treat analysis. No significant clinical or statistical difference was found in mean NCCPC score or temperature during the 24-h treatment period in all febrile children across the three groups. Although the proportion of children with refractory fever for 4 h and 6 h was significantly lower in the alternating group than in the monotherapy groups (4 h: 11.54% vs. 26.58% vs. 21.66%, respectively [p = 0.003]; 6 h: 3.85% vs. 10.13% vs. 17.83%, respectively [p < 0.001]), the mean NCCPC score of children with refractory fever for 4 or 6 h was not lower than those in either of the monotherapy groups. The number of patients who developed persistent high body temperature was consistent across all study groups. Alternating acetaminophen and ibuprofen can reduce the proportion of children with refractory fever, but if one cycle of alternating therapy cannot reduce febrile distress as defined by NCCPC score, two or more cycles of alternating therapy may have minimal to no clinical efficacy in some cases. The trial was registered with the Chinese Clinical Trial Registry as ChiCTR-TRC-13003440 and the WHO Registry Network as U1111-1146-6714.

Path similarity skeleton graph matching.

PubMed

Bai, Xiang; Latecki, Longin Jan

2008-07-01

This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.

Nanosecond-pulsed Q-switched Nd:YAG laser at 1064 nm with a gold nanotriangle saturable absorber

NASA Astrophysics Data System (ADS)

Chen, Xiaohan; Li, Ping; Dun, Yangyang; Song, Teng; Ma, Baomin

2018-06-01

Gold nanotriangles (GNTs) were successfully employed as a saturable absorber (SA) to achieve passively Q-switched lasers for the first time. The performance of the Q-switched Nd:YAG laser at 1064 nm has been systematically investigated. The corresponding shortest pulsewidth, the threshold pump power and the maximum Q-switched average output power were 275.5 ns, 1.37 W, and 171 mW, respectively. To our knowledge, this is the shortest pulsewidth and the lowest threshold in a passively Q-switched laser at approximately 1.1 µm based on a gold nanoparticle SA (GNPs-SA). Our experimental results proved that the GNTs-SA can be used as a promising saturable absorber for nanosecond-pulsed lasers.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Jianbao; Ma, Zhongjun, E-mail: mzj1234402@163.com; Chen, Guanrong

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding ormore » deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.« less

Beyond Hosting Capacity: Using Shortest Path Methods to Minimize Upgrade Cost Pathways: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gensollen, Nicolas; Horowitz, Kelsey A; Palmintier, Bryan S

We present in this paper a graph based forwardlooking algorithm applied to distribution planning in the context of distributed PV penetration. We study the target hosting capacity (THC) problem where the objective is to find the cheapest sequence of system upgrades to reach a predefined hosting capacity target value. We show in this paper that commonly used short-term cost minimization approaches lead most of the time to suboptimal solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Becausemore » hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate here that heuristics using domain specific knowledge can be efficiently used to improve the algorithm performance such that real distribution systems can be studied.« less

An unusual case of episodic SUNCT responding to high doses of topiramate.

PubMed

Khalil, Modar; Maniyar, Farooq; Ahmed, Fayyaz

2014-01-01

Trigeminal autonomic cephalalgias (TAC) are rare. Cluster headaches comprise the majority, with short-lasting unilateral neuralgiform headache with conjunctival injection and tearing (SUNCT) being the rarest and shortest in duration. The majority of SUNCT are primary with a few cases occurring secondary to posterior fossa or pituitary lesions. Although activities like exercise or blowing of the nose can trigger SUNCT, onset during orgasm has not been described. Short-lasting aura has been described in TACs including SUNCT, but persistence of focal symptoms and signs without an underlying structural lesion have not been described. Lastly, treatment of SUNCT is difficult, with lamotrigine being the most common effective reported. We report a case of episodic SUNCT with symptoms suggestive of brainstem stroke that completely resolved spontaneously for which no underlying structural cause was found. The onset of first attack occurred during orgasm, and the patient responded to a high dose of topiramate. © 2014 American Headache Society.

Temporal integration in nasal lateralization of ethanol.

PubMed

Wise, Paul M; Canty, Thomas M; Wysocki, Charles J

2006-03-01

Two experiments examined the trade-off between concentration and stimulus duration in nasal lateralization of n-ethyl alcohol. In nasal lateralization, a common measure of irritation threshold, subjects receive chemical vapor in one nostril and clean air in the other. Subjects try to determine which nostril received the chemical. Within experimental runs, subjects received fixed concentrations (1650-5000 ppm) of ethanol, and duration was varied to find the shortest, lateralizable stimulus. In Experiment 1, a small group of subjects was tested intensively to obtain stable individual data. In Experiment 2, a larger group was studied using more rapid methods. In both cases, subjects could lateralize increasingly weaker concentrations with longer stimulus presentations. Hence integration occurred. However, more than a twofold increase in duration was required to compensate for a twofold decrease in concentration to maintain threshold lateralization. These results suggest that an imperfect, mass-integrator model can describe short-term integration of nasal lateralization of ethanol.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

NASA Astrophysics Data System (ADS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Structures and Optical Properties of Hydrazones Derived from Biological Polyenes

NASA Astrophysics Data System (ADS)

Nakashima, Takayasu; Yamada, Takashi; Hashimoto, Hideki; Kobayashi, Takayoshi

2001-08-01

A set of hydrazone molecules was derived from a series of biological polyenes that have different polyene chain-lengths with common substituent group of 2,4-dinitrophenylhydrazine. Their structures were determined by high-resolution NMR spectroscopy as well as X-ray crystallography, and their optical properties were investigated by room and low temperature optical absorption spectroscopy. Among the derivatives so far synthesized, the one that has the shortest polyene chain (C13-DNPH) afforded single crystals without inversion symmetry, hence applicable for the second-order nonlinear optical devices. Molecular structures in the crystals were closely inspected in order to explain the cause to violate the inversion symmetry. Hydrazones derived in this study gave rise to two transition moments along the molecular axis. Comparison of the optical absorption spectra among the derivatives showed a unique phenomenon that could be attributed to the crossover of the excited state potential energy surfaces along the elongation of the polyene chain-lengths.

Structures and Optical Properties of Hydrazones Derived from Biological Polyenes

NASA Astrophysics Data System (ADS)

Nakashima, Takayasu; Yamada, Takashi; Hashimoto, Hideki; Kobayashi, Takayoshi

A set of hydrazone molecules was derived from a series of biological polyenes that have different polyene chain-lengths with common substituent group of 2,4-dinitrophenylhydrazine. Their structures were determined by high-resolution NMR spectroscopy as well as X-ray crystallography, and their optical properties were investigated by room and low temperature optical absorption spectroscopy. Among the derivatives so far synthesized, the one that has the shortest polyene chain (C13-DNPH) afforded single crystals without inversion symmetry, hence applicable for the second-order nonlinear optical devices. Molecular structures in the crystals were closely inspected in order to explain the cause to violate the inversion symmetry. Hydrazones derived in this study gave rise to two transition moments along the molecular axis. Comparison of the optical absorption spectra among the derivatives showed a unique phenomenon that could be attributed to the crossover of the excited state potential energy surfaces along the elongation of the polyene chain-lengths.

Stochastic Dynamics of Lexicon Learning in an Uncertain and Nonuniform World

NASA Astrophysics Data System (ADS)

Reisenauer, Rainer; Smith, Kenny; Blythe, Richard A.

2013-06-01

We study the time taken by a language learner to correctly identify the meaning of all words in a lexicon under conditions where many plausible meanings can be inferred whenever a word is uttered. We show that the most basic form of cross-situational learning—whereby information from multiple episodes is combined to eliminate incorrect meanings—can perform badly when words are learned independently and meanings are drawn from a nonuniform distribution. If learners further assume that no two words share a common meaning, we find a phase transition between a maximally efficient learning regime, where the learning time is reduced to the shortest it can possibly be, and a partially efficient regime where incorrect candidate meanings for words persist at late times. We obtain exact results for the word-learning process through an equivalence to a statistical mechanical problem of enumerating loops in the space of word-meaning mappings.

The analysis of the possibility of using 10-minute rainfall series to determine the maximum rainfall amount with 5 minutes duration

NASA Astrophysics Data System (ADS)

Kaźmierczak, Bartosz; Wartalska, Katarzyna; Wdowikowski, Marcin; Kotowski, Andrzej

2017-11-01

Modern scientific research in the area of heavy rainfall analysis regarding to the sewerage design indicates the need to develop and use probabilistic rain models. One of the issues that remains to be resolved is the length of the shortest amount of rain to be analyzed. It is commonly believed that the best time is 5 minutes, while the least rain duration measured by the national services is often 10 or even 15 minutes. Main aim of this paper is to present the difference between probabilistic rainfall models results given from rainfall time series including and excluding 5 minutes rainfall duration. Analysis were made for long-time period from 1961-2010 on polish meteorological station Legnica. To develop best fitted to measurement rainfall data probabilistic model 4 probabilistic distributions were used. Results clearly indicates that models including 5 minutes rainfall duration remains more appropriate to use.

Spatial interpolation of river channel topography using the shortest temporal distance

NASA Astrophysics Data System (ADS)

Zhang, Yanjun; Xian, Cuiling; Chen, Huajin; Grieneisen, Michael L.; Liu, Jiaming; Zhang, Minghua

2016-11-01

It is difficult to interpolate river channel topography due to complex anisotropy. As the anisotropy is often caused by river flow, especially the hydrodynamic and transport mechanisms, it is reasonable to incorporate flow velocity into topography interpolator for decreasing the effect of anisotropy. In this study, two new distance metrics defined as the time taken by water flow to travel between two locations are developed, and replace the spatial distance metric or Euclidean distance that is currently used to interpolate topography. One is a shortest temporal distance (STD) metric. The temporal distance (TD) of a path between two nodes is calculated by spatial distance divided by the tangent component of flow velocity along the path, and the STD is searched using the Dijkstra algorithm in all possible paths between two nodes. The other is a modified shortest temporal distance (MSTD) metric in which both the tangent and normal components of flow velocity were combined. They are used to construct the methods for the interpolation of river channel topography. The proposed methods are used to generate the topography of Wuhan Section of Changjiang River and compared with Universal Kriging (UK) and Inverse Distance Weighting (IDW). The results clearly showed that the STD and MSTD based on flow velocity were reliable spatial interpolators. The MSTD, followed by the STD, presents improvement in prediction accuracy relative to both UK and IDW.

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

NASA Astrophysics Data System (ADS)

Fronita, Mona; Gernowo, Rahmat; Gunawan, Vincencius

2018-02-01

Traveling Salesman Problem (TSP) is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour's to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

Biostratigraphy and chronostratigraphy of the Cambrian-Ordovician great American carbonate bank

USGS Publications Warehouse

Taylor, John F.; Repetski, John E.; Loch, James D.; Leslie, Stephen A.

2012-01-01

The carbonate strata of the great American carbonate bank (GACB) have been subdivided and correlated with ever-increasing precision and accuracy during the past half century through use of the dominant organisms that evolved on the Laurentian platform through the Cambrian and the Ordovician. Trilobites and conodonts remain the primary groups used for this purpose, although brachiopods, both calcareous and phosphatic, and graptolites are very important in certain facies and intervals. A series of charts show the chronostratigraphic units (series and stages) currently in use for deposits of the GACB and the biostratigraphic units (zones, subzones, and biomeres) whose boundaries delineate them. Older and, in some cases obsolete, stages and faunal units are included in the figures to allow users to relate information from previous publications and/or industry databases to modern units. This chapter also provides a brief discussion on the use of biostratigraphy in the recognition and interregional correlation of supersequence boundaries within the Sauk and Tippecanoe megasequences, and the varied perspectives on the nature of biostratigraphic units and their defining taxa during the past half century. Also included are a concise update on the biomere concept, and an explanation of the biostratigraphic consequences of a profound change in the dynamics of extinction and replacement that occurred on the GACB in the Early Ordovician when the factors responsible for platformwide biomere-type extinctions faded and ultimately disappeared. A final section addresses recent and pending refinements in the genus and species taxonomy of biostratigraphically significant fossil groups, the potential they hold for greatly improved correlation, and the obstacles to be overcome for that potential to be realized.

PARTICLE DISPLACEMENTS ON THE WALL OF A BOREHOLE FROM INCIDENT PLANE WAVES.

USGS Publications Warehouse

Lee, M.W.

1987-01-01

Particle displacements from incident plane waves at the wall of a fluid-filled borehole are formulated by applying the seismic reciprocity theorem to far-field displacement fields. Such displacement fields are due to point forces acting on a fluid-filled borehole under the assumption of long wavelengths. The displacement fields are analyzed to examine the effect of the borehole on seismic wave propagation, particularly for vertical seismic profiling (VSP) measurements. When the shortest wavelength of interest is approximately 25 times longer than the borehole's diameter, the scattered displacements are proportional to the first power of incident frequency and borehole diameter. When the shortest wavelength of interest is about 40 times longer than the borehole's diameter, borehole effects on VSP measurements using a wall-locking geophone are negligible.

Standalone Mobile Application for Shipping Services Based on Geographic Information System and A-Star Algorithm

NASA Astrophysics Data System (ADS)

Gunawan, D.; Marzuki, I.; Candra, A.

2018-03-01

Geographic Information Systems (GIS) plays an essential role in shipping service related application. By utilizing GIS, the courier can find the route to deliver goods for its customer. This research proposes a standalone mobile application to provide the shortest route to the destinations by utilizing geographic information systems with A-Star algorithm. This application is intended to be used although the area has no Internet network available. The developed application can handle several drop off points then calculates the shortest route that passes through all the drop off points. According to the conducted testing, the number of drop off points that can be calculated is influenced by the specification of the smartphone. More destinations require more smartphone resources and time to process.

Structural factoring approach for analyzing stochastic networks

NASA Technical Reports Server (NTRS)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Comparison of weighted and unweighted network analysis in the case of a pig trade network in Northern Germany.

PubMed

Büttner, Kathrin; Krieter, Joachim

2018-08-01

The analysis of trade networks as well as the spread of diseases within these systems focuses mainly on pure animal movements between farms. However, additional data included as edge weights can complement the informational content of the network analysis. However, the inclusion of edge weights can also alter the outcome of the network analysis. Thus, the aim of the study was to compare unweighted and weighted network analyses of a pork supply chain in Northern Germany and to evaluate the impact on the centrality parameters. Five different weighted network versions were constructed by adding the following edge weights: number of trade contacts, number of delivered livestock, average number of delivered livestock per trade contact, geographical distance and reciprocal geographical distance. Additionally, two different edge weight standardizations were used. The network observed from 2013 to 2014 contained 678 farms which were connected by 1,018 edges. General network characteristics including shortest path structure (e.g. identical shortest paths, shortest path lengths) as well as centrality parameters for each network version were calculated. Furthermore, the targeted and the random removal of farms were performed in order to evaluate the structural changes in the networks. All network versions and edge weight standardizations revealed the same number of shortest paths (1,935). Between 94.4 to 98.9% of the unweighted network and the weighted network versions were identical. Furthermore, depending on the calculated centrality parameters and the edge weight standardization used, it could be shown that the weighted network versions differed from the unweighted network (e.g. for the centrality parameters based on ingoing trade contacts) or did not differ (e.g. for the centrality parameters based on the outgoing trade contacts) with regard to the Spearman Rank Correlation and the targeted removal of farms. The choice of standardization method as well as the inclusion or exclusion of specific farm types (e.g. abattoirs) can alter the results significantly. These facts have to be considered when centrality parameters are to be used for the implementation of prevention and control strategies in the case of an epidemic. Copyright © 2018 Elsevier B.V. All rights reserved.

Common fractures and dislocations of the hand.

PubMed

Jones, Neil F; Jupiter, Jesse B; Lalonde, Donald H

2012-11-01

After reading this article, the participant should be able to: 1. Describe the concept of early protected movement with Kirschner-wired finger fractures to the hand therapist. 2. Choose the most appropriate method of fracture fixation to achieve the goal of a full range of motion. 3. Describe the methods of treatment available for the most common fractures and dislocations of the hand. The main goal of treatment of hand and finger fractures and dislocations is to attain a full range of wrist and nonscissoring finger motion after the treatment is accomplished. This CME article consists of literature review, illustrations, movies, and an online CME examination to bring the participant recent available information on the topic. The authors reviewed literature regarding the most current treatment strategies for common hand and finger fractures and dislocations. Films were created to illustrate operative and rehabilitation methods used to treat these problems. A series of multiple-choice questions, answers, discussions, and references were written and are provided online so that the participant can receive the full benefit of this review. Many treatment options are available, from buddy and Coban taping to closed reduction with immobilization; percutaneous pins or screws; and open reduction with pins, screws, or plates. Knowledge of all available options is important because all can be used to achieve the goal of treatment in the shortest time possible. The commonly used methods of treatment are reviewed and illustrated. Management of common hand and finger fractures and dislocations includes the need to focus on achieving a full range of motion after treatment. A balance of fracture reduction with minimal dissection and early protected movement will achieve the goal.

A shortest-path graph kernel for estimating gene product semantic similarity.

PubMed

Alvarez, Marco A; Qi, Xiaojun; Yan, Changhui

2011-07-29

Existing methods for calculating semantic similarity between gene products using the Gene Ontology (GO) often rely on external resources, which are not part of the ontology. Consequently, changes in these external resources like biased term distribution caused by shifting of hot research topics, will affect the calculation of semantic similarity. One way to avoid this problem is to use semantic methods that are "intrinsic" to the ontology, i.e. independent of external knowledge. We present a shortest-path graph kernel (spgk) method that relies exclusively on the GO and its structure. In spgk, a gene product is represented by an induced subgraph of the GO, which consists of all the GO terms annotating it. Then a shortest-path graph kernel is used to compute the similarity between two graphs. In a comprehensive evaluation using a benchmark dataset, spgk compares favorably with other methods that depend on external resources. Compared with simUI, a method that is also intrinsic to GO, spgk achieves slightly better results on the benchmark dataset. Statistical tests show that the improvement is significant when the resolution and EC similarity correlation coefficient are used to measure the performance, but is insignificant when the Pfam similarity correlation coefficient is used. Spgk uses a graph kernel method in polynomial time to exploit the structure of the GO to calculate semantic similarity between gene products. It provides an alternative to both methods that use external resources and "intrinsic" methods with comparable performance.

Geometric analysis of the V-Y advancement flap and its clinical applications.

PubMed

Andrades, Patricio R; Calderon, Wilfredo; Leniz, Patricio; Bartel, German; Danilla, Stefan; Benitez, Susana

2005-05-01

Geometry is fundamental in the comprehension of local flap design. The purpose of this study was to discuss the differences between the V-Y advancement flap and other local flaps, understand its geometry, and analyze its clinical applications. The analysis was based on qualitative measurements of an injury, taking into consideration the following dimensions: largest diameter, shortest diameter, and depth. Standardization of the flap design consisted of directing its advancement over the shortest diameter and making the V base match the size of the largest diameter. The flap was analyzed in two planes: the horizontal plane includes the V-Y design and the vertical plane includes the flap pedicle. The height of the flap can be obtained by simple trigonometry, taking into consideration the largest diameter and alpha angle in the horizontal plane. In the vertical plane, where the pedicle and pivot plane are positioned, for known shortest diameter and depth, the final depth of the pivot plane can be calculated using Pythagoras' principles. This analysis was applied to 25 patients with adequate skin coverage at follow-up. A correction factor was added to reduce the overdeepening of the vertical plane calculations. The final concepts for clinical application in the classic deep pedicle V-Y flap design are to calculate the length of the V by modifying the alpha angle and to move the pivot plane deeper to accomplish optimal flap movement. Using these principles, tension-free closure of the Y and appropriate advancement of the flap are obtained.

The application of vector concepts on two skew lines

NASA Astrophysics Data System (ADS)

Alghadari, F.; Turmudi; Herman, T.

2018-01-01

The purpose of this study is knowing how to apply vector concepts on two skew lines in three-dimensional (3D) coordinate and its utilization. Several mathematical concepts have a related function for the other, but the related between the concept of vector and 3D have not applied in learning classroom. In fact, there are studies show that female students have difficulties in learning of 3D than male. It is because of personal spatial intelligence. The relevance of vector concepts creates both learning achievement and mathematical ability of male and female students enables to be balanced. The distance like on a cube, cuboid, or pyramid whose are drawn on the rectangular coordinates of a point in space. Two coordinate points of the lines can be created a vector. The vector of two skew lines has the shortest distance and the angle. Calculating of the shortest distance is started to create two vectors as a representation of line by vector position concept, next to determining a norm-vector of two vector which was obtained by cross-product, and then to create a vector from two combination of pair-points which was passed by two skew line, the shortest distance is scalar orthogonal projection of norm-vector on a vector which is a combination of pair-points. While calculating the angle are used two vectors as a representation of line to dot-product, and the inverse of cosine is yield. The utilization of its application on mathematics learning and orthographic projection method.

The effects of session length on demand functions generated using FR schedules.

PubMed

Foster, T Mary; Kinloch, Jennifer; Poling, Alan

2011-05-01

In comparing open and closed economies, researchers often arrange shorter sessions under the former condition than under the latter. Several studies indicate that session length per se can affect performance and there are some data that indicate that this variable can influence demand functions. To provide further data, the present study exposed domestic hens to series of increasing fixed-ratio schedules with the length of the open-economy sessions varied over 10, 40, 60, and 120 min. Session time affected the total-session response rates and pause lengths. The shortest session gave the greatest response rates and shortest pauses and the longest gave the lowest response rates and longest pauses. The total-session demand functions also changed with session length: The shortest session gave steeper initial slopes (i.e., the functions were more elastic at small ratios) and smaller rates of change of elasticity than the longest session. Response rates, pauses, and demand functions were, however, similar for equivalent periods of responding taken from within sessions of different overall lengths (e.g., total-session data for 10-min sessions and the data for the first 10 min of 120-min sessions). These findings suggest that differences in session length can confound the results of studies comparing open and closed economies when those economies are arranged in sessions that differ substantially in length, hence data for equivalent-length periods of responding, rather than total-session data, should be of primary interest under these conditions.

Influence of the height of the external hexagon and surface treatment on fatigue life of commercially pure titanium dental implants.

PubMed

Gil, Francisco Javier; Aparicio, Conrado; Manero, Jose M; Padros, Alejandro

2009-01-01

This study evaluated the effect of external hexagon height and commonly applied surface treatments on the fatigue life of titanium dental implants. Electropolished commercially pure titanium dental implants (seven implants per group) with three different external hexagon heights (0.6, 1.2, and 1.8 mm) and implants with the highest external hexagon height (1.8 mm) and different surface treatments (electropolishing, grit blasting with aluminium oxide, and acid etching with sulfuric acid) were tested to evaluate their mechanical fatigue life. To do so, 10-Hz triangular flexural load cycles were applied at 37 degrees C in artificial saliva, and the number of load cycles until implant fracture was determined. Tolerances of the hexagon/abutment fit and implant surface roughness were analyzed by scanning electron microscopy and light interferometry. Transmission electron microscopy and electron diffraction analyses of titanium hydrides were performed. First, the fatigue life of implants with the highest hexagon (8,683 +/- 978 load cycles) was more than double that of the implants with the shortest hexagons (3,654 +/- 789 load cycles) (P < .02). Second, the grit-blasted implants had the longest fatigue life of the tested materials (21,393 +/- 2,356 load cycles), which was significantly greater than that of the other surfaces (P < .001). The compressive surface residual stresses induced when blasting titanium are responsible for this superior mechanical response. Third, precipitation of titanium hydrides in grain boundaries of titanium caused by hydrogen adsorption from the acid solution deteriorates the fatigue life of acid-etched titanium dental implants. These implants had the shortest fatigue life (P < .05). The fatigue life of threaded root-form dental implants varies with the height of the external hexagon and/or the surface treatment of the implant. An external hexagon height of 1.8 mm and/or a blasting treatment appear to significantly increase fatigue life of dental implants.

The application of muscle wrapping to voxel-based finite element models of skeletal structures.

PubMed

Liu, Jia; Shi, Junfen; Fitton, Laura C; Phillips, Roger; O'Higgins, Paul; Fagan, Michael J

2012-01-01

Finite elements analysis (FEA) is now used routinely to interpret skeletal form in terms of function in both medical and biological applications. To produce accurate predictions from FEA models, it is essential that the loading due to muscle action is applied in a physiologically reasonable manner. However, it is common for muscle forces to be represented as simple force vectors applied at a few nodes on the model's surface. It is certainly rare for any wrapping of the muscles to be considered, and yet wrapping not only alters the directions of muscle forces but also applies an additional compressive load from the muscle belly directly to the underlying bone surface. This paper presents a method of applying muscle wrapping to high-resolution voxel-based finite element (FE) models. Such voxel-based models have a number of advantages over standard (geometry-based) FE models, but the increased resolution with which the load can be distributed over a model's surface is particularly advantageous, reflecting more closely how muscle fibre attachments are distributed. In this paper, the development, application and validation of a muscle wrapping method is illustrated using a simple cylinder. The algorithm: (1) calculates the shortest path over the surface of a bone given the points of origin and ultimate attachment of the muscle fibres; (2) fits a Non-Uniform Rational B-Spline (NURBS) curve from the shortest path and calculates its tangent, normal vectors and curvatures so that normal and tangential components of the muscle force can be calculated and applied along the fibre; and (3) automatically distributes the loads between adjacent fibres to cover the bone surface with a fully distributed muscle force, as is observed in vivo. Finally, we present a practical application of this approach to the wrapping of the temporalis muscle around the cranium of a macaque skull.

An experimental analysis on OSPF-TE convergence time

NASA Astrophysics Data System (ADS)

Huang, S.; Kitayama, K.; Cugini, F.; Paolucci, F.; Giorgetti, A.; Valcarenghi, L.; Castoldi, P.

2008-11-01

Open shortest path first (OSPF) protocol is commonly used as an interior gateway protocol (IGP) in MPLS and generalized MPLS (GMPLS) networks to determine the topology over which label-switched paths (LSPs) can be established. Traffic-engineering extensions (network states such as link bandwidth information, available wavelengths, signal quality, etc) have been recently enabled in OSPF (henceforth, called OSPF-TE) to support shortest path first (SPF) tree calculation upon different purposes, thus possibly achieving optimal path computation and helping improve resource utilization efficiency. Adding these features into routing phase can exploit the OSPF robustness, and no additional network component is required to manage the traffic-engineering information. However, this traffic-engineering enhancement also complicates OSPF behavior. Since network states change frequently upon the dynamic trafficengineered LSP setup and release, the network is easily driven from a stable state to unstable operating regimes. In this paper, we focus on studying the OSPF-TE stability in terms of convergence time. Convergence time is referred to the time spent by the network to go back to steady states upon any network state change. An external observation method (based on black-box method) is employed to estimate the convergence time. Several experimental test-beds are developed to emulate dynamic LSP setup/release, re-routing upon single-link failure. The experimental results show that with OSPF-TE the network requires more time to converge compared to the conventional OSPF protocol without TE extension. Especially, in case of wavelength-routed optical network (WRON), introducing per wavelength availability and wavelength continuity constraint to OSPF-TE suffers severe convergence time and a large number of advertised link state advertisements (LSAs). Our study implies that long convergence time and large number of LSAs flooded in the network might cause scalability problems in OSPF-TE and impose limitations on OSPF-TE applications. New solutions to mitigate the s convergence time and to reduce the amount of state information are desired in the future.

Sliding Window Analyses for Optimal Selection of Mini-Barcodes, and Application to 454-Pyrosequencing for Specimen Identification from Degraded DNA

PubMed Central

Boyer, Stephane; Brown, Samuel D. J.; Collins, Rupert A.; Cruickshank, Robert H.; Lefort, Marie-Caroline; Malumbres-Olarte, Jagoba; Wratten, Stephen D.

2012-01-01

DNA barcoding remains a challenge when applied to diet analyses, ancient DNA studies, environmental DNA samples and, more generally, in any cases where DNA samples have not been adequately preserved. Because the size of the commonly used barcoding marker (COI) is over 600 base pairs (bp), amplification fails when the DNA molecule is degraded into smaller fragments. However, relevant information for specimen identification may not be evenly distributed along the barcoding region, and a shorter target can be sufficient for identification purposes. This study proposes a new, widely applicable, method to compare the performance of all potential ‘mini-barcodes’ for a given molecular marker and to objectively select the shortest and most informative one. Our method is based on a sliding window analysis implemented in the new R package SPIDER (Species IDentity and Evolution in R). This method is applicable to any taxon and any molecular marker. Here, it was tested on earthworm DNA that had been degraded through digestion by carnivorous landsnails. A 100 bp region of 16 S rDNA was selected as the shortest informative fragment (mini-barcode) required for accurate specimen identification. Corresponding primers were designed and used to amplify degraded earthworm (prey) DNA from 46 landsnail (predator) faeces using 454-pyrosequencing. This led to the detection of 18 earthworm species in the diet of the snail. We encourage molecular ecologists to use this method to objectively select the most informative region of the gene they aim to amplify from degraded DNA. The method and tools provided here, can be particularly useful (1) when dealing with degraded DNA for which only small fragments can be amplified, (2) for cases where no consensus has yet been reached on the appropriate barcode gene, or (3) to allow direct analysis of short reads derived from massively parallel sequencing without the need for bioinformatic consolidation. PMID:22666489

42 CFR 412.92 - Special treatment: Sole community hospitals.

Code of Federal Regulations, 2014 CFR

2014-10-01

... was approved. (c) Terminology. As used in this section— (1) The term miles means the shortest distance... low-income patients as determined under § 412.106 and for indirect medical education costs as...

42 CFR 412.92 - Special treatment: Sole community hospitals.

Code of Federal Regulations, 2013 CFR

2013-10-01

... was approved. (c) Terminology. As used in this section— (1) The term miles means the shortest distance... low-income patients as determined under § 412.106 and for indirect medical education costs as...

42 CFR 412.92 - Special treatment: Sole community hospitals.

Code of Federal Regulations, 2012 CFR

2012-10-01

... was approved. (c) Terminology. As used in this section— (1) The term miles means the shortest distance... low-income patients as determined under § 412.106 and for indirect medical education costs as...

7 CFR 91.40 - Fees for courier service and facsimile of the analysis report.

Code of Federal Regulations, 2011 CFR

2011-01-01

... (CONTINUED) COMMODITY LABORATORY TESTING PROGRAMS SERVICES AND GENERAL INFORMATION Fees and Charges § 91.40... the shortest round trip route from laboratory to sample retrieval site. Pursuant to the requirements...

7 CFR 91.40 - Fees for courier service and facsimile of the analysis report.

Code of Federal Regulations, 2014 CFR

2014-01-01

... (CONTINUED) COMMODITY LABORATORY TESTING PROGRAMS SERVICES AND GENERAL INFORMATION Fees and Charges § 91.40... the shortest round trip route from laboratory to sample retrieval site. Pursuant to the requirements...

7 CFR 91.40 - Fees for courier service and facsimile of the analysis report.

Code of Federal Regulations, 2012 CFR

2012-01-01

... (CONTINUED) COMMODITY LABORATORY TESTING PROGRAMS SERVICES AND GENERAL INFORMATION Fees and Charges § 91.40... the shortest round trip route from laboratory to sample retrieval site. Pursuant to the requirements...

7 CFR 91.40 - Fees for courier service and facsimile of the analysis report.

Code of Federal Regulations, 2013 CFR

2013-01-01

... (CONTINUED) COMMODITY LABORATORY TESTING PROGRAMS SERVICES AND GENERAL INFORMATION Fees and Charges § 91.40... the shortest round trip route from laboratory to sample retrieval site. Pursuant to the requirements...

7 CFR 91.40 - Fees for courier service and facsimile of the analysis report.

Code of Federal Regulations, 2010 CFR

2010-01-01

... (CONTINUED) COMMODITY LABORATORY TESTING PROGRAMS SERVICES AND GENERAL INFORMATION Fees and Charges § 91.40... the shortest round trip route from laboratory to sample retrieval site. Pursuant to the requirements...

The routing, modulation level, and spectrum allocation algorithm in the virtual optical network mapping

NASA Astrophysics Data System (ADS)

Wang, Yunyun; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa

2017-10-01

With the development of large video services and cloud computing, the network is increasingly in the form of services. In SDON, the SDN controller holds the underlying physical resource information, thus allocating the appropriate resources and bandwidth to the VON service. However, for some services that require extremely strict QoT (quality of transmission), the shortest distance path algorithm is often unable to meet the requirements because it does not take the link spectrum resources into account. And in accordance with the choice of the most unoccupied links, there may be more spectrum fragments. So here we propose a new RMLSA (the routing, modulation Level, and spectrum allocation) algorithm to reduce the blocking probability. The results show about 40% less blocking probability than the shortest-distance algorithm and the minimum usage of the spectrum priority algorithm. This algorithm is used to satisfy strict request of QoT for demands.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

2017-12-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, Jeffrey D.; Hagberg, Aric; Srinivasan, Gowri; Mohd-Yusof, Jamaludin; Viswanathan, Hari

2017-07-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

An experimental study on the coalescence process of binary droplets in oil under ultrasonic standing waves.

PubMed

Luo, Xiaoming; Cao, Juhang; He, Limin; Wang, Hongping; Yan, Haipeng; Qin, Yahua

2017-01-01

The coalescence process of binary droplets in oil under ultrasonic standing waves was investigated with high-speed photography. Three motion models of binary droplets in coalescence process were illustrated: (1) slight translational oscillation; (2) sinusoidal translational oscillation; (3) migration along with acoustic streaming. To reveal the droplets coalescence mechanisms, the influence of main factors (such as acoustic intensity, droplet size, viscosity and interfacial tension, etc) on the motion and coalescence of binary droplets was studied under ultrasonic standing waves. Results indicate that the shortest coalescence time is achieved when binary droplets show sinusoidal translational oscillation. The corresponding acoustic intensity in this case is the optimum acoustic intensity. Under the optimum acoustic intensity, drop size decrease will bring about coalescence time decrease by enhancing the binary droplets oscillation. Moreover, there is an optimum interfacial tension to achieve the shortest coalescence time. Copyright © 2016 Elsevier B.V. All rights reserved.

Dynamic path planning for mobile robot based on particle swarm optimization

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In the contemporary, robots are used in many fields, such as cleaning, medical treatment, space exploration, disaster relief and so on. The dynamic path planning of robot without collision is becoming more and more the focus of people's attention. A new method of path planning is proposed in this paper. Firstly, the motion space model of the robot is established by using the MAKLINK graph method. Then the A* algorithm is used to get the shortest path from the start point to the end point. Secondly, this paper proposes an effective method to detect and avoid obstacles. When an obstacle is detected on the shortest path, the robot will choose the nearest safety point to move. Moreover, calculate the next point which is nearest to the target. Finally, the particle swarm optimization algorithm is used to optimize the path. The experimental results can prove that the proposed method is more effective.

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach

PubMed Central

Wang, Meng; Wu, Kai; Lu, Changhong; Kong, Xiangyin

2015-01-01

Prostate cancer is a type of cancer that occurs in the male prostate, a gland in the male reproductive system. Because prostate cancer cells may spread to other parts of the body and can influence human reproduction, understanding the mechanisms underlying this disease is critical for designing effective treatments. The identification of as many genes and chemicals related to prostate cancer as possible will enhance our understanding of this disease. In this study, we proposed a computational method to identify new candidate genes and chemicals based on currently known genes and chemicals related to prostate cancer by applying a shortest path approach in a hybrid network. The hybrid network was constructed according to information concerning chemical-chemical interactions, chemical-protein interactions, and protein-protein interactions. Many of the obtained genes and chemicals are associated with prostate cancer. PMID:26504486

Study on queueing behavior in pedestrian evacuation by extended cellular automata model

NASA Astrophysics Data System (ADS)

Hu, Jun; You, Lei; Zhang, Hong; Wei, Juan; Guo, Yangyong

2018-01-01

This paper proposes a pedestrian evacuation model for effective simulation of evacuation efficiency based on extended cellular automata. In the model, pedestrians' momentary transition probability to a target position is defined in terms of the floor field and queueing time, and the critical time is defined as the waiting time threshold in a queue. Queueing time and critical time are derived using Fractal Brownian Motion through analysis of pedestrian arrival characteristics. Simulations using the platform and actual evacuations were conducted to study the relationships among system evacuation time, average system velocity, pedestrian density, flow rate, and critical time. The results demonstrate that at low pedestrian density, evacuation efficiency can be improved through adoption of the shortest route strategy, and critical time has an inverse relationship with average system velocity. Conversely, at higher pedestrian densities, it is better to adopt the shortest queueing time strategy, and critical time is inversely related to flow rate.

The Oligocene-Miocene stratigraphic evolution of the Majella carbonate platform (Central Apennines, Italy)

NASA Astrophysics Data System (ADS)

Brandano, Marco; Cornacchia, Irene; Raffi, Isabella; Tomassetti, Laura

2016-03-01

The stratigraphic architecture of the Bolognano Formation documents the evolution of the Majella carbonate platform in response to global and local changes that affected the Mediterranean area during the Oligocene-Miocene interval. The Bolognano Formation consists of a homoclinal ramp that developed in a warm, subtropical environment. Five different lithofacies associations have been identified: Lepidocyclina calcarenites, cherty marly limestones, bryozon calcarenites, hemipelagic marls and marly limestones, and Lithothamnion limestones. Each association corresponds to a single lithostratigraphic unit except for the Lepidocyclina calcarenites that form two distinct lithostratigraphic units (Lepidocyclina calcarenites 1 and 2). These six units reflect alternation of shallow-water carbonate production and drowning. Specifically, two of the three stages of shallow-water carbonate production regard the development of wide dune fields within the middle ramp, one stage dominated by red algae and a sea-grass carbonate factory, whereas the two drowning phases are represented by marly cherty limestones and calcareous marls. A new biostratigraphic framework for Bolognano Formation is presented, based on high-resolution analysis of calcareous nannofossil assemblages, which proved to be very useful for biostratigraphic constraints also in shallow-water settings. Using this approach, we have linked the first drowning phase, late Chattian-Aquitanian p.p. in age, to western Mediterranean volcanism and the Mi-1 event, and the second drowning phase, late Burdigalian-Serravallian in age, to the closure of the Indo-Pacific passage and the occurrence of the global Monterey event. These results permit a new deciphering, in terms of sequence stratigraphy, of the Bolognano Formation that is interpreted as a 2nd-order super-sequence that can be subdivided into 3 transgressive-regressive sequences.

Geometrical specifications accuracy influence on the quality of electromechanical devices

NASA Astrophysics Data System (ADS)

Glukhov, V. I.; Lakeenko, M. N.; Dolzhikov, S. N.

2017-06-01

To improve the quality of electromechanical products is possible due to the geometrical specifications optimization of values and tolerances. Electromechanical products longevity designates the rolling-contact bearings of the armature shaft. Longevity of the rolling-contact bearings is less than designed one, since assembly and fitting alter gaps, sizes and geometric tolerances for the working parts of the basic rolling bearing details. Geometrical models of the rolling-contact bearing details for the armature shaft and the end shield are developed on the basis of an electric locomotive traction motor in the present work. The basic elements of the details conjugating with the adjacent details and materializing the generalized and auxiliary coordinate systems are determined. Function, informativeness and the number of geometrical specifications for the elements location are specified. The recommendations on amending the design documentation due to geometrical models to improve the accuracy and the quality of the products are developed: the replacement of the common axis of the shaft’s technological datums by the common axis of the basic design datums; coaxiality tolerances for these design datums with respect to their common axis; the modifiers for these auxiliary datums and these datums location tolerances according to the principles of datums uniformity, inversion and the shortest dimension chains. The investigation demonstrated that the problem of enhancing the durability, longevity, and efficiency coefficient for electromechanical products can be solved with the systematic normalizations of geometrical specifications accuracy on the basis of the coordinate systems introduced in the standards on geometrical product specifications (GPS).

Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, Lei; Holden, Jacob R.; Gonder, Jeffrey D.

With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similaritymore » score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.« less

Graph-based analysis of kinetics on multidimensional potential-energy surfaces.

PubMed

Okushima, T; Niiyama, T; Ikeda, K S; Shimizu, Y

2009-09-01

The aim of this paper is twofold: one is to give a detailed description of an alternative graph-based analysis method, which we call saddle connectivity graph, for analyzing the global topography and the dynamical properties of many-dimensional potential-energy landscapes and the other is to give examples of applications of this method in the analysis of the kinetics of realistic systems. A Dijkstra-type shortest path algorithm is proposed to extract dynamically dominant transition pathways by kinetically defining transition costs. The applicability of this approach is first confirmed by an illustrative example of a low-dimensional random potential. We then show that a coarse-graining procedure tailored for saddle connectivity graphs can be used to obtain the kinetic properties of 13- and 38-atom Lennard-Jones clusters. The coarse-graining method not only reduces the complexity of the graphs, but also, with iterative use, reveals a self-similar hierarchical structure in these clusters. We also propose that the self-similarity is common to many-atom Lennard-Jones clusters.

A graph-based network-vulnerability analysis system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-05-03

This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example themore » class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.« less

A graph-based network-vulnerability analysis system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-01-01

This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the classmore » of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

Examining the interaction between food outlets and outdoor food advertisements with primary school food environments.

PubMed

Walton, Mat; Pearce, Jamie; Day, Peter

2009-09-01

Schools are commonly seen as a site of intervention to improve children's nutrition, and prevent excess weight gain. Schools may have limited influence over children's diets; however, with home and community environments also exerting an influence within schools. This study considered the environment of food outlets and outdoor food advertisements surrounding four case study primary schools in New Zealand, and the impact of that external environment on within-school food environments. The shortest travel route between school and home addresses, and the number of food outlets and advertisements passed on that route, was calculated for each student. Interviews with school management were conducted. The schools with a higher percentage of students passing food outlets and advertisements considered that their presence impacted on efforts within schools to improve the food environment. Limiting students' exposure to food outlets and outdoor food adverts through travel route planning, reducing advertising, or limiting the location of food outlets surrounding schools could be explored as intervention options to support schools in promoting nutrition.

Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data

DOE PAGES

Zhu, Lei; Holden, Jacob R.; Gonder, Jeffrey D.

2017-01-01

With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similaritymore » score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hellier, Coel; Anderson, D. R.; Smalley, B.

WASP-19b has the shortest orbital period of any known exoplanet, orbiting at only 1.2 times the Roche tidal radius. By observing the Rossiter-McLaughlin effect we show that WASP-19b's orbit is aligned, with {lambda} = 4.{sup 0}6 {+-} 5.{sup 0}2. Using, in addition, a spectroscopic vsin I and the observed rotation period we conclude that the obliquity, {psi}, is less than 20{sup 0}. Further, the eccentricity of the orbit is less than 0.02. We argue that hot Jupiters with orbital periods as short as that of WASP-19b are two orders of magnitude less common than hot Jupiters at the 3-4 daymore » 'pileup'. We discuss the evolution of WASP-19b's orbit and argue that most likely it was first moved to near twice the Roche limit by third-body interactions, and has since spiralled inward to its current location under tidal decay. This is compatible with a stellar tidal-dissipation quality factor, Q'{sub *}, of order 10{sup 7}.« less

Troubleshooting of signal power supply system for Shanghai metro line 7

NASA Astrophysics Data System (ADS)

Lu, Kaixia; Xiao, Jie

2018-03-01

With the rapid development of Urban Rail Transit Signal Technology, the demand of signal power supply system for signal equipment is higher and higher. The signal intelligent power supply panel is the main component of the urban rail traffic signal power supply system. Whether the intelligent power supply panel working or not is directly related to traffic safety. The maintenance of intelligent signal power supply panel is particularly important. Line 7 of Shanghai Metro adopts PMZG Signal Intelligent Power Supply Panel, which is produced by Beijing Jinyujiaxin Polytron Technologies Inc. Maintenance of power supply system mainly includes routine maintenance and troubleshooting. This article will make clear the routine maintenance contents of PMZG Signal Intelligent Power Supply Panel, and put forward the common fault information and troubleshooting methods of PMZG Signal Intelligent Power Supply Panel. In accordance with the steps of fault handling, the faults can be eliminated in the shortest possible time, and PMZG Signal Intelligent Power Supply Panel can be quickly restored to normal working state.

An evaluation of eye tracking technology in the assessment of 12 lead electrocardiography interpretation.

PubMed

Breen, Cathal J; Bond, Raymond; Finlay, Dewar

2014-01-01

This study investigated eye tracking technology for 12 lead electrocardiography interpretation to Healthcare Scientist students. Participants (n=33) interpreted ten 12 lead ECG recordings and randomized to receive objective individual appraisal on their efforts either by traditional didactic format or by eye tracker software. One hundred percent of participants reported the experience positively at improving their ECG interpretation competency. ECG analysis time ranged between 13.2 and 59.5s. The rhythm strip was the most common lead studied and fixated on for the longest duration (mean 9.9s). Lead I was studied for the shortest duration (mean 0.25s). Feedback using eye tracking data during ECG interpretation did not produce any significant variation between the assessment marks of the study and the control groups (p=0.32). Although the hypothesis of this study was rejected active teaching and early feedback practices are recommended within this discipline. Copyright © 2014 Elsevier Inc. All rights reserved.

Comparison of tribromoethanol, ketamine/acetylpromazine, Telazol/xylazine, pentobarbital, and methoxyflurane anesthesia in HSD:ICR mice.

PubMed

Gardner, D J; Davis, J A; Weina, P J; Theune, B

1995-04-01

Variation in the duration of surgical anesthesia in mice prompted an evaluation of various commonly used anesthetics. Using biotelemetric technology, we evaluated the effects of six anesthetic regimens (tribromoethanol, ketamine and acetylpromazine in combination, Telazol and xylazine in two combinations, pentobarbital, and methoxyflurane) on temperature and activity. Six groups of four male HSD:ICR mice received one of the anesthetic regimens or an equivalent volume of saline. Induction time (time from anesthetic administration until righting reflex loss) and duration of anesthesia (loss of response to interdigital toe pinch) were evaluated. Methoxyflurane and both doses of Telazol combinations resulted in the shortest and most repeatable induction times. None of the mice in the ketamine/acetylpromazine- and pentobarbital-treated groups lost the interdigital toe pinch reflex. Duration of anesthesia was superior in the two Telazol/xylazine-treated groups. A direct correlation existed between duration of anesthesia and magnitude and duration of temperature reduction. Duration of anesthesia can be used to predict extent of hypothermia.

Very rapid long-distance sea crossing by a migratory bird

PubMed Central

Alves, José A.; Dias, Maria P.; Méndez, Verónica; Katrínardóttir, Borgný; Gunnarsson, Tómas G.

2016-01-01

Landbirds undertaking within-continent migrations have the possibility to stop en route, but most long-distance migrants must also undertake large non-stop sea crossings, the length of which can vary greatly. For shorebirds migrating from Iceland to West Africa, the shortest route would involve one of the longest continuous sea crossings while alternative, mostly overland, routes are available. Using geolocators to track the migration of Icelandic whimbrels (Numenius phaeopus), we show that they can complete a round-trip of 11,000 km making two non-stop sea crossings and flying at speeds of up to 24 m s−1; the fastest recorded for shorebirds flying over the ocean. Although wind support could reduce flight energetic costs, whimbrels faced headwinds up to twice their ground speed, indicating that unfavourable and potentially fatal weather conditions are not uncommon. Such apparently high risk migrations might be more common than previously thought, with potential fitness gains outweighing the costs. PMID:27901077

Interosseous nerve transfers for tibialis anterior muscle paralysis (foot drop): a human cadaver-based feasibility study.

PubMed

Pirela-Cruz, Miguel A; Hansen, Uel; Terreros, Daniel A; Rossum, Alfred; West, Priscilla

2009-03-01

This study explored the anatomical feasibility of using an interosseous nerve transfer (routed between the tibia and fibula) to restore motor function to the tibialis anterior (TA) muscle, following injury to the common peroneal nerve (resulting in a foot drop). The specific nerve branches evaluated as possible donor nerves included the nerves to the medial gastrocnemius, the lateral gastrocnemius, and the soleus muscles. All nerve transfers were accomplished using a direct interosseous route and a direct repair (one medial gastrocnemius transfer did require interpositional grafting). The distance from the repair site to the TA muscle was shortest for the transfer using the nerve branch to the soleus. Histologically, the nerve branch to the soleus was most similar to the branch to the TA for both axonal count and cross-sectional area. A two-incision surgical approach using a fibular window (mobilizing a fibular segment after double osteotomy) and interosseous routing of the transfer is proposed.

A graphic method for identification of novel glioma related genes.

PubMed

Gao, Yu-Fei; Shu, Yang; Yang, Lei; He, Yi-Chun; Li, Li-Peng; Huang, GuaHua; Li, Hai-Peng; Jiang, Yang

2014-01-01

Glioma, as the most common and lethal intracranial tumor, is a serious disease that causes many deaths every year. Good comprehension of the mechanism underlying this disease is very helpful to design effective treatments. However, up to now, the knowledge of this disease is still limited. It is an important step to understand the mechanism underlying this disease by uncovering its related genes. In this study, a graphic method was proposed to identify novel glioma related genes based on known glioma related genes. A weighted graph was constructed according to the protein-protein interaction information retrieved from STRING and the well-known shortest path algorithm was employed to discover novel genes. The following analysis suggests that some of them are related to the biological process of glioma, proving that our method was effective in identifying novel glioma related genes. We hope that the proposed method would be applied to study other diseases and provide useful information to medical workers, thereby designing effective treatments of different diseases.

Acute medical complications in patients admitted to a stroke unit and safe transfer to rehabilitation.

PubMed

Bonaiuti, Donatella; Sioli, Paolo; Fumagalli, Lorenzo; Beghi, Ettore; Agostoni, Elio

2011-08-01

Acute medical complications often prevent patients with stroke from being transferred from stroke units to rehabilitation units, prolonging the occupation of hospital beds and delaying the start of intensive rehabilitation. This study defined incidence, timing, duration and risk factors of these complications during the acute phase of stroke. A retrospective case note review was made of hospital admissions of patients with stroke not associated with other disabling conditions, admitted to a stroke unit over 12 months and requiring rehabilitation for gait impairment. In this cohort, a search was made of hypertension, oxygen de-saturation, fever, and cardiac and pulmonary symptoms requiring medical intervention. Included were 135 patients. Hypertension was the most common complication (16.3%), followed by heart disease (14.8%), oxygen de-saturation (7.4%), fever (6.7%) and pulmonary disease (5.2%). Heart disease was the earliest and shortest complication. Most complications occurred during the first week. Except for hypertension, all complications resolved within 2 weeks.

Donation return time at fixed and mobile donation sites

PubMed Central

Carey, Patricia M.; High, Patrick M.; Schlumpf, Karen S.; Johnson, Bryce R.; Mast, Alan E.; Rios, Jorge A.; Simon, Toby L.; Wilkinson, Susan L.

2013-01-01

BACKGROUND This study investigated the effect of blood donation environment, fixed or mobile with differing sponsor types, on donation return time. STUDY DESIGN AND METHODS Data from 2006 through 2009 at six US blood centers participating in the Retrovirus Epidemiology Donor Study-II (REDS-II) were used for analysis. Descriptive statistics stratified by whole blood (WB), plateletpheresis (PP), and double red blood cell (R2) donations were obtained for fixed and mobile locations, including median number of donations and median interdonation interval. A survival analysis estimated median return time at fixed and mobile sites, while controlling for censored return times, demographics, blood center, and mandatory recovery times. RESULTS Two-thirds (67.9%) of WB donations were made at mobile sites, 97.4% of PP donations were made at fixed sites, and R2 donations were equally distributed between fixed and mobile locations. For donations at fixed sites only or alternating between fixed and mobile sites, the highest median numbers of donations were nine and eight, respectively, and the shortest model-adjusted median return times (controlling for mandatory eligibility times of 56 and 112 days) were 36 and 30 days for WB and R2 donations, respectively. For PP donations, the shortest model-adjusted median return time was 23 days at a fixed location and the longest was 693 days at community locations. CONCLUSION WB, PP, and R2 donors with the shortest time between donations were associated with fixed locations and those alternating between fixed and mobile locations, even after controlling for differing mandatory recovery times for the different blood donation procedures. PMID:21745215

Modelling information flow along the human connectome using maximum flow.

PubMed

Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

2018-01-01

The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

a Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

NASA Astrophysics Data System (ADS)

Heidari, A. A.; Delavar, M. R.

2016-06-01

In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP) due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA) to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP) with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA) strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

Variable detours in long-distance migration across ecological barriers and their relation to habitat availability at ground

PubMed Central

Hahn, Steffen; Emmenegger, Tamara; Lisovski, Simeon; Amrhein, Valentin; Zehtindjiev, Pavel; Liechti, Felix

2014-01-01

Migration detours, the spatial deviation from the shortest route, are a widespread phenomenon in migratory species, especially if barriers must be crossed. Moving longer distances causes additional efforts in energy and time, and to be adaptive, this should be counterbalanced by favorable condition en route. We compared migration patterns of nightingales that travelled along different flyways from their European breeding sites to the African nonbreeding sites. We tested for deviations from shortest routes and related the observed and expected routes to the habitat availability at ground during autumn and spring migration. All individuals flew detours of varying extent. Detours were largest and seasonally consistent in western flyway birds, whereas birds on the central and eastern flyways showed less detours during autumn migration, but large detours during spring migration (eastern flyway birds). Neither migration durations nor the time of arrival at destination were related to the lengths of detours. Arrival at the breeding site was nearly synchronous in birds flying different detours. Flying detours increased the potential availability of suitable broad-scale habitats en route only along the western flyway. Habitat availability on observed routes remained similar or even decreased for individuals flying detours on the central or the eastern flyway as compared to shortest routes. Thus, broad-scale habitat distribution may partially explain detour performance, but the weak detour-habitat association along central and eastern flyways suggests that other factors shape detour extent regionally. Prime candidate factors are the distribution of small suitable habitat patches at local scale as well as winds specific for the region and altitude. PMID:25505540

The effect of non-sphericity on mass and anisotropy measurements in dSph galaxies with Schwarzschild method

NASA Astrophysics Data System (ADS)

Kowalczyk, Klaudia; Łokas, Ewa L.; Valluri, Monica

2018-05-01

In our previous work we confirmed the reliability of the spherically symmetric Schwarzschild orbit-superposition method to recover the mass and velocity anisotropy profiles of spherical dwarf galaxies. Here, we investigate the effect of its application to intrinsically non-spherical objects. For this purpose we use a model of a dwarf spheroidal galaxy formed in a numerical simulation of a major merger of two discy dwarfs. The shape of the stellar component of the merger remnant is axisymmetric and prolate which allows us to identify and measure the bias caused by observing the spheroidal galaxy along different directions, especially the longest and shortest principal axis. The modelling is based on mock data generated from the remnant that are observationally available for dwarfs: projected positions and line-of-sight velocities of the stars. In order to obtain a reliable tool while keeping the number of parameters low we parametrize the total mass distribution as a radius-dependent mass-to-light ratio with just two free parameters we aim to constrain. Our study shows that if the total density profile is known, the true, radially increasing anisotropy profile can be well recovered for the observations along the longest axis whereas the data along the shortest axis lead to the inference of an incorrect, isotropic model. On the other hand, if the density profile is derived from the method as well, the anisotropy is always underestimated but the total mass profile is well recovered for the data along the shortest axis whereas for the longest axis the mass content is overestimated.

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

NASA Astrophysics Data System (ADS)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Workflow and maintenance characteristics of five automated laboratory instruments for the diagnosis of sexually transmitted infections.

PubMed

Ratnam, Sam; Jang, Dan; Gilchrist, Jodi; Smieja, Marek; Poirier, Andre; Hatchette, Todd; Flandin, Jean-Frederic; Chernesky, Max

2014-07-01

The choice of a suitable automated system for a diagnostic laboratory depends on various factors. Comparative workflow studies provide quantifiable and objective metrics to determine hands-on time during specimen handling and processing, reagent preparation, return visits and maintenance, and test turnaround time and throughput. Using objective time study techniques, workflow characteristics for processing 96 and 192 tests were determined on m2000 RealTime (Abbott Molecular), Viper XTR (Becton Dickinson), cobas 4800 (Roche Molecular Diagnostics), Tigris (Hologic Gen-Probe), and Panther (Hologic Gen-Probe) platforms using second-generation assays for Chlamydia trachomatis and Neisseria gonorrhoeae. A combination of operational and maintenance steps requiring manual labor showed that Panther had the shortest overall hands-on times and Viper XTR the longest. Both Panther and Tigris showed greater efficiency whether 96 or 192 tests were processed. Viper XTR and Panther had the shortest times to results and m2000 RealTime the longest. Sample preparation and loading time was the shortest for Panther and longest for cobas 4800. Mandatory return visits were required only for m2000 RealTime and cobas 4800 when 96 tests were processed, and both required substantially more hands-on time than the other systems due to increased numbers of return visits when 192 tests were processed. These results show that there are substantial differences in the amount of labor required to operate each system. Assay performance, instrumentation, testing capacity, workflow, maintenance, and reagent costs should be considered in choosing a system. Copyright © 2014, American Society for Microbiology. All Rights Reserved.

Groupwise Image Registration Guided by a Dynamic Digraph of Images.

PubMed

Tang, Zhenyu; Fan, Yong

2016-04-01

For groupwise image registration, graph theoretic methods have been adopted for discovering the manifold of images to be registered so that accurate registration of images to a group center image can be achieved by aligning similar images that are linked by the shortest graph paths. However, the image similarity measures adopted to build a graph of images in the extant methods are essentially pairwise measures, not effective for capturing the groupwise similarity among multiple images. To overcome this problem, we present a groupwise image similarity measure that is built on sparse coding for characterizing image similarity among all input images and build a directed graph (digraph) of images so that similar images are connected by the shortest paths of the digraph. Following the shortest paths determined according to the digraph, images are registered to a group center image in an iterative manner by decomposing a large anatomical deformation field required to register an image to the group center image into a series of small ones between similar images. During the iterative image registration, the digraph of images evolves dynamically at each iteration step to pursue an accurate estimation of the image manifold. Moreover, an adaptive dictionary strategy is adopted in the groupwise image similarity measure to ensure fast convergence of the iterative registration procedure. The proposed method has been validated based on both simulated and real brain images, and experiment results have demonstrated that our method was more effective for learning the manifold of input images and achieved higher registration accuracy than state-of-the-art groupwise image registration methods.

Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

NASA Astrophysics Data System (ADS)

Kröger, Martin

2005-06-01

We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the program has been tested: UNIX, Linux Program language used: USANSI Fortran 77 and Fortran 90 Memory required to execute with typical data: 1 MByte No. of lines in distributed program, including test data, etc.: 10 660 No. of bytes in distributed program, including test data, etc.: 119 551 Distribution formet:tar.gz Nature of physical problem: The problem is to obtain primitive paths substantiating a shortest multiple disconnected path (SP) for a given polymer configuration (chains of particles, with or without additional single particles as obstacles for the 2D case). Primitive paths are here defined as in [M. Rubinstein, E. Helfand, J. Chem. Phys. 82 (1985) 2477; R. Everaers, S.K. Sukumaran, G.S. Grest, C. Svaneborg, A. Sivasubramanian, K. Kremer, Science 303 (2004) 823] as the shortest line (path) respecting 'topological' constraints (from neighboring polymers or point obstacles) between ends of polymers. There is a unique solution for the 2D case. For the 3D case it is unique if we construct a primitive path of a single chain embedded within fixed line obstacles [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701]. For a large 3D configuration made of several chains, short is meant to be the Euclidean shortest multiple disconnected path (SP) where primitive paths are constructed for all chains simultaneously. While the latter problem, in general, does not possess a unique solution, the algorithm must return a locally optimal solution, robust against minor displacements of the disconnected path and chain re-labeling. The problem is solved if the number of kinks (or entanglements Z), explicitly deduced from the SP, is quite insensitive to the exact conformation of the SP which allows to estimate Z with a small error. Efficient method of solution: Primitive paths are constructed from the given polymer configuration (a non-shortest multiple disconnected path, including obstacles, if present) by first replacing each polymer contour by a line with a number of 'kinks' (beads, nodes) and 'segments' (edges). To obtain primitive paths, defined to be uncrossable by any other objects (neighboring primitive paths, line or point obstacles), the algorithm minimizes the length of all primitive paths consecutively, until a final minimum Euclidean length of the SP is reached. Fast geometric operations rather than dynamical methods are used to minimize the contour lengths of the primitive paths. Neighbor lists are used to keep track of potentially intersecting segments of other chains. Periodic boundary conditions are employed. A finite small line thickness is used in order to make sure that entanglements are not 'lost' due to finite precision of representation of numbers. Restrictions on the complexity of the problem: For a single chain embedded within fixed line or point obstacles, the algorithm returns the exact SP. For more complex problems, the algorithm returns a locally optimal SP. Except for exotic, probably rare, configurations it turns out that different locally optimal SPs possess quite an identical number of nodes. In general, the problem constructing the SP is known to be NP-hard [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701], and we offer a solution which should suffice to analyze physical problems, and gives an estimate about the precision and uniqueness of the result (from a standard deviation by varying the parameter: cyclicswitch). The program is NOT restricted to handle systems for which segment lengths of the SP exceed half the box size. Typical running time: Typical running times are approximately two orders of magnitude shorter compared with the ones needed for a corresponding molecular dynamics approach, and scale mostly linearly with system size. We provide a benchmark table.

On the existence of binary simplex codes. [using combinatorial construction

NASA Technical Reports Server (NTRS)

Taylor, H.

1977-01-01

Using a simple combinatorial construction, the existence of a binary simplex code with m codewords for all m is greater than or equal to 1 is proved. The problem of the shortest possible length is left open.

76 FR 55859 - Federal Motor Vehicle Safety Standards No. 121; Air Brake Systems

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-09

...- trailer on dry pavement, a highly skilled test driver may be able to achieve the shortest possible... maintained in proper working order, it would not provide the improved steering control as designed. That is...

Variation in Patients' Travel Times among Imaging Examination Types at a Large Academic Health System.

PubMed

Rosenkrantz, Andrew B; Liang, Yu; Duszak, Richard; Recht, Michael P

2017-08-01

Patients' willingness to travel farther distances for certain imaging services may reflect their perceptions of the degree of differentiation of such services. We compare patients' travel times for a range of imaging examinations performed across a large academic health system. We searched the NYU Langone Medical Center Enterprise Data Warehouse to identify 442,990 adult outpatient imaging examinations performed over a recent 3.5-year period. Geocoding software was used to estimate typical driving times from patients' residences to imaging facilities. Variation in travel times was assessed among examination types. The mean expected travel time was 29.2 ± 20.6 minutes, but this varied significantly (p < 0.001) among examination types. By modality, travel times were shortest for ultrasound (26.8 ± 18.9) and longest for positron emission tomography-computed tomography (31.9 ± 21.5). For magnetic resonance imaging, travel times were shortest for musculoskeletal extremity (26.4 ± 19.2) and spine (28.6 ± 21.0) examinations and longest for prostate (35.9 ± 25.6) and breast (32.4 ± 22.3) examinations. For computed tomography, travel times were shortest for a range of screening examinations [colonography (25.5 ± 20.8), coronary artery calcium scoring (26.1 ± 19.2), and lung cancer screening (26.4 ± 14.9)] and longest for angiography (32.0 ± 22.6). For ultrasound, travel times were shortest for aortic aneurysm screening (22.3 ± 18.4) and longest for breast (30.1 ± 19.2) examinations. Overall, men (29.9 ± 21.6) had longer (p < 0.001) travel times than women (27.8 ± 20.3); this difference persisted for each modality individually (p ≤ 0.006). Patients' willingness to travel longer times for certain imaging examination types (particularly breast and prostate imaging) supports the role of specialized services in combating potential commoditization of imaging services. Disparities in travel times by gender warrant further investigation. Copyright © 2017 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.

Grading vascularity from histopathological images based on traveling salesman distance and vessel size

NASA Astrophysics Data System (ADS)

Niazi, M. Khalid Khan; Hemminger, Jessica; Kurt, Habibe; Lozanski, Gerard; Gurcan, Metin

2014-03-01

Vascularity represents an important element of tissue/tumor microenvironment and is implicated in tumor growth, metastatic potential and resistence to therapy. Small blood vessels can be visualized using immunohistochemical stains specific to vascular cells. However, currently used manual methods to assess vascular density are poorly reproducible and are at best semi quantitative. Computer based quantitative and objective methods to measure microvessel density are urgently needed to better understand and clinically utilize microvascular density information. We propose a new method to quantify vascularity from images of bone marrow biopsies stained for CD34 vascular lining cells protein as a model. The method starts by automatically segmenting the blood vessels by methods of maxlink thresholding and minimum graph cuts. The segmentation is followed by morphological post-processing to reduce blast and small spurious objects from the bone marrow images. To classify the images into one of the four grades, we extracted 20 features from the segmented blood vessel images. These features include first four moments of the distribution of the area of blood vessels, first four moments of the distribution of 1) the edge weights in the minimum spanning tree of the blood vessels, 2) the shortest distance between blood vessels, 3) the homogeneity of the shortest distance (absolute difference in distance between consecutive blood vessels along the shortest path) between blood vessels and 5) blood vessel orientation. The method was tested on 26 bone marrow biopsy images stained with CD34 IHC stain, which were evaluated by three pathologists. The pathologists took part in this study by quantifying blood vessel density using gestalt assessment in hematopoietic bone marrow portions of bone marrow core biopsies images. To determine the intra-reader variability, each image was graded twice by each pathologist with two-week interval in between their readings. For each image, the ground truth (grade) was acquired through consensus among the three pathologists at the end of the study. A ranking of the features reveals that the fourth moment of the distribution of the area of blood vessels along with the first moment of the distribution of the shortest distance between blood vessels can correctly grade 68.2% of the bone marrow biopsies, while the intra- and inter-reader variability among the pathologists are 66.9% and 40.0%, respectively.

The ADVANCE project : formal evaluation of the targeted deployment. Volume 1

DOT National Transportation Integrated Search

1997-01-01

The Advanced Driver and Vehicle Advisory Navigation ConcEpt (ADVANCE) was an in-vehicle advanced traveler information system (ATIS) that operated in the northwest suburbs of Chicago, Illinois. It was designed to provide origin-destination shortest-ti...

40 CFR 415.381 - Specialized definitions.

Code of Federal Regulations, 2010 CFR

2010-07-01

... process wastewater means any water which, during manufacturing or processing, comes into direct contact... wastewater. (d) The term contaminated nonprocess wastewater shall mean any water which, during manufacturing...) accidental leaks caused by the failure of process equipment, which are repaired within the shortest...

77 FR 26785 - Implementation of Indian Reservation Roads Program and Streamlining the Federal Delivery of...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-07

... does not currently exist and needs to be constructed.'' A primary access route is the shortest feasible... Introductions 9:15 a.m.-10:45 a.m. Proposed/Access Roads (Recommendation, Expectations, Implementation) 10:45 a...

48 CFR 209.570-3 - Procedures.

Code of Federal Regulations, 2014 CFR

2014-10-01

... out the use of contracted lead system integrator functions over the shortest period of time consistent... 48 Federal Acquisition Regulations System 3 2014-10-01 2014-10-01 false Procedures. 209.570-3 Section 209.570-3 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 209.570-3 - Procedures.

Code of Federal Regulations, 2013 CFR

2013-10-01

... out the use of contracted lead system integrator functions over the shortest period of time consistent... 48 Federal Acquisition Regulations System 3 2013-10-01 2013-10-01 false Procedures. 209.570-3 Section 209.570-3 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 209.570-3 - Procedures.

Code of Federal Regulations, 2012 CFR

2012-10-01

... out the use of contracted lead system integrator functions over the shortest period of time consistent... 48 Federal Acquisition Regulations System 3 2012-10-01 2012-10-01 false Procedures. 209.570-3 Section 209.570-3 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 209.570-3 - Procedures.

Code of Federal Regulations, 2011 CFR

2011-10-01

... out the use of contracted lead system integrator functions over the shortest period of time consistent... 48 Federal Acquisition Regulations System 3 2011-10-01 2011-10-01 false Procedures. 209.570-3 Section 209.570-3 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

Speckle interferometry applied to asteroids and other solar system objects

NASA Technical Reports Server (NTRS)

Drummond, J. D.; Hege, E. K.

1985-01-01

The application of speckle interferometry to asteroids and other solar system objects is discussed. The assumption of a triaxial ellipsoid rotating about its shortest axis is the standard model. Binary asteroids, 433 Eros, 532 Herculina, 511 Davida, and Pallas are discussed.

40 CFR 415.411 - Specialized definitions.

Code of Federal Regulations, 2010 CFR

2010-07-01

... wastewater means any water which, during manufacturing or processing, comes into direct contact with or... wastewater. (d) The term contaminated nonprocess wastewater shall mean any water which, during manufacturing...) accidental leaks caused by the failure of process equipment, which are repaired within the shortest...

40 CFR 415.401 - Specialized definitions.

Code of Federal Regulations, 2010 CFR

2010-07-01

... wastewater means any water which, during manufacturing or processing, comes into direct contact with or... wastewater. (d) The term contaminated nonprocess wastewater shall mean any water which, during manufacturing... leaks caused by the failure of process equipment, which are repaired within the shortest reasonable time...

50 CFR 660.402 - Definitions.

Code of Federal Regulations, 2010 CFR

2010-10-01

..., DEPARTMENT OF COMMERCE (CONTINUED) FISHERIES OFF WEST COAST STATES West Coast Salmon Fisheries § 660.402... the Pacific Fishery Management Council. Dressed, head-off length of salmon means the shortest distance...). Dressed, head-off salmon means salmon that have been beheaded, gilled, and gutted without further...

50 CFR 660.402 - Definitions.

Code of Federal Regulations, 2011 CFR

2011-10-01

..., DEPARTMENT OF COMMERCE (CONTINUED) FISHERIES OFF WEST COAST STATES West Coast Salmon Fisheries § 660.402... the Pacific Fishery Management Council. Dressed, head-off length of salmon means the shortest distance...). Dressed, head-off salmon means salmon that have been beheaded, gilled, and gutted without further...

Actin filaments, stereocilia, and hair cells of the bird cochlea. V. How the staircase pattern of stereociliary lengths is generated.

PubMed

Tilney, L G; Tilney, M S; Cotanche, D A

1988-02-01

The stereocilia on each hair cell are arranged into rows of ascending height, resulting in what we refer to as a "staircase-like" profile. At the proximal end of the cochlea the length of the tallest row of stereocilia in the staircase is 1.5 micron, with the shortest row only 0.3 micron. As one proceeds towards the distal end of the cochlea the length of the stereocilia progressively increases so that at the extreme distal end the length of the tallest row of the staircase is 5.5 micron and the shortest row is 2 micron. During development hair cells form their staircases in four phases of growth separated from each other by developmental time. First, stereocilia sprout from the apical surfaces of the hair cells (8-10-d embryos). Second (10-12-d embryos), what will be the longest row of the staircase begins to elongate. As the embryo gets older successive rows of stereocilia initiate elongation. Thus the staircase is set up by the sequential initiation of elongation of stereociliary rows located at increased distances from the row that began elongation. Third (12-17-d embryos), all the stereocilia in the newly formed staircase elongate until those located on the first step of the staircase have reached the prescribed length. In the final phase (17-d embryos to hatchlings) there is a progressive cessation of elongation beginning with the shortest step and followed by taller and taller rows with the tallest step stopping last. Thus, to obtain a pattern of stereocilia in rows of increasing height what transpires are progressive go signals followed by a period when all the stereocilia grow and ending with progressive stop signals. We discuss how such a sequence could be controlled.

Morphometric analysis of diameter and relationship of vertebral artery with respect to transverse foramen in Indian population

PubMed Central

Sureka, Binit; Mittal, Mahesh Kumar; Mittal, Aliza; Agarwal, Mukul Sinha Kanhaiya; Bhambri, Narendra Kumar; Thukral, Brij Bhushan

2015-01-01

Purpose: To study the location, origin, size and relationship of the vertebral artery and the transverse foramina in the lower cervical spine by computed tomographic angiography (CTA) measurements in the Indian population. Materials and Methods: A retrospective review of multi-detector CT (MDCT) cerebral angiography scans was done between June 2011 and February 2014. A total of 120 patients were evaluated. The diameter of the vertebral artery (AL) and the shortest distance between the vertebral artery and the medial (M), lateral (L), anterior (A), and posterior (P) borders of transverse foramen were studied. In addition, the shortest distance between the vertebral artery and pedicle (h) was also analyzed. Statistical Analysis: The means and their standard deviations (SD) were calculated in both the sexes. The t-tests were performed to look for significant sexual difference. Results: The largest vertebral artery diameter (AL) was at level C7 on the right side (3.5 ± 0.8) and at the level of C5 on the left side (3.7 ± 0.4). Statistically significant difference between males and females were seen at levels C4, C5, and C7. The diameter of the vertebral artery was smaller in females than males. The L value was greater than other parameters (M, A, P) at the same level in all the measurements. The h value was greatest at C6 level and shortest at C5. Conclusion: CTA is necessary before pedicle screw fixation due to variation in measurements at all levels. The highest potential risk of vertebral artery injury during cervical pedicle screw implantation may be at C5, then at C4, and the safest is at C7. PMID:25969640

Skilled Nursing Facility Partnerships May Decrease 90-Day Costs in a Total Joint Arthroplasty Episode Under the Bundled Payments for Care Improvement Initiative.

PubMed

Behery, Omar A; Kouk, Shalen; Chen, Kevin K; Mullaly, Kathleen A; Bosco, Joseph A; Slover, James D; Iorio, Richard; Schwarzkopf, Ran

2018-03-01

The Bundled Payments for Care Improvement initiative was developed to reduce costs associated with total joint arthroplasty through a single payment for all patient care from index admission through a 90-day post-discharge period, including care at skilled nursing facilities (SNFs). The aim of this study is to investigate whether forming partnerships between hospitals and SNFs could lower the post-discharge costs. We hypothesize that institutionally aligned SNFs have lower post-discharge costs than non-aligned SNFs. A cohort of 615 elective, primary total hip and knee arthroplasty subjects discharged to an SNF under the Bundled Payments for Care Improvement from 2014 to 2016 were included in our analysis. Patients were grouped into one of the 3 categories of SNF alignment: group 1: non-partners; group 2: agreement-based partners; group 3: institution-owned partners. Demographics, comorbidities, length of stay (LOS) at SNF, and associated costs during the 90-day post-operative period were compared between the 3 groups. Mean index hospital LOS was statistically shortest in group 3 (mean 2.7 days vs 3.5 for groups 1 and 2, P = .001). SNF LOS was also shortest in group 3 (mean 11 days vs 19 and 21 days in groups 2 and 1 respectively, P < .001). Total SNF costs and total 90-day costs were both significantly lower in group 3 compared with groups 1 and 2 (P < .001 for all), even after controlling for medical comorbidities. Institution-owned partner SNFs demonstrated the shortest patient LOS, and the lowest SNF and total 90-day costs, without increased risk of readmissions, compared with other SNFs. Copyright © 2017 Elsevier Inc. All rights reserved.

Predicting success on the certification examinations of the American Board of Anesthesiology.

PubMed

McClintock, Joseph C; Gravlee, Glenn P

2010-01-01

Currently, residency programs lack objective predictors for passing the sequenced American Board of Anesthesiology (ABA) certification examinations on the first attempt. Our hypothesis was that performance on the ABA/American Society of Anesthesiologists In-Training Examination (ITE) and other variables can predict combined success on the ABA Part 1 and Part 2 examinations. The authors studied 2,458 subjects who took the ITE immediately after completing the first year of clinical anesthesia training and took the ABA Part 1 examination for primary certification immediately after completing residency training 2 yr later. ITE scores and other variables were used to predict which residents would complete the certification process (passing the ABA Part 1 and Part 2 examinations) in the shortest possible time after graduation. ITE scores alone accounted for most of the explained variation in the desired outcome of certification in the shortest possible time. In addition, almost half of the observed variation and most of the explained variance in ABA Part 1 scores was accounted for by ITE scores. A combined model using ITE scores, residency program accreditation cycle length, country of medical school, and gender best predicted which residents would complete the certification examinations in the shortest possible time. The principal implication of this study is that higher ABA/ American Society of Anesthesiologists ITE scores taken at the end of the first clinical anesthesia year serve as a significant and moderately strong predictor of high performance on the ABA Part 1 (written) examination, and a significant predictor of success in completing both the Part 1 and Part 2 examinations within the calendar year after the year of graduation from residency. Future studies may identify other predictors, and it would be helpful to identify factors that predict clinical performance as well.

Evaluation of the impact of a total automation system in a large core laboratory on turnaround time.

PubMed

Lou, Amy H; Elnenaei, Manal O; Sadek, Irene; Thompson, Shauna; Crocker, Bryan D; Nassar, Bassam

2016-11-01

Growing financial and workload pressures on laboratories coupled with user demands for faster turnaround time (TAT) has steered the implementation of total laboratory automation (TLA). The current study evaluates the impact of a complex TLA on core laboratory efficiency through the analysis of the In-lab to Report TAT (IR-TAT) for five representative tests based on the different requested priorities. Mean, median and outlier percentages (OP) for IR-TAT were determined following TLA implementation and where possible, compared to the pre-TLA era. The shortest mean IR-TAT via the priority lanes of the TLA was 22min for Complete Blood Count (CBC), followed by 34min, 39min and 40min for Prothrombin time (PT), urea and potassium testing respectively. The mean IR-TAT for STAT CBC loaded directly on to the analyzers was 5min shorter than that processed via the TLA. The mean IR-TATs for both STAT potassium and urea via offline centrifugation were comparable to that processed by the TLA. The longest mean IR-TAT via regular lanes of the TLA was 62min for Thyroid-Stimulating Hormone (TSH) while the shortest was 17min for CBC. All parameters for IR-TAT for CBC and PT tests decreased significantly post- TLA across all requested priorities in particular the outlier percentage (OP) at 30 and 60min. TLA helps to efficiently manage substantial volumes of samples across all requested priorities. Manual processing for small STAT volumes, at both the initial centrifugation stage and front loading directly on to analyzers, is however likely to yield the shortest IR-TAT. Copyright © 2016 The Canadian Society of Clinical Chemists. Published by Elsevier Inc. All rights reserved.

Electrochemical immunosensors for Salmonella detection in food

USDA-ARS?s Scientific Manuscript database

Pathogen detection is a critical point for the identification and the prevention of problems related to food safety. Failures at detecting contaminations in food may cause outbreaks with drastic consequences to public health. In spite of the real need for obtaining analytical results in the shortest...

The Impact of Culture: Communicating with Iran

DTIC Science & Technology

2009-03-01

respect to their dealings.48 American business/negotiating philosophy is very simple; make as much money or profit as you can in the shortest amount of...Behavior, Conference Report (Tel Aviv: Institute for Policy and Strategy, Interdisciplinary Center Herzliya Lauder School of Government, Diplomacy and

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE PAGES

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin; ...

2017-07-10

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Passive remote sensing of aerosol layer height using near-UV multiangle polarization measurements

NASA Astrophysics Data System (ADS)

Wu, Lianghai; Hasekamp, Otto; van Diedenhoven, Bastiaan; Cairns, Brian; Yorks, John E.; Chowdhary, Jacek

2016-08-01

We demonstrate that multiangle polarization measurements in the near-UV and blue part of the spectrum are very well suited for passive remote sensing of aerosol layer height. For this purpose we use simulated measurements with different setups (different wavelength ranges, with and without polarization, different polarimetric accuracies) as well as airborne measurements from the Research Scanning Polarimeter (RSP) obtained over the continental USA. We find good agreement of the retrieved aerosol layer height from RSP with measurements from the Cloud Physics Lidar showing a mean absolute difference of less than 1 km. Furthermore, we found that the information on aerosol layer height is provided for large part by the multiangle polarization measurements with high accuracy rather than the multiangle intensity measurements. The information on aerosol layer height is significantly decreased when the shortest RSP wavelength (410 nm) is excluded from the retrieval and is virtually absent when 550 nm is used as shortest wavelength.

Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode

PubMed Central

He, Shiwei; Song, Rui

2016-01-01

Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case. PMID:27528865

Methodology for Augmenting Existing Paths with Additional Parallel Transects

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilson, John E.

2013-09-30

Visual Sample Plan (VSP) is sample planning software that is used, among other purposes, to plan transect sampling paths to detect areas that were potentially used for munition training. This module was developed for application on a large site where existing roads and trails were to be used as primary sampling paths. Gap areas between these primary paths needed to found and covered with parallel transect paths. These gap areas represent areas on the site that are more than a specified distance from a primary path. These added parallel paths needed to optionally be connected together into a single path—themore » shortest path possible. The paths also needed to optionally be attached to existing primary paths, again with the shortest possible path. Finally, the process must be repeatable and predictable so that the same inputs (primary paths, specified distance, and path options) will result in the same set of new paths every time. This methodology was developed to meet those specifications.« less

Selective epidemic vaccination under the performant routing algorithms

NASA Astrophysics Data System (ADS)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Fast marching methods for the continuous traveling salesman problem.

PubMed

Andrews, June; Sethian, J A

2007-01-23

We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ("cities") in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the traveling salesman problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both a heuristic and an optimal solution to this problem. The complexity of the heuristic algorithm is at worst case M.N log N, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh.

Late acquisition of mitochondria by a host with chimaeric prokaryotic ancestry.

PubMed

Pittis, Alexandros A; Gabaldón, Toni

2016-03-03

The origin of eukaryotes stands as a major conundrum in biology. Current evidence indicates that the last eukaryotic common ancestor already possessed many eukaryotic hallmarks, including a complex subcellular organization. In addition, the lack of evolutionary intermediates challenges the elucidation of the relative order of emergence of eukaryotic traits. Mitochondria are ubiquitous organelles derived from an alphaproteobacterial endosymbiont. Different hypotheses disagree on whether mitochondria were acquired early or late during eukaryogenesis. Similarly, the nature and complexity of the receiving host are debated, with models ranging from a simple prokaryotic host to an already complex proto-eukaryote. Most competing scenarios can be roughly grouped into either mito-early, which consider the driving force of eukaryogenesis to be mitochondrial endosymbiosis into a simple host, or mito-late, which postulate that a significant complexity predated mitochondrial endosymbiosis. Here we provide evidence for late mitochondrial endosymbiosis. We use phylogenomics to directly test whether proto-mitochondrial proteins were acquired earlier or later than other proteins of the last eukaryotic common ancestor. We find that last eukaryotic common ancestor protein families of alphaproteobacterial ancestry and of mitochondrial localization show the shortest phylogenetic distances to their closest prokaryotic relatives, compared with proteins of different prokaryotic origin or cellular localization. Altogether, our results shed new light on a long-standing question and provide compelling support for the late acquisition of mitochondria into a host that already had a proteome of chimaeric phylogenetic origin. We argue that mitochondrial endosymbiosis was one of the ultimate steps in eukaryogenesis and that it provided the definitive selective advantage to mitochondria-bearing eukaryotes over less complex forms.

Electrogram Morphology Recurrence Patterns during Atrial Fibrillation

PubMed Central

Ng, Jason; Gordon, David; Passman, Rod S.; Knight, Bradley P.; Arora, Rishi; Goldberger, Jeffrey J.

2014-01-01

Background Traditional mapping of atrial fibrillation (AF) is limited by changing electrogram morphologies and variable cycle lengths. Objective We tested the hypothesis that morphology recurrence plot analysis would identify sites of stable and repeatable electrogram morphology patterns. Methods AF electrograms recorded from left atrial (LA) and right atrial (RA) sites in 19 patients (10 male, 59±10 years old) prior to AF ablation were analyzed. Morphology recurrence plots for each electrogram recording were created by cross-correlation of each automatically detected activation with every other activation in the recording. A recurrence percentage, the percentage of the most common morphology, and the mean cycle length of activations with the most common morphology (CLR) were computed. Results The morphology recurrence plots commonly showed checkerboard patterns of alternating high and low cross correlation values indicating periodic recurrences in morphologies. The mean recurrence percentage for all sites and all patients was 38±25%. The highest recurrence percentage per patient averaged 83±17%. The highest recurrence percentage was located in the RA in 5 patients and in the LA in 14 patients. Patients with sites of shortest CLR in the LA and RA had ablation failure rates of 25% and 100%, respectively (HR=4.95; p=0.05). Conclusions A new technique to characterize electrogram morphology recurrence demonstrated that there is a distribution of sites with high and low repeatability of electrogram morphologies. Sites with rapid activation of highly repetitive morphology patterns may be critical to sustaining AF. Further testing of this approach to map and ablate AF sources is warranted. PMID:25101485

The parasitoids of the asparagus miner (Diptera: Agromyzidae): field parasitism and the influence of food resources on life history.

PubMed

Morrison, William R; Gibson, Gary A P; Szendrei, Zsofia

2014-12-01

The goals of this study were to identify pupal parasitoids of the asparagus miner, Ophiomyia simplex Loew (Diptera: Agromyzidae), and examine the effect of different diets and floral resources on the lifespan of adult asparagus miners and their parasitoids. We also measured the effect of parasitism on stem damage caused by the asparagus miner. The identity and abundance of the parasitoids of the asparagus miner were determined in asparagus fields in Michigan from weekly asparagus miner pupal collections during the 2010-2013 seasons. Twelve species of hymenopterous parasitoids were reared from asparagus miner pupae, including Chorebus rondanii (Giard) (Ichneumonoidea: Braconidae), 10 species in three families of Chalcidoidea, and one species of Bethylidae (Chrysidoidea), that represent new host records for the asparagus miner. C. rondanii and Thinodytes cephalon (Walker) (Pteromalidae) were the most common parasitoids. The effects of different diets and flowers on the lifespan of the pest and parasitoid adults were also evaluated. Buckwheat resulted in the shortest life span for the asparagus miner, whereas Riddell's goldenrod significantly increased its lifespan relative to the control. Parasitoid lifespan was doubled when individuals were fed sugar-rich diets. In the field, parasitoids preferred stems that contained more pupae and damage. The two most commonly reared parasitoids should be considered as targets for future conservation biological control efforts of the asparagus miner.

NOVA Fall 1998 Teacher's Guide.

ERIC Educational Resources Information Center

Colombo, Luann

This teacher's guide is designed to accompany the PBS television program "NOVA." Six science activities correspond to: (1) "Lost at Sea: The Search for Longitude,, which researches and charts the shortest course to circumnavigate the globe; (2) "Chasing El Nino," which formulates a question and designs an experiment to…

The Worls’s Shortest Goal Setting Study.

DTIC Science & Technology

1981-05-01

Ivancevich , 1976). Laboratory studies of goal setting, in contrast, are much shorter, typically ranging from 10 or 20 minutes to 2 hours. Regardless...9 REFERENCES Ivancevich , J. M. Effects of goal setting on performance and job satisfaction. Journal of Applied Psychology. 1976, 61, 605-612. Latham

The Dark Side of the Moebius Strip.

ERIC Educational Resources Information Center

Schwarz, Gideon E.

1990-01-01

Discussed are various models proposed for the Moebius strip. Included are a discussion of a smooth flat model and two smooth flat algebraic models, some results concerning the shortest Moebius strip, the Moebius strip of least elastic energy, and some observations on real-world Moebius strips. (KR)

UNICOR: a species connectivity and corridor network simulator

Treesearch

E. L. Landguth; B. K. Hand; J. Glassy; S. A. Cushman; M. A. Sawaya

2012-01-01

We introduce UNIversal CORridor network simulator (UNICOR), a species connectivity and corridor identifi cation tool. UNICOR applies Dijkstra's shortest path algorithm to individual-based simulations. Outputs can be used to designate movement corridors, identify isolated populations, and prioritize conservation plans to promote species persistence. The key...

Time Management. Revised.

ERIC Educational Resources Information Center

Halverson, Don E.

This booklet presents concepts and applications of effective time management to help administrators learn to utilize their time most effectively, thereby accomplishing their most worthwhile objectives in the shortest amount of time. Although the booklet is designed to be self-administered, the greatest benefits should be derived in a group setting…

3 CFR 8691 - Proclamation 8691 of July 1, 2011. 40th Anniversary of the 26th Amendment

Code of Federal Regulations, 2012 CFR

2012-01-01

... of leaders over our history, from the women’s groups of the early 20th century to the civil rights... Amendment was ratified in the shortest time span of any Constitutional Amendment in American history. In the...

Predicting the continuum between corridors and barriers to animal movements using Step Selection Functions and Randomized Shortest Paths.

PubMed

Panzacchi, Manuela; Van Moorter, Bram; Strand, Olav; Saerens, Marco; Kivimäki, Ilkka; St Clair, Colleen C; Herfindal, Ivar; Boitani, Luigi

2016-01-01

The loss, fragmentation and degradation of habitat everywhere on Earth prompts increasing attention to identifying landscape features that support animal movement (corridors) or impedes it (barriers). Most algorithms used to predict corridors assume that animals move through preferred habitat either optimally (e.g. least cost path) or as random walkers (e.g. current models), but neither extreme is realistic. We propose that corridors and barriers are two sides of the same coin and that animals experience landscapes as spatiotemporally dynamic corridor-barrier continua connecting (separating) functional areas where individuals fulfil specific ecological processes. Based on this conceptual framework, we propose a novel methodological approach that uses high-resolution individual-based movement data to predict corridor-barrier continua with increased realism. Our approach consists of two innovations. First, we use step selection functions (SSF) to predict friction maps quantifying corridor-barrier continua for tactical steps between consecutive locations. Secondly, we introduce to movement ecology the randomized shortest path algorithm (RSP) which operates on friction maps to predict the corridor-barrier continuum for strategic movements between functional areas. By modulating the parameter Ѳ, which controls the trade-off between exploration and optimal exploitation of the environment, RSP bridges the gap between algorithms assuming optimal movements (when Ѳ approaches infinity, RSP is equivalent to LCP) or random walk (when Ѳ → 0, RSP → current models). Using this approach, we identify migration corridors for GPS-monitored wild reindeer (Rangifer t. tarandus) in Norway. We demonstrate that reindeer movement is best predicted by an intermediate value of Ѳ, indicative of a movement trade-off between optimization and exploration. Model calibration allows identification of a corridor-barrier continuum that closely fits empirical data and demonstrates that RSP outperforms models that assume either optimality or random walk. The proposed approach models the multiscale cognitive maps by which animals likely navigate real landscapes and generalizes the most common algorithms for identifying corridors. Because suboptimal, but non-random, movement strategies are likely widespread, our approach has the potential to predict more realistic corridor-barrier continua for a wide range of species. © 2015 The Authors. Journal of Animal Ecology © 2015 British Ecological Society.

33 CFR 149.315 - What embarkation, launching, and recovery arrangements must rescue boats meet?

Code of Federal Regulations, 2014 CFR

2014-07-01

... GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DEEPWATER PORTS DEEPWATER PORTS: DESIGN, CONSTRUCTION... the shortest possible time. (c) If the rescue boat is one of the deepwater port's survival craft, then... disengaging apparatus, approved under approval series 160.170, instead of a lifeboat release mechanism. (f...

7 CFR 1755.506 - Aerial wire services

Code of Federal Regulations, 2010 CFR

2010-01-01

.../Orange or White Orange 3 White/Green or White Green 4 White/Brown or White Brown 5 White/Slate or White... station protectors. (p) When it is necessary to avoid intervening obstacles between a pole and a building... lines to buildings shall follow the shortest feasible route commensurate with the requirements of...

76 FR 65419 - Airworthiness Directives; SOCATA Airplanes

Federal Register 2010, 2011, 2012, 2013, 2014

2011-10-21

... case of inverted installation of aileron control cables in the wing. The shortest cable was found... states: A TBM 700 operator reported a case of inverted installation of aileron control cables in the wing... inspection to verify the correct installation of the aileron control cables and, in case of discrepancies...

Herbicide effects on sugarcane

USDA-ARS?s Scientific Manuscript database

Of all the areas of the world where sugarcane is grown, Louisiana lies furthest from the Equator. As such, its growing season is the shortest as it is affected by frost in the late–winter (February/March) at the start of the growing season and the fear of freezing temperatures during the harvest se...

Development of the PEBLebl Traveling Salesman Problem Computerized Testbed

ERIC Educational Resources Information Center

Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew

2015-01-01

The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

A blueprint for legislative action : consensus recommendations for U.S. Climate Protection Legislation

DOT National Transportation Integrated Search

2009-01-01

In January 2007, we issued our Call for Action in which we joined together to call for prompt enactment of national legislation in the United States to slow, stop and reverse the growth of greenhouse gas (GHG) emissions over the shortest time reas...

A graph-based semantic similarity measure for the gene ontology.

PubMed

Alvarez, Marco A; Yan, Changhui

2011-12-01

Existing methods for calculating semantic similarities between pairs of Gene Ontology (GO) terms and gene products often rely on external databases like Gene Ontology Annotation (GOA) that annotate gene products using the GO terms. This dependency leads to some limitations in real applications. Here, we present a semantic similarity algorithm (SSA), that relies exclusively on the GO. When calculating the semantic similarity between a pair of input GO terms, SSA takes into account the shortest path between them, the depth of their nearest common ancestor, and a novel similarity score calculated between the definitions of the involved GO terms. In our work, we use SSA to calculate semantic similarities between pairs of proteins by combining pairwise semantic similarities between the GO terms that annotate the involved proteins. The reliability of SSA was evaluated by comparing the resulting semantic similarities between proteins with the functional similarities between proteins derived from expert annotations or sequence similarity. Comparisons with existing state-of-the-art methods showed that SSA is highly competitive with the other methods. SSA provides a reliable measure for semantics similarity independent of external databases of functional-annotation observations.

A new method of content based medical image retrieval and its applications to CT imaging sign retrieval.

PubMed

Ma, Ling; Liu, Xiabi; Gao, Yan; Zhao, Yanfeng; Zhao, Xinming; Zhou, Chunwu

2017-02-01

This paper proposes a new method of content based medical image retrieval through considering fused, context-sensitive similarity. Firstly, we fuse the semantic and visual similarities between the query image and each image in the database as their pairwise similarities. Then, we construct a weighted graph whose nodes represent the images and edges measure their pairwise similarities. By using the shortest path algorithm over the weighted graph, we obtain a new similarity measure, context-sensitive similarity measure, between the query image and each database image to complete the retrieval process. Actually, we use the fused pairwise similarity to narrow down the semantic gap for obtaining a more accurate pairwise similarity measure, and spread it on the intrinsic data manifold to achieve the context-sensitive similarity for a better retrieval performance. The proposed method has been evaluated on the retrieval of the Common CT Imaging Signs of Lung Diseases (CISLs) and achieved not only better retrieval results but also the satisfactory computation efficiency. Copyright © 2017 Elsevier Inc. All rights reserved.

A novel algorithm for fast grasping of unknown objects using C-shape configuration

NASA Astrophysics Data System (ADS)

Lei, Qujiang; Chen, Guangming; Meijer, Jonathan; Wisse, Martijn

2018-02-01

Increasing grasping efficiency is very important for the robots to grasp unknown objects especially subjected to unfamiliar environments. To achieve this, a new algorithm is proposed based on the C-shape configuration. Specifically, the geometric model of the used under-actuated gripper is approximated as a C-shape. To obtain an appropriate graspable position, this C-shape configuration is applied to fit geometric model of an unknown object. The geometric model of unknown object is constructed by using a single-view partial point cloud. To examine the algorithm using simulations, a comparison of the commonly used motion planners is made. The motion planner with the highest number of solved runs, lowest computing time and the shortest path length is chosen to execute grasps found by this grasping algorithm. The simulation results demonstrate that excellent grasping efficiency is achieved by adopting our algorithm. To validate this algorithm, experiment tests are carried out using a UR5 robot arm and an under-actuated gripper. The experimental results show that steady grasping actions are obtained. Hence, this research provides a novel algorithm for fast grasping of unknown objects.

Efficacy of short-term versus long-term chest tube drainage following talc slurry pleurodesis in patients with malignant pleural effusions: a randomised trial.

PubMed

Goodman, Anna; Davies, Christopher W H

2006-10-01

Talc pleurodesis is commonly used in the palliative treatment of malignant pleural effusions but the shortest and most effective regime has not been determined. In particular, it is not clear when the intercostal drain should be removed following the insertion of sclerosant. We conducted a single-centre, randomised, open trial of drain removal at 24 h versus 72 h following talc slurry pleurodesis. The primary outcome measure was success of pleurodesis (no recurrence of effusion on chest radiograph at 1-month follow-up) and secondary outcome measures included length of hospital stay and mortality. We found no difference between recurrence of pleural effusion in those randomised to drain removal at 24 h and those randomised to drain removal at 72 h (p>0.5). However, length of stay was significantly reduced when the chest drain was removed at 24 h (4 days versus 8 days; p<0.01). Mortality did not differ between the two groups. We conclude that this shorter pleurodesis regime is safe and effective.

Morphology, nurse plants, and minimum apical temperatures for young Carnegiea gigantea

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nobel, P.S.

1980-06-01

The northern limit of Carnegiea gigantea (Engelm.) Britton and Rose apparently depends on minimum apical temperatures. Diameters, apical spine coverage, and effects of nurse plants on incoming long-wave (infrared (ir)) radiation, all of which affect apical temperatures, were therefore determined for stems of C. gigantea up to 4 m tall at four sites along a north-south transect in Arizona. A simulation model indicated that the increase in diameter accompanying stem growth raised the minimum apical temperature more than 3 C. Thus, plants with the shortest stems would be expected to be the most vulnerable to freezing damage; indeed, freezing damagemore » on stems <0.5 m tall without nurse plants was fairly common at the colder sites. Nurse plants obstructed a greater portion of the sky for C. gigantea at the colder sites; e.g., the effective environmental temperature for ir radiation at such locations was raised more than 10 C for stems under 1 m tall. If the northern limit of C. gigantea reflects wintertime survival of juveniles, nurse plants could extend the range by offering some protection against freezing.« less

33 CFR 149.315 - What embarkation, launching, and recovery arrangements must rescue boats meet?

Code of Federal Regulations, 2012 CFR

2012-07-01

... GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DEEPWATER PORTS DEEPWATER PORTS: DESIGN, CONSTRUCTION... the shortest possible time. (c) If the rescue boat is one of the deepwater port's survival craft, then... apparatus, approved under approval series 160.170, instead of a lifeboat release mechanism. (f) The rescue...

33 CFR 149.315 - What embarkation, launching, and recovery arrangements must rescue boats meet?

Code of Federal Regulations, 2010 CFR

2010-07-01

... GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DEEPWATER PORTS DEEPWATER PORTS: DESIGN, CONSTRUCTION... the shortest possible time. (c) If the rescue boat is one of the deepwater port's survival craft, then... apparatus, approved under approval series 160.170, instead of a lifeboat release mechanism. (f) The rescue...

33 CFR 149.315 - What embarkation, launching, and recovery arrangements must rescue boats meet?

Code of Federal Regulations, 2011 CFR

2011-07-01

... GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DEEPWATER PORTS DEEPWATER PORTS: DESIGN, CONSTRUCTION... the shortest possible time. (c) If the rescue boat is one of the deepwater port's survival craft, then... apparatus, approved under approval series 160.170, instead of a lifeboat release mechanism. (f) The rescue...

Geometry of forest landscape connectivity: pathways for persistence

Treesearch

Deanna H. Olson; Kelly M. Burnett

2013-01-01

Streamside areas may be dispersal funnels or runways for a variety of species. For over-ridge dispersal, headwaters offer the shortest distance links among riparian zones in adjacent drainages. We summarize landscape designs for connectivity of habitats using headwater riparian linkage areas as the foundation for a web of landscape-scale links. We developed management...

Invasion Percolation and Global Optimization

NASA Astrophysics Data System (ADS)

Barabási, Albert-László

1996-05-01

Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP model that belongs to the same universality class as IBP and generates the minimal energy tree spanning the IBP cluster.

Stratum Weight Determination Using Shortest Path Algorithm

Treesearch

Susan L. King

2005-01-01

Forest Inventory and Analysis uses poststratification to calculate resource estimates. Each county has a different stratification, and the stratification may differ depending on the number of panels of data available. A ?5 by 5 sum? filter was passed over the reclassified forest/nonforest Multi-Resolution Landscape Characterization image used in Phase 1, generating an...

Nested Fork-Join Queuing Networks and Their Application to Mobility Airfield Operations Analysis.

DTIC Science & Technology

1997-03-01

shortest queue length. Setia , Squillante, and Tripathi [109] extend Makowski and Nelson’s work by performing a quantitative assessment of a range of...Markov chains." Numerical Solution of Markov Chains, edited by W. J. Stewart, 63- 88. Basel: Marcel Dekker, 1991. [109] Setia , S. K., and others

[Aneurysm in the aorta. Diagnostic confirmation by means of a helicoidal CAT scan].

PubMed

Lema Garrido, Fernando; Moya Merino, Mariano; Jordán López, Cristóbal

2004-09-01

A helicoidal radiological CAT Scan, which produces reconstructions in varying planes and makes use of an injected contrasting liquid, confirms a diagnosis of an abdominal aorta aneurysm in the shortest time possible, whether this aneurysm is broken or dried, in order to facilitate a patient's treatment to the highest degree.

Inactivation of Escherichia coli on blueberries using cold plasma with chemical augmentation inside a partial vacuum

USDA-ARS?s Scientific Manuscript database

Justification: The mechanism by which cold plasma inactivates pathogens is through the production of free reactive chemical species. Unfortunately, the most reactive chemical species have the shortest half-life. In a vacuum their half-life is believed to be prolonged. Additionally, these reactive sp...

Selective attention and the auditory vertex potential. 1: Effects of stimulus delivery rate

NASA Technical Reports Server (NTRS)

Schwent, V. L.; Hillyard, S. A.; Galambos, R.

1975-01-01

Enhancement of the auditory vertex potentials with selective attention to dichotically presented tone pips was found to be critically sensitive to the range of inter-stimulus intervals in use. Only at the shortest intervals was a clear-cut enhancement of the latency component to stimuli observed for the attended ear.

On Finding Shortest Paths on Convex Polyhedra.

DTIC Science & Technology

1985-05-01

versi ty of N laryhrid ml Collge :IJR-. M T) 207-12 COMPUTER SCIENCE TECHNICAL REPR SERWS .UE TE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND S 20742...planar layout can be physically interpreted as cutting the polyhedron along the ridges and unfolding the resulting object onto the plane. o% 4e.. ~16 A o

Juniper seed sources in the Great Plains

Treesearch

Richard A. Cunningham; Rudy M. King

2000-01-01

At age 10, 100% of eastern redcedar ( L.) and Rocky Mountain juniper ( Sarg.) trees from several seed sources throughout the Great Plains had survived. Seed sources from southeastern Texas had the poorest survival. Eastern redcedar trees from Kansas seed sources grew tallest, and trees from Montana and southeastern Texas seed sources were the shortest. Rocky Mountain...

The Spider and the Fly

ERIC Educational Resources Information Center

Mellinger, Keith E.; Viglione, Raymond

2012-01-01

The Spider and the Fly puzzle, originally attributed to the great puzzler Henry Ernest Dudeney, and now over 100 years old, asks for the shortest path between two points on a particular square prism. We explore a generalization, find that the original solution only holds in certain cases, and suggest how this discovery might be used in the…

Teaching Literacy in the Technology Classroom

ERIC Educational Resources Information Center

Panell, Chris

2005-01-01

A technology instructor's job is not to simply "shovel out" knowledge; they must inspire students to seek out information on their own. Their mission is to prepare students for success in the workplace in the shortest practical time, and one of these workplace requirements is the ability to read and research on the job. Although most technology…

5 CFR 591.207 - Which areas are COLA areas?

Code of Federal Regulations, 2010 CFR

2010-01-01

... Anchorage, AK, and 80-kilometer (50-mile) radius by shortest route using paved roads when available, as measured from the Federal courthouse to the official duty station; (b) City of Fairbanks, AK, and 80... courthouse to the official duty station; (c) City of Juneau, AK, and 80-kilometer (50-mile) radius by...

5 CFR 591.207 - Which areas are COLA areas?

Code of Federal Regulations, 2014 CFR

2014-01-01

... Anchorage, AK, and 80-kilometer (50-mile) radius by shortest route using paved roads when available, as measured from the Federal courthouse to the official duty station; (b) City of Fairbanks, AK, and 80... courthouse to the official duty station; (c) City of Juneau, AK, and 80-kilometer (50-mile) radius by...

5 CFR 591.207 - Which areas are COLA areas?

Code of Federal Regulations, 2013 CFR

2013-01-01

... Anchorage, AK, and 80-kilometer (50-mile) radius by shortest route using paved roads when available, as measured from the Federal courthouse to the official duty station; (b) City of Fairbanks, AK, and 80... courthouse to the official duty station; (c) City of Juneau, AK, and 80-kilometer (50-mile) radius by...

5 CFR 591.207 - Which areas are COLA areas?

Code of Federal Regulations, 2011 CFR

2011-01-01

... Anchorage, AK, and 80-kilometer (50-mile) radius by shortest route using paved roads when available, as measured from the Federal courthouse to the official duty station; (b) City of Fairbanks, AK, and 80... courthouse to the official duty station; (c) City of Juneau, AK, and 80-kilometer (50-mile) radius by...

5 CFR 591.207 - Which areas are COLA areas?

Code of Federal Regulations, 2012 CFR

2012-01-01

... Anchorage, AK, and 80-kilometer (50-mile) radius by shortest route using paved roads when available, as measured from the Federal courthouse to the official duty station; (b) City of Fairbanks, AK, and 80... courthouse to the official duty station; (c) City of Juneau, AK, and 80-kilometer (50-mile) radius by...

76 FR 23794 - Stock Status Determination for Atlantic Highly Migratory Scalloped Hammerhead Shark

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-28

...) published in the North American Journal of Fisheries Management a stock assessment of the Atlantic... conservation and management measures to rebuild overfished stocks within 2 years of making this determination... to rebuilding the fishery within the shortest time possible in accordance with 16 U.S.C. 1854(e)(4...

Relevancy in Problem Solving: A Computational Framework

ERIC Educational Resources Information Center

Kwisthout, Johan

2012-01-01

When computer scientists discuss the computational complexity of, for example, finding the shortest path from building A to building B in some town or city, their starting point typically is a formal description of the problem at hand, e.g., a graph with weights on every edge where buildings correspond to vertices, routes between buildings to…

Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network

DTIC Science & Technology

2015-12-24

minimizing a weighted sum ofthe time and control effort needed to collect sensor data. This problem formulation is a modified traveling salesman ...29 2.5 The Shortest Path Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 2.5.1 Traveling Salesman Problem ...48 3.3.1 Initial Guess by Traveling Salesman Problem Solution

24 CFR 965.304 - Order of funding.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 24 Housing and Urban Development 4 2012-04-01 2012-04-01 false Order of funding. 965.304 Section....304 Order of funding. Within the funds available to a PHA, energy conservation measures should be accomplished with the shortest pay-back periods funded first. A PHA may make adjustments to this funding order...

Citius, Altius, Fortius

ERIC Educational Resources Information Center

Starr, Sean

2012-01-01

There is an expectation that at each Olympic Games, and at other international events, new record performances will be achieved. This article describes some of the research that has been done to consider whether (as a result of human endeavour alone), records will always continue to be broken or whether there are limits to the shortest achievable…

The Application of Magnesium(I) Compounds to Energy Storage Materials - Phase 2

DTIC Science & Technology

2013-06-24

currently exploring the use of 10 as a catalyst for a number of other processes, e.g. the selective hydroboration of ketone , aldehydes and nitriles...hydroboration of ketones ; (vi) a variety of related results, including the preparation of an iron(I) dimer with the shortest Fe-Fe multiple bond

Nocturnally migrating songbirds drift when they can and compensate when they must.

PubMed

Horton, Kyle G; Van Doren, Benjamin M; Stepanian, Phillip M; Hochachka, Wesley M; Farnsworth, Andrew; Kelly, Jeffrey F

2016-02-16

The shortest possible migratory route for birds is not always the best route to travel. Substantial research effort has established that birds in captivity are capable of orienting toward the direction of an intended goal, but efforts to examine how free-living birds use navigational information under conditions that potentially make direct flight toward that goal inefficient have been limited in spatiotemporal scales and in the number of individuals observed because of logistical and technological limitations. Using novel and recently developed techniques for analysis of Doppler polarimetric weather surveillance radar data, we examined two impediments for nocturnally migrating songbirds in eastern North America following shortest-distance routes: crosswinds and oceans. We found that migrants in flight often drifted sideways on crosswinds, but most strongly compensated for drift when near the Atlantic coast. Coastal migrants' tendency to compensate for wind drift also increased through the night, while no strong temporal differences were observed at inland sites. Such behaviors suggest that birds migrate in an adaptive way to conserve energy by assessing while airborne the degree to which they must compensate for wind drift.

Shortest-path constraints for 3D multiobject semiautomatic segmentation via clustering and Graph Cut.

PubMed

Kéchichian, Razmig; Valette, Sébastien; Desvignes, Michel; Prost, Rémy

2013-11-01

We derive shortest-path constraints from graph models of structure adjacency relations and introduce them in a joint centroidal Voronoi image clustering and Graph Cut multiobject semiautomatic segmentation framework. The vicinity prior model thus defined is a piecewise-constant model incurring multiple levels of penalization capturing the spatial configuration of structures in multiobject segmentation. Qualitative and quantitative analyses and comparison with a Potts prior-based approach and our previous contribution on synthetic, simulated, and real medical images show that the vicinity prior allows for the correct segmentation of distinct structures having identical intensity profiles and improves the precision of segmentation boundary placement while being fairly robust to clustering resolution. The clustering approach we take to simplify images prior to segmentation strikes a good balance between boundary adaptivity and cluster compactness criteria furthermore allowing to control the trade-off. Compared with a direct application of segmentation on voxels, the clustering step improves the overall runtime and memory footprint of the segmentation process up to an order of magnitude without compromising the quality of the result.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

NASA Astrophysics Data System (ADS)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Strychnine as Target, Samarium Diiodide as Tool: A Personal Story.

PubMed

Beemelmanns, Christine; Reissig, Hans-Ulrich

2015-10-01

Strychnine stands out from the group of classical natural products as one of the first complex compounds to be isolated in pure form and an extreme challenge to be structurally characterized. It has played a central role in natural product total syntheses and the surge in the development of innovative synthetic methods for many decades. Recently, we have accomplished one of the shortest formal total syntheses of strychnine (in ten steps and 14% overall yield or even shorter in eight steps and 10% overall yield). The evolution of a productive synthetic strategy, as well as the synthetic challenges tackled, are described here in detail, including examples of related transformations. The successful synthetic strategy was inspired by the premise that the core structure could be derived from simple aromatic indole precursors by a reductive SmI2 -induced ketyl-aryl coupling. Other key reactions included a diastereoselective reduction and a regioselective elimination protocol. Altogether one of the shortest syntheses of iso-strychnine and hence of strychnine was established. Copyright © 2015 The Chemical Society of Japan and Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Axillary nerve course and position in the fetal period

PubMed Central

Uluer, Tuğba; Aktekin, Mustafa; Kurtoğlu, Zeliha; Buluklu, Semih; Karşıyaka, Dilan; Can, Erdem

2015-01-01

Objectives: To examine the fetal axillary nerve to reveal and compare its morphometric features within the second and third trimester. Methods: This study was conducted at the Anatomy Department, School of Medicine, Mersin University, Mersin, Turkey. Thirty-five fetal shoulders were studied to provide anatomic data and to describe its position with regard to certain landmarks around the shoulder. Results: The shortest distance between the axillary nerve and the glenoid labrum was found 2.27 mm and 2.89 mm in the second and third trimester fetuses, respectively. The shortest distances between the anterior and posterior acromial tips and the axillary nerve were also measured and were used with arm length measurements to define the anterior and posterior indexes. Conclusion: The indexes show that the distance between the axillary nerve and the anterior/posterior acromial tips are approximately one-fourth of the arm length in both the second and third trimester fetuses. The data presented in this study will be of use to surgeons, particularly to pediatric and orthopedic surgeons who will undertake surgical procedures in the axilla and arm in the newborn or early childhood. PMID:26492124

Google Maps for Crowdsourced Emergency Routing

NASA Astrophysics Data System (ADS)

Nedkov, S.; Zlatanova, S.

2012-08-01

Gathering infrastructure data in emergency situations is challenging. The affected by a disaster areas are often large and the needed observations numerous. Spaceborne remote sensing techniques cover large areas but they are of limited use as their field of view may be blocked by clouds, smoke, buildings, highways, etc. Remote sensing products furthermore require specialists to collect and analyze the data. This contrasts the nature of the damage detection problem: almost everyone is capable of observing whether a street is usable or not. The crowd is fit for solving these challenges as its members are numerous, they are willing to help and are often in the vicinity of the disaster thereby forming a highly dispersed sensor network. This paper proposes and implements a small WebGIS application for performing shortest path calculations based on crowdsourced information about the infrastructure health. The application is built on top of Google Maps and uses its routing service to calculate the shortest distance between two locations. Impassable areas are indicated on a map by people performing in-situ observations on a mobile device, and by users on a desktop machine who consult a multitude of information sources.

Distributive routing and congestion control in wireless multihop ad hoc communication networks

NASA Astrophysics Data System (ADS)

Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

2004-10-01

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

The shortest Th-Th distance from a new type of quadruple bond.

PubMed

Hu, Han-Shi; Kaltsoyannis, Nikolas

2017-02-15

Compounds featuring unsupported metal-metal bonds between actinide elements remain highly sought after yet confined experimentally to inert gas matrix studies. Notwithstanding this paucity, actinide-actinide bonding has been the subject of extensive computational research. In this contribution, high level quantum chemical calculations at both the scalar and spin-orbit levels are used to probe the Th-Th bonding in a range of zero valent systems of general formula LThThL. Several of these compounds have very short Th-Th bonds arising from a new type of Th-Th quadruple bond with a previously unreported electronic configuration featuring two unpaired electrons in 6d-based δ bonding orbitals. H 3 AsThThAsH 3 is found to have the shortest Th-Th bond yet reported (2.590 Å). The Th 2 unit is a highly sensitive probe of ligand electron donor/acceptor ability; we can tune the Th-Th bond from quadruple to triple, double and single by judicious choice of the L group, up to 2.888 Å for singly-bonded ONThThNO.

Nocturnally migrating songbirds drift when they can and compensate when they must

PubMed Central

Horton, Kyle G.; Van Doren, Benjamin M.; Stepanian, Phillip M.; Hochachka, Wesley M.; Farnsworth, Andrew; Kelly, Jeffrey F.

2016-01-01

The shortest possible migratory route for birds is not always the best route to travel. Substantial research effort has established that birds in captivity are capable of orienting toward the direction of an intended goal, but efforts to examine how free-living birds use navigational information under conditions that potentially make direct flight toward that goal inefficient have been limited in spatiotemporal scales and in the number of individuals observed because of logistical and technological limitations. Using novel and recently developed techniques for analysis of Doppler polarimetric weather surveillance radar data, we examined two impediments for nocturnally migrating songbirds in eastern North America following shortest-distance routes: crosswinds and oceans. We found that migrants in flight often drifted sideways on crosswinds, but most strongly compensated for drift when near the Atlantic coast. Coastal migrants’ tendency to compensate for wind drift also increased through the night, while no strong temporal differences were observed at inland sites. Such behaviors suggest that birds migrate in an adaptive way to conserve energy by assessing while airborne the degree to which they must compensate for wind drift. PMID:26879152

Evaluation of panel code predictions with experimental results of inlet performance for a 17-inch ducted prop/fab simulator operating at Mach 0.2

NASA Technical Reports Server (NTRS)

Boldman, D. R.; Iek, C.; Hwang, D. P.; Jeracki, R. J.; Larkin, M.; Sorin, G.

1991-01-01

An axisymmetric panel code was used to evaluate a series of ducted propeller inlets. The inlets were tested in the Lewis 9 by 15 Foot Low Speed Wind Tunnel. Three basic inlets having ratios of shroud length to propeller diameter of 0.2, 0.4, and 0.5 were tested with the Pratt and Whitney ducted prop/fan simulator. A fourth hybrid inlet consisting of the shroud from the shortest basic inlet coupled with the spinner from the largest basic inlet was also tested. This later configuration represented the shortest overall inlet. The simulator duct diameter at the propeller face was 17.25 inches. The short and long spinners provided hub-to-tip ratios of 0.44 at the propeller face. The four inlets were tested at a nominal free stream Mach number of 0.2 and at angles of attack from 0 degrees to 35 degrees. The panel code method incorporated a simple two-part separation model which yielded conservative estimates of inlet separation.

Interactive neonatal gastrointestinal magnetic resonance imaging using fruit juice as an oral contrast media.

PubMed

Arthurs, Owen J; Graves, Martin J; Edwards, Andrea D; Joubert, Ilse; Set, Pat A K; Lomas, David J

2014-09-22

The objective was to evaluate the use of fruit juice with an interactive inversion recovery (IR) MR pulse sequence to visualise the gastrointestinal tract. We investigated the relaxation properties of 12 different natural fruit juices in vitro, to identify which could be used as oral contrast. We then describe our initial experience using an interactive MR pulse sequence to allow optimal visualisation after administering pineapple juice orally, and suppressing pre-existing bowel fluid contents, with variable TI in three adult and one child volunteer. Pineapple juice (PJ) had both the shortest T1 (243 ms) and shortest T2 (48 ms) of the fruit juices tested. Optimal signal differentiation between pre-existing bowel contents and oral PJ administration was obtained with TIs of between 900 and 1100 ms. The use of an inversion recovery preparation allowed long T1 pre-existing bowel contents to be suppressed whilst the short T1 of fruit juice acts as a positive contrast medium. Pineapple juice could be used as oral contrast agent for neonatal gastrointestinal magnetic resonance imaging.

Energy-efficient rings mechanism for greening multisegment fiber-wireless access networks

NASA Astrophysics Data System (ADS)

Gong, Xiaoxue; Guo, Lei; Hou, Weigang; Zhang, Lincong

2013-07-01

Through integrating advantages of optical and wireless communications, the Fiber-Wireless (FiWi) has become a promising solution for the "last-mile" broadband access. In particular, greening FiWi has attained extensive attention, because the access network is a main energy contributor in the whole infrastructure. However, prior solutions of greening FiWi shut down or sleep unused/minimally used optical network units for a single segment, where we deploy only one optical linear terminal. We propose a green mechanism referred to as energy-efficient ring (EER) for multisegment FiWi access networks. We utilize an integer linear programming model and a generic algorithm to generate clusters, each having the shortest distance of fully connected segments of its own. Leveraging the backtracking method for each cluster, we then connect segments through fiber links, and the shortest distance fiber ring is constructed. Finally, we sleep low load segments and forward affected traffic to other active segments on the same fiber ring by our sleeping scheme. Experimental results show that our EER mechanism significantly reduces the energy consumption at the slightly additional cost of deploying fiber links.

Sub-200 femtosecond dispersion-managed soliton ytterbium-doped fiber laser based on carbon nanotubes saturable absorber.

PubMed

Hou, Lei; Guo, Hongyu; Wang, Yonggang; Sun, Jiang; Lin, Qimeng; Bai, Yang; Bai, Jintao

2018-04-02

Ultrafast fiber laser light sources attract enormous interest due to the booming applications they are enabling, including long-distance communication, optical metrology, detecting technology of infra-biophotons, and novel material processing. In this paper, we demonstrate 175 fs dispersion-managed soliton (DMS) mode-locked ytterbium-doped fiber (YDF) laser based on single-walled carbon nanotubes (SWCNTs) saturable absorber (SA). The output DMSs have been achieved with repetition rate of 21.2 MHz, center wavelength of 1025.5 nm, and a spectral width of 32.7 nm. The operation directly pulse duration of 300 fs for generated pulse is the reported shortest pulse width for broadband SA based YDF lasers. By using an external grating-based compressor, the pulse duration could be compressed down to 175 fs. To the best of our knowledge, it is the shortest pulse duration obtained directly from YDF laser based on broadband SAs. In this paper, SWCNTs-SA has been utilized as the key optical component (mode locker) and the grating pair providing negative dispersion acts as the dispersion controller.

Fast marching methods for the continuous traveling salesman problem

PubMed Central

Andrews, June; Sethian, J. A.

2007-01-01

We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points (“cities”) in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the traveling salesman problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both a heuristic and an optimal solution to this problem. The complexity of the heuristic algorithm is at worst case M·N log N, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh. PMID:17220271

Fast marching methods for the continuous traveling salesman problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Andrews, J.; Sethian, J.A.

We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ('cities') in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the Traveling Salesman Problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both amore » heuristic and an optimal solution to this problem. The order of the heuristic algorithm is at worst case M * N logN, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh.« less

Identification of literary movements using complex networks to represent texts

NASA Astrophysics Data System (ADS)

Amancio, Diego Raphael; Oliveira, Osvaldo N., Jr.; da Fontoura Costa, Luciano

2012-04-01

The use of statistical methods to analyze large databases of text has been useful in unveiling patterns of human behavior and establishing historical links between cultures and languages. In this study, we identified literary movements by treating books published from 1590 to 1922 as complex networks, whose metrics were analyzed with multivariate techniques to generate six clusters of books. The latter correspond to time periods coinciding with relevant literary movements over the last five centuries. The most important factor contributing to the distinctions between different literary styles was the average shortest path length, in particular the asymmetry of its distribution. Furthermore, over time there has emerged a trend toward larger average shortest path lengths, which is correlated with increased syntactic complexity, and a more uniform use of the words reflected in a smaller power-law coefficient for the distribution of word frequency. Changes in literary style were also found to be driven by opposition to earlier writing styles, as revealed by the analysis performed with geometrical concepts. The approaches adopted here are generic and may be extended to analyze a number of features of languages and cultures.

Effects of ship traffic on seabirds in offshore waters: implications for marine conservation and spatial planning.

PubMed

Schwemmer, Philipp; Mendel, Bettina; Sonntag, Nicole; Dierschke, Volker; Garthe, Stefan

2011-07-01

Most anthropogenic influences on marine ecosystems, except for river- or terrestrial-borne pollution, involve some sort of vessel activity. Increasing anthropogenic activities mean that many countries are being forced to develop spatial planning schemes, while at the same time implementing conservation sites for sensitive species at sea. The effects of ship traffic on seabirds sensitive to human disturbance are currently too poorly understood to allow for the development of proper planning and conservation guidelines. We therefore used aerial surveys and experimental disturbance to elucidate the effects of passing ships on the distribution patterns, habitat loss, and species-specific flight reactions of birds, as well as the potential for habituation. Loons (Gavia spp.) showed clear avoidance of areas with high shipping intensity. Flush distances of four sea duck species differed significantly, with the longest distances recorded for Common Scoters (Melanitta nigra) and the shortest for Common Eiders (Somateria mollissima). Flush distance was positively related to flock size. Among all the sea duck species studied, the duration of temporary habitat loss was longest for Common Scoters. We found indications of habituation in sea ducks within areas of channeled traffic. However, it is questionable if habituation to free-ranging ships is likely to occur, because of their unpredictable nature. We therefore recommend that spatial planning should aim to channel ship traffic wherever possible to avoid further habitat fragmentation and to allow for habituation, at least in some species. Information on the effects of shipping on other seabird species and during different periods of the year is urgently needed, together with information on the effects of different types of boats, including recreational and fishing vessels.

A model to create an efficient and equitable admission policy for patients arriving to the cardiothoracic ICU.

PubMed

Yang, Muer; Fry, Michael J; Raikhelkar, Jayashree; Chin, Cynthia; Anyanwu, Anelechi; Brand, Jordan; Scurlock, Corey

2013-02-01

To develop queuing and simulation-based models to understand the relationship between ICU bed availability and operating room schedule to maximize the use of critical care resources and minimize case cancellation while providing equity to patients and surgeons. Retrospective analysis of 6-month unit admission data from a cohort of cardiothoracic surgical patients, to create queuing and simulation-based models of ICU bed flow. Three different admission policies (current admission policy, shortest-processing-time policy, and a dynamic policy) were then analyzed using simulation models, representing 10 yr worth of potential admissions. Important output data consisted of the "average waiting time," a proxy for unit efficiency, and the "maximum waiting time," a surrogate for patient equity. A cardiothoracic surgical ICU in a tertiary center in New York, NY. Six hundred thirty consecutive cardiothoracic surgical patients admitted to the cardiothoracic surgical ICU. None. Although the shortest-processing-time admission policy performs best in terms of unit efficiency (0.4612 days), it did so at expense of patient equity prolonging surgical waiting time by as much as 21 days. The current policy gives the greatest equity but causes inefficiency in unit bed-flow (0.5033 days). The dynamic policy performs at a level (0.4997 days) 8.3% below that of the shortest-processing-time in average waiting time; however, it balances this with greater patient equity (maximum waiting time could be shortened by 4 days compared to the current policy). Queuing theory and computer simulation can be used to model case flow through a cardiothoracic operating room and ICU. A dynamic admission policy that looks at current waiting time and expected ICU length of stay allows for increased equity between patients with only minimum losses of efficiency. This dynamic admission policy would seem to be a superior in maximizing case-flow. These results may be generalized to other surgical ICUs.

The electron injection rate in CdSe quantum dot sensitized solar cells: from a bifunctional linker and zinc oxide morphology.

PubMed

Ding, Wei-Lu; Peng, Xing-Liang; Sun, Zhu-Zhu; Li, Ze-Sheng

2017-11-09

Herein, we have investigated the effect of both the bifunctional linker (L1, L2, L3, and L4) and ZnO morphology (porous nanoparticles (NPs), nanowires (NWs), and nanotubes (NTs-A and NTs-Z)) on the electron injection in CdSe QD sensitized solar cells by first-principles simulation. Via calculating the partitioned interfaces formed by different components (linker/QDs and ZnO/linker), we found that the electronic states of QDs and every ZnO substrate are insensitive to any linker, while the frontier orbitals of L1-L4 (with increased delocalization) manifest a systematical negative-shift. Because of the lowest unoccupied molecular orbital (LUMO) of L1 compared to its counterparts aligned in the region of the virtual states of QDs or the substrate with a high density of states, it always yields a stronger electronic coupling with QDs and varied substrates. After characterization of the complete ZnO/linker/QD system, we found that the electron injection time (τ) vastly depends on both the linker and substrate. On the one hand, L1 bridged QDs and every substrate always achieve the shortest τ compared to their counterpart associated cases. On the other hand, NW supported systems always yield the shortest τ no matter what the linker is. Overall, the NW/L1/QD system achieves the fastest injection by ∼160 fs. This essentially stems from the shortest molecular length of L1 decreasing the distance between QDs and the substrate, subsequently improving the interfacial coupling. Meanwhile, the NW supported cases generate the less sensitive virtual states for both the QDs and NWs, ensuring a less variable interfacial coupling. These facts combined can provide understanding of the effects contributed from the linker and the oxide semiconductor morphology on charge transfer with the aim of choosing an appropriate component with fast directional electron injection.

Actin filaments, stereocilia, and hair cells of the bird cochlea. V. How the staircase pattern of stereociliary lengths is generated

PubMed Central

1988-01-01

The stereocilia on each hair cell are arranged into rows of ascending height, resulting in what we refer to as a "staircase-like" profile. At the proximal end of the cochlea the length of the tallest row of stereocilia in the staircase is 1.5 micron, with the shortest row only 0.3 micron. As one proceeds towards the distal end of the cochlea the length of the stereocilia progressively increases so that at the extreme distal end the length of the tallest row of the staircase is 5.5 micron and the shortest row is 2 micron. During development hair cells form their staircases in four phases of growth separated from each other by developmental time. First, stereocilia sprout from the apical surfaces of the hair cells (8-10-d embryos). Second (10-12-d embryos), what will be the longest row of the staircase begins to elongate. As the embryo gets older successive rows of stereocilia initiate elongation. Thus the staircase is set up by the sequential initiation of elongation of stereociliary rows located at increased distances from the row that began elongation. Third (12-17-d embryos), all the stereocilia in the newly formed staircase elongate until those located on the first step of the staircase have reached the prescribed length. In the final phase (17-d embryos to hatchlings) there is a progressive cessation of elongation beginning with the shortest step and followed by taller and taller rows with the tallest step stopping last. Thus, to obtain a pattern of stereocilia in rows of increasing height what transpires are progressive go signals followed by a period when all the stereocilia grow and ending with progressive stop signals. We discuss how such a sequence could be controlled. PMID:3339095

Impact of top end anastomosis design on patency and flow stability in coronary artery bypass grafting.

PubMed

Koyama, Sachi; Kitamura, Tadashi; Itatani, Keiichi; Yamamoto, Tadashi; Miyazaki, Shohei; Oka, Norihiko; Nakashima, Kouki; Horai, Tetsuya; Ono, Minoru; Miyaji, Kagami

2016-05-01

For coronary artery bypass grafting (CABG), free grafts such as a saphenous vein or radial artery are often used for grafts to the lateral and posterior walls. However, the relationship between top-end anastomosis design and long-term patency remains unknown. Because coronary artery blood flow is dominant during diastole, top-end anastomosis may work better if the graft is directed towards the apex, whereas the shortest graft pathway appears to be most efficient. Using computational fluid dynamic models, we evaluated the hemodynamic variables that were affected by the angle of the top-end anastomosis. We created three-dimensional geometries of the aortic root with coronary arteries that involved 75 % stenosis in the obtuse marginal and postero-lateral branches. Two bypass models under vasodilator administration were created: in a"Model A", the top-end anastomosis is parallel to the long axis of the ascending aorta and the graft passed over the conus directed towards the apex; in a "Model B", the top-end anastomosis is directed toward the shortest pathway, and form near the right angles to the long axis of the ascending aorta. Wall shear stress (WSS) and its fluctuation, an oscillatory shear index (OSI) were evaluated to predict fibrosis progression at the anastomosis site and graft flow. Graft flow was 197.3 ml/min and 207.3 ml/min in the "Model A" and "Model B", respectively. The minimal WSS value inside the graft with the "Model A" and "Model B" was 0.53 Pa and 4.09 Pa, respectively, and the OSI value was 0.46 and 0.04, respectively. The top-end anastomosis of a free graft should be directed vertically towards the aorta to achieve the shortest graft pathway to maintain a high graft flow rate and to avoid the risks of endothelial fibrosis and plaque progression over the long-term after CABG.

Chronic wasting disease in bank voles: characterisation of the shortest incubation time model for prion diseases

USDA-ARS?s Scientific Manuscript database

In order to assess the susceptibility of bank voles to chronic wasting disease (CWD), we inoculated voles carrying isoleucine or methionine at codon 109 (Bv109I and Bv109M, respectively) with CWD isolates from elk, mule deer and white-tailed deer. Efficient transmission rate (100%) was observed with...

Spatial Allocation of Timber Product Output Roundwood Receipts

Treesearch

John P. Brown

2015-01-01

Data from Georgia timber product output studies were used to develop models that spatially allocate roundwood receipts data from primary wood-using mills. Mill receipts data were converted to a cumulative frequency based on a distance from the mill to a county center. Distances were calculated as either straight line or shortest road distance, and county centers were...

Notes on specifications for French airplane competitions

NASA Technical Reports Server (NTRS)

Margoulis, W

1920-01-01

Given here are the rules officially adopted by the Aeronautical Commission of the Aero Club of France for a flight competition to be held in France in 1920 at the Villacoublay Aerodrome. The prize will be awarded to the pilot who succeeds in obtaining the highest maximum and lowest minimum speeds, and in landing within the shortest distance.

Programs for road network planning.

Treesearch

Ward W. Carson; Dennis P. Dykstra

1978-01-01

This paper describes four computer programs developed to assist logging engineers to plan transportation in a forest. The objective of these programs, to be used together, is to find the shortest path through a transportation network from a point of departure to a destination. Three of the programs use the digitizing and plotting capabilities of a programable desk-top...

Banach spaces that realize minimal fillings

NASA Astrophysics Data System (ADS)

Bednov, B. B.; Borodin, P. A.

2014-04-01

It is proved that a real Banach space realizes minimal fillings for all its finite subsets (a shortest network spanning a fixed finite subset always exists and has the minimum possible length) if and only if it is a predual of L_1. The spaces L_1 are characterized in terms of Steiner points (medians). Bibliography: 25 titles.

On Compact Book Storage in Libraries.

ERIC Educational Resources Information Center

Ravindran, Arunachalam

The optimal storage of books by size in libraries is considered in this paper. It is shown that for a given collection of books of various sizes, the optimum number of shelf heights to use can be determined by finding the shortest path in an equivalent network. Applications of this model to inventory control, assortment and packaging problems are…

Teaching through Trade Books: Sunrise, Sunset, and Shadows

ERIC Educational Resources Information Center

Royce, Christine Anne

2015-01-01

December brings the winter solstice, the day with the shortest amount of sunlight for the northern hemisphere. Students can notice the pattern of days getting darker earlier across the United States up to this point and then notice as the amount of sunlight starts to increase in the following months. Through making observations and collecting data…

E-Learning Technologies: Employing Matlab Web Server to Facilitate the Education of Mathematical Programming

ERIC Educational Resources Information Center

Karagiannis, P.; Markelis, I.; Paparrizos, K.; Samaras, N.; Sifaleras, A.

2006-01-01

This paper presents new web-based educational software (webNetPro) for "Linear Network Programming." It includes many algorithms for "Network Optimization" problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems and other search algorithms. Therefore, webNetPro can assist the teaching process of courses such…

(2-{[2-(diphenyl-phosphino)phen-yl]thio}-phen-yl)diphenyl-phosphine sulfide.

PubMed

Alvarez-Larena, Angel; Martinez-Cuevas, Francisco J; Flor, Teresa; Real, Juli

2012-11-01

In the title compound, C(36)H(28)P(2)S(2), the dihedral angle between the central benzene rings is 66.95 (13)°. In the crystal, molecules are linked via C(ar)-H⋯π and π-π inter-actions [shortest centroid-centroid distance between benzene rings = 3.897 (2) Å].

Penguins and Plagiarism: Stemming the Tide of Plagiarism in Elementary School

ERIC Educational Resources Information Center

Mitchell, Sara

2007-01-01

Plagiarism is on the rise on high school and college campuses. There are many reasons why students tend to plagiarize. One of these is that many students are interested in the shortest possible route through a course. Some students also fear that their writing ability is inadequate. If student plagiarism and lack of academic integrity are…

Which Way Is Jerusalem? Navigating on a Spheroid

ERIC Educational Resources Information Center

Schechter, Murray

2007-01-01

Given two points on a spheroidal planet, what is the direction from the first to the second? The answer depends, of course, on what path you take. This paper compares two paths which suggest themselves, namely, the loxodrome, which is the path in which the direction stays constant, and the geodesic, which is the shortest path. The geodesic does…

A Dynamic Programming Approach to Identifying the Shortest Path in Virtual Learning Environments

ERIC Educational Resources Information Center

Fazlollahtabar, Hamed

2008-01-01

E-learning has been widely adopted as a promising solution by many organizations to offer learning-on-demand opportunities to individual employees (learners) in order to reduce training time and cost. While successful information systems models have received much attention among researchers, little research has been conducted to assess the success…

Climate and the weight/height relationship in sub-Saharan Africa.

PubMed

Hiernaux, J; Rudan, P; Brambati, A

1975-01-01

25 populations of the rain forest and 44 of the open country, all descended from the West-Central African stock which lived in the latter biome, are compared for body weight and height. On a log weight/height diagram, the 69 populations cluster along a straight line which intersects the lines of equal body weight/surface ratio: the shorter the body size, the lower the ratio tends to be. The rain forest populations are concentrated in the lower part of the bivariate distribution. The shortest one, the Mbuti Pygmies, has a very low ratio despite a relatively heavy weight. The shorter stature of the rain forest populations seems to be largely genetic in origin; it probably results from selective pressure exerted by the thermal stres in this hot and wet biome where sweating is of low thermolytic efficiency. The amount of reduction of adult stature depends for a large part on the number of generations spent in the forest by the population. Line A (in figure 1) is similar to a growth trend. The 69 populations differ genetically by the target that growth has to reach on a common log weight/height trend line. They achieve this differentiation through different speeds of growth.

A monotopic aluminum telluride with an Al=Te double bond stabilized by N-heterocyclic carbenes

PubMed Central

Franz, Daniel; Szilvási, Tibor; Irran, Elisabeth; Inoue, Shigeyoshi

2015-01-01

Aluminum chalcogenides are mostly encountered in the form of bulk aluminum oxides that are structurally diverse but typically consist of networks with high lattice energy in which the chalcogen atoms bridge the metal centres. This makes their molecular congeners difficult to synthesize because of a pronounced tendency for oligomerization. Here we describe the isolation of the monotopic aluminum chalcogenide (LDipN)AlTe(LEt)2 (LDip=1,3-(2,6-diisopropylphenyl)-imidazolin-2-imine, LEt=1,3-diethyl-4,5-dimethyl-imidazolin-2-ylidene). Unique features of (LDipN)AlTe(LEt)2 are the terminal position of the tellurium atom, the shortest aluminum–tellurium distance hitherto reported for a molecular complex and the highest bond order reported for an interaction between these elements, to the best of our knowledge. At elevated temperature (LDipN)AlTe(LEt)2 equilibrates with dimeric {(LDipN)AlTe(LEt)}2 in which the chalcogen atoms assume their common role as bridges between the metal centres. These findings demonstrate that (LDipN)AlTe(LEt)2 comprises the elusive Al=Te double bond in the form of an N-heterocyclic carbene-stabilized species. PMID:26612781

Flight capacity of adult Culex pipiens pallens (Diptera: Culicidae) in relation to gender and day-age.

PubMed

Cui, Jianxin; Li, Shujuan; Zhao, Ping; Zou, Fumin

2013-09-01

Culex pipiens pallens (L.) is the most common mosquito in houses of central and northern China. It is the primary vector of lymphatic filariasis and Japanese encephalitis. The flight range of mosquitoes is an important factor predicting the risk area of transmission of mosquito-borne pathogens to vertebrate hosts. The flight performance of Cx. pipiens pallens was measured with a 26-channel computer-monitored flight-mill system. We found that females had longer flight capability than males for total flight distance (TFD) and total flight duration (TFDr), and females flew faster than males based on mean flight velocity. No significant difference in flight capability was found between different age-groups in males. However, certain age-groups of females showed significant differences in TFDr and TFD. Specifically, TFD and TFDr tended to be shortest for 5- and 6-d-old females. These significant differences in flight capability between ages and genders provide insights to determine the size of operational area to achieve effective control of Cx. pipiens pallens and minimize the risk of the related mosquito-borne epidemic diseases of lymphatic filariasis and Japanese encephalitis.

A survey of current trends in computational drug repositioning.

PubMed

Li, Jiao; Zheng, Si; Chen, Bin; Butte, Atul J; Swamidass, S Joshua; Lu, Zhiyong

2016-01-01

Computational drug repositioning or repurposing is a promising and efficient tool for discovering new uses from existing drugs and holds the great potential for precision medicine in the age of big data. The explosive growth of large-scale genomic and phenotypic data, as well as data of small molecular compounds with granted regulatory approval, is enabling new developments for computational repositioning. To achieve the shortest path toward new drug indications, advanced data processing and analysis strategies are critical for making sense of these heterogeneous molecular measurements. In this review, we show recent advancements in the critical areas of computational drug repositioning from multiple aspects. First, we summarize available data sources and the corresponding computational repositioning strategies. Second, we characterize the commonly used computational techniques. Third, we discuss validation strategies for repositioning studies, including both computational and experimental methods. Finally, we highlight potential opportunities and use-cases, including a few target areas such as cancers. We conclude with a brief discussion of the remaining challenges in computational drug repositioning. Published by Oxford University Press 2015. This work is written by US Government employees and is in the public domain in the US.

Scale-free Graphs for General Aviation Flight Schedules

NASA Technical Reports Server (NTRS)

Alexandov, Natalia M. (Technical Monitor); Kincaid, Rex K.

2003-01-01

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

Reflex responses of lip muscles in young and older women.

PubMed

Wohlert, A B

1996-06-01

The perioral reflex in response to innocuous mechanical stimulation of the lip vermilion was studied in 20 young and 20 older women. Responses to stimuli at the right and left sides of both the upper and lower lips were recorded. Results show significant specificity of response, especially for upper lip sites. Reflex response at the site of stimulation was greatest in amplitude and shortest in latency, followed by response at sites ipsilateral to the site of stimulation. Younger subjects showed greater localizing tendency than older subjects. Stimulation was significantly less likely to produce a reflex response in the older group. When reflex responses did occur, they were significantly lower in amplitude and longer in latency than the responses of the younger group. Nonetheless, reflex responses were common in both groups, with responses at the site of stimulation occurring 78% of the time in older women and 90% of the time in younger women. Every participant showed at least one reflex response to lip stimulation. Results suggest decreasing complexity of synaptic drive to the perioral system in old age but also show that reflexive response does not deteriorate completely, remaining an available element for motor control in normal older women.

The Shortest Distance Between You and a Published Book: 20 Steps to Success.

ERIC Educational Resources Information Center

Page, Susan

This book aims to make successful publications happen--anticipating how an as yet unpublished author might feel at various stages and coaches them through the best and worst. The book provides easy-to-follow strategies that actually get results. Among the 20 steps to success in the book are the following: the three "magic first steps" an…

A New High-Resolution Direction Finding Architecture Using Photonics and Neural Network Signal Processing for Miniature Air Vehicle Applications

DTIC Science & Technology

2015-09-01

3 4. Probability of Intercept .................................................................3 5. Superresolution ...intercept. This alignment gives the shortest mean-time-to-intercept and can be less than one second. 4 5. Superresolution For single signals...at each antenna element. For multiple signals, superresolution DF techniques are often used. These techniques can be broken down into beamforming

49 CFR 178.609 - Test requirements for packagings for infectious substances.

Code of Federal Regulations, 2011 CFR

2011-10-01

... free-fall drops onto a rigid, nonresilient, flat, horizontal surface from a height of 9 m (30 feet... must be dropped, one in each of the following orientation: (i) Flat on the base; (ii) Flat on the top; (iii) Flat on the longest side; (iv) Flat on the shortest side; and (v) On a corner. (2) Where the...

77 FR 421 - Drawbridge Operation Regulation; Long Island, New York Inland Waterway From East Rockaway Inlet...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-05

..., mile 6.1, across Narrow Bay, between Smith Point and Fire Island, New York. This temporary final rule..., (76 FR 60733) and that work was unexpectedly delayed. This rule provides a time extension so that the rehabilitation can be completed in the shortest possible time frame. Without this rule the work would have to be...

44 CFR 206.101 - Temporary housing assistance for emergencies and major disasters declared on or before October 14...

Code of Federal Regulations, 2010 CFR

2010-10-01

... shortest possible time, applicants who are able to do so will be encouraged to make their own arrangements... assistance, plus any additions during the temporary housing period, such as infants, spouses, or part-time residents who were not present at the time of the disaster but who are expected to return during the...

A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem

ERIC Educational Resources Information Center

MacGregor, James N.; Chronicle, Edward P.; Ormerod, Thomas C.

2006-01-01

We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally…

Creating an Online Laboratory

DTIC Science & Technology

2015-03-18

Problem (TSP) to solve, a canonical computer science problem that involves identifying the shortest itinerary for a hypothetical salesman traveling among a...also created working versions of the travelling salesperson problem , prisoners’ dilemma, public goods game, ultimatum game, word ladders, and...the task within networks of others performing the task. Thus, we built five problems which could be embedded in networks: the traveling salesperson

Application of cellular automatons and ant algorithms in avionics

NASA Astrophysics Data System (ADS)

Kuznetsov, A. V.; Selvesiuk, N. I.; Platoshin, G. A.; Semenova, E. V.

2018-03-01

The paper considers two algorithms for searching quasi-optimal solutions of discrete optimization problems with regard to the tasks of avionics placing. The first one solves the problem of optimal placement of devices by installation locations, the second one is for the problem of finding the shortest route between devices. Solutions are constructed using a cellular automaton and the ant colony algorithm.

String tightening as a self-organizing phenomenon.

PubMed

Banerjee, Bonny

2007-09-01

The phenomenon of self-organization has been of special interest to the neural network community throughout the last couple of decades. In this paper, we study a variant of the self-organizing map (SOM) that models the phenomenon of self-organization of the particles forming a string when the string is tightened from one or both of its ends. The proposed variant, called the string tightening self-organizing neural network (STON), can be used to solve certain practical problems, such as computation of shortest homotopic paths, smoothing paths to avoid sharp turns, computation of convex hull, etc. These problems are of considerable interest in computational geometry, robotics path-planning, artificial intelligence (AI) (diagrammatic reasoning), very large scale integration (VLSI) routing, and geographical information systems. Given a set of obstacles and a string with two fixed terminal points in a 2-D space, the STON model continuously tightens the given string until the unique shortest configuration in terms of the Euclidean metric is reached. The STON minimizes the total length of a string on convergence by dynamically creating and selecting feature vectors in a competitive manner. Proof of correctness of this anytime algorithm and experimental results obtained by its deployment have been presented in the paper.

Cation-Dependent Intrinsic Electrical Conductivity in Isostructural Tetrathiafulvalene-Based Microporous Metal–Organic Frameworks

DOE PAGES

Park, Sarah S.; Hontz, Eric R.; Sun, Lei; ...

2015-01-26

Isostructural metal-organic frameworks (MOFs) M 2(TTFTB) (M = Mn, Co, Zn, and Cd; H4TTFTB = tetrathiafulvalene tetrabenzoate) exhibit a striking correlation between their single-crystal conductivities and the shortest S···S interaction defined by neighboring TTF cores, which inversely correlates with the ionic radius of the metal ions. The larger cations cause a pinching of the S···S contact, which is responsible for better orbital overlap between p z orbitals on neighboring S and C atoms. Density functional theory calculations show that these orbitals are critically involved in the valence band of these materials, such that modulation of the S···S distance has anmore » important effect on band dispersion and, implicitly, on the conductivity. The Cd analogue, with the largest cation and shortest S···S contact, shows the largest electrical conductivity, σ = 2.86 (±0.53) × 10 -4 S/cm, which is also among the highest in microporous MOFs. These results describe the first demonstration of tunable intrinsic electrical conductivity in this class of materials and serve as a blueprint for controlling charge transport in MOFs with π-stacked motifs.« less

Extended shortest path selection for package routing of complex networks

NASA Astrophysics Data System (ADS)

Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Scopolamine effects on functional brain connectivity: a pharmacological model of Alzheimer's disease.

PubMed

Bajo, R; Pusil, S; López, M E; Canuet, L; Pereda, E; Osipova, D; Maestú, F; Pekkonen, E

2015-07-01

Scopolamine administration may be considered as a psychopharmacological model of Alzheimer's disease (AD). Here, we studied a group of healthy elderly under scopolamine to test whether it elicits similar changes in brain connectivity as those observed in AD, thereby verifying a possible model of AD impairment. We did it by testing healthy elderly subjects in two experimental conditions: glycopyrrolate (placebo) and scopolamine administration. We then analyzed magnetoencephalographic (MEG) data corresponding to both conditions in resting-state with eyes closed. This analysis was performed in source space by combining a nonlinear frequency band-specific measure of functional connectivity (phase locking value, PLV) with network analysis methods. Under scopolamine, functional connectivity between several brain areas was significantly reduced as compared to placebo, in most frequency bands analyzed. Besides, regarding the two complex network indices studied (clustering and shortest path length), clustering significantly decreased in the alpha band while shortest path length significantly increased also in alpha band both after scopolamine administration. Overall our findings indicate that both PLV and graph analysis are suitable tools to measure brain connectivity changes induced by scopolamine, which causes alterations in brain connectivity apparently similar to those reported in AD.

Site-directed protein recombination as a shortest-path problem.

PubMed

Endelman, Jeffrey B; Silberg, Jonathan J; Wang, Zhen-Gang; Arnold, Frances H

2004-07-01

Protein function can be tuned using laboratory evolution, in which one rapidly searches through a library of proteins for the properties of interest. In site-directed recombination, n crossovers are chosen in an alignment of p parents to define a set of p(n + 1) peptide fragments. These fragments are then assembled combinatorially to create a library of p(n+1) proteins. We have developed a computational algorithm to enrich these libraries in folded proteins while maintaining an appropriate level of diversity for evolution. For a given set of parents, our algorithm selects crossovers that minimize the average energy of the library, subject to constraints on the length of each fragment. This problem is equivalent to finding the shortest path between nodes in a network, for which the global minimum can be found efficiently. Our algorithm has a running time of O(N(3)p(2) + N(2)n) for a protein of length N. Adjusting the constraints on fragment length generates a set of optimized libraries with varying degrees of diversity. By comparing these optima for different sets of parents, we rapidly determine which parents yield the lowest energy libraries.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Evtushenko, Pavel E.; Klopf, John M.

Frequency domain measurements with Martin-Puplett interferometer is one of a few techniques capable of bunch length measurements at the level of ~ 100 fs. As the bunch length becomes shorter, it is important to know and be able to measure the limitations of the instrument in terms of shortest measurable bunch length. In this paper we describe an experiment using a blackbody source with the modified Martin-Puplett interferometer that is routine- ly used for bunch length measurements at the JLab FEL, as a way to estimate the shortest, measurable bunch length. The limitation comes from high frequency cut-off of themore » wire-grid polarizer currently used and is estimated to be 50 fs RMS. The measurements are made with the same Golay cell detector that is used for beam measure- ments. We demonstrate that, even though the blackbody source is many orders of magnitude less bright than the coherent transition or synchrotron radiation, it can be used for the measurements and gives a very good signal to noise ratio in combination with lock-in detection. We also compare the measurements made in air and in vacuum to characterize the very strong effect of the atmospheric absorption.« less

Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

NASA Astrophysics Data System (ADS)

Wu, Zikai; Hou, Baoyu; Zhang, Hongjuan; Jin, Feng

2014-04-01

Deterministic network models have been attractive media for discussing dynamical processes' dependence on network structural features. On the other hand, the heterogeneity of weights affect dynamical processes taking place on networks. In this paper, we present a family of weighted expanded Koch networks based on Koch networks. They originate from a r-polygon, and each node of current generation produces m r-polygons including the node and whose weighted edges are scaled by factor w in subsequent evolutionary step. We derive closed-form expressions for average weighted shortest path length (AWSP). In large network, AWSP stays bounded with network order growing (0 < w < 1). Then, we focus on a special random walks and trapping issue on the networks. In more detail, we calculate exactly the average receiving time (ART). ART exhibits a sub-linear dependence on network order (0 < w < 1), which implies that nontrivial weighted expanded Koch networks are more efficient than un-weighted expanded Koch networks in receiving information. Besides, efficiency of receiving information at hub nodes is also dependent on parameters m and r. These findings may pave the way for controlling information transportation on general weighted networks.

The Bionomics of the Cocoa Mealybug, Exallomochlus hispidus (Morrison) (Hemiptera: Pseudococcidae), on Mangosteen Fruit and Three Alternative Hosts

PubMed Central

Indarwatmi, Murni; Dadang, Dadang; Ridwani, Sobir; Sri Ratna, Endang

2017-01-01

The cocoa mealybug, Exallomochlus hispidus Morrison (Hemiptera: Pseudococcidae) is known to attack mangosteen, an important fruit export commodity for Indonesia. The mealybug is polyphagous, so alternative host plants can serve as a source of nourishment. This study aimed to record the bionomics of E. hispidus on mangosteen (Garcinia mangostana L.) and three alternative hosts, kabocha squash (Cucurbita maxima L.), soursop (Annona muricata, L.), and guava (Psidium guajava L.). First-instar nymphs of the E. hispidus were reared at room temperature on mangosteen, kabocha, soursop, and guava fruits until they developed into adults and produced nymphs. Female E. hispidus go through three instar stages before adulthood. The species reproduces by deuterotokous parthenogenesis. Exallomochlus hispidus successfully developed and reproduced on all four hosts. The shortest life cycle of the mealybug occurred on kabocha (about 32.4 days) and the longest was on guava (about 38.3 days). The highest fecundity was found on kabocha (about 100 nymphs/female) and the lowest on mangosteen (about 46 nymphs/female). The shortest oviposition period was 10 days on mangosteen and the longest, 10 days, on guava. These findings could be helpful in controlling E. hispidus populations in orchards. PMID:28757558

Discovery of a Highly Relativistic Double Neutron Star Binary

NASA Astrophysics Data System (ADS)

Chatterjee, Shami; Stovall, Kevin; PALFA Collaboration, Paul Demorest, Nihan Pol

2018-01-01

We report the discovery of a double neutron star (DNS) binary system, PSR J1946+2052, in Arecibo L-Band Feed Array Pulsar Survey (PALFA) observations. PSR J1946+2052 is a 17-ms pulsar in a 1.88-hour, eccentric (e = 0.06) orbit with a 1.2 solar mass companion. We have localized the pulsar to a precision of 0.09 arcseconds using a new phase binning mode at the Jansky Very Large Array. The improved position has enabled a measurement of the pulsar spin period derivative of 9E-19 s/s; the low inferred magnetic field strength at the surface of 4E+9 Gauss indicates that the pulsar has been recycled. Among all known DNS systems, PSR J1946+2052 has the shortest orbital period, and currently radiates ~13% of a solar luminosity in gravitational wave power. Its estimated time to merger is only 45.5 MYr, the shortest known, and at that time it will display the largest spin effects of any such system discovered to date. We have also measured the advance of periastron passage for this system, 25.6 +/- 0.3 degrees per year, resulting in a total system mass measurement of 2.50 +/- 0.04 solar masses.

Fair sharing of resources in a supply network with constraints.

PubMed

Carvalho, Rui; Buzna, Lubos; Just, Wolfram; Helbing, Dirk; Arrowsmith, David K

2012-04-01

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power law with exponent -1. Our semianalytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

Long-term life testing of Geostationary Operational Environmental Satellite (GOES) encoder lamps

NASA Technical Reports Server (NTRS)

Powers, Charles E.

1992-01-01

The aging characteristics and lifetimes of tungsten filament encoder lamps were determined as a function of operating voltage and filament material. For pure tungsten and thoria doped (1 pct.) filament lamps, crystal grain growth over the center portion of the filament leads to the ultimate failure of the lamp. The development of notches associated with this grain growth is the cause of lamp burn out. Eventually, one of the notches will 'etch' through the filament, causing it to fail open. For rhenium doped (3 pct.) filament lamps, distortion of the filament leads to the ultimate failure of the lamp. The lifetime of these lamps is about 1 year at an operating voltage of 5.0 volts. The pure tungsten filament lamps have the longest average lifetime, and the thoria doped filament lamps have the shortest at 5.0 volts. The lifetimes of these lamps is about 7 years at an operating voltage of 3.5 volts. Data suggest that the rhenium doped lamps will have the longest average lifetime at 3.5 volts, and the thoria doped will have the shortest. These lifetimes are comparable to the desired lifetimes of 7 years.

A primer for workers' compensation.

PubMed

Bible, Jesse E; Spengler, Dan M; Mir, Hassan R

2014-07-01

A physician's role within a workers' compensation injury extends far beyond just evaluation and treatment with several socioeconomic and psychological factors at play compared with similar injuries occurring outside of the workplace. Although workers' compensation statutes vary among states, all have several basic features with the overall goal of returning the injured worker to maximal function in the shortest time period, with the least residual disability and shortest time away from work. To help physicians unfamiliar with the workers' compensation process accomplish these goals. Review. Educational review. The streamlined review addresses the topics of why is workers' compensation necessary; what does workers' compensation cover; progression after work injury; impairment and maximum medical improvement, including how to use the sixth edition of American Medical Association's (AMA) Guides to the evaluation of permanent impairment (Guides); completion of work injury claim after impairment rating; independent medical evaluation; and causation. In the "no-fault" workers' compensation system, physicians play a key role in progressing the claim along and, more importantly, getting the injured worker back to work as soon as safely possible. Physicians should remain familiar with the workers' compensation process, along with how to properly use the AMA Guides. Copyright © 2014 Elsevier Inc. All rights reserved.

Efficiency and robustness of different bus network designs

NASA Astrophysics Data System (ADS)

Pang, John Zhen Fu; Bin Othman, Nasri; Ng, Keng Meng; Monterola, Christopher

2015-07-01

We compare the efficiencies and robustness of four transport networks that can be possibly formed as a result of deliberate city planning. The networks are constructed based on their spatial resemblance to the cities of Manhattan (lattice), Sudan (random), Beijing (single-blob) and Greater Cairo (dual-blob). For a given type, a genetic algorithm is employed to obtain an optimized set of the bus routes. We then simulate how commuter travels using Yen's algorithms for k shortest paths on an adjacency matrix. The cost of traveling such as walking between stations is captured by varying the weighted sums of matrices. We also consider the number of transfers a posteriori by looking at the computed shortest paths. With consideration to distances via radius of gyration, redundancies of travel and number of bus transfers, our simulations indicate that random and dual-blob are more efficient than single-blob and lattice networks. Moreover, dual-blob type is least robust when node removals are targeted but is most resilient when node failures are random. The work hopes to guide and provide technical perspectives on how geospatial distribution of a city limits the optimality of transport designs.

Perturbation Effects on a Supercritical C7H16/N2 Mixing Layer

NASA Technical Reports Server (NTRS)

Okongo'o, Nora; Bellan, Josette

2008-01-01

A computational-simulation study has been presented of effects of perturbation wavelengths and initial Reynolds numbers on the transition to turbulence of a heptane/nitrogen mixing layer at supercritical pressure. The governing equations for the simulations were the same as those of related prior studies reported in NASA Tech Briefs. Two-dimensional (2D) simulations were performed with initially im posed span wise perturbations whereas three-dimensional (3D) simulations had both streamwise and spanwise initial perturbations. The 2D simulations were undertaken to ascertain whether perturbations having the shortest unstable wavelength obtained from a linear stability analysis for inviscid flow are unstable in viscous nonlinear flows. The goal of the 3D simulations was to ascertain whether perturbing the mixing layer at different wavelengths affects the transition to turbulence. It was found that transitions to turbulence can be obtained at different perturbation wavelengths, provided that they are longer than the shortest unstable wavelength as determined by 2D linear stability analysis for the inviscid case and that the initial Reynolds number is proportionally increased as the wavelength is decreased. The transitional states thus obtained display different dynamic and mixture characteristics, departing strongly from the behaviors of perfect gases and ideal mixtures.

Discovery of new candidate genes related to brain development using protein interaction information.

PubMed

Chen, Lei; Chu, Chen; Kong, Xiangyin; Huang, Tao; Cai, Yu-Dong

2015-01-01

Human brain development is a dramatic process composed of a series of complex and fine-tuned spatiotemporal gene expressions. A good comprehension of this process can assist us in developing the potential of our brain. However, we have only limited knowledge about the genes and gene functions that are involved in this biological process. Therefore, a substantial demand remains to discover new brain development-related genes and identify their biological functions. In this study, we aimed to discover new brain-development related genes by building a computational method. We referred to a series of computational methods used to discover new disease-related genes and developed a similar method. In this method, the shortest path algorithm was executed on a weighted graph that was constructed using protein-protein interactions. New candidate genes fell on at least one of the shortest paths connecting two known genes that are related to brain development. A randomization test was then adopted to filter positive discoveries. Of the final identified genes, several have been reported to be associated with brain development, indicating the effectiveness of the method, whereas several of the others may have potential roles in brain development.

To Each According to its Degree: The Meritocracy and Topocracy of Embedded Markets

NASA Astrophysics Data System (ADS)

Borondo, J.; Borondo, F.; Rodriguez-Sickert, C.; Hidalgo, C. A.

2014-01-01

A system is said to be meritocratic if the compensation and power available to individuals is determined by their abilities and merits. A system is topocratic if the compensation and power available to an individual is determined primarily by her position in a network. Here we introduce a model that is perfectly meritocratic for fully connected networks but that becomes topocratic for sparse networks-like the ones in society. In the model, individuals produce and sell content, but also distribute the content produced by others when they belong to the shortest path connecting a buyer and a seller. The production and distribution of content defines two channels of compensation: a meritocratic channel, where individuals are compensated for the content they produce, and a topocratic channel, where individual compensation is based on the number of shortest paths that go through them in the network. We solve the model analytically and show that the distribution of payoffs is meritocratic only if the average degree of the nodes is larger than a root of the total number of nodes. We conclude that, in the light of this model, the sparsity and structure of networks represents a fundamental constraint to the meritocracy of societies.

A century of trends in adult human height

PubMed Central

2016-01-01

Being taller is associated with enhanced longevity, and higher education and earnings. We reanalysed 1472 population-based studies, with measurement of height on more than 18.6 million participants to estimate mean height for people born between 1896 and 1996 in 200 countries. The largest gain in adult height over the past century has occurred in South Korean women and Iranian men, who became 20.2 cm (95% credible interval 17.5–22.7) and 16.5 cm (13.3–19.7) taller, respectively. In contrast, there was little change in adult height in some sub-Saharan African countries and in South Asia over the century of analysis. The tallest people over these 100 years are men born in the Netherlands in the last quarter of 20th century, whose average heights surpassed 182.5 cm, and the shortest were women born in Guatemala in 1896 (140.3 cm; 135.8–144.8). The height differential between the tallest and shortest populations was 19-20 cm a century ago, and has remained the same for women and increased for men a century later despite substantial changes in the ranking of countries. DOI: http://dx.doi.org/10.7554/eLife.13410.001 PMID:27458798

Fair sharing of resources in a supply network with constraints

NASA Astrophysics Data System (ADS)

Carvalho, Rui; Buzna, Lubos; Just, Wolfram; Helbing, Dirk; Arrowsmith, David K.

2012-04-01

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power law with exponent -1. Our semianalytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

To each according to its degree: the meritocracy and topocracy of embedded markets.

PubMed

Borondo, J; Borondo, F; Rodriguez-Sickert, C; Hidalgo, C A

2014-01-21

A system is said to be meritocratic if the compensation and power available to individuals is determined by their abilities and merits. A system is topocratic if the compensation and power available to an individual is determined primarily by her position in a network. Here we introduce a model that is perfectly meritocratic for fully connected networks but that becomes topocratic for sparse networks-like the ones in society. In the model, individuals produce and sell content, but also distribute the content produced by others when they belong to the shortest path connecting a buyer and a seller. The production and distribution of content defines two channels of compensation: a meritocratic channel, where individuals are compensated for the content they produce, and a topocratic channel, where individual compensation is based on the number of shortest paths that go through them in the network. We solve the model analytically and show that the distribution of payoffs is meritocratic only if the average degree of the nodes is larger than a root of the total number of nodes. We conclude that, in the light of this model, the sparsity and structure of networks represents a fundamental constraint to the meritocracy of societies.

Substrate effects on pupation and adult emergence of Hermetia illucens (Diptera: Stratiomyidae).

PubMed

Holmes, L A; Vanlaerhoven, S L; Tomberlin, J K

2013-04-01

Black soldier flies, Hermetia illucens (L.) (Diptera: Stratiomyidae), are of particular interest for their applications in waste management. Feeding on decaying organic waste, black soldier flies successfully reduce manure in confined animal feeding operations of poultry, swine, and cattle. To optimize waste conversion in confined animal feeding operations and landfill facilities, it is imperative to optimize black soldier fly development. Unfortunately, black soldier flies only convert waste during their larval feeding stages and therefore it is of interest to optimize the nonfeeding stages of development, specifically, the postfeeding and pupal stages. The time spent in these stages is thought to be determined by the pupation substrate encountered by the postfeeding larvae. The objective of this study was to determine the effect different pupation substrates have on postfeeding development time, pupation time, and adult emergence success. Five pupation substrates were compared: wood shavings, potting soil, topsoil, sand, and nothing. Postfeeding larvae took longer to reach pupation in the absence of a pupation substrate, although reaching pupation in the shortest time in potting soil and wood shavings. The time spent in the pupal stage was shortest in the absence of a pupation substrate. However, fewer adults emerged when a pupation substrate was not provided.

Highly Asynchronous VisitOr Queue Graph Toolkit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pearce, R.

2012-10-01

HAVOQGT is a C++ framework that can be used to create highly parallel graph traversal algorithms. The framework stores the graph and algorithmic data structures on external memory that is typically mapped to high performance locally attached NAND FLASH arrays. The framework supports a vertex-centered visitor programming model. The frameworkd has been used to implement breadth first search, connected components, and single source shortest path.

Army Initial Acquisition Training: An Analysis of Costs and Benefits

DTIC Science & Technology

2015-12-01

AND BENEFITS December 2015 By: Curtis Brooker Keith Miner Stephanie Montano Advisors: Jesse Cunha Nicholas Dew...COSTS AND BENEFITS 5. FUNDING NUMBERS 6. AUTHOR(S) Curtis Brooker, Keith Miner, and Stephanie Montano 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS... benefits due to the defense focus of the degree and because all of the educational requirements are completed in the shortest amount of time, which

Selecting the proper seed source

Treesearch

Robert Z. Callaham

1959-01-01

A forester faces many problems in selecting the proper seed source of ponderosa pine. He wants a seed source well adapted to all of the conditions of his planting site–one that can tolerate all of the extremes of heat, cold, and drought; that can resist the ravages of insects, diseases, and animals; that can produce the most of the desired product in the shortest time...

(2-{[2-(diphenyl­phosphino)phen­yl]thio}­phen­yl)diphenyl­phosphine sulfide

PubMed Central

Alvarez-Larena, Angel; Martinez-Cuevas, Francisco J.; Flor, Teresa; Real, Juli

2012-01-01

In the title compound, C36H28P2S2, the dihedral angle between the central benzene rings is 66.95 (13)°. In the crystal, molecules are linked via Car—H⋯π and π–π inter­actions [shortest centroid–centroid distance between benzene rings = 3.897 (2) Å]. PMID:23284423

Evaluating CoLiDeS + Pic: The Role of Relevance of Pictures in User Navigation Behaviour

ERIC Educational Resources Information Center

Karanam, Saraschandra; van Oostendorp, Herre; Indurkhya, Bipin

2012-01-01

CoLiDeS + Pic is a cognitive model of web-navigation that incorporates semantic information from pictures into CoLiDeS. In our earlier research, we have demonstrated that by incorporating semantic information from pictures, CoLiDeS + Pic can predict the hyperlinks on the shortest path more frequently, and also with greater information scent,…

Optimal Control of Fully Routed Air Traffic in the Presence of Uncertainty and Kinodynamic Constraints

DTIC Science & Technology

2014-09-18

Operations and Developing Issues . . . . . . . . . . . . . . . . . . 6 2.1.2 Next-Generation Air Transportation System (NextGen...Air Traffic Management ESP Euclidean Shortest Path FAA Federal Aviation Administration FCFS First-Come-First-Served HCS Hybrid Control System KKT...Karush-Kuhn-Tucker LGR Legendre-Gauss-Radau MLD Minimum Lateral Distance NAS National Airspace System NASA National Aeronautics and Space Administration

Some extemporaneous comments on our experiences with towers for wind generators

NASA Technical Reports Server (NTRS)

Hutter, U.

1973-01-01

A wind generator tower must be designed to withstand fatigue forces and gust winds loads. Optimum tower height depends on the energy cost to the customer because an increase in height results in an increase in the cost of the plant. It is suggested that costs are minimum for the shortest tower possible and that the rotor should be as large as possible.

Purpose-Driven Communities in Multiplex Networks: Thresholding User-Engaged Layer Aggregation

DTIC Science & Technology

2016-06-01

dark networks is a non-trivial yet useful task. Because terrorists work hard to hide their relationships/network, analysts have an incomplete picture...them identify meaningful terrorist communities. This thesis introduces a general-purpose algorithm for community detection in multiplex dark networks...aggregation, dark networks, conductance, cluster adequacy, mod- ularity, Louvain method, shortest path interdiction 15. NUMBER OF PAGES 155 16. PRICE CODE

[Interrelationship between peripartal metabolism, performance, morbidity and productive life in a herd of Holstein-Friesian heifers].

PubMed

Ackermann, S; Gottschalk, J; Einspanier, A; Jäckel, L; Fürll, M

2013-01-01

The aim of this study was to determine the relationship between the heifers' peripartal metabolism, milk yield data and the productive life achieved. Furthermore, the influence of fertility, back fat thickness and morbidity on the productive life was evaluated. Metabolic data and back fat thickness measurements, determined between 2004 and 2005 in a herd of Holstein-Friesian dairy cows, were analysed retrospectively. Additionally, the age reached by the 207 (at that time) heifers as well as data on culling, fertility, milk yield and morbidity were determined with the help of the herd management system and related to the laboratory findings. Heifers with the shortest productive life of < 12 months had the significantly lowest (p < 0.0001) milk yield. The shortest productive life of < 12 months was associated with the significantly lowest (p < 0.0001) oestradiol concentrations 3 days post partum (p. p.) and the significantly smallest (p < 0.0001) albumin concentrations p. p. Furthermore, heifers with the shortest productive life of < 12 months had the significantly lowest (p < 0.0001) cholesterol concentrations 28 days ante partum (a. p.) and p. p. The data showed that heifers with a short productive life had a tendency for lower back fat thickness, tendencially lower oestradiol concentrations 10 days a. p., a trend to lower fertility (regarding inseminations per animal) and an increased incidence of mastitis, stillbirths and endometritis. The lowest albumin and cholesterol concentrations of the heifers with a short productive life arose from an inadequate food intake. Oestradiol concentration also decreased during the state of energy deficiency. The low oestradiol concentrations 10 days a. p. can lead to repeated stillbirths in such heifers, and this increased the number of clinical endometritis. Furthermore, the low milk yield corresponded with an energy deficiency in these heifers. These results were supported by the low back fat thickness of these animals, which consequently led to poor fertility. As a consequence, for a longer productive life, special attention should be paid to heifers during the periparturient period, in particular focusing on their food intake and body condition.

Verifying Digital Components of Physical Systems: Experimental Evaluation of Test Quality

NASA Astrophysics Data System (ADS)

Laputenko, A. V.; López, J. E.; Yevtushenko, N. V.

2018-03-01

This paper continues the study of high quality test derivation for verifying digital components which are used in various physical systems; those are sensors, data transfer components, etc. We have used logic circuits b01-b010 of the package of ITC'99 benchmarks (Second Release) for experimental evaluation which as stated before, describe digital components of physical systems designed for various applications. Test sequences are derived for detecting the most known faults of the reference logic circuit using three different approaches to test derivation. Three widely used fault types such as stuck-at-faults, bridges, and faults which slightly modify the behavior of one gate are considered as possible faults of the reference behavior. The most interesting test sequences are short test sequences that can provide appropriate guarantees after testing, and thus, we experimentally study various approaches to the derivation of the so-called complete test suites which detect all fault types. In the first series of experiments, we compare two approaches for deriving complete test suites. In the first approach, a shortest test sequence is derived for testing each fault. In the second approach, a test sequence is pseudo-randomly generated by the use of an appropriate software for logic synthesis and verification (ABC system in our study) and thus, can be longer. However, after deleting sequences detecting the same set of faults, a test suite returned by the second approach is shorter. The latter underlines the fact that in many cases it is useless to spend `time and efforts' for deriving a shortest distinguishing sequence; it is better to use the test minimization afterwards. The performed experiments also show that the use of only randomly generated test sequences is not very efficient since such sequences do not detect all the faults of any type. After reaching the fault coverage around 70%, saturation is observed, and the fault coverage cannot be increased anymore. For deriving high quality short test suites, the approach that is the combination of randomly generated sequences together with sequences which are aimed to detect faults not detected by random tests, allows to reach the good fault coverage using shortest test sequences.

Randomized shortest-path problems: two related models.

PubMed

Saerens, Marco; Achbany, Youssef; Fouss, François; Yen, Luh

2009-08-01

This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way, for instance, by minimizing the total travel cost-nothing particular up to now-you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some continual exploration of the network, avoid congestion, or avoid complete predictability of your routing strategy. In other words, you want to introduce some randomness or unpredictability in the routing policy (i.e., the routing policy is randomized). This problem, which will be called the randomized shortest-path problem (RSP), is investigated in this work. The global level of randomness of the routing policy is quantified by the expected Shannon entropy spread throughout the network and is provided a priori by the designer. Then, necessary conditions to compute the optimal randomized policy-minimizing the expected routing cost-are derived. Iterating these necessary conditions, reminiscent of Bellman's value iteration equations, allows computing an optimal policy, that is, a set of transition probabilities in each node. Interestingly and surprisingly enough, this first model, while formulated in a totally different framework, is equivalent to Akamatsu's model ( 1996 ), appearing in transportation science, for a special choice of the entropy constraint. We therefore revisit Akamatsu's model by recasting it into a sum-over-paths statistical physics formalism allowing easy derivation of all the quantities of interest in an elegant, unified way. For instance, it is shown that the unique optimal policy can be obtained by solving a simple linear system of equations. This second model is therefore more convincing because of its computational efficiency and soundness. Finally, simulation results obtained on simple, illustrative examples show that the models behave as expected.

Influence of different interfaces on synchrony during pressure support ventilation in a pediatric setting: a bench study.

PubMed

Conti, Giorgio; Gregoretti, Cesare; Spinazzola, Giorgia; Festa, Olimpia; Ferrone, Giuliano; Cipriani, Flora; Rossi, Marco; Piastra, Marco; Costa, Roberta

2015-04-01

In adults and children, patient-ventilator synchrony is strongly dependent on both the ventilator settings and interface used in applying positive pressure to the airway. The aim of this bench study was to determine whether different interfaces and ventilator settings may influence patient-ventilator interaction in pediatric models of normal and mixed obstructive and restrictive respiratory conditions. A test lung, connected to a pediatric mannequin using different interfaces (endotracheal tube [ETT], face mask, and helmet), was ventilated in pressure support ventilation mode testing 2 ventilator settings (pressurization time [Timepress]50%/cycling-off flow threshold [Trexp]25%, Timepress80%/Trexp60%), randomly applied. The test lung was set to simulate one pediatric patient with a healthy respiratory system and another with a mixed obstructive and restricted respiratory condition, at different breathing frequencies (f) (30, 40, and 50 breaths/min). We measured inspiratory trigger delay, pressurization time, expiratory trigger delay, and time of synchrony. At each breathing frequency, the helmet showed the longest inspiratory trigger delay compared with the ETT and face mask. At f30, the ETT had a reduced Tpress. The helmet had the shortest Tpress in the simulated child with a mixed obstructive and restricted respiratory condition, at f40 during Timepress50%/Trexp25% and at f50 during Timepress80%/Trexp60%. In the simulated child with a normal respiratory condition, the ETT presented the shortest Tpress value at f50 during Timepress80%/Trexp60%. Concerning the expiratory trigger delay, the helmet showed the best interaction at f30, but the worst at f40 and at f50. The helmet showed the shortest time of synchrony during all ventilator settings. The choice of the interface can influence patient-ventilator synchrony in a pediatric model breathing at increased f, thus making it more difficult to set the ventilator, particularly during noninvasive ventilation. The helmet demonstrated the worst interaction, suggesting that the face mask should be considered as the first choice for delivering noninvasive ventilation in a pediatric model. Copyright © 2015 by Daedalus Enterprises.

Assessing and ranking the flammability of some ornamental plant species to select firewise plants for landscaping in WUI (SE France).

NASA Astrophysics Data System (ADS)

Ganteaume, A.; Jappiot, M.; Lampin, C.

2012-04-01

The increasing urbanization of Wildland-Urban Interfaces (WUI) as well as the high fire occurrence in these areas requires the assessment and the ranking of the flammability of the ornamental vegetation surrounding houses especially that planted in hedges. Thus, the flammability of seven species, among those most frequently planted in hedges in Provence (South-Eastern France), were studied at particle level and at dead surface fuel level (litters) under laboratory conditions. The flammability parameters (ignition frequency, time-to-ignition, flaming duration) of the very fine particles (live leaves and particles <2 mm in diameter) were measured using an epiradiator as burning device. The flammability parameters (ignition frequency, time-to-ignition, flaming duration and initial flame propagation) of the undisturbed litter samples were recorded during burning experiments performed on fire bench. Burning experiments using the epiradiator showed that live leaves of Phyllostachys sp., Photinia frasei and Prunus laurocerasus had the shortest time-to-ignition and the highest ignition frequency and flaming duration whereas Pittosporum tobira and Nerium oleander were the longest to ignite with a low frequency. Phyllostachys sp. and Nerium oleander litters were the shortest to ignite while Prunus laurocerasus litter had the lowest bulk density and long time-to-ignition, but high flame propagation. Photinia fraseri litter ignited frequently and had a high flame spread while Pittosporum tobira litter ignited the least frequently and for the shortest duration. Cupressus sempervirens litter had the highest bulk density and the longest flaming duration but the lowest flame propagation. Pyracantha coccinea litter was the longest to ignite and flame propagation was low but lasted a long time. Hierarchical cluster analysis performed on the flammability parameters of live leaves and of litters ranked the seven species in four distinct clusters from the most flammable (Prunus laurocerasus and Pyracantha coccinea) to the least flammable (Pittosporum tobira and Nerium oleander); the other species displaying two groups of intermediate flammabilities (Phyllostachys sp.- Photinia fraseri and Cupressus sempervirens ). The species with highly flammable characteristics should not be used in hedges planted in WUIs in South-Eastern France.

Can interprofessional teamwork reduce patient throughput times? A longitudinal single-centre study of three different triage processes at a Swedish emergency department

PubMed Central

Masiello, Italo; Ponzer, Sari; Farrokhnia, Nasim

2018-01-01

Objective To determine the impact on emergency department (ED) throughput times and proportion of patients who leave without being seen by a physician (LWBS) of two triage interventions, where comprehensive nurse-led triage was first replaced by senior physician-led triage and then by interprofessional teamwork. Design Single-centre before-and-after study. Setting Adult ED of a Swedish urban hospital. Participants Patients arriving on weekdays 08:00 to 21:00 during three 1-year periods in the interval May 2012 to November 2015. A total of 185 806 arrivals were included. Interventions Senior physicians replaced triage nurses May 2013 to May 2014. Interprofessional teamwork replaced the triage process on weekdays 08:00 to 21:00 November 2014 to November 2015. Main outcome measures Primary outcomes were the median time to physician (TTP) and the median length of stay (LOS). Secondary outcome was the LWBS rate. Results The crude median LOS was shortest for teamwork, 228 min (95% CI 226.4 to 230.5) compared with 232 min (95% CI 230.8 to 233.9) for nurse-led and 250 min (95% CI 248.5 to 252.6) for physician-led triage. The adjusted LOS for the teamwork period was 16 min shorter than for nurse-led triage and 23 min shorter than for physician-led triage. The median TTP was shortest for physician-led triage, 56 min (95% CI 54.5 to 56.6) compared with 116 min (95% CI 114.4 to 117.5) for nurse-led triage and 74 min (95% CI 72.7 to 74.8) for teamwork. The LWBS rate was 1.9% for nurse-led triage, 1.2% for physician-led triage and 3.2% for teamwork. All outcome measure differences had two-tailed p values<0.01. Conclusions Interprofessional teamwork had the shortest length of stay, a shorter time to physician than nurse-led triage, but a higher LWBS rate. Interprofessional teamwork may be a useful approach to reducing ED throughput times. PMID:29674366

What role do plain radiographs have in assessing the skeletally immature acromioclavicular joint?

PubMed

Lee, Seung Yeol; Kwon, Soon-Sun; Chung, Chin Youb; Lee, Kyoung Min; Park, Moon Seok

2014-01-01

Because of incomplete ossification of the coracoid process and acromion, acromioclavicular joint configuration in the skeletally immature patient differs from that of adults. Although comparison to radiographic standards for this joint is critical in the evaluation of acromioclavicular joint injuries, these standards are not well defined for children or adolescents. We therefore sought to determine (1) the reliability of numerous radiographic measurements of the skeletally immature acromioclavicular joint, including the vertical and shortest coracoclavicular interval, and the acromioclavicular joint offset; (2) the timing of ossification of the acromion and coracoid in males and females; and (3) the differences in the values of these radiographic measurements based on age and sex. This study was based on a total of 485 subjects, 8 to 18 years old, who underwent conventional AP view radiographs of both shoulders. The 485 subjects were included to assess normal configuration around the acromioclavicular joint and 466 of these subjects were evaluated for comparison between both sides. The vertical and shortest coracoclavicular interval, coracoclavicular clavicle width ratio, acromioclavicular joint offset, and difference of the coracoclavicular interval of both sides were measured. A reliability test was conducted before obtaining the main measurements. The relationship of measurements with sex, age, and stage of ossification was evaluated. The vertical and shortest coracoclavicular interval showed excellent reliability (intraclass correlation coefficient ([ICC], 0.918 and 0.934). The acromioclavicular joint offset showed low reliability (ICC, 0.543). The ossification centers of the acromion and the coracoid processes appeared and fused earlier in females than in males. The vertical coracoclavicular interval, which was not affected by partial ossification of the coracoid process, was less than 11 mm in the 90% quantile of total subjects in males and 10 mm in the 90% quantile in females. The difference of the vertical coracoclavicular interval of both sides was less than 50% in 436 of 466 (93.4%) patients. The vertical coracoclavicular interval was the best parameter to assess acromioclavicular joint dislocation in skeletally immature patients. Comparison of both sides of the acromioclavicular joint could help to inform physicians in predicting the need for additional evaluations.

Admission rate and characteristics of hospitalized systemic connective tissue disorders: analysis from a nationwide Thailand healthcare database.

PubMed

Foocharoen, Chingching; Thavornpitak, Yupa; Mahakkanukrauh, Ajanee; Suwannaroj, Siraphop; Nanagara, Ratanavadee

2013-02-01

Reports of hospitalized systemic connective tissue disorders (SCNTD) are mostly disease-specific reports from institutional databases. To clarify the admission rate, disease determination, hospital mortality rate, length of stay and hospital charges among hospitalized patients diagnosed with SCNTD. The data were extracted from the 2010 national database of hospitalized patients provided by the Thai Health Coding Center, Bureau of Policy and Strategy, Ministry of Public Health, Thailand. Patients over 18 years having International Classification of Diseases (ICD)-10 codes for a primary diagnosis related to SCNTD were included. There were 6861 admissions coded as disorders related to SCNTD during the fiscal year 2010. The admission rate was 141 per 100,000 admissions. Among these, systemic lupus erythematosus (SLE) was the most common, followed by systemic sclerosis (SSc) and dermatomyositis/polymyositis (DM-PM). The overall mean length of hospital stay was 6.8 days. Small vessel vasculitis and Sjögren syndrome had the longest and the shortest hospital stays respectively (14.5 vs. 5.3 days). Hospital charges were highest among systemic vasculitis and DM-PM patients. The admission rate for SCNTD in Thailand was 141 per 100,000 admissions among which SLE was the most common. Overall hospital mortality was 4.1%. Although a lower prevalence was found among systemic vasculitis, it had a higher mortality rate, longer length of stay and greater therapeutic cost. © 2013 The Authors International Journal of Rheumatic Diseases © 2013 Asia Pacific League of Associations for Rheumatology and Wiley Publishing Asia Pty Ltd.

Evidence of Probabilistic Behaviour in Protein Interaction Networks

DTIC Science & Technology

2008-01-31

Evidence of degree-weighted connectivity in nine PPI networks. a, Homo sapiens (human); b, Drosophila melanogaster (fruit fly); c-e, Saccharomyces...illustrates maps for the networks of Homo sapiens and Dro- sophila melanogaster, while maps for the remaining net- works are provided in Additional file 2. As...protein-protein interaction networks. a, Homo sapiens ; b, Drosophila melanogaster. Distances shown as average shortest path lengths L(k1, k2) between

Visual Cues Contribute Differentially to Audiovisual Perception of Consonants and Vowels in Improving Recognition and Reducing Cognitive Demands in Listeners with Hearing Impairment Using Hearing Aids

ERIC Educational Resources Information Center

Moradi, Shahram; Lidestam, Bjorn; Danielsson, Henrik; Ng, Elaine Hoi Ning; Ronnberg, Jerker

2017-01-01

Purpose: We sought to examine the contribution of visual cues in audiovisual identification of consonants and vowels--in terms of isolation points (the shortest time required for correct identification of a speech stimulus), accuracy, and cognitive demands--in listeners with hearing impairment using hearing aids. Method: The study comprised 199…

"This Is My Body Which Will Be Given up for You": Federico Garcia Lorca's "Amor de Don Perlimplin" and the "Auto Sacramental" Tradition

ERIC Educational Resources Information Center

Badenes, Jose Ignacio

2009-01-01

"Amor de Don Perlimplin con Belisa en su jardin" is one of Federico Garcia Lorca's shortest plays as well as one of his deepest. Its theme is love, particularly the interaction between spiritual longing and carnal desire, body and soul, humanity and divinity. These are aspects found in Roman Catholic Eucharistic theology which the…

Female Flight Propensity and Capability in Lymantria dispar (Lepidoptera: Lymantriidae) from Russia, North America, and Their Reciprocal F1 Hybrids

Treesearch

M.A. Keena

2001-01-01

In the laboratory, the timing of both preflight and flight behaviors of the Asian strain of female gypsy moths, Lymantria dispar L., was regulated primarily by light intensity. The shortest times to initiation of wing fanning and flight occurred at 0.1 lux, the lowest light intensity evaluated. A gradual decrease in light intensity, compared with an instantaneous...

Current Trends in Metric Conversion in the United States: Potential Trouble for National Defense.

DTIC Science & Technology

1980-05-01

measures in the United States appears inevitable, but is being prolonged due to present legisla- *tion which allows each industrial sector to convert...centralized government planning and leadership toward metrication in the shortest possible time. II. Problem: Spurred by the automotive industry , voluntary...conversion among major U.S. industries is snowballing while public resistance to met- rication is stiffening. This confrontation threatens to

The Effectiveness of Articulation and Transfer Agreements between Missouri Community Colleges and Universities in Promoting the Successful Completion of a Four-Year Degree

ERIC Educational Resources Information Center

Perkins, Katherine S.

2010-01-01

American community colleges have become important in the pursuit of a four-year degree. The state of Missouri established an Associates of Arts degree and the 42-hour general education block option to assist students with transfer and degree completion in the shortest time possible (Coordinating Board for Higher Education, 2000). If articulation…

Modeling Network Interdiction Tasks

DTIC Science & Technology

2015-09-17

they may attack the flaw to cause widespread chaos. Attacks such as these are considered a form of network interdiction. Assessing the networks over...and forms a foundation for the techniques of the measures and models approaches of the research framework, which is depicted in Figure 2. The...ensures the distance of the shortest (i, j) path is computed. This insight is attributed to Warshall [62]. The algorithm’s present form is attributed

First Time Authentication for Airborne Networks (FAAN)

DTIC Science & Technology

2010-01-01

21] “An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations”, D Chaum , J-H Evertse, J van de Graaf...System Sciences, p. 1-9, 1998. [5] D . Micciancio, The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant, Proc. 39th...1999. [7] D . Micciancio and E. Petrank, Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol, Proceedings of Advances in

Network Design for Reliability and Resilience to Attack

DTIC Science & Technology

2014-03-01

attacker can destroy n arcs in the network SPNI Shortest-Path Network-Interdiction problem TSP Traveling Salesman Problem UB upper bound UKR Ukraine...elimination from the traveling salesman problem (TSP). Literature calls a walk that does not contain a cycle a path [19]. The objective function in...arc lengths as random variables with known probability distributions. The m-median problem seeks to design a network with minimum average travel cost

Ceramic tools insert assesment based on vickers indentation methodology

NASA Astrophysics Data System (ADS)

Husni; Rizal, Muhammad; Aziz M, M.; Wahyu, M.

2018-05-01

In the interrupted cutting process, the risk of tool chipping or fracture is higher than continues cutting. Therefore, the selection of suitable ceramic tools for interrupted cutting application become an important issue to assure that the cutting process is running effectively. At present, the performance of ceramics tools is assessed by conducting some cutting tests, which is required time and cost consuming. In this study, the performance of ceramic tools evaluated using hardness tester machine. The technique, in general, has a certain advantage compare with the more conventional methods; the experimental is straightforward involving minimal specimen preparation and the amount of material needed is small. Three types of ceramic tools AS10, CC650 and K090 have been used, each tool was polished then Vickers indentation test were performed with the load were 0.2, 0.5, 1, 2.5, 5 and 10 kgf. The results revealed that among the load used in the tests, the indentation loads of 5 kgf always produce well cracks as compared with others. Among the cutting tool used in the tests, AS10 has produced the shortest crack length and follow by CC 670, and K090. It is indicated that the shortest crack length of AS10 reflected that the tool has a highest dynamic load resistance among others insert.

Biomarker Identification for Prostate Cancer and Lymph Node Metastasis from Microarray Data and Protein Interaction Network Using Gene Prioritization Method

PubMed Central

Arias, Carlos Roberto; Yeh, Hsiang-Yuan; Soo, Von-Wun

2012-01-01

Finding a genetic disease-related gene is not a trivial task. Therefore, computational methods are needed to present clues to the biomedical community to explore genes that are more likely to be related to a specific disease as biomarker. We present biomarker identification problem using gene prioritization method called gene prioritization from microarray data based on shortest paths, extended with structural and biological properties and edge flux using voting scheme (GP-MIDAS-VXEF). The method is based on finding relevant interactions on protein interaction networks, then scoring the genes using shortest paths and topological analysis, integrating the results using a voting scheme and a biological boosting. We applied two experiments, one is prostate primary and normal samples and the other is prostate primary tumor with and without lymph nodes metastasis. We used 137 truly prostate cancer genes as benchmark. In the first experiment, GP-MIDAS-VXEF outperforms all the other state-of-the-art methods in the benchmark by retrieving the truest related genes from the candidate set in the top 50 scores found. We applied the same technique to infer the significant biomarkers in prostate cancer with lymph nodes metastasis which is not established well. PMID:22654636

Ubiquitous Emergency Medical Service System Based on Wireless Biosensors, Traffic Information, and Wireless Communication Technologies: Development and Evaluation

PubMed Central

Tan, Tan-Hsu; Gochoo, Munkhjargal; Chen, Yung-Fu; Hu, Jin-Jia; Chiang, John Y.; Chang, Ching-Su; Lee, Ming-Huei; Hsu, Yung-Nian; Hsu, Jiin-Chyr

2017-01-01

This study presents a new ubiquitous emergency medical service system (UEMS) that consists of a ubiquitous tele-diagnosis interface and a traffic guiding subsystem. The UEMS addresses unresolved issues of emergency medical services by managing the sensor wires for eliminating inconvenience for both patients and paramedics in an ambulance, providing ubiquitous accessibility of patients’ biosignals in remote areas where the ambulance cannot arrive directly, and offering availability of real-time traffic information which can make the ambulance reach the destination within the shortest time. In the proposed system, patient’s biosignals and real-time video, acquired by wireless biosensors and a webcam, can be simultaneously transmitted to an emergency room for pre-hospital treatment via WiMax/3.5 G networks. Performances of WiMax and 3.5 G, in terms of initialization time, data rate, and average end-to-end delay are evaluated and compared. A driver can choose the route of the shortest time among the suggested routes by Google Maps after inspecting the current traffic conditions based on real-time CCTV camera streams and traffic information. The destination address can be inputted vocally for easiness and safety in driving. A series of field test results validates the feasibility of the proposed system for application in real-life scenarios. PMID:28117724

Ubiquitous Emergency Medical Service System Based on Wireless Biosensors, Traffic Information, and Wireless Communication Technologies: Development and Evaluation.

PubMed

Tan, Tan-Hsu; Gochoo, Munkhjargal; Chen, Yung-Fu; Hu, Jin-Jia; Chiang, John Y; Chang, Ching-Su; Lee, Ming-Huei; Hsu, Yung-Nian; Hsu, Jiin-Chyr

2017-01-21

This study presents a new ubiquitous emergency medical service system (UEMS) that consists of a ubiquitous tele-diagnosis interface and a traffic guiding subsystem. The UEMS addresses unresolved issues of emergency medical services by managing the sensor wires for eliminating inconvenience for both patients and paramedics in an ambulance, providing ubiquitous accessibility of patients' biosignals in remote areas where the ambulance cannot arrive directly, and offering availability of real-time traffic information which can make the ambulance reach the destination within the shortest time. In the proposed system, patient's biosignals and real-time video, acquired by wireless biosensors and a webcam, can be simultaneously transmitted to an emergency room for pre-hospital treatment via WiMax/3.5 G networks. Performances of WiMax and 3.5 G, in terms of initialization time, data rate, and average end-to-end delay are evaluated and compared. A driver can choose the route of the shortest time among the suggested routes by Google Maps after inspecting the current traffic conditions based on real-time CCTV camera streams and traffic information. The destination address can be inputted vocally for easiness and safety in driving. A series of field test results validates the feasibility of the proposed system for application in real-life scenarios.

Applications of Temporal Graph Metrics to Real-World Networks

NASA Astrophysics Data System (ADS)

Tang, John; Leontiadis, Ilias; Scellato, Salvatore; Nicosia, Vincenzo; Mascolo, Cecilia; Musolesi, Mirco; Latora, Vito

Real world networks exhibit rich temporal information: friends are added and removed over time in online social networks; the seasons dictate the predator-prey relationship in food webs; and the propagation of a virus depends on the network of human contacts throughout the day. Recent studies have demonstrated that static network analysis is perhaps unsuitable in the study of real world network since static paths ignore time order, which, in turn, results in static shortest paths overestimating available links and underestimating their true corresponding lengths. Temporal extensions to centrality and efficiency metrics based on temporal shortest paths have also been proposed. Firstly, we analyse the roles of key individuals of a corporate network ranked according to temporal centrality within the context of a bankruptcy scandal; secondly, we present how such temporal metrics can be used to study the robustness of temporal networks in presence of random errors and intelligent attacks; thirdly, we study containment schemes for mobile phone malware which can spread via short range radio, similar to biological viruses; finally, we study how the temporal network structure of human interactions can be exploited to effectively immunise human populations. Through these applications we demonstrate that temporal metrics provide a more accurate and effective analysis of real-world networks compared to their static counterparts.

Use of graph algorithms in the processing and analysis of images with focus on the biomedical data.

PubMed

Zdimalova, M; Roznovjak, R; Weismann, P; El Falougy, H; Kubikova, E

2017-01-01

Image segmentation is a known problem in the field of image processing. A great number of methods based on different approaches to this issue was created. One of these approaches utilizes the findings of the graph theory. Our work focuses on segmentation using shortest paths in a graph. Specifically, we deal with methods of "Intelligent Scissors," which use Dijkstra's algorithm to find the shortest paths. We created a new software in Microsoft Visual Studio 2013 integrated development environment Visual C++ in the language C++/CLI. We created a format application with a graphical users development environment for system Windows, with using the platform .Net (version 4.5). The program was used for handling and processing the original medical data. The major disadvantage of the method of "Intelligent Scissors" is the computational time length of Dijkstra's algorithm. However, after the implementation of a more efficient priority queue, this problem could be alleviated. The main advantage of this method we see in training that enables to adapt to a particular kind of edge, which we need to segment. The user involvement has a significant influence on the process of segmentation, which enormously aids to achieve high-quality results (Fig. 7, Ref. 13).

Identification of novel candidate drivers connecting different dysfunctional levels for lung adenocarcinoma using protein-protein interactions and a shortest path approach

NASA Astrophysics Data System (ADS)

Chen, Lei; Huang, Tao; Zhang, Yu-Hang; Jiang, Yang; Zheng, Mingyue; Cai, Yu-Dong

2016-07-01

Tumors are formed by the abnormal proliferation of somatic cells with disordered growth regulation under the influence of tumorigenic factors. Recently, the theory of “cancer drivers” connects tumor initiation with several specific mutations in the so-called cancer driver genes. According to the differentiation of four basic levels between tumor and adjacent normal tissues, the cancer drivers can be divided into the following: (1) Methylation level, (2) microRNA level, (3) mutation level, and (4) mRNA level. In this study, a computational method is proposed to identify novel lung adenocarcinoma drivers based on dysfunctional genes on the methylation, microRNA, mutation and mRNA levels. First, a large network was constructed using protein-protein interactions. Next, we searched all of the shortest paths connecting dysfunctional genes on different levels and extracted new candidate genes lying on these paths. Finally, the obtained candidate genes were filtered by a permutation test and an additional strict selection procedure involving a betweenness ratio and an interaction score. Several candidate genes remained, which are deemed to be related to two different levels of cancer. The analyses confirmed our assertions that some have the potential to contribute to the tumorigenesis process on multiple levels.

Be-safe travel, a web-based geographic application to explore safe-route in an area

NASA Astrophysics Data System (ADS)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

In large cities in developing countries, the various forms of criminality are often found. For instance, the most prominent crimes in Surabaya, Indonesia is 3C, that is theft with violence (curas), theft by weighting (curat), and motor vehicle theft (curanmor). 3C case most often occurs on the highway and residential areas. Therefore, new entrants in an area should be aware of these kind of crimes. Route Planners System or route planning system such as Google Maps only consider the shortest distance in the calculation of the optimal route. The selection of the optimal path in this study not only consider the shortest distance, but also involves other factors, namely the security level. This research considers at the need for an application to recommend the safest road to be passed by the vehicle passengers while drive an area. This research propose Be-Safe Travel, a web-based application using Google API that can be accessed by people who like to drive in an area, but still lack of knowledge of the pathways which are safe from crime. Be-Safe Travel is not only useful for the new entrants, but also useful for delivery courier of valuables goods to go through the safest streets.

Comparison on Promotion Effect of Various Types of Surfactants on HCFC-141b Hydrate Induction Time

NASA Astrophysics Data System (ADS)

Li, Juan; Sun, Zhigao; Liu, Chenggang; Zhu, Minggui

2018-03-01

Cold storage in air conditioning based on refrigerant hydrate is a new-type energy saving technology to reduce initial investment and running cost of air conditioning equipments and improve system stability. Refrigerant hydrate is generated under critical temperature and pressure condition, while surfactant is an effective medium to promote its phase equilibrium. In this paper, in order to research such promotion effect, different type of surfactants with unique mechanism, SDS, Tween80 and Span80, n-BA were selected to compare the respective impact on HCFC141b hydrate induction time based on temperature curve. Experimental results showed that no obvious change had been discovered when no surfactant was added into pure water system, which coincided with phase equilibrium diagram of HCFC141b. All the four kinds of surfactants had realized promotion effect to various degrees. For each hydration system, a large gap existed between the longest and the shortest induction time in 6 groups of parallel experiments, meaning relatively poor system stability. Under the combined effect of Tween80 (2wt%), Span80 (0.1wt%) and n-BA (0.1wt%), average and the shortest induction time was 20.9min and 17.5min respectively, corresponding to the best promotion effect.

Verification of Non-Invasive Blood Glucose Measurement Method Based on Pulse Wave Signal Detected by FBG Sensor System.

PubMed

Kurasawa, Shintaro; Koyama, Shouhei; Ishizawa, Hiroaki; Fujimoto, Keisaku; Chino, Shun

2017-11-23

This paper describes and verifies a non-invasive blood glucose measurement method using a fiber Bragg grating (FBG) sensor system. The FBG sensor is installed on the radial artery, and the strain (pulse wave) that is propagated from the heartbeat is measured. The measured pulse wave signal was used as a collection of feature vectors for multivariate analysis aiming to determine the blood glucose level. The time axis of the pulse wave signal was normalized by two signal processing methods: the shortest-time-cut process and 1-s-normalization process. The measurement accuracy of the calculated blood glucose level was compared with the accuracy of these signal processing methods. It was impossible to calculate a blood glucose level exceeding 200 mg/dL in the calibration curve that was constructed by the shortest-time-cut process. In the 1-s-normalization process, the measurement accuracy of the blood glucose level was improved, and a blood glucose level exceeding 200 mg/dL could be calculated. By verifying the loading vector of each calibration curve to calculate the blood glucose level with a high measurement accuracy, we found the gradient of the peak of the pulse wave at the acceleration plethysmogram greatly affected.

Machine learning framework for analysis of transport through complex networks in porous, granular media: A focus on permeability

NASA Astrophysics Data System (ADS)

van der Linden, Joost H.; Narsilio, Guillermo A.; Tordesillas, Antoinette

2016-08-01

We present a data-driven framework to study the relationship between fluid flow at the macroscale and the internal pore structure, across the micro- and mesoscales, in porous, granular media. Sphere packings with varying particle size distribution and confining pressure are generated using the discrete element method. For each sample, a finite element analysis of the fluid flow is performed to compute the permeability. We construct a pore network and a particle contact network to quantify the connectivity of the pores and particles across the mesoscopic spatial scales. Machine learning techniques for feature selection are employed to identify sets of microstructural properties and multiscale complex network features that optimally characterize permeability. We find a linear correlation (in log-log scale) between permeability and the average closeness centrality of the weighted pore network. With the pore network links weighted by the local conductance, the average closeness centrality represents a multiscale measure of efficiency of flow through the pore network in terms of the mean geodesic distance (or shortest path) between all pore bodies in the pore network. Specifically, this study objectively quantifies a hypothesized link between high permeability and efficient shortest paths that thread through relatively large pore bodies connected to each other by high conductance pore throats, embodying connectivity and pore structure.

Solving fuzzy shortest path problem by genetic algorithm

NASA Astrophysics Data System (ADS)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

Structure and function of photosystem I–[FeFe] hydrogenase protein fusions: An all-atom molecular dynamics study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Harris, Bradley J.; Cheng, Xiaolin; Frymier, Paul

2015-12-15

All-atom molecular dynamics (MD) simulation was used to study the solution dynamics and protein protein interactions of protein fusions of photosystem I (PSI) from Thermosynechococcus elongatus and an [FeFe]-hydrogenase (FeFe H 2ase) from Clostridium pasteurianum, a unique complex capable of photocatalytic hydrogen production. This study involved fusions of these two proteins via dithiol linkers of different length including decanedithiol, octanedithiol, and hexanedithiol, for which experimental data had previously been obtained. Evaluation of root-mean-squared deviations (RMSDs) relative to the respective crystal structures of PSI and the FeFe H 2ase shows that these fusion complexes approach stable equilibrium conformations during the MDmore » simulations. Investigating protein mobility via root-mean-squared fluctuations (RMSFs) reveals that tethering via the shortest hexanedithiol linker results in increased atomic fluctuations of both PSI and the hydrogenase in these fusion complexes. Furthermore, evaluation of the inter- and intraprotein electron transfer distances in these fusion complexes indicates that the structural changes in the FeFe H 2ase arising from ligation to PSI via the shortest hexanedithiol linker may hinder electron transport in the hydrogenase, thus providing a molecular level explanation for the observation that the medium-length octanedithiol linker gives the highest hydrogen production rate.« less

Anomaly detection of flight routes through optimal waypoint

NASA Astrophysics Data System (ADS)

Pusadan, M. Y.; Buliali, J. L.; Ginardi, R. V. H.

2017-01-01

Deciding factor of flight, one of them is the flight route. Flight route determined by coordinate (latitude and longitude). flight routed is determined by its coordinates (latitude and longitude) as defined is waypoint. anomaly occurs, if the aircraft is flying outside the specified waypoint area. In the case of flight data, anomalies occur by identifying problems of the flight route based on data ADS-B. This study has an aim of to determine the optimal waypoints of the flight route. The proposed methods: i) Agglomerative Hierarchical Clustering (AHC) in several segments based on range area coordinates (latitude and longitude) in every waypoint; ii) The coefficient cophenetics correlation (c) to determine the correlation between the members in each cluster; iii) cubic spline interpolation as a graphic representation of the has connected between the coordinates on every waypoint; and iv). Euclidean distance to measure distances between waypoints with 2 centroid result of clustering AHC. The experiment results are value of coefficient cophenetics correlation (c): 0,691≤ c ≤ 0974, five segments the generated of the range area waypoint coordinates, and the shortest and longest distance between the centroid with waypoint are 0.46 and 2.18. Thus, concluded that the shortest distance is used as the reference coordinates of optimal waypoint, and farthest distance can be indicated potentially detected anomaly.

Cortical Effects on Ipsilateral Hindlimb Muscles Revealed with Stimulus-Triggered Averaging of EMG Activity

PubMed Central

Messamore, William G.; Van Acker, Gustaf M.; Hudson, Heather M.; Zhang, Hongyu Y.; Kovac, Anthony; Nazzaro, Jules; Cheney, Paul D.

2016-01-01

While a large body of evidence supports the view that ipsilateral motor cortex may make an important contribution to normal movements and to recovery of function following cortical injury (Chollet et al. 1991; Fisher 1992; Caramia et al. 2000; Feydy et al. 2002), relatively little is known about the properties of output from motor cortex to ipsilateral muscles. Our aim in this study was to characterize the organization of output effects on hindlimb muscles from ipsilateral motor cortex using stimulus-triggered averaging of EMG activity. Stimulus-triggered averages of EMG activity were computed from microstimuli applied at 60–120 μA to sites in both contralateral and ipsilateral M1 of macaque monkeys during the performance of a hindlimb push–pull task. Although the poststimulus effects (PStEs) from ipsilateral M1 were fewer in number and substantially weaker, clear and consistent effects were obtained at an intensity of 120 μA. The mean onset latency of ipsilateral poststimulus facilitation was longer than contralateral effects by an average of 0.7 ms. However, the shortest latency effects in ipsilateral muscles were as short as the shortest latency effects in the corresponding contralateral muscles suggesting a minimal synaptic linkage that is equally direct in both cases. PMID:26088970

ɛ-mechanism driven pulsations in hot subdwarf stars with mixed H-He atmospheres

NASA Astrophysics Data System (ADS)

Battich, Tiara; Miller Bertolami, Marcelo M.; Córsico, Alejandro H.; Althaus, Leandro G.

2017-12-01

The ɛ mechanism is a self-excitation mechanism of stellar pulsations which acts in regions where nuclear burning takes place. It has been shown that the ɛ mechanism can excite pulsations in hot pre-horizontal branch stars before they settle into the stable helium core-burning phase and that the shortest periods of LS IV-14º116 could be explained that way.We aim to study the ɛ mechanism in stellar models appropriate for hot pre-horizontal branch stars to predict their pulsational properties.We perform detailed computations of non-adiabatic non-radial pulsations on such stellar models.We predict a new instability domain of long-period gravity modes in the log g - log Teff plane at roughly 22000 K ≲ Teff ≲ 50000 K and 4.67 ≲ log g ≲ 6.15, with a period range from 200 to 2000 s. Comparison with the three known pulsating He-rich subdwarfs shows that the ɛ mechanism can excite pulsations in models with similar surface properties except for modes with the shortest observed periods. Based on simple estimates we expect at least 3 stars in the current samples of hot-subdwarf stars to be pulsating by the ɛ mechanism. Our results could constitute a theoretical basis for future searches of pulsators in the Galactic field.

Comparison of skin permeability for three diclofenac topical formulations: an in vitro study.

PubMed

Folzer, E; Gonzalez, D; Singh, R; Derendorf, H

2014-01-01

Diclofenac is a hydrophilic non-steroidal anti-inflammatory drug (NSAID) widely used in humans and animals. There are limited published studies evaluating diclofenac's skin permeation following topical administration. The aim of our study was to evaluate and compare the in vitro permeation of three different diclofenac-containing formulations (patch, gel, solution) over 24 hours. These formulations were applied (n = 6 per formulation) to pig skin sandwiched between the two chambers in a static Franz diffusion cell and aliquots from the receptor medium were sampled at pre-defined time points. An HPLC method with UV detection was developed and validated with the aim of characterizing the transepidermal penetration in the in vitro system. Using this assay to determine the permeation parameters, results at 24 hours showed that the Flector patch released the highest drug amount (54.6%), whereas a lower drug amount was delivered with the Voltaren Emulgel (38.2%) and the solution (34.4%). The commercial gel showed the highest flux (39.9 +/- 0.9 microg/cm2/h) and the shortest lag-time (1.97 +/- 0.02 h). Based on these in vitro results using pig skin, the transdermal patch resulted in a long-lasting controlled release of diclofenac, while the gel had the shortest lag-time.

Implications of driving patterns on well-to-wheel performance of plug-in hybrid electric vehicles.

PubMed

Raykin, Leon; MacLean, Heather L; Roorda, Matthew J

2012-06-05

This study examines how driving patterns (distance and conditions) and the electricity generation supply interact to impact well-to-wheel (WTW) energy use and greenhouse gas (GHG) emissions of plug-in hybrid electric vehicles (PHEVs). The WTW performance of a PHEV is compared with that of a similar (nonplug-in) gasoline hybrid electric vehicle and internal combustion engine vehicle (ICEV). Driving PHEVs for short distances between recharging generally results in lower WTW total and fossil energy use and GHG emissions per kilometer compared to driving long distances, but the extent of the reductions depends on the electricity supply. For example, the shortest driving pattern in this study with hydroelectricity uses 81% less fossil energy than the longest driving pattern. However, the shortest driving pattern with coal-based electricity uses only 28% less fossil energy. Similar trends are observed in reductions relative to the nonplug-in vehicles. Irrespective of the electricity supply, PHEVs result in greater reductions in WTW energy use and GHG emissions relative to ICEVs for city than highway driving conditions. PHEVs charging from coal facilities only reduce WTW energy use and GHG emissions relative to ICEVs for certain favorable driving conditions. The study results have implications for environmentally beneficial PHEV adoption and usage patterns.

Real-time endovascular guidewire position simulation using shortest path algorithms.

PubMed

Schafer, Sebastian; Singh, Vikas; Noël, Peter B; Walczak, Alan M; Xu, Jinhui; Hoffmann, Kenneth R

2009-11-01

Treatment of vascular disease often involves endovascular interventions which use the vascular system for delivering treatment devices via a previously inserted guidewire to the diseased site. Previous studies show relative reproducibility of guidewire position after insertion, indicating that the guidewire position is constrained and could be represented by an energy minimization approach. Such representation would support the surgeon's decision process in guidewire selection. In this paper, we determine the guidewire position using a k-level graph based on 3D vessel information. Guidewire properties are incorporated into the graph as edge weights given by the local bending energy related to the local bending angle. The optimal path through this weighted directed graph is determined using a shortest path algorithm. Volumetric data of two different internal carotid artery phantoms (Ø 3.5-4.6 mm) was acquired. Two guidewires (Ø 0.33 mm) of different material properties (stainless steel, plastic-coated steel core) were inserted into the phantoms. The average RMS distance between actual and simulated guidewire positions varies from 0.9 mm (plastic coated) to 1.3 mm (stainless steel); the computation time to determine the position was <2s. The results indicate that the proposed technique yields reproducible and accurate guidewire positions within a short, clinically relevant time frame. These calculated positions may be useful in facilitating neurovascular interventions.

Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained K-Shortest Path Graph Algorithm.

PubMed

Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing

2014-01-01

Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.

Comparative advantage between traditional and smart navigation systems

NASA Astrophysics Data System (ADS)

Shin, Jeongkyu; Kim, Pan-Jun; Kim, Seunghwan

2013-03-01

The smart navigation system that refers to real-time traffic data is believed to be superior to traditional navigation systems. To verify this belief, we created an agent-based traffic model and examined the effect of changing market share of the traditional shortest-travel-time algorithm based navigation and the smart navigation system. We tested our model on the grid and actual metropolitan road network structures. The result reveals that the traditional navigation system have better performance than the smart one as the market share of the smart navigation system exceeds a critical value, which is contrary to conventional expectation. We suggest that the superiority inversion between agent groups is strongly related to the traffic weight function form, and is general. We also found that the relationship of market share, traffic flow density and travel time is determined by the combination of congestion avoidance behavior of the smartly navigated agents and the inefficiency of shortest-travel-time based navigated agents. Our results can be interpreted with the minority game and extended to the diverse topics of opinion dynamics. This work was supported by the Original Technology Research Program for Brain Science through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology(No. 2010-0018847).

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.

PubMed

Faigl, Jan

2016-01-01

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to "see" the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.

An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters

NASA Astrophysics Data System (ADS)

Ramadhani, T.; Hertono, G. F.; Handari, B. D.

2017-07-01

The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and finish in a single city (depot) will be determined. If there is more than one depot and salesmen start from and return to the same depot, then the problem is called Fixed Destination Multi-depot Multiple Traveling Salesman Problem (MMTSP). In this paper, MMTSP will be solved using the Ant Colony Optimization (ACO) algorithm. ACO is a metaheuristic optimization algorithm which is derived from the behavior of ants in finding the shortest route(s) from the anthill to a form of nourishment. In solving the MMTSP, the algorithm is observed with respect to different chosen cities as depots and non-randomly three parameters of MMTSP: m, K, L, those represents the number of salesmen, the fewest cities that must be visited by a salesman, and the most number of cities that can be visited by a salesman, respectively. The implementation is observed with four dataset from TSPLIB. The results show that the different chosen cities as depots and the three parameters of MMTSP, in which m is the most important parameter, affect the solution.

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

PubMed Central

Faigl, Jan

2016-01-01

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning. PMID:27340395

Indoor Navigation Design Integrated with Smart Phones and Rfid Devices

NASA Astrophysics Data System (ADS)

Ortakci, Y.; Demiral, E.; Atila, U.; Karas, I. R.

2015-10-01

High rise, complex and huge buildings in the cities are almost like a small city with their tens of floors, hundreds of corridors and rooms and passages. Due to size and complexity of these buildings, people need guidance to find their way to the destination in these buildings. In this study, a mobile application is developed to visualize pedestrian's indoor position as 3D in their smartphone and RFID Technology is used to detect the position of pedestrian. While the pedestrian is walking on his/her way on the route, smartphone will guide the pedestrian by displaying the photos of indoor environment on the route. Along the tour, an RFID (Radio-Frequency Identification) device is integrated to the system. The pedestrian will carry the RFID device during his/her tour in the building. The RFID device will send the position data to the server directly in every two seconds periodically. On the other side, the pedestrian will just select the destination point in the mobile application on smartphone and sent the destination point to the server. The shortest path from the pedestrian position to the destination point is found out by the script on the server. This script also sends the environment photo of the first node on the acquired shortest path to the client as an indoor navigation module.

[Offspring quality and its related factors of different Brachionus calyciflorus clones].

PubMed

Dong, Lili; Xi, Yilong; Zhang, Lei

2006-12-01

This paper studied the neonate starvation-endurance duration of four Brachionus calyciflorus clones (Clone A, B, C and D) with different biochemical-genetic characteristics at 15 degrees C, 20 degrees C, 25 degrees C and 30 degrees C, and the relationships of this duration with the temperature and the body- and egg volumes of B. calyciflorus. The results showed that at 15 degrees C, the neonates of Clone B had the shortest starvation-endurance duration (45.67 h); at 20 degrees C and 25 degrees C, the neonates' starvation-endurance duration of Clone C was the longest, being 61.33 h and 72.01 h, respectively; while at 30 degrees C, this duration of Clone A was the longest (40.11 h). The neonates' starvation-endurance duration of Clone A was the longest at 15 degrees C, those of Clone B and C were the shortest at 30 degrees C, while that of Clone D decreased with raising temperature. The neonates' starvation-endurance duration of all the four clones was negatively correlated with temperature. There was a negative correlation between this duration of Clone A and its egg volume, and the reverse was true for Clone C. The neonates' starvation-endurance duration of Clone B and D was positively correlated with the body volume of rotifer mother.

Why Are Galaxies So Smooth?

NASA Image and Video Library

2009-04-30

This image from NASA's Spitzer Space Telescope shows the spiral galaxy NGC 2841, located about 46 million light-years from Earth in the constellation Ursa Major. The galaxy is helping astronomers solve one of the oldest puzzles in astronomy: Why do galaxies look so smooth, with stars sprinkled evenly throughout? An international team of astronomers has discovered that rivers of young stars flow from their hot, dense stellar nurseries, dispersing out to form large, smooth distributions. This image is a composite of three different wavelengths from Spitzer's infrared array camera. The shortest wavelengths are displayed inblue, and mostly show the older stars in NGC 2841, as well as foreground stars in our own Milky Way galaxy. The cooler areas are highlighted in red, and show the dusty, gaseous regions of the galaxy. Blue shows infrared light of 3.6 microns, green represents 4.5-micron light and red, 8.0-micron light. The contribution from starlight measured at 3.6 microns has been subtracted from the 8.0-micron data to enhance the visibility of the dust features.The shortest wavelengths are displayed inblue, and mostly show the older stars in NGC 2841, as well as foreground stars in our own Milky Way galaxy. http://photojournal.jpl.nasa.gov/catalog/PIA12001

Evidence for prehistoric origins of the G2019S mutation in the North African Berber population.

PubMed

Ben El Haj, Rafiqua; Salmi, Ayyoub; Regragui, Wafa; Moussa, Ahmed; Bouslam, Naima; Tibar, Houyam; Benomar, Ali; Yahyaoui, Mohamed; Bouhouche, Ahmed

2017-01-01

The most common cause of the monogenic form of Parkinson's disease known so far is the G2019S mutation of the leucine-rich repeat kinase 2 (LRRK2) gene. Its frequency varies greatly among ethnic groups and geographic regions ranging from less than 0.1% in Asia to 40% in North Africa. This mutation has three distinct haplotypes; haplotype 1 being the oldest and most common. Recent studies have dated haplotype 1 of the G2019S mutation to about 4000 years ago, but it remains controversial whether the mutation has a Near-Eastern or Moroccan-Berber ancestral origin. To decipher this evolutionary history, we genotyped 10 microsatellite markers spanning a region of 11.27 Mb in a total of 57 unrelated Moroccan PD patients carrying the G2019S mutation for which the Berber or Arab origin was established over 3 generations based on spoken language. We estimated the age of the most recent common ancestor for the 36 Arab-speaking and the 15 Berber-speaking G2019S carriers using the likelihood-based method with a mutation rate of 10-4. Data analysis suggests that the shortest haplotype originated in a patient of Berber ethnicity. The common founder was estimated to have lived 159 generations ago (95% CI 116-224) for Arab patients, and 200 generations ago (95% CI 123-348) for Berber patients. Then, 29 native North African males carrying the mutation were assessed for specific uniparental markers by sequencing the Y-chromosome (E-M81, E-M78, and M-267) and mitochondrial DNA (mtDNA) hypervariable regions (HV1 and HV2) to examine paternal and maternal contributions, respectively. Results showed that the autochthonous genetic component reached 76% for mtDNA (Eurasian and north African haplogroups) and 59% for the Y-chromosome (E-M81 and E-M78), suggesting that the G2019S mutation may have arisen in an autochthonous DNA pool. Therefore, we conclude that LRRK2 G2019S mutation most likely originated in a Berber founder who lived at least 5000 years ago (95% CI 3075-8700).

A graph-based system for network-vulnerability analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Swiler, L.P.; Phillips, C.

1998-06-01

This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks,more » broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

Towards a Multiscale Approach to Cybersecurity Modeling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hogan, Emilie A.; Hui, Peter SY; Choudhury, Sutanay

2013-11-12

We propose a multiscale approach to modeling cyber networks, with the goal of capturing a view of the network and overall situational awareness with respect to a few key properties--- connectivity, distance, and centrality--- for a system under an active attack. We focus on theoretical and algorithmic foundations of multiscale graphs, coming from an algorithmic perspective, with the goal of modeling cyber system defense as a specific use case scenario. We first define a notion of \\emph{multiscale} graphs, in contrast with their well-studied single-scale counterparts. We develop multiscale analogs of paths and distance metrics. As a simple, motivating example ofmore » a common metric, we present a multiscale analog of the all-pairs shortest-path problem, along with a multiscale analog of a well-known algorithm which solves it. From a cyber defense perspective, this metric might be used to model the distance from an attacker's position in the network to a sensitive machine. In addition, we investigate probabilistic models of connectivity. These models exploit the hierarchy to quantify the likelihood that sensitive targets might be reachable from compromised nodes. We believe that our novel multiscale approach to modeling cyber-physical systems will advance several aspects of cyber defense, specifically allowing for a more efficient and agile approach to defending these systems.« less

Energetically optimal travel across terrain: visualizations and a new metric of geographic distance with anthropological applications

NASA Astrophysics Data System (ADS)

Wood, Brian M.; Wood, Zoë J.

2006-01-01

We present a visualization and computation tool for modeling the caloric cost of pedestrian travel across three dimensional terrains. This tool is being used in ongoing archaeological research that analyzes how costs of locomotion affect the spatial distribution of trails and artifacts across archaeological landscapes. Throughout human history, traveling by foot has been the most common form of transportation, and therefore analyses of pedestrian travel costs are important for understanding prehistoric patterns of resource acquisition, migration, trade, and political interaction. Traditionally, archaeologists have measured geographic proximity based on "as the crow flies" distance. We propose new methods for terrain visualization and analysis based on measuring paths of least caloric expense, calculated using well established metabolic equations. Our approach provides a human centered metric of geographic closeness, and overcomes significant limitations of available Geographic Information System (GIS) software. We demonstrate such path computations and visualizations applied to archaeological research questions. Our system includes tools to visualize: energetic cost surfaces, comparisons of the elevation profiles of shortest paths versus least cost paths, and the display of paths of least caloric effort on Digital Elevation Models (DEMs). These analysis tools can be applied to calculate and visualize 1) likely locations of prehistoric trails and 2) expected ratios of raw material types to be recovered at archaeological sites.

Transit time of optical pulses propagating through a finite length medium.

PubMed

Bloemer, Mark; Myneni, Krishna; Centini, Marco; Scalora, Michael; D'Aguanno, Giuseppe

2002-05-01

We present experimental and theoretical results on the transit time of optical pulses propagating through bulk media of finite length, specifically GaAs and silica. The transit time of the peak of the pulse varies with the central wavelength due to the étalon effects caused by the reflectivity at the air/medium boundaries. For transform limited optical pulses, the transit time as a function of wavelength follows the transmittance spectrum, that is, the longest transit time occurs at the transmittance maxima where the cavity dwell time is the longest and the shortest transit time occurs at the transmittance minima. The results are dramatically different for chirped pulses obtained by modulating the injection current of a diode laser. The range in the transit times for chirped pulses is a factor of four times larger compared with transform limited pulses. In addition, the transit time for chirped pulses propagating through the GaAs sample is negative at certain wavelengths. Also, the transmitted pulse is not distorted. Although modulating the injection current of a diode laser is the most common method for generating optical pulses, to our knowledge this is the first reported observation of the transit time of these chirped optical pulses propagating through a simple étalon structure.

Nonperturbative theory of atom-surface interaction: corrections at short separations

NASA Astrophysics Data System (ADS)

Bordag, M.; Klimchitskaya, G. L.; Mostepanenko, V. M.

2018-02-01

The nonperturbative expressions for the free energy and force of interaction between a ground-state atom and a real-material surface at any temperature are presented. The transition to the Matsubara representation is performed, whereupon the comparison is made with the commonly used perturbative results based on the standard Lifshitz theory. It is shown that the Lifshitz formulas for the free energy and force of an atom-surface interaction follow from the nonperturbative ones in the lowest order of the small parameter. Numerical computations of the free energy and force for the atoms of He{\\hspace{0pt}}\\ast and Na interacting with a surface of an Au plate have been performed using the frequency-dependent dielectric permittivity of Au and highly accurate dynamic atomic polarizabilities in the framework of both the nonperturbative and perturbative theories. According to our results, the maximum deviations between the two theories are reached at the shortest atom-surface separations of about 1 nm. Simple analytic expressions for the atom-surface free energy are derived in the classical limit and for an ideal-metal plane. In the lowest order of the small parameter, they are found in agreement with the perturbative ones following from the standard Lifshitz theory. Possible applications of the obtained results in the theory of van der Waals adsorption are discussed.

Comparison of jump-landing protocols with Biodex Balance System as measures of dynamic postural stability in athletes.

PubMed

Krkeljas, Zarko

2017-07-21

The objective of the study was to determine whether a relationship exists between the two common methods for assessing postural stability in athletes: the time-to-stabilisation (TTS) via force-plate and the Biodex Balance System (BBS). The conditions under which these measurements assess dynamic postural control may not provide sufficient feedback to practitioners. Fourty-four amateur soccer players with no history of musculoskeletal disorders volunteered for the study. Pearson correlation was used to compare the anterior-posterior (AP), medio-lateral (ML), and the overall stability indexes measured by BBS, with the corresponding parameters of TTS assessed via force plate. There was no significant correlation between any parameters of dynamic stability measured by force-plate and the stability indexes. However, there was a significant correlation between the resulting vectors and the AP component of TTS for each jump protocol. Furthermore, forward drop landing exhibited shortest TTS in AP direction, while lateral drop landing resulted in longer ML TTS relative to both forward jumps (p < 0.001). These results demonstrate that the TTS and BBS stability indexes should be used as distinct measures of dynamic postural stability. TTS protocols may be modified to target a specific training conditions or athletic population.

Radiation damage in polymer films from grazing-incidence X-ray scattering measurements

DOE PAGES

Vaselabadi, Saeed Ahmadi; Shakarisaz, David; Ruchhoeft, Paul; ...

2016-02-16

Grazing-incidence X-ray scattering (GIXS) is widely used to analyze the crystallinity and nanoscale structure in thin polymer films. However, ionizing radiation will generate free radicals that initiate cross-linking and/or chain scission, and structural damage will impact the ordering kinetics, thermodynamics, and crystallinity in many polymers. We report a simple methodology to screen for beam damage that is based on lithographic principles: films are exposed to patterns of x-ray radiation, and changes in polymer structure are revealed by immersing the film in a solvent that dissolves the shortest chains. The experiments are implemented with high throughput using the standard beam linemore » instrumentation and a typical GIXS configuration. The extent of damage (at a fixed radiation dose) depends on a range of intrinsic material properties and experimental variables, including the polymer chemistry and molecular weight, exposure environment, film thickness, and angle of incidence. The solubility switch for common polymers is detected within 10-60 sec at ambient temperature, and we verified that this first indication of damage corresponds with the onset of network formation in glassy polystyrene and a loss of crystallinity in polyalkylthiophenes. Therefore, grazing-incidence x-ray patterning offers an efficient approach to determine the appropriate data acquisition times for any GIXS experiment.« less

Effects of steam-microwave blanching and different drying processes on drying characteristics and quality attributes of Thunbergia laurifolia Linn. leaves.

PubMed

Phahom, Traiphop; Phoungchandang, Singhanat; Kerr, William L

2017-08-01

Dried Thunbergia laurifolia leaves are usually prepared using tray drying, resulting in products that have lost substantial amounts of bioactive compounds and antioxidant activity. The maturity of the raw material, blanching techniques and drying methods were investigated in order to select the best condition to produce high qualities of dried T. laurifolia leaves. The 1st stage of maturity was selected and steam-microwave blanching (SMB) for 4 min was adequate for blanching leading to the maximum recovery of bioactive compounds. The modified Halsey model was the best desorption isotherm model. A new drying model proposed in this study was the best to fit the drying curves as compared to five common drying models. Moisture diffusivities were increased with the increase of drying temperature when combining SMB and heat pump-dehumidified drying. Microwave heat pump-dehumidified drying (MHPD) provided the shortest drying time, high specific moisture extraction rate (SMER) and could reduce drying time by 67.5% and increase caffeic acid and quercetin by 51.24% and 60.89%, respectively. MHPD was found to be the best drying method and provided the highest antioxidant activity and bioactive compounds content, high SMER and short drying time. © 2016 Society of Chemical Industry. © 2016 Society of Chemical Industry.

Multilevel Deficiency of White Matter Connectivity Networks in Alzheimer's Disease: A Diffusion MRI Study with DTI and HARDI Models.

PubMed

Wang, Tao; Shi, Feng; Jin, Yan; Yap, Pew-Thian; Wee, Chong-Yaw; Zhang, Jianye; Yang, Cece; Li, Xia; Xiao, Shifu; Shen, Dinggang

2016-01-01

Alzheimer's disease (AD) is the most common form of dementia in elderly people. It is an irreversible and progressive brain disease. In this paper, we utilized diffusion-weighted imaging (DWI) to detect abnormal topological organization of white matter (WM) structural networks. We compared the differences between WM connectivity characteristics at global, regional, and local levels in 26 patients with probable AD and 16 normal control (NC) elderly subjects, using connectivity networks constructed with the diffusion tensor imaging (DTI) model and the high angular resolution diffusion imaging (HARDI) model, respectively. At the global level, we found that the WM structural networks of both AD and NC groups had a small-world topology; however, the AD group showed a significant decrease in both global and local efficiency, but an increase in clustering coefficient and the average shortest path length. We further found that the AD patients had significantly decreased nodal efficiency at the regional level, as well as weaker connections in multiple local cortical and subcortical regions, such as precuneus, temporal lobe, hippocampus, and thalamus. The HARDI model was found to be more advantageous than the DTI model, as it was more sensitive to the deficiencies in AD at all of the three levels.

Thinning and Pruning Influence Glaze Damage in a Loblolly Pine Plantation

Treesearch

James D. Burton

1981-01-01

An old-field plantation was thinned and pruned at age 11 and again at age 14 to 4 basal area levels and 3 crown percent levels. A survey was made to determine how damage by an ice storm at age 15 was influenced by treatment. Severe damage was heaviest in the densest stands and in stands with the shortest crowns, while the percent of stand destroyed was least under the...

AM CAS - Spectral variations during the eruption cycles

NASA Astrophysics Data System (ADS)

Richter, G. A.; Notni, P.; Tiersch, H.

Spectroscopic investigations of AM Cas, the Z Camelopardalis star with the shortest known mean cycle length, were performed during quiescence and eruption. It is shown that, although the cycle length is very small, the spectral behavior of AM Cas during an eruption cycle is similar to that of other Z Camelopardalis stars and other U Geminorum stars. During an outburst, the Balmer emissions are narrower and the Balmer decrement is steeper than during quiescence.

Comprehensive Materials and Morphologies Study of Ion Traps (COMMIT) for Scalable Quantum Computation

DTIC Science & Technology

2012-04-21

the photoelectric effect. The typical shortest wavelengths needed for ion traps range from 194 nm for Hg+ to 493 nm for Ba +, corresponding to 6.4-2.5...REPORT Comprehensive Materials and Morphologies Study of Ion Traps (COMMIT) for scalable Quantum Computation - Final Report 14. ABSTRACT 16. SECURITY...CLASSIFICATION OF: Trapped ion systems, are extremely promising for large-scale quantum computation, but face a vexing problem, with motional quantum

Concise Syntheses of Insect Pheromones Using Z-Selective Cross Metathesis**

PubMed Central

Herbert, Myles B.; Marx, Vanessa M.; Pederson, Richard L.; Grubbs, Robert H.

2013-01-01

The shortest synthetic routes to nine cis-pheromones containing a variety of functionality, including an unconjugated (E,Z) diene, are reported. These lepidopteran pheromones are used extensively for pest control, and were easily prepared using ruthenium-based Z-selective cross metathesis, highlighting the advantages of this method over less efficient ways to form Z-olefins. Important insight into the mechanism of Z-selective metathesis was uncovered during experimentation and subsequently explored. PMID:23055437

ANS ultraviolet observations of dwarf Cepheids

NASA Astrophysics Data System (ADS)

Sturch, C. R.; Wu, C.-C.

1983-03-01

Ultraviolet observations of three dwarf Cepheids (VZ Cnc, SX Phe, and AI Vel) are presented. The UV light curves are consistent with those in the visual region. When compared to standard stars, all three dwarf Cepheids exhibit flux deficiencies at the shortest observed wavelengths. The most extreme deficiencies appear for SX Phe; these may be related to the other properties previously noted for this star, including low metallicity, high space motion, and low luminosity.

Statistical mapping of sheet aiquile SE-20-9 (national map) making use of ERTS images

NASA Technical Reports Server (NTRS)

Torrez, J. G.; Brockman, C. E.; Castro, A. F.

1977-01-01

New possibilities of remote sensing by means of satellites to do research on natural resources are reported. These images make it possible to carry out integrated studies of natural resources in the shortest time possible and with small investments. Various maps and a complete description of each are included. With the use of these satellites, scientists can hopefully plan development projects at the national level.

Graphs and matroids weighted in a bounded incline algebra.

PubMed

Lu, Ling-Xia; Zhang, Bei

2014-01-01

Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

A Geographic Optimization Approach to Coast Guard Ship Basing

DTIC Science & Technology

2015-06-01

information found an optimal result for partition- ing. Carlsson applies the travelling salesman problem (tries to find the shortest path to visit a list of...maximum 200 words) This thesis studies the problem of finding efficient ship base locations, area of operations (AO) among bases, and ship assignments...for a coast guard (CG) organization. This problem is faced by many CGs around the world and is motivated by the need to optimize operational outcomes

Improving the Air Mobility Command’s Air Refueler Route Building Capabilities

DTIC Science & Technology

2014-03-27

routing tool. Sundar and Rathinam [18] also study a traveling salesman version of the problem in the unmanned aerial vehicle realm. Their focus is on...constrained shortest path with fuel limitations. The objective is to minimize the distance traveled . Some aircraft routing problems involve...radius and network density their only limitations. 4 O’Rourke et al. [15] examine a traveling salesman version of aircraft routing in the unmanned aerial

Casimir Pressure in Mds-Structures

NASA Astrophysics Data System (ADS)

Yurova, V. A.; Bukina, M. N.; Churkin, Yu. V.; Fedortsov, A. B.; Klimchitskaya, G. L.

2012-07-01

The Casimir pressure on the dielectric layer in metal-dielectric-semiconductor (MDS) structures is calculated in the framework of the Lifshitz theory at nonzero temperature. In this calculation the standard parameters of semiconductor devices with a thin dielectric layer are used. We consider the thickness of a layer decreasing from 40 to 1 nm. At the shortest thickness the Casimir pressure achieves 8 MPa. At small thicknesses the results are compared with the predictions of nonrelativistic theory.

Pennsylvanian - Early Cisuralian interglacial macrofloristic succession in Paraná Basin of the State of São Paulo

NASA Astrophysics Data System (ADS)

Bernardes-de-Oliveira, Mary Elizabeth Cerruti; Kavali, Pauline Sabina; Mune, Sandra Eiko; Shivanna, Mahesh; Souza, Paulo Alves de; Iannuzzi, Roberto; Jasper, André; Hoelzel, Amanda; Boardman, Daiana R.; Rohn, Rosemarie; Ricardi-Branco, Fresia

2016-12-01

One of the most completely preserved glacial sedimentary records from the Late Carboniferous to the Early Permian time corresponds to the Itararé Group, which presents a large outcropping thickness in the northeastern border of Paraná Basin, especially in the State of São Paulo. This unit corresponds to the base of the Gondwana I Supersequence and is composed of continental to marine glacial and interglacial deposits. Based on some macrofloristic, lithostratigraphic and palynostratigraphic data, a formal scheme of the macrofloral succession is herein proposed for this interval, comprising five associations in ascending stratigraphic order namely: (1) Dwykea-Sublagenicula-Calamospora Association (recorded in Campinas Municipality), composed of lycophyte megaspores (Sublagenicula, Trileites and Calamospora sp.) and some bryophytes (Dwykea), concerning to a coastal glacial or coastal interglacial environment; (2) Eusphenopteris-Nothorhacopteris-Botrychiopsis Association (registered in Itapeva and Buri municipalities), composed of Eusphenopteris, Nothorhacopteris, Botrychiopsis, Paracalamites spp. along with Sphenophyllum, Koretrophyllites, Noeggerathiopsis and rare Cordaicarpus and Samaropsis - concerning to an interglacial deltaic plain associated to coal forming swamps with cold temperate hydro-hygrophilous vegetation; (3) Paranocladus-Ginkgophyllum-Brasilodendron Association (registered in Monte Mor Municipality), composed of the first conifers of the Paraná Basin (Paranocladus, Paranospermum and few Buriadia-type), lycophytes (Brasilodendron, Bumbudendron), Ginkgophyllum, Noeggerathiopsis, Samaropsis and Cordaicarpus and rare Nothorhacopteris, Botrychiopsis, Koretrophyllites and Sphenophyllum, interpreted as interglacial deltaic flood plain; (4) Dwykea-Sublagenicula-Calamospora Recurrent Association (recorded in Salto Municipality), composed of bryophytes (Dwykea) and lycopod megaspores, very similar to the first association, related to a coastal glacial or coastal interglacial depositional environment with a type- tundra vegetational cover; and (5) Gangamopteris-Arberia-Stephanophyllites Association (occurring in Tietê and Cerquilho municipalities), composed of the first glossopterid leaves and fructifications of the Paraná Basin (abundant Gangamopteris, Arberia, Arberiopsis and Hirsutum) and sphenophytes (Stephanophyllites and Phyllotheca), suggested as coastal prograding or alluvial environment, of an interglacial phase at the end of the sedimentary history of the Itararé Group. The first four associations are of Pennsylvanian age while the last one is of Asselian-Sakmarian age.

Robot-assisted radical cystectomy – first Polish clinical outcomes

PubMed Central

Juszczak, Kajetan; Poblocki, Pawel; Mikolajczak, Witold; Drewa, Tomasz

2017-01-01

Introduction Urothelial cell carcinoma is the most common neoplasm of the genito-urinary tract, which, in advanced stages, is treated with radical cystectomy with pelvic lymphadenectomy. It can be performed by an open or minimally invasive approach (laparoscopic and robot-assisted radical cystectomy). Large meta-analyses showed a significantly lower complication rate in the RARC (robot-assisted radical cystectomy) group compared to ORC (open radical cystectomy) in thirty and ninety days after surgery, with similar oncological and functional outcomes. The clinical outcomes of the first forty Polish RARC are explored in this article. Material and methods The Polish Radical Robotic Cystectomy Program (PRRC) was started in 2016 at the Nicolaus Copernicus Hospital in Toruń. Forty consecutive patients, with indications for cystectomy were included into the study. During radical robot-assisted cystectomy, obturator, external, internal, common iliac and presacral lymph nodes were dissected. Oncological outcomes, early complication rate, and the clinical variables were analyzed. Results The mean age in the study group was sixty-seven years, with the majority of patients being overweight and assessed as American Society of Anesthesiology Scale (ASA) – ASA III and ASA IV (2/3 of patients). RARC was performed, with the median time of surgery being 324 minutes (170 minutes being the shortest). Mean blood loss was 365 ml (lowest – 50 ml), and only 2 patients required intraoperative blood transfusion. Twenty patients had ileal conduit, and nineteen had other methods of urinary diversion. Only twenty-nine out of forty patients had minor complications (Clavien I and II), 11 had Clavien III and IV. Clavien V was not present. Only 3 patients required reoperation. Conclusions RARC is a reproducible oncological procedure, which can be safely performed in centers with robotic expertise, with acceptable operative time, complications, and functional and oncologic outcomes. PMID:29732201

Electrogram morphology recurrence patterns during atrial fibrillation.

PubMed

Ng, Jason; Gordon, David; Passman, Rod S; Knight, Bradley P; Arora, Rishi; Goldberger, Jeffrey J

2014-11-01

Traditional mapping of atrial fibrillation (AF) is limited by changing electrogram morphologies and variable cycle lengths. We tested the hypothesis that morphology recurrence plot analysis would identify sites of stable and repeatable electrogram morphology patterns. AF electrograms recorded from left atrial (LA) and right atrial (RA) sites in 19 patients (10 men; mean age 59 ± 10 years) before AF ablation were analyzed. Morphology recurrence plots for each electrogram recording were created by cross-correlation of each automatically detected activation with every other activation in the recording. A recurrence percentage, the percentage of the most common morphology, and the mean cycle length of activations with the most recurrent morphology were computed. The morphology recurrence plots commonly showed checkerboard patterns of alternating high and low cross-correlation values, indicating periodic recurrences in morphologies. The mean recurrence percentage for all sites and all patients was 38 ± 25%. The highest recurrence percentage per patient averaged 83 ± 17%. The highest recurrence percentage was located in the RA in 5 patients and in the LA in 14 patients. Patients with sites of shortest mean cycle length of activations with the most recurrent morphology in the LA and RA had ablation failure rates of 25% and 100%, respectively (hazard ratio 4.95; P = .05). A new technique to characterize electrogram morphology recurrence demonstrated that there is a distribution of sites with high and low repeatability of electrogram morphologies. Sites with rapid activation of highly repetitive morphology patterns may be critical to sustaining AF. Further testing of this approach to map and ablate AF sources is warranted. Copyright © 2014 Heart Rhythm Society. Published by Elsevier Inc. All rights reserved.

New Acquisition of Antibiotic-Resistant Organisms in Skilled Nursing Facilities

PubMed Central

Fisch, Jay; Lansing, Bonnie; Wang, Linda; Symons, Kathleen; Cherian, Kay; McNamara, Sara

2012-01-01

The epidemiology of new acquisition of antibiotic-resistant organisms (AROs) in community-based skilled nursing facilities (SNFs) is not well studied. To define the incidence, persistence of, and time to new colonization with methicillin-resistant Staphylococcus aureus (MRSA), vancomycin-resistant enterococci (VRE), and ceftazidime-resistant (CAZr) and ciprofloxacin-resistant (CIPr) Gram-negative bacteria (GNB) in SNFs, SNF residents were enrolled and specimens from the nares, oropharynx, groin, perianal area, and wounds were prospectively cultured monthly. Standard microbiological tests were used to identify MRSA, VRE, and CAZr and CIPr GNB. Residents with at least 3 months of follow-up were included in the analysis. Colonized residents were categorized as having either preexisting or new acquisition. The time to colonization for new acquisition of AROs was calculated. Eighty-two residents met the eligibility criteria. New acquisition of AROs was common. For example, of the 59 residents colonized with CIPr GNB, 28 (47%) were colonized with CIPr GNB at the start of the study (96% persistent and 4% intermittent), and 31 (53%) acquired CIPr GNB at the facility (61% persistent). The time to new acquisition was shortest for CIPr GNB, at a mean of 75.5 days; the time to new acquisition for MRSA was 126.6 days (P = 0.007 versus CIPr GNB), that for CAZr was 176.0 days (P = 0.0001 versus CIPr GNB), and that for VRE was 186.0 days (P = 0.0004 versus CIPr GNB). Functional status was significantly associated with new acquisition of AROs (odds ratio [OR], 1.24; P = 0.01). New acquisition of AROs, in particular CIPr GNB and MRSA, is common in SNFs. CIPr GNB are acquired rapidly. Additional longitudinal studies to investigate risk factors for ARO acquisition are required. PMID:22378900

Total duration of antimicrobial therapy in veterans hospitalized with uncomplicated pneumonia: Results of a national medication utilization evaluation.

PubMed

Madaras-Kelly, Karl J; Burk, Muriel; Caplinger, Christina; Bohan, Jefferson G; Neuhauser, Melinda M; Goetz, Matthew Bidwell; Zhang, Rongping; Cunningham, Francesca E

2016-12-01

Practice guidelines recommend the shortest duration of antimicrobial therapy appropriate to treat uncomplicated pneumonia be prescribed to reduce the emergence of resistant pathogens. A national evaluation was conducted to assess the duration of therapy for pneumonia. Retrospective medication utilization evaluation. Thirty Veterans Affairs medical centers. Inpatients discharged with a diagnosis of pneumonia. A manual review of electronic medical records of inpatients discharged with uncomplicated community-acquired pneumonia (CAP) or healthcare-associated pneumonia (HCAP) was conducted. Appropriate CAP therapy duration was defined as at least 5 days, and up to 3 additional days beginning the first day the patient achieved clinical stability criteria; the appropriate HCAP therapy duration was defined as 8 days. The duration of antimicrobial therapy for intravenous (IV) and oral (PO) inpatient administration, PO therapy dispensed upon discharge, Clostridium difficile infection (CDI), hospital readmission, and death rates were measured. Of 3881 pneumonia admissions, 1739 met inclusion criteria (CAP [n = 1195]; HCAP [n = 544]). Overall, 13.9% of patients (CAP [6.9%], HCAP [29.0%]) received therapy duration consistent with guideline recommendations. The median (interquartile range) days of therapy were 4 days (3-6 days), 1 day (0-3 days), and 6 days (4-8 days) for inpatient IV, inpatient PO, and outpatient PO antimicrobials, respectively. CDI was rare but more common in patients who received therapy duration consistent with guidelines. Therapy duration was not associated with the readmission or mortality rate. Antimicrobials were commonly prescribed for a longer duration than guidelines recommend. The majority of excessive therapy was completed upon discharge, identifying the need for strategies to curtail unnecessary use postdischarge. Journal of Hospital Medicine 2015;11:832-839. © 2015 Society of Hospital Medicine. © 2016 Society of Hospital Medicine.

Differentiation of Speech Delay and Global Developmental Delay in Children Using DTI Tractography-Based Connectome.

PubMed

Jeong, J-W; Sundaram, S; Behen, M E; Chugani, H T

2016-06-01

Pure speech delay is a common developmental disorder which, according to some estimates, affects 5%-8% of the population. Speech delay may not only be an isolated condition but also can be part of a broader condition such as global developmental delay. The present study investigated whether diffusion tensor imaging tractography-based connectome can differentiate global developmental delay from speech delay in young children. Twelve children with pure speech delay (39.1 ± 20.9 months of age, 9 boys), 14 children with global developmental delay (39.3 ± 18.2 months of age, 12 boys), and 10 children with typical development (38.5 ± 20.5 months of age, 7 boys) underwent 3T DTI. For each subject, whole-brain connectome analysis was performed by using 116 cortical ROIs. The following network metrics were measured at individual regions: strength (number of the shortest paths), efficiency (measures of global and local integration), cluster coefficient (a measure of local aggregation), and betweeness (a measure of centrality). Compared with typical development, global and local efficiency were significantly reduced in both global developmental delay and speech delay (P < .0001). The nodal strength of the cognitive network is reduced in global developmental delay, whereas the nodal strength of the language network is reduced in speech delay. This finding resulted in a high accuracy of >83% ± 4% to discriminate global developmental delay from speech delay. The network abnormalities identified in the present study may underlie the neurocognitive and behavioral consequences commonly identified in children with global developmental delay and speech delay. Further validation studies in larger samples are required. © 2016 by American Journal of Neuroradiology.

Can interprofessional teamwork reduce patient throughput times? A longitudinal single-centre study of three different triage processes at a Swedish emergency department.

PubMed

Liu, Jenny; Masiello, Italo; Ponzer, Sari; Farrokhnia, Nasim

2018-04-19

To determine the impact on emergency department (ED) throughput times and proportion of patients who leave without being seen by a physician (LWBS) of two triage interventions, where comprehensive nurse-led triage was first replaced by senior physician-led triage and then by interprofessional teamwork. Single-centre before-and-after study. Adult ED of a Swedish urban hospital. Patients arriving on weekdays 08:00 to 21:00 during three 1-year periods in the interval May 2012 to November 2015. A total of 185 806 arrivals were included. Senior physicians replaced triage nurses May 2013 to May 2014. Interprofessional teamwork replaced the triage process on weekdays 08:00 to 21:00 November 2014 to November 2015. Primary outcomes were the median time to physician (TTP) and the median length of stay (LOS). Secondary outcome was the LWBS rate. The crude median LOS was shortest for teamwork, 228 min (95% CI 226.4 to 230.5) compared with 232 min (95% CI 230.8 to 233.9) for nurse-led and 250 min (95% CI 248.5 to 252.6) for physician-led triage. The adjusted LOS for the teamwork period was 16 min shorter than for nurse-led triage and 23 min shorter than for physician-led triage. The median TTP was shortest for physician-led triage, 56 min (95% CI 54.5 to 56.6) compared with 116 min (95% CI 114.4 to 117.5) for nurse-led triage and 74 min (95% CI 72.7 to 74.8) for teamwork. The LWBS rate was 1.9% for nurse-led triage, 1.2% for physician-led triage and 3.2% for teamwork. All outcome measure differences had two-tailed p values<0.01. Interprofessional teamwork had the shortest length of stay, a shorter time to physician than nurse-led triage, but a higher LWBS rate. Interprofessional teamwork may be a useful approach to reducing ED throughput times. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

Tourniquet application after local forearm warming to improve venodilation for peripheral intravenous cannulation in young and middle-aged adults: A single-blind prospective randomized controlled trial.

PubMed

Yamagami, Yuki; Tomita, Kohei; Tsujimoto, Tomomi; Inoue, Tomoko

2017-07-01

Local forearm warming before tourniquet application is often used to promote venodilation for peripheral intravenous cannulation; however, few studies have compared the effect of tourniquet application with and without local warming on vein size. To evaluate the effectiveness of tourniquet application after local forearm warming with that of tourniquet application alone in young and middle-aged adults. A single-blind, prospective, parallel group, randomized controlled trial. A national university in Japan. Seventy-two volunteers aged 20-64 years. Participants were randomly allocated to one of two groups: tourniquet application for 30s after forearm application of a heat pack warmed to 40°C±2°C for 15min (active warming group; n=36) or tourniquet application for 30s after applying a non-warmed heat pack for 15min (passive warming group; n=36). The primary outcomes were vein cross-sectional area on the forearm, measured after the intervention by blinded research assistants using ultrasound. Secondary outcomes were shortest diameter, and longest diameter of vein on the forearm, forearm skin temperature, body temperature, pulse, systolic blood pressure, and diastolic blood pressure. All outcomes were assessed at the same site before and immediately after the intervention, once per participant. Vein cross-sectional area, shortest vein diameter, and longest vein diameter were significantly increased in the active warming group compared with the passive warming group (p <0.01). Tourniquet application after local warming was superior to tourniquet application alone in increasing vein cross-sectional, shortest diameter, and longest diameter (between-group differences of 2.2mm 2 , 0.5mm, and 0.5mm, respectively), and in raising skin temperature (between-group difference: 5.2°C). However, there were no significant differences in body temperature, pulse, or systolic or diastolic blood pressure between the groups. There were no adverse events associated with either intervention. Tourniquet application after local warming was associated with increased forearm vein size when compared with tourniquet application alone, and was demonstrated as being safe. Thus, with demonstrable effects on vein size, we recommend local warming before tourniquet application as a safe and effective technique for improving venodilation. Copyright © 2017 Elsevier Ltd. All rights reserved.

Topological analysis of metabolic networks integrating co-segregating transcriptomes and metabolomes in type 2 diabetic rat congenic series.

PubMed

Dumas, Marc-Emmanuel; Domange, Céline; Calderari, Sophie; Martínez, Andrea Rodríguez; Ayala, Rafael; Wilder, Steven P; Suárez-Zamorano, Nicolas; Collins, Stephan C; Wallis, Robert H; Gu, Quan; Wang, Yulan; Hue, Christophe; Otto, Georg W; Argoud, Karène; Navratil, Vincent; Mitchell, Steve C; Lindon, John C; Holmes, Elaine; Cazier, Jean-Baptiste; Nicholson, Jeremy K; Gauguier, Dominique

2016-09-30

The genetic regulation of metabolic phenotypes (i.e., metabotypes) in type 2 diabetes mellitus occurs through complex organ-specific cellular mechanisms and networks contributing to impaired insulin secretion and insulin resistance. Genome-wide gene expression profiling systems can dissect the genetic contributions to metabolome and transcriptome regulations. The integrative analysis of multiple gene expression traits and metabolic phenotypes (i.e., metabotypes) together with their underlying genetic regulation remains a challenge. Here, we introduce a systems genetics approach based on the topological analysis of a combined molecular network made of genes and metabolites identified through expression and metabotype quantitative trait locus mapping (i.e., eQTL and mQTL) to prioritise biological characterisation of candidate genes and traits. We used systematic metabotyping by 1 H NMR spectroscopy and genome-wide gene expression in white adipose tissue to map molecular phenotypes to genomic blocks associated with obesity and insulin secretion in a series of rat congenic strains derived from spontaneously diabetic Goto-Kakizaki (GK) and normoglycemic Brown-Norway (BN) rats. We implemented a network biology strategy approach to visualize the shortest paths between metabolites and genes significantly associated with each genomic block. Despite strong genomic similarities (95-99 %) among congenics, each strain exhibited specific patterns of gene expression and metabotypes, reflecting the metabolic consequences of series of linked genetic polymorphisms in the congenic intervals. We subsequently used the congenic panel to map quantitative trait loci underlying specific mQTLs and genome-wide eQTLs. Variation in key metabolites like glucose, succinate, lactate, or 3-hydroxybutyrate and second messenger precursors like inositol was associated with several independent genomic intervals, indicating functional redundancy in these regions. To navigate through the complexity of these association networks we mapped candidate genes and metabolites onto metabolic pathways and implemented a shortest path strategy to highlight potential mechanistic links between metabolites and transcripts at colocalized mQTLs and eQTLs. Minimizing the shortest path length drove prioritization of biological validations by gene silencing. These results underline the importance of network-based integration of multilevel systems genetics datasets to improve understanding of the genetic architecture of metabotype and transcriptomic regulation and to characterize novel functional roles for genes determining tissue-specific metabolism.

Near East/South Asia Report.

DTIC Science & Technology

1985-10-08

defunct Pakistan People’s Party [PPP] is currently divided into many fighting factions. After martial law had been imposed on the country, the ladies of...constitutional rule from Martial Law holding on national polls at the shortest possible time on the revival of the suspended Constitution, handing over of power...constitution re human rights and writ jurisdiction of the High Court. 101 JPRS-NEA-85-128 8 October 1985 The front called for winding up of Martial Law

The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis

DTIC Science & Technology

2017-09-01

being pushed over the minimum designated threshold. 1.4 Motivation A simple setting to motivate this research is the “30 minutes or it’s free” guarantee...parallel network structure in Fig. 4.4 is simple in design , yet shows a relatively high resilience when compared to the other networks in general. The high...United States Naval Academy, 2002 Submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE IN OPERATIONS RESEARCH

Effective Task Assignment and Motion Planning for Complex UAV Operations

DTIC Science & Technology

2011-09-01

shortest path must be one of the following six different combinations of line segments and curvature arcs: RLR , LRL, RSR, LSL, RSL, LSR, where R is a...RSL, RLR , and their mirror images LSL, LSR, LRL, respectively. This section will discuss the minimum number of waypoints required in order for Dubins...point. Then the vehicle will fly to the third waypoint along it’s turn circle. Lemma 10. For the Dubins trajectories RLR and LRL, three waypoints

Droplet Traffic at a Simple Junction at Low Capillary Numbers

NASA Astrophysics Data System (ADS)

Engl, Wilfried; Roche, Matthieu; Colin, Annie; Panizza, Pascal; Ajdari, Armand

2005-11-01

We report that, when a train of confined droplets flowing through a channel reaches a junction, the droplets either are alternately distributed between the different outlets or all collect into the shortest one. We argue that this behavior is due to the hydrodynamic feedback of droplets in the different outlets on the selection process occurring at the junction. A “mean field” model, yielding semiquantitative results, offers a first guide to predict droplet traffic in branched networks.

Analysis of the Global Maritime Transportation System and Its Resilience

DTIC Science & Technology

2017-06-01

shortest/cheapest available route. • We establish re-routing strategies that apply, if a part of a route becomes impassable for container ships. We...The currently available throughput data is mostly from 2011, with few exceptions of 2010 and 2012. In total, there are 94 container seaports from 58...port or to the next available container port for further transportation by sea. Figure 3.5. The road layer visualized in Google Earth. Because our

Ultrafast pulsed laser utilizing broad bandwidth laser glass

DOEpatents

Payne, Stephen A.; Hayden, Joseph S.

1997-01-01

An ultrafast laser uses a Nd-doped phosphate laser glass characterized by a particularly broad emission bandwidth to generate the shortest possible output pulses. The laser glass is composed primarily of P.sub.2 O.sub.5, Al.sub.2 O.sub.3 and MgO, and possesses physical and thermal properties that are compatible with standard melting and manufacturing methods. The broad bandwidth laser glass can be used in modelocked oscillators as well as in amplifier modules.

The Shortest Way Home: Risk and the Airland Battle

DTIC Science & Technology

1989-11-27

as the Corps main effort, attempted a crossing, but was thoroughly repulsed by the 3d Panzer Grenadier Division. XII Corps spent the next week...4th Armored Division (4AD) 1 was preparing to cross the river and begin exploiting east. However, shortly after dark, the 3d Panzer Grenadier Division...attacked the bridgehead from the north, east, and south. By 0700 on 13 September, the 3d Panzer Grenadier Division had reduced the bridgehead

Anomalous conformer dependent S 1 lifetime of L-phenylalanine

NASA Astrophysics Data System (ADS)

Hashimoto, Takayo; Takasu, Yuichi; Yamada, Yuji; Ebata, Takayuki

2006-04-01

The fluorescence lifetimes were measured for six conformers of L-phenylalanine cooled in a supersonic jet. It was found that the S 1 state lifetimes differ by a factor of three among the conformers. Especially, the most stable conformer (intramolecular hydrogen-bonded form) in S 0 had the shortest lifetime. Time-dependent DFT calculation suggested an importance of the mixing of the nπ ∗ character to S 1(ππ ∗) in this conformer dependent dynamics.

Why our patients (and we) need basic science research.

PubMed

Schor, Nina F

2013-05-28

In times of fiscal austerity, the tendency is to seek instant, inexpensive gratification. In the case of biomedical research, this means the shortest path to practical clinical implementation. But fueling the translational pipeline with discovery depends critically on allowing the biomedical research community to follow their science where it takes them. Fiscal constraints carry with them the risk of squelching creativity and forfeiting the power of serendipity to provide the substrate for the translational engine in the future.

How can attosecond pulse train interferometry interrogate electron dynamics?

NASA Astrophysics Data System (ADS)

Arnold, C. L.; Isinger, M.; Busto, D.; Guénot, D.; Nandi, S.; Zhong, S.; Dahlström, J. M.; Gisselbrecht, M.; l'Huillier, A.

2018-04-01

Light pulses of sub-100 as (1 as=10-18 s) duration, with photon energies in the extreme-ultraviolet (XUV) spectral domain, represent the shortest event in time ever made and controlled by human beings. Their first experimental observation in 2001 has opened the door to investigating the fundamental dynamics of the quantum world on the natural time scale for electrons in atoms, molecules and solids and marks the beginning of the scientific field now called attosecond science.

3-Fluoro­salicylaldoxime at 6.5 GPa

PubMed Central

Wood, Peter A.; Forgan, Ross S.; Parsons, Simon; Pidcock, Elna; Tasker, Peter A.

2009-01-01

3-Fluoro­salicylaldoxime, C7H6FNO2, unlike many salicylaldoxime derivatives, forms a crystal structure containing hydrogen-bonded chains rather than centrosymmetric hydrogen-bonded ring motifs. Each chain inter­acts with two chains above and two chains below via π–π stacking contacts [shortest centroid–centroid distance = 3.295 (1) Å]. This structure at 6.5 GPa represents the final point in a single-crystal compression study. PMID:21583672

The Structure and Evolution of Buyer-Supplier Networks

PubMed Central

Mizuno, Takayuki; Souma, Wataru; Watanabe, Tsutomu

2014-01-01

In this paper, we investigate the structure and evolution of customer-supplier networks in Japan using a unique dataset that contains information on customer and supplier linkages for more than 500,000 incorporated non-financial firms for the five years from 2008 to 2012. We find, first, that the number of customer links is unequal across firms; the customer link distribution has a power-law tail with an exponent of unity (i.e., it follows Zipf's law). We interpret this as implying that competition among firms to acquire new customers yields winners with a large number of customers, as well as losers with fewer customers. We also show that the shortest path length for any pair of firms is, on average, 4.3 links. Second, we find that link switching is relatively rare. Our estimates indicate that the survival rate per year for customer links is 92 percent and for supplier links 93 percent. Third and finally, we find that firm growth rates tend to be more highly correlated the closer two firms are to each other in a customer-supplier network (i.e., the smaller is the shortest path length for the two firms). This suggests that a non-negligible portion of fluctuations in firm growth stems from the propagation of microeconomic shocks – shocks affecting only a particular firm – through customer-supplier chains. PMID:25000368

Gastrointestinal transit, post-prandial lipaemia and satiety following 3 days high-fat diet in men.

PubMed

Clegg, M E; McKenna, P; McClean, C; Davison, G W; Trinick, T; Duly, E; Shafat, A

2011-02-01

High-fat (HF) diets of 2 weeks have been shown to accelerate gastric emptying (GE). To date, no studies have shown any alteration in GE following shorter HF diets. The aim of this study was to assess if an HF, high-energy diet of 3 days can adapt gastrointestinal (GI) transit, blood lipids and satiety. Eleven male volunteers participated in a study consisting of three, 3-day interventions each separated by a test day. During the first intervention, volunteers recorded their diet. In the second and third interventions, volunteers repeated their food diary plus either a low-fat yogurt or HF yogurt supplement in randomized order. Test days involved measurement of GE using the (13)C octanoic-acid breath-test, mouth-to-caecum transit time (MCTT) using the inulin H(2) breath test and satiety using visual analogue scales. Blood samples for measurement of lipaemia were taken using a venous cannula. MCTT was different between the three test days (P=0.038), with the shortest MCTT following the HF intervention. GE was shortest following the HF intervention. There were no differences in satiety between the interventions. The HF intervention reduced triglycerides, total cholesterol and low-density lipoprotein cholesterol, and increased high-density lipoprotein cholesterol. This study shows that changes in GI transit owing to an HF diet can occur in a time period as short as 3 days.

The structure and evolution of buyer-supplier networks.

PubMed

Mizuno, Takayuki; Souma, Wataru; Watanabe, Tsutomu

2014-01-01

In this paper, we investigate the structure and evolution of customer-supplier networks in Japan using a unique dataset that contains information on customer and supplier linkages for more than 500,000 incorporated non-financial firms for the five years from 2008 to 2012. We find, first, that the number of customer links is unequal across firms; the customer link distribution has a power-law tail with an exponent of unity (i.e., it follows Zipf's law). We interpret this as implying that competition among firms to acquire new customers yields winners with a large number of customers, as well as losers with fewer customers. We also show that the shortest path length for any pair of firms is, on average, 4.3 links. Second, we find that link switching is relatively rare. Our estimates indicate that the survival rate per year for customer links is 92 percent and for supplier links 93 percent. Third and finally, we find that firm growth rates tend to be more highly correlated the closer two firms are to each other in a customer-supplier network (i.e., the smaller is the shortest path length for the two firms). This suggests that a non-negligible portion of fluctuations in firm growth stems from the propagation of microeconomic shocks - shocks affecting only a particular firm - through customer-supplier chains.

Airway Management with Cervical Spine Immobilisation: A Comparison between the Macintosh Laryngoscope, Truview Evo2, and Totaltrack VLM Used by Novices--A Manikin Study.

PubMed

Aleksandrowicz, Dawid; Gaszyński, Tomasz

2016-01-01

Airway management in patients with suspected cervical spine injury plays an important role in the pathway of care of trauma patients. The aim of this study was to evaluate three different airway devices during intubation of a patient with reduced cervical spine mobility. Forty students of the third year of emergency medicine studies participated in the study (F = 26, M = 14). The time required to obtain a view of the entry to the larynx and successful ventilation time were recorded. Cormack-Lehane laryngoscopic view and damage to the incisors were also assessed. All three airway devices were used by each student (a novice) and they were randomly chosen. The mean time required to obtain the entry-to-the-larynx view was the shortest for the Macintosh laryngoscope 13.4 s (±2.14). Truview Evo2 had the shortest successful ventilation time 35.7 s (±9.27). The best view of the entry to the larynx was obtained by the Totaltrack VLM device. The Truview Evo2 and Totaltrack VLM may be an alternative to the classic Macintosh laryngoscope for intubation of trauma patients with suspected injury to the cervical spine. The use of new devices enables achieving better laryngoscopic view as well as minimising incisor damage during intubation.

Three-dimensional shape analysis of miarolitic cavities and enclaves in the Kakkonda granite by X-ray computed tomography

NASA Astrophysics Data System (ADS)

Ohtani, Tomoyuki; Nakano, Tsukasa; Nakashima, Yoshito; Muraoka, Hirofumi

2001-11-01

Three-dimensional shape analysis of miarolitic cavities and enclaves from the Kakkonda granite, NE Japan, was performed by X-ray computed tomography (CT) and image analysis. The three-dimensional shape of the miarolitic cavities and enclaves was reconstructed by stacked two-dimensional CT slice images with an in-plane resolution of 0.3 mm and an inter-slice spacing of 1 mm. An ellipsoid was fitted to each reconstructed object by the image processing programs. The shortest, intermediate, and longest axes of the ellipsoids fitted to miarolitic cavities had E-W, N-S, and vertical directions, respectively. The shortest axes of the ellipsoids fitted to enclaves were sub-vertical to vertical. Three-dimensional strains calculated from miarolitic cavities and enclaves have E-W and vertical shortening, respectively. The shape characteristics of miarolitic cavities probably reflect regional stress during the late magmatic stage, and those of enclaves reflect shortening by later-intruded magma or body rotation during the early magmatic stage. The miarolitic cavities may not be strained homogeneously with the surrounding granite, because the competence of minerals is different from that of the fluid-filled cavities. Although the strain markers require sufficient contrast between their CT numbers and those of the surrounding minerals, this method has several advantages over conventional methods, including the fact that it is non-destructive, expedient, and allows direct three-dimensional observation of each object.

Ligand-dependent exciton dynamics and photovoltaic properties of PbS quantum dot heterojunction solar cells.

PubMed

Chang, Jin; Ogomi, Yuhei; Ding, Chao; Zhang, Yao Hong; Toyoda, Taro; Hayase, Shuzi; Katayama, Kenji; Shen, Qing

2017-03-01

The surface chemistry of colloidal quantum dots (QDs) plays an important role in determining the photoelectric properties of QD films and the corresponding quantum dot heterojunction solar cells (QDHSCs). To investigate the effects of the ligand structure on the photovoltaic performance and exciton dynamics of QDHSCs, PbS QDHSCs were fabricated by the solid state ligand exchange method with mercaptoalkanoic acid as the cross-linking ligand. Temperature-dependent photoluminescence and ultrafast transient absorption spectra show that the electronic coupling and charge transfer rate within QD ensembles were monotonically enhanced as the ligand length decreased. However, in practical QDHSCs, the second shortest ligand 3-mercaptopropionic acid (MPA) showed higher power conversion efficiency than the shortest ligand thioglycolic acid (TGA). This could be attributed to the difference in their surface trap states, supported by thermally stimulated current measurements. Moreover, compared with the non-conjugated ligand MPA, the conjugated ligand 4-mercaptobenzoic acid (MBA) introduces less trap states and has a similar charge transfer rate in QD ensembles, but has poor photovoltaic properties. This unexpected result could be contributed by the QD-ligand orbital mixing, leading to the charge transfer from QDs to ligands instead of charge transfer between adjacent QDs. This work highlights the significant effects of ligand structures on the photovoltaic properties and exciton dynamics of QDHSCs, which would shed light on the further development of QD-based photoelectric devices.

Mobility based multicast routing in wireless mesh networks

NASA Astrophysics Data System (ADS)

Jain, Sanjeev; Tripathi, Vijay S.; Tiwari, Sudarshan

2013-01-01

There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees. The (MCT's) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks. In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT's) shortest path tree, (MST's) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc. We have also evaluated multicast performance in the small and large wireless mesh networks. In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases. In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

Life Expectancies in Hawai‘i: A Multi-ethnic Analysis of 2010 Life Tables

PubMed Central

Braun, Kathryn; Onaka, Alvin T; Horiuchi, Brian Y; Tottori, Caryn J; Wilkens, Lynne

2017-01-01

The objective of this study is to examine longevity disparities in Hawai‘i by race/ethnicity and gender based on age-specific death rates in 2010. Abridged life tables for Chinese, Japanese, Filipino, Hawaiians, and Caucasians in Hawai‘i are presented for the age groups: <1, 1–4, every 5-year interval from 5–84, and 85+ years for the year of 2010. Death data were provided by the Hawai‘i Department of Health Office of Health Status Monitoring, and population data were based on 2010 Census modified based on ethnicity estimates from the Hawai‘i Health Survey. Life expectancy at birth in Hawai‘i has increased consistently from 69.5 years in 1950 to 82.4 years in 2010. Longevity disparities seen in past decades continue to persist between the longest-living groups, Japanese and Chinese, and the shortest-living group, Native Hawaiians, with a gap of approximately 10 years. In addition, females lived 6 years longer than males on average. Racial/ethnic disparities in longevity can be partially explained by differences in socioeconomic status, health behaviors, health care access, and racism. Native Hawaiians continue to have the shortest life expectancy of the ethnic groups examined, requiring expanded efforts to address Native Hawaiian health across the life course. Our findings also support more ethnic-specific research to understand the health care needs and utilization patterns of each group. PMID:28090398

Creative foraging: An experimental paradigm for studying exploration and discovery

PubMed Central

Mayo, Avraham E.; Mayo, Ruth; Rozenkrantz, Liron; Tendler, Avichai; Alon, Uri; Noy, Lior

2017-01-01

Creative exploration is central to science, art and cognitive development. However, research on creative exploration is limited by a lack of high-resolution automated paradigms. To address this, we present such an automated paradigm, the creative foraging game, in which people search for novel and valuable solutions in a large and well-defined space made of all possible shapes made of ten connected squares. Players discovered shape categories such as digits, letters, and airplanes as well as more abstract categories. They exploited each category, then dropped it to explore once again, and so on. Aligned with a prediction of optimal foraging theory (OFT), during exploration phases, people moved along meandering paths that are about three times longer than the shortest paths between shapes; when exploiting a category of related shapes, they moved along the shortest paths. The moment of discovery of a new category was usually done at a non-prototypical and ambiguous shape, which can serve as an experimental proxy for creative leaps. People showed individual differences in their search patterns, along a continuum between two strategies: a mercurial quick-to-discover/quick-to-drop strategy and a thorough slow-to-discover/slow-to-drop strategy. Contrary to optimal foraging theory, players leave exploitation to explore again far before categories are depleted. This paradigm opens the way for automated high-resolution study of creative exploration. PMID:28767668

Sorting genomes by reciprocal translocations, insertions, and deletions.

PubMed

Qi, Xingqin; Li, Guojun; Li, Shuguang; Xu, Ying

2010-01-01

The problem of sorting by reciprocal translocations (abbreviated as SBT) arises from the field of comparative genomics, which is to find a shortest sequence of reciprocal translocations that transforms one genome Pi into another genome Gamma, with the restriction that Pi and Gamma contain the same genes. SBT has been proved to be polynomial-time solvable, and several polynomial algorithms have been developed. In this paper, we show how to extend Bergeron's SBT algorithm to include insertions and deletions, allowing to compare genomes containing different genes. In particular, if the gene set of Pi is a subset (or superset, respectively) of the gene set of Gamma, we present an approximation algorithm for transforming Pi into Gamma by reciprocal translocations and deletions (insertions, respectively), providing a sorting sequence with length at most OPT + 2, where OPT is the minimum number of translocations and deletions (insertions, respectively) needed to transform Pi into Gamma; if Pi and Gamma have different genes but not containing each other, we give a heuristic to transform Pi into Gamma by a shortest sequence of reciprocal translocations, insertions, and deletions, with bounds for the length of the sorting sequence it outputs. At a conceptual level, there is some similarity between our algorithm and the algorithm developed by El Mabrouk which is used to sort two chromosomes with different gene contents by reversals, insertions, and deletions.

Characterisation of the porcine eyeball as an in-vitro model for dry eye.

PubMed

Menduni, Francesco; Davies, Leon N; Madrid-Costa, D; Fratini, Antonio; Wolffsohn, James S

2018-02-01

To characterise the anatomical parameters of the porcine eye for potentially using it as a laboratory model of dry eye. Anterior chamber depth and angle, corneal curvature, shortest and longest diameter, endothelial cell density, and pachymetry were measured in sixty freshly enucleated porcine eyeballs. Corneal steepest meridian was 7.85±0.32mm, corneal flattest meridian was 8.28±0.32mm, shortest corneal diameter was 12.69±0.58mm, longest corneal diameter was 14.88±0.66mm and central corneal ultrasonic pachymetry was 1009±1μm. Anterior chamber angle was 28.83±4.16°, anterior chamber depth was 1.77±0.27mm, and central corneal thickness measured using OCT was 1248±144μm. Corneal endothelial cell density was 3250±172 cells/mm 2 . Combining different clinical techniques produced a pool of reproducible data on the porcine eye anatomy, which can be used by researchers to assess the viability of using the porcine eye as an in-vitro/ex-vivo model for dry eye. Due to the similar morphology with the human eye, porcine eyeballs may represent a useful and cost effective model to individually study important key factors in the development of dry eye, such as environmental and mechanical stresses. Copyright © 2017 British Contact Lens Association. Published by Elsevier Ltd. All rights reserved.

Circuity analyses of HSR network and high-speed train paths in China

PubMed Central

Zhao, Shuo; Huang, Jie; Shan, Xinghua

2017-01-01

Circuity, defined as the ratio of the shortest network distance to the Euclidean distance between one origin–destination (O-D) pair, can be adopted as a helpful evaluation method of indirect degrees of train paths. In this paper, the maximum circuity of the paths of operated trains is set to be the threshold value of the circuity of high-speed train paths. For the shortest paths of any node pairs, if their circuity is not higher than the threshold value, the paths can be regarded as the reasonable paths. With the consideration of a certain relative or absolute error, we cluster the reasonable paths on the basis of their inclusion relationship and the center path of each class represents a passenger transit corridor. We take the high-speed rail (HSR) network in China at the end of 2014 as an example, and obtain 51 passenger transit corridors, which are alternative sets of train paths. Furthermore, we analyze the circuity distribution of paths of all node pairs in the network. We find that the high circuity of train paths can be decreased with the construction of a high-speed railway line, which indicates that the structure of the HSR network in China tends to be more complete and the HSR network can make the Chinese railway network more efficient. PMID:28945757

[Changes in heart rate variability after myocardial infarction. Value of Poincareé's diagram].

PubMed

Copie, X; Le Heuzey, J Y; Iliou, M C; Pousset, F; Lavergne, T; Guize, L

1995-11-01

The variability of the heart rate is reduced after myocardial infarction. It then progressively increases, to return to near normal values after several months. However, these changes in heart rate variability occur at the same time as slowing of the heart rate which makes interpretation difficult. Poincaré's diagram is constructed from a Holter recording plotting each RR interval against the preceding RR interval. The authors have developed a geometric approach to this diagram to evaluate parasympathetic tone for a given heart rate. By measuring the dispersion in height of the Poincaré's diagram, the authors evaluate the shor-term variability for a given RR interval. Two 24 hr Holter recordings were performed in 52 patients at one and two weeks after a myocardial infarction. The dispersion in the height of the Poincaré's diagrams was measured at the 10th, 25th, 50th, 75th and 90th percentiles of the total dispersion. The authors have shown an increase in the short-term variability of the shortest RR intervals (1th, 25th and 50th percentiles) which is not observed in the longer RR intervals (75th and 90th percentiles). In conclusion, theres is an increase in the heart rate variability at the shortest RR intervals. This suggests that the recovery of parasympathic tone after myocardial infarction occurs mainly at the fastest heart rates.

On the Eikonal equation in the pedestrian flow problem

NASA Astrophysics Data System (ADS)

Felcman, J.; Kubera, P.

2017-07-01

We consider the Pedestrian Flow Equations (PFEs) as the coupled system formed by the Eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the continuity equation and momentum equation of fluid dynamics. Specifying the social and pressure forces in the momentum equation we come to the assumption that each pedestrian is trying to move in a desired direction (e.g. to the exit in the panic situation) with a desired velocity, where his velocity and the direction of movement depend on the density of pedestrians in his neighborhood. In [1] we used the model, where the desired direction of movement is given by the solution of the Eikonal equation (more precisely by the gradient of the solution). Here we avoid the solution of the Eikonal equation, which is the novelty of the paper. Based on the fact that the solution of the Eikonal equation has the meaning of the shortest time to reach the exit, we define explicitly such a function in the framework of the Dijkstra's algorithm for the shortest path in the graph. This is done at the discrete level of the solution. As the graph we use the underlying triangulation, where the norm of each edge is density depending and has the dimension of the time. The numerical examples of the solution of the PFEs with and without the solution of the Eikonal equation are presented.

Betweenness centrality in a weighted network

NASA Astrophysics Data System (ADS)

Wang, Huijuan; Hernandez, Javier Martin; van Mieghem, Piet

2008-04-01

When transport in networks follows the shortest paths, the union of all shortest path trees G∪SPT can be regarded as the “transport overlay network.” Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G∪SPT . The traffic through the network is examined by the betweenness Bl of links in the overlay G∪SPT . The strength of disorder can be controlled by, e.g., tuning the extreme value index α of the independent and identically distributed polynomial link weights. In the strong disorder limit (α→0) , all transport flows over a critical backbone, the minimum spanning tree (MST). We investigate the betweenness distributions of wide classes of trees, such as the MST of those well-known network models and of various real-world complex networks. All these trees with different degree distributions (e.g., uniform, exponential, or power law) are found to possess a power law betweenness distribution Pr[Bl=j]˜j-c . The exponent c seems to be positively correlated with the degree variance of the tree and to be insensitive of the size N of a network. In the weak disorder regime, transport in the network traverses many links. We show that a link with smaller link weight tends to carry more traffic. This negative correlation between link weight and betweenness depends on α and the structure of the underlying topology.

Statistical Physics of Cascading Failures in Complex Networks

NASA Astrophysics Data System (ADS)

Panduranga, Nagendra Kumar

Systems such as the power grid, world wide web (WWW), and internet are categorized as complex systems because of the presence of a large number of interacting elements. For example, the WWW is estimated to have a billion webpages and understanding the dynamics of such a large number of individual agents (whose individual interactions might not be fully known) is a challenging task. Complex network representations of these systems have proved to be of great utility. Statistical physics is the study of emergence of macroscopic properties of systems from the characteristics of the interactions between individual molecules. Hence, statistical physics of complex networks has been an effective approach to study these systems. In this dissertation, I have used statistical physics to study two distinct phenomena in complex systems: i) Cascading failures and ii) Shortest paths in complex networks. Understanding cascading failures is considered to be one of the "holy grails" in the study of complex systems such as the power grid, transportation networks, and economic systems. Studying failures of these systems as percolation on complex networks has proved to be insightful. Previously, cascading failures have been studied extensively using two different models: k-core percolation and interdependent networks. The first part of this work combines the two models into a general model, solves it analytically, and validates the theoretical predictions through extensive computer simulations. The phase diagram of the percolation transition has been systematically studied as one varies the average local k-core threshold and the coupling between networks. The phase diagram of the combined processes is very rich and includes novel features that do not appear in the models which study each of the processes separately. For example, the phase diagram consists of first- and second-order transition regions separated by two tricritical lines that merge together and enclose a two-stage transition region. In the two-stage transition, the size of the giant component undergoes a first-order jump at a certain occupation probability followed by a continuous second-order transition at a smaller occupation probability. Furthermore, at certain fixed interdependencies, the percolation transition cycles from first-order to second-order to two-stage to first-order as the k-core threshold is increased. We setup the analytical equations describing the phase boundaries of the two-stage transition region and we derive the critical exponents for each type of transition. Understanding the shortest paths between individual elements in systems like communication networks and social media networks is important in the study of information cascades in these systems. Often, large heterogeneity can be present in the connections between nodes in these networks. Certain sets of nodes can be more highly connected among themselves than with the nodes from other sets. These sets of nodes are often referred to as 'communities'. The second part of this work studies the effect of the presence of communities on the distribution of shortest paths in a network using a modular Erdős-Renyi network model. In this model, the number of communities and the degree of modularity of the network can be tuned using the parameters of the model. We find that the model reaches a percolation threshold while tuning the degree of modularity of the network and the distribution of the shortest paths in the network can be used as an indicator of how the communities are connected.

An industrial robot singular trajectories planning based on graphs and neural networks

NASA Astrophysics Data System (ADS)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

Three-axis asymmetric radiation detector system

DOEpatents

Martini, Mario Pierangelo; Gedcke, Dale A.; Raudorf, Thomas W.; Sangsingkeow, Pat

2000-01-01

A three-axis radiation detection system whose inner and outer electrodes are shaped and positioned so that the shortest path between any point on the inner electrode and the outer electrode is a different length whereby the rise time of a pulse derived from a detected radiation event can uniquely define the azimuthal and radial position of that event, and the outer electrode is divided into a plurality of segments in the longitudinal axial direction for locating the axial location of a radiation detection event occurring in the diode.

How networks split when rival leaders emerge

NASA Astrophysics Data System (ADS)

Krawczyk, Malgorzata J.; Kułakowski, Krzysztof

2018-02-01

In a model social network, two hubs are appointed as leaders. Consecutive cutting of links on a shortest path between them splits the network in two. Next, the network is growing again till the initial size. Both processes are cyclically repeated. We investigate the size of a cluster containing the largest hub, the degree, the clustering coefficient, the closeness centrality and the betweenness centrality of the largest hub, as dependent on the number of cycles. The results are interpreted in terms of the leader's benefits from conflicts.

Machine Learning Techniques for Persuasion Detection in Conversation

DTIC Science & Technology

2010-06-01

files maintained the original post and tile ordering within each transcript. These files were each internally shuffled prior to creating test and...of the number of post or tiles. The other 90% was used for training data. Each post and each tile appeared in only one of the 10 test sets. Each post ...concatenating 5 test sets and pairing it with the 6th test set. This process was conducted for both posts and tiles. The shortest transcript (19 posts , 0 tiles

A study of the electrical properties of complex resistor network based on NW model

NASA Astrophysics Data System (ADS)

Chang, Yunfeng; Li, Yunting; Yang, Liu; Guo, Lu; Liu, Gaochao

2015-04-01

The power and resistance of two-port complex resistor network based on NW small world network model are studied in this paper. Mainly, we study the dependence of the network power and resistance on the degree of port vertices, the connection probability and the shortest distance. Qualitative analysis and a simplified formula for network resistance are given out. Finally, we define a branching parameter and give out its physical meaning in the analysis of complex resistor network.

Oscillations in interconnected complex networks under intentional attack

NASA Astrophysics Data System (ADS)

Zhang, Wen-Ping; Xia, Yongxiang; Tan, Fei

2016-01-01

Many real-world networks are interconnected with each other. In this paper, we study the traffic dynamics in interconnected complex networks under an intentional attack. We find that with the shortest time delay routing strategy, the traffic dynamics can show the stable state, periodic, quasi-periodic and chaotic oscillations, when the capacity redundancy parameter changes. Moreover, compared with isolated complex networks, oscillations always take place in interconnected networks more easily. Thirdly, in interconnected networks, oscillations are affected strongly by the coupling probability and coupling preference.

Compendium of Dental Residents’ Research Project and Literature Reviews - 1991.

DTIC Science & Technology

1992-04-01

4-log1 0 (99.99%) reduction of any of the microorgan- isms under the test conditions. Sporicidin and 0.525% sodium hypochlorite were able to effect a...4-log1 0 reduction against S. aureus only. Impresept and 5.25% sodium hypochlorite did achieve a 4-log10 reduction in bacterial counts in all cases...alginate impressions is currently unknown and warrants investigation. Full strength (5.25%) sodium hypochlorite was effective in the shortest contact time (1

A Note on the Geometry of Kullback-Leibler Information Numbers.

DTIC Science & Technology

1983-04-01

distributions, certain analogies exist between the properties of distributions and Zaclidean *’ geometry. Zn particular, he proved an analogue of Pythagoras ...8217 theorem . Zn this note we extend these geometrical properties by defining the "shortest line" between two distributions and the "aid-pointu of the line...P,R) A similar result holds if both signs are replaced with U signs. 4. Main reslts We •oa pcyv our main theorem , which says that the romential

Minimizing Communication in All-Pairs Shortest Paths

DTIC Science & Technology

2013-02-13

on a 16,384 vertex, 5% dense graph, is slightly faster using our approach (18.6 vs . 22.6 seconds) than using the replicated Johnson’s algorithm...Oracle and Samsung , as well as MathWorks. Research is also supported by DOE grants DE-SC0004938, DE-SC0005136, DE-SC0003959, DE-SC0008700, and AC02...Brickell, I. S. Dhillon, S. Sra, and J. A. Tropp. The metric nearness problem. SIAM J. Matrix Anal. Appl ., 30:375–396, 2008. [11] A. Buluç, J. R. Gilbert

Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks

DTIC Science & Technology

2012-09-30

transportation system to losses in es - tablished routes or assets? That is, what is the nature and length of system capability degradation due to these...Multimodal Rough-Cut Capacity Planning is mod- eled using the Resource Constrained Shortest Path Problem. We demonstrate how this approach supports...of non-zero ele - ments and the 0 entries depict appropriately dimensioned blocks of 0 entries.∣∣∣∣∑ k Ck ∣∣∣∣ Σ 0 0 0 0 Σ 0 0

Finding Minimal Addition Chains with a Particle Swarm Optimization Algorithm

NASA Astrophysics Data System (ADS)

León-Javier, Alejandro; Cruz-Cortés, Nareli; Moreno-Armendáriz, Marco A.; Orantes-Jiménez, Sandra

The addition chains with minimal length are the basic block to the optimal computation of finite field exponentiations. It has very important applications in the areas of error-correcting codes and cryptography. However, obtaining the shortest addition chains for a given exponent is a NP-hard problem. In this work we propose the adaptation of a Particle Swarm Optimization algorithm to deal with this problem. Our proposal is tested on several exponents whose addition chains are considered hard to find. We obtained very promising results.

The Georgia Tech High Sensitivity Microwave Measurement System

NASA Technical Reports Server (NTRS)

Deboer, David R.; Steffes, Paul G.

1996-01-01

As observations and models of the planets become increasingly more accurate and sophisticated, the need for highly accurate laboratory measurements of the microwave properties of the component gases present in their atmospheres become ever more critical. This paper describes the system that has been developed at Georgia Tech to make these measurements at wavelengths ranging from 13.3 cm to 1.38 cm with a sensitivity of 0.05 dB/km at the longest wavelength and 0.6 db/km at the shortest wavelength.

Ultrafast pulsed laser utilizing broad bandwidth laser glass

DOEpatents

Payne, S.A.; Hayden, J.S.

1997-09-02

An ultrafast laser uses a Nd-doped phosphate laser glass characterized by a particularly broad emission bandwidth to generate the shortest possible output pulses. The laser glass is composed primarily of P{sub 2}O{sub 5}, Al{sub 2}O{sub 3} and MgO, and possesses physical and thermal properties that are compatible with standard melting and manufacturing methods. The broad bandwidth laser glass can be used in modelocked oscillators as well as in amplifier modules. 7 figs.

Tm:KLu(WO(4))(2) microchip laser Q-switched by a graphene-based saturable absorber.

PubMed

Serres, Josep Maria; Loiko, Pavel; Mateos, Xavier; Yumashev, Konstantin; Griebner, Uwe; Petrov, Valentin; Aguiló, Magdalena; Díaz, Francesc

2015-06-01

We report on the first Tm-doped double tungstate microchip laser Q-switched with graphene using a Tm:KLu(WO₄)₂ crystal cut along the N_g dielectric axis. This laser generates a maximum average output power of 310 mW with a slope efficiency of 13%. At a repetition rate of 190 kHz the shortest pulses with 285 ns duration and 1.6 µJ energy are achieved.

Score Fusion and Decision Fusion for the Performance Improvement of Face Recognition

DTIC Science & Technology

2013-07-01

0.1). A Hamming distance (HD) [7] is calculated with the FP-CGF to measure the similarities among faces. The matched face has the shortest HD from...then put into a face pattern byte (FPB) pixel- by-pixel. A HD is calculated with the FPB to measure the similarities among faces, and recognition is...all query users are included in the database), the recognition performance can be measured by a verification rate (VR), the percentage of the

The Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity

DTIC Science & Technology

2012-09-13

Jordan, Captain, USAF AFIT/DS/ENS/12-09 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright- Patterson Air Force Base...Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu 1.1 Abstract United...Technology 2950 Hobson Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu

Gold nanorods saturable absorber for Q-switched Nd:GAGG lasers at 1 μm

NASA Astrophysics Data System (ADS)

Feng, Chao; Liu, Mingyi; Li, Yanbin; Gao, Xuejian; Kang, Zhe; Qin, Guanshi; Jia, Zhitai; Tao, Xutang; Song, Teng; Dun, Yangyang; Bai, Fen; Li, Ping; Wang, Qingpu; Fang, Jiaxiong

2017-03-01

A gold nanorod saturable absorber has been synthesized by the seed-mediated growth method characterized in detail. The absorption peak wavelength was 1080 nm, and the modulation depth was measured to be 9%. The performance of its Q-switched Nd:GAGG lasers at 1061 and 1106 nm has been systematically investigated, respectively. The corresponding shortest pulsewidths were 250 and 480 ns. Our experiment results proved that the GNR-SA is a promising saturable absorber for nanosecond bulk lasers.

Wear Test Results of Candidate Materials for the OK-542 Towed Array Handling Machine Level Winder

DTIC Science & Technology

1994-12-29

Stainless Steel, Inconel 625 , Nickel-Aluminum-Bronze, and Titanium. The specialty materials: Inconel 625 , Monel, Stainless and Stellite, were clad-welded...metals on a base of 1040 Carbon Steel. Finally, an economic carbide coating was deposited on a 316 Stainless Steel and Inconel 625 sample. Within a...damage in the shortest period of time. The Inconel 625 bar stock that was tested performed the best. It sustained the least amount of damage for one

Antimicrobial Cellulose: Preparation and Application of 5-Methyl-5-Aminomethylhydantoin

DTIC Science & Technology

2006-08-01

they release active chlorine to microbes relatively more rapidly and kill the pathogens in the shortest time. Amide N-Cl bonds being relatively more...for 5~35 min. A 1% Clorox solution was used for chlorination without pH adjustment. bCoating solution: 5 % AH in distilled water. cCoating solution...0.37% 0.75 % 0.94 % 0.80 % 0.80 % aThe cloth samples were cured at 1450C for 35 min and then chlorinated with 1% Clorox 12 without pH adjustment

Optoelectronic semiconductor device and method of fabrication

DOEpatents

Cui, Yi; Zhu, Jia; Hsu, Ching-Mei; Fan, Shanhui; Yu, Zongfu

2014-11-25

An optoelectronic device comprising an optically active layer that includes a plurality of domes is presented. The plurality of domes is arrayed in two dimensions having a periodicity in each dimension that is less than or comparable with the shortest wavelength in a spectral range of interest. By virtue of the plurality of domes, the optoelectronic device achieves high performance. A solar cell having high energy-conversion efficiency, improved absorption over the spectral range of interest, and an improved acceptance angle is presented as an exemplary device.

Traffic Patrol Service Platform Scheduling and Containment Optimization Strategy

NASA Astrophysics Data System (ADS)

Wang, Tiane; Niu, Taiyang; Wan, Baocheng; Li, Jian

This article is based on the traffic and patrol police service platform settings and scheduling, in order to achieve the main purpose of rapid containment for the suspect in an emergency event. Proposing new boundary definition based on graph theory, using 0-1 programming, Dijkstra algorithm, the shortest path tree (SPT) and some of the related knowledge establish a containment model. Finally, making a combination with a city-specific data and using this model obtain the best containment plan.

Fast Solar-Blind AlGaN/GaN 2DEG UV detector with Transparent Graphene Electrode

DTIC Science & Technology

2017-03-01

graphene and 2D electron gas (2DEG). With introducing the graphene, photo-carriers separated by the polarization electric field of the AlGaN are...photodiodes, due to the strong intrinsic polarization effect of AlGaN. More than 105 of high signal to noise ratio of the UV detectors with fast...intrinsic polarization field vertically inside the AlGaN, the holes and electrons will travel in their shortest paths to graphene and 2DEG

Research on Crowdsourcing Emergency Information Extraction of Based on Events' Frame

NASA Astrophysics Data System (ADS)

Yang, Bo; Wang, Jizhou; Ma, Weijun; Mao, Xi

2018-01-01

At present, the common information extraction method cannot extract the structured emergency event information accurately; the general information retrieval tool cannot completely identify the emergency geographic information; these ways also do not have an accurate assessment of these results of distilling. So, this paper proposes an emergency information collection technology based on event framework. This technique is to solve the problem of emergency information picking. It mainly includes emergency information extraction model (EIEM), complete address recognition method (CARM) and the accuracy evaluation model of emergency information (AEMEI). EIEM can be structured to extract emergency information and complements the lack of network data acquisition in emergency mapping. CARM uses a hierarchical model and the shortest path algorithm and allows the toponomy pieces to be joined as a full address. AEMEI analyzes the results of the emergency event and summarizes the advantages and disadvantages of the event framework. Experiments show that event frame technology can solve the problem of emergency information drawing and provides reference cases for other applications. When the emergency disaster is about to occur, the relevant departments query emergency's data that has occurred in the past. They can make arrangements ahead of schedule which defense and reducing disaster. The technology decreases the number of casualties and property damage in the country and world. This is of great significance to the state and society.

Geographic divergence in upper thermal limits across insect life stages: does behavior matter?

PubMed

MacLean, Heidi J; Higgins, Jessica K; Buckley, Lauren B; Kingsolver, Joel G

2016-05-01

Insects with complex life cycles vary in size, mobility, and thermal ecology across life stages. We examine how differences in the capacity for thermoregulatory behavior influence geographic differences in physiological heat tolerance among egg and adult Colias butterflies. Colias adults exhibit differences in morphology (wing melanin and thoracic setal length) along spatial gradients, whereas eggs are morphologically indistinguishable. Here we compare Colias eriphyle eggs and adults from two elevations and Colias meadii from a high elevation. Hatching success and egg development time of C. eriphyle eggs did not differ significantly with the elevation of origin. Egg survival declined in response to heat-shock temperatures above 38-40 °C and egg development time was shortest at intermediate heat-shock temperatures of 33-38 °C. Laboratory experiments with adults showed survival in response to heat shock was significantly greater for Colias from higher than from lower elevation sites. Common-garden experiments at the low-elevation field site showed that C. meadii adults initiated heat-avoidance and over-heating behaviors significantly earlier in the day than C. eriphyle. Our study demonstrates the importance of examining thermal tolerances across life stages. Our findings are inconsistent with the hypothesis that thermoregulatory behavior inhibits the geographic divergence of physiological traits in mobile stages, and suggest that sessile stages may evolve similar heat tolerances in different environments due to microclimatic variability or evolutionary constraints.

Duration and quality of the peer review process: the author's perspective.

PubMed

Huisman, Janine; Smits, Jeroen

2017-01-01

To gain insight into the duration and quality of the scientific peer review process, we analyzed data from 3500 review experiences submitted by authors to the SciRev.sc website. Aspects studied are duration of the first review round, total review duration, immediate rejection time, the number, quality, and difficulty of referee reports, the time it takes authors to revise and resubmit their manuscript, and overall quality of the experience. We find clear differences in these aspects between scientific fields, with Medicine, Public health, and Natural sciences showing the shortest durations and Mathematics and Computer sciences, Social sciences, Economics and Business, and Humanities the longest. One-third of journals take more than 2 weeks for an immediate (desk) rejection and one sixth even more than 4 weeks. This suggests that besides the time reviewers take, inefficient editorial processes also play an important role. As might be expected, shorter peer review processes and those of accepted papers are rated more positively by authors. More surprising is that peer review processes in the fields linked to long processes are rated highest and those in the fields linked to short processes lowest. Hence authors' satisfaction is apparently influenced by their expectations regarding what is common in their field. Qualitative information provided by the authors indicates that editors can enhance author satisfaction by taking an independent position vis-à-vis reviewers and by communicating well with authors.

A Fast Numerical Method for Max-Convolution and the Application to Efficient Max-Product Inference in Bayesian Networks.

PubMed

Serang, Oliver

2015-08-01

Observations depending on sums of random variables are common throughout many fields; however, no efficient solution is currently known for performing max-product inference on these sums of general discrete distributions (max-product inference can be used to obtain maximum a posteriori estimates). The limiting step to max-product inference is the max-convolution problem (sometimes presented in log-transformed form and denoted as "infimal convolution," "min-convolution," or "convolution on the tropical semiring"), for which no O(k log(k)) method is currently known. Presented here is an O(k log(k)) numerical method for estimating the max-convolution of two nonnegative vectors (e.g., two probability mass functions), where k is the length of the larger vector. This numerical max-convolution method is then demonstrated by performing fast max-product inference on a convolution tree, a data structure for performing fast inference given information on the sum of n discrete random variables in O(nk log(nk)log(n)) steps (where each random variable has an arbitrary prior distribution on k contiguous possible states). The numerical max-convolution method can be applied to specialized classes of hidden Markov models to reduce the runtime of computing the Viterbi path from nk(2) to nk log(k), and has potential application to the all-pairs shortest paths problem.

The colloidal state of tannins impacts the nature of their interaction with proteins: the case of salivary proline-rich protein/procyanidins binding.

PubMed

Cala, Olivier; Dufourc, Erick J; Fouquet, Eric; Manigand, Claude; Laguerre, Michel; Pianet, Isabelle

2012-12-18

While the definition of tannins has been historically associated with its propensity to bind proteins in a nonspecific way, it is now admitted that specific interaction also occurs. The case of the astringency perception is a good example to illustrate this phenomenon: astringency is commonly described as a tactile sensation induced by the precipitation of a complex composed of proline-rich proteins present in the human saliva and tannins present in beverages such as tea or red wines. In the present work, the interactions between a human saliva protein segment and three different procyanidins (B1, B3, and C2) were investigated at the atomic level by NMR and molecular dynamics. The data provided evidence for (i) an increase in affinity compared to shortest human saliva peptides, which is accounted for by protein "wraping around" the tannin, (ii) a specificity in the interaction below tannin critical micelle concentration (CMC) of ca. 10 mM, with an affinity scale such that C2 > B1 > B3, and (iii) a nonspecific binding above tannin CMC that conducts irremediably to the precipitation of the tannins/protein complex. Such physicochemical findings describe in accurate terms saliva protein-tannin interactions and provide support for a more subtle description by oenologists of wine astringency perception in the mouth.

The use of network analysis to study complex animal communication systems: a study on nightingale song.

PubMed

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-06-22

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the 'small-world' character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval.

The use of network analysis to study complex animal communication systems: a study on nightingale song

PubMed Central

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-01-01

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the ‘small-world’ character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval. PMID:24807258

Efficient HIV-1 inhibition by a 16 nt-long RNA aptamer designed by combining in vitro selection and in silico optimisation strategies

PubMed Central

Sánchez-Luque, Francisco J.; Stich, Michael; Manrubia, Susanna; Briones, Carlos; Berzal-Herranz, Alfredo

2014-01-01

The human immunodeficiency virus type-1 (HIV-1) genome contains multiple, highly conserved structural RNA domains that play key roles in essential viral processes. Interference with the function of these RNA domains either by disrupting their structures or by blocking their interaction with viral or cellular factors may seriously compromise HIV-1 viability. RNA aptamers are amongst the most promising synthetic molecules able to interact with structural domains of viral genomes. However, aptamer shortening up to their minimal active domain is usually necessary for scaling up production, what requires very time-consuming, trial-and-error approaches. Here we report on the in vitro selection of 64 nt-long specific aptamers against the complete 5′-untranslated region of HIV-1 genome, which inhibit more than 75% of HIV-1 production in a human cell line. The analysis of the selected sequences and structures allowed for the identification of a highly conserved 16 nt-long stem-loop motif containing a common 8 nt-long apical loop. Based on this result, an in silico designed 16 nt-long RNA aptamer, termed RNApt16, was synthesized, with sequence 5′-CCCCGGCAAGGAGGGG-3′. The HIV-1 inhibition efficiency of such an aptamer was close to 85%, thus constituting the shortest RNA molecule so far described that efficiently interferes with HIV-1 replication. PMID:25175101

[Possibilities of fast track surgery principles in the treatment of congenital urological anomalies].

PubMed

Bižić, Marta R; Cvetinović, Nataša; Majstorović, Marko J; Radojčić, Zoran; Vukadinović, Vojkan; Krstić, Zoran; Djordjević, Miroslav L

2012-01-01

Urogenital congenital anomalies are among the most common congenital anomalies and very frequent pathology in paediatric urology. Health care systems strive to shorten the duration and reduce the costs of hospitalization, while maintaining treatment effectiveness. To evaluate the duration of hospital stay of surgically treated patients with congenital urogenital anomalies and estimate the possibility of using fast track surgery principles in paediatric urology in the local settings of a developing country. Retrospective non-randomized study included 552 patients who had been surgically treated at the Urology Department of the University Children's Hospital, during 2010. In line with their congenital anomalies, all patients were classified in one of four groups: I--upper urinary tract anomalies (252 patients); II--genital anomalies (164 patients); III--testicular anomalies (76 patients) and IV--associated anomalies (60 patients). We analyzed the total duration of stay as well as pre- and post-operative stay in the hospital. The average duration of hospitalization was 4.7 +/- 4.0 days. Patients with testicular anomalies stayed for the shortest period (2.3 +/- 1.9 days) (p < 0.01) and patients with associated anomalies stayed in the hospital the longest (6.5 +/- 4.7 days) (p < 0.01). Modern methods of surgical treatment allow reduction of hospitalization, financial savings to the healthcare system and greater comfort for patients. Our results showed that this is also possible to apply in our environment.

Neurovascular Structures at Risk With Curved Retrograde TTC Fusion Nails.

PubMed

de Cesar Netto, Cesar; Johannesmeyer, David; Cone, Brent; Araoye, Ibukunoluwa; Hudson, Parke William; Sahranavard, Bahman; Johnson, Michael; Shah, Ashish

2017-10-01

The purpose of this study was to assess the risk of iatrogenic injury to plantar neurovascular structures of the foot during insertion of a curved retrograde tibiotalocalcaneal (TTC) fusion nail. Ten below-knee thawed fresh-frozen cadaveric specimens underwent curved retrograde nailing of the ankle. The shortest distance between the nail and the main plantar neurovascular branches and injured structures were recorded during dissection. We also evaluated the relative position of these structures along 2 lines (AB, connecting the calcaneus to the first metatarsal, and BC, connecting the first and fifth metatarsal). The lateral plantar artery was found to be in direct contact with the nail 70% of the time, with a macroscopic laceration 30% of the time. The Baxter nerve was injured 20% of the time, as was the lateral plantar nerve. The medial plantar artery and nerve were never injured. The most proximal structure to cross line AB was the Baxter nerve followed by the lateral plantar artery, the nail, the lateral plantar nerve, and the medial plantar nerve. Our cadaveric anatomic study found that the most common structures at risk for iatrogenic injury by lateral curved retrograde TTC fusion nails were the lateral plantar artery and nerve, and the Baxter nerve. Determination of a true neurovascular safe zone is challenging and therefore warrants careful operative dissection to minimize neurovascular injuries.

Multiparametric Flow Cytometry Using Near-Infrared Fluorescent Proteins Engineered from Bacterial Phytochromes

PubMed Central

Telford, William G.; Shcherbakova, Daria M.; Buschke, David; Hawley, Teresa S.; Verkhusha, Vladislav V.

2015-01-01

Engineering of fluorescent proteins (FPs) has followed a trend of achieving longer fluorescence wavelengths, with the ultimate goal of producing proteins with both excitation and emission in the near-infrared (NIR) region of the spectrum. Flow cytometers are now almost universally equipped with red lasers, and can now be equipped with NIR lasers as well. Most red-shifted FPs of the GFP-like family are maximally excited by orange lasers (590 to 610 nm) not commonly found on cytometers. This has changed with the development of the iRFP series of NIR FPs from the protein family of bacterial phytochromes. The shortest wavelength variants of this series, iRFP670 and iRFP682 showed maximal excitation with visible red lasers. The longer wavelength variants iRFP702, iRFP713 and iRFP720 could be optimally excited by NIR lasers ranging from 685 to 730 nm. Pairs of iRFPs could be detected simultaneously by using red and NIR lasers. Moreover, a novel spectral cytometry technique, which relies on spectral deconvolution rather than optical filters, allowed spectra of all five iRFPs to be analyzed simultaneously with no spectral overlap. Together, the combination of iRFPs with the advanced flow cytometry will allow to first image tissues expressing iRFPs deep in live animals and then quantify individual cell intensities and sort out the distinct primary cell subpopulations ex vivo. PMID:25811854

A unified framework for spiking and gap-junction interactions in distributed neuronal network simulations.

PubMed

Hahne, Jan; Helias, Moritz; Kunkel, Susanne; Igarashi, Jun; Bolten, Matthias; Frommer, Andreas; Diesmann, Markus

2015-01-01

Contemporary simulators for networks of point and few-compartment model neurons come with a plethora of ready-to-use neuron and synapse models and support complex network topologies. Recent technological advancements have broadened the spectrum of application further to the efficient simulation of brain-scale networks on supercomputers. In distributed network simulations the amount of spike data that accrues per millisecond and process is typically low, such that a common optimization strategy is to communicate spikes at relatively long intervals, where the upper limit is given by the shortest synaptic transmission delay in the network. This approach is well-suited for simulations that employ only chemical synapses but it has so far impeded the incorporation of gap-junction models, which require instantaneous neuronal interactions. Here, we present a numerical algorithm based on a waveform-relaxation technique which allows for network simulations with gap junctions in a way that is compatible with the delayed communication strategy. Using a reference implementation in the NEST simulator, we demonstrate that the algorithm and the required data structures can be smoothly integrated with existing code such that they complement the infrastructure for spiking connections. To show that the unified framework for gap-junction and spiking interactions achieves high performance and delivers high accuracy in the presence of gap junctions, we present benchmarks for workstations, clusters, and supercomputers. Finally, we discuss limitations of the novel technology.

The vulnerability of the global container shipping network to targeted link disruption

NASA Astrophysics Data System (ADS)

Viljoen, Nadia M.; Joubert, Johan W.

2016-11-01

Using complex network theory to describe the relational geography of maritime networks has provided great insights regarding their hierarchy and evolution over the past two decades. Unlike applications in other transport fields, notably air transport, complex network theory has had limited application in studying the vulnerability of maritime networks. This study uses targeted link disruption to investigate the strategy specific vulnerability of the network. Although nodal infrastructure such as ports can render a network vulnerable as a result of labour strikes, trade embargoes or natural disasters, it is the shipping lines connecting the ports that are more probably disrupted, either from within the industry, or outside. In this paper, we apply and evaluate two link-based disruption strategies on the global container shipping network, one based on link betweenness, and the other on link salience, to emulate the impact of large-scale service reconfiguration affecting priority links. The results show that the network is by and large robust to such reconfiguration. Meanwhile the flexibility of the network is reduced by both strategies, but to a greater degree by betweenness, resulting in a reduction of transshipment and dynamic rerouting potential amongst the busiest port regions. The results further show that the salience strategy is highly effective in reducing the commonality of shortest path sets, thereby diminishing opportunities for freight consolidation and scale economies.

A unified framework for spiking and gap-junction interactions in distributed neuronal network simulations

PubMed Central

Hahne, Jan; Helias, Moritz; Kunkel, Susanne; Igarashi, Jun; Bolten, Matthias; Frommer, Andreas; Diesmann, Markus

2015-01-01

Contemporary simulators for networks of point and few-compartment model neurons come with a plethora of ready-to-use neuron and synapse models and support complex network topologies. Recent technological advancements have broadened the spectrum of application further to the efficient simulation of brain-scale networks on supercomputers. In distributed network simulations the amount of spike data that accrues per millisecond and process is typically low, such that a common optimization strategy is to communicate spikes at relatively long intervals, where the upper limit is given by the shortest synaptic transmission delay in the network. This approach is well-suited for simulations that employ only chemical synapses but it has so far impeded the incorporation of gap-junction models, which require instantaneous neuronal interactions. Here, we present a numerical algorithm based on a waveform-relaxation technique which allows for network simulations with gap junctions in a way that is compatible with the delayed communication strategy. Using a reference implementation in the NEST simulator, we demonstrate that the algorithm and the required data structures can be smoothly integrated with existing code such that they complement the infrastructure for spiking connections. To show that the unified framework for gap-junction and spiking interactions achieves high performance and delivers high accuracy in the presence of gap junctions, we present benchmarks for workstations, clusters, and supercomputers. Finally, we discuss limitations of the novel technology. PMID:26441628

Chemotaxis without Conventional Two-Component System, Based on Cell Polarity and Aerobic Conditions in Helicity-Switching Swimming of Spiroplasma eriocheiris

PubMed Central

Liu, Peng; Zheng, Huajun; Meng, Qingguo; Terahara, Natsuho; Gu, Wei; Wang, Shengyue; Zhao, Guoping; Nakane, Daisuke; Wang, Wen; Miyata, Makoto

2017-01-01

Spiroplasma eriocheiris is a pathogen that causes mass mortality in Chinese mitten crab, Eriocheir sinensis. S. eriocheiris causes tremor disease and infects almost all of the artificial breeding crustaceans, resulting in disastrous effects on the aquaculture economy in China. S. eriocheiris is a wall-less helical bacterium, measuring 2.0 to 10.0 μm long, and can swim up to 5 μm per second in a viscous medium without flagella by switching the cell helicity at a kink traveling from the front to the tail. In this study, we showed that S. eriocheiris performs chemotaxis without the conventional two-component system, a system commonly found in bacterial chemotaxis. The chemotaxis of S. eriocheiris was observed more clearly when the cells were cultivated under anaerobic conditions. The cells were polarized as evidenced by a tip structure, swimming in the direction of the tip, and were shown to reverse their swimming direction in response to attractants. Triton X-100 treatment revealed the internal structure, a dumbbell-shaped core in the tip that is connected by a flat ribbon, which traces the shortest line in the helical cell shape from the tip to the other pole. Sixteen proteins were identified as the components of the internal structure by mass spectrometry, including Fibril protein and four types of MreB proteins. PMID:28217108

Multiparametric flow cytometry using near-infrared fluorescent proteins engineered from bacterial phytochromes.

PubMed

Telford, William G; Shcherbakova, Daria M; Buschke, David; Hawley, Teresa S; Verkhusha, Vladislav V

2015-01-01

Engineering of fluorescent proteins (FPs) has followed a trend of achieving longer fluorescence wavelengths, with the ultimate goal of producing proteins with both excitation and emission in the near-infrared (NIR) region of the spectrum. Flow cytometers are now almost universally equipped with red lasers, and can now be equipped with NIR lasers as well. Most red-shifted FPs of the GFP-like family are maximally excited by orange lasers (590 to 610 nm) not commonly found on cytometers. This has changed with the development of the iRFP series of NIR FPs from the protein family of bacterial phytochromes. The shortest wavelength variants of this series, iRFP670 and iRFP682 showed maximal excitation with visible red lasers. The longer wavelength variants iRFP702, iRFP713 and iRFP720 could be optimally excited by NIR lasers ranging from 685 to 730 nm. Pairs of iRFPs could be detected simultaneously by using red and NIR lasers. Moreover, a novel spectral cytometry technique, which relies on spectral deconvolution rather than optical filters, allowed spectra of all five iRFPs to be analyzed simultaneously with no spectral overlap. Together, the combination of iRFPs with the advanced flow cytometry will allow to first image tissues expressing iRFPs deep in live animals and then quantify individual cell intensities and sort out the distinct primary cell subpopulations ex vivo.

Clinical Features of 294 Turkish Patients with Chronic Myeloproliferative Neoplasms

PubMed Central

Andıç, Neslihan; Ünübol, Mustafa; Yağcı, Eren; Akay, Olga Meltem; Yavaşoğlu, İrfan; Kadıköylü, Vefki Gürhan; Bolaman, Ali Zahit

2016-01-01

Objective: Myeloproliferative neoplasms (MPNs) share common clonal stem cells but show significant differences in their clinical courses. The aim of this retrospective study was to evaluate thrombotic and hemorrhagic complications, JAK2 status, gastrointestinal and cardiac changes, treatment modalities, and survival in MPNs in Turkish patients. Materials and Methods: Medical files of 294 patients [112 essential thrombocythemia (ET), 117 polycythemia vera (PV), 46 primary myelofibrosis, and 19 unclassified MPN cases] from 2 different universities in Turkey were examined. Results: Older age, higher leukocyte count at diagnosis, and JAK2 mutation positivity were risk factors for thrombosis. Platelet count over 1000x109/L was a risk factor for hemorrhagic episodes. Hydroxyurea treatment was not related to leukemic transformation. Median follow-up time was 50 months (quartiles: 22.2-81.75) in these patients. Patients with primary myelofibrosis had the shortest survival of 137 months when compared with 179 months for ET and 231 months for PV. Leukemic transformation, thromboembolic events, age over 60 years, and anemia were found to be the factors affecting survival. Conclusion: Thromboembolic complications are the most important preventable risk factors for morbidity and mortality in MPNs. Drug management in MPNs is done according to hemoglobin and platelet counts. Based on the current study population our results support the idea that leukocytosis and JAK2 positivity are more important risk factors for thrombosis than hemoglobin and platelet values. PMID:27094255

Photoluminescence Spectroscopy of Rhodamine 800 Aqueous Solution and Dye-Doped Polymer Thin-Film: Concentration and Solvent Effects

NASA Astrophysics Data System (ADS)

Le, Khai Q.; Dang, Ngo Hai

2018-05-01

This paper investigates solvent and concentration effects on photoluminescence (PL) or fluorescence properties of Rhodamine 800 (Rho800) dyes formed in aqueous solution and polymer thin-film. Various commonly used organic solvents including ethanol, methanol and cyclopentanol were studied at a constant dye concentration. There were small changes in the PL spectra for the different solvents in terms of PL intensity and peak wavelength. The highest PL intensity was observed for cyclopentanol and the lowest for ethanol. The longest peak wavelength was found in cyclopentanol (716 nm) and the shortest in methanol (708 nm). Dissolving the dye powder in the methanol solvent and varying the dye concentration in aqueous solution from the high concentrated solution to highly dilute states, the wavelength tunability was observed between about 700 nm in the dilute state and 730 nm at high concentration. Such a large shift may be attributed to the formation of dye aggregates. Rho800 dye-doped polyvinyl alcohol (PVA) polymer thin-film was further investigated. The PL intensity of the dye in the form of thin-film is lower than that of the aqueous solution form whereas the peak wavelength is redshifted due to the presence of PVA. This paper, to our best knowledge, reports the first study of spectroscopic properties of Rho800 dyes in various forms and provides useful guidelines for production of controllable organic luminescence sources.

Defining wild-type life span in Caenorhabditis elegans.

PubMed

Gems, D; Riddle, D L

2000-05-01

The nematode Caenorhabditis elegans reproduces predominantly as a self-fertilizing hermaphrodite, and this drives laboratory populations to be homozygous at all genetic loci. Passaging of stocks can lead to fixation of spontaneous mutations, especially when the latter do not result in a selective disadvantage under laboratory conditions. Life span may be such a trait, since a comparison of six wild-type N2 lines derived from a common ancestor (but maintained separately in several laboratories) revealed four variants with median adult life spans ranging from 12.0 +/- 0.8 to 17.0 +/- 0.6 days at 20 degrees C. Fertility was also reduced in the two shortest-lived strains. We determined which life span most closely corresponds to that of the authentic wild type by two means. Firstly, N2 hermaphrodites were compared with seven C. elegans wild isolates. The latter were found to resemble only the longest-lived N2 strain. Comparison of male life spans of six lines also revealed additional strain variation. Secondly, life spans of F1 progeny issuing from crosses between N2 variants showed that short life spans were recessive, indicating that they result from loss-of-function mutations. We infer that the longest-lived N2 variant best resembles the original N2 isolate. This is the N2 male stock currently distributed by the Caenorhabditis Genetics Center.

Extracting contours of oval-shaped objects by Hough transform and minimal path algorithms

NASA Astrophysics Data System (ADS)

Tleis, Mohamed; Verbeek, Fons J.

2014-04-01

Circular and oval-like objects are very common in cell and micro biology. These objects need to be analyzed, and to that end, digitized images from the microscope are used so as to come to an automated analysis pipeline. It is essential to detect all the objects in an image as well as to extract the exact contour of each individual object. In this manner it becomes possible to perform measurements on these objects, i.e. shape and texture features. Our measurement objective is achieved by probing contour detection through dynamic programming. In this paper we describe a method that uses Hough transform and two minimal path algorithms to detect contours of (ovoid-like) objects. These algorithms are based on an existing grey-weighted distance transform and a new algorithm to extract the circular shortest path in an image. The methods are tested on an artificial dataset of a 1000 images, with an F1-score of 0.972. In a case study with yeast cells, contours from our methods were compared with another solution using Pratt's figure of merit. Results indicate that our methods were more precise based on a comparison with a ground-truth dataset. As far as yeast cells are concerned, the segmentation and measurement results enable, in future work, to retrieve information from different developmental stages of the cell using complex features.

Nailfold Capillaroscopy Within and Beyond the Scope of Connective Tissue Diseases.

PubMed

Lambova, Sevdalina Nikolova; Muller-Ladner, Ulf

2018-04-20

Nailfold capillaroscopy is a noninvasive instrumental method for morphological analysis of the nutritive capillaries in the nailfold area. In rheumatology, it is a method of choice among instrumental modalities for differential diagnosis between primary and secondary Raynaud's phenomenon (RP) in systemic rheumatic diseases. RP is a common diagnostic problem in rheumatology. Defining the proper diagnosis is a prerequisite for administration of the appropriate treatment. Thus, nailfold capillaroscopic examination is of crucial importance for the every-day practice of the rheumatologists and is currently gaining increasing attention. The most specific capillaroscopic changes are observed in Systemic Sclerosis (SSc). Due to the high prevalence of the capillaroscopic changes in this clinical entity and their early appearance, they could be used for early and very early diagnosis of the disease. More recently, "scleroderma" type capillaroscopic changes have been defined as diagnostic criterion in the new EULAR/ACR classification criteria for SSc together with the presence of scleroderma-related autoantibodies, RP, telangiectasia and other clinical signs. Capillaroscopic changes in other connective tissue diseases and in different rheumatic-like conditions like those in diabetes mellitus (e.g., diabetic stiff-hand syndrome) and paraneoplastic syndromes associated with microvascular pathology should be interpreted properly in order to obtain precise diagnosis in the shortest possible differential diagnostic process. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Energetic Physiology Mediates Individual Optimization of Breeding Phenology in a Migratory Arctic Seabird.

PubMed

Hennin, Holly L; Bêty, Jöel; Legagneux, Pierre; Gilchrist, H Grant; Williams, Tony D; Love, Oliver P

2016-10-01

The influence of variation in individual state on key reproductive decisions impacting fitness is well appreciated in evolutionary ecology. Rowe et al. (1994) developed a condition-dependent individual optimization model predicting that three key factors impact the ability of migratory female birds to individually optimize breeding phenology to maximize fitness in seasonal environments: arrival condition, arrival date, and ability to gain in condition on the breeding grounds. While empirical studies have confirmed that greater arrival body mass and earlier arrival dates result in earlier laying, no study has assessed whether individual variation in energetic management of condition gain effects this key fitness-related decision. Using an 8-year data set from over 350 prebreeding female Arctic common eiders (Somateria mollissima), we tested this component of the model by examining whether individual variation in two physiological traits influencing energetic management (plasma triglycerides: physiological fattening rate; baseline corticosterone: energetic demand) predicted individual variation in breeding phenology after controlling for arrival date and body mass. As predicted by the optimization model, individuals with higher fattening rates and lower energetic demand had the earliest breeding phenology (shortest delays between arrival and laying; earliest laying dates). Our results are the first to empirically determine that individual flexibility in prebreeding energetic management influences key fitness-related reproductive decisions, suggesting that individuals have the capacity to optimally manage reproductive investment.

Identification of genes related to proliferative diabetic retinopathy through RWR algorithm based on protein-protein interaction network.

PubMed

Zhang, Jian; Suo, Yan; Liu, Min; Xu, Xun

2018-06-01

Proliferative diabetic retinopathy (PDR) is one of the most common complications of diabetes and can lead to blindness. Proteomic studies have provided insight into the pathogenesis of PDR and a series of PDR-related genes has been identified but are far from fully characterized because the experimental methods are expensive and time consuming. In our previous study, we successfully identified 35 candidate PDR-related genes through the shortest-path algorithm. In the current study, we developed a computational method using the random walk with restart (RWR) algorithm and the protein-protein interaction (PPI) network to identify potential PDR-related genes. After some possible genes were obtained by the RWR algorithm, a three-stage filtration strategy, which includes the permutation test, interaction test and enrichment test, was applied to exclude potential false positives caused by the structure of PPI network, the poor interaction strength, and the limited similarity on gene ontology (GO) terms and biological pathways. As a result, 36 candidate genes were discovered by the method which was different from the 35 genes reported in our previous study. A literature review showed that 21 of these 36 genes are supported by previous experiments. These findings suggest the robustness and complementary effects of both our efforts using different computational methods, thus providing an alternative method to study PDR pathogenesis. Copyright © 2017 Elsevier B.V. All rights reserved.

Boundary singularities produced by the motion of soap films.

PubMed

Goldstein, Raymond E; McTavish, James; Moffatt, H Keith; Pesci, Adriana I

2014-06-10

Recent work has shown that a Möbius strip soap film rendered unstable by deforming its frame changes topology to that of a disk through a "neck-pinching" boundary singularity. This behavior is unlike that of the catenoid, which transitions to two disks through a bulk singularity. It is not yet understood whether the type of singularity is generally a consequence of the surface topology, nor how this dependence could arise from an equation of motion for the surface. To address these questions we investigate experimentally, computationally, and theoretically the route to singularities of soap films with different topologies, including a family of punctured Klein bottles. We show that the location of singularities (bulk or boundary) may depend on the path of the boundary deformation. In the unstable regime the driving force for soap-film motion is the mean curvature. Thus, the narrowest part of the neck, associated with the shortest nontrivial closed geodesic of the surface, has the highest curvature and is the fastest moving. Just before onset of the instability there exists on the stable surface the shortest closed geodesic, which is the initial condition for evolution of the neck's geodesics, all of which have the same topological relationship to the frame. We make the plausible conjectures that if the initial geodesic is linked to the boundary, then the singularity will occur at the boundary, whereas if the two are unlinked initially, then the singularity will occur in the bulk. Numerical study of mean curvature flows and experiments support these conjectures.

The Shortest Period sdB Plus White Dwarf Binary CD-30 11223 (GALEX J1411-3053)

NASA Astrophysics Data System (ADS)

Vennes, S.; Kawka, A.; O'Toole, S. J.; Németh, P.; Burton, D.

2012-11-01

We report on the discovery of the shortest period binary comprising a hot subdwarf star (CD-30 11223, GALEX J1411-3053) and a massive unseen companion. Photometric data from the All Sky Automated Survey show ellipsoidal variations of the hot subdwarf primary and spectroscopic series revealed an orbital period of 70.5 minutes. The large velocity amplitude suggests the presence of a massive white dwarf in the system (M 2/M ⊙ >~ 0.77) assuming a canonical mass for the hot subdwarf (0.48 M ⊙), although a white dwarf mass as low as 0.75 M ⊙ is allowable by postulating a subdwarf mass as low as 0.44 M ⊙. The amplitude of ellipsoidal variations and a high rotation velocity imposed a high-inclination to the system (i >~ 68°) and, possibly, observable secondary transits (i >~ 74°). At the lowest permissible inclination and assuming a subdwarf mass of ~0.48 M ⊙, the total mass of the system reaches the Chandrasekhar mass limit at 1.35 M ⊙ and would exceed it for a subdwarf mass above 0.48 M ⊙. The system should be considered, like its sibling KPD 1930+2752, a candidate progenitor for a Type Ia supernova. The system should become semi-detached and initiate mass transfer within ≈30 Myr. Based on observations made with ESO telescopes at the La Silla Paranal Observatory under program IDs 83.D-0540, 85.D-0866, and 089.D-0864.

Detours in long-distance migration across the Qinghai-Tibetan Plateau: individual consistency and habitat associations.

PubMed

Liu, Dongping; Zhang, Guogang; Jiang, Hongxing; Lu, Jun

2018-01-01

Migratory birds often follow detours when confronted with ecological barriers, and understanding the extent and the underlying drivers of such detours can provide important insights into the associated cost to the annual energy budget and the migration strategies. The Qinghai-Tibetan Plateau is the most daunting geographical barrier for migratory birds because the partial pressure of oxygen is dramatically reduced and flight costs greatly increase. We analyzed the repeated migration detours and habitat associations of four Pallas's Gulls Larus ichthyaetus across the Qinghai-Tibetan Plateau over 22 migration seasons. Gulls exhibited notable detours, with the maximum distance being more than double that of the expected shortest route, that extended rather than reduced the passage across the plateau. The extent of longitudinal detours significantly increased with latitude, and detours were longer in autumn than in spring. Compared with the expected shortest routes, proximity to water bodies increased along autumn migration routes, but detour-habitat associations were weak along spring migration routes. Thus, habitat availability was likely one, but not the only, factor shaping the extent of detours, and migration routes were determined by different mechanisms between seasons. Significant between-individual variation but high individual consistency in migration timing and routes were revealed in both seasons, indicating a stronger influence of endogenous schedules than local environmental conditions. Gulls may benefit from repeated use of familiar routes and stopover sites, which may be particularly significant in the challenging environment of the Qinghai-Tibetan Plateau.

The effects of prosthetic foot roll-over shape arc length on the gait of trans-tibial prosthesis users.

PubMed

Hansen, Andrew H; Meier, Margrit R; Sessoms, Pinata H; Childress, Dudley S

2006-12-01

The Shape&Roll prosthetic foot was used to examine the effect of roll-over shape arc length on the gait of 14 unilateral trans-tibial prosthesis users. Simple modifications to the prosthetic foot were used to alter the effective forefoot rocker length, leaving factors such as alignment, limb length, and heel and mid-foot characteristics unchanged. Shortening the roll-over shape arc length caused a significant reduction in the maximum external dorsiflexion moment on the prosthetic side at all walking speeds (p < 0.001 for main effect of arc length), due to a reduction in forefoot leverage (moment arm) about the ankle. Roll-over shape arc length significantly affected the initial loading on the sound limb at normal and fast speeds (p = 0.001 for the main effect of arc length), with participants experiencing larger first peaks of vertical ground reaction forces on their sound limbs when using the foot with the shortest effective forefoot rocker arc length. Additionally, the difference between step lengths on the sound and prosthetic limbs was larger with the shortest arc length condition, although this difference was not statistically significant (p = 0.06 for main effect). It appears that prosthesis users may experience a drop-off effect at the end of single limb stance on prosthetic feet with short roll-over shape arc lengths, leading to increased loading and/or a shortened step on the contralateral limb.

Microdosimetric study for nanosecond pulsed electric fields on a cell circuit model with nucleus.

PubMed

Denzi, Agnese; Merla, Caterina; Camilleri, Paola; Paffi, Alessandra; d'Inzeo, Guglielmo; Apollonio, Francesca; Liberti, Micaela

2013-10-01

Recently, scientific interest in electric pulses, always more intense and shorter and able to induce biological effects on both plasma and nuclear membranes, has greatly increased. Hence, microdosimetric models that include internal organelles like the nucleus have assumed increasing importance. In this work, a circuit model of the cell including the nucleus is proposed, which accounts for the dielectric dispersion of all cell compartments. The setup of the dielectric model of the nucleus is of fundamental importance in determining the transmembrane potential (TMP) induced on the nuclear membrane; here, this is demonstrated by comparing results for three different sets of nuclear dielectric properties present in the literature. The results have been compared, even including or disregarding the dielectric dispersion of the nucleus. The main differences have been found when using pulses shorter than 10 ns. This is due to the fact that the high spectral components of the shortest pulses are differently taken into account by the nuclear membrane transfer functions computed with and without nuclear dielectric dispersion. The shortest pulses are also the most effective in porating the intracellular structures, as confirmed by the time courses of the TMP calculated across the plasma and nuclear membranes. We show how dispersive nucleus models are unavoidable when dealing with pulses shorter than 10 ns because of the large spectral contents arriving above 100 MHz, i.e., over the typical relaxation frequencies of the dipolar mechanism of the molecules constituting the nuclear membrane and the subcellular cell compartments.

Effect of longer health service provider delays on stage at diagnosis and mortality in symptomatic breast cancer.

PubMed

Murchie, P; Raja, E A; Lee, A J; Brewster, D H; Campbell, N C; Gray, N M; Ritchie, L D; Robertson, R; Samuel, L

2015-06-01

This study explored whether longer provider delays (between first presentation and treatment) were associated with later stage and poorer survival in women with symptomatic breast cancer. Data from 850 women with symptomatic breast cancer were linked with the Scottish Cancer Registry; Death Registry; and hospital discharge dataset. Logistic regression and Cox survival analyses with restricted cubic splines explored relationships between provider delays, stage and survival, with sequential adjustment for patient and tumour factors. Although confidence intervals were wide in both adjusted analyses, those with the shortest provider delays had more advanced breast cancer at diagnosis. Beyond approximately 20 weeks, the trend suggests longer delays are associated with more advanced stage, but is not statistically significant. Those with symptomatic breast cancer and the shortest presentation to treatment time (within 4 weeks) had the poorest survival. Longer time to treatment was not significantly associated with worsening mortality. Poor prognosis patients with breast cancer are being triaged for rapid treatment with limited effect on outcome. Prolonged time to treatment does not appear to be strongly associated with poorer outcomes for patients with breast cancer, but the power of this study to assess the effect of very long delays (>25 weeks) was limited. Efforts to reduce waiting times are important from a quality of life perspective, but tumour biology may often be a more important determinant of stage at diagnosis and survival outcome. Copyright © 2015 Elsevier Ltd. All rights reserved.

Tree-space statistics and approximations for large-scale analysis of anatomical trees.

PubMed

Feragen, Aasa; Owen, Megan; Petersen, Jens; Wille, Mathilde M W; Thomsen, Laura H; Dirksen, Asger; de Bruijne, Marleen

2013-01-01

Statistical analysis of anatomical trees is hard to perform due to differences in the topological structure of the trees. In this paper we define statistical properties of leaf-labeled anatomical trees with geometric edge attributes by considering the anatomical trees as points in the geometric space of leaf-labeled trees. This tree-space is a geodesic metric space where any two trees are connected by a unique shortest path, which corresponds to a tree deformation. However, tree-space is not a manifold, and the usual strategy of performing statistical analysis in a tangent space and projecting onto tree-space is not available. Using tree-space and its shortest paths, a variety of statistical properties, such as mean, principal component, hypothesis testing and linear discriminant analysis can be defined. For some of these properties it is still an open problem how to compute them; others (like the mean) can be computed, but efficient alternatives are helpful in speeding up algorithms that use means iteratively, like hypothesis testing. In this paper, we take advantage of a very large dataset (N = 8016) to obtain computable approximations, under the assumption that the data trees parametrize the relevant parts of tree-space well. Using the developed approximate statistics, we illustrate how the structure and geometry of airway trees vary across a population and show that airway trees with Chronic Obstructive Pulmonary Disease come from a different distribution in tree-space than healthy ones. Software is available from http://image.diku.dk/aasa/software.php.

Altered brain structural connectivity in post-traumatic stress disorder: a diffusion tensor imaging tractography study.

PubMed

Long, Zhiliang; Duan, Xujun; Xie, Bing; Du, Handan; Li, Rong; Xu, Qiang; Wei, Luqing; Zhang, Shao-xiang; Wu, Yi; Gao, Qing; Chen, Huafu

2013-09-25

Post-traumatic stress disorder (PTSD) is characterized by dysfunction of several discrete brain regions such as medial prefrontal gyrus with hypoactivation and amygdala with hyperactivation. However, alterations of large-scale whole brain topological organization of structural networks remain unclear. Seventeen patients with PTSD in motor vehicle accident survivors and 15 normal controls were enrolled in our study. Large-scale structural connectivity network (SCN) was constructed using diffusion tensor tractography, followed by thresholding the mean factional anisotropy matrix of 90 brain regions. Graph theory analysis was then employed to investigate their aberrant topological properties. Both patient and control group showed small-world topology in their SCNs. However, patients with PTSD exhibited abnormal global properties characterized by significantly decreased characteristic shortest path length and normalized characteristic shortest path length. Furthermore, the patient group showed enhanced nodal centralities predominately in salience network including bilateral anterior cingulate and pallidum, and hippocampus/parahippocamus gyrus, and decreased nodal centralities mainly in medial orbital part of superior frontal gyrus. The main limitation of this study is the small sample of PTSD patients, which may lead to decrease the statistic power. Consequently, this study should be considered an exploratory analysis. These results are consistent with the notion that PTSD can be understood by investigating the dysfunction of large-scale, spatially distributed neural networks, and also provide structural evidences for further exploration of neurocircuitry models in PTSD. © 2013 Elsevier B.V. All rights reserved.

Biodosimetry estimate for high-LET irradiation.

PubMed

Wang, Z Z; Li, W J; Zhi, D J; Jing, X G; Wei, W; Gao, Q X; Liu, B

2007-08-01

The purpose of this paper is to prepare for an easy and reliable biodosimeter protocol for radiation accidents involving high-linear energy transfer (LET) exposure. Human peripheral blood lymphocytes were irradiated using carbon ions (LET: 34.6 keV microm(-1)), and the chromosome aberrations induced were analyzed using both a conventional colcemid block method and a calyculin A induced premature chromosome condensation (PCC) method. At a lower dose range (0-4 Gy), the measured dicentric (dics) and centric ring chromosomes (cRings) provided reasonable dose information. At higher doses (8 Gy), however, the frequency of dics and cRings was not suitable for dose estimation. Instead, we found that the number of Giemsa-stained drug-induced G2 prematurely condensed chromosomes (G2-PCC) can be used for dose estimation, since the total chromosome number (including fragments) was linearly correlated with radiation dose (r = 0.99). The ratio of the longest and the shortest chromosome length of the drug-induced G2-PCCs increased with radiation dose in a linear-quadratic manner (r = 0.96), which indicates that this ratio can also be used to estimate radiation doses. Obviously, it is easier to establish the dose response curve using the PCC technique than using the conventional metaphase chromosome method. It is assumed that combining the ratio of the longest and the shortest chromosome length with analysis of the total chromosome number might be a valuable tool for rapid and precise dose estimation for victims of radiation accidents.

A characterization of the coupled evolution of grain fabric and pore space using complex networks: Pore connectivity and optimized flows in the presence of shear bands

NASA Astrophysics Data System (ADS)

Russell, Scott; Walker, David M.; Tordesillas, Antoinette

2016-03-01

A framework for the multiscale characterization of the coupled evolution of the solid grain fabric and its associated pore space in dense granular media is developed. In this framework, a pseudo-dual graph transformation of the grain contact network produces a graph of pores which can be readily interpreted as a pore space network. Survivability, a new metric succinctly summarizing the connectivity of the solid grain and pore space networks, measures material robustness. The size distribution and the connectivity of pores can be characterized quantitatively through various network properties. Assortativity characterizes the pore space with respect to the parity of the number of particles enclosing the pore. Multiscale clusters of odd parity versus even parity contact cycles alternate spatially along the shear band: these represent, respectively, local jamming and unjamming regions that continually switch positions in time throughout the failure regime. Optimal paths, established using network shortest paths in favor of large pores, provide clues on preferential paths for interstitial matter transport. In systems with higher rolling resistance at contacts, less tortuous shortest paths thread through larger pores in shear bands. Notably the structural patterns uncovered in the pore space suggest that more robust models of interstitial pore flow through deforming granular systems require a proper consideration of the evolution of in situ shear band and fracture patterns - not just globally, but also inside these localized failure zones.

Optimisation of MSW collection routes for minimum fuel consumption using 3D GIS modelling.

PubMed

Tavares, G; Zsigraiova, Z; Semiao, V; Carvalho, M G

2009-03-01

Collection of municipal solid waste (MSW) may account for more than 70% of the total waste management budget, most of which is for fuel costs. It is therefore crucial to optimise the routing network used for waste collection and transportation. This paper proposes the use of geographical information systems (GIS) 3D route modelling software for waste collection and transportation, which adds one more degree of freedom to the system and allows driving routes to be optimised for minimum fuel consumption. The model takes into account the effects of road inclination and vehicle weight. It is applied to two different cases: routing waste collection vehicles in the city of Praia, the capital of Cape Verde, and routing the transport of waste from different municipalities of Santiago Island to an incineration plant. For the Praia city region, the 3D model that minimised fuel consumption yielded cost savings of 8% as compared with an approach that simply calculated the shortest 3D route. Remarkably, this was true despite the fact that the GIS-recommended fuel reduction route was actually 1.8% longer than the shortest possible travel distance. For the Santiago Island case, the difference was even more significant: a 12% fuel reduction for a similar total travel distance. These figures indicate the importance of considering both the relief of the terrain and fuel consumption in selecting a suitable cost function to optimise vehicle routing.

Molecular characterization of pheromone biosynthesis activating neuropeptide from the diamondback moth, Plutella xylostella (L.).

PubMed

Lee, Dae-Weon; Boo, Kyung Saeng

2005-12-01

Pheromone biosynthesis activating neuropeptide (PBAN) produced in the subesophageal ganglion stimulates pheromone production in the pheromone gland. A cDNA isolated from female adult heads of the diamondback moth (Plutella xylostella (L.)) encodes 193 amino acids including PBAN, designated as Plx-PBAN, and four other neuropeptides (NPs): diapause hormone (DH) homologue, alpha-NP, beta-NP and gamma-NP. All of the peptides are amidated in their C-termini and shared a conserved motif, FXPR(or K)L structure, as reported from other PBAN cDNAs. Plx-PBAN consists of 30 amino acids, the shortest PBAN so far reported. Plx-PBAN exhibited below 50% homology, compared with other known PBANs. The Plx-DH homologue is structurally different from DH of Bombyx mori. The length of Plx-beta-NP (16 amino acids) was the shortest and showed relatively low similarity, whereas gamma-NP (10 amino acids in length) was the longest among examined gamma-NPs. When female adults were injected with synthetic Plx-PBAN, pheromone production showed a maximal increase 1h post-injection. RT-PCR screening revealed that Plx-PBAN cDNA was expressed in all examined body parts, with the highest expression level in the head of female adults. Analysis of RT-PCR products indicated the Plx-PBAN sequence was identical in all examined body parts of both sexes. Phylogenetic analysis revealed that the Plx-PBAN gene is distantly related to other PBANs, demonstrated by the relatively low similarity.

Spatial and temporal allocation of ship exhaust emissions in Australian coastal waters using AIS data: Analysis and treatment of data gaps

NASA Astrophysics Data System (ADS)

Goldsworthy, Brett

2017-08-01

Ship exhaust emissions need to be allocated accurately in both space and time in order to examine many of the associated impacts, including on air quality and health. Data on ship activity from the Automatic Identification System (AIS) allow ship exhaust emissions to be calculated with fine spatial and temporal resolution. However, there are spatial gaps in the coverage afforded by the coastal network of ground stations that are used to collect the AIS data. This paper focuses on the problem of allocating emissions to the coastal gap regions. Allocating emissions to these regions involves generating interpolated ship tracks that both span the gaps and avoid coming too close to land. In most cases, a simple shortest path or straight line interpolation produces tracks that do not overlap or come too close to land. Where the simple method does not produce acceptable results, vessel tracks are steered around land on shortest available paths using a combination of visibility graphs and Dijkstra's algorithm. A geographical cluster analysis is first used to identify the boundary regions of the data gaps. The properties of the data gaps are summarised in terms of the length, duration and speed of the spanning tracks. The interpolation methods are used to improve the spatial distribution of emissions. It is also shown that emissions in the gap regions can contribute substantially to the total ship exhaust emissions in close proximity to highly populated areas.

Asymmetry in Femoral Tunnel Socket Length During Anterior Cruciate Ligament Reconstruction With Transportal, Outside-In, and Modified Transtibial Techniques.

PubMed

Osaki, Kanji; Okazaki, Ken; Matsubara, Hirokazu; Kuwashima, Umito; Murakami, Koji; Iwamoto, Yukihide

2015-12-01

To investigate the mismatch between the length at the center and the length on the shortest and longest peripheral sides of the femoral tunnel socket, reamed with the transportal (TP), outside-in (OI), and modified transtibial (TT) techniques, in anterior cruciate ligament (ACL) reconstruction. Femoral tunnel drilling was simulated on 3-dimensional bone models from 40 subjects. The tunnel directions used with the TP, OI, and modified TT techniques were previously described. By use of the resulting angle, a femoral tunnel socket of 9 mm in diameter was drilled from the center of the femoral ACL insertion. The virtual femoral tunnel was extracted, and the length mismatch was measured between the center and the shortest and longest peripheral sides of the tunnel socket. The mean socket length mismatch between the center and the shortest peripheral part of the femoral tunnel socket was 4.2 ± 0.9 mm with the TP technique, 5.2 ± 1.3 mm with the OI technique, and 3.2 ± 0.8 mm with the modified TT technique. The mean socket length mismatch between the center and the longest peripheral part of the femoral tunnel socket was 3.5 ± 0.9 mm with the TP technique, 4.8 ± 1.5 mm with the OI technique, and 3.3 ± 1.2 mm with the modified TT technique. The length mismatch was significantly higher when the tunnel socket was created by the OI technique (P < .01). A length mismatch with the tunnel socket exists after reaming with either the TP, OI, or modified TT technique. In particular, there was a significant increase in length mismatch when the tunnel socket was created by the OI technique, and the length mismatch would easily become greater than 5 mm. The surgeon should recognize this mismatch when it is created and measure the femoral tunnel socket. In anatomic ACL reconstruction, a mismatch between the length at the center and the length at periphery of the femoral tunnel socket occurs, and this is increased particularly when using the OI technique. The discrepancy in tunnel length between its center and its periphery could cause an overestimation of the tunnel length that could result in an error in length during graft preparation. Copyright © 2015 Arthroscopy Association of North America. Published by Elsevier Inc. All rights reserved.

Minimally invasive carpal tunnel decompression using the KnifeLight.

PubMed

Hwang, Peter Y K; Ho, Chi Long

2007-02-01

Carpal tunnel syndrome is a common condition causing hand pain, dysfunction, and paresthesia. Endoscopic carpal tunnel decompression offers many advantages compared with conventional open surgical decompression. However, it is equipment intensive and requires familiarity with endoscopic surgery. We review a minimally invasive technique to divide the flexor retinaculum by using a new instrument, the KnifeLight (Stryker, Kalamazoo, Michigan), which combines the advantages of the open and endoscopic methods, without the need for endoscopic set-up. Between July 2003 and April 2005, 44 consecutive patients (26 women [59%] and 18 men [36%]), with clinical signs and symptoms, as well as electrodiagnostic findings consistent with carpal tunnel syndrome, who did not respond to non-surgical treatment, underwent the new procedure. All patients were asked about scar hypertrophy, scar tenderness, and pillar pain. The Michigan Hand Outcomes Questionnaire (MHQ) was used to determine overall hand function, activities of daily living, work performance, pain, aesthetics, and satisfaction with hand function. Other preoperative testing included grip strength and lateral pinch strength. Grip strength was measured using the Jamar hand dynamometer (Asimov Engineering Co., Los Angeles, CA); lateral key pinch was measured using the Jamar hydraulic pinch gauge. Postoperative evaluations were scheduled at 2 weeks, 3 months, and 6 months after the procedure. A small 10-mm incision was made in the wrist crease and a small opening was made at the transverse carpal ligament. The KnifeLight tool was inserted, and the ligament was incised completely. Follow-up evaluations with use of quantitative measurements of grip strength, pinch strength, and hand dexterity were performed at 2 weeks, 3 months, and 6 months after surgery. Fifty procedures were performed on 22 left hands (44%) and 28 right hands (56%). There were no complications related to the approach. All patients were able to use their hands immediately after the surgery. Scar tenderness and incisional pain were mild-to-moderate in the first 2 weeks, and these symptoms disappeared completely 6 months after surgery. Significant postoperative improvements in pain relief, patient satisfaction, hand function, daily activities, and work performance as assessed with the MHQ were noted at 3 and 6 months after surgery. Furthermore, significant improvement in patients' hand grip and pinch strength were observed 6 months after surgery. From a literature review, we found that the mean operation time of KnifeLight carpal tunnel release was the shortest compared with the conventional and endoscopic carpal tunnel release techniques. The median time needed for our patients to return to work was also the shortest among the different techniques. Excellent functional outcomes and satisfaction were achieved using the KnifeLight for carpal tunnel decompression. Our minimally invasive method offers a quick, easy, and effective alternative to conventional or endoscopic carpal tunnel decompression.