Enhanced round robin CPU scheduling with burst time based time quantum

NASA Astrophysics Data System (ADS)

Indusree, J. R.; Prabadevi, B.

2017-11-01

Process scheduling is a very important functionality of Operating system. The main-known process-scheduling algorithms are First Come First Serve (FCFS) algorithm, Round Robin (RR) algorithm, Priority scheduling algorithm and Shortest Job First (SJF) algorithm. Compared to its peers, Round Robin (RR) algorithm has the advantage that it gives fair share of CPU to the processes which are already in the ready-queue. The effectiveness of the RR algorithm greatly depends on chosen time quantum value. Through this research paper, we are proposing an enhanced algorithm called Enhanced Round Robin with Burst-time based Time Quantum (ERRBTQ) process scheduling algorithm which calculates time quantum as per the burst-time of processes already in ready queue. The experimental results and analysis of ERRBTQ algorithm clearly indicates the improved performance when compared with conventional RR and its variants.

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.

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.

Influence of Time-Series Normalization, Number of Nodes, Connectivity and Graph Measure Selection on Seizure-Onset Zone Localization from Intracranial EEG.

PubMed

van Mierlo, Pieter; Lie, Octavian; Staljanssens, Willeke; Coito, Ana; Vulliémoz, Serge

2018-04-26

We investigated the influence of processing steps in the estimation of multivariate directed functional connectivity during seizures recorded with intracranial EEG (iEEG) on seizure-onset zone (SOZ) localization. We studied the effect of (i) the number of nodes, (ii) time-series normalization, (iii) the choice of multivariate time-varying connectivity measure: Adaptive Directed Transfer Function (ADTF) or Adaptive Partial Directed Coherence (APDC) and (iv) graph theory measure: outdegree or shortest path length. First, simulations were performed to quantify the influence of the various processing steps on the accuracy to localize the SOZ. Afterwards, the SOZ was estimated from a 113-electrodes iEEG seizure recording and compared with the resection that rendered the patient seizure-free. The simulations revealed that ADTF is preferred over APDC to localize the SOZ from ictal iEEG recordings. Normalizing the time series before analysis resulted in an increase of 25-35% of correctly localized SOZ, while adding more nodes to the connectivity analysis led to a moderate decrease of 10%, when comparing 128 with 32 input nodes. The real-seizure connectivity estimates localized the SOZ inside the resection area using the ADTF coupled to outdegree or shortest path length. Our study showed that normalizing the time-series is an important pre-processing step, while adding nodes to the analysis did only marginally affect the SOZ localization. The study shows that directed multivariate Granger-based connectivity analysis is feasible with many input nodes (> 100) and that normalization of the time-series before connectivity analysis is preferred.

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

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.

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.

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

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

The fastest spreader in SIS epidemics on networks

NASA Astrophysics Data System (ADS)

He, Zhidong; Van Mieghem, Piet

2018-05-01

Identifying the fastest spreaders in epidemics on a network helps to ensure an efficient spreading. By ranking the average spreading time for different spreaders, we show that the fastest spreader may change with the effective infection rate of a SIS epidemic process, which means that the time-dependent influence of a node is usually strongly coupled to the dynamic process and the underlying network. With increasing effective infection rate, we illustrate that the fastest spreader changes from the node with the largest degree to the node with the shortest flooding time. (The flooding time is the minimum time needed to reach all other nodes if the process is reduced to a flooding process.) Furthermore, by taking the local topology around the spreader and the average flooding time into account, we propose the spreading efficiency as a metric to quantify the efficiency of a spreader and identify the fastest spreader, which is adaptive to different infection rates in general networks.

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.

A performance evaluation of ACO and SA TSP in a supply chain network

NASA Astrophysics Data System (ADS)

Rao, T. Srinivas

2017-07-01

Supply Chain management and E commerce business solutions are one of the prominent areas of active research. In our paper we have modelled a supply chain model which aggregates all the manufacturers requirement and the products are supplied to all the manufacturer through a common vehicle routing algorithm. An appropriate tsp has been constructed for all the manufacturers which determines the shortest route thru which the aggregated material can be supplied in the shortest possible time. In this paper we have solved the shortest route through constructing a Simulated annealing algorithm and Ant colony algorithm and their performance is evaluated.

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).

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.

A Biological Perspective on the Meaning of Time

NASA Technical Reports Server (NTRS)

Rothschild, Lynn J.

2014-01-01

We have become impatient waiting for a web page to load, but the first member of our species evolved about 150,000 years ago - a geological instant as brief and as transitory as a text message. The shortest generation time of a bacterium is a sprint at under ten minutes, whereas a 200-year old whale, turtle or tree is not unknown. Life is a phenomenon that integrates processes ranging from the near instantaneous reactions of photosynthesis to the more stately pace of evolution. Here I will elucidate these processes with radically different time scales that go to creating and maintaining the diversity of life on earth, the clocks that nature uses to time them, and how modern biology is being used to alter the natural time scales.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

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.

Force-Induced Rupture of a DNA Duplex: From Fundamentals to Force Sensors.

PubMed

Mosayebi, Majid; Louis, Ard A; Doye, Jonathan P K; Ouldridge, Thomas E

2015-12-22

The rupture of double-stranded DNA under stress is a key process in biophysics and nanotechnology. In this article, we consider the shear-induced rupture of short DNA duplexes, a system that has been given new importance by recently designed force sensors and nanotechnological devices. We argue that rupture must be understood as an activated process, where the duplex state is metastable and the strands will separate in a finite time that depends on the duplex length and the force applied. Thus, the critical shearing force required to rupture a duplex depends strongly on the time scale of observation. We use simple models of DNA to show that this approach naturally captures the observed dependence of the force required to rupture a duplex within a given time on duplex length. In particular, this critical force is zero for the shortest duplexes, before rising sharply and then plateauing in the long length limit. The prevailing approach, based on identifying when the presence of each additional base pair within the duplex is thermodynamically unfavorable rather than allowing for metastability, does not predict a time-scale-dependent critical force and does not naturally incorporate a critical force of zero for the shortest duplexes. We demonstrate that our findings have important consequences for the behavior of a new force-sensing nanodevice, which operates in a mixed mode that interpolates between shearing and unzipping. At a fixed time scale and duplex length, the critical force exhibits a sigmoidal dependence on the fraction of the duplex that is subject to shearing.

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.

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.

Stochastic Kinetics on Networks: When Slow Is Fast

PubMed Central

2015-01-01

Most chemical and biological processes can be viewed as reaction networks in which different pathways often compete kinetically for transformation of substrates into products. An enzymatic process is an example of such phenomena when biological catalysts create new routes for chemical reactions to proceed. It is typically assumed that the general process of product formation is governed by the pathway with the fastest kinetics at all time scales. In contrast to the expectation, here we show theoretically that at time scales sufficiently short, reactions are predominantly determined by the shortest pathway (in the number of intermediate states), regardless of the average turnover time associated with each pathway. This universal phenomenon is demonstrated by an explicit calculation for a system with two competing reversible (or irreversible) pathways. The time scales that characterize this regime and its relevance for single-molecule experimental studies are also discussed. PMID:25140607

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

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.

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.

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...

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.

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.

Dynamic Shortest Path Algorithms for Hypergraphs

DTIC Science & Technology

2014-01-01

the concept of relationship tree to indicate the parent –child relationship along shortest hy- perpaths. The concept can be easily explained in the...four possible relationship trees to indicate the parent –child relationship in these shortest hyperpaths. We will show in Section III that the choice of...distance of a vertex to the source on the shortest hyperpath, the parent of in the chosen relationship tree associated with the shortest hyperpaths, This

Ultrarapid Multimode Microwave Synthesis of Nano/Submicron β-SiC

PubMed Central

Johnson, Michael; He, Wenzhi; Li, Guangming; Zhao, Chen; Yu, Luling; Huang, Juwen; Zhu, Haochen

2018-01-01

This paper presents the design, development and realization of a fast and novel process for the synthesis of 3C silicon carbide (β-SiC) nanorods and submicron powder. Using SiO2 (or Si) and activated carbon (AC), this process allows β-SiC to be synthesized with almost 100% purity in timeframes of seconds or minutes using multimode microwave rotary tube reactors under open-air conditions. The synthesis temperature used was 1460 ± 50 °C for Si + AC and 1660 ± 50 °C for SiO2 + AC. The shortest β-SiC synthesis time achieved was about 20 s for Si + AC and 100 s for SiO2 + AC. This novel synthesis method allows for scaled-up flow processes in the rapid industrial-scale production of β-SiC, having advantages of time/energy saving and carbon dioxide emission reduction over comparable modern processes. PMID:29470417

Long-term variability of global statistical properties of epileptic brain networks

NASA Astrophysics Data System (ADS)

Kuhnert, Marie-Therese; Elger, Christian E.; Lehnertz, Klaus

2010-12-01

We investigate the influence of various pathophysiologic and physiologic processes on global statistical properties of epileptic brain networks. We construct binary functional networks from long-term, multichannel electroencephalographic data recorded from 13 epilepsy patients, and the average shortest path length and the clustering coefficient serve as global statistical network characteristics. For time-resolved estimates of these characteristics we observe large fluctuations over time, however, with some periodic temporal structure. These fluctuations can—to a large extent—be attributed to daily rhythms while relevant aspects of the epileptic process contribute only marginally. Particularly, we could not observe clear cut changes in network states that can be regarded as predictive of an impending seizure. Our findings are of particular relevance for studies aiming at an improved understanding of the epileptic process with graph-theoretical approaches.

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.

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

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai

2014-08-01

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

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.

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.

Improving Overall Equipment Effectiveness Using CPM and MOST: A Case Study of an Indonesian Pharmaceutical Company

NASA Astrophysics Data System (ADS)

Omega, Dousmaris; Andika, Aditya

2017-12-01

This paper discusses the results of a research conducted on the production process of an Indonesian pharmaceutical company. The company is experiencing low performance in the Overall Equipment Effectiveness (OEE) metric. The OEE of the company machines are below world class standard. The machine that has the lowest OEE is the filler machine. Through observation and analysis, it is found that the cleaning process of the filler machine consumes significant amount of time. The long duration of the cleaning process happens because there is no structured division of jobs between cleaning operators, differences in operators’ ability, and operators’ inability in utilizing available cleaning equipment. The company needs to improve the cleaning process. Therefore, Critical Path Method (CPM) analysis is conducted to find out what activities are critical in order to shorten and simplify the cleaning process in the division of tasks. Afterwards, The Maynard Operation and Sequence Technique (MOST) method is used to reduce ineffective movement and specify the cleaning process standard time. From CPM and MOST, it is obtained the shortest time of the cleaning process is 1 hour 28 minutes and the standard time is 1 hour 38.826 minutes.

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.

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...

Multi-tasking arbitration and behaviour design for human-interactive robots

NASA Astrophysics Data System (ADS)

Kobayashi, Yuichi; Onishi, Masaki; Hosoe, Shigeyuki; Luo, Zhiwei

2013-05-01

Robots that interact with humans in household environments are required to handle multiple real-time tasks simultaneously, such as carrying objects, collision avoidance and conversation with human. This article presents a design framework for the control and recognition processes to meet these requirements taking into account stochastic human behaviour. The proposed design method first introduces a Petri net for synchronisation of multiple tasks. The Petri net formulation is converted to Markov decision processes and processed in an optimal control framework. Three tasks (safety confirmation, object conveyance and conversation) interact and are expressed by the Petri net. Using the proposed framework, tasks that normally tend to be designed by integrating many if-then rules can be designed in a systematic manner in a state estimation and optimisation framework from the viewpoint of the shortest time optimal control. The proposed arbitration method was verified by simulations and experiments using RI-MAN, which was developed for interactive tasks with humans.

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.

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.

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…

Traffic-engineering-aware shortest-path routing and its application in IP-over-WDM networks [Invited

NASA Astrophysics Data System (ADS)

Lee, Youngseok; Mukherjee, Biswanath

2004-03-01

Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest path first and intermediate system-intermediate system protocols does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the globally optimal TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next hop toward the destination by looking up the destination prefix. We present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program, and we propose a simple heuristic for solving large instances of the problem. Then we explore the usage of our proposed algorithm for the integrated TE method in IP-over-WDM networks. The proposed algorithm is evaluated through simulations in IP networks as well as in IP-over-WDM networks.

Stochastic flow shop scheduling of overlapping jobs on tandem machines in application to optimizing the US Army's deliberate nuclear, biological, and chemical decontamination process, (final report). Master's thesis

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

Novikov, V.

1991-05-01

The U.S. Army's detailed equipment decontamination process is a stochastic flow shop which has N independent non-identical jobs (vehicles) which have overlapping processing times. This flow shop consists of up to six non-identical machines (stations). With the exception of one station, the processing times of the jobs are random variables. Based on an analysis of the processing times, the jobs for the 56 Army heavy division companies were scheduled according to the best shortest expected processing time - longest expected processing time (SEPT-LEPT) sequence. To assist in this scheduling the Gap Comparison Heuristic was developed to select the best SEPT-LEPTmore » schedule. This schedule was then used in balancing the detailed equipment decon line in order to find the best possible site configuration subject to several constraints. The detailed troop decon line, in which all jobs are independent and identically distributed, was then balanced. Lastly, an NBC decon optimization computer program was developed using the scheduling and line balancing results. This program serves as a prototype module for the ANBACIS automated NBC decision support system.... Decontamination, Stochastic flow shop, Scheduling, Stochastic scheduling, Minimization of the makespan, SEPT-LEPT Sequences, Flow shop line balancing, ANBACIS.« less

A multilevel probabilistic beam search algorithm for the shortest common supersequence problem.

PubMed

Gallardo, José E

2012-01-01

The shortest common supersequence problem is a classical problem with many applications in different fields such as planning, Artificial Intelligence and especially in Bioinformatics. Due to its NP-hardness, we can not expect to efficiently solve this problem using conventional exact techniques. This paper presents a heuristic to tackle this problem based on the use at different levels of a probabilistic variant of a classical heuristic known as Beam Search. The proposed algorithm is empirically analysed and compared to current approaches in the literature. Experiments show that it provides better quality solutions in a reasonable time for medium and large instances of the problem. For very large instances, our heuristic also provides better solutions, but required execution times may increase considerably.

Spectroscopy of T Tauri stars with UVES. Observations and analysis of RU Lup

NASA Astrophysics Data System (ADS)

Stempels, H. C.; Piskunov, N.

2002-08-01

We present the first results of our observations of classical T Tauri Stars with UVES/VLT. The data consists of high signal-to-noise (ge 150) and high spectral resolution (R ~ 60 000) spectra. A large simultaneous wavelength coverage throughout most of the visible spectrum and comparatively short integration times allow us to study variability on short time-scales, using a number of diagnostics reflecting a wide range of physical processes. In particular we concentrate on the properties and geometry of the accretion process in the strongly accreting and highly variable CTTS RU Lup. We use the evolution of the level of veiling, the shapes of absorption and emission lines, and correlations between these diagnostics, to make new measurements of the fundamental stellar parameters as well as constraints on the accretion process and its geometry. We also derive the shortest time-scale of incoherent changes, which has implications for the nature of the accretion process in RU Lup. Based on observations collected at the European Southern Observatory, Chile (proposal 65.I-0404).

Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

DTIC Science & Technology

2013-12-01

path with one revisit SPR2 Shortest path with two revisits SPR3 Shortest path with three revisits TSP Traveling salesman problem UAV Unmanned aerial...path patrol pattern. Finding the shortest-path patrol pattern is an example of solving a traveling salesman problem , as described in Section 16.5 of...use of patrol paths based on the traveling salesman prob- lem (TSP), where patrollers follow the shortest Hamiltonian cycle in a graph in order to

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.

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

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

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.

Operating room scheduling using hybrid clustering priority rule and genetic algorithm

NASA Astrophysics Data System (ADS)

Santoso, Linda Wahyuni; Sinawan, Aisyah Ashrinawati; Wijaya, Andi Rahadiyan; Sudiarso, Andi; Masruroh, Nur Aini; Herliansyah, Muhammad Kusumawan

2017-11-01

Operating room is a bottleneck resource in most hospitals so that operating room scheduling system will influence the whole performance of the hospitals. This research develops a mathematical model of operating room scheduling for elective patients which considers patient priority with limit number of surgeons, operating rooms, and nurse team. Clustering analysis was conducted to the data of surgery durations using hierarchical and non-hierarchical methods. The priority rule of each resulting cluster was determined using Shortest Processing Time method. Genetic Algorithm was used to generate daily operating room schedule which resulted in the lowest values of patient waiting time and nurse overtime. The computational results show that this proposed model reduced patient waiting time by approximately 32.22% and nurse overtime by approximately 32.74% when compared to actual schedule.

[Not Available].

PubMed

Yanashima, Ryoji; Kitagawa, Noriyuki; Matsubara, Yoshiya; Weatheritt, Robert; Oka, Kotaro; Kikuchi, Shinichi; Tomita, Masaru; Ishizaki, Shun

2009-01-01

The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

The Vitrification and Determination of the Crystallization Time Scales of a Zr58.5Nb2.8Cu15.6Ni12.8Al10.3 Bulk Metallic Glass Forming Liquid

NASA Technical Reports Server (NTRS)

Hays, C. C.; Schroers, J.; Johnson, W. L.; Rathz, T. J.; Hyers, R. W.; Rogers, J. R.; Robinson, M. B.; Whitaker, Ann F. (Technical Monitor)

2001-01-01

Zr58.5Nb2.8Cul5.6Nil2.8All0.3 is the first bulk glass forming liquid that does not contain beryllium to be vitrified by purely radiative cooling in the containerless electrostatic levitation process. The measured critical cooling rate is 1.75 K/s. The sluggish crystallization kinetics enable the determination of the time-temperature-transformation (TTT) diagram between the liquidus and the glass transition temperatures. At the nose of the TTT diagram, the shortest time to reach crystallization in an isothermal experiment is 32 seconds. In contrast to other bulk metallic glasses the scatter in the crystallization onset times are small at both high and low temperatures.

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.

Simulation studies of vestibular macular afferent-discharge patterns using a new, quasi-3-D finite volume method

NASA Technical Reports Server (NTRS)

Ross, M. D.; Linton, S. W.; Parnas, B. R.

2000-01-01

A quasi-three-dimensional finite-volume numerical simulator was developed to study passive voltage spread in vestibular macular afferents. The method, borrowed from computational fluid dynamics, discretizes events transpiring in small volumes over time. The afferent simulated had three calyces with processes. The number of processes and synapses, and direction and timing of synapse activation, were varied. Simultaneous synapse activation resulted in shortest latency, while directional activation (proximal to distal and distal to proximal) yielded most regular discharges. Color-coded visualizations showed that the simulator discretized events and demonstrated that discharge produced a distal spread of voltage from the spike initiator into the ending. The simulations indicate that directional input, morphology, and timing of synapse activation can affect discharge properties, as must also distal spread of voltage from the spike initiator. The finite volume method has generality and can be applied to more complex neurons to explore discrete synaptic effects in four dimensions.

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

Bromberger, Seth A.; Klymko, Christine F.; Henderson, Keith A.

Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriatelymore » based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.« less

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.

An improved sampling method of complex network

NASA Astrophysics Data System (ADS)

Gao, Qi; Ding, Xintong; Pan, Feng; Li, Weixing

2014-12-01

Sampling subnet is an important topic of complex network research. Sampling methods influence the structure and characteristics of subnet. Random multiple snowball with Cohen (RMSC) process sampling which combines the advantages of random sampling and snowball sampling is proposed in this paper. It has the ability to explore global information and discover the local structure at the same time. The experiments indicate that this novel sampling method could keep the similarity between sampling subnet and original network on degree distribution, connectivity rate and average shortest path. This method is applicable to the situation where the prior knowledge about degree distribution of original network is not sufficient.

Staying Motivated During Tough Times

NASA Technical Reports Server (NTRS)

Cole, Jennifer H.

2008-01-01

This paper describes the problem of team motivation on a project. Our team was working with the Department of Homeland Security (DHS). The task consisted of figuring out how to safely control and land an airliner using just the thrust from the engines. This is called Throttles-Only Control (TOC). We weren't allowed to modify the airliner in any way, given the time and cost involved, and we had to use a stock airliner with line pilots. The idea was to give the pilots an emergency checklist which would provide them with the most useful information in the shortest time to learn how to fly TOC. The DHS Program office that was supporting us had its funding redirected, due to new priorities. The process of staying motivated for finishing as much of the project as possible is described.

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.

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.

The use of Matlab for colour fuzzy representation of multichannel EEG short time spectra.

PubMed

Bigan, C; Strungaru, R

1998-01-01

During the last years, a lot of EEG research efforts was directed to intelligent methods for automatic analysis of data from multichannel EEG recordings. However, all the applications reported were focused on specific single tasks like detection of one specific "event" in the EEG signal: spikes, sleep spindles, epileptic seizures, K complexes, alpha or other rhythms or even artefacts. The aim of this paper is to present a complex system being able to perform a representation of the dynamic changes in frequency components of each EEG channel. This representation uses colours as a powerful means to show the only one frequency range chosen from the shortest epoch of signal able to be processed with the conventional "Short Time Fast Fourier Transform" (S.T.F.F.T.) method.

Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

NASA Astrophysics Data System (ADS)

Bai, Danyu

2015-08-01

This paper discusses the flow shop scheduling problem to minimise the total quadratic completion time (TQCT) with release dates in offline and online environments. For this NP-hard problem, the investigation is focused on the performance of two online algorithms based on the Shortest Processing Time among Available jobs rule. Theoretical results indicate the asymptotic optimality of the algorithms as the problem scale is sufficiently large. To further enhance the quality of the original solutions, the improvement scheme is provided for these algorithms. A new lower bound with performance guarantee is provided, and computational experiments show the effectiveness of these heuristics. Moreover, several results of the single-machine TQCT problem with release dates are also obtained for the deduction of the main theorem.

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.

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...

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

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.

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.

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.

Due Date Assignment in a Dynamic Job Shop with the Orthogonal Kernel Least Squares Algorithm

NASA Astrophysics Data System (ADS)

Yang, D. H.; Hu, L.; Qian, Y.

2017-06-01

Meeting due dates is a key goal in the manufacturing industries. This paper proposes a method for due date assignment (DDA) by using the Orthogonal Kernel Least Squares Algorithm (OKLSA). A simulation model is built to imitate the production process of a highly dynamic job shop. Several factors describing job characteristics and system state are extracted as attributes to predict job flow-times. A number of experiments under conditions of varying dispatching rules and 90% shop utilization level have been carried out to evaluate the effectiveness of OKLSA applied for DDA. The prediction performance of OKLSA is compared with those of five conventional DDA models and back-propagation neural network (BPNN). The experimental results indicate that OKLSA is statistically superior to other DDA models in terms of mean absolute lateness and root mean squares lateness in most cases. The only exception occurs when the shortest processing time rule is used for dispatching jobs, the difference between OKLSA and BPNN is not statistically significant.

Study on In-mold Punching during PPS/GF Injection Molding

NASA Astrophysics Data System (ADS)

Inuzuka, Takayuki; Fujita, Akihiro; Nakai, Asami; Hamada, Hiroyuki

The influence of the punching condition on strength and the amount of shear droop was investigated to optimize the processing condition for punching in the mold during glass fiber reinforced polyphenylenesulfide (PPS/GF) injection molding. For in-mold punching part during cooling process, the tensile strength was constant because the pressure loss by the punch did not occur. The amount of the shear droop decreased in line with the increase in delay time because the rigidity of injection molded part in the mold increased when the resin was cooled. Moreover, when the resin temperature lowered more than the glass transition temperature, the amount of the shear droop was constant because the rigidity became constant. It is necessary to begin punching when the resin temperature lowers more than the glass transition temperature after holding pressure process is completed, to secure high strength and to assume 0.05 mm or less, at which level the shear droop cannot be visually recognized. The shortest delay time for PPS/GF is 8 sec. The delay time to minimize the amount of the shear droop can be guessed by analyzing the temperature change of the resin in the mold by injection molding CAE.

Accelerating sino-atrium computer simulations with graphic processing units.

PubMed

Zhang, Hong; Xiao, Zheng; Lin, Shien-fong

2015-01-01

Sino-atrial node cells (SANCs) play a significant role in rhythmic firing. To investigate their role in arrhythmia and interactions with the atrium, computer simulations based on cellular dynamic mathematical models are generally used. However, the large-scale computation usually makes research difficult, given the limited computational power of Central Processing Units (CPUs). In this paper, an accelerating approach with Graphic Processing Units (GPUs) is proposed in a simulation consisting of the SAN tissue and the adjoining atrium. By using the operator splitting method, the computational task was made parallel. Three parallelization strategies were then put forward. The strategy with the shortest running time was further optimized by considering block size, data transfer and partition. The results showed that for a simulation with 500 SANCs and 30 atrial cells, the execution time taken by the non-optimized program decreased 62% with respect to a serial program running on CPU. The execution time decreased by 80% after the program was optimized. The larger the tissue was, the more significant the acceleration became. The results demonstrated the effectiveness of the proposed GPU-accelerating methods and their promising applications in more complicated biological simulations.

Development of on-line laser power monitoring system

NASA Astrophysics Data System (ADS)

Ding, Chien-Fang; Lee, Meng-Shiou; Li, Kuan-Ming

2016-03-01

Since the laser was invented, laser has been applied in many fields such as material processing, communication, measurement, biomedical engineering, defense industries and etc. Laser power is an important parameter in laser material processing, i.e. laser cutting, and laser drilling. However, the laser power is easily affected by the environment temperature, we tend to monitor the laser power status, ensuring there is an effective material processing. Besides, the response time of current laser power meters is too long, they cannot measure laser power accurately in a short time. To be more precisely, we can know the status of laser power and help us to achieve an effective material processing at the same time. To monitor the laser power, this study utilize a CMOS (Complementary metal-oxide-semiconductor) camera to develop an on-line laser power monitoring system. The CMOS camera captures images of incident laser beam after it is split and attenuated by beam splitter and neutral density filter. By comparing the average brightness of the beam spots and measurement results from laser power meter, laser power can be estimated. Under continuous measuring mode, the average measuring error is about 3%, and the response time is at least 3.6 second shorter than thermopile power meters; under trigger measuring mode which enables the CMOS camera to synchronize with intermittent laser output, the average measuring error is less than 3%, and the shortest response time is 20 millisecond.

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.

Apparatus and method for investigation of energy consumption of microwave assisted drying systems.

PubMed

Göllei, Attila; Vass, András; Magyar, Attila; Pallai, Elisabeth

2009-10-01

Convective, hot air drying by itself is relatively efficient for removing water from the surface environment of agricultural seed products. However, moving internal moisture to the surface needs rather a long time, as a rule. The major research aim of the authors was to decrease the processing time and processing costs, to improve the quality of the dried product, and to increase drying efficiency. For this reason their research activities focused on the development of a special drying apparatus and a method suitable for measuring of energy conditions in a hybrid (microwave and convective) dryer. Experimental investigations were made with moistened wheat as model material. Experiments were carried out in microwave, convective and hybrid drying systems. The microwave drying alone was more efficient than the convective method. The lowest energy consumption and shortest drying time were obtained by the use of a hybrid method in which the waste energy of magnetron was utilized and the temperature was controlled. In this way, it was possible to keep the temperature of the dried product at a constant and safe value and to considerably decrease the energy consumption.

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...

Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times

NASA Astrophysics Data System (ADS)

Sharma, Pankaj; Jain, Ajai

2014-12-01

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under due date tightness factor of 3, shop utilization percentage of 90% and setup times less than processing times. Results indicate that shortest setup time (SIMSET) rule provides the best performance for mean flow time and number of tardy jobs measures. The job with similar setup and modified earliest due date (JMEDD) rule provides the best performance for makespan, maximum flow time, mean tardiness, maximum tardiness, total setups and mean setup time measures.

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...

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.

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

DNA extraction for streamlined metagenomics of diverse environmental samples.

PubMed

Marotz, Clarisse; Amir, Amnon; Humphrey, Greg; Gaffney, James; Gogul, Grant; Knight, Rob

2017-06-01

A major bottleneck for metagenomic sequencing is rapid and efficient DNA extraction. Here, we compare the extraction efficiencies of three magnetic bead-based platforms (KingFisher, epMotion, and Tecan) to a standardized column-based extraction platform across a variety of sample types, including feces, oral, skin, soil, and water. Replicate sample plates were extracted and prepared for 16S rRNA gene amplicon sequencing in parallel to assess extraction bias and DNA quality. The data demonstrate that any effect of extraction method on sequencing results was small compared with the variability across samples; however, the KingFisher platform produced the largest number of high-quality reads in the shortest amount of time. Based on these results, we have identified an extraction pipeline that dramatically reduces sample processing time without sacrificing bacterial taxonomic or abundance information.

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

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.

AWAS: A dynamic work scheduling system

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

Lee, Y.; Hao, J.; Kocur, G.

1994-12-31

The Automated Work Administration System (AWAS) is an automated scheduling system developed at GTE. A typical work center has 1000 employees and processes 4000 jobs each day. Jobs are geographically distributed within the service area of the work center, require different skills, and have to be done within specified time windows. Each job can take anywhere from 12 minutes to several hours to complete. Each employee can have his/her individual schedule, skill, or working area. The jobs can enter and leave the system at any time The employees dial up to the system to request for their next job atmore » the beginning of a day or after a job is done. The system is able to respond to the changes dynamically and produce close to optimum solutions at real time. We formulate the real world problem as a minimum cost network flow problem. Both employees and jobs are formulated as nodes. Relationship between jobs and employees are formulated as arcs, and working hours contributed by employees and consumed by jobs are formulated as flow. The goal is to minimize missed commitments. We solve the problem with the successive shortest path algorithm. Combined with pre-processing and post-processing, the system produces reasonable outputs and the response time is very good.« less

Scheduling revisited workstations in integrated-circuit fabrication

NASA Technical Reports Server (NTRS)

Kline, Paul J.

1992-01-01

The cost of building new semiconductor wafer fabrication factories has grown rapidly, and a state-of-the-art fab may cost 250 million dollars or more. Obtaining an acceptable return on this investment requires high productivity from the fabrication facilities. This paper describes the Photo Dispatcher system which was developed to make machine-loading recommendations on a set of key fab machines. Dispatching policies that generally perform well in job shops (e.g., Shortest Remaining Processing Time) perform poorly for workstations such as photolithography which are visited several times by the same lot of silicon wafers. The Photo Dispatcher evaluates the history of workloads throughout the fab and identifies bottleneck areas. The scheduler then assigns priorities to lots depending on where they are headed after photolithography. These priorities are designed to avoid starving bottleneck workstations and to give preference to lots that are headed to areas where they can be processed with minimal waiting. Other factors considered by the scheduler to establish priorities are the nearness of a lot to the end of its process flow and the time that the lot has already been waiting in queue. Simulations that model the equipment and products in one of Texas Instrument's wafer fabs show the Photo Dispatcher can produce a 10 percent improvement in the time required to fabricate integrated circuits.

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

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...

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.

Use of adaptive cruise control functions on motorways and urban roads: Changes over time in an on-road study.

PubMed

Pereira, Marta; Beggiato, Matthias; Petzoldt, Tibor

2015-09-01

The study aimed at investigating how drivers use Adaptive Cruise Control and its functions in distinct road environments and to verify if changes occur over time. Fifteen participants were invited to drive a vehicle equipped with a Stop & Go Adaptive Cruise Control system on nine occasions. The course remained the same for each test run and included roads on urban and motorway environments. Results showed significant effect of experience for ACC usage percentage, and selection of the shortest time headway value in the urban road environment. This indicates that getting to know a system is not a homogenous process, as mastering the use of all the system's functions can take differing lengths of time in distinct road environments. Results can be used not only for the development of the new generation of systems that integrate ACC functionalities but also for determining the length of training required to operate an ACC system. Copyright © 2015 Elsevier Ltd and The Ergonomics Society. All rights reserved.

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...

Somatosensory Temporal Discrimination Threshold Involves Inhibitory Mechanisms in the Primary Somatosensory Area.

PubMed

Rocchi, Lorenzo; Casula, Elias; Tocco, Pierluigi; Berardelli, Alfredo; Rothwell, John

2016-01-13

Somatosensory temporal discrimination threshold (STDT) is defined as the shortest time interval necessary for a pair of tactile stimuli to be perceived as separate. Although STDT is altered in several neurological disorders, its neural bases are not entirely clear. We used continuous theta burst stimulation (cTBS) to condition the excitability of the primary somatosensory cortex in healthy humans to examine its possible contribution to STDT. Excitability was assessed using the recovery cycle of the N20 component of somatosensory evoked potentials (SEP) and the area of high-frequency oscillations (HFO). cTBS increased STDT and reduced inhibition in the N20 recovery cycle at an interstimulus interval of 5 ms. It also reduced the amplitude of late HFO. All three effects were correlated. There was no effect of cTBS over the secondary somatosensory cortex on STDT, although it reduced the N120 component of the SEP. STDT is assessed conventionally with a simple ascending method. To increase insight into the effect of cTBS, we measured temporal discrimination with a psychophysical method. cTBS reduced the slope of the discrimination curve, consistent with a reduction of the quality of sensory information caused by an increase in noise. We hypothesize that cTBS reduces the effectiveness of inhibitory interactions normally used to sharpen temporal processing of sensory inputs. This reduction in discriminability of sensory input is equivalent to adding neural noise to the signal. Precise timing of sensory information is crucial for nearly every aspect of human perception and behavior. One way to assess the ability to analyze temporal information in the somatosensory domain is to measure the somatosensory temporal discrimination threshold (STDT), defined as the shortest time interval necessary for a pair of tactile stimuli to be perceived as separate. In this study, we found that STDT depends on inhibitory mechanisms within the primary somatosensory area (S1). This finding helps interpret the sensory processing deficits in neurological diseases, such as focal dystonia and Parkinson's disease, and possibly prompts future studies using neurostimulation techniques over S1 for therapeutic purposes in dystonic patients. Copyright © 2016 the authors 0270-6474/16/360325-11$15.00/0.

Non-linear feature extraction from HRV signal for mortality prediction of ICU cardiovascular patient.

PubMed

Karimi Moridani, Mohammad; Setarehdan, Seyed Kamaledin; Motie Nasrabadi, Ali; Hajinasrollah, Esmaeil

2016-01-01

Intensive care unit (ICU) patients are at risk of in-ICU morbidities and mortality, making specific systems for identifying at-risk patients a necessity for improving clinical care. This study presents a new method for predicting in-hospital mortality using heart rate variability (HRV) collected from the times of a patient's ICU stay. In this paper, a HRV time series processing based method is proposed for mortality prediction of ICU cardiovascular patients. HRV signals were obtained measuring R-R time intervals. A novel method, named return map, is then developed that reveals useful information from the HRV time series. This study also proposed several features that can be extracted from the return map, including the angle between two vectors, the area of triangles formed by successive points, shortest distance to 45° line and their various combinations. Finally, a thresholding technique is proposed to extract the risk period and to predict mortality. The data used to evaluate the proposed algorithm obtained from 80 cardiovascular ICU patients, from the first 48 h of the first ICU stay of 40 males and 40 females. This study showed that the angle feature has on average a sensitivity of 87.5% (with 12 false alarms), the area feature has on average a sensitivity of 89.58% (with 10 false alarms), the shortest distance feature has on average a sensitivity of 85.42% (with 14 false alarms) and, finally, the combined feature has on average a sensitivity of 92.71% (with seven false alarms). The results showed that the last half an hour before the patient's death is very informative for diagnosing the patient's condition and to save his/her life. These results confirm that it is possible to predict mortality based on the features introduced in this paper, relying on the variations of the HRV dynamic characteristics.

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.

Retail yield and fabrication times for veal as influenced by purchasing options and merchandising styles.

PubMed

McNeill, M S; Griffin, D B; Dockerty, T R; Walter, J P; Johnson, H K; Savell, J W

1998-06-01

Twenty-nine selected styles of subprimals or sections of veal were obtained from a commercial facility to assist in the development of a support program for retailers. They were fabricated into bone-in or boneless retail cuts and associated components by trained meat cutters. Each style selected (n = 6) was used to generate mean retail yields and labor requirements, which were calculated from wholesale and retail weights and processing times. Means and standard errors for veal ribs consisting of five different styles (n = 30) concluded that style #2, 7-rib 4 (10 cm) x 4 (10 cm), had the lowest percentage of total retail yield (P < .05) owing to the greatest percentage of bone. Furthermore, rib style #2 required the longest total processing time (P < .05). Rib styles #3, 7-rib chop-ready, and #5, 6-rib chop ready, yielded the greatest percentage of total retail yield and also had the shortest total processing time (P < .05). Within veal loins, style #2, 4 (10 cm) x 4 (10 cm) loin kidney fat in, had the greatest percentage fat (P < .05). Loin styles #2 and #3, 4 (10 cm) x 4 (10 cm) loin special trimmed, generated more lean and fat trimmings and bone, resulting in lower percentage of total retail yields than loin style #1, 0 (0 cm) x 1 (2.5 cm) loin special trimmed (P < .05). Results indicated that bone-in subprimals and sections required more processing time if fabricated into a boneless end point. In addition, as the number of different retail cuts increased, processing times also increased.

Co-operative bidding of SMEs in health care sector.

PubMed

Mezgár, István; Kovács, György; Bonfatti, Fabio

2002-01-01

Tendering become an important process for customers in the health care sector to select products and services from the market for the lowest price, with the highest quality and with the shortest delivery time. The number of SMEs (Small and Medium-sized Enterprises) delivering products or services for the health care sector is increasing, but they have usually limited capital and expertise to participate in tenders. The paper introduces a possible solution for this problem, when SMEs form special groups, so called Smart Bidding Organisations (SBO), to prepare a bid for the tender jointly. The SBO appears for the customer (tender issuer) as a single enterprise and the bidding procedure will be faster and less expensive in this way.

Visualization of Underfill Flow in Ball Grid Array (BGA) using Particle Image Velocimetry (PIV)

NASA Astrophysics Data System (ADS)

Ng, Fei Chong; Abas, Aizat; Abustan, Ismail; Remy Rozainy, Z. Mohd; Abdullah, MZ; Jamaludin, Ali b.; Kon, Sharon Melissa

2018-05-01

This paper presents the experimental methodology using particle image velocimetry (PIV) to study the underfill process of ball grid array (BGA) chip package. PIV is a non-intrusive approach to visualize the flow behavior of underfill across the solder ball array. The BGA model of three different configurations – perimeter, middle empty and full array – were studied in current research. Through PIV experimental works, the underfill velocity distribution and vector fields for each BGA models were successfully obtained. It is found that perimeter has the shortest filling time resulting to a higher underfill velocity. Therefore, it is concluded that the flow behavior of underfill in BGA can be justified thoroughly with the aid of PIV.

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

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.

Locating the source of spreading in temporal networks

NASA Astrophysics Data System (ADS)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Yi, Dongyun

2017-02-01

The topological structure of many real networks changes with time. Thus, locating the sources of a temporal network is a creative and challenging problem, as the enormous size of many real networks makes it unfeasible to observe the state of all nodes. In this paper, we propose an algorithm to solve this problem, named the backward temporal diffusion process. The proposed algorithm calculates the shortest temporal distance to locate the transmission source. We assume that the spreading process can be modeled as a simple diffusion process and by consensus dynamics. To improve the location accuracy, we also adopt four strategies to select which nodes should be observed by ranking their importance in the temporal network. Our paper proposes a highly accurate method for locating the source in temporal networks and is, to the best of our knowledge, a frontier work in this field. Moreover, our framework has important significance for controlling the transmission of diseases or rumors and formulating immediate immunization strategies.

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...

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...

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…

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network

PubMed Central

Wei, Zhengxian; Song, Min; Yin, Guisheng; Wang, Hongbin; Cheng, Albert M. K.

2017-01-01

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption. PMID:29039757

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network.

PubMed

Wei, Zhengxian; Song, Min; Yin, Guisheng; Song, Houbing; Wang, Hongbin; Ma, Xuefei; Cheng, Albert M K

2017-10-17

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption.

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 .

Prediction of Shrinkage Porosity Defect in Sand Casting Process of LM25

NASA Astrophysics Data System (ADS)

Rathod, Hardik; Dhulia, Jay K.; Maniar, Nirav P.

2017-08-01

In the present worldwide and aggressive environment, foundry commercial enterprises need to perform productively with least number of rejections and create casting parts in shortest lead time. It has become extremely difficult for foundry industries to meet demands of defects free casting and meet strict delivery schedules. The process of casting solidification is complex in nature. Prediction of shrinkage defect in metal casting is one of the critical concern in foundries and is one of the potential research areas in casting. Due to increasing pressure to improve quality and to reduce cost, it is very essential to upgrade the level of current methodology used in foundries. In the present research work, prediction methodology of shrinkage porosity defect in sand casting process of LM25 using experimentation and ANSYS is proposed. The objectives successfully achieved are prediction of shrinkage porosity distribution in Al-Si casting and determining effectiveness of investigated function for predicting shrinkage porosity by correlating results of simulating studies to those obtained experimentally. The real-time application of the research reflects from the fact that experimentation is performed on 9 different Y junctions at foundry industry and practical data obtained from experimentation are used for simulation.

A combinatorial approach to the design of vaccines.

PubMed

Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

2015-05-01

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

Deconstruction of lignocellulosic biomass with hydrated cerium (III) chloride in water and ethanol

DOE PAGES

Akalin, Mehmet K.; Das, Parthapratim; Alper, Koray; ...

2017-08-08

Lignocellulosic biomass was decomposed to produce crude bio-oil in water and ethanol using hydrated cerium (III) chloride as a catalyst. Use of the catalyst affected not only the yield of crude bio-oil but also the composition of bio-crude for both water and ethanol. The catalyst had a detrimental effect on the crude bio-oil yields obtained from water processing for all runs. However, in ethanol, use of the catalyst improved the crude bio-oil yields in all tested runs. The solid residue yields decreased with the catalyst use in the runs with water but increased in all studies with ethanol, except thosemore » with the shortest tested residence time of 10 min. The highest crude bio-oil yield of 48.2 wt% was obtained at 300 °C using 5 mmol of hydrated cerium (III) chloride at a residence time of 90 min in ethanol. The heating values of the crude bio-oils increased with the catalyst use for both water and ethanol processing. In conclusion, the highest heating value of 33.3 MJ kg –1 was obtained with hydrated cerium (III) chloride at 300 °C and a residence time of 120 min.« less

Deconstruction of lignocellulosic biomass with hydrated cerium (III) chloride in water and ethanol

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

Akalin, Mehmet K.; Das, Parthapratim; Alper, Koray

Lignocellulosic biomass was decomposed to produce crude bio-oil in water and ethanol using hydrated cerium (III) chloride as a catalyst. Use of the catalyst affected not only the yield of crude bio-oil but also the composition of bio-crude for both water and ethanol. The catalyst had a detrimental effect on the crude bio-oil yields obtained from water processing for all runs. However, in ethanol, use of the catalyst improved the crude bio-oil yields in all tested runs. The solid residue yields decreased with the catalyst use in the runs with water but increased in all studies with ethanol, except thosemore » with the shortest tested residence time of 10 min. The highest crude bio-oil yield of 48.2 wt% was obtained at 300 °C using 5 mmol of hydrated cerium (III) chloride at a residence time of 90 min in ethanol. The heating values of the crude bio-oils increased with the catalyst use for both water and ethanol processing. In conclusion, the highest heating value of 33.3 MJ kg –1 was obtained with hydrated cerium (III) chloride at 300 °C and a residence time of 120 min.« less

Missing reversals in the geomagnetic polarity timescale: Their influence on the analysis and in constraining the process that generates geomagnetic reversals

NASA Astrophysics Data System (ADS)

Marzocchi, W.

1997-03-01

A major problem in defining the chronology of geomagnetic reversals is linked to the detection of short (<30kyr) time intervals between reversals (TIBR). Published polarity timescales do not usually include the shortest TIBR; therefore the timescales are inherently incomplete. The purpose of this paper is to investigate the effects of this incompleteness on the analysis of the geomagnetic polarity timescale; the ultimate goal is to provide constraints on the Earth's core processes. The effects of inclusion/exclusion of the shortest TIBR are verified by comparing the results obtained by statistical analysis of real and synthetic series of events; for the real sequence, two basic cases are considered in which the ``tiny wiggles'' are attributed either to short TIBR or to paleointensity fluctuations. Particular attention is paid to the influence of measurement errors estimated for the most recently published Cenozoic timescale. By following the minimalist philosophy of Occam's razor, which is particularly suitable for studying poorly known processes, the reliability of the simplest model, i.e., the Poisson process which is symmetric in polarity, can be checked. The results indicate the plausibility of a generalized renewal process; the only regularity is relative to the long-term trend, which is probably linked to core-mantle coupling. In detail, a uniform exponential trend in the last 80 Myr is found for the timescale; it is not presently possible to estimate the influence of the inclusion of tiny wiggles because they are well-resolved only in the last 30 Myr, a period in which both series are stationary. The sequences, with and without tiny wiggles, are symmetric in polarity, with no evidence of low-dimensional chaos and memory of past configurations. The empirical statistical distribution of the TIBR departs slightly from a theoretical exponential distribution, i.e., from a Poisson process, which can be explained by a lack of short anomalies, and/or by a generating process with wear-out properties (a more general renewal process). A real exponential distribution is sustainable only if the number of missing short TIBR in the last 30 Myr is larger than the number of tiny wiggles observed in the same period.

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...

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.

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).

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.

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...

[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.

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…

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...

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

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 Bioreactor Retention Time on Aerobic Microbial Decomposition of CELSS Crop Residues

NASA Technical Reports Server (NTRS)

Strayer, R. F.; Finger, B. W.; Alazraki, M. P.

1997-01-01

The focus of resource recovery research at the KSC-CELSS Breadboard Project has been the evaluation of microbiologically mediated biodegradation of crop residues by manipulation of bioreactor process and environmental variables. We will present results from over 3 years of studies that used laboratory- and breadboard-scale (8 and 120 L working volumes, respectively) aerobic, fed-batch, continuous stirred tank reactors (CSTR) for recovery of carbon and minerals from breadboard grown wheat and white potato residues. The paper will focus on the effects of a key process variable, bioreactor retention time, on response variables indicative of bioreactor performance. The goal is to determine the shortest retention time that is feasible for processing CELSS crop residues, thereby reducing bioreactor volume and weight requirements. Pushing the lower limits of bioreactor retention times will provide useful data for engineers who need to compare biological and physicochemical components. Bioreactor retention times were manipulated to range between 0.25 and 48 days. Results indicate that increases in retention time lead to a 4-fold increase in crop residue biodegradation, as measured by both dry weight losses and CO2 production. A similar overall trend was also observed for crop residue fiber (cellulose and hemicellulose), with a noticeable jump in cellulose degradation between the 5.3 day and 10.7 day retention times. Water-soluble organic compounds (measured as soluble TOC) were appreciably reduced by more than 4-fold at all retention times tested. Results from a study of even shorter retention times (down to 0.25 days), in progress, will also be presented.

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.

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.

An Upgrade Pinning Block: A Mechanical Practical Aid for Fast Labelling of the Insect Specimens.

PubMed

Ghafouri Moghaddam, Mohammad Hossein; Ghafouri Moghaddam, Mostafa; Rakhshani, Ehsan; Mokhtari, Azizollah

2017-01-01

A new mechanical innovation is described to deal with standard labelling of dried specimens on triangular cards and/or pinned specimens in personal and public collections. It works quickly, precisely, and easily and is very useful for maintaining label uniformity in collections. The tools accurately sets the position of labels in the shortest possible time. This tools has advantages including rapid processing, cost effectiveness, light weight, and high accuracy, compared to conventional methods. It is fully customisable, compact, and does not require specialist equipment to assemble. Conventional methods generally require locating holes on the pinning block surface when labelling with a resulting risk to damage of the specimens. Insects of different orders can be labelled by this simple and effective tool.

An Upgrade Pinning Block: A Mechanical Practical Aid for Fast Labelling of the Insect Specimens

PubMed Central

Ghafouri Moghaddam, Mohammad Hossein; Rakhshani, Ehsan; Mokhtari, Azizollah

2017-01-01

Abstract A new mechanical innovation is described to deal with standard labelling of dried specimens on triangular cards and/or pinned specimens in personal and public collections. It works quickly, precisely, and easily and is very useful for maintaining label uniformity in collections. The tools accurately sets the position of labels in the shortest possible time. This tools has advantages including rapid processing, cost effectiveness, light weight, and high accuracy, compared to conventional methods. It is fully customisable, compact, and does not require specialist equipment to assemble. Conventional methods generally require locating holes on the pinning block surface when labelling with a resulting risk to damage of the specimens. Insects of different orders can be labelled by this simple and effective tool. PMID:29104440

An optimal generic model for multi-parameters and big data optimizing: a laboratory experimental study

NASA Astrophysics Data System (ADS)

Utama, D. N.; Ani, N.; Iqbal, M. M.

2018-03-01

Optimization is a process for finding parameter (parameters) that is (are) able to deliver an optimal value for an objective function. Seeking an optimal generic model for optimizing is a computer science study that has been being practically conducted by numerous researchers. Generic model is a model that can be technically operated to solve any varieties of optimization problem. By using an object-oriented method, the generic model for optimizing was constructed. Moreover, two types of optimization method, simulated-annealing and hill-climbing, were functioned in constructing the model and compared to find the most optimal one then. The result said that both methods gave the same result for a value of objective function and the hill-climbing based model consumed the shortest running time.

Biomimetics in Intelligent Sensor and Actuator Automation Systems

NASA Astrophysics Data System (ADS)

Bruckner, Dietmar; Dietrich, Dietmar; Zucker, Gerhard; Müller, Brit

Intelligent machines are really an old mankind's dream. With increasing technological development, the requirements for intelligent devices also increased. However, up to know, artificial intelligence (AI) lacks solutions to the demands of truly intelligent machines that have no problems to integrate themselves into daily human environments. Current hardware with a processing power of billions of operations per second (but without any model of human-like intelligence) could not substantially contribute to the intelligence of machines when compared with that of the early AI times. There are great results, of course. Machines are able to find the shortest path between far apart cities on the map; algorithms let you find information described only by few key words. But no machine is able to get us a cup of coffee from the kitchen yet.

Experimental analysis and modeling of ultrasound assisted freezing of potato spheres.

PubMed

Kiani, Hossein; Zhang, Zhihang; Sun, Da-Wen

2015-09-01

In recent years, innovative methods such as ultrasound assisted freezing have been developed in order to improve the freezing process. During freezing of foods, accurate prediction of the temperature distribution, phase ratios, and process time is very important. In the present study, ultrasound assisted immersion freezing process (in 1:1 ethylene glycol-water solution at 253.15K) of potato spheres (0.02 m diameter) was evaluated using experimental, numerical and analytical approaches. Ultrasound (25 kHz, 890 W m(-2)) was irradiated for different duty cycles (DCs=0-100%). A finite volume based enthalpy method was used in the numerical model, based on which temperature and liquid fraction profiles were simulated by a program developed using OpenFOAM® CFD software. An analytical technique was also employed to calculate freezing times. The results showed that ultrasound irradiation could decrease the characteristic freezing time of potatoes. Since ultrasound irradiation increased the heat transfer coefficient but simultaneously generated heat at the surface of the samples, an optimum DC was needed for the shortest freezing time which occurred in the range of 30-70% DC. DCs higher than 70% increased the freezing time. DCs lower than 30% did not provide significant effects on the freezing time compared to the control sample. The numerical model predicted the characteristic freezing time in accordance with the experimental results. In addition, analytical calculation of characteristic freezing time exhibited qualitative agreement with the experimental results. As the numerical simulations provided profiles of temperature and water fraction within potatoes frozen with or without ultrasound, the models can be used to study and control different operation situations, and to improve the understanding of the freezing process. Copyright © 2015 Elsevier B.V. All rights reserved.

Complex networks in confined comminution

NASA Astrophysics Data System (ADS)

Walker, David M.; Tordesillas, Antoinette; Einav, Itai; Small, Michael

2011-08-01

The physical process of confined comminution is investigated within the framework of complex networks. We first characterize the topology of the unweighted contact networks as generated by the confined comminution process. We find this process gives rise to an ultimate contact network which exhibits a scale-free degree distribution and small world properties. In particular, if viewed in the context of networks through which information travels along shortest paths, we find that the global average of the node vulnerability decreases as the comminution process continues, with individual node vulnerability correlating with grain size. A possible application to the design of synthetic networks (e.g., sensor networks) is highlighted. Next we turn our attention to the physics of the granular comminution process and examine force transmission with respect to the weighted contact networks, where each link is weighted by the inverse magnitude of the normal force acting at the associated contact. We find that the strong forces (i.e., force chains) are transmitted along pathways in the network which are mainly following shortest-path routing protocols, as typically found, for example, in communication systems. Motivated by our earlier studies of the building blocks for self-organization in dense granular systems, we also explore the properties of the minimal contact cycles. The distribution of the contact strain energy intensity of 4-cycle motifs in the ultimate state of the confined comminution process is shown to be consistent with a scale-free distribution with infinite variance, thereby suggesting that 4-cycle arrangements of grains are capable of storing vast amounts of energy in their contacts without breaking.

Improving multi-GNSS ultra-rapid orbit determination for real-time precise point positioning

NASA Astrophysics Data System (ADS)

Li, Xingxing; Chen, Xinghan; Ge, Maorong; Schuh, Harald

2018-03-01

Currently, with the rapid development of multi-constellation Global Navigation Satellite Systems (GNSS), the real-time positioning and navigation are undergoing dramatic changes with potential for a better performance. To provide more precise and reliable ultra-rapid orbits is critical for multi-GNSS real-time positioning, especially for the three merging constellations Beidou, Galileo and QZSS which are still under construction. In this contribution, we present a five-system precise orbit determination (POD) strategy to fully exploit the GPS + GLONASS + BDS + Galileo + QZSS observations from CDDIS + IGN + BKG archives for the realization of hourly five-constellation ultra-rapid orbit update. After adopting the optimized 2-day POD solution (updated every hour), the predicted orbit accuracy can be obviously improved for all the five satellite systems in comparison to the conventional 1-day POD solution (updated every 3 h). The orbit accuracy for the BDS IGSO satellites can be improved by about 80, 45 and 50% in the radial, cross and along directions, respectively, while the corresponding accuracy improvement for the BDS MEO satellites reaches about 50, 20 and 50% in the three directions, respectively. Furthermore, the multi-GNSS real-time precise point positioning (PPP) ambiguity resolution has been performed by using the improved precise satellite orbits. Numerous results indicate that combined GPS + BDS + GLONASS + Galileo (GCRE) kinematic PPP ambiguity resolution (AR) solutions can achieve the shortest time to first fix (TTFF) and highest positioning accuracy in all coordinate components. With the addition of the BDS, GLONASS and Galileo observations to the GPS-only processing, the GCRE PPP AR solution achieves the shortest average TTFF of 11 min with 7{°} cutoff elevation, while the TTFF of GPS-only, GR, GE and GC PPP AR solution is 28, 15, 20 and 17 min, respectively. As the cutoff elevation increases, the reliability and accuracy of GPS-only PPP AR solutions decrease dramatically, but there is no evident decrease for the accuracy of GCRE fixed solutions which can still achieve an accuracy of a few centimeters in the east and north components.

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.

NonMarkov Ito Processes with 1- state memory

NASA Astrophysics Data System (ADS)

McCauley, Joseph L.

2010-08-01

A Markov process, by definition, cannot depend on any previous state other than the last observed state. An Ito process implies the Fokker-Planck and Kolmogorov backward time partial differential eqns. for transition densities, which in turn imply the Chapman-Kolmogorov eqn., but without requiring the Markov condition. We present a class of Ito process superficially resembling Markov processes, but with 1-state memory. In finance, such processes would obey the efficient market hypothesis up through the level of pair correlations. These stochastic processes have been mislabeled in recent literature as 'nonlinear Markov processes'. Inspired by Doob and Feller, who pointed out that the ChapmanKolmogorov eqn. is not restricted to Markov processes, we exhibit a Gaussian Ito transition density with 1-state memory in the drift coefficient that satisfies both of Kolmogorov's partial differential eqns. and also the Chapman-Kolmogorov eqn. In addition, we show that three of the examples from McKean's seminal 1966 paper are also nonMarkov Ito processes. Last, we show that the transition density of the generalized Black-Scholes type partial differential eqn. describes a martingale, and satisfies the ChapmanKolmogorov eqn. This leads to the shortest-known proof that the Green function of the Black-Scholes eqn. with variable diffusion coefficient provides the so-called martingale measure of option pricing.

Catalytic ignition model in a monolithic reactor with in-depth reaction

NASA Technical Reports Server (NTRS)

Tien, Ta-Ching; Tien, James S.

1990-01-01

Two transient models have been developed to study the catalytic ignition in a monolithic catalytic reactor. The special feature in these models is the inclusion of thermal and species structures in the porous catalytic layer. There are many time scales involved in the catalytic ignition problem, and these two models are developed with different time scales. In the full transient model, the equations are non-dimensionalized by the shortest time scale (mass diffusion across the catalytic layer). It is therefore accurate but is computationally costly. In the energy-integral model, only the slowest process (solid heat-up) is taken as nonsteady. It is approximate but computationally efficient. In the computations performed, the catalyst is platinum and the reactants are rich mixtures of hydrogen and oxygen. One-step global chemical reaction rates are used for both gas-phase homogeneous reaction and catalytic heterogeneous reaction. The computed results reveal the transient ignition processes in detail, including the structure variation with time in the reactive catalytic layer. An ignition map using reactor length and catalyst loading is constructed. The comparison of computed results between the two transient models verifies the applicability of the energy-integral model when the time is greater than the second largest time scale of the system. It also suggests that a proper combined use of the two models can catch all the transient phenomena while minimizing the computational cost.

Survival of BPV and Aujeszky's disease viruses in meat wastes subjected to different sanitization processes.

PubMed

Paluszak, Z; Lipowski, A; Ligocka, A

2010-01-01

The effect of composting and anaerobic fermentations under meso- and thermophylic conditions (37 degrees and 55 degrees C) on the survival of bovine parvovirus (BPV) and Aujeszky's disease viruse (ADV) in meat wastes has been examined in this study. Viruses were adsorbed on filters and introduced into carriers which were made of meat fragments of different sizes and bones or in the form of suspension they were introduced into the biomass in the course of processes of waste treatment. Carriers were removed at appropriate time intervals and virus titres were determined. The thermoresistant parvovirus survived for the longest time during mesophylic fermentation (almost 70 days), slightly shorter during composting (7-9.5 days depending on the type of carrier) and for the shortest time--at 55 degrees C (46-76 hours). Its inactivation rate was the fastest in a suspension, slower in meat and bone carriers. ADV inactivation proceeded considerably faster, as compared with BPV. Its active particles were not detected as early as in the 30th minute of thermophylic fermentation, the 6th hour of mesophylic fermentation and at the first sampling time during composting (at the 72nd hour). Total survival time ranged from 50 min to 13 hours. All the tested technologies enabled the effective elimination of ADV and on average twofold decrease in BPV titre. From the study conducted it follows that of both viruses, the BPV should be applied for validation processes of methods used in meat waste processing, particularly if this refers to methods where higher temperature is the factor inactivating pathogens.

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...

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…

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.

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.

Study of ultrasonic cavitation during extraction of the peanut oil at varying frequencies.

PubMed

Zhang, Lei; Zhou, Cunshan; Wang, Bei; Yagoub, Abu El-Gasim A; Ma, Haile; Zhang, Xiao; Wu, Mian

2017-07-01

The ultrasonic extraction of oils is a typical physical processing technology. The extraction process was monitored from the standpoint of the oil quality and efficiency of oil extraction. In this study, the ultrasonic cavitation fields were measured by polyvinylidene fluoride (PVDF) sensor. Waveform of ultrasonic cavitation fields was gained and analyzed. The extraction yield and oxidation properties were compared. The relationship between the fields and cavitation oxidation was established. Numerical calculation of oscillation cycle was done for the cavitation bubbles. Results showed that the resonance frequency, f r , of the oil extraction was 40kHz. At f r , the voltage amplitude was the highest; the time was the shortest as reaching the amplitude of the waveform. Accordingly, the cavitation effect worked most rapidly, resulting in the strongest cavitation intensity. The extraction yield and oxidation properties were closely related to the cavitation effect. It controlled the cavitation oxidation effectively from the viewpoint of chemical and physical aspects. Copyright © 2017 Elsevier B.V. All rights reserved.

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.

The Physics of Decision Making:. Stochastic Differential Equations as Models for Neural Dynamics and Evidence Accumulation in Cortical Circuits

NASA Astrophysics Data System (ADS)

Holmes, Philip; Eckhoff, Philip; Wong-Lin, K. F.; Bogacz, Rafal; Zacksenhouse, Miriam; Cohen, Jonathan D.

2010-03-01

We describe how drift-diffusion (DD) processes - systems familiar in physics - can be used to model evidence accumulation and decision-making in two-alternative, forced choice tasks. We sketch the derivation of these stochastic differential equations from biophysically-detailed models of spiking neurons. DD processes are also continuum limits of the sequential probability ratio test and are therefore optimal in the sense that they deliver decisions of specified accuracy in the shortest possible time. This leaves open the critical balance of accuracy and speed. Using the DD model, we derive a speed-accuracy tradeoff that optimizes reward rate for a simple perceptual decision task, compare human performance with this benchmark, and discuss possible reasons for prevalent sub-optimality, focussing on the question of uncertain estimates of key parameters. We present an alternative theory of robust decisions that allows for uncertainty, and show that its predictions provide better fits to experimental data than a more prevalent account that emphasises a commitment to accuracy. The article illustrates how mathematical models can illuminate the neural basis of cognitive processes.

Quantification of reaction time and time perception during Space Shuttle operations

NASA Technical Reports Server (NTRS)

Ratino, D. A.; Repperger, D. W.; Goodyear, C.; Potor, G.; Rodriguez, L. E.

1988-01-01

A microprocessor-based test battery containing simple reaction time, choice reaction time, and time perception tasks was flown aboard a 1985 Space Shuttle flight. Data were obtained from four crew members. Individual subject means indicate a correlation between change in reaction time during the flight and the presence of space motion sickness symptoms. The time perception task results indicate that the shortest duration task time (2 s) is progressively overestimated as the mission proceeds and is statistically significant when comparing preflight and postflight baselines. The tasks that required longer periods of time to estimate (8, 12, and 16 s) are less affected.

Care processes associated with quicker door-in-door-out times for patients with ST-elevation-myocardial infarction requiring transfer: results from a statewide regionalization program.

PubMed

Glickman, Seth W; Lytle, Barbara L; Ou, Fang-Shu; Mears, Greg; O'Brien, Sean; Cairns, Charles B; Garvey, J Lee; Bohle, David J; Peterson, Eric D; Jollis, James G; Granger, Christopher B

2011-07-01

The ability to rapidly identify patients with ST-segment elevation-myocardial infarction (STEMI) at hospitals without percutaneous coronary intervention (PCI) and transfer them to hospitals with PCI capability is critical to STEMI regionalization efforts. Our objective was to assess the association of prehospital, emergency department (ED), and hospital processes of care implemented as part of a statewide STEMI regionalization program with door-in-door-out times at non-PCI hospitals. Door-in-door-out times for 436 STEMI patients at 55 non-PCI hospitals were determined before (July 2005 to September 2005) and after (January 2007 to March 2007) a year-long implementation of standardized protocols as part of a statewide regionalization program (Reperfusion of Acute Myocardial Infarction in North Carolina Emergency Departments, RACE). The association of 8 system care processes (encompassing emergency medical services [EMS], ED, and hospital settings) with door-in-door-out times was determined using multivariable linear regression. Median door-in-door-out times improved significantly with the intervention (before: 97.0 minutes, interquartile range, 56.0 to 160.0 minutes; after: 58.0 minutes, interquartile range, 35.0 to 90.0 minutes; P<0.0001). Hospital, ED, and EMS care processes were each independently associated with shorter door-in-door-out times (-17.7 [95% confidence interval, -27.5 to -7.9]; -10.1 [95% confidence interval, -19.0 to -1.1], and -7.3 [95% confidence interval, -13.0 to -1.5] minutes for each additional hospital, ED, and EMS process, respectively). Combined, adoption of EMS processes was associated with the shortest median treatment times (44 versus 138 minutes for hospitals that adopted all EMS processes versus none). Prehospital, ED, and hospital processes of care were independently associated with shorter door-in-door-out times for STEMI patients requiring transfer. Adoption of several EMS processes was associated with the largest reduction in treatment times. These findings highlight the need for an integrated, system-based approach to improving STEMI care.

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.

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.

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.

CFD simulation of local and global mixing time in an agitated tank

NASA Astrophysics Data System (ADS)

Li, Liangchao; Xu, Bin

2017-01-01

The Issue of mixing efficiency in agitated tanks has drawn serious concern in many industrial processes. The turbulence model is very critical to predicting mixing process in agitated tanks. On the basis of computational fluid dynamics(CFD) software package Fluent 6.2, the mixing characteristics in a tank agitated by dual six-blade-Rushton-turbines(6-DT) are predicted using the detached eddy simulation(DES) method. A sliding mesh(SM) approach is adopted to solve the rotation of the impeller. The simulated flow patterns and liquid velocities in the agitated tank are verified by experimental data in the literature. The simulation results indicate that the DES method can obtain more flow details than Reynolds-averaged Navier-Stokes(RANS) model. Local and global mixing time in the agitated tank is predicted by solving a tracer concentration scalar transport equation. The simulated results show that feeding points have great influence on mixing process and mixing time. Mixing efficiency is the highest for the feeding point at location of midway of the two impellers. Two methods are used to determine global mixing time and get close result. Dimensionless global mixing time remains unchanged with increasing of impeller speed. Parallel, merging and diverging flow pattern form in the agitated tank, respectively, by changing the impeller spacing and clearance of lower impeller from the bottom of the tank. The global mixing time is the shortest for the merging flow, followed by diverging flow, and the longest for parallel flow. The research presents helpful references for design, optimization and scale-up of agitated tanks with multi-impeller.

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.

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.

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.

A novel rat model of brachial plexus injury with nerve root stumps.

PubMed

Fang, Jintao; Yang, Jiantao; Yang, Yi; Li, Liang; Qin, Bengang; He, Wenting; Yan, Liwei; Chen, Gang; Tu, Zhehui; Liu, Xiaolin; Gu, Liqiang

2018-02-01

The C5-C6 nerve roots are usually spared from avulsion after brachial plexus injury (BPI) and thus can be used as donors for nerve grafting. To date, there are no appropriate animal models to evaluate spared nerve root stumps. Hence, the aim of this study was to establish and evaluate a rat model with spared nerve root stumps in BPI. In rupture group, the proximal parts of C5-T1 nerve roots were held with the surrounding muscles and the distal parts were pulled by a sudden force after the brachial plexus was fully exposed, and the results were compared with those of sham group. To validate the model, the lengths of C5-T1 spared nerve root stumps were measured and the histologies of the shortest one and the corresponding spinal cord were evaluated. C5 nerve root stump was found to be the shortest. Histology findings demonstrated that the nerve fibers became more irregular and the continuity decreased; numbers and diameters of myelinated axons and thickness of myelin sheaths significantly decreased over time. The survival of motoneurons was reduced, and the death of motoneurons may be related to the apoptotic process. Our model could successfully create BPI model with nerve root stumps by traction, which could simulate injury mechanisms. While other models involve root avulsion or rupturing by distal nerve transection. This model would be suitable for evaluating nerve root stumps and testing new therapeutic strategies for neuroprotection through nerve root stumps in the future. Copyright © 2017. Published by Elsevier B.V.

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

Raccach, M.; Henrickson, R.L.

The electrical stimulation (ES) period was a very important factor determining the tenderness of three bovine muscles: Biceps femoris (BF), Longissimus dorsi (LD), and Semimembranosus (SM). Tenderness (shear force values) increased in most cases with increasing the ES period. An ES period of 15 min was optimal for obtaining a tenderness equal to that obtained by conventional processing of beef. The shortest ES period used (1 min) was adequate in most cases to set the muscles in rigor mortis and in preventing cold shortening. The tenderness of blade tenderized muscles was in most cases independent from the ES period. Blademore » tenderization was very effective to tenderize the BF muscle followed in decreasing order of efficacy by the LD and SM muscles. The cooking times and cooking losses of the three muscles were not affected by either the ES period or by blade tenderization.« less

Indentation analysis of active viscoelastic microplasmodia of P. polycephalum

NASA Astrophysics Data System (ADS)

Fessel, Adrian; Oettmeier, Christina; Wechsler, Klaus; Döbereiner, Hans-Günther

2018-01-01

Simple organisms like Physarum polycephalum realize complex behavior, such as shortest path optimization or habituation, via mechanochemical processes rather than by a network of neurons. A full understanding of these phenomena requires detailed investigation of the underlying mechanical properties. To date, micromechanical measurements on P. polycephalum are sparse and lack reproducibility. This prompts study of microplasmodia, a reproducible and homogeneous form of P. polycephalum that resembles the plasmodial ectoplasm responsible for mechanical stability and generation of forces. We combine investigation of ultra-structure and dimension of P. polycephalum with the analysis of data obtained by indentation of microplasmodia, employing a novel nonlinear viscoelastic scaling model that accounts for finite dimension of the sample. We identify the multi-modal distribution of parameters such as Young’s moduls, Poisson’s ratio, and relaxation times associated with viscous processes that cover five orders of magnitude. Results suggest a characterization of microplasmodia as porous, compressible structures that act like elastic solids with high Young’s modulus on short time scales, whereas on long time-scales and upon repeated indentation viscous behavior dominates and the effective modulus is significantly decreased. Furthermore, Young’s modulus is found to oscillate in phase with shape of microplasmodia, emphasizing that modeling P. polycephalum oscillations as a driven oscillator with constant moduli is not practicable.

Fuzzy Relational Compression Applied on Feature Vectors for Infant Cry Recognition

NASA Astrophysics Data System (ADS)

Reyes-Galaviz, Orion Fausto; Reyes-García, Carlos Alberto

Data compression is always advisable when it comes to handling and processing information quickly and efficiently. There are two main problems that need to be solved when it comes to handling data; store information in smaller spaces and processes it in the shortest possible time. When it comes to infant cry analysis (ICA), there is always the need to construct large sound repositories from crying babies. Samples that have to be analyzed and be used to train and test pattern recognition algorithms; making this a time consuming task when working with uncompressed feature vectors. In this work, we show a simple, but efficient, method that uses Fuzzy Relational Product (FRP) to compresses the information inside a feature vector, building with this a compressed matrix that will help us recognize two kinds of pathologies in infants; Asphyxia and Deafness. We describe the sound analysis, which consists on the extraction of Mel Frequency Cepstral Coefficients that generate vectors which will later be compressed by using FRP. There is also a description of the infant cry database used in this work, along with the training and testing of a Time Delay Neural Network with the compressed features, which shows a performance of 96.44% with our proposed feature vector compression.

Training in rapid auditory processing ameliorates auditory comprehension in aphasic patients: a randomized controlled pilot study.

PubMed

Szelag, Elzbieta; Lewandowska, Monika; Wolak, Tomasz; Seniow, Joanna; Poniatowska, Renata; Pöppel, Ernst; Szymaszek, Aneta

2014-03-15

Experimental studies have often reported close associations between rapid auditory processing and language competency. The present study was aimed at improving auditory comprehension in aphasic patients following specific training in the perception of temporal order (TO) of events. We tested 18 aphasic patients showing both comprehension and TO perception deficits. Auditory comprehension was assessed by the Token Test, phonemic awareness and Voice-Onset-Time Test. The TO perception was assessed using auditory Temporal-Order-Threshold, defined as the shortest interval between two consecutive stimuli, necessary to report correctly their before-after relation. Aphasic patients participated in eight 45-minute sessions of either specific temporal training (TT, n=11) aimed to improve sequencing abilities, or control non-temporal training (NT, n=7) focussed on volume discrimination. The TT yielded improved TO perception; moreover, a transfer of improvement was observed from the time domain to the language domain, which was untrained during the training. The NT did not improve either the TO perception or comprehension in any language test. These results are in agreement with previous literature studies which proved ameliorated language competency following the TT in language-learning-impaired or dyslexic children. Our results indicated for the first time such benefits also in aphasic patients. Copyright © 2013 Elsevier B.V. All rights reserved.

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.

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.

Choice with frequently changing food rates and food ratios.

PubMed

Baum, William M; Davison, Michael

2014-03-01

In studies of operant choice, when one schedule of a concurrent pair is varied while the other is held constant, the constancy of the constant schedule may exert discriminative control over performance. In our earlier experiments, schedules varied reciprocally across components within sessions, so that while food ratio varied food rate remained constant. In the present experiment, we held one variable-interval (VI) schedule constant while varying the concurrent VI schedule within sessions. We studied five conditions, each with a different constant left VI schedule. On the right key, seven different VI schedules were presented in seven different unsignaled components. We analyzed performances at several different time scales. At the longest time scale, across conditions, behavior ratios varied with food ratios as would be expected from the generalized matching law. At shorter time scales, effects due to holding the left VI constant became more and more apparent, the shorter the time scale. In choice relations across components, preference for the left key leveled off as the right key became leaner. Interfood choice approximated strict matching for the varied right key, whereas interfood choice hardly varied at all for the constant left key. At the shortest time scale, visit patterns differed for the left and right keys. Much evidence indicated the development of a fix-and-sample pattern. In sum, the procedural difference made a large difference to performance, except for choice at the longest time scale and the fix-and-sample pattern at the shortest time scale. © Society for the Experimental Analysis of Behavior.

Cell transmission model of dynamic assignment for urban rail transit networks.

PubMed

Xu, Guangming; Zhao, Shuo; Shi, Feng; Zhang, Feilian

2017-01-01

For urban rail transit network, the space-time flow distribution can play an important role in evaluating and optimizing the space-time resource allocation. For obtaining the space-time flow distribution without the restriction of schedules, a dynamic assignment problem is proposed based on the concept of continuous transmission. To solve the dynamic assignment problem, the cell transmission model is built for urban rail transit networks. The priority principle, queuing process, capacity constraints and congestion effects are considered in the cell transmission mechanism. Then an efficient method is designed to solve the shortest path for an urban rail network, which decreases the computing cost for solving the cell transmission model. The instantaneous dynamic user optimal state can be reached with the method of successive average. Many evaluation indexes of passenger flow can be generated, to provide effective support for the optimization of train schedules and the capacity evaluation for urban rail transit network. Finally, the model and its potential application are demonstrated via two numerical experiments using a small-scale network and the Beijing Metro network.

Ignition in an Atomistic Model of Hydrogen Oxidation.

PubMed

Alaghemandi, Mohammad; Newcomb, Lucas B; Green, Jason R

2017-03-02

Hydrogen is a potential substitute for fossil fuels that would reduce the combustive emission of carbon dioxide. However, the low ignition energy needed to initiate oxidation imposes constraints on the efficiency and safety of hydrogen-based technologies. Microscopic details of the combustion processes, ephemeral transient species, and complex reaction networks are necessary to control and optimize the use of hydrogen as a commercial fuel. Here, we report estimates of the ignition time of hydrogen-oxygen mixtures over a wide range of equivalence ratios from extensive reactive molecular dynamics simulations. These data show that the shortest ignition time corresponds to a fuel-lean mixture with an equivalence ratio of 0.5, where the number of hydrogen and oxygen molecules in the initial mixture are identical, in good agreement with a recent chemical kinetic model. We find two signatures in the simulation data precede ignition at pressures above 200 MPa. First, there is a peak in hydrogen peroxide that signals ignition is imminent in about 100 ps. Second, we find a strong anticorrelation between the ignition time and the rate of energy dissipation, suggesting the role of thermal feedback in stimulating ignition.

Recognition memory: a review of the critical findings and an integrated theory for relating them.

PubMed

Malmberg, Kenneth J

2008-12-01

The development of formal models has aided theoretical progress in recognition memory research. Here, I review the findings that are critical for testing them, including behavioral and brain imaging results of single-item recognition, plurality discrimination, and associative recognition experiments under a variety of testing conditions. I also review the major approaches to measurement and process modeling of recognition. The review indicates that several extant dual-process measures of recollection are unreliable, and thus they are unsuitable as a basis for forming strong conclusions. At the process level, however, the retrieval dynamics of recognition memory and the effect of strengthening operations suggest that a recall-to-reject process plays an important role in plurality discrimination and associative recognition, but not necessarily in single-item recognition. A new theoretical framework proposes that the contribution of recollection to recognition depends on whether the retrieval of episodic details improves accuracy, and it organizes the models around the construct of efficiency. Accordingly, subjects adopt strategies that they believe will produce a desired level of accuracy in the shortest amount of time. Several models derived from this framework are shown to account the accuracy, latency, and confidence with which the various recognition tasks are performed.

Investigation of the roles of trace elements during hepatitis C virus infection using protein-protein interactions and a shortest path algorithm.

PubMed

Zhu, LiuCun; Chen, XiJia; Kong, Xiangyin; Cai, Yu-Dong

2016-11-01

Hepatitis is a type of infectious disease that induces inflammation of the liver without pinpointing a particular pathogen or pathogenesis. Type C hepatitis, as a type of hepatitis, has been reported to induce cirrhosis and hepatocellular carcinoma within a very short amount of time. It is a great threat to human health. Some studies have revealed that trace elements are associated with infection with and immune rejection against hepatitis C virus (HCV). However, the mechanism underlying this phenomenon is still unclear. In this study, we aimed to expand our knowledge of this phenomenon by designing a computational method to identify genes that may be related to both HCV and trace element metabolic processes. The searching procedure included three stages. First, a shortest path algorithm was applied to a large network, constructed by protein-protein interactions, to identify potential genes of interest. Second, a permutation test was executed to exclude false discoveries. Finally, some rules based on the betweenness and associations between candidate genes and HCV and trace elements were built to select core genes among the remaining genes. 12 lists of genes, corresponding to 12 types of trace elements, were obtained. These genes are deemed to be associated with HCV infection and trace elements metabolism. The analyses indicate that some genes may be related to both HCV and trace element metabolic processes, further confirming the associations between HCV and trace elements. The method was further tested on another set of HCV genes, the results indicate that this method is quite robustness. The newly found genes may partially reveal unknown mechanisms between HCV infection and trace element metabolism. This article is part of a Special Issue entitled "System Genetics" Guest Editor: Dr. Yudong Cai and Dr. Tao Huang. Copyright © 2016 Elsevier B.V. All rights reserved.

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

Correlation based networks of equity returns sampled at different time horizons

NASA Astrophysics Data System (ADS)

Tumminello, M.; di Matteo, T.; Aste, T.; Mantegna, R. N.

2007-01-01

We investigate the planar maximally filtered graphs of the portfolio of the 300 most capitalized stocks traded at the New York Stock Exchange during the time period 2001 2003. Topological properties such as the average length of shortest paths, the betweenness and the degree are computed on different planar maximally filtered graphs generated by sampling the returns at different time horizons ranging from 5 min up to one trading day. This analysis confirms that the selected stocks compose a hierarchical system progressively structuring as the sampling time horizon increases. Finally, a cluster formation, associated to economic sectors, is quantitatively investigated.

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.

Time-interval for integration of stabilizing haptic and visual information in subjects balancing under static and dynamic conditions

PubMed Central

Honeine, Jean-Louis; Schieppati, Marco

2014-01-01

Maintaining equilibrium is basically a sensorimotor integration task. The central nervous system (CNS) continually and selectively weights and rapidly integrates sensory inputs from multiple sources, and coordinates multiple outputs. The weighting process is based on the availability and accuracy of afferent signals at a given instant, on the time-period required to process each input, and possibly on the plasticity of the relevant pathways. The likelihood that sensory inflow changes while balancing under static or dynamic conditions is high, because subjects can pass from a dark to a well-lit environment or from a tactile-guided stabilization to loss of haptic inflow. This review article presents recent data on the temporal events accompanying sensory transition, on which basic information is fragmentary. The processing time from sensory shift to reaching a new steady state includes the time to (a) subtract or integrate sensory inputs; (b) move from allocentric to egocentric reference or vice versa; and (c) adjust the calibration of motor activity in time and amplitude to the new sensory set. We present examples of processes of integration of posture-stabilizing information, and of the respective sensorimotor time-intervals while allowing or occluding vision or adding or subtracting tactile information. These intervals are short, in the order of 1–2 s for different postural conditions, modalities and deliberate or passive shift. They are just longer for haptic than visual shift, just shorter on withdrawal than on addition of stabilizing input, and on deliberate than unexpected mode. The delays are the shortest (for haptic shift) in blind subjects. Since automatic balance stabilization may be vulnerable to sensory-integration delays and to interference from concurrent cognitive tasks in patients with sensorimotor problems, insight into the processing time for balance control represents a critical step in the design of new balance- and locomotion training devices. PMID:25339872

Effect of Sampling Schedule on Pharmacokinetic Parameter Estimates of Promethazine in Astronauts

NASA Technical Reports Server (NTRS)

Boyd, Jason L.; Wang, Zuwei; Putcha, Lakshmi

2005-01-01

Six astronauts on the Shuttle Transport System (STS) participated in an investigation on the pharmacokinetics of promethazine (PMZ), a medication used for the treatment of space motion sickness (SMS) during flight. Each crewmember completed the protocol once during flight and repeated thirty days after returned to Earth. Saliva samples were collected at scheduled times for 72 h after PMZ administration; more frequent samples were collected on the ground than during flight owing to schedule constraints in flight. PMZ concentrations in saliva were determined by a liquid chromatographic/mass spectrometric (LC-MS) assay and pharmacokinetic parameters (PKPs) were calculated using actual flight and ground-based data sets and using time-matched sampling schedule on ground to that during flight. Volume of distribution (V(sub c)) and clearance (Cl(sub s),) decreased during flight compared to that from time-matched ground data set; however, Cl(sub s) and V(sub c) estimates were higher for all subjects when partial ground data sets were used for analysis. Area under the curve (AUC) normalized with administered dose was similar in flight and partial ground data; however AUC was significantly lower using time-matched sampling compared with the full data set on ground. Half life (t(sub 1/2)) was longest during flight, shorter with matched-sampling schedule on ground and shortest when complete data set from ground was used. Maximum concentration (C(sub max)), time for C(sub max), (t(sub max)), parameters of drug absorption, depicted a similar trend with lowest and longest respectively, during flight, lower with time-matched ground data and highest and shortest with full ground data.

Comparison of meal patterns across five European countries using standardized 24-h recall (GloboDiet) data from the EFCOVAL project.

PubMed

Park, Min Kyung; Freisling, Heinz; Huseinovic, Ena; Winkvist, Anna; Huybrechts, Inge; Crispim, Sandra Patricia; de Vries, Jeanne H M; Geelen, Anouk; Niekerk, Maryse; van Rossum, Caroline; Slimani, Nadia

2018-04-01

To examine meal patterns in terms of frequency and circadian timing of eating in five European countries participating in the EFCOVAL project. In this cross-sectional study, 559 men and women, aged 44-65 years, were recruited in Belgium, the Czech Republic, France (Southern part), The Netherlands, and Norway. Dietary data were collected by trained interviewers using standardized computerised 24-h recalls (GloboDiet). Means ± SE of (1) eating frequency, (2) overnight fasting, and (3) time between eating occasions were estimated by country using means from 2 days of 24-h recalls. We also estimated the frequency of eating occasions per hour by country as well as the proportional energy intake of meals/snacks by country compared to the mean energy intake of all countries. Mean eating frequency ranged from 4.3 times/day in France to 7.1 times/day in The Netherlands (p < 0.05). Mean overnight fasting was shortest in the Netherlands (9.2 h) and longest in Czech Republic (10.9 h) (p < 0.05). Mean time between single eating occasions was shortest in The Netherlands (2.4 h) and longest in France (4.3 h) (p < 0.05). Different patterns of energy intake by meals and snacks throughout the day were observed across the five countries. We observed distinct differences in meal patterns across the five European countries included in the current study in terms of frequency and circadian timing of eating, and the proportion of energy intake from eating occasions.

Effect of sampling schedule on pharmacokinetic parameter estimates of promethazine in astronauts

NASA Astrophysics Data System (ADS)

Boyd, Jason L.; Wang, Zuwei; Putcha, Lakshmi

2005-08-01

Six astronauts on the Shuttle Transport System (STS) participated in an investigation on the pharmacokinetics of promethazine (PMZ), a medication used for the treatment of space motion sickness (SMS) during flight. Each crewmember completed the protocol once during flight and repeated thirty days after returned to Earth. Saliva samples were collected at scheduled times for 72 h after PMZ administration; more frequent samples were collected on the ground than during flight owing to schedule constraints in flight. PMZ concentrations in saliva were determined by a liquid chromatographic/mass spectrometric (LC-MS) assay and pharmacokinetic parameters (PKPs) were calculated using actual flight and ground-based data sets and using time-matched sampling schedule on ground to that during flight. Volume of distribution (Vc) and clearance (Cls) decreased during flight compared to that from time-matched ground data set; however, ClS and Vc estimates were higher for all subjects when partial ground data sets were used for analysis. Area under the curve (AUC) normalized with administered dose was similar in flight and partial ground data; however AUC was significantly lower using time-matched sampling compared with the full data set on ground. Half life (t1/2) was longest during flight, shorter with matched-sampling schedule on ground and shortest when complete data set from ground was used. Maximum concentration (Cmax), time for Cmax (tmax), parameters of drug absorption, depicted a similar trend with lowest and longest respectively, during flight, lower with time- matched ground data and highest and shortest with full ground data.

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.

Split-plot designs for robotic serial dilution assays.

PubMed

Buzas, Jeffrey S; Wager, Carrie G; Lansky, David M

2011-12-01

This article explores effective implementation of split-plot designs in serial dilution bioassay using robots. We show that the shortest path for a robot to fill plate wells for a split-plot design is equivalent to the shortest common supersequence problem in combinatorics. We develop an algorithm for finding the shortest common supersequence, provide an R implementation, and explore the distribution of the number of steps required to implement split-plot designs for bioassay through simulation. We also show how to construct collections of split plots that can be filled in a minimal number of steps, thereby demonstrating that split-plot designs can be implemented with nearly the same effort as strip-plot designs. Finally, we provide guidelines for modeling data that result from these designs. © 2011, The International Biometric Society.

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.

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...

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

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.

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.

Recovery time and state change of terrestrial carbon cycle after disturbance

NASA Astrophysics Data System (ADS)

Fu, Zheng; Li, Dejun; Hararuk, Oleksandra; Schwalm, Christopher; Luo, Yiqi; Yan, Liming; Niu, Shuli

2017-10-01

Ecosystems usually recover from disturbance until a stable state, during which carbon (C) is accumulated to compensate for the C loss associated with disturbance events. However, it is not well understood how likely it is for an ecosystem to recover to an alternative state and how long it takes to recover toward a stable state. Here, we synthesized the results from 77 peer-reviewed case studies that examined ecosystem recovery following disturbances to quantify state change (relative changes between pre-disturbance and fully recovered states) and recovery times for various C cycle variables and disturbance types. We found that most ecosystem C pools and fluxes fully recovered to a stable state that was not significantly different from the pre-disturbance state, except for leaf area index and net primary productivity, which were 10% and 35% higher than the pre-disturbance value, respectively, in forest ecosystem. Recovery times varied largely among variables and disturbance types in the forest, with the longest recovery time required for total biomass (104 ± 33 years) and the shortest time required for C fluxes (23 ± 5 years). The longest and shortest recovery times for different disturbance types are deforestation (101 ± 28 years) and drought (10 ± 1 years), respectively. The recovery time was related to disturbance severity with severer disturbances requiring longer recovery times. However, in the long term, recovery had a strong tendency to drive ecosystem C accumulation towards an equilibrium state. Although we assumed disturbances are static, the recovery-related estimates and relationships revealed in this study are crucial for improving the estimates of disturbance impacts and long-term C balance in terrestrial ecosystems within a disturbance-recovery cycle.

Fast Transformation of Temporal Plans for Efficient Execution

NASA Technical Reports Server (NTRS)

Tsamardinos, Ioannis; Muscettola, Nicola; Morris, Paul

1998-01-01

Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of execution flexibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the flexible plan. To minimize execution latency, this propagation needs to be very efficient. Previous work showed that every temporal plan can be reformulated as a dispatchable plan, i.e., one for which propagation to immediate neighbors is sufficient. A simple algorithm was given that finds a dispatchable plan with a minimum number of edges in cubic time and quadratic space. In this paper, we focus on the efficiency of the reformulation process, and improve on that result. A new algorithm is presented that uses linear space and has time complexity equivalent to Johnson s algorithm for all-pairs shortest-path problems. Experimental evidence confirms the practical effectiveness of the new algorithm. For example, on a large commercial application, the performance is improved by at least two orders of magnitude. We further show that the dispatchable plan, already minimal in the total number of edges, can also be made minimal in the maximum number of edges incoming or outgoing at any node.

PCA-based artifact removal algorithm for stroke detection using UWB radar imaging.

PubMed

Ricci, Elisa; di Domenico, Simone; Cianca, Ernestina; Rossi, Tommaso; Diomedi, Marina

2017-06-01

Stroke patients should be dispatched at the highest level of care available in the shortest time. In this context, a transportable system in specialized ambulances, able to evaluate the presence of an acute brain lesion in a short time interval (i.e., few minutes), could shorten delay of treatment. UWB radar imaging is an emerging diagnostic branch that has great potential for the implementation of a transportable and low-cost device. Transportability, low cost and short response time pose challenges to the signal processing algorithms of the backscattered signals as they should guarantee good performance with a reasonably low number of antennas and low computational complexity, tightly related to the response time of the device. The paper shows that a PCA-based preprocessing algorithm can: (1) achieve good performance already with a computationally simple beamforming algorithm; (2) outperform state-of-the-art preprocessing algorithms; (3) enable a further improvement in the performance (and/or decrease in the number of antennas) by using a multistatic approach with just a modest increase in computational complexity. This is an important result toward the implementation of such a diagnostic device that could play an important role in emergency scenario.

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.

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.

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

A novel approach to optimize workflow in grid-based teleradiology applications.

PubMed

Yılmaz, Ayhan Ozan; Baykal, Nazife

2016-01-01

This study proposes an infrastructure with a reporting workflow optimization algorithm (RWOA) in order to interconnect facilities, reporting units and radiologists on a single access interface, to increase the efficiency of the reporting process by decreasing the medical report turnaround time and to increase the quality of medical reports by determining the optimum match between the inspection and radiologist in terms of subspecialty, workload and response time. Workflow centric network architecture with an enhanced caching, querying and retrieving mechanism is implemented by seamlessly integrating Grid Agent and Grid Manager to conventional digital radiology systems. The inspection and radiologist attributes are modelled using a hierarchical ontology structure. Attribute preferences rated by radiologists and technical experts are formed into reciprocal matrixes and weights for entities are calculated utilizing Analytic Hierarchy Process (AHP). The assignment alternatives are processed by relation-based semantic matching (RBSM) and Integer Linear Programming (ILP). The results are evaluated based on both real case applications and simulated process data in terms of subspecialty, response time and workload success rates. Results obtained using simulated data are compared with the outcomes obtained by applying Round Robin, Shortest Queue and Random distribution policies. The proposed algorithm is also applied to a real case teleradiology application process data where medical reporting workflow was performed based on manual assignments by the chief radiologist for 6225 inspections. RBSM gives the highest subspecialty success rate and integrating ILP with RBSM ratings as RWOA provides a better response time and workload distribution success rate. RWOA based image delivery also prevents bandwidth, storage or hardware related stuck and latencies. When compared with a real case teleradiology application where inspection assignments were performed manually, the proposed solution was found to increase the experience success rate by 13.25%, workload success rate by 63.76% and response time success rate by 120%. The total response time in the real case application data was improved by 22.39%. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Integration of electromagnetic induction sensor data in soil sampling scheme optimization using simulated annealing.

PubMed

Barca, E; Castrignanò, A; Buttafuoco, G; De Benedetto, D; Passarella, G

2015-07-01

Soil survey is generally time-consuming, labor-intensive, and costly. Optimization of sampling scheme allows one to reduce the number of sampling points without decreasing or even increasing the accuracy of investigated attribute. Maps of bulk soil electrical conductivity (EC a ) recorded with electromagnetic induction (EMI) sensors could be effectively used to direct soil sampling design for assessing spatial variability of soil moisture. A protocol, using a field-scale bulk EC a survey, has been applied in an agricultural field in Apulia region (southeastern Italy). Spatial simulated annealing was used as a method to optimize spatial soil sampling scheme taking into account sampling constraints, field boundaries, and preliminary observations. Three optimization criteria were used. the first criterion (minimization of mean of the shortest distances, MMSD) optimizes the spreading of the point observations over the entire field by minimizing the expectation of the distance between an arbitrarily chosen point and its nearest observation; the second criterion (minimization of weighted mean of the shortest distances, MWMSD) is a weighted version of the MMSD, which uses the digital gradient of the grid EC a data as weighting function; and the third criterion (mean of average ordinary kriging variance, MAOKV) minimizes mean kriging estimation variance of the target variable. The last criterion utilizes the variogram model of soil water content estimated in a previous trial. The procedures, or a combination of them, were tested and compared in a real case. Simulated annealing was implemented by the software MSANOS able to define or redesign any sampling scheme by increasing or decreasing the original sampling locations. The output consists of the computed sampling scheme, the convergence time, and the cooling law, which can be an invaluable support to the process of sampling design. The proposed approach has found the optimal solution in a reasonable computation time. The use of bulk EC a gradient as an exhaustive variable, known at any node of an interpolation grid, has allowed the optimization of the sampling scheme, distinguishing among areas with different priority levels.

Creep Response and Deformation Processes in Nanocluster Strengthened Ferritic Steels

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

Hayashi, Taisuke; Sarosi, P. M.; Schneibel, Joachim H

2008-01-01

There is increasing demand for oxide-dispersion-strengthened ferritic alloys that possess both high-temperature strength and irradiation resistance. Improvement of the high-temperature properties requires an understanding of the operative deformation mechanisms. In this study, the microstructures and creep properties of the oxide-dispersion-strengthened alloy 14YWT have been evaluated as a function of annealing at 1000 C for 1 hour up to 32 days. The ultra-fine initial grain size (approx. 100nm) is stable after the shortest annealing time, and even after subsequent creep at 800 C. Longer annealing periods lead to anomalous grain growth that is further enhanced following creep. Remarkably, the minimum creepmore » rate is relatively insensitive to this dramatic grain-coarsening. The creep strength is attributed to highly stable, Ti-rich nanoclusters that appear to pin the initial primary grains, and present strong obstacles to dislocation motion in the large, anomalously grown grains.« less

Voluminous eruption from a zoned magma body after an increase in supply rate at Axial Seamount

NASA Astrophysics Data System (ADS)

Chadwick, W. W.; Paduan, J. B.; Clague, D. A.; Dreyer, B. M.; Merle, S. G.; Bobbitt, A. M.; Caress, D. W.; Philip, B. T.; Kelley, D. S.; Nooner, S. L.

2016-12-01

Axial Seamount is the best monitored submarine volcano in the world, providing an exceptional window into the dynamic interactions between magma storage, transport, and eruption processes in a mid-ocean ridge setting. An eruption in April 2015 produced the largest volume of erupted lava since monitoring and mapping began in the mid-1980s after the shortest repose time, due to a recent increase in magma supply. The higher rate of magma replenishment since 2011 resulted in the eruption of the most mafic lava in the last 500-600 years. Eruptive fissures at the volcano summit produced pyroclastic ash that was deposited over an area of at least 8 km2. A systematic spatial distribution of compositions is consistent with a single dike tapping different parts of a thermally and chemically zoned magma reservoir that can be directly related to previous multichannel seismic-imaging results.

Experiment and modeling of paired effect on evacuation from a three-dimensional space

NASA Astrophysics Data System (ADS)

Jun, Hu; Huijun, Sun; Juan, Wei; Xiaodan, Chen; Lei, You; Musong, Gu

2014-10-01

A novel three-dimensional cellular automata evacuation model was proposed based on stairs factor for paired effect and variety velocities in pedestrian evacuation. In the model pedestrians' moving probability of target position at the next moment was defined based on distance profit and repulsive force profit, and evacuation strategy was elaborated in detail through analyzing variety velocities and repulsive phenomenon in moving process. At last, experiments with the simulation platform were conducted to study the relationships of evacuation time, average velocity and pedestrian velocity. The results showed that when the ratio of single pedestrian was higher in the system, the shortest route strategy was good for improving evacuation efficiency; in turn, if ratio of paired pedestrians was higher, it is good for improving evacuation efficiency to adopt strategy that avoided conflicts, and priority should be given to scattered evacuation.

Correlation and 3D-tracking of objects by pointing sensors

DOEpatents

Griesmeyer, J. Michael

2017-04-04

A method and system for tracking at least one object using a plurality of pointing sensors and a tracking system are disclosed herein. In a general embodiment, the tracking system is configured to receive a series of observation data relative to the at least one object over a time base for each of the plurality of pointing sensors. The observation data may include sensor position data, pointing vector data and observation error data. The tracking system may further determine a triangulation point using a magnitude of a shortest line connecting a line of sight value from each of the series of observation data from each of the plurality of sensors to the at least one object, and perform correlation processing on the observation data and triangulation point to determine if at least two of the plurality of sensors are tracking the same object. Observation data may also be branched, associated and pruned using new incoming observation data.

Olfactory discrimination and memory deficits in the Flinders Sensitive Line rodent model of depression.

PubMed

Cook, A; Pfeiffer, L-M; Thiele, S; Coenen, V A; Döbrössy, M D

2017-10-01

Major Depressive Disorder (MDD) is a heterogeneous psychiatric disorder with broad symptomatic manifestations. The current study examined, for the first time, olfactory memory and discrimination in the Flinders Sensitive Line (FSL) rodent model of depression. Male FSL rats and controls were trained on an Olfactory Discrimination (OD) and a Social Interaction (SI) test. On the OD test, the FSL and controls performed similarly at the shortest inter-trial interval (5min), however, with extended delay of 30min, the FSLs had a recall and odour discrimination deficit. At the longest delay (60min) both groups performed poorly. The FSL rats i.) had a deficit in olfactory discrimination suggesting impairment in olfactory memory and recall; ii.) were less likely to socialize with unfamiliar rats. The data suggests that FSL animals have an impaired olfactory information processing capacity. Copyright © 2017 Elsevier B.V. All rights reserved.

Substorm Occurrence and Intensity Associated With Three Types of Solar Wind Structure

NASA Astrophysics Data System (ADS)

Liou, Kan; Sotirelis, Thomas; Richardson, Ian

2018-01-01

This paper presents the results of a study of the characteristics of substorms that occurred during three distinct types of solar wind: coronal mass ejection (CME) associated, high-speed streams (HSS), and slow solar wind (SSW). A total number of 53,468 geomagnetic substorm onsets from 1983 to 2009 is used and sorted by the three solar wind types. It is found that the probability density function (PDF) of the intersubstorm time can be fitted by the combination of a dominant power law with an exponential cutoff component and a minor lognormal component, implying that substorms are associated with two distinctly different dynamical processes corresponding, perhaps, to the "externally driven" and "internally driven" processes, respectively. We compare substorm frequency and intensity associated with the three types of solar wind. It is found that the intersubstorm time is the longest during SSW and shortest during CME intervals. The averaged intersubstorm time for the internally driven substorms is 3.13, 3.15, and 7.96 h for CME, HSS, and SSW, respectively. The substorm intensity PDFs, as represented by the peak value of |SML| (the generalization of AL), can be fitted by two lognormal distribution functions. The averaged substorm intensity for either component is largest for CME (292 and 674 nT) and smallest for SSW (265 and 434 nT). We argue that the externally driven substorms are more intense than those driven internally. We conclude that the dynamical process of substorms is controlled mainly by the direct solar wind-magnetosphere coupling, whereas the internally driven process only plays a very modest minor role.

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.

Dynamic arsenic aging processes and their mechanisms in nine types of Chinese soils.

PubMed

Wang, Yanan; Zeng, Xibai; Lu, Yahai; Bai, Lingyu; Su, Shiming; Wu, Cuixia

2017-11-01

Although specific soil properties controlling the arsenic (As) aging process have been studied extensively, few investigations have attempted to determine how soil types influence As bioavailability and fractionations in soils. Nine types of soil were selected from typical grain producing areas in China, and the bioavailability and fractionations of As during aging were measured. Results showed that available As in all soils rapidly decreased in the first 30 days and slowly declined thereafter. In spiked soils, As easily became less available and less toxic in low pH soils compared to high pH soils, demonstrating the importance of soil pH on As availability. Results from fitting kinetic equations revealed that the pseudo-second-order model described the As aging processes well in all soils (R 2  = 0.945-0.999, P < 0.01, SE = 0.09-4.25), implying that the mechanism for As aging combined adsorption, external diffusion, and internal diffusion. Fe oxides were more important than Al oxides for determining the As aging rate (|k|). Based on these results, we are the first to propose the approximate aging equilibrium time (T) for As, which was mainly influenced by soil clay content. The shortest time for approximate stabilization of As aging was 28 d in latosol soils (LS), while the longest approximate equilibrium time was 169 d in cinnamon soils (CS). Individual soil properties controlling the variation in different As fractionations further confirmed that the influences of soil types on As aging were the result of the combined effects of soil properties and a time-consuming redistribution process. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

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.

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…

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…

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

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.

Fast surface-based travel depth estimation algorithm for macromolecule surface shape description.

PubMed

Giard, Joachim; Alface, Patrice Rondao; Gala, Jean-Luc; Macq, Benoît

2011-01-01

Travel Depth, introduced by Coleman and Sharp in 2006, is a physical interpretation of molecular depth, a term frequently used to describe the shape of a molecular active site or binding site. Travel Depth can be seen as the physical distance a solvent molecule would have to travel from a point of the surface, i.e., the Solvent-Excluded Surface (SES), to its convex hull. Existing algorithms providing an estimation of the Travel Depth are based on a regular sampling of the molecule volume and the use of the Dijkstra's shortest path algorithm. Since Travel Depth is only defined on the molecular surface, this volume-based approach is characterized by a large computational complexity due to the processing of unnecessary samples lying inside or outside the molecule. In this paper, we propose a surface-based approach that restricts the processing to data defined on the SES. This algorithm significantly reduces the complexity of Travel Depth estimation and makes possible the analysis of large macromolecule surface shape description with high resolution. Experimental results show that compared to existing methods, the proposed algorithm achieves accurate estimations with considerably reduced processing times.

Automatic segmentation of the choroid in enhanced depth imaging optical coherence tomography images.

PubMed

Tian, Jing; Marziliano, Pina; Baskaran, Mani; Tun, Tin Aung; Aung, Tin

2013-03-01

Enhanced Depth Imaging (EDI) optical coherence tomography (OCT) provides high-definition cross-sectional images of the choroid in vivo, and hence is used in many clinical studies. However, the quantification of the choroid depends on the manual labelings of two boundaries, Bruch's membrane and the choroidal-scleral interface. This labeling process is tedious and subjective of inter-observer differences, hence, automatic segmentation of the choroid layer is highly desirable. In this paper, we present a fast and accurate algorithm that could segment the choroid automatically. Bruch's membrane is detected by searching the pixel with the biggest gradient value above the retinal pigment epithelium (RPE) and the choroidal-scleral interface is delineated by finding the shortest path of the graph formed by valley pixels using Dijkstra's algorithm. The experiments comparing automatic segmentation results with the manual labelings are conducted on 45 EDI-OCT images and the average of Dice's Coefficient is 90.5%, which shows good consistency of the algorithm with the manual labelings. The processing time for each image is about 1.25 seconds.

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.

Meteorologic, oceanographic, and geomorphic controls on circulation and residence time in a coral reef-lined embayment: Faga'alu Bay, American Samoa

NASA Astrophysics Data System (ADS)

Storlazzi, C. D.; Cheriton, O. M.; Messina, A. M.; Biggs, T. W.

2018-06-01

Water circulation over coral reefs can determine the degree to which reef organisms are exposed to the overlying waters, so understanding circulation is necessary to interpret spatial patterns in coral health. Because coral reefs often have high geomorphic complexity, circulation patterns and the duration of exposure, or "local residence time" of a water parcel, can vary substantially over small distances. Different meteorologic and oceanographic forcings can further alter residence time patterns over reefs. Here, spatially dense Lagrangian surface current drifters and Eulerian current meters were used to characterize circulation patterns and resulting residence times over different regions of the reefs in Faga'alu Bay, American Samoa, during three distinct forcing periods: calm, strong winds, and large waves. Residence times varied among different geomorphic zones of the reef and were reflected in the spatially varying health of the corals across the embayment. The relatively healthy, seaward fringing reef consistently had the shortest residence times, as it was continually flushed by wave breaking at the reef crest, whereas the degraded, sheltered, leeward fringing reef consistently had the longest residence times, suggesting this area is more exposed to land-based sources of pollution. Strong wind forcing resulted in the longest residence times by pinning the water in the bay, whereas large wave forcing flushed the bay and resulted in the shortest residence times. The effect of these different forcings on residence times was fairly consistent across all reef geomorphic zones, with the shift from wind to wave forcing shortening mean residence times by approximately 50%. Although ecologically significant to the coral organisms in the nearshore reef zones, these shortened residence times were still 2-3 times longer than those associated with the seaward fringing reef across all forcing conditions, demonstrating how the geomorphology of a reef environment sets a first-order control on reef health.

The determinants of response time in a repeated constant-sum game: A robust Bayesian hierarchical dual-process model.

PubMed

Spiliopoulos, Leonidas

2018-03-01

The investigation of response time and behavior has a long tradition in cognitive psychology, particularly for non-strategic decision-making. Recently, experimental economists have also studied response time in strategic interactions, but with an emphasis on either one-shot games or repeated social-dilemmas. I investigate the determinants of response time in a repeated (pure-conflict) game, admitting a unique mixed strategy Nash equilibrium, with fixed partner matching. Response times depend upon the interaction of two decision models embedded in a dual-process framework (Achtziger and Alós-Ferrer, 2014; Alós-Ferrer, 2016). The first decision model is the commonly used win-stay/lose-shift heuristic and the second the pattern-detecting reinforcement learning model in Spiliopoulos (2013b). The former is less complex and can be executed more quickly than the latter. As predicted, conflict between these two models (i.e., each one recommending a different course of action) led to longer response times than cases without conflict. The dual-process framework makes other qualitative response time predictions arising from the interaction between the existence (or not) of conflict and which one of the two decision models the chosen action is consistent with-these were broadly verified by the data. Other determinants of RT were hypothesized on the basis of existing theory and tested empirically. Response times were strongly dependent on the actions chosen by both players in the previous rounds and the resulting outcomes. Specifically, response time was shortest after a win in the previous round where the maximum possible payoff was obtained; response time after losses was significantly longer. Strongly auto-correlated behavior (regardless of its sign) was also associated with longer response times. I conclude that, similar to other tasks, there is a strong coupling in repeated games between behavior and RT, which can be exploited to further our understanding of decision making. Copyright © 2017 Elsevier B.V. All rights reserved.

The change of sleeping and lying posture of Japanese black cows after moving into new environment.

PubMed

Fukasawa, Michiru; Komatsu, Tokushi; Higashiyama, Yumi

2018-04-25

The environmental change is one of the stressful events in livestock production. Change in environment disturbed cow behavior and cows needed several days to reach stable behavioral pattern, especially sleeping posture (SP) and lying posture (LP) have been used as an indicator for relax and well-acclimated to its environment. The aim of this study examines how long does Japanese black cow required for stabilization of SP and LP after moving into new environment. Seven pregnant Japanese black cows were used. Cows were moved into new tie-stall shed and measured sleeping and lying posture 17 times during 35 experimental days. Both SP and LP were detected by accelerometer fixed on middle occipital and hip-cross, respectively. Daily total time, frequency, and average bout of both SP and LP were calculated. Daily SP time was the shortest on day 1, and increased to the highest on day3. It decreased until day 9, after that stabilized about 65 min /day till the end of experiment. The longest average SP bout was shown on day 1, and it decreased to stabilize till day 7. Daily LP time was changed as same manner as daily SP time. The average SP bout showed the longest on day 1, and it decreased to stable level till day 7. On the other hand, the average LP bout showed the shortest on day1, and it was increased to stable level till on day 7. These results showed that pregnant Japanese black cows needed 1 week to stabilize their SP. However, there were different change pattern between the average SP and LP bout, even though the change pattern of daily SP and LP time were similar.

Collective benefits in traffic during mega events via the use of information technologies

PubMed Central

Xu, Yanyan; González, Marta C.

2017-01-01

Information technologies today can inform each of us about the route with the shortest time, but they do not contain incentives to manage travellers such that we all get collective benefits in travel times. To that end we need travel demand estimates and target strategies to reduce the traffic volume from the congested roads during peak hours in a feasible way. During large events, the traffic inconveniences in large cities are unusually high, yet temporary, and the entire population may be more willing to adopt collective recommendations for collective benefits in traffic. In this paper, we integrate, for the first time, big data resources to estimate the impact of events on traffic and propose target strategies for collective good at the urban scale. In the context of the Olympic Games in Rio de Janeiro, we first predict the expected increase in traffic. To that end, we integrate data from mobile phones, Airbnb, Waze and transit information, with game schedules and expected attendance in each venue. Next, we evaluate different route choice scenarios for drivers during the peak hours. Finally, we gather information on the trips that contribute the most to the global congestion which could be redirected from vehicles to transit. Interestingly, we show that (i) following new route alternatives during the event with individual shortest times can save more collective travel time than keeping the routine routes used before the event, uncovering the positive value of information technologies during events; (ii) with only a small proportion of people selected from specific areas switching from driving to public transport, the collective travel time can be reduced to a great extent. Results are presented online for evaluation by the public and policymakers (www.flows-rio2016.com (last accessed 3 September 2017)). PMID:28404868

Collective benefits in traffic during mega events via the use of information technologies.

PubMed

Xu, Yanyan; González, Marta C

2017-04-01

Information technologies today can inform each of us about the route with the shortest time, but they do not contain incentives to manage travellers such that we all get collective benefits in travel times. To that end we need travel demand estimates and target strategies to reduce the traffic volume from the congested roads during peak hours in a feasible way. During large events, the traffic inconveniences in large cities are unusually high, yet temporary, and the entire population may be more willing to adopt collective recommendations for collective benefits in traffic. In this paper, we integrate, for the first time, big data resources to estimate the impact of events on traffic and propose target strategies for collective good at the urban scale. In the context of the Olympic Games in Rio de Janeiro, we first predict the expected increase in traffic. To that end, we integrate data from mobile phones, Airbnb, Waze and transit information, with game schedules and expected attendance in each venue. Next, we evaluate different route choice scenarios for drivers during the peak hours. Finally, we gather information on the trips that contribute the most to the global congestion which could be redirected from vehicles to transit. Interestingly, we show that (i) following new route alternatives during the event with individual shortest times can save more collective travel time than keeping the routine routes used before the event, uncovering the positive value of information technologies during events; (ii) with only a small proportion of people selected from specific areas switching from driving to public transport, the collective travel time can be reduced to a great extent. Results are presented online for evaluation by the public and policymakers (www.flows-rio2016.com (last accessed 3 September 2017)). © 2017 The Author(s).

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

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.

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.

New approach of financial volatility duration dynamics by stochastic finite-range interacting voter system.

PubMed

Wang, Guochao; Wang, Jun

2017-01-01

We make an approach on investigating the fluctuation behaviors of financial volatility duration dynamics. A new concept of volatility two-component range intensity (VTRI) is developed, which constitutes the maximal variation range of volatility intensity and shortest passage time of duration, and can quantify the investment risk in financial markets. In an attempt to study and describe the nonlinear complex properties of VTRI, a random agent-based financial price model is developed by the finite-range interacting biased voter system. The autocorrelation behaviors and the power-law scaling behaviors of return time series and VTRI series are investigated. Then, the complexity of VTRI series of the real markets and the proposed model is analyzed by Fuzzy entropy (FuzzyEn) and Lempel-Ziv complexity. In this process, we apply the cross-Fuzzy entropy (C-FuzzyEn) to study the asynchrony of pairs of VTRI series. The empirical results reveal that the proposed model has the similar complex behaviors with the actual markets and indicate that the proposed stock VTRI series analysis and the financial model are meaningful and feasible to some extent.

New approach of financial volatility duration dynamics by stochastic finite-range interacting voter system

NASA Astrophysics Data System (ADS)

Wang, Guochao; Wang, Jun

2017-01-01

We make an approach on investigating the fluctuation behaviors of financial volatility duration dynamics. A new concept of volatility two-component range intensity (VTRI) is developed, which constitutes the maximal variation range of volatility intensity and shortest passage time of duration, and can quantify the investment risk in financial markets. In an attempt to study and describe the nonlinear complex properties of VTRI, a random agent-based financial price model is developed by the finite-range interacting biased voter system. The autocorrelation behaviors and the power-law scaling behaviors of return time series and VTRI series are investigated. Then, the complexity of VTRI series of the real markets and the proposed model is analyzed by Fuzzy entropy (FuzzyEn) and Lempel-Ziv complexity. In this process, we apply the cross-Fuzzy entropy (C-FuzzyEn) to study the asynchrony of pairs of VTRI series. The empirical results reveal that the proposed model has the similar complex behaviors with the actual markets and indicate that the proposed stock VTRI series analysis and the financial model are meaningful and feasible to some extent.

Algorithm for computing descriptive statistics for very large data sets and the exa-scale era

NASA Astrophysics Data System (ADS)

Beekman, Izaak

2017-11-01

An algorithm for Single-point, Parallel, Online, Converging Statistics (SPOCS) is presented. It is suited for in situ analysis that traditionally would be relegated to post-processing, and can be used to monitor the statistical convergence and estimate the error/residual in the quantity-useful for uncertainty quantification too. Today, data may be generated at an overwhelming rate by numerical simulations and proliferating sensing apparatuses in experiments and engineering applications. Monitoring descriptive statistics in real time lets costly computations and experiments be gracefully aborted if an error has occurred, and monitoring the level of statistical convergence allows them to be run for the shortest amount of time required to obtain good results. This algorithm extends work by Pébay (Sandia Report SAND2008-6212). Pébay's algorithms are recast into a converging delta formulation, with provably favorable properties. The mean, variance, covariances and arbitrary higher order statistical moments are computed in one pass. The algorithm is tested using Sillero, Jiménez, & Moser's (2013, 2014) publicly available UPM high Reynolds number turbulent boundary layer data set, demonstrating numerical robustness, efficiency and other favorable properties.

CCD high-speed videography system with new concepts and techniques

NASA Astrophysics Data System (ADS)

Zheng, Zengrong; Zhao, Wenyi; Wu, Zhiqiang

1997-05-01

A novel CCD high speed videography system with brand-new concepts and techniques is developed by Zhejiang University recently. The system can send a series of short flash pulses to the moving object. All of the parameters, such as flash numbers, flash durations, flash intervals, flash intensities and flash colors, can be controlled according to needs by the computer. A series of moving object images frozen by flash pulses, carried information of moving object, are recorded by a CCD video camera, and result images are sent to a computer to be frozen, recognized and processed with special hardware and software. Obtained parameters can be displayed, output as remote controlling signals or written into CD. The highest videography frequency is 30,000 images per second. The shortest image freezing time is several microseconds. The system has been applied to wide fields of energy, chemistry, medicine, biological engineering, aero- dynamics, explosion, multi-phase flow, mechanics, vibration, athletic training, weapon development and national defense engineering. It can also be used in production streamline to carry out the online, real-time monitoring and controlling.

Pressure ulcer healing promoted by adequate protein intake in rats

PubMed Central

Qin, Zhanfen; Wang, Yao; Zhao, Wei; Zhang, Yanan; Tian, Yiqing; Sun, Sujuan; Li, Xian

2018-01-01

The effect of protein intake on rat pressure ulcer healing was evaluated. One hundred rats were numbered according to body weight and then they were randomly divided into 4 groups (n=25) using the random number table. After rat models of stage II pressure ulcer were established, they were fed with feed containing different protein levels (10, 15, 20 and 25%). Healing time, pressure ulcer area, body weight, albumin (ALB) and hemoglobin (Hb) levels among groups were compared. Hematoxylin and eosin (H&E) staining was also performed to observe pressure ulcer tissue structure. In the healing process of pressure ulcer, rats with 20% protein intake had the shortest healing time and the smallest pressure ulcer area. Body weight, ALB and Hb levels were much closer to the normal level. H&E staining result also suggested that the pressure ulcer healing degree of rats with 20% protein intake was much better than the others. Adequate protein intake is therefore conducive to pressure ulcer healing, while excessive or insufficient protein intake has negative impact on healing. PMID:29731816

Pressure ulcer healing promoted by adequate protein intake in rats.

PubMed

Qin, Zhanfen; Wang, Yao; Zhao, Wei; Zhang, Yanan; Tian, Yiqing; Sun, Sujuan; Li, Xian

2018-05-01

The effect of protein intake on rat pressure ulcer healing was evaluated. One hundred rats were numbered according to body weight and then they were randomly divided into 4 groups (n=25) using the random number table. After rat models of stage II pressure ulcer were established, they were fed with feed containing different protein levels (10, 15, 20 and 25%). Healing time, pressure ulcer area, body weight, albumin (ALB) and hemoglobin (Hb) levels among groups were compared. Hematoxylin and eosin (H&E) staining was also performed to observe pressure ulcer tissue structure. In the healing process of pressure ulcer, rats with 20% protein intake had the shortest healing time and the smallest pressure ulcer area. Body weight, ALB and Hb levels were much closer to the normal level. H&E staining result also suggested that the pressure ulcer healing degree of rats with 20% protein intake was much better than the others. Adequate protein intake is therefore conducive to pressure ulcer healing, while excessive or insufficient protein intake has negative impact on healing.

Preparation, Characterization and Performances of Powdered Polycarboxylate Superplasticizer with Bulk Polymerization.

PubMed

Liu, Xiao; Wang, Ziming; Zheng, Yunsheng; Cui, Suping; Lan, Mingzhang; Li, Huiqun; Zhu, Jie; Liang, Xu

2014-08-29

A polycarboxylate superplasticizer (PCE) was synthesized in a non-solvent system with bulk polymerization and then was pulverized into powdered form to achieve a rapid transportation and convenient preparation. PCE synthesized by using isopentenyl polyethylene glycol (TPEG) or isobutenyl polyethylene glycol (IPEG) as a macromonomer exhibited the best fluidities and retaining properties at 80 °C and 75 °C, respectively. Besides, azobisisobutyronitrile (AIBN) was suitable as an initiator, and the fumaric acid was suitable as the third monomer. The test results of ¹H nuclear magnetic resonance (¹H NMR) confirmed the occurrences of polymerization, and the measurement results of molecular weight and distribution showed that PCE molecular weight characteristics were in accordance with their fluidity properties in cement paste. The application performances in cement showed that PCEs with the best paste fluidity retentions had the longest final setting time and the shortest setting time interval, and the PCEs with good fluidity properties can obviously delay the hydration process and lower the hydration heat. Accordingly, this is a novel, energy-saving and economical method to prepare powdered PCE in the field of concrete admixtures.

Preparation, Characterization and Performances of Powdered Polycarboxylate Superplasticizer with Bulk Polymerization

PubMed Central

Liu, Xiao; Wang, Ziming; Zheng, Yunsheng; Cui, Suping; Lan, Mingzhang; Li, Huiqun; Zhu, Jie; Liang, Xu

2014-01-01

A polycarboxylate superplasticizer (PCE) was synthesized in a non-solvent system with bulk polymerization and then was pulverized into powdered form to achieve a rapid transportation and convenient preparation. PCE synthesized by using isopentenyl polyethylene glycol (TPEG) or isobutenyl polyethylene glycol (IPEG) as a macromonomer exhibited the best fluidities and retaining properties at 80 °C and 75 °C, respectively. Besides, azobisisobutyronitrile (AIBN) was suitable as an initiator, and the fumaric acid was suitable as the third monomer. The test results of 1H nuclear magnetic resonance (1H NMR) confirmed the occurrences of polymerization, and the measurement results of molecular weight and distribution showed that PCE molecular weight characteristics were in accordance with their fluidity properties in cement paste. The application performances in cement showed that PCEs with the best paste fluidity retentions had the longest final setting time and the shortest setting time interval, and the PCEs with good fluidity properties can obviously delay the hydration process and lower the hydration heat. Accordingly, this is a novel, energy-saving and economical method to prepare powdered PCE in the field of concrete admixtures. PMID:28788184

Cognitive Load in Voice Therapy Carry-Over Exercises.

PubMed

Iwarsson, Jenny; Morris, David Jackson; Balling, Laura Winther

2017-01-01

The cognitive load generated by online speech production may vary with the nature of the speech task. This article examines 3 speech tasks used in voice therapy carry-over exercises, in which a patient is required to adopt and automatize new voice behaviors, ultimately in daily spontaneous communication. Twelve subjects produced speech in 3 conditions: rote speech (weekdays), sentences in a set form, and semispontaneous speech. Subjects simultaneously performed a secondary visual discrimination task for which response times were measured. On completion of each speech task, subjects rated their experience on a questionnaire. Response times from the secondary, visual task were found to be shortest for the rote speech, longer for the semispontaneous speech, and longest for the sentences within the set framework. Principal components derived from the subjective ratings were found to be linked to response times on the secondary visual task. Acoustic measures reflecting fundamental frequency distribution and vocal fold compression varied across the speech tasks. The results indicate that consideration should be given to the selection of speech tasks during the process leading to automation of revised speech behavior and that self-reports may be a reliable index of cognitive load.

Unraveling spurious properties of interaction networks with tailored random networks.

PubMed

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks

PubMed Central

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures – known for their complex spatial and temporal dynamics – we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis. PMID:21850239

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.

Magnetic Resonance T1 Relaxation Time of Venous Thrombus Is Determined by Iron Processing and Predicts Susceptibility to Lysis

PubMed Central

Modarai, Bijan; Blume, Ulrike; Humphries, Julia; Patel, Ashish S.; Phinikaridou, Alkystis; Evans, Colin E.; Mattock, Katherine; Grover, Steven P.; Ahmad, Anwar; Lyons, Oliver T.; Attia, Rizwan Q.; Renné, Thomas; Premaratne, Sobath; Wiethoff, Andrea J.; Botnar, René M.; Schaeffter, Tobias; Waltham, Matthew; Smith, Alberto

2014-01-01

Background The magnetic resonance longitudinal relaxation time (T1) changes with thrombus age in humans. In this study, we investigate the possible mechanisms that give rise to the T1 signal in venous thrombi and whether changes in T1 relaxation time are informative of the susceptibility to lysis. Methods and Results Venous thrombosis was induced in the vena cava of BALB/C mice, and temporal changes in T1 relaxation time correlated with thrombus composition. The mean T1 relaxation time of thrombus was shortest at 7days following thrombus induction and returned to that of blood as the thrombus resolved. T1 relaxation time was related to thrombus methemoglobin formation and further processing. Studies in inducible nitric oxide synthase (iNOS−/−)–deficient mice revealed that inducible nitric oxide synthase mediates oxidation of erythrocyte lysis–derived iron to paramagnetic Fe3+, which causes thrombus T1 relaxation time shortening. Studies using chemokine receptor-2–deficient mice (Ccr2−/−) revealed that the return of the T1 signal to that of blood is regulated by removal of Fe3+ by macrophages that accumulate in the thrombus during its resolution. Quantification of T1 relaxation time was a good predictor of successful thrombolysis with a cutoff point of <747 ms having a sensitivity and specificity to predict successful lysis of 83% and 94%, respectively. Conclusions The source of the T1 signal in the thrombus results from the oxidation of iron (released from the lysis of trapped erythrocytes in the thrombus) to its paramagnetic Fe3+ form. Quantification of T1 relaxation time appears to be a good predictor of the success of thrombolysis. PMID:23820077

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

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.

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.

A Time-constrained Network Voronoi Construction and Accessibility Analysis in Location-based Service Technology

NASA Astrophysics Data System (ADS)

Yu, W.; Ai, T.

2014-11-01

Accessibility analysis usually requires special models of spatial location analysis based on some geometric constructions, such as Voronoi diagram (abbreviated to VD). There are many achievements in classic Voronoi model research, however suffering from the following limitations for location-based services (LBS) applications. (1) It is difficult to objectively reflect the actual service areas of facilities by using traditional planar VDs, because human activities in LBS are usually constrained only to the network portion of the planar space. (2) Although some researchers have adopted network distance to construct VDs, their approaches are used in a static environment, where unrealistic measures of shortest path distance based on assumptions about constant travel speeds through the network were often used. (3) Due to the computational complexity of the shortest-path distance calculating, previous researches tend to be very time consuming, especially for large datasets and if multiple runs are required. To solve the above problems, a novel algorithm is developed in this paper. We apply network-based quadrat system and 1-D sequential expansion to find the corresponding subnetwork for each focus. The idea is inspired by the natural phenomenon that water flow extends along certain linear channels until meets others or arrives at the end of route. In order to accommodate the changes in traffic conditions, the length of network-quadrat is set upon the traffic condition of the corresponding street. The method has the advantage over Dijkstra's algorithm in that the time cost is avoided, and replaced with a linear time operation.

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

Effect of form of obstacle on speed of crowd evacuation

NASA Astrophysics Data System (ADS)

Yano, Ryosuke

2018-03-01

This paper investigates the effect of the form of an obstacle on the time that a crowd takes to evacuate a room, using a toy model. Pedestrians are modeled as active soft matter moving toward a point with intended velocities. An obstacle is placed in front of the exit, and it has one of four shapes: a cylindrical column, a triangular prism, a quadratic prism, or a diamond prism. Numerical results indicate that the evacuation-completion time depends on the shape of the obstacle. Obstacles with a circular cylinder (C.C.) shape yield the shortest evacuation-completion time in the proposed model.

Formal language constrained path problems

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

Barrett, C.; Jacob, R.; Marathe, M.

1997-07-08

In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvablemore » efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.« less

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

PubMed

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail

PubMed Central

Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR–go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)–an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS–choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the “region heuristic” that vervets may apply in multi-destination routes. PMID:29813105

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.

Assessment of disintegrant efficacy with fractal dimensions from real-time MRI.

PubMed

Quodbach, Julian; Moussavi, Amir; Tammer, Roland; Frahm, Jens; Kleinebudde, Peter

2014-11-20

An efficient disintegrant is capable of breaking up a tablet in the smallest possible particles in the shortest time. Until now, comparative data on the efficacy of different disintegrants is based on dissolution studies or the disintegration time. Extending these approaches, this study introduces a method, which defines the evolution of fractal dimensions of tablets as surrogate parameter for the available surface area. Fractal dimensions are a measure for the tortuosity of a line, in this case the upper surface of a disintegrating tablet. High-resolution real-time MRI was used to record videos of disintegrating tablets. The acquired video images were processed to depict the upper surface of the tablets and a box-counting algorithm was used to estimate the fractal dimensions. The influence of six different disintegrants, of different relative tablet density, and increasing disintegrant concentration was investigated to evaluate the performance of the novel method. Changing relative densities hardly affect the progression of fractal dimensions, whereas an increase in disintegrant concentration causes increasing fractal dimensions during disintegration, which are also reached quicker. Different disintegrants display only minor differences in the maximal fractal dimension, yet the kinetic in which the maximum is reached allows a differentiation and classification of disintegrants. Copyright © 2014 Elsevier B.V. All rights reserved.

Muscle activities used by young and old adults when stepping to regain balance during a forward fall.

PubMed

Thelen, D G; Muriuki, M; James, J; Schultz, A B; Ashton-Miller, J A; Alexander, N B

2000-04-01

The current study was undertaken to determine if age-related differences in muscle activities might relate to older adults being significantly less able than young adults to recover balance during a forward fall. Fourteen young and twelve older healthy males were released from forward leans of various magnitudes and asked to regain standing balance by taking a single forward step. Myoelectric signals were recorded from 12 lower extremity muscles and processed to compare the muscle activation patterns of young and older adults. Young adults successfully recovered from significantly larger leans than older adults using a single step (32.2 degrees vs. 23.5 degrees ). Muscular latency times, the time between release and activity onset, ranged from 73 to 114 ms with no significant age-related differences in the shortest muscular latency times. The overall response muscular activation patterns were similar for young and older adults. However older adults were slower to deactivate three stance leg muscles and also demonstrated delays in activating the step leg hip flexors and knee extensors prior to and during the swing phase. In the forward fall paradigm studied, age-differences in balance recovery performance do not seem due to slowness in response onset but may relate to differences in muscle activation timing during the stepping movement.

Multiple Fault Isolation in Redundant Systems

NASA Technical Reports Server (NTRS)

Pattipati, Krishna R.; Patterson-Hine, Ann; Iverson, David

1997-01-01

Fault diagnosis in large-scale systems that are products of modern technology present formidable challenges to manufacturers and users. This is due to large number of failure sources in such systems and the need to quickly isolate and rectify failures with minimal down time. In addition, for fault-tolerant systems and systems with infrequent opportunity for maintenance (e.g., Hubble telescope, space station), the assumption of at most a single fault in the system is unrealistic. In this project, we have developed novel block and sequential diagnostic strategies to isolate multiple faults in the shortest possible time without making the unrealistic single fault assumption.

Multiple Fault Isolation in Redundant Systems

NASA Technical Reports Server (NTRS)

Pattipati, Krishna R.

1997-01-01

Fault diagnosis in large-scale systems that are products of modem technology present formidable challenges to manufacturers and users. This is due to large number of failure sources in such systems and the need to quickly isolate and rectify failures with minimal down time. In addition, for fault-tolerant systems and systems with infrequent opportunity for maintenance (e.g., Hubble telescope, space station), the assumption of at most a single fault in the system is unrealistic. In this project, we have developed novel block and sequential diagnostic strategies to isolate multiple faults in the shortest possible time without making the unrealistic single fault assumption.

IMUX: Managing Tor Connections from Two to Infinity, and Beyond

DTIC Science & Technology

2014-11-03

generalizes between the “per-circuit” approaches such as PCTCP and the fixed number of sessions in “ vanilla Tor” (1) and Torchestra (2). • We analyze a variety...increasing performance. The two main components of the algo- rithm are global scheduling and autotuning. In vanilla Tor, libevent iterates through the...1 2 3 4 5 Download Time (s) 0.0 0.2 0.4 0.6 0.8 1.0 C um ul at iv e Fr ac tio n vanilla imux-rr imux-ewma imux-shortest (a) Time to first byte 0 2 4

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

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.

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.

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.

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.

Estimating the time evolution of NMR systems via a quantum-speed-limit-like expression

NASA Astrophysics Data System (ADS)

Villamizar, D. V.; Duzzioni, E. I.; Leal, A. C. S.; Auccaise, R.

2018-05-01

Finding the solutions of the equations that describe the dynamics of a given physical system is crucial in order to obtain important information about its evolution. However, by using estimation theory, it is possible to obtain, under certain limitations, some information on its dynamics. The quantum-speed-limit (QSL) theory was originally used to estimate the shortest time in which a Hamiltonian drives an initial state to a final one for a given fidelity. Using the QSL theory in a slightly different way, we are able to estimate the running time of a given quantum process. For that purpose, we impose the saturation of the Anandan-Aharonov bound in a rotating frame of reference where the state of the system travels slower than in the original frame (laboratory frame). Through this procedure it is possible to estimate the actual evolution time in the laboratory frame of reference with good accuracy when compared to previous methods. Our method is tested successfully to predict the time spent in the evolution of nuclear spins 1/2 and 3/2 in NMR systems. We find that the estimated time according to our method is better than previous approaches by up to four orders of magnitude. One disadvantage of our method is that we need to solve a number of transcendental equations, which increases with the system dimension and parameter discretization used to solve such equations numerically.

234Th: 238U disequilibrium as an indicator of sediment resuspension in Thermaikos Gulf, northwestern Aegean Sea

NASA Astrophysics Data System (ADS)

Muir, G. K. P.; Pates, J. M.; Karageorgis, A. P.; Kaberi, H.

2005-12-01

234Th: 238U disequilibria have been used extensively as tracers of particle dynamics in marine environments. 234Th ( t1/2=24.1 days) can be used as "proxy" for particle reactive pollutants, due to their similar rapid rate of scavenging onto particles and subsequent removal from the water column, to the sediments. Radioactive disequilibrium can be exploited to determine the rates and time-scales of processes occurring over days to months; in this instance the residence times of dissolved and particulate species with the benthic nepheloid layer (BNL). Three sampling cruises were undertaken in Thermaikos Gulf (NW Aegean Sea) during contrasting periods, to examine the impact of natural and anthropogenic activity on sediment resuspension. September and October 2001 represented background and trawling periods, respectively; January 2002 represented a mixed period, of trawling and storms. Dissolved 234Th is scavenged actively at the BNL, in the presence of suspended particulate material (SPM), with a mean residence time of 16 days. There is a weak inverse correlation between dissolved 234Th residence time and SPM concentration in the BNL, with the shortest residence times occurring during October 2001. No relationship was observed between particulate 234Th activities and SPM concentrations, indicating that particles are rapidly removed from the system, either by sinking or advection. The mean particulate 234Th residence time is 5 days.

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.

a Movable Charging Unit for Green Mobility

NASA Astrophysics Data System (ADS)

ElBanhawy, E. Y.; Nassar, K.

2013-05-01

Battery swapping of electric vehicles (EVs) matter appears to be the swiftest and most convenient to users. The existence of swapping stations increases the feasibility of distributed energy storage via the electric grid. However, it is a cost-prohibitive way of charging. Early adaptors' preferences of /perceptions about EV system in general, has its inflectional effects on potential users hence the market penetration level. Yet, the charging matter of electric batteries worries the users and puts more pressure on them with the more rigorous planning-ahead they have to make prior to any trip. This paper presents a distinctive way of charging. It aims at making the overall charging process at ease. From a closer look into the literature, most of EVs' populations depend on domestic charge. Domestic charging gives them more confidence and increases the usability factor of the EV system. Nevertheless, they still need to count on the publically available charging points to reach their destination(s). And when it comes to multifamily residences, it becomes a thorny problem as these apartments do not have a room for charging outlets. Having said the irritating charging time needed to fatten the batteries over the day and the minimal average mileage drove daily, hypothetically, home delivery charging (Movable Charging Unit-MCU) would be a stupendous solution. The paper discusses the integration of shortest path algorithm problem with the information about EV users within a metropolitan area, developing an optimal route for a charging unit. This MCU delivers charging till homes whether by swapping batteries or by fast charging facility. Information about users is to be provided by the service provider of the neighbourhood, which includes charging patterns (timing, power capacity). This problem lies under the shortest path algorithms problem. It provides optimal route of charging that in return shall add more reliability and usability values and alleviate the charging/ limited range / daily planning anxieties. The model is in a very preliminary stage of development, future work is needed to elaborate on the model and developing a complete feasibility study.

Distractor ratio and grouping processes in visual conjunction search.

PubMed

Poisson, M E; Wilkinson, F

1992-01-01

According to feature integration theory, conjunction search is conducted via a serial self-terminating search. However, effects attributed to search processes operating on the entire display may actually reflect search restricted to elements defined by a single feature. In experiment 1 this question is addressed in a reaction-time (RT) paradigm by varying distractor ratios within an array of fixed size. For trials in which the target was present in the array, RT functions were roughly symmetric, the shortest RTs being for extreme distractor ratios, and the longest RTs being for arrays in which there were an equal number of each distractor type. This result is superficially consistent with Zohary and Hochstein's interpretation that subjects search for only one distractor type and are able to switch search strategy from trial to trial. However, negative-trial data from experiment 1 case doubt on this interpretation. In experiment 2 the possible role of 'pop out' and of distractor grouping in visual conjunction search is investigated. Results of experiment 2 suggest that grouping may play a more important role than does distractor ratio, and point to the importance of the spatial layout of the target and of the distractor elements in visual conjunction search. Results of experiment 2 also provide clear evidence that groups of spatially adjacent homogeneous elements may be processed as a unit.

Use of Radio Frequency Identification to Establish Emergency Medical Service Offload Times.

PubMed

Steer, Sheila; Bhalla, Mary C; Zalewski, Jon; Frey, Jennifer; Nguyen, Victor; Mencl, Francis

2016-01-01

Emergency medical services (EMS) crews often wait for emergency department (ED) beds to become available to offload their patients. Presently there is no national benchmark for EMS turnaround or offload times, or method for objectively and reliably measuring this. This study introduces a novel method for monitoring offload times and identifying variance. We performed a descriptive, observational study in a large urban community teaching hospital. We affixed radio frequency identification (RFID) tags (Confidex Survivor™, Confidex, Inc., Glen Ellyn, IL) to 65 cots from 19 different EMS agencies and placed a reader (CaptureTech Weatherproof RFID Interpreter, Barcoding Inc., Baltimore, Maryland) in the ED ambulance entrance, allowing for passive recording of traffic. We recorded data for 16 weeks starting December 2009. Offload times were calculated for each visit and analyzed using STATA to show variations in individual and cumulative offload times based on the time of day and day of the week. Results are presented as median times, confidence intervals (CIs), and interquartile ranges (IQRs). We collected data on 2,512 visits. Five hundred and ninety-two were excluded because of incomplete data, leaving 1,920 (76%) complete visits. Average offload time was 13.2 minutes. Median time was 10.7 minutes (IQR 8.1 minutes to 15.4 minutes). A total of 43% of the patients (833/1,920, 95% CI 0.41-0.46) were offloaded in less than 10 minutes, while 27% (513/1,920, 95% CI 0.25-0.29) took greater than 15 minutes. Median times were longest on Mondays (11.5 minutes) and shortest on Wednesdays (10.3 minutes). Longest daily median offload time occurred between 1600 and 1700 (13.5 minutes), whereas the shortest median time was between 0800 and 0900 (9.3 minutes). Cumulative time spent waiting beyond 15 minutes totaled 72.5 hours over the study period. RFID monitoring is a simple and effective means of monitoring EMS traffic and wait times. At our institution, most squads are able to offload their patients within 15 minutes, with many in less than 10 minutes. Variations in wait times are seen and are a topic for future study.

Comparative evaluation of in-house manual, and commercial semi-automated and automated DNA extraction platforms in the sample preparation of human stool specimens for a Salmonella enterica 5'-nuclease assay.

PubMed

Schuurman, Tim; de Boer, Richard; Patty, Rachèl; Kooistra-Smid, Mirjam; van Zwet, Anton

2007-12-01

In the present study, three methods (NucliSens miniMAG [bioMérieux], MagNA Pure DNA Isolation Kit III Bacteria/Fungi [Roche], and a silica-guanidiniumthiocyanate {Si-GuSCN-F} procedure for extracting DNA from stool specimens were compared with regard to analytical performance (relative DNA recovery and down stream real-time PCR amplification of Salmonella enterica DNA), stability of the extracted DNA, hands-on time (HOT), total processing time (TPT), and costs. The Si-GuSCN-F procedure showed the highest analytical performance (relative recovery of 99%, S. enterica real-time PCR sensitivity of 91%) at the lowest associated costs per extraction (euro 4.28). However, this method did required the longest HOT (144 min) and subsequent TPT (176 min) when processing 24 extractions. Both miniMAG and MagNA Pure extraction showed similar performances at first (relative recoveries of 57% and 52%, S. enterica real-time PCR sensitivity of 85%). However, when difference in the observed Ct values after real-time PCR were taken into account, MagNA Pure resulted in a significant increase in Ct value compared to both miniMAG and Si-GuSCN-F (with on average +1.26 and +1.43 cycles). With regard to inhibition all methods showed relatively low inhibition rates (< 4%), with miniMAG providing the lowest rate (0.7%). Extracted DNA was stable for at least 1 year for all methods. HOT was lowest for MagNA Pure (60 min) and TPT was shortest for miniMAG (121 min). Costs, finally, were euro 4.28 for Si-GuSCN, euro 6.69 for MagNA Pure and euro 9.57 for miniMAG.

Reducing the startup time of aerobic granular sludge reactors through seeding floccular sludge with crushed aerobic granules.

PubMed

Pijuan, Maite; Werner, Ursula; Yuan, Zhiguo

2011-10-15

One of the main challenging issues for the aerobic granular sludge technology is the long startup time when dealing with real wastewaters. This study presents a novel strategy to reduce the time required for granulation while ensuring a high level of nutrient removal. This new approach consists of seeding the reactor with a mixture of crushed aerobic granules and floccular sludge. The effectiveness of the strategy was demonstrated using abattoir wastewater, containing nitrogen and phosphorus at approximately 250 mgN/L and 30 mgP/L, respectively. Seven different mixtures of crushed granules and floccular sludge at granular sludge fractions (w/w in dry mass) of 0%, 5%, 10%, 15%, 25%, 30% and 50% were used to start eight granulation processes. The granulation time (defined as the time when the 10th percentile bacterial aggregate size is larger than 200 μm) displayed a strong dependency on the fraction of granular sludge. The shortest granulation time of 18 days was obtained with 50% crushed granules, in comparison with 133 days with 5% crushed granules. Full granulation was not achieved in the two trials without seeding with crushed granules. In contrast to the 100% floccular sludge cases, where a substantial loss of biomass occurred during granulation, the biomass concentration in all other trails did not decrease during granulation. This allowed that good nitrogen removal was maintained in all the reactors during the granulation process. However, enhanced biological phosphorus removal was achieved in only one of the eight trials. This was likely due to the temporary accumulation of nitrite, a strong inhibitor of polyphosphate accumulating organisms. Copyright © 2011 Elsevier Ltd. All rights reserved.

A new method for text detection and recognition in indoor scene for assisting blind people

NASA Astrophysics Data System (ADS)

Jabnoun, Hanen; Benzarti, Faouzi; Amiri, Hamid

2017-03-01

Developing assisting system of handicapped persons become a challenging ask in research projects. Recently, a variety of tools are designed to help visually impaired or blind people object as a visual substitution system. The majority of these tools are based on the conversion of input information into auditory or tactile sensory information. Furthermore, object recognition and text retrieval are exploited in the visual substitution systems. Text detection and recognition provides the description of the surrounding environments, so that the blind person can readily recognize the scene. In this work, we aim to introduce a method for detecting and recognizing text in indoor scene. The process consists on the detection of the regions of interest that should contain the text using the connected component. Then, the text detection is provided by employing the images correlation. This component of an assistive blind person should be simple, so that the users are able to obtain the most informative feedback within the shortest time.

Frequent statistics of link-layer bit stream data based on AC-IM algorithm

NASA Astrophysics Data System (ADS)

Cao, Chenghong; Lei, Yingke; Xu, Yiming

2017-08-01

At present, there are many relevant researches on data processing using classical pattern matching and its improved algorithm, but few researches on statistical data of link-layer bit stream. This paper adopts a frequent statistical method of link-layer bit stream data based on AC-IM algorithm for classical multi-pattern matching algorithms such as AC algorithm has high computational complexity, low efficiency and it cannot be applied to binary bit stream data. The method's maximum jump distance of the mode tree is length of the shortest mode string plus 3 in case of no missing? In this paper, theoretical analysis is made on the principle of algorithm construction firstly, and then the experimental results show that the algorithm can adapt to the binary bit stream data environment and extract the frequent sequence more accurately, the effect is obvious. Meanwhile, comparing with the classical AC algorithm and other improved algorithms, AC-IM algorithm has a greater maximum jump distance and less time-consuming.

Optimization model of conventional missile maneuvering route based on improved Floyd algorithm

NASA Astrophysics Data System (ADS)

Wu, Runping; Liu, Weidong

2018-04-01

Missile combat plays a crucial role in the victory of war under high-tech conditions. According to the characteristics of maneuver tasks of conventional missile units in combat operations, the factors influencing road maneuvering are analyzed. Based on road distance, road conflicts, launching device speed, position requirements, launch device deployment, Concealment and so on. The shortest time optimization model was built to discuss the situation of road conflict and the strategy of conflict resolution. The results suggest that in the process of solving road conflict, the effect of node waiting is better than detour to another way. In this study, we analyzed the deficiency of the traditional Floyd algorithm which may limit the optimal way of solving road conflict, and put forward the improved Floyd algorithm, meanwhile, we designed the algorithm flow which would be better than traditional Floyd algorithm. Finally, throgh a numerical example, the model and the algorithm were proved to be reliable and effective.

Silver nanoparticle-alginate composite beads for point-of-use drinking water disinfection.

PubMed

Lin, Shihong; Huang, Rixiang; Cheng, Yingwen; Liu, Jie; Lau, Boris L T; Wiesner, Mark R

2013-08-01

Silver nanoparticles (AgNPs)-alginate composite beads were synthesized using three different approaches as filler materials of packed columns for simultaneous filtration-disinfection as an alternative portable water treatment process. The prepared composite beads were packed into a column through which Escherichia coli containing water was filtered to evaluate the disinfection efficacy. Excellent disinfection performance (no detectable viable colony) was achieved with a hydraulic retention time (HRT) as short as 1 min (the shortest tested) with the SGR (Simultaneous-Gelation-Reduction) and AR (Adsorption-Reduction) beads that were prepared using in situ reduction of Ag(+). Comparatively, the SGR beads released significantly less Ag(+)/AgNPs than the AR beads did within the same HRT. From the results of this study it was identified that SGR may be the best choice among all three different synthesis approaches in that the SGR beads can achieve satisfactory bactericidal performance with a relatively low material consumption rate. Copyright © 2012 Elsevier Ltd. All rights reserved.

Cloud computing task scheduling strategy based on differential evolution and ant colony optimization

NASA Astrophysics Data System (ADS)

Ge, Junwei; Cai, Yu; Fang, Yiqiu

2018-05-01

This paper proposes a task scheduling strategy DEACO based on the combination of Differential Evolution (DE) and Ant Colony Optimization (ACO), aiming at the single problem of optimization objective in cloud computing task scheduling, this paper combines the shortest task completion time, cost and load balancing. DEACO uses the solution of the DE to initialize the initial pheromone of ACO, reduces the time of collecting the pheromone in ACO in the early, and improves the pheromone updating rule through the load factor. The proposed algorithm is simulated on cloudsim, and compared with the min-min and ACO. The experimental results show that DEACO is more superior in terms of time, cost, and load.

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

Rao, Nageswara S.; Liu, Qiang

We consider tracking of a target with elliptical nonlinear constraints on its motion dynamics. The state estimates are generated by sensors and sent over long-haul links to a remote fusion center for fusion. We show that the constraints can be projected onto the known ellipse and hence incorporated into the estimation and fusion process. In particular, two methods based on (i) direct connection to the center, and (ii) shortest distance to the ellipse are discussed. A tracking example is used to illustrate the tracking performance using projection-based methods with various fusers in the lossy long-haul tracking environment.

Topological patterns in street networks of self-organized urban settlements

NASA Astrophysics Data System (ADS)

Buhl, J.; Gautrais, J.; Reeves, N.; Solé, R. V.; Valverde, S.; Kuntz, P.; Theraulaz, G.

2006-02-01

Many urban settlements result from a spatially distributed, decentralized building process. Here we analyze the topological patterns of organization of a large collection of such settlements using the approach of complex networks. The global efficiency (based on the inverse of shortest-path lengths), robustness to disconnections and cost (in terms of length) of these graphs is studied and their possible origins analyzed. A wide range of patterns is found, from tree-like settlements (highly vulnerable to random failures) to meshed urban patterns. The latter are shown to be more robust and efficient.

Inactivity/sleep in two wild free-roaming African elephant matriarchs - Does large body size make elephants the shortest mammalian sleepers?

PubMed

Gravett, Nadine; Bhagwandin, Adhil; Sutcliffe, Robert; Landen, Kelly; Chase, Michael J; Lyamin, Oleg I; Siegel, Jerome M; Manger, Paul R

2017-01-01

The current study provides details of sleep (or inactivity) in two wild, free-roaming African elephant matriarchs studied in their natural habitat with remote monitoring using an actiwatch subcutaneously implanted in the trunk, a standard elephant collar equipped with a GPS system and gyroscope, and a portable weather station. We found that these two elephants were polyphasic sleepers, had an average daily total sleep time of 2 h, mostly between 02:00 and 06:00, and displayed the shortest daily sleep time of any mammal recorded to date. Moreover, these two elephants exhibited both standing and recumbent sleep, but only exhibited recumbent sleep every third or fourth day, potentially limiting their ability to enter REM sleep on a daily basis. In addition, we observed on five occasions that the elephants went without sleep for up to 46 h and traversed around 30 km in 10 h, possibly due to disturbances such as potential predation or poaching events, or a bull elephant in musth. They exhibited no form of sleep rebound following a night without sleep. Environmental conditions, especially ambient air temperature and relative humidity, analysed as wet-bulb globe temperature, reliably predict sleep onset and offset times. The elephants selected novel sleep sites each night and the amount of activity between sleep periods did not affect the amount of sleep. A number of similarities and differences to studies of elephant sleep in captivity are noted, and specific factors shaping sleep architecture in elephants, on various temporal scales, are discussed.

Inactivity/sleep in two wild free-roaming African elephant matriarchs – Does large body size make elephants the shortest mammalian sleepers?

PubMed Central

Gravett, Nadine; Bhagwandin, Adhil; Sutcliffe, Robert; Landen, Kelly; Chase, Michael J.; Lyamin, Oleg I.; Siegel, Jerome M.; Manger, Paul R.

2017-01-01

The current study provides details of sleep (or inactivity) in two wild, free-roaming African elephant matriarchs studied in their natural habitat with remote monitoring using an actiwatch subcutaneously implanted in the trunk, a standard elephant collar equipped with a GPS system and gyroscope, and a portable weather station. We found that these two elephants were polyphasic sleepers, had an average daily total sleep time of 2 h, mostly between 02:00 and 06:00, and displayed the shortest daily sleep time of any mammal recorded to date. Moreover, these two elephants exhibited both standing and recumbent sleep, but only exhibited recumbent sleep every third or fourth day, potentially limiting their ability to enter REM sleep on a daily basis. In addition, we observed on five occasions that the elephants went without sleep for up to 46 h and traversed around 30 km in 10 h, possibly due to disturbances such as potential predation or poaching events, or a bull elephant in musth. They exhibited no form of sleep rebound following a night without sleep. Environmental conditions, especially ambient air temperature and relative humidity, analysed as wet-bulb globe temperature, reliably predict sleep onset and offset times. The elephants selected novel sleep sites each night and the amount of activity between sleep periods did not affect the amount of sleep. A number of similarities and differences to studies of elephant sleep in captivity are noted, and specific factors shaping sleep architecture in elephants, on various temporal scales, are discussed. PMID:28249035

Distribution of shortest path lengths in a class of node duplication network models

NASA Astrophysics Data System (ADS)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

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.

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

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

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.

Time-dependent Models of Magnetospheric Accretion onto Young Stars

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

Robinson, C. E.; Espaillat, C. C.; Owen, J. E.

Accretion onto Classical T Tauri stars is thought to take place through the action of magnetospheric processes, with gas in the inner disk being channeled onto the star’s surface by the stellar magnetic field lines. Young stars are known to accrete material in a time-variable manner, and the source of this variability remains an open problem, particularly on the shortest (∼day) timescales. Using one-dimensional time-dependent numerical simulations that follow the field line geometry, we find that for plausibly realistic young stars, steady-state transonic accretion occurs naturally in the absence of any other source of variability. However, we show that ifmore » the density in the inner disk varies smoothly in time with ∼day-long timescales (e.g., due to turbulence), this complication can lead to the development of shocks in the accretion column. These shocks propagate along the accretion column and ultimately hit the star, leading to rapid, large amplitude changes in the accretion rate. We argue that when these shocks hit the star, the observed time dependence will be a rapid increase in accretion luminosity, followed by a slower decline, and could be an explanation for some of the short-period variability observed in accreting young stars. Our one-dimensional approach bridges previous analytic work to more complicated multi-dimensional simulations and observations.« less

Mental workload and cognitive task automaticity: an evaluation of subjective and time estimation metrics.

PubMed

Liu, Y; Wickens, C D

1994-11-01

The evaluation of mental workload is becoming increasingly important in system design and analysis. The present study examined the structure and assessment of mental workload in performing decision and monitoring tasks by focusing on two mental workload measurements: subjective assessment and time estimation. The task required the assignment of a series of incoming customers to the shortest of three parallel service lines displayed on a computer monitor. The subject was either in charge of the customer assignment (manual mode) or was monitoring an automated system performing the same task (automatic mode). In both cases, the subjects were required to detect the non-optimal assignments that they or the computer had made. Time pressure was manipulated by the experimenter to create fast and slow conditions. The results revealed a multi-dimensional structure of mental workload and a multi-step process of subjective workload assessment. The results also indicated that subjective workload was more influenced by the subject's participatory mode than by the factor of task speed. The time estimation intervals produced while performing the decision and monitoring tasks had significantly greater length and larger variability than those produced while either performing no other tasks or performing a well practised customer assignment task. This result seemed to indicate that time estimation was sensitive to the presence of perceptual/cognitive demands, but not to response related activities to which behavioural automaticity has developed.

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

Prosodic Boundaries in Writing: Evidence from a Keystroke Analysis

PubMed Central

Fuchs, Susanne; Krivokapić, Jelena

2016-01-01

The aim of the paper is to investigate duration between successive keystrokes during typing in order to examine whether prosodic boundaries are expressed in the process of writing. In particular, we are interested in interkey durations that occur next to punctuation marks (comma and full stops while taking keystrokes between words as a reference), since these punctuation marks are often realized with minor or major prosodic boundaries during overt reading. A two-part experiment was conducted: first, participants’ keystrokes on a computer keyboard were recorded while writing an email to a close friend (in two conditions: with and without time pressure). Second, participants read the email they just wrote. Interkey durations were compared to pause durations at the same locations during read speech. Results provide evidence of significant differences between interkey durations between words, at commas and at full stops (from shortest to longest). These durations were positively correlated with silent pause durations during overt reading. A more detailed analysis of interkey durations revealed patterns that can be interpreted with respect to prosodic boundaries in speech production, namely as phrase-final and phrase-initial lengthening occurring at punctuation marks. This work provides initial evidence that prosodic boundaries are reflected in the writing process. PMID:27917129

Prosodic Boundaries in Writing: Evidence from a Keystroke Analysis.

PubMed

Fuchs, Susanne; Krivokapić, Jelena

2016-01-01

The aim of the paper is to investigate duration between successive keystrokes during typing in order to examine whether prosodic boundaries are expressed in the process of writing. In particular, we are interested in interkey durations that occur next to punctuation marks (comma and full stops while taking keystrokes between words as a reference), since these punctuation marks are often realized with minor or major prosodic boundaries during overt reading. A two-part experiment was conducted: first, participants' keystrokes on a computer keyboard were recorded while writing an email to a close friend (in two conditions: with and without time pressure). Second, participants read the email they just wrote. Interkey durations were compared to pause durations at the same locations during read speech. Results provide evidence of significant differences between interkey durations between words, at commas and at full stops (from shortest to longest). These durations were positively correlated with silent pause durations during overt reading. A more detailed analysis of interkey durations revealed patterns that can be interpreted with respect to prosodic boundaries in speech production, namely as phrase-final and phrase-initial lengthening occurring at punctuation marks. This work provides initial evidence that prosodic boundaries are reflected in the writing process.

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

Theory of the formation of the electric double layer at the ion exchange membrane-solution interface.

PubMed

Moya, A A

2015-02-21

This work aims to extend the study of the formation of the electric double layer at the interface defined by a solution and an ion-exchange membrane on the basis of the Nernst-Planck and Poisson equations, including different values of the counter-ion diffusion coefficient and the dielectric constant in the solution and membrane phases. The network simulation method is used to obtain the time evolution of the electric potential, the displacement electric vector, the electric charge density and the ionic concentrations at the interface between a binary electrolyte solution and a cation-exchange membrane with total co-ion exclusion. The numerical results for the temporal evolution of the interfacial electric potential and the surface electric charge are compared with analytical solutions derived in the limit of the shortest times by considering the Poisson equation for a simple cationic diffusion process. The steady-state results are justified from the Gouy-Chapman theory for the diffuse double layer in the limits of similar and high bathing ionic concentrations with respect to the fixed-charge concentration inside the membrane. Interesting new physical insights arise from the interpretation of the process of the formation of the electric double layer at the ion exchange membrane-solution interface on the basis of a membrane model with total co-ion exclusion.

Characterisation of strain-induced precipitation behaviour in microalloyed steels during thermomechanical controlled processing

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

Gong, Peng, E-mail: p.gong@sheffield.ac.uk; Palmie

The temperature at which thermomechanical controlled processing is undertaken strongly influences strain-induced precipitation (SIP) in microalloyed steels. In this study, the recrystallisation-precipitation-time-temperature curve was simulated to determine the full recrystallisation temperature, recrystallisation-stop temperature and the temperature where precipitation would occur at the shortest time. The calculated temperatures were verified by experimental testing for rolling between 1100 °C and 850 °C. On the basis of this a finishing deformation of 850 °C was chosen in order to maximise the precipitate number density formed in a fully unrecrystallised austenite. The orientation relationship between the SIP in austenite, and subsequent transformation to ferritemore » was identified by calculation from the coordinate transformation matrix, and by electron diffraction in the transmission electron microscope. The NbC formed as coherent/semi-coherent precipitates in the austenite, and remained coherent/semi-coherent in the ferrite, indicating a Kurdjumov-Sachs orientation relationship between the austenite and ferrite on transformation. - Highlights: •The austenite deformation temperature will influence strain-induced precipitation. •Precipitates are NbC, exhibiting an NaCl structure and lattice parameter 0.447 nm. •Fine NbC (< 10 nm) formed in austenite as coherent or semi-coherent precipitates. •Confirmed cube-on-cube orientation relationship between the NbC, the austenite and the ferrite.« less

Comparative study of CW, nanosecond- and femtosecond-pulsed laser microcutting of AZ31 magnesium alloy stents.

PubMed

Gökhan Demir, Ali; Previtali, Barbara

2014-06-01

Magnesium alloys constitute an interesting solution for cardiovascular stents due to their biocompatibility and biodegradability in human body. Laser microcutting is the industrially accepted method for stent manufacturing. However, the laser-material interaction should be well investigated to control the quality characteristics of the microcutting process that concern the surface roughness, chemical composition, and microstructure of the final device. Despite the recent developments in industrial laser systems, a universal laser source that can be manipulated flexibly in terms of process parameters is far from reality. Therefore, comparative studies are required to demonstrate processing capabilities. In particular, the laser pulse duration is a key factor determining the processing regime. This work approaches the laser microcutting of AZ31 Mg alloy from the perspective of a comparative study to evaluate the machining capabilities in continuous wave (CW), ns- and fs-pulsed regimes. Three industrial grade machining systems were compared to reach a benchmark in machining quality, productivity, and ease of postprocessing. The results confirmed that moving toward the ultrashort pulse domain the machining quality increases, but the need for postprocessing remains. The real advantage of ultrashort pulsed machining was the ease in postprocessing and maintaining geometrical integrity of the stent mesh after chemical etching. Resultantly, the overall production cycle time was shortest for fs-pulsed laser system, despite the fact that CW laser system provided highest cutting speed.

Progress in Attosecond Metrology

NASA Astrophysics Data System (ADS)

Kienberger, R.; Krausz, F.

Fundamental processes in atoms, molecules, as well as condensed matter are triggered or mediated by the motion of electrons inside or between atoms. Electronic dynamics on atomic length scales tends to unfold within tens to thousands of attoseconds (1 as = 10-18 s). Recent breakthroughs in laser science are now opening the door to watching and controlling these hitherto inaccessible microscopic dynamics. The key to accessing the attosecond time domain is the control of the electric field of (visible) light, which varies its strength and direction within less than a femtosecond (1 fs = 1000 as). Atoms exposed to a few oscillation cycles of intense laser light are able to emit a single XUV burst lasting less than 1 fs. Full control of the evolution of the electromagnetic field in laser pulses comprising a few wave cycles have recently allowed the reproducible generation and measurement of isolated 250-as XUV pulses, constituting the shortest reproducible events and fastest measurement to date. These tools have enabled us to visualize the oscillating electric field of visible light with an attosecond "oscilloscope" and observing the motion of electrons in and around atoms in real time. Recent experiments hold promise for the development of an attosecond hard X-ray source, which may pave the way toward 4D electron imaging with subatomic resolution in space and time.

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.

Multiwalled carbon nanotubes for drug delivery: Efficiency related to length and incubation time.

PubMed

Sciortino, Niccolò; Fedeli, Stefano; Paoli, Paolo; Brandi, Alberto; Chiarugi, Paola; Severi, Mirko; Cicchi, Stefano

2017-04-15

Batches of oxidized multiwalled carbon nanotubes differing in length were adopted to prepare two drug delivery systems (DDS) loaded with doxorubicin. The different internalization of the two batches, verified by atomic emission spectroscopy onto cell lysates, was also confirmed by the different toxicity of the same DDS loaded with doxorubicin. In vitro experiments evidenced, after 48h of incubation, the superior efficacy of the shortest nanotubes. However, upon prolonging the incubation time up to 72h the difference in efficiency was minimized due to the spontaneous release of doxorubicin by the non-internalized long nanotubes. Copyright © 2017 Elsevier B.V. All rights reserved.

Cascades and dissipation ratio in rotating magnetohydrodynamic turbulence at low magnetic Prandtl number.

PubMed

Plunian, Franck; Stepanov, Rodion

2010-10-01

A phenomenology of isotropic magnetohydrodynamic (MHD) turbulence subject to both rotation and applied magnetic field is presented. It is assumed that the triple correlation decay time is the shortest between the eddy turn-over time and the ones associated to the rotating frequency and the Alfvén wave period. For Pm=1 it leads to four kinds of piecewise spectra, depending on four parameters: injection rate of energy, magnetic diffusivity, rotation rate, and applied field. With a shell model of MHD turbulence (including rotation and applied magnetic field), spectra for Pm ≤ 1 are presented, together with the ratio between magnetic and viscous dissipations.

An Abnormal Increase of Fatigue Life with Dwell Time during Creep-Fatigue Deformation for Directionally Solidified Ni-Based Superalloy DZ445

NASA Astrophysics Data System (ADS)

Ding, Biao; Ren, Weili; Deng, Kang; Li, Haitao; Liang, Yongchun

2018-03-01

The paper investigated the creep-fatigue behavior for directionally solidified nickel-based superalloy DZ445 at 900 °C. It is found that the fatigue life shows an abnormal increase when the dwell time exceeds a critical value during creep-fatigue deformation. The area of hysteresis loop and fractograph explain the phenomenon quite well. The shortest life corresponds to the maximal area of hysteresis loop, i. e. the maximum energy to be consumed during the creep-fatigue cycle. The fractographic observation of failed samples further supports the abnormal behavior of fatigue life.

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.

Effects of salinity on gastric emptying time in hybrid grouper, Epinephelus fuscoguttatus x E. lanceolattus juveniles

NASA Astrophysics Data System (ADS)

Noor, Noorashikin Md.; Das, Simon Kumar; Cob, Zaidi Che; Ghaffar, Mazlan Abd.

2018-04-01

The newly developed hybrid grouper: tiger grouper (Epinephelus fuscoguttatus) × giant grouper (Epinephelus fuscoguttatus) (TG×GG), has a high resistance towards different environmental condition (eg. in euryhaline environment) due to its genetic improvement. This study aims to investigate the effects of different salinities (10, 15, 20, 25 and 30 ppt) on the gastric emptying time (GET) of the TG×GG hybrid grouper juveniles. The fish were fed with commercial pellet over a 30 days experimental period under controlled laboratory conditions. The GET was determined by X-radiographic method, using barium sulfate (BaSO4) as an inert food marker. The X-radiography images showed that the shortest GET (12 h) was observed in the 15 ppt group, whereas the longest GET (18 h) in 30 ppt group. The results suggests to culture TG×GG hybrid grouper juveniles in 15 ppt with commercial pellet diet as this salinity proliferates faster digestion process which may contribute faster growth rate of this important fish species. Overall, these findings would be useful for the betterment of TG×GG hybrid grouper aquaculture which will eventually boost up the production of this newly developed hybrid grouper species.

Comparison of rocuronium at two different doses and succinylcholine for endotracheal intubation in adult patients for elective surgeries.

PubMed

Chavan, S G; Gangadharan, S; Gopakumar, A K

2016-01-01

The effects of rocuronium at two different doses, that is, 0.6 mg/kg (2 × ED95) and 0.9 mg/kg (3 × ED95), were compared with succinylcholine (2 mg/kg) when used for endotracheal intubation in adult patients for elective surgeries under general anesthesia. Ninety patients were divided into three groups of 30 each. Groups A, B received injection rocuronium at 0.6 mg/kg, 0.9 mg/kg respectively and Group C received succinylcholine at 2 mg/kg. Onset of action of relaxant, intubation conditions, time taken to intubate and duration of action were compared. To compare the statistical difference in the age, weight, height of the study subjects, onset of action of relaxant, intubation conditions, time taken to intubate, and duration of action analysis of variance and unpaired t -test were used. The onset time was considerably shorter with rocuronium 0.9 mg/kg than 0.6 mg/kg. The onset time of rocuronium 0.9 mg/kg was found to be significantly longer than succinylcholine 2 mg/kg. Time taken to intubate was shortest with succinylcholine 2 mg/kg. The time taken to intubate with the rocuronium 0.9 mg/kg was found to be comparable to that of rocuronium 0.6 mg/kg. Intubation score of rocuronium 0.9 mg/kg was the best (17.75), which was comparable with succinylcholine. However, the intubation score obtained with rocuronium 0.6 mg/kg was inferior. Duration of action was shortest with succinylcholine. The duration of action is prolonged when the dose of rocuronium is increased from 0.6 to 0.9 mg/kg. Rapid sequence induction of anesthesia with propofol and fentanyl, succinylcholine allowed a more rapid endotracheal intubation sequence and created superior intubation conditions than rocuronium. However, the technique of using a large dose of rocuronium to achieve perfect conditions for tracheal intubation may have application whenever succinylcholine is relatively contraindicated.

The impact of place of enrollment and delay to reperfusion on 90-day post-infarction mortality in the ASSENT-4 PCI trial: assessment of the safety and efficacy of a new treatment strategy with percutaneous coronary intervention.

PubMed

Ross, Allan M; Huber, Kurt; Zeymer, Uwe; Armstrong, Paul W; Granger, Christopher B; Goldstein, Patrick; Bogaerts, Kris; Van de Werf, Frans

2009-10-01

We have performed a retrospective analysis of the data stratified by time to treatment and by enrollment site: percutaneous coronary intervention hospitals (PCIH), nonpercutaneous coronary intervention hospitals (NoPCIH), or in a pre-hospital setting (PreH). The ASSENT-4 PCI (Assessment of the Safety and Efficacy of a New Treatment Strategy with Percutaneous Coronary Intervention) trial intended to test the hypothesis that in ST-segment elevation myocardial infarction (STEMI) patients an upfront fibrinolytic bolus before PCI ("facilitated PCI") compared with primary PCI would benefit STEMI patients facing a long pre-PCI delay. Seven hundred forty-nine patients (45%) presented directly to PCIH, 578 (34%) presented to NoPCIH, and 334 (20%) were randomized and initially treated in the PreH setting. Patients in the PreH-facilitated group had the shortest delays (pain-to-fibrinolytic treatment 125 min) and the lowest 90-day mortality (3.1%). Among patients randomized to primary PCI, the shortest time from pain to first balloon was similarly in the PreH group (223 min). They had the lowest mortality of the primary PCI patient groups (4.1%). The highest mortality (8.4%) was in patients presenting to a PCIH and assigned to the facilitated strategy. Their pain-to-lysis time was 174 min and pain-to-PCI time 266 min (or 92 min after lysis). Few patients fit the target population, long delays to PCI for whom facilitated PCI was designed. Patients treated early after pain onset in the PreH setting do well after a facilitated approach. Despite limitations of post hoc subgroup analysis, these observations suggest caution in extrapolating the results of the ASSENT-4 trial to the "real world" where many patients might have potentially short pain-to-fibrinolysis time but are facing a long transport time to primary PCI.

Complex Network Theory Applied to the Growth of Kuala Lumpur's Public Urban Rail Transit Network.

PubMed

Ding, Rui; Ujang, Norsidah; Hamid, Hussain Bin; Wu, Jianjun

2015-01-01

Recently, the number of studies involving complex network applications in transportation has increased steadily as scholars from various fields analyze traffic networks. Nonetheless, research on rail network growth is relatively rare. This research examines the evolution of the Public Urban Rail Transit Networks of Kuala Lumpur (PURTNoKL) based on complex network theory and covers both the topological structure of the rail system and future trends in network growth. In addition, network performance when facing different attack strategies is also assessed. Three topological network characteristics are considered: connections, clustering and centrality. In PURTNoKL, we found that the total number of nodes and edges exhibit a linear relationship and that the average degree stays within the interval [2.0488, 2.6774] with heavy-tailed distributions. The evolutionary process shows that the cumulative probability distribution (CPD) of degree and the average shortest path length show good fit with exponential distribution and normal distribution, respectively. Moreover, PURTNoKL exhibits clear cluster characteristics; most of the nodes have a 2-core value, and the CPDs of the centrality's closeness and betweenness follow a normal distribution function and an exponential distribution, respectively. Finally, we discuss four different types of network growth styles and the line extension process, which reveal that the rail network's growth is likely based on the nodes with the biggest lengths of the shortest path and that network protection should emphasize those nodes with the largest degrees and the highest betweenness values. This research may enhance the networkability of the rail system and better shape the future growth of public rail networks.

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.

Networks of genetic loci and the scientific literature

NASA Astrophysics Data System (ADS)

Semeiks, J. R.; Grate, L. R.; Mian, I. S.

This work considers biological information graphs, networks in which nodes corre-spond to genetic loci (or "genes") and an (undirected) edge signifies that two genes are discussed in the same article(s) in the scientific literature ("documents"). Operations that utilize the topology of these graphs can assist researchers in the scientific discovery process. For example, a shortest path between two nodes defines an ordered series of genes and documents that can be used to explore the relationship(s) between genes of interest. This work (i) describes how topologies in which edges are likely to reflect genuine relationship(s) can be constructed from human-curated corpora of genes an-notated with documents (or vice versa), and (ii) illustrates the potential of biological information graphs in synthesizing knowledge in order to formulate new hypotheses and generate novel predictions for subsequent experimental study. In particular, the well-known LocusLink corpus is used to construct a biological information graph consisting of 10,297 nodes and 21,910 edges. The large-scale statistical properties of this gene-document network suggest that it is a new example of a power-law network. The segregation of genes on the basis of species and encoded protein molecular function indicate the presence of assortativity, the preference for nodes with similar attributes to be neighbors in a network. The practical utility of a gene-document network is illustrated by using measures such as shortest paths and centrality to analyze a subset of nodes corresponding to genes implicated in aging. Each release of a curated biomedical corpus defines a particular static graph. The topology of a gene-document network changes over time as curators add and/or remove nodes and/or edges. Such a dynamic, evolving corpus provides both the foundation for analyzing the growth and behavior of large complex networks and a substrate for examining trends in biological research.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

NASA Technical Reports Server (NTRS)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Comparison of local anesthetics for digital nerve blocks: a systematic review.

PubMed

Vinycomb, Toby I; Sahhar, Lukas J

2014-04-01

To evaluate the time to onset of anesthesia, duration of anesthesia, and pain on injection of local anesthetics. A systematic search of the English literature was performed of the Medline, Cochrane Central Register of Controlled Trials, The Allied and Complementary Medicine Database (AMED), and the Cumulative Index to Nursing and Allied Health Literature (CINAHL) databases. The study selection process was adapted from the Preferred Reporting Items for Systematic Reviews and Meta-analyses statement, and 6 articles were complied with the study inclusion criteria. Six studies (335 nerve blocks) were included in our final analysis measuring 6 local anesthetic preparations (lidocaine, lidocaine with epinephrine, bupivacaine, bupivacaine with epinephrine, lidocaine with bupivacaine, and ropivacaine). Lidocaine demonstrated the shortest mean onset of anesthesia (3.1 min) and bupivacaine the longest (7.6 min). Lidocaine also demonstrated the shortest mean duration of anesthesia (1.8 h) and ropivacaine the longest mean duration (21.5 h). Lidocaine with epinephrine demonstrated the least mean pain on injection (26 mm on a visual analog scale) and bupivacaine with epinephrine the most mean pain (53 mm). Lidocaine with epinephrine provides a good short-term anesthesia and may reduce the risk of injury or complication while the finger in still anesthetized. Bupivacaine with lidocaine provides good long-term anesthesia and may reduce the need for postprocedural anesthesia. Ropivacaine likely provides the longest duration of anesthesia but the absence of epinephrine means a tourniquet must be used to create a bloodless field and thus is contraindicated in some procedures such as flexor tendon repairs where active testing may be required. Lidocaine with epinephrine, bupivacaine with epinephrine, and ropivacaine all provide benefits in digital nerve blocks. The surgeon may choose the most appropriate local anesthetic or combination of local anesthetics based on the procedure to be undertaken and the postoperative requirements. Therapeutic II. Copyright © 2014 American Society for Surgery of the Hand. Published by Elsevier Inc. All rights reserved.

A climatology of extratropical cyclones over East Asia during 1958-2001

NASA Astrophysics Data System (ADS)

Zhang, Yingxian; Ding, Yihui; Li, Qiaoping

2012-06-01

A climatology of extratropical cyclones (ECs) over East Asia (20°-75°N, 60°-160°E) is analyzed by applying an improved objective detection and tracking algorithm to the 4-time daily sea level pressure fields from the European Centre for Medium-range Weather Forecasts (ECMWF) reanalysis data. A total of 12914 EC processes for the period of 1958-2001 are identified, with an EC database integrated and EC activities reanalyzed using the objective algorithm. The results reveal that there are three major cyclogenesis regions: West Siberian Plain, Mongolia (to the south of Lake Baikal), and the coastal region of East China; whereas significant cyclolysis regions are observed in Siberia north of 60°N, Northeast China, and Okhotsk Sea-Northwest Pacific. It is found that the EC lifetime is largely 1-7 days while winter ECs have the shortest lifespan. The ECs are the weakest in summer among the four seasons. Strong ECs often appear in West Siberia, Northeast China, and Okhotsk Sea-Northwest Pacific. Statistical analysis based on k-means clustering has identified 6 dominating trajectories in the area south of 55°N and east of 80°E, among which 4 tracks have important impacts on weather/climate in China. ECs occurring in spring (summer) tend to travel the longest (shortest). They move the fastest in winter, and the slowest in summer. In winter, cyclones move fast in Northeast China, some areas of the Yangtze-Huaihe River region, and the south of Japan, with speed greater than 15 m s-1. Explosively-deepening cyclones are found to occur frequently along the east coast of China, Japan, and Northwest Pacific, but very few storms occur over the inland area. Bombs prefer to occur in winter, spring, and autumn. Their annual number and intensity in 1990 and 1992 in East Asia (EA) are smaller and weaker than their counterparts in North America.

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

Purely temporal figure-ground segregation.

PubMed

Kandil, F I; Fahle, M

2001-05-01

Visual figure-ground segregation is achieved by exploiting differences in features such as luminance, colour, motion or presentation time between a figure and its surround. Here we determine the shortest delay times required for figure-ground segregation based on purely temporal features. Previous studies usually employed stimulus onset asynchronies between figure- and ground-containing possible artefacts based on apparent motion cues or on luminance differences. Our stimuli systematically avoid these artefacts by constantly showing 20 x 20 'colons' that flip by 90 degrees around their midpoints at constant time intervals. Colons constituting the background flip in-phase whereas those constituting the target flip with a phase delay. We tested the impact of frequency modulation and phase reduction on target detection. Younger subjects performed well above chance even at temporal delays as short as 13 ms, whilst older subjects required up to three times longer delays in some conditions. Figure-ground segregation can rely on purely temporal delays down to around 10 ms even in the absence of luminance and motion artefacts, indicating a temporal precision of cortical information processing almost an order of magnitude lower than the one required for some models of feature binding in the visual cortex [e.g. Singer, W. (1999), Curr. Opin. Neurobiol., 9, 189-194]. Hence, in our experiment, observers are unable to use temporal stimulus features with the precision required for these models.

From Large Deviations to Semidistances of Transport and Mixing: Coherence Analysis for Finite Lagrangian Data

NASA Astrophysics Data System (ADS)

Koltai, Péter; Renger, D. R. Michiel

2018-06-01

One way to analyze complicated non-autonomous flows is through trying to understand their transport behavior. In a quantitative, set-oriented approach to transport and mixing, finite time coherent sets play an important role. These are time-parametrized families of sets with unlikely transport to and from their surroundings under small or vanishing random perturbations of the dynamics. Here we propose, as a measure of transport and mixing for purely advective (i.e., deterministic) flows, (semi)distances that arise under vanishing perturbations in the sense of large deviations. Analogously, for given finite Lagrangian trajectory data we derive a discrete-time-and-space semidistance that comes from the "best" approximation of the randomly perturbed process conditioned on this limited information of the deterministic flow. It can be computed as shortest path in a graph with time-dependent weights. Furthermore, we argue that coherent sets are regions of maximal farness in terms of transport and mixing, and hence they occur as extremal regions on a spanning structure of the state space under this semidistance—in fact, under any distance measure arising from the physical notion of transport. Based on this notion, we develop a tool to analyze the state space (or the finite trajectory data at hand) and identify coherent regions. We validate our approach on idealized prototypical examples and well-studied standard cases.

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.

Effective distances for epidemics spreading on complex networks.

PubMed

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

Effective distances for epidemics spreading on complex networks

NASA Astrophysics Data System (ADS)

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M.

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

Evaluation of three different decontamination techniques on biofilm formation, and on physical and chemical properties of resin composites.

PubMed

André, Carolina Bosso; Dos Santos, Andressa; Pfeifer, Carmem Silvia; Giannini, Marcelo; Girotto, Emerson Marcelo; Ferracane, Jack Liborio

2018-04-01

This study evaluated three different sterilization/disinfection techniques for resin composites on bacterial growth and surface modification after decontamination. Two resin composites were sterilized/disinfected with three different techniques: UV light, 1% chloramine T, and 70% ethanol. Four different times were used for each technique to determine the shortest time that the solution or UV light was effective. The influence of sterilization/disinfection technique on bacterial growth was evaluated by analyzing the metabolic activity, using the AlamarBlue™ assay, bacterial viability, and SEM images from biofilms of Streptococcus mutans. The surface change, after the process, was analyzed with ATR/FTIR and SEM images. The solutions used for decontamination (1% chloramine-T and 70% ethanol) were analyzed with 1 H-NMR to identify any resin compounds leached during the process. One minute of decontamination was efficient for all three methods tested. Chloramine-T increased the surface porosity on resin composites, no changes were observed for UV light and 70% ethanol, however, 1 H-NMR identified leached monomers only when 70% ethanol was used. No chemical change of the materials was found under ATR/FTIR analyses after the decontamination process. Chloramine-T, with no previous wash, increased the bacterial viability for both resin composites and increased the bacterial metabolism for the resin composite without fluoride. UV light had no interference on the resin composites properties tested using 1 min of exposure compared to the other decontamination methods. © 2017 Wiley Periodicals, Inc. J Biomed Mater Res Part B: Appl Biomater, 106B: 945-953, 2018. © 2017 Wiley Periodicals, Inc.

Capacity Building for collecting primary data through Crowdsourcing - An Example of Disaster affected Uttarakhand State (India)

NASA Astrophysics Data System (ADS)

Krishna Murthy, Y. V. N.; Raju, P. L. N.; Srivastav, S. K.; Kumar, P.; Mitra, D.; Karnatak, H.; Saran, S.; Pandey, K.; Oberai, K.; Shiva Reddy, K.; Gupta, K.; Swamy, M.; Deshmukh, A.; Dadhwal, V. K.; Bothale, V.; Diwakar, P. G.; Ravikumar, M. V.; Leisely, A.; Arulraj, M.; Kumar, S.; Rao, S. S.; Singh Rawat, R.; Pathak, D. M.; Dutt, V.; Negi, D.; Singh, J.; Shukla, K. K.; Tomar, A.; Ahmed, N.; Singh, B.; Singh, A. K.; Shiva Kumar, R.

2014-11-01

Uttarakhand State of India suffered a widespread devastation in June 2013 due to floods caused by excessive rain in the upper reaches of the Himalaya, glacial lake outburst flood (GLOF) and landslides. Restoration process in this mountainous State calls for scientifically sound planning so that the vulnerabilities and risks to such natural hazards are minimised and developmental processes are sustainable in long run. Towards this, an understanding of the patterns and major controls of damage of the recent disaster is a key requirement which can be achieved only if the primary data on locations and types of damage along with other local site conditions are available. Considering widespread damage, tough nature of terrain and the need for collecting the primary data on damage in shortest possible time, crowdsourcing approach was considered to be the most viable solution. Accordingly, a multiinstitutional initiative called "Map the Neighbourhood in Uttarakhand" (MANU) was conceptualised with the main objective of collecting primary data on damage through participation of local people (mainly students) using state-of-art tools and technologies of data collection and a mechanism to integrate the same with Bhuvan geo-portal (www.bhuvan.nrsc.gov.in) in near real-time. Geospatial analysis of crowd-sourced points with different themes has been carried out subsequently for providing inputs to restoration planning and for future developmental activities. The present paper highlights the capacity building aspect in enabling the data collection process using crowdsourcing technology.

Comparison of five video-assisted intubation devices by novice and expert laryngoscopists for use in the aeromedical evacuation environment.

PubMed

Wallace, Matthew C; Britton, SSgt Tyler; Meek, Robbie; Walsh-Hart, Sharon; Carter, Col Todd E; Lisco, Steven J

2017-01-01

The critically ill or injured patient undergoing military medical evacuation may require emergent intubation. Intubation may be life-saving, but it carries risks. The novice or infrequent laryngoscopist has a distinct disadvantage because experience is critical for the rapid and safe establishment of a secured airway. This challenge is compounded by the austere environment of the back of an aircraft under blackout conditions. This study determined which of five different video-assisted intubation devices (VAIDs) was best suited for in-flight use by U.S. Air Force Critical Care Air Transport Teams by comparing time to successful intubation between novice and expert laryngoscopists under three conditions, Normal Airway Lights on (NAL), Difficult Airway Lights on (DAL) and Difficult Airway Blackout (DAB), using manikins on a standard military transport stanchion and the floor with a minimal amount of setup time and extraneous light emission. A convenience sample size of 40 participants (24 novices and 16 experts) attempted intubation with each of the 5 different video laryngoscopic devices on high-fidelity airway manikins. Time to tracheal intubation and number of optimization maneuvers used were recorded. Kruskal-Wallis testing determined significant differences between the VAIDs in time to intubation for each particular scenario. Devices with significant differences underwent pair-wise comparison testing using rank-sum analysis to further clarify the difference. Device assembly times, startup times and the amount of light emitted were recorded. Perceived ease of use was surveyed. Novices were fastest with the Pentax AWS in all difficult airway scenarios. Experts recorded the shortest median times consistently using 3 of the 5 devices. The AWS was superior overall in 4 of the 6 scenarios tested. Experts and novices subjectively judged the GlideScope Ranger as easiest to use. The light emitted by all the devices was less than the USAF-issued headlamp. Novices intubated fastest with the Pentax AWS in all difficult airway scenarios. The GlideScope required the shortest setup time, and participants judged this device as the easiest to use. The GlideScope and AWS exhibited the two fastest total setup times. Both devices are suitable for in-flight use by infrequent and seasoned laryngoscopists.

Optimal mixing rate in linear solvent strength gradient liquid chromatography. Balanced mixing program.

PubMed

Blumberg, Leonid M; Desmet, Gert

2016-12-09

The mixing rate (R ϕ ) is the temporal rate of increase in the solvent strength in gradient LC. The optimal R ϕ (R ϕ ,Opt ) is the one at which a required peak capacity of gradient LC analysis is obtained in the shortest time. The balanced mixing program is a one where, for better separation of early eluting solutes, the mixing ramp is preceded by a balanced isocratic hold of the duration depending on R ϕ . The improvement in the separation of the earlier eluites due to the balanced programming has been evaluated. The value of R ϕ ,Opt depends on the solvent composition range covered by the mixing ramp and on the column pressure conditions. The R ϕ ,Opt for a column operating at maximum instrumental pressure is different from R ϕ ,Opt for a column operating below the instrumental pressure limit. On the other hand, it has been shown that the difference in the R ϕ ,Opt values under different conditions is not very large so that a single default R ϕ previously recommended for gradient analyses without the isocratic hold also yields a good approximation to the shortest analysis time for all conditions in the balanced analyses. With or without the initial balance isocratic hold, the recommended default R ϕ is about 5%/t 0 (5% increase in the solvent strength per each t 0 -long increment in time) for small-molecule samples, and about an order of magnitude slower (0.5%/t 0 ) for protein samples. A discussion illustrating the use of the optimization criteria employed here for the techniques other than LSS gradient LC is included. Copyright © 2016 Elsevier B.V. All rights reserved.

Poor Sleep Quality and Functional Decline in Older Women

PubMed Central

Spira, Adam P.; Covinsky, Kenneth; Rebok, George W.; Punjabi, Naresh M.; Stone, Katie L.; Hillier, Teresa A.; Ensrud, Kristine; Yaffe, Kristine

2012-01-01

OBJECTIVES To determine whether objectively measured sleep quality predicts five-year incident instrumental activities of daily living (IADL) impairment and decline in grip strength and gait speed in older women. DESIGN Prospective cohort SETTING Participants’ homes, Study of Osteoporotic Fractures sites PARTICIPANTS 817 women (mean 82.4 years at baseline) MEASUREMENTS Participants completed 4.1 ±0.7 nights of wrist actigraphy at baseline, and measures of IADL impairment, grip strength, and gait speed at baseline and five-year follow-up. RESULTS After five years of follow-up, approximately 41% of participants had incident impairment in ≥1 IADL. The quartile of women with the shortest total sleep time had a 93% greater odds of incident IADL impairment than the longest sleepers (adjusted odds ratio (AOR) = 1.93, 95% confidence interval (CI) 1.25, 2.97). Similarly, the quartile of women with the lowest sleep efficiency had a 65% greater odds of impairment than those with the highest (AOR = 1.65, 95% CI 1.06, 2.57). Women in the shortest total sleep time quartile had double the odds of declining grip strength, compared to those with the longest total sleep time (AOR = 1.97, 95% CI 1.17, 3.32). Finally, women in the quartiles with the most wake after sleep onset and the lowest sleep efficiency had an approximately 90% greater odds of grip strength decline than those with the least wake after sleep onset (AOR = 1.90, 95% CI 1.11, 3.24) and sleep efficiency (AOR = 1.92, 95% CI 1.12, 3.29). CONCLUSION Findings indicate that shorter sleep duration, greater wake after sleep onset, and lower sleep efficiency are risk factors for functional or physical decline in older women. PMID:22690985

Analysis of the Factors Affecting Surgical Success of Implants Placed in Iranian Warfare Victims

PubMed Central

Jafarian, Mohammad; Bayat, Mohammad; Pakravan, Amir-Hossein; Emadi, Naghmeh

2016-01-01

Objective The aim was to evaluate the survival time and success rates of dental implants in warfare victims and factors that affect implant success. Subjects and Methods This retrospective study involved 250 Iranian warfare victims who received dental implants from 2003 to 2013. Patients' demographic characteristics, as well as the brand, diameter, length, location and failure rate of the implants were retrieved from patients' dental records and radiographs. The associations between these data and the survival rate were analyzed. Statistical analysis was carried out with χ2 and log-rank tests. Results Overall, out of the 1,533 dental implants, 61 (4s%) failed. The maxillary canine area had the highest failure rate [9 of 132 implants (6.8s%)], while the mandibular incisor region had the least number of failures [3 of 147 implants (2.0s%)] and the longest survival time (approximately 3,182 days). Maxillary canine areas had the shortest survival (about 2,996 days). The longest survival time was observed in implants with 11 mm length (3,179.72 ± 30.139 days) and 3.75-4 mm diameter (3,131.161 ± 35.96 days), and the shortest survival was found in implants with 11.5 mm length (2,317.79 ± 18.71 days) and 6.5 mm diameter (2,241.45 ± 182.21 days). Moreover, implants with 10 mm length (10.7s%) and 5.5-6 mm diameter (22.2s%) had the highest failure rate; however, the least failure rate occurred when the implants were 11.5 mm in length (1.9s%) and 3-3.5 mm in diameter (3.1s%). Conclusions The brand, length and diameter of implants affected the survival time, failure rate and time to failure. The location of the implant was not statistically significant regarding the mentioned factors, although it has clinical significance. PMID:27322534

Metronome rate and walking foot contact time in young adults.

PubMed

Dickstein, Ruth; Plax, Michael

2012-02-01

It is assumed that when people walk guided by an audible constant rate, they match foot contact to the external pace. The purpose of this preliminary study was to test that assumption by examining the temporal relationship between audible signals generated by a metronome and foot contact time during gait. Ten healthy young women were tested in walking repetitions guided by metronome rates of 60, 110, and 150 beats/min. Metronome beats and foot contact times were collected in real time. The findings indicated that foot contact was not fully synchronized with the auditory signals; the shortest time interval between the metronome beat and foot contact time was at the prescribed rate of 60 beats/min., while the longest interval was at the rate of 150 beats/min. The correlation between left and right foot contact times was highest with the slowest rate and lowest with the fastest rate.

Design of teleoperation system with a force-reflecting real-time simulator

NASA Technical Reports Server (NTRS)

Hirata, Mitsunori; Sato, Yuichi; Nagashima, Fumio; Maruyama, Tsugito

1994-01-01

We developed a force-reflecting teleoperation system that uses a real-time graphic simulator. This system eliminates the effects of communication time delays in remote robot manipulation. The simulator provides the operator with predictive display and feedback of computed contact forces through a six-degree of freedom (6-DOF) master arm on a real-time basis. With this system, peg-in-hole tasks involving round-trip communication time delays of up to a few seconds were performed at three support levels: a real image alone, a predictive display with a real image, and a real-time graphic simulator with computed-contact-force reflection and a predictive display. The experimental results indicate the best teleoperation efficiency was achieved by using the force-reflecting simulator with two images. The shortest work time, lowest sensor maximum, and a 100 percent success rate were obtained. These results demonstrate the effectiveness of simulated-force-reflecting teleoperation efficiency.

Lexical access and evoked traveling alpha waves

PubMed Central

Zauner, Andrea; Gruber, Walter; Himmelstoß, Nicole Alexandra; Lechinger, Julia; Klimesch, Wolfgang

2014-01-01

Retrieval from semantic memory is usually considered within a time window around 300–600 ms. Here we suggest that lexical access already occurs at around 100 ms. This interpretation is based on the finding that semantically rich and frequent words exhibit a significantly shorter topographical latency difference between the site with the shortest P1 latency (leading site) and that with the longest P1 latency (trailing site). This latency difference can be described in terms of an evoked traveling alpha wave as was already shown in earlier studies. PMID:24486978

Development (design and systematization) of HMS Group pump ranges

NASA Astrophysics Data System (ADS)

Tverdokhleb, I.; Yamburenko, V.

2017-08-01

The article reveals the need for pump range charts development for different applications and describes main principles used by HMS Group. Some modern approaches to pump selection are reviewed and highlighted the need for pump compliance with international standards and modern customer requirements. Even though pump design types are similar for different applications they need adjustment to specific requirements, which gets manufacturers develop their particular design for each pump range. Having wide pump ranges for different applications enables to create pump selection software, facilitating manufacturers to prepare high quality quotations in shortest time.

New train of thought in troubleshooting of modern automobiles

NASA Astrophysics Data System (ADS)

Chen, Zhaojun

2018-03-01

With the rapid development of social economy in our country, the car has also been popularized more and more widely. In order to ensure the normal running of the car, it is very important to make proper maintenance and safeguard measures. To achieve the effective enhancement of the quality of vehicle maintenance, we must be able to accurately determine the vehicle fault with the shortest possible time. This article focuses on the new ideas of modern vehicle troubleshooting carried out related research, analysis, hoping to provide some valuable reference to the staff.

Observations on burrowing rates and comments on host specificity in the endangered mussel Lampsilis higginsi

USGS Publications Warehouse

Sylvester, J.R.; Holland, L.E.; Kamer, T.K.

1984-01-01

In preliminary laboratory studies, the endangered mussel Lampsilis higginsi was unable to burrow into rocky substrates, but did burrow into substrates comprised of silt, clay, sand, and/or pebble-gravel. Burrowing times were shortest in silt and longest in pebble-gravel. As judged by longevity of glochidial infection, walleye (Stizostedion vitreum) and largemouth bass (Micropterus salmoides) may be suitable hosts for the parasitic stage. When glochidia were placed in water without host fish, half had died after 48 hours, and all had died after 72 hours. (DBO).

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.

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.

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.

Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

NASA Astrophysics Data System (ADS)

Du, Jiaoman; Yu, Lean; Li, Xiang

2016-04-01

Hazardous materials transportation is an important and hot issue of public safety. Based on the shortest path model, this paper presents a fuzzy multi-objective programming model that minimizes the transportation risk to life, travel time and fuel consumption. First, we present the risk model, travel time model and fuel consumption model. Furthermore, we formulate a chance-constrained programming model within the framework of credibility theory, in which the lengths of arcs in the transportation network are assumed to be fuzzy variables. A hybrid intelligent algorithm integrating fuzzy simulation and genetic algorithm is designed for finding a satisfactory solution. Finally, some numerical examples are given to demonstrate the efficiency of the proposed model and algorithm.

The electrobrachistochrone

NASA Astrophysics Data System (ADS)

Lipscombe, Trevor C.; Mungan, Carl E.

2018-05-01

The brachistochrone problem consists of finding the track of shortest travel time between given initial and final points for a particle sliding frictionlessly along it under the influence of a given external force field. Solvable variations of the standard example of a uniform gravitational field would be suitable for homework and computer projects by undergraduate physics students studying intermediate mechanics and electromagnetism. An electrobrachistochrone problem is here proposed, in which a charged particle moves along a frictionless track under the influence of its electrostatic force of attraction to an image charge in a grounded conducting plane below the track. The path of least time is found to be a foreshortened cycloid and its properties are investigated analytically and graphically.

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.

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.

Landslide triggering by rain infiltration

USGS Publications Warehouse

Iverson, Richard M.

2000-01-01

Landsliding in response to rainfall involves physical processes that operate on disparate timescales. Relationships between these timescales guide development of a mathematical model that uses reduced forms of Richards equation to evaluate effects of rainfall infiltration on landslide occurrence, timing, depth, and acceleration in diverse situations. The longest pertinent timescale is A/D0, where D0 is the maximum hydraulic diffusivity of the soil and A is the catchment area that potentially affects groundwater pressures at a prospective landslide slip surface location with areal coordinates x, y and depth H. Times greater than A/D0 are necessary for establishment of steady background water pressures that develop at (x, y, H) in response to rainfall averaged over periods that commonly range from days to many decades. These steady groundwater pressures influence the propensity for landsliding at (x, y, H), but they do not trigger slope failure. Failure results from rainfall over a typically shorter timescale H2/D0 associated with transient pore pressure transmission during and following storms. Commonly, this timescale ranges from minutes to months. The shortest timescale affecting landslide responses to rainfall is √(H/g), where g is the magnitude of gravitational acceleration. Postfailure landslide motion occurs on this timescale, which indicates that the thinnest landslides accelerate most quickly if all other factors are constant. Effects of hydrologic processes on landslide processes across these diverse timescales are encapsulated by a response function, R(t*) = √(t*/π) exp (-1/t*) - erfc (1/√t*), which depends only on normalized time, t*. Use of R(t*) in conjunction with topographic data, rainfall intensity and duration information, an infinite-slope failure criterion, and Newton's second law predicts the timing, depth, and acceleration of rainfall-triggered landslides. Data from contrasting landslides that exhibit rapid, shallow motion and slow, deep-seated motion corroborate these predictions.

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.

Study on Earthquake Emergency Evacuation Drill Trainer Development

NASA Astrophysics Data System (ADS)

ChangJiang, L.

2016-12-01

With the improvement of China's urbanization, to ensure people survive the earthquake needs scientific routine emergency evacuation drills. Drawing on cellular automaton, shortest path algorithm and collision avoidance, we designed a model of earthquake emergency evacuation drill for school scenes. Based on this model, we made simulation software for earthquake emergency evacuation drill. The software is able to perform the simulation of earthquake emergency evacuation drill by building spatial structural model and selecting the information of people's location grounds on actual conditions of constructions. Based on the data of simulation, we can operate drilling in the same building. RFID technology could be used here for drill data collection which read personal information and send it to the evacuation simulation software via WIFI. Then the simulation software would contrast simulative data with the information of actual evacuation process, such as evacuation time, evacuation path, congestion nodes and so on. In the end, it would provide a contrastive analysis report to report assessment result and optimum proposal. We hope the earthquake emergency evacuation drill software and trainer can provide overall process disposal concept for earthquake emergency evacuation drill in assembly occupancies. The trainer can make the earthquake emergency evacuation more orderly, efficient, reasonable and scientific to fulfill the increase in coping capacity of urban hazard.

Mind the gap: temporal discrimination and dystonia.

PubMed

Sadnicka, A; Daum, C; Cordivari, C; Bhatia, K P; Rothwell, J C; Manohar, S; Edwards, M J

2017-06-01

One of the most widely studied perceptual measures of sensory dysfunction in dystonia is the temporal discrimination threshold (TDT) (the shortest interval at which subjects can perceive that there are two stimuli rather than one). However the elevated thresholds described may be due to a number of potential mechanisms as current paradigms test not only temporal discrimination but also extraneous sensory and decision-making parameters. In this study two paradigms designed to better quantify temporal processing are presented and a decision-making model is used to assess the influence of decision strategy. 22 patients with cervical dystonia and 22 age-matched controls completed two tasks (i) temporal resolution (a randomized, automated version of existing TDT paradigms) and (ii) interval discrimination (rating the length of two consecutive intervals). In the temporal resolution task patients had delayed (P = 0.021) and more variable (P = 0.013) response times but equivalent discrimination thresholds. Modelling these effects suggested this was due to an increased perceptual decision boundary in dystonia with patients requiring greater evidence before committing to decisions (P = 0.020). Patient performance on the interval discrimination task was normal. Our work suggests that previously observed abnormalities in TDT may not be due to a selective sensory deficit of temporal processing as decision-making itself is abnormal in cervical dystonia. © 2017 EAN.

Decoupling the effects of primary production and residence time variation on nitrogen retention in a tidally-influenced spring run

NASA Astrophysics Data System (ADS)

Hensley, R. T.; Cohen, M. J.; Korhnak, L. V.

2013-12-01

Models of nitrogen (N) retention in river networks suggest biogeochemical as well as hydraulic properties exert considerable control on reach scale nutrient retention rates. Freshwater tidally influenced rivers provide a model system for decoupling metabolic vs. hydraulic controls on retention. The clear diurnal N retention signal in response to assimilatory uptake observed in other rivers becomes convoluted as the solar day moves in and out of phase with the semi-diurnal (~12.5 hr) tidal cycle. We used an upstream-downstream mass balance approach to estimate N retention at 15 minute intervals over an entire lunar month in Manatee Springs, a tidally varying, spring-fed stream in North Florida. Retention rates varied markedly with tidal forcing. Contrary to our expectations, higher retention rates and shorter uptake lengths were observed at low tide, corresponding to the shortest residence times, which varied between 22 and 71 minutes in this 350m reach. By profiling a continuously injected conservative tracer under both high and low tide conditions, we determined this was not the result of variation in lateral inflow (e.g., dilution from denitrified hyporheic porewater at lower channel stage). This increased retention at shorter residence times (and hence higher velocity) may be the result of greater turbulent mixing, which drives river water into the benthic reactive zone where the principal retention pathway, denitrification, occurs. After controlling for residence time effects, the residual retention signal exhibited a strong diel pattern. This assimilatory N retention was highly correlated with daily primary production (using the diel oxygen method), and estimated ecosystem molar C:N ratios (8.55×0.83:1) were comparable to observed tissue stoichiometry of the dominant autotrophs (9:1). N retention (blue) and residence time (red) calculated at 15 minute intervals. Note the inverse correlation; highest retention rates occur at the shortest residence times. N retention versus residence time separated into daytime (yellow) and nighttime (blue) data points. Note the daytime data points generally lie above the nighttime regression as a result of higher daytime retention due to assimilatory uptake.

A molecular systems approach to modelling human skin pigmentation: identifying underlying pathways and critical components.

PubMed

Raghunath, Arathi; Sambarey, Awanti; Sharma, Neha; Mahadevan, Usha; Chandra, Nagasuma

2015-04-29

Ultraviolet radiations (UV) serve as an environmental stress for human skin, and result in melanogenesis, with the pigment melanin having protective effects against UV induced damage. This involves a dynamic and complex regulation of various biological processes that results in the expression of melanin in the outer most layers of the epidermis, where it can exert its protective effect. A comprehensive understanding of the underlying cross talk among different signalling molecules and cell types is only possible through a systems perspective. Increasing incidences of both melanoma and non-melanoma skin cancers necessitate the need to better comprehend UV mediated effects on skin pigmentation at a systems level, so as to ultimately evolve knowledge-based strategies for efficient protection and prevention of skin diseases. A network model for UV-mediated skin pigmentation in the epidermis was constructed and subjected to shortest path analysis. Virtual knock-outs were carried out to identify essential signalling components. We describe a network model for UV-mediated skin pigmentation in the epidermis. The model consists of 265 components (nodes) and 429 directed interactions among them, capturing the manner in which one component influences the other and channels information. Through shortest path analysis, we identify novel signalling pathways relevant to pigmentation. Virtual knock-outs or perturbations of specific nodes in the network have led to the identification of alternate modes of signalling as well as enabled determining essential nodes in the process. The model presented provides a comprehensive picture of UV mediated signalling manifesting in human skin pigmentation. A systems perspective helps provide a holistic purview of interconnections and complexity in the processes leading to pigmentation. The model described here is extensive yet amenable to expansion as new data is gathered. Through this study, we provide a list of important proteins essential for pigmentation which can be further explored to better understand normal pigmentation as well as its pathologies including vitiligo and melanoma, and enable therapeutic intervention.

[Effects of illumination and seed-soaking reagent on seed germination of Solanum nigrum].

PubMed

Yang, Chuan-Jie; Wei, Shu-He; Zhou, Qi-Xing; Hu, Ya-Hu; Niu, Rong-Cheng

2009-05-01

To explore a rapid seed germination method for hyperaccumulator Solanum nigrum, a germination experiment with different illumination and seed-soaking treatments was conducted in constant temperature box and greenhouse, with filter as burgeon base. Under illumination, the germination rate was about 5 times high of that without illumination (P < 0.05), indicating that illumination was one of the prerequisites for the seed germination of S. nigrum. All test seed-soaking reagents could significantly improve the germination rate of S. nigrum (P < 0.05), with the best effect of H2O2. The seeds treated with H2O2 had the shortest germination time. The germination rate of seeds soaked but without cleaning was 2-3 times as high as that of seeds soaked and cleaned with water.

Automated CFD Parameter Studies on Distributed Parallel Computers

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.; Aftosmis, Michael; Pandya, Shishir; Tejnil, Edward; Ahmad, Jasim; Kwak, Dochan (Technical Monitor)

2002-01-01

The objective of the current work is to build a prototype software system which will automated the process of running CFD jobs on Information Power Grid (IPG) resources. This system should remove the need for user monitoring and intervention of every single CFD job. It should enable the use of many different computers to populate a massive run matrix in the shortest time possible. Such a software system has been developed, and is known as the AeroDB script system. The approach taken for the development of AeroDB was to build several discrete modules. These include a database, a job-launcher module, a run-manager module to monitor each individual job, and a web-based user portal for monitoring of the progress of the parameter study. The details of the design of AeroDB are presented in the following section. The following section provides the results of a parameter study which was performed using AeroDB for the analysis of a reusable launch vehicle (RLV). The paper concludes with a section on the lessons learned in this effort, and ideas for future work in this area.

Intensification of sodium hydroxide pretreatment of corn stalk using magnetic field in a fluidic system.

PubMed

Jin, Yamei; Yang, Na; Tong, Qunyi; Jin, Zhengyu; Xu, Xueming

2016-11-01

To promote NaOH pretreatment of corn stalk (CS), a continuous processing system uniting magnetic field and millimeter-scaled channel flow was established. First, four comparative pretreatments were conducted: (I) CS was pretreated with NaOH under traditional agitation; (II) CS was pretreated with NaOH in a flowing state inside the millimeter-scaled channel; (III) CS was pretreated with NaOH in a flowing state and under a static magnetic field; or (IV) CS was pretreated with NaOH in a flowing state and under a rotating magnetic field. By comparison, the highest pentose (121.22mg/g dry CS) and hexose (287.04mg/g dry CS) yields were obtained in the shortest pretreatment time with Pretreatment IV (8h). Accordingly, the key parameters of Pretreatment IV were optimized as 6.71Hz frequency, 0.50L/min flow rate, and 1.02% NaOH concentration. Under these conditions, 439.24mg sugars were released by 1g dry CS during pretreatment and enzymatic hydrolysis. Copyright © 2016 Elsevier Ltd. All rights reserved.

One-step electrodeposition process to fabricate corrosion-resistant superhydrophobic surface on magnesium alloy.

PubMed

Liu, Qin; Chen, Dexin; Kang, Zhixin

2015-01-28

A simple, one-step method has been developed to construct a superhydrophobic surface by electrodepositing Mg-Mn-Ce magnesium plate in an ethanol solution containing cerium nitrate hexahydrate and myristic acid. Scanning electron microscopy, energy-dispersive X-ray spectroscopy, X-ray photoelectron spectroscopy, and Fourier transform infrared spectroscopy were employed to characterize the surfaces. The shortest electrodeposition time to obtain a superhydrophobic surface was about 1 min, and the as-prepared superhydrophobic surfaces had a maximum contact angle of 159.8° and a sliding angle of less than 2°. Potentiodynamic polarization and electrochemical impedance spectroscopy measurements demonstrated that the superhydrophobic surface greatly improved the corrosion properties of magnesium alloy in 3.5 wt % aqueous solutions of NaCl, Na2SO4, NaClO3, and NaNO3. Besides, the chemical stability and mechanical durability of the as-prepared superhydrophobic surface were also examined. The presented method is rapid, low-cost, and environmentally friendly and thus should be of significant value for the industrial fabrication of anticorrosive superhydrophobic surfaces and should have a promising future in expanding the applications of magnesium alloys.

A star recognition method based on the Adaptive Ant Colony algorithm for star sensors.

PubMed

Quan, Wei; Fang, Jiancheng

2010-01-01

A new star recognition method based on the Adaptive Ant Colony (AAC) algorithm has been developed to increase the star recognition speed and success rate for star sensors. This method draws circles, with the center of each one being a bright star point and the radius being a special angular distance, and uses the parallel processing ability of the AAC algorithm to calculate the angular distance of any pair of star points in the circle. The angular distance of two star points in the circle is solved as the path of the AAC algorithm, and the path optimization feature of the AAC is employed to search for the optimal (shortest) path in the circle. This optimal path is used to recognize the stellar map and enhance the recognition success rate and speed. The experimental results show that when the position error is about 50″, the identification success rate of this method is 98% while the Delaunay identification method is only 94%. The identification time of this method is up to 50 ms.

Radio-loud AGN Variability from Propagating Relativistic Jets

NASA Astrophysics Data System (ADS)

Li, Yutong; Schuh, Terance; Wiita, Paul J.

2018-06-01

The great majority of variable emission in radio-loud AGNs is understood to arise from the relativistic flows of plasma along two oppositely directed jets. We study this process using the Athena hydrodynamics code to simulate propagating three-dimensional relativistic jets for a wide range of input jet velocities and jet-to-ambient matter density ratios. We then focus on those simulations that remain essentially stable for extended distances (60-120 times the jet radius). Adopting results for the densities, pressures and velocities from these propagating simulations we estimate emissivities from each cell. The observed emissivity from each cell is strongly dependent upon its variable Doppler boosting factor, which depends upon the changing bulk velocities in those zones with respect to our viewing angle to the jet. We then sum the approximations to the fluxes from a large number of zones upstream of the primary reconfinement shock. The light curves so produced are similar to those of blazars, although turbulence on sub-grid scales is likely to be important for the variability on the shortest timescales.

Fuzzy logic control system to provide autonomous collision avoidance for Mars rover vehicle

NASA Technical Reports Server (NTRS)

Murphy, Michael G.

1990-01-01

NASA is currently involved with planning unmanned missions to Mars to investigate the terrain and process soil samples in advance of a manned mission. A key issue involved in unmanned surface exploration on Mars is that of supporting autonomous maneuvering since radio communication involves lengthy delays. It is anticipated that specific target locations will be designated for sample gathering. In maneuvering autonomously from a starting position to a target position, the rover will need to avoid a variety of obstacles such as boulders or troughs that may block the shortest path to the target. The physical integrity of the rover needs to be maintained while minimizing the time and distance required to attain the target position. Fuzzy logic lends itself well to building reliable control systems that function in the presence of uncertainty or ambiguity. The following major issues are discussed: (1) the nature of fuzzy logic control systems and software tools to implement them; (2) collision avoidance in the presence of fuzzy parameters; and (3) techniques for adaptation in fuzzy logic control systems.

Digital Signal Processing for the Event Horizon Telescope

NASA Astrophysics Data System (ADS)

Weintroub, Jonathan

2015-08-01

A broad international collaboration is building the Event Horizon Telescope (EHT). The aim is to test Einstein’s theory of General Relativity in one of the very few places it could break down: the strong gravity regime right at the edge of a black hole. The EHT is an earth-size VLBI array operating at the shortest radio wavelengths, that has achieved unprecedented angular resolution of a few tens of μarcseconds. For nearby super massive black holes (SMBH) this size scale is comparable to the Schwarzschild Radius, and emission in the immediate neighborhood of the event horizon can be directly observed. We give an introduction to the science behind the CASPER-enabled EHT, and outline technical developments, with emphasis on the secret sauce of high speed signal processing.

A class-based link prediction using Distance Dependent Chinese Restaurant Process

NASA Astrophysics Data System (ADS)

Andalib, Azam; Babamir, Seyed Morteza

2016-08-01

One of the important tasks in relational data analysis is link prediction which has been successfully applied on many applications such as bioinformatics, information retrieval, etc. The link prediction is defined as predicting the existence or absence of edges between nodes of a network. In this paper, we propose a novel method for link prediction based on Distance Dependent Chinese Restaurant Process (DDCRP) model which enables us to utilize the information of the topological structure of the network such as shortest path and connectivity of the nodes. We also propose a new Gibbs sampling algorithm for computing the posterior distribution of the hidden variables based on the training data. Experimental results on three real-world datasets show the superiority of the proposed method over other probabilistic models for link prediction problem.

Oculometric Assessment of Dynamic Visual Processing

NASA Technical Reports Server (NTRS)

Liston, Dorion Bryce; Stone, Lee

2014-01-01

Eye movements are the most frequent (3 per second), shortest-latency (150-250 ms), and biomechanically simplest (1 joint, no inertial complexities) voluntary motor behavior in primates, providing a model system to assess sensorimotor disturbances arising from trauma, fatigue, aging, or disease states (e.g., Diefendorf and Dodge, 1908). We developed a 15-minute behavioral tracking protocol consisting of randomized stepramp radial target motion to assess several aspects of the behavioral response to dynamic visual motion, including pursuit initiation, steadystate tracking, direction-tuning, and speed-tuning thresholds. This set of oculomotor metrics provide valid and reliable measures of dynamic visual performance (Stone and Krauzlis, 2003; Krukowski and Stone, 2005; Stone et al, 2009; Liston and Stone, 2014), and may prove to be a useful assessment tool for functional impairments of dynamic visual processing.

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule.

PubMed

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin

2015-11-01

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

Method of transmission of dynamic multibit digital images from micro-unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Petrov, E. P.; Kharina, N. L.

2018-01-01

In connection with successful usage of nanotechnologies in remote sensing great attention is paid to the systems in micro-unmanned aerial vehicles (MUAVs) capable to provide high spatial resolution of dynamic multibit digital images (MDI). Limited energy resources on board the MUAV do not allow transferring a large amount of video information in the shortest possible time. It keeps back the broad development of MUAV. The search for methods to shorten the transmission time of dynamic MDIs from MUAV over the radio channel leads to the methods of MDI compression without computational operations onboard the MUAV. The known compression codecs of video information can not be applied because of the limited energy resources. In this paper we propose a method for reducing the transmission time of dynamic MDIs without computational operations and distortions onboard the MUAV. To develop the method a mathematical apparatus of the theory of conditional Markov processes with discrete arguments was used. On its basis a mathematical model for the transformation of the MDI represented by binary images (BI) in the MDI, consisting of groups of neighboring BIs (GBI) transmitted by multiphase (MP) signals, is constructed. The algorithm for multidimensional nonlinear filtering of MP signals is synthesized, realizing the statistical redundancy of the MDI to compensate for the noise stability losses caused by the use of MP signals.

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

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

Liu, Hui; Song, Yongduan; Xue, Fangzheng

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than themore » SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.« less

Semi-industrial microwave treatments positively affect the quality of orange-colored smoothies.

PubMed

Arjmandi, Mitra; Otón, Mariano; Artés, Francisco; Artés-Hernández, Francisco; Gómez, Perla A; Aguayo, Encarna

2016-10-01

Thermal processing extends the shelf life of fruit and vegetables products by inactivating microorganisms and enzymes. The effect of a pasteurization (P) treatment, 90 ± 2 °C for 35 s, provided by continuous semi-industrial microwave (MW) under different conditions (high power/short time and low power/long time) or conventional pasteurization (CP) on orange-colored smoothies and their changes throughout 45 days of storage at 5 °C were investigated. Results indicated that vitamin C and antioxidant capacity (FRAP) in CP decreased dramatically in comparison with the unheated and MWP smoothies. On the contrary, all heating treatments increased the contents of total phenolic compounds and carotenoids. Based on the sensory quality and microbial counts, the shelf life of all those heated smoothies reached 45 days. No Listeria monocytogenes growth was found and all microbial counts were below the European legal limits (2007). MWP as compared to the CP method led to a greater reduction of mesophilic bacteria after 45 days at 5 °C (3.7 log cfu g -1 for CP and 1.6 log cfu g -1 for MWP). The highest power and the shortest time MWP treatments (3600 W for 93 s), resulted into better preservation of FRAP and vitamin C.

A Decision Processing Algorithm for CDC Location Under Minimum Cost SCM Network

NASA Astrophysics Data System (ADS)

Park, N. K.; Kim, J. Y.; Choi, W. Y.; Tian, Z. M.; Kim, D. J.

Location of CDC in the matter of network on Supply Chain is becoming on the high concern these days. Present status of methods on CDC has been mainly based on the calculation manually by the spread sheet to achieve the goal of minimum logistics cost. This study is focused on the development of new processing algorithm to overcome the limit of present methods, and examination of the propriety of this algorithm by case study. The algorithm suggested by this study is based on the principle of optimization on the directive GRAPH of SCM model and suggest the algorithm utilizing the traditionally introduced MST, shortest paths finding methods, etc. By the aftermath of this study, it helps to assess suitability of the present on-going SCM network and could be the criterion on the decision-making process for the optimal SCM network building-up for the demand prospect in the future.

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.

The Isolation of Motivational, Motoric, and Schedule Effects on Operant Performance: A Modeling Approach

PubMed Central

Brackney, Ryan J; Cheung, Timothy H. C; Neisewander, Janet L; Sanabria, Federico

2011-01-01

Dissociating motoric and motivational effects of pharmacological manipulations on operant behavior is a substantial challenge. To address this problem, we applied a response-bout analysis to data from rats trained to lever press for sucrose on variable-interval (VI) schedules of reinforcement. Motoric, motivational, and schedule factors (effort requirement, deprivation level, and schedule requirements, respectively) were manipulated. Bout analysis found that interresponse times (IRTs) were described by a mixture of two exponential distributions, one characterizing IRTs within response bouts, another characterizing intervals between bouts. Increasing effort requirement lengthened the shortest IRT (the refractory period between responses). Adding a ratio requirement increased the length and density of response bouts. Both manipulations also decreased the bout-initiation rate. In contrast, food deprivation only increased the bout-initiation rate. Changes in the distribution of IRTs over time showed that responses during extinction were also emitted in bouts, and that the decrease in response rate was primarily due to progressively longer intervals between bouts. Taken together, these results suggest that changes in the refractory period indicate motoric effects, whereas selective alterations in bout initiation rate indicate incentive-motivational effects. These findings support the use of response-bout analyses to identify the influence of pharmacological manipulations on processes underlying operant performance. PMID:21765544

Virtual Network Embedding via Monte Carlo Tree Search.

PubMed

Haeri, Soroush; Trajkovic, Ljiljana

2018-02-01

Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

Molecular dynamics at low time resolution.

PubMed

Faccioli, P

2010-10-28

The internal dynamics of macromolecular systems is characterized by widely separated time scales, ranging from fraction of picoseconds to nanoseconds. In ordinary molecular dynamics simulations, the elementary time step Δt used to integrate the equation of motion needs to be chosen much smaller of the shortest time scale in order not to cut-off physical effects. We show that in systems obeying the overdamped Langevin equation, it is possible to systematically correct for such discretization errors. This is done by analytically averaging out the fast molecular dynamics which occurs at time scales smaller than Δt, using a renormalization group based technique. Such a procedure gives raise to a time-dependent calculable correction to the diffusion coefficient. The resulting effective Langevin equation describes by construction the same long-time dynamics, but has a lower time resolution power, hence it can be integrated using larger time steps Δt. We illustrate and validate this method by studying the diffusion of a point-particle in a one-dimensional toy model and the denaturation of a protein.

Opioid withdrawal, craving, and use during and after outpatient buprenorphine stabilization and taper: A discrete survival and growth mixture model

PubMed Central

Stotts, Angela L.; Green, Charles; Potter, Jennifer S.; Marino, Elise N.; Walker, Robrina; Weiss, Roger D.; Trivedi, Madhukar

2014-01-01

Most patients relapse to opioids within one month of opioid agonist detoxification, making the antecedents and parallel processes of first use critical for investigation. Craving and withdrawal are often studied in relationship to opioid outcomes, and a novel analytic strategy applied to these two phenomena may indicate targeted intervention strategies. Specifically, this secondary data analysis of the Prescription Opioid Addiction Treatment Study used a discrete-time mixture analysis with time-to-first opioid use (survival) simultaneously predicted by craving and withdrawal growth trajectories. This analysis characterized heterogeneity among prescription opioid-dependent individuals (N=653) into latent classes (i.e., latent class analysis [LCA]) during and after buprenorphine/naloxone stabilization and taper. A 4-latent class solution was selected for overall model fit and clinical parsimony. In order of shortest to longest time-to-first use, the 4 classes were characterized as 1) high craving and withdrawal 2) intermediate craving and withdrawal 3) high initial craving with low craving and withdrawal trajectories and 4) a low initial craving with low craving and withdrawal trajectories. Odds ratio calculations showed statistically significant differences in time-to-first use across classes. Generally, participants with lower baseline levels and greater decreases in craving and withdrawal during stabilization combined with slower craving and withdrawal rebound during buprenorphine taper remained opioid-free longer. This exploratory work expanded on the importance of monitoring craving and withdrawal during buprenorphine induction, stabilization, and taper. Future research may allow individually tailored and timely interventions to be developed to extend time-to-first opioid use. PMID:25282598

The third-stimulus temporal discrimination threshold: focusing on the temporal processing of sensory input within primary somatosensory cortex.

PubMed

Leodori, Giorgio; Formica, Alessandra; Zhu, Xiaoying; Conte, Antonella; Belvisi, Daniele; Cruccu, Giorgio; Hallett, Mark; Berardelli, Alfredo

2017-10-01

The somatosensory temporal discrimination threshold (STDT) has been used in recent years to investigate time processing of sensory information, but little is known about the physiological correlates of somatosensory temporal discrimination. The objective of this study was to investigate whether the time interval required to discriminate between two stimuli varies according to the number of stimuli in the task. We used the third-stimulus temporal discrimination threshold (ThirdDT), defined as the shortest time interval at which an individual distinguishes a third stimulus following a pair of stimuli delivered at the STDT. The STDT and ThirdDT were assessed in 31 healthy subjects. In a subgroup of 10 subjects, we evaluated the effects of the stimuli intensity on the ThirdDT. In a subgroup of 16 subjects, we evaluated the effects of S1 continuous theta-burst stimulation (S1-cTBS) on the STDT and ThirdDT. Results show that ThirdDT is shorter than STDT. We found a positive correlation between STDT and ThirdDT values. As long as the stimulus intensity was within the perceivable and painless range, it did not affect ThirdDT values. S1-cTBS significantly affected both STDT and ThirdDT, although the latter was affected to a greater extent and for a longer period of time. We conclude that the interval needed to discriminate between time-separated tactile stimuli is related to the number of stimuli used in the task. STDT and ThirdDT are encoded in S1, probably by a shared tactile temporal encoding mechanism whose performance rapidly changes during the perception process. ThirdDT is a new method to measure somatosensory temporal discrimination. NEW & NOTEWORTHY To investigate whether the time interval required to discriminate between stimuli varies according to changes in the stimulation pattern, we used the third-stimulus temporal discrimination threshold (ThirdDT). We found that the somatosensory temporal discrimination acuity varies according to the number of stimuli in the task. The ThirdDT is a new method to measure somatosensory temporal discrimination and a possible index of inhibitory activity at the S1 level. Copyright © 2017 the American Physiological Society.

A General, Concise Strategy that Enables Collective Total Syntheses of over 50 Protoberberine and Five Aporhoeadane Alkaloids within Four to Eight Steps.

PubMed

Zhou, Shiqiang; Tong, Rongbiao

2016-05-17

A concise, catalytic, and general strategy that allowed efficient total syntheses of 22 natural 13-methylprotoberberines within four steps for each molecule is reported. This synthesis represents the most efficient and shortest route to date, featuring three catalytic processes: CuI-catalyzed redox-A(3) reaction, Pd-catalyzed reductive carbocyclization, and PtO2 -catalyzed hydrogenation. Importantly, this new strategy to the tetracyclic framework has also been applied to the collective concise syntheses of >30 natural protoberberines (without 13-methyl group) and five aporhoeadane alkaloids. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Application of nonlinear pulse shaping of femtosecond pulse generation in a fiber amplifier at 500 MHz repetition rate

NASA Astrophysics Data System (ADS)

Liu, Yang; Luo, Daping; Wang, Chao; Zhu, Zhiwei; Li, Wenxue

2018-03-01

We numerically and experimentally demonstrate that a nonlinear pulse shaping technique based on pre-chirping management in a short gain fiber can be exploited to improve the quality of a compressed pulse. With prior tuning of the pulse chirp, the amplified pulse express different nonlinear propagating processes. A spectrum with s flat top and more smooth wings, showing a similariton feature, generates with the optimal initial pulse chirp, and the shortest pulses with minimal pulse pedestals are obtained. Experimental results show the ability of nonlinear pulse shaping to enhance the quality of compressed pulses, as theoretically expected.

Application of ecosystem-scale fate and bioaccumulation models to predict fish mercury response times to changes in atmospheric deposition.

PubMed

Knightes, Christopher D; Sunderland, Elsie M; Craig Barber, M; Johnston, John M; Ambrose, Robert B

2009-04-01

Management strategies for controlling anthropogenic mercury emissions require understanding how ecosystems will respond to changes in atmospheric mercury deposition. Process-based mathematical models are valuable tools for informing such decisions, because measurement data often are sparse and cannot be extrapolated to investigate the environmental impacts of different policy options. Here, we bring together previously developed and evaluated modeling frameworks for watersheds, water bodies, and food web bioaccumulation of mercury. We use these models to investigate the timescales required for mercury levels in predatory fish to change in response to altered mercury inputs. We model declines in water, sediment, and fish mercury concentrations across five ecosystems spanning a range of physical and biological conditions, including a farm pond, a seepage lake, a stratified lake, a drainage lake, and a coastal plain river. Results illustrate that temporal lags are longest for watershed-dominated systems (like the coastal plain river) and shortest for shallow water bodies (like the seepage lake) that receive most of their mercury from deposition directly to the water surface. All ecosystems showed responses in two phases: A relatively rapid initial decline in mercury concentrations (20-60% of steady-state values) over one to three decades, followed by a slower descent lasting for decades to centuries. Response times are variable across ecosystem types and are highly affected by sediment burial rates and active layer depths in systems not dominated by watershed inputs. Additional research concerning watershed processes driving mercury dynamics and empirical data regarding sediment dynamics in freshwater bodies are critical for improving the predictive capability of process-based mercury models used to inform regulatory decisions.

A graph-theoretic method to quantify the airline route authority

NASA Technical Reports Server (NTRS)

Chan, Y.

1979-01-01

The paper introduces a graph-theoretic method to quantify the legal statements in route certificate which specifies the airline routing restrictions. All the authorized nonstop and multistop routes, including the shortest time routes, can be obtained, and the method suggests profitable route structure alternatives to airline analysts. This method to quantify the C.A.B. route authority was programmed in a software package, Route Improvement Synthesis and Evaluation, and demonstrated in a case study with a commercial airline. The study showed the utility of this technique in suggesting route alternatives and the possibility of improvements in the U.S. route system.

Diode-pumped passively Q-switched Nd:YAG ceramic laser with a gold nanotriangles saturable absorber at 1 µm

NASA Astrophysics Data System (ADS)

Bai, Jinxi; Li, Ping; Chen, Xiaohan; Guo, Lei; Wang, Lili; Liu, Binghai

2017-08-01

Passively Q-switched Nd:YAG ceramic lasers at 1064 and 1123 nm are demonstrated based on a gold nanotriangles saturable absorber (GNTs-SA) for the first time. The maximum average output power reaches 226 mW at 1064 nm and 172 mW at 1123 nm with corresponding shortest pulse widths and maximum pulse repetition rates of (179 ns, 320 kHz) and (231 ns, 457 kHz), respectively. Our results prove that the GNTs-SA is a promising saturable absorber around the 1-µm region.

Lexical access and evoked traveling alpha waves.

PubMed

Zauner, Andrea; Gruber, Walter; Himmelstoß, Nicole Alexandra; Lechinger, Julia; Klimesch, Wolfgang

2014-05-01

Retrieval from semantic memory is usually considered within a time window around 300-600ms. Here we suggest that lexical access already occurs at around 100ms. This interpretation is based on the finding that semantically rich and frequent words exhibit a significantly shorter topographical latency difference between the site with the shortest P1 latency (leading site) and that with the longest P1 latency (trailing site). This latency difference can be described in terms of an evoked traveling alpha wave as was already shown in earlier studies. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

Optimization of the time-dependent traveling salesman problem with Monte Carlo methods.

PubMed

Bentner, J; Bauer, G; Obermair, G M; Morgenstern, I; Schneider, J

2001-09-01

A problem often considered in operations research and computational physics is the traveling salesman problem, in which a traveling salesperson has to find the shortest closed tour between a certain set of cities. This problem has been extended to more realistic scenarios, e.g., the "real" traveling salesperson has to take rush hours into consideration. We will show how this extended problem is treated with physical optimization algorithms. We will present results for a specific instance of Reinelt's library TSPLIB95, in which we define a zone with traffic jams in the afternoon.

Identification of short single disulfide-containing contryphans from the venom of cone snails using de novo mass spectrometry-based sequencing methods.

PubMed

Franklin, Jayaseelan Benjamin; Rajesh, Rajaian Pushpabai; Vinithkumar, Nambali Valsalan; Kirubagaran, Ramalingam

2017-06-15

We identified 12 short single disulfide-containing conopeptides from the venom of Conus coronatus, C. leopardus, C. lividus and C. zonatus. Interestingly, we detected the shortest contryphan sequence thus far characterized which contains only six amino acid residues. We also identified three distinct contryphan sequences of C. lividus without any proline residues and one sequence with an unusual post-translational modification (bromination of tryptophan). Furthermore, we characterized venom peptides of C. zonatus for the first time. Copyright © 2017 Elsevier Ltd. All rights reserved.

Femtosecond parabolic pulse shaping in normally dispersive optical fibers.

PubMed

Sukhoivanov, Igor A; Iakushev, Sergii O; Shulika, Oleksiy V; Díez, Antonio; Andrés, Miguel

2013-07-29

Formation of parabolic pulses at femtosecond time scale by means of passive nonlinear reshaping in normally dispersive optical fibers is analyzed. Two approaches are examined and compared: the parabolic waveform formation in transient propagation regime and parabolic waveform formation in the steady-state propagation regime. It is found that both approaches could produce parabolic pulses as short as few hundred femtoseconds applying commercially available fibers, specially designed all-normal dispersion photonic crystal fiber and modern femtosecond lasers for pumping. The ranges of parameters providing parabolic pulse formation at the femtosecond time scale are found depending on the initial pulse duration, chirp and energy. Applicability of different fibers for femtosecond pulse shaping is analyzed. Recommendation for shortest parabolic pulse formation is made based on the analysis presented.

Ultraviolet radiation effects on the infrared damage rate of a thermal control coating

NASA Technical Reports Server (NTRS)

Bass, J. A.

1972-01-01

The effects of ultraviolet radiation on the infrared reflectance of ZnO silicone white thermal coatings were investigated. Narrow band ultraviolet radiation for wavelengths in the 2200A to 3500A range by a monochromator and a high pressure, 150-W Eimac xenon lamp. The sample was irradiated while in a vacuum of at least 0.000001 torr, and infrared reflectance was measured in situ with a spectroreflectometer at 19,500A. Reflectance degradation was studied as a function of wavelength, time, intensity, and dose. Damage was wavelength dependent at constant exposure, but no maximum was evident above the shortest wavelength investigated here. The degradation rate at constant intensity was an exponential function of time and varies with intensity.

Influence of enrichment broths on multiplex PCR detection of total coliform bacteria, Escherichia coli and Clostridium perfringens, in spiked water samples.

PubMed

Worakhunpiset, S; Tharnpoophasiam, P

2009-07-01

Although multiplex PCR amplification condition for simultaneous detection of total coliform bacteria, Escherichia coli and Clostridium perfringens in water sample has been developed, results with high sensitivity are obtained when amplifying purified DNA, but the sensitivity is low when applied to spiked water samples. An enrichment broth culture prior PCR analysis increases sensitivity of the test but the specific nature of enrichment broth can affect the PCR results. Three enrichment broths, lactose broth, reinforced clostridial medium and fluid thioglycollate broth, were compared for their influence on sensitivity and on time required with multiplex PCR assay. Fluid thioglycollate broth was the most effective with shortest enrichment time and lowest detection limit.

Design of Cyber Attack Precursor Symptom Detection Algorithm through System Base Behavior Analysis and Memory Monitoring

NASA Astrophysics Data System (ADS)

Jung, Sungmo; Kim, Jong Hyun; Cagalaban, Giovanni; Lim, Ji-Hoon; Kim, Seoksoo

More recently, botnet-based cyber attacks, including a spam mail or a DDos attack, have sharply increased, which poses a fatal threat to Internet services. At present, antivirus businesses make it top priority to detect malicious code in the shortest time possible (Lv.2), based on the graph showing a relation between spread of malicious code and time, which allows them to detect after malicious code occurs. Despite early detection, however, it is not possible to prevent malicious code from occurring. Thus, we have developed an algorithm that can detect precursor symptoms at Lv.1 to prevent a cyber attack using an evasion method of 'an executing environment aware attack' by analyzing system behaviors and monitoring memory.

Communication between South Asian patients and GPs: comparative study using the Roter Interactional Analysis System

PubMed Central

Neal, Richard D; Ali, Nasreen; Atkin, Karl; Allgar, Victoria L; Ali, Shahid; Coleman, Tim

2006-01-01

Background The UK South Asian population has poorer health outcomes. Little is known about their process of care in general practice, or in particular the process of communication with GPs. Aim To compare the ways in which white and South Asian patients communicate with white GPs. Design of study Observational study of video-recorded consultations using the Roter Interactional Analysis System (RIAS). Setting West Yorkshire, UK. Method One hundred and eighty–three consultations with 11 GPs in West Yorkshire, UK were video-recorded and analysed. Results Main outcome measures were consultation length, verbal domination, 16 individual abridged RIAS categories, and three composite RIAS categories; with comparisons between white patients, South Asian patients fluent in English and South Asian patients non-fluent in English. South Asians fluent in English had the shortest consultations and South Asians non-fluent in English the longest consultations (one-way ANOVA F = 7.173, P = 0.001). There were no significant differences in verbal domination scores between the three groups. White patients had more affective (emotional) consultations than South Asian patients, and played a more active role in their consultations, as did their GPs. GPs spent less time giving information to South Asian patients who were not fluent in English and more time asking questions. GPs spent less time giving information to South Asian patients fluent in English compared with white patients. Conclusions These findings were expected between patients fluent and non-fluent in English but do demonstrate their nature. The differences between white patients and South Asian patients fluent in English warrant further explanation. How much of this was due to systematic differences in behaviour by the GPs, or was in response to patients' differing needs and expectations is unknown. These differences may contribute to differences in health outcomes. PMID:17132355

The correlation between structural properties, geometrical features, and photoactivity of freestanding TiO2 nanotubes in comparative degradation of 2,4-dichlorophenol and methylene blue

NASA Astrophysics Data System (ADS)

Vahabzadeh Pasikhani, Javad; Gilani, Neda; Ebrahimian Pirbazari, Azadeh

2018-02-01

Freestanding TiO2 nanotubes (FSNTs) with various physical dimensions were fabricated by two-step anodization process with different voltages and anodization times. The detachment method employed in this study involved voltage reduction at the end of the second step and ultrasonic chemical treatment. The results demonstrated that this detachment method is a beneficial technique to create thin open-mouthed and closed-end FSNTs (with lengths of 6-14 μm). Moreover, the influences of anodization conditions on photocatalytic activity, structural properties and geometrical features of FSNTs in comparative degradation of two non-colored (2,4-dichlorophenol) and colored (methylene blue) pollutants were investigated. Findings revealed that the quantity of the photocatalyst utilized is an effective parameter and using the optimum weight (10 mg/100 ml of 2,4-dichlorophenol) could increase the efficiency of the process up to 21%. Further, the results demonstrated that if equal optimum weights of FSNTs are chosen, decreases in voltage and anodization time significantly influence the structural properties, geometrical features, and photodegradation efficiency. The enhancement achieved in the degradation of both 2,4-dichlorophenol and methylene blue using the nanotubes with the shortest diameter (54 nm) and length (6.5 μm), which possess the lowest porosity (0.5) and also the highest surface area (0.53 m2 g-1), nanotubes’ density (19 cm2 cm-2) and wall thickness to length ratio (2). In addition, the results obtained indicated that the degradation reactions follow first-order kinetics in the degradation of the both pollutants. The apparent degradation rate constant of methylene blue was approximately 1.2 times greater than of the 2,4-dichlorophenol due to the negative charge of the nanotubes’ surface and electrostatic adsorptions.

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/).

A novel multi-segment path analysis based on a heterogeneous velocity model for the localization of acoustic emission sources in complex propagation media.

PubMed

Gollob, Stephan; Kocur, Georg Karl; Schumacher, Thomas; Mhamdi, Lassaad; Vogel, Thomas

2017-02-01

In acoustic emission analysis, common source location algorithms assume, independently of the nature of the propagation medium, a straight (shortest) wave path between the source and the sensors. For heterogeneous media such as concrete, the wave travels in complex paths due to the interaction with the dissimilar material contents and with the possible geometrical and material irregularities present in these media. For instance, cracks and large air voids present in concrete influence significantly the way the wave travels, by causing wave path deviations. Neglecting these deviations by assuming straight paths can introduce significant errors to the source location results. In this paper, a novel source localization method called FastWay is proposed. It accounts, contrary to most available shortest path-based methods, for the different effects of material discontinuities (cracks and voids). FastWay, based on a heterogeneous velocity model, uses the fastest rather than the shortest travel paths between the source and each sensor. The method was evaluated both numerically and experimentally and the results from both evaluation tests show that, in general, FastWay was able to locate sources of acoustic emissions more accurately and reliably than the traditional source localization methods. Copyright © 2016 Elsevier B.V. All rights reserved.

[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.

The influence of decreased hydraulic retention time on the performance and stability of co-digestion of sewage sludge with grease trap sludge and organic fraction of municipal waste.

PubMed

Grosser, Anna

2017-12-01

The effect of hydraulic retention time ranging from 12 to 20 d on process performance and stability was investigated in two anaerobic completely stirred tank reactors with a working liquid volume equal to 6 litres. The reactors were fed with mixtures containing (on volatile solids basis): 40% of sewage sludge, 30% of organic fraction of municipal waste and 30% of grease trap sludge. The change of hydraulic retention time did not significantly affect process stability. However, methane yields as well as volatile solids removal decreased from 0.54 to 0.47 l per kg of added volatile solids and 65% to 60% respectively, with the decrease of hydraulic retention time. Despite the fact that the best process performance was achieved for hydraulic retention time of 20 days, the obtained results showed that it is also possible to carry out the co-digestion process at shorter hydraulic retention times with good results. Furthermore, gas production rate as well as biogas production at the shortest hydraulic retention time were approximately 46% higher in comparison to results obtained at the longest hydraulic retention time. In this context, the proposed solution seems to be an interesting option, because it provides an unique opportunity for wastewater treatment plants to improve their profitability by enhancing energy recovery from sludge as well as full utilisation of the existing infrastructure and hence creates a new potential place for alternative treatment of organic industrial waste such as: fat-rich materials or food waste. However, implementation of the solution at wastewater treatment plants is still a big challenge and needs studies including identification of optimal digesting conditions, information about substrate pumping, inhibition thresholds and processing properties. Additionally, due to the characteristics of both co-substrates their introduction to the full-scale digester should be carefully planned due to a potential risk of overloading of the digester. For this reason, a gradual increase of the share of these wastes in the co-digestion mixture is highly recommended, because it will allow for the acclimatization of bacteria as well as prevent overloading. The results of this study show the importance of gradual acclimatization of microorganisms to the changing environmental conditions. It was found that concentration of long chain fatty acids in effluents increased with the reduction of hydraulic retention time, but this phenomenon did not significantly influence the performance and stability of the process probably due to changes hydraulic retention time being gradual. Although for palmitic acid a moderate negative correlation with volatile solids removal was observed. Copyright © 2017 Elsevier Ltd. All rights reserved.

Experimental investigation of all-optical packet-level time slot assignment using two optical buffers cascaded.

PubMed

Sheng, Xinzhi; Feng, Zhen; Li, Bing

2013-04-20

We proposed and experimentally demonstrated all-optical packet-level time slot assignment scheme with two optical buffers cascaded. The function of time-slot interchange (TSI) was successfully implemented on two and three optical packets at a data rate of 10 Gb/s. Therefore, the functions of TSI on N packets should be implemented easily by the use of N-1 stage optical buffer. On the basis of the above experiment, we carried out the TSI experiment on four packets with the same two-stage experimental setup. Furthermore, packets compression on three optical packets was also carried out with the same experimental setup. The shortest guard time of the packets compression can reach to 13 ns due to the limit of FPGA's control accuracy. Due to the use of the same optical buffer, the proposed scheme has the advantages of simple and scalable configuration, modularization, and easy integration.

Sterilization of Turmeric by Atmospheric Pressure Dielectric Barrier Discharge Plasma

NASA Astrophysics Data System (ADS)

Setareh, Salarieh; Davoud, Dorranian

2013-11-01

In this study atmospheric pressure dielectric barrier discharge (DBD) plasma has been employed for sterilizing dry turmeric powders. A 6 kV, 6 kHz frequency generator was used to generate plasma with Ar, Ar/O2, He, and He/O2 gases between the 5 mm gap of two quartz covered electrodes. The complete sterilization time of samples due to plasma treatment was measured. The most important contaminant of turmeric is bacillus subtilis. The results show that the shortest sterilization time of 15 min is achieved by exposing the samples to Ar/O2 plasma. Survival curves of samples are exponential functions of time and the addition of oxygen to plasma leads to a significant increase of the absolute value of time constant of the curves. Magnitudes of protein and DNA in treated samples were increased to a similar value for all samples. Taste, color, and solubility of samples were not changed after the plasma treatment.

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.

[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.

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.

Results of telerobotic hand controller study using force information and rate control

NASA Technical Reports Server (NTRS)

Willshire, Kelli F.; Harrison, F. W.; Hogge, Edward F.; Williams, Robert L.; Soloway, Donald

1992-01-01

To increase quantified information about the effectiveness and subjective workload of force information relayed through manipulator input control devices, a space related task was performed by eight subjects with kinesthetic force feedback and/or local force accommodation through three different input control devices (i.e., hand controllers) operating in rate control mode. Task completion time, manipulator work, and subjective responses were measured. Results indicated a difference among the hand controllers. For the Honeywell six degree-of-freedom hand controller, the overall task completion times were shortest, the amount of work exerted was the least, and was the most preferred by test subjects. Neither force accommodation with or without reflection resulted in shorter task completion times or reduced work although those conditions were better than no force information for some aspects. Comparisons of results from previous studies are discussed.

Work, exercise, and space flight. 2: Modification of adaptation by exercise (exercise prescription)

NASA Technical Reports Server (NTRS)

Thornton, William

1989-01-01

The fundamentals of exercise theory on earth must be rigorously understood and applied to prevent adaptation to long periods of weightlessness. Locomotor activity, not weight, determines the capacity or condition of the largest muscles and bones in the body and usually also determines cardio-respiratory capacity. Absence of this activity results in rapid atrophy of muscle, bone, and cardio-respiratory capacity. Upper body muscle and bone are less affected depending upon the individual's usual, or 1-g, activities. Methodology is available to prevent these changes but space operations demand that it be done in the most efficient fashion, i.e., shortest time. At this point in time we can reasonably select the type of exercise and methods of obtaining it, but additional work in 1-g will be required to optimize the time.

Aging persons' estimates of vehicular motion.

PubMed

Schiff, W; Oldak, R; Shah, V

1992-12-01

Estimated arrival times of moving autos were examined in relation to viewer age, gender, motion trajectory, and velocity. Direct push-button judgments were compared with verbal estimates derived from velocity and distance, which were based on assumptions that perceivers compute arrival time from perceived distance and velocity. Experiment 1 showed that direct estimates of younger Ss were most accurate. Older women made the shortest (highly cautious) estimates of when cars would arrive. Verbal estimates were much lower than direct estimates, with little correlation between them. Experiment 2 extended target distances and velocities of targets, with the results replicating the main findings of Experiment 1. Judgment accuracy increased with target velocity, and verbal estimates were again poorer estimates of arrival time than direct ones, with different patterns of findings. Using verbal estimates to approximate judgments in traffic situations appears questionable.

Efficient priority queueing routing strategy on networks of mobile agents

NASA Astrophysics Data System (ADS)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

Estimating the implicit component of visuomotor rotation learning by constraining movement preparation time.

PubMed

Leow, Li-Ann; Gunn, Reece; Marinovic, Welber; Carroll, Timothy J

2017-08-01

When sensory feedback is perturbed, accurate movement is restored by a combination of implicit processes and deliberate reaiming to strategically compensate for errors. Here, we directly compare two methods used previously to dissociate implicit from explicit learning on a trial-by-trial basis: 1 ) asking participants to report the direction that they aim their movements, and contrasting this with the directions of the target and the movement that they actually produce, and 2 ) manipulating movement preparation time. By instructing participants to reaim without a sensory perturbation, we show that reaiming is possible even with the shortest possible preparation times, particularly when targets are narrowly distributed. Nonetheless, reaiming is effortful and comes at the cost of increased variability, so we tested whether constraining preparation time is sufficient to suppress strategic reaiming during adaptation to visuomotor rotation with a broad target distribution. The rate and extent of error reduction under preparation time constraints were similar to estimates of implicit learning obtained from self-report without time pressure, suggesting that participants chose not to apply a reaiming strategy to correct visual errors under time pressure. Surprisingly, participants who reported aiming directions showed less implicit learning according to an alternative measure, obtained during trials performed without visual feedback. This suggests that the process of reporting can affect the extent or persistence of implicit learning. The data extend existing evidence that restricting preparation time can suppress explicit reaiming and provide an estimate of implicit visuomotor rotation learning that does not require participants to report their aiming directions. NEW & NOTEWORTHY During sensorimotor adaptation, implicit error-driven learning can be isolated from explicit strategy-driven reaiming by subtracting self-reported aiming directions from movement directions, or by restricting movement preparation time. Here, we compared the two methods. Restricting preparation times did not eliminate reaiming but was sufficient to suppress reaiming during adaptation with widely distributed targets. The self-report method produced a discrepancy in implicit learning estimated by subtracting aiming directions and implicit learning measured in no-feedback trials. Copyright © 2017 the American Physiological Society.

Information spread of emergency events: path searching on social networks.

PubMed

Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

An ensemble method for extracting adverse drug events from social media.

PubMed

Liu, Jing; Zhao, Songzheng; Zhang, Xiaodi

2016-06-01

Because adverse drug events (ADEs) are a serious health problem and a leading cause of death, it is of vital importance to identify them correctly and in a timely manner. With the development of Web 2.0, social media has become a large data source for information on ADEs. The objective of this study is to develop a relation extraction system that uses natural language processing techniques to effectively distinguish between ADEs and non-ADEs in informal text on social media. We develop a feature-based approach that utilizes various lexical, syntactic, and semantic features. Information-gain-based feature selection is performed to address high-dimensional features. Then, we evaluate the effectiveness of four well-known kernel-based approaches (i.e., subset tree kernel, tree kernel, shortest dependency path kernel, and all-paths graph kernel) and several ensembles that are generated by adopting different combination methods (i.e., majority voting, weighted averaging, and stacked generalization). All of the approaches are tested using three data sets: two health-related discussion forums and one general social networking site (i.e., Twitter). When investigating the contribution of each feature subset, the feature-based approach attains the best area under the receiver operating characteristics curve (AUC) values, which are 78.6%, 72.2%, and 79.2% on the three data sets. When individual methods are used, we attain the best AUC values of 82.1%, 73.2%, and 77.0% using the subset tree kernel, shortest dependency path kernel, and feature-based approach on the three data sets, respectively. When using classifier ensembles, we achieve the best AUC values of 84.5%, 77.3%, and 84.5% on the three data sets, outperforming the baselines. Our experimental results indicate that ADE extraction from social media can benefit from feature selection. With respect to the effectiveness of different feature subsets, lexical features and semantic features can enhance the ADE extraction capability. Kernel-based approaches, which can stay away from the feature sparsity issue, are qualified to address the ADE extraction problem. Combining different individual classifiers using suitable combination methods can further enhance the ADE extraction effectiveness. Copyright © 2016 Elsevier B.V. All rights reserved.

LiveWire interactive boundary extraction algorithm based on Haar wavelet transform and control point set direction search

NASA Astrophysics Data System (ADS)

Cheng, Jun; Zhang, Jun; Tian, Jinwen

2015-12-01

Based on deep analysis of the LiveWire interactive boundary extraction algorithm, a new algorithm focusing on improving the speed of LiveWire algorithm is proposed in this paper. Firstly, the Haar wavelet transform is carried on the input image, and the boundary is extracted on the low resolution image obtained by the wavelet transform of the input image. Secondly, calculating LiveWire shortest path is based on the control point set direction search by utilizing the spatial relationship between the two control points users provide in real time. Thirdly, the search order of the adjacent points of the starting node is set in advance. An ordinary queue instead of a priority queue is taken as the storage pool of the points when optimizing their shortest path value, thus reducing the complexity of the algorithm from O[n2] to O[n]. Finally, A region iterative backward projection method based on neighborhood pixel polling has been used to convert dual-pixel boundary of the reconstructed image to single-pixel boundary after Haar wavelet inverse transform. The algorithm proposed in this paper combines the advantage of the Haar wavelet transform and the advantage of the optimal path searching method based on control point set direction search. The former has fast speed of image decomposition and reconstruction and is more consistent with the texture features of the image and the latter can reduce the time complexity of the original algorithm. So that the algorithm can improve the speed in interactive boundary extraction as well as reflect the boundary information of the image more comprehensively. All methods mentioned above have a big role in improving the execution efficiency and the robustness of the algorithm.

Remaining Lifetime After Recognition of Terminal Illness Depends on Diagnosis: A Nationwide Population-Based Cohort Study.

PubMed

Bell, Cathrine; Nielsen, Mette K; Neergaard, Mette A; Guldin, Mai-Britt; Jensen, Anders B

2017-01-01

Timely recognition of the terminal phase of life will benefit patients and caregivers as it may facilitate advance care planning and support. The objective of this study was to investigate the remaining lifetime of patients entering a physician-assessed terminal phase and to analyze variation in remaining lifetime according to diagnosis and sociodemographic factors. Danish National Health Registers were used to establish a prospective cohort of adult patients formally registered with drug reimbursement due to terminal illness in 2012 and followed until June 2014. Of the 11,062 included patients, the median remaining lifetime was 55 days and 37% of the patients died within the first month. The majority suffered from cancer (89%). Patients with a noncancer disease had the shortest remaining lifetime (17 days), considerably shorter than patients with cancer (59 days). Patients with prostate cancer had the longest remaining lifetime (76 days), whereas those with hematologic cancer had the shortest among cancer patients (41 days). Compared with lung cancer patients, the probability of death within 30 days were higher for patients with noncancer disease and lower for those with prostate or colorectal cancer. Male gender and high age were associated with higher risk of dying within 30 days. This study found a median remaining lifetime of 55 days after recognition of terminal illness. Remaining lifetime differed between cancer and noncancer patients and according to age and gender. Increased attention should be directed toward timely recognition of the transition into the terminal phase, especially for patients with noncancer disease. Copyright © 2016 American Academy of Hospice and Palliative Medicine. Published by Elsevier Inc. All rights reserved.

Comparative Analysis of the Usefulness of the GlideScope®, Macintosh, and McCoy Laryngoscopes for Endotracheal Intubation in Patients with Obesity: A Randomized, Clinical Trial

PubMed Central

Akbarzadeh, Seyed Reza; Taghavi Gillani, Maryar; Tabari, Masoumeh; Morovatdar, Negar

2017-01-01

Background Difficult intubation is dangerous and sometimes fatal, especially in patients with obesity. In difficult intubation cases the best device should be applied to decrease the risk of complications. The current study aimed at comparing laryngoscopes, Macintosh, McCoy, GlideScope® and devices for intubation purposes. Methods A total of 102 patients with obesity and ASA (American society of anesthesiologists) class I or II, and body mass index (BMI) of > 30 kg/m2 were selected. After obtaining the informed consent, the patients were divided into 3 groups based on the 3 laryngoscope types. Preoperative airway assessment including the Mallampati score, thyromental distance (TMD), and neck circumference was performed and all the patients were anesthetized based on the same protocol. Subsequently, all of the patients were intubated using a Macintosh, McCoy, or GlideScope® laryngoscope. Laryngoscopy time, Cormack-Lehane score (1 - 4), and the percentage of glottic opening (POGO; 1 - 100) were evaluated. Data were analyzed using SPSS version 16, and results were considered statistically significant at P ≤ 0.05. Results There was no significant difference between demographic characteristics and preoperative airway evaluations. The shortest and longest laryngoscopy time were obtained in the GlideScope® and McCoy laryngoscope groups, respectively (P = 0.001). The highest Cormack-Lehane score was obtained using the GlideScope® method (P = 0.04). The POGO was higher and, therefore, more appropriate in the McCoy laryngoscope group (P = 0.009). A direct relationship was observed between neck circumference (P = 0.008), BMI (P = 0.023), Mallampati score (P = 0.000), and laryngoscopy. Conclusions In the current study, the shortest and longest intubation time in patients with obesity was observed in the GlideScope® and the McCoy laryngoscope groups, respectively. Moreover, the direct relationships of BMI and neck circumference with laryngoscopy time were observed in all 3 groups. These results suggested using GlideScope® in patients with high BMI to reduce laryngoscopy time. PMID:29696123

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.

Concise Review: Mind the Gap: Challenges in Characterizing and Quantifying Cell- and Tissue-Based Therapies for Clinical Translation

PubMed Central

Rayment, Erin A; Williams, David J

2010-01-01

There are many challenges associated with characterizing and quantifying cells for use in cell- and tissue-based therapies. From a regulatory perspective, these advanced treatments must not only be safe and effective but also be made by high-quality manufacturing processes that allow for on-time delivery of viable products. Although sterility assays can be adapted from conventional bioprocessing, cell- and tissue-based therapies require more stringent safety assessments, especially in relation to use of animal products, immune reaction, and potential instability due to extended culture times. Furthermore, cell manufacturers who plan to use human embryonic stem cells in their therapies need to be particularly stringent in their final purification steps, due to the unrestricted growth potential of these cells. This review summarizes the current issues in characterization and quantification for cell- and tissue-based therapies, dividing these challenges into the regulatory themes of safety, potency, and manufacturing quality. It outlines current assays in use, as well as highlights the limits of many of these product release tests. Mode of action is discussed, with particular reference to in vitro surrogate assays that can be used to provide information to correlate with proposed in vivo patient efficacy. Importantly, this review highlights the requirement for basic research to improve current knowledge on the in vivo fate of these treatments; as well as an improved stakeholder negotiation process to identify the measurement requirements that will ensure the manufacture of the best possible cell- and tissue-based therapies within the shortest timeframe for the most patient benefit. PMID:20333747

Taste-masked and affordable donepezil hydrochloride orally disintegrating tablet as promising solution for non-compliance in Alzheimer's disease patients.

PubMed

Liew, Kai Bin; Tan, Yvonne Tze Fung; Peh, Kok Khiang

2015-04-01

Manufacturing process and superdisintegrants used in orally disintegrating tablet (ODT) formulation are often time discussed. However, the effect of suitable filler for ODT formulation is not explored thoroughly. The aim of this study was to develop a novel taste masked and affordable donepezil hydrochloride ODT with fast disintegration time and stable to improve medication compliance of Alzheimer's disease patient. The ODT was manufactured using simple wet-granulation method. Crospovidone XL-10 was used as superdisintegrant and optimization was done by comparing the effect of three grades of lactose monohydrate compound as filler: Starlac®, Flowlac® and Tablettose®. Formulations containing higher amount of colloidal silicon dioxide showed increase in hardness, weight, disintegration time and wetting time after stability study. Formulation E which containing 50% of Starlac® was found with shortest in vitro disintegration time (21.7 ± 1.67 s), in vivo disintegration time (24.0 ± 1.05 s) and in vitro disintegration time in artificial salvia (22.5 ± 1.67 s). Physical stability studies at 40 °C/75% RH for 6 months, Fourier transform infrared spectroscopy analysis and X-ray diffraction results showed that the formulation was stable. The drug-released profile showed that 80% of donepezil hydrochloride was released within 1 min. A single-dose, fasting, four-period, seven-treatment, double-blinded study involving 16 healthy human volunteers was performed to evaluate the palatability of ODT. Formulation VII containing 10 mg of ammonium glycyrrhizinate was able to mask the bitter taste of the drug. The product has the potential to be commercialized and it might serve as solution for non-compliance among the Alzheimer's disease patients.

Reduction of alcohol induced sleep time in albino mice by potentized Nux vomica prepared with 90% ethanol.

PubMed

Sukul, A; Sinhabau, S P; Sukul, N C

1999-04-01

Male adult albino mice were administered potentized Nux vomica 30 c (Nux v). The drug was mixed with sterile distilled water at 0.05 ml/2 ml water and given at 0.05 ml/individual. Control consisted of blank ethanol solution. Ethanolic extract from the seeds of Strychnos nuxvomica L was mixed with 90% ethanol 1:100 and sonicated for 30 s at 20 KHz. This was further diluted and sonicated in 30 steps to produce Nux v 30 c. Six hours after treatment, mice were given 25% ethanol i.p. at 4 g/kg body wt. The duration of sleep time starting from the loss of righting reflex until its restoration was recorded for each mouse. The duration of sleep time with ethanol was recorded in four sessions for the same group of mice with an interval of 10 d between sessions. session 1 with control solution, 2 with Nux v (oral), 3 with control solution and 4 with Nux v (i.p.). Nux v (oral) produced the shortest sleep time as compared to other treatments which did not differ from each other significantly with respect to sleep time. In another experiment Nux v 30 c was prepared with distilled water and pure absolute ethanol by the above process of successive dilution and sonication. These two preparations together with Nux v 30 c, prepared with 90% ethanol, were tested on mice for their effect on alcohol-induced sleep time. Only Nux v 30 c prepared with 90% ethanol was effective in reducing the sleep time in mice. It is concluded that the solution structure of ethanol/water mixture carries the specificity of the Nux v at ultra high dilution. It is further concluded that the effect is mediated through oral receptors.

Relationship between the Prediction Accuracy of Tsunami Inundation and Relative Distribution of Tsunami Source and Observation Arrays: A Case Study in Tokyo Bay

NASA Astrophysics Data System (ADS)

Takagawa, T.

2017-12-01

A rapid and precise tsunami forecast based on offshore monitoring is getting attention to reduce human losses due to devastating tsunami inundation. We developed a forecast method based on the combination of hierarchical Bayesian inversion with pre-computed database and rapid post-computing of tsunami inundation. The method was applied to Tokyo bay to evaluate the efficiency of observation arrays against three tsunamigenic earthquakes. One is a scenario earthquake at Nankai trough and the other two are historic ones of Genroku in 1703 and Enpo in 1677. In general, rich observation array near the tsunami source has an advantage in both accuracy and rapidness of tsunami forecast. To examine the effect of observation time length we used four types of data with the lengths of 5, 10, 20 and 45 minutes after the earthquake occurrences. Prediction accuracy of tsunami inundation was evaluated by the simulated tsunami inundation areas around Tokyo bay due to target earthquakes. The shortest time length of accurate prediction varied with target earthquakes. Here, accurate prediction means the simulated values fall within the 95% credible intervals of prediction. In Enpo earthquake case, 5-minutes observation is enough for accurate prediction for Tokyo bay, but 10-minutes and 45-minutes are needed in the case of Nankai trough and Genroku, respectively. The difference of the shortest time length for accurate prediction shows the strong relationship with the relative distance from the tsunami source and observation arrays. In the Enpo case, offshore tsunami observation points are densely distributed even in the source region. So, accurate prediction can be rapidly achieved within 5 minutes. This precise prediction is useful for early warnings. Even in the worst case of Genroku, where less observation points are available near the source, accurate prediction can be obtained within 45 minutes. This information can be useful to figure out the outline of the hazard in an early stage of reaction.

Physics-based process modeling, reliability prediction, and design guidelines for flip-chip devices

NASA Astrophysics Data System (ADS)

Michaelides, Stylianos

Flip Chip on Board (FCOB) and Chip-Scale Packages (CSPs) are relatively new technologies that are being increasingly used in the electronic packaging industry. Compared to the more widely used face-up wirebonding and TAB technologies, flip-chips and most CSPs provide the shortest possible leads, lower inductance, higher frequency, better noise control, higher density, greater input/output (I/O), smaller device footprint and lower profile. However, due to the short history and due to the introduction of several new electronic materials, designs, and processing conditions, very limited work has been done to understand the role of material, geometry, and processing parameters on the reliability of flip-chip devices. Also, with the ever-increasing complexity of semiconductor packages and with the continued reduction in time to market, it is too costly to wait until the later stages of design and testing to discover that the reliability is not satisfactory. The objective of the research is to develop integrated process-reliability models that will take into consideration the mechanics of assembly processes to be able to determine the reliability of face-down devices under thermal cycling and long-term temperature dwelling. The models incorporate the time and temperature-dependent constitutive behavior of various materials in the assembly to be able to predict failure modes such as die cracking and solder cracking. In addition, the models account for process-induced defects and macro-micro features of the assembly. Creep-fatigue and continuum-damage mechanics models for the solder interconnects and fracture-mechanics models for the die have been used to determine the reliability of the devices. The results predicted by the models have been successfully validated against experimental data. The validated models have been used to develop qualification and test procedures for implantable medical devices. In addition, the research has helped develop innovative face-down devices without the underfill, based on the thorough understanding of the failure modes. Also, practical design guidelines for material, geometry and process parameters for reliable flip-chip devices have been developed.

Virtually assisted optical colonoscopy

NASA Astrophysics Data System (ADS)

Marino, Joseph; Qiu, Feng; Kaufman, Arie

2008-03-01

We present a set of tools used to enhance the optical colonoscopy procedure in a novel manner with the aim of improving both the accuracy and efficiency of this procedure. In order to better present the colon information to the gastroenterologist performing a conventional (optical) colonoscopy, we undistort the radial distortion of the fisheye view of the colonoscope. The radial distortion is modeled with a function that converts the fisheye view to the perspective view, where the shape and size of polyps can be more readily observed. The conversion, accelerated on the graphics processing unit and running in real-time, calculates the corresponding position in the fisheye view of each pixel on the perspective image. We also merge our previous work in computer-aided polyp detection for virtual colonoscopy into the optical colonoscopy environment. The physical colonoscope path in the optical colonoscopy is approximated with the hugging corner shortest path, which is correlated with the centerline in the virtual colonoscopy. With the estimated distance that the colonoscope has been inserted, we are able to provide the gastroenterologist with visual cues along the observation path as to the location of possible polyps found by the detection process. In order to present the information to the gastroenterologist in a non-intrusive manner, we have developed a friendly user interface to enhance the optical colonoscopy without being cumbersome, distracting, or resulting in a more lackadaisical inspection by the gastroenterologist.

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

Evolution of resource cycling in ecosystems and individuals.

PubMed

Crombach, Anton; Hogeweg, Paulien

2009-06-01

Resource cycling is a defining process in the maintenance of the biosphere. Microbial communities, ranging from simple to highly diverse, play a crucial role in this process. Yet the evolutionary adaptation and speciation of micro-organisms have rarely been studied in the context of resource cycling. In this study, our basic questions are how does a community evolve its resource usage and how are resource cycles partitioned? We design a computational model in which a population of individuals evolves to take up nutrients and excrete waste. The waste of one individual is another's resource. Given a fixed amount of resources, this leads to resource cycles. We find that the shortest cycle dominates the ecological dynamics, and over evolutionary time its length is minimized. Initially a single lineage processes a long cycle of resources, later crossfeeding lineages arise. The evolutionary dynamics that follow are determined by the strength of indirect selection for resource cycling. We study indirect selection by changing the spatial setting and the strength of direct selection. If individuals are fixed at lattice sites or direct selection is low, indirect selection result in lineages that structure their local environment, leading to 'smart' individuals and stable patterns of resource dynamics. The individuals are good at cycling resources themselves and do this with a short cycle. On the other hand, if individuals randomly change position each time step, or direct selection is high, individuals are more prone to crossfeeding: an ecosystem based solution with turbulent resource dynamics, and individuals that are less capable of cycling resources themselves. In a baseline model of ecosystem evolution we demonstrate different eco-evolutionary trajectories of resource cycling. By varying the strength of indirect selection through the spatial setting and direct selection, the integration of information by the evolutionary process leads to qualitatively different results from individual smartness to cooperative community structures.

Experimental evaluation of certification trails using abstract data type validation

NASA Technical Reports Server (NTRS)

Wilson, Dwight S.; Sullivan, Gregory F.; Masson, Gerald M.

1993-01-01

Certification trails are a recently introduced and promising approach to fault-detection and fault-tolerance. Recent experimental work reveals many cases in which a certification-trail approach allows for significantly faster program execution time than a basic time-redundancy approach. Algorithms for answer-validation of abstract data types allow a certification trail approach to be used for a wide variety of problems. An attempt to assess the performance of algorithms utilizing certification trails on abstract data types is reported. Specifically, this method was applied to the following problems: heapsort, Hullman tree, shortest path, and skyline. Previous results used certification trails specific to a particular problem and implementation. The approach allows certification trails to be localized to 'data structure modules,' making the use of this technique transparent to the user of such modules.

Consistent and powerful non-Euclidean graph-based change-point test with applications to segmenting random interfered video data.

PubMed

Shi, Xiaoping; Wu, Yuehua; Rao, Calyampudi Radhakrishna

2018-06-05

The change-point detection has been carried out in terms of the Euclidean minimum spanning tree (MST) and shortest Hamiltonian path (SHP), with successful applications in the determination of authorship of a classic novel, the detection of change in a network over time, the detection of cell divisions, etc. However, these Euclidean graph-based tests may fail if a dataset contains random interferences. To solve this problem, we present a powerful non-Euclidean SHP-based test, which is consistent and distribution-free. The simulation shows that the test is more powerful than both Euclidean MST- and SHP-based tests and the non-Euclidean MST-based test. Its applicability in detecting both landing and departure times in video data of bees' flower visits is illustrated.

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

Temperature controlled formation of lead/acid batteries

NASA Astrophysics Data System (ADS)

Bungardt, M.

At present, standard formation programs have to accommodate the worst case. This is important, especially in respect of variations in climatic conditions. The standard must be set so that during the hottest weather periods the maximum electrolyte temperature is not exceeded. As this value is defined not only by the desired properties and the recipe of the active mass, but also by type and size of the separators and by the dimensions of the plates, general rules cannot be formulated. It is considered to be advantageous to introduce limiting data for the maximum temperature into a general formation program. The latter is defined so that under normal to good ambient conditions the shortest formation time is achieved. If required, the temperature control will reduce the currents employed in the different steps, according to need, and will extend the formation time accordingly. With computer-controlled formation, these parameters can be readily adjusted to suit each type of battery and can also be reset according to modifications in the preceding processing steps. Such a procedure ensures that: (i) the formation time is minimum under the given ambient conditions; (ii) in the event of malpractice ( e.g. actual program not fitting to size) the batteries will not be destroyed; (iii) the energy consumption is minimized (note, high electrolyte temperature leads to excess gassing). These features are incorporated in the BA/FOS-500 battery formation system developed by Digatron. The operational characteristics of this system are listed in Table 1.

The waiting time problem in a model hominin population.

PubMed

Sanford, John; Brewer, Wesley; Smith, Franzine; Baumgardner, John

2015-09-17

Functional information is normally communicated using specific, context-dependent strings of symbolic characters. This is true within the human realm (texts and computer programs), and also within the biological realm (nucleic acids and proteins). In biology, strings of nucleotides encode much of the information within living cells. How do such information-bearing nucleotide strings arise and become established? This paper uses comprehensive numerical simulation to understand what types of nucleotide strings can realistically be established via the mutation/selection process, given a reasonable timeframe. The program Mendel's Accountant realistically simulates the mutation/selection process, and was modified so that a starting string of nucleotides could be specified, and a corresponding target string of nucleotides could be specified. We simulated a classic pre-human hominin population of at least 10,000 individuals, with a generation time of 20 years, and with very strong selection (50% selective elimination). Random point mutations were generated within the starting string. Whenever an instance of the target string arose, all individuals carrying the target string were assigned a specified reproductive advantage. When natural selection had successfully amplified an instance of the target string to the point of fixation, the experiment was halted, and the waiting time statistics were tabulated. Using this methodology we tested the effect of mutation rate, string length, fitness benefit, and population size on waiting time to fixation. Biologically realistic numerical simulations revealed that a population of this type required inordinately long waiting times to establish even the shortest nucleotide strings. To establish a string of two nucleotides required on average 84 million years. To establish a string of five nucleotides required on average 2 billion years. We found that waiting times were reduced by higher mutation rates, stronger fitness benefits, and larger population sizes. However, even using the most generous feasible parameters settings, the waiting time required to establish any specific nucleotide string within this type of population was consistently prohibitive. We show that the waiting time problem is a significant constraint on the macroevolution of the classic hominin population. Routine establishment of specific beneficial strings of two or more nucleotides becomes very problematic.

CW seeded optical parametric amplifier providing wavelength and pulse duration tunable nearly transform limited pulses.

PubMed

Hädrich, S; Gottschall, T; Rothhardt, J; Limpert, J; Tünnermann, A

2010-02-01

An optical parametric amplifier that delivers nearly transform limited pulses is presented. The center wavelength of these pulses can be tuned between 993 nm and 1070 nm and, at the same time, the pulse duration is varied between 206 fs and 650 fs. At the shortest pulse duration the pulse energy was increased up to 7.2 microJ at 50 kHz repetition rate. Variation of the wavelength is achieved by applying a tunable cw seed while the pulse duration can be varied via altering the pump pulse duration. This scheme offers superior flexibility and scaling possibilities.

Diode pumped CW and passively Q-switched Nd:LGGG laser at 1062 nm

NASA Astrophysics Data System (ADS)

Yang, H.; Jia, Z. T.; Zhang, B. T.; He, J. L.; Liu, S. D.; Yang, Y.; Tao, X. T.

2012-05-01

We report a Nd:LGGG laser at 1062 nm in the operations of the continuous-wave (CW) and passively Q-switching. The maximum CW output power of 5.62 W was obtained, corresponding to an optical-to-optical conversion efficiency of 49.0% and slope efficiency of 55.9%. By using Cr4+:YAG with initial transmission of 94% as the saturable absorber, for the first time, we got the maximum passively Q-switched output power of 1.21 W, accompanied with a highest pulse repetition rate of 27.1 kHz and a shortest pulse width of 9.1 ns.

Opioid withdrawal, craving, and use during and after outpatient buprenorphine stabilization and taper: a discrete survival and growth mixture model.

PubMed

Northrup, Thomas F; Stotts, Angela L; Green, Charles; Potter, Jennifer S; Marino, Elise N; Walker, Robrina; Weiss, Roger D; Trivedi, Madhukar

2015-02-01

Most patients relapse to opioids within one month of opioid agonist detoxification, making the antecedents and parallel processes of first use critical for investigation. Craving and withdrawal are often studied in relationship to opioid outcomes, and a novel analytic strategy applied to these two phenomena may indicate targeted intervention strategies. Specifically, this secondary data analysis of the Prescription Opioid Addiction Treatment Study used a discrete-time mixture analysis with time-to-first opioid use (survival) simultaneously predicted by craving and withdrawal growth trajectories. This analysis characterized heterogeneity among prescription opioid-dependent individuals (N=653) into latent classes (i.e., latent class analysis [LCA]) during and after buprenorphine/naloxone stabilization and taper. A 4-latent class solution was selected for overall model fit and clinical parsimony. In order of shortest to longest time-to-first use, the 4 classes were characterized as 1) high craving and withdrawal, 2) intermediate craving and withdrawal, 3) high initial craving with low craving and withdrawal trajectories and 4) a low initial craving with low craving and withdrawal trajectories. Odds ratio calculations showed statistically significant differences in time-to-first use across classes. Generally, participants with lower baseline levels and greater decreases in craving and withdrawal during stabilization combined with slower craving and withdrawal rebound during buprenorphine taper remained opioid-free longer. This exploratory work expanded on the importance of monitoring craving and withdrawal during buprenorphine induction, stabilization, and taper. Future research may allow individually tailored and timely interventions to be developed to extend time-to-first opioid use. Copyright © 2014 Elsevier Ltd. All rights reserved.

Open sun drying of green bean: influence of pretreatments on drying kinetics, colour and rehydration capacity

NASA Astrophysics Data System (ADS)

İsmail, Osman; Kantürk Figen, Aysel; Pişkin, Sabriye

2017-04-01

Green bean ( Phaseolus Vulgaris L), classified under legume family, is a primary source of dietary protein in human diets especially in the agricultural countries. Green bean is susceptible to rapid deterioration because of their high moisture content and in order to prevent and present the green bean drying process is applied. In this study, effects of pretreatments on drying kinetics, colour and rehydration capacity of green bean were investigated. It was observed that the pretreatment affected the drying time. The shortest drying times were obtained from pretreated samples with blanched. Drying times were determined as 47, 41 and 29 h for natural, salted and blanch, respectively. The results showed that pretreatment and ambient temperature significantly ( P = 0.05) affected the drying rate and the drying time. The effective moisture diffusivity was determined by using Fick's second law and was found to be range between 3.15 × 10-10 and 1.2 × 10-10 m2/s for the pre-treated and natural green bean samples. The rehydration values were obtained 2.75, 2.71, 2.29 (g water/g dry matter) for the blanched, salted and natural samples. The effective diffusion coefficients were calculated using the data collected during the falling rate period and the experimental data are fitted to seven thin layer drying models which found in the literature. The Logarithmic model was found to best describe the drying behavior of fresh green beans under open air sun. Rehydration time and color parameters had been determined in order to improve the quality of dried green bean. Regarding with rehydration time and colour data, the best results were obtained at blanched drying conditions.

Evidence for decay in verbal short-term memory: a commentary on Berman, Jonides, and Lewis (2009).

PubMed

Campoy, Guillermo

2012-07-01

M. G. Berman, J. Jonides, and R. L. Lewis (2009) adapted the recent-probes task to investigate the causes of forgetting in short-term memory. In 7 experiments, they studied the persistence of memory traces by assessing the level of proactive interference generated by previous-trial items over a range of intertrial intervals. None of the experiments found a reduction in proactive interference over time, which they interpreted as evidence against time-based decay. However, it is possible that decay actually occurred over a shorter time period than was tested in this study, wherein the shortest decay interval was 3,300 ms. By reducing the time scale, the 2 experiments reported in the current commentary revealed a sharp decrease in proactive interference over time, with this reduction reaching a plateau in less than 3 s. This pattern suggests that decay operates in the early stages, whereas subsequent forgetting is likely to be due to interference. 2012 APA, all rights reserved

Microalgal biohydrogen production considering light energy and mixing time as the two key features for scale-up.

PubMed

Oncel, S; Sabankay, M

2012-10-01

This study focuses on a scale-up procedure considering two vital parameters light energy and mixing for microalgae cultivation, taking Chlamydomonas reinhardtii as the model microorganism. Applying two stage hydrogen production protocol to 1L flat type and 2.5L tank type photobioreactors hydrogen production was investigated with constant light energy and mixing time. The conditions that provide the shortest transfer time to anaerobic culture (light energy; 2.96 kJ s(-1)m(-3) and mixing time; 1 min) and highest hydrogen production rate (light energy; 1.22 kJ s(-1)m(-3) and mixing time; 2.5 min) are applied to 5L photobioreactor. The final hydrogen production for 5L system after 192 h was measured as 195 ± 10 mL that is comparable with the other systems is a good validation for the scale-up procedure. Copyright © 2012 Elsevier Ltd. All rights reserved.

Measurement of Electromagnetic Properties of Lightning with 10 Nanosecond Resolution

NASA Technical Reports Server (NTRS)

Baum, C. E.; Breen, E. L.; Oneill, J. P.; Moore, C. B.; Hall, D. L.

1980-01-01

Electromagnetic data recorded from lightning strikes are presented. The data analysis reveals general characteristics of fast electromagnetic fields measured at the ground including rise times, amplitudes, and time patterns. A look at the electromagnetic structure of lightning shows that the shortest rise times in the vicinity of 30 ns are associated with leader leader streamers. Lightning location is based on electromagnetic field characteristics and is compared to a nearby sky camera. The fields from both leaders and return strokes were measured and are discussed. The data were obtained during 1978 and 1979 from lightning strikes occuring within 5 kilometers of an underground metal instrumentation room located on South Baldy peak near Langmuir Laboratory, New Mexico. The computer controlled instrumentation consisted of sensors previously used for measuring the nuclear electromagnetic pulse (EMP) and analog-digital recorders with 10 ns sampling, 256 levels of resolution, and 2 kilobytes of internal memory.

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.

Performance analysis of a laser propelled interorbital tansfer vehicle

NASA Technical Reports Server (NTRS)

Minovitch, M. A.

1976-01-01

Performance capabilities of a laser-propelled interorbital transfer vehicle receiving propulsive power from one ground-based transmitter was investigated. The laser transmits propulsive energy to the vehicle during successive station fly-overs. By applying a series of these propulsive maneuvers, large payloads can be economically transferred between low earth orbits and synchronous orbits. Operations involving the injection of large payloads onto escape trajectories are also studied. The duration of each successive engine burn must be carefully timed so that the vehicle reappears over the laser station to receive additional propulsive power within the shortest possible time. The analytical solution for determining these time intervals is presented, as is a solution to the problem of determining maximum injection payloads. Parameteric computer analysis based on these optimization studies is presented. The results show that relatively low beam powers, on the order of 50 MW to 60 MW, produce significant performance capabilities.

Polarization Sensitive Coherent Anti-Stokes Raman Spectroscopy of DCVJ in Doped Polymer

NASA Astrophysics Data System (ADS)

Ujj, Laszlo

2014-05-01

Coherent Raman Microscopy is an emerging technic and method to image biological samples such as living cells by recording vibrational fingerprints of molecules with high spatial resolution. The race is on to record the entire image during the shortest time possible in order to increase the time resolution of the recorded cellular events. The electronically enhanced polarization sensitive version of Coherent anti-Stokes Raman scattering is one of the method which can shorten the recording time and increase the sharpness of an image by enhancing the signal level of special molecular vibrational modes. In order to show the effectiveness of the method a model system, a highly fluorescence sample, DCVJ in a polymer matrix is investigated. Polarization sensitive resonance CARS spectra are recorded and analyzed. Vibrational signatures are extracted with model independent methods. Details of the measurements and data analysis will be presented. The author gratefully acknowledge the UWF for financial support.

Bias-induced modulation of ultrafast carrier dynamics in metallic single-walled carbon nanotubes

NASA Astrophysics Data System (ADS)

Maekawa, Keisuke; Yanagi, Kazuhiro; Minami, Yasuo; Kitajima, Masahiro; Katayama, Ikufumi; Takeda, Jun

2018-02-01

The gate bias dependence of excited-state relaxation dynamics in metallic single-walled carbon nanotubes (MCNTs) was investigated using pump-probe transient absorption spectroscopy coupled with electrochemical doping through an ionic liquid. The transient transmittance decayed exponentially with the pump-probe delay time, whose value could be tuned via the Fermi-level modulation of Dirac electrons under a bias voltage. The obtained relaxation time was the shortest when the Fermi level was at the Dirac point of the MCNTs, and exhibited a U-shaped dependence on the bias voltage. Because optical dipole transitions between the Dirac bands are forbidden in MCNTs, the observed dynamics were attributed to carrier relaxation from the E11 band to the Dirac band. Using a model that considers the suppression of electron-electron scattering (impact ionization) due to Pauli blocking, we could qualitatively explain the obtained bias dependence of the relaxation time.

The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems.

PubMed

Vickers, Douglas; Lee, Michael D; Dry, Matthew; Hughes, Peter

2003-10-01

The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour through a two-dimensional array of points. MacGregor and Ormerod (1996) have suggested that people solve such problems by using a global-to-local perceptual organizing process based on the convex hull of the array. We review evidence for and against this idea, before considering an alternative, local-to-global perceptual process, based on the rapid automatic identification of nearest neighbors. We compare these approaches in an experiment in which the effects of number of convex hull points and number of potential intersections on solution performance are measured. Performance worsened with more points on the convex hull and with fewer potential intersections. A measure of response uncertainty was unaffected by the number of convex hull points but increased with fewer potential intersections. We discuss a possible interpretation of these results in terms of a hierarchical solution process based on linking nearest neighbor clusters.

Small-world bias of correlation networks: From brain to climate

NASA Astrophysics Data System (ADS)

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

Small-world bias of correlation networks: From brain to climate.

PubMed

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

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.

Electrical cream separator coupled with vacuum filtration for the purification of eimerian oocysts and trichostronglyid eggs

NASA Astrophysics Data System (ADS)

El-Ashram, Saeed; Suo, Xun

2017-02-01

Several methods have been proposed for separation of eimerian oocysts and trichostronglyid eggs from extraneous debris; however, these methods have been considered to be still inconvenient in terms of time and wide-ranging applications. We describe herein an alternative way using the combination of electrical cream separator and vacuum filtration for harvesting and purifying eimerian oocysts and haemonchine eggs on large-scale applications with approximately 81% and 92% recovery rates for oocysts and nematode eggs obtained from avian and ovine faeces, correspondingly. The sporulation percentages as a measure of viability in the harvested oocysts and eggs from dry faecal materials are nearly 68% and 74%, respectively, and 12 liters of faecal suspension can be processed in approximately 7.5 min. The mode of separation in terms of costs (i.e. simple laboratory equipments and comparably cheap reagents) and benefits renders the reported procedure an appropriate pursuit to harvest and purify parasite oocysts and eggs on a large scale in the shortest duration from diverse volumes of environmental samples compared to the modified traditional sucrose gradient, which can be employed on a small scale.

Defect-free atomic array formation using the Hungarian matching algorithm

NASA Astrophysics Data System (ADS)

Lee, Woojun; Kim, Hyosub; Ahn, Jaewook

2017-05-01

Deterministic loading of single atoms onto arbitrary two-dimensional lattice points has recently been demonstrated, where by dynamically controlling the optical-dipole potential, atoms from a probabilistically loaded lattice were relocated to target lattice points to form a zero-entropy atomic lattice. In this atom rearrangement, how to pair atoms with the target sites is a combinatorial optimization problem: brute-force methods search all possible combinations so the process is slow, while heuristic methods are time efficient but optimal solutions are not guaranteed. Here, we use the Hungarian matching algorithm as a fast and rigorous alternative to this problem of defect-free atomic lattice formation. Our approach utilizes an optimization cost function that restricts collision-free guiding paths so that atom loss due to collision is minimized during rearrangement. Experiments were performed with cold rubidium atoms that were trapped and guided with holographically controlled optical-dipole traps. The result of atom relocation from a partially filled 7 ×7 lattice to a 3 ×3 target lattice strongly agrees with the theoretical analysis: using the Hungarian algorithm minimizes the collisional and trespassing paths and results in improved performance, with over 50% higher success probability than the heuristic shortest-move method.

Effects of annealing temperature on the H2-sensing properties of Pd-decorated WO3 nanorods

NASA Astrophysics Data System (ADS)

Lee, Sangmin; Lee, Woo Seok; Lee, Jae Kyung; Hyun, Soong Keun; Lee, Chongmu; Choi, Seungbok

2018-03-01

The temperature of the post-annealing treatment carried out after noble metal deposition onto semiconducting metal oxides (SMOs) must be carefully optimized to maximize the sensing performance of the metal-decorated SMO sensors. WO3 nanorods were synthesized by thermal evaporation of WO3 powders and decorated with Pd nanoparticles using a sol-gel method, followed by an annealing process. The effects of the annealing temperature on the hydrogen gas-sensing properties of the Pd-decorated WO3 nanorods were then examined; the optimal annealing temperature, leading to the highest response of the WO3 nanorod sensor to H2, was determined to be 600 °C. Post-annealing at 600 °C resulted in nanorods with the highest surface area-to-volume ratio, as well as in the optimal size and the largest number of deposited Pd nanoparticles, leading to the highest response and the shortest response/recovery times toward H2. The improved H2-sensing performance of the Pd-decorated WO3 nanorod sensor, compared to a sensor based on pristine WO3 nanorods, is attributed to the enhanced catalytic activity, increased surface area-to-volume ratio, and higher amounts of surface defects.

Self-Assemblies of novel molecules, VECAR

NASA Astrophysics Data System (ADS)

Shrestha, Bijay; Kim, Hye-Young; Lee, Soojin; Novak, Brian; Moldovan, Dorel

2015-03-01

VECAR is a newly synthesized molecule, which is an amphiphilic antioxidant molecule that consists of two molecular groups, vitamin-E and Carnosine, linked by a hydrocarbon chain. The hydrocarbon chain is hydrophobic and both vitamin-E and Carnosine ends are hydrophilic. In the synthesis process, the length of the hydrophobic chain of VECAR molecules can vary from the shortest (n =0) to the longest (n =18), where n indicates the number of carbon atoms in the chain. We conducted MD simulation studies of self-assembly of VECAR molecules in water using GROMACS on LONI HPC resources. Our study shows that there is a strong correlation between the shape and atomistic structure of the self-assembled nano-structures (SANs) and the chain-length (n) of VECAR molecules. We will report the results of data analyses including the atomistic structure of each SANs and the dynamic and energetic mechanisms of their formation as function of time. In summary, both VECAR molecules of chain-length n =18 and 9 form worm-like micelles, which may be used as a drug delivery system. This research is supported by the Louisiana Board of Regents-RCS Grant (LEQSF(2012-15)-RD-A-19).

Electrical cream separator coupled with vacuum filtration for the purification of eimerian oocysts and trichostronglyid eggs

PubMed Central

El-Ashram, Saeed; Suo, Xun

2017-01-01

Several methods have been proposed for separation of eimerian oocysts and trichostronglyid eggs from extraneous debris; however, these methods have been considered to be still inconvenient in terms of time and wide-ranging applications. We describe herein an alternative way using the combination of electrical cream separator and vacuum filtration for harvesting and purifying eimerian oocysts and haemonchine eggs on large-scale applications with approximately 81% and 92% recovery rates for oocysts and nematode eggs obtained from avian and ovine faeces, correspondingly. The sporulation percentages as a measure of viability in the harvested oocysts and eggs from dry faecal materials are nearly 68% and 74%, respectively, and 12 liters of faecal suspension can be processed in approximately 7.5 min. The mode of separation in terms of costs (i.e. simple laboratory equipments and comparably cheap reagents) and benefits renders the reported procedure an appropriate pursuit to harvest and purify parasite oocysts and eggs on a large scale in the shortest duration from diverse volumes of environmental samples compared to the modified traditional sucrose gradient, which can be employed on a small scale. PMID:28233853

Adaptation of cardiovascular system stent implants.

PubMed

Ostasevicius, Vytautas; Tretsyakou-Savich, Yahor; Venslauskas, Mantas; Bertasiene, Agne; Minchenya, Vladimir; Chernoglaz, Pavel

2018-06-27

Time-consuming design and manufacturing processes are a serious disadvantage when adapting human cardiovascular implants as they cause unacceptable delays after the decision to intervene surgically has been made. An ideal cardiovascular implant should have a broad range of characteristics such as strength, viscoelasticity and blood compatibility. The present research proposes the sequence of the geometrical adaptation procedures and presents their results. The adaptation starts from the identification of a person's current health status while performing abdominal aortic aneurysm (AAA) imaging, which is a point of departure for the mathematical model of a cardiovascular implant. The computerized tomography scan shows the patient-specific geometry parameters of AAA and helps to create a model using COMSOL Multiphysics software. The initial parameters for flow simulation are taken from the results of a patient survey. The simulation results allow choosing the available shape of an implant which ensures a non-turbulent flow. These parameters are essential for the design and manufacturing of an implant prototype which should be tested experimentally for the assurance that the mathematical model is adequate to a physical one. The article gives a focused description of competences and means that are necessary to achieve the shortest possible preparation of the adapted cardiovascular implant for the surgery.

The role of telomere dynamics in aging and cancer

NASA Astrophysics Data System (ADS)

Blagoev, Krastan; Goodwin, Edwin

2006-03-01

Telomere length changes are far more dynamic than previously thought. In addition to a gradual loss of ˜100 base pairs per telomere in each cell division, losses as well as gains may occur within a single cell cycle. We are investigating how telomere exchange, extension, and deletion affect the proliferative potential of telomerase-negative somatic cells. Experimental techniques are being devised to detect dynamic telomere processes and quantify both the frequency and length changes of each. In parallel, a ``dynamic telomere model'' is being used that incorporates telomere dynamics to study how the telomere size distribution evolves with time. This is an essential step towards understanding the role that telomere dynamics play in the normal aging of tissues and organisms. The model casts light on relationships not otherwise easily explained by a deterministic ``mitotic clock,'' or to what extent the shortest initial telomere determines the onset of senescence. We also expect to identify biomarkers that will correlate with aging better than average telomere length and to shed light on the transition to unlimited growth found in telomerase-negative tumor cells having the ALT (alternative lengthening of telomeres) phenotype, and to evaluate strategies to suppress the growth of these tumors.

Coevolution of Cooperation and Partner Rewiring Range in Spatial Social Networks

NASA Astrophysics Data System (ADS)

Khoo, Tommy; Fu, Feng; Pauls, Scott

2016-11-01

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than the graph distance, is an important and relevant aspect of the partner rewiring process. It thus remains largely unclear how individual partner rewiring range preference, local vs. global, emerges and affects cooperation. Here we explicitly address this issue using a coevolutionary model of cooperation and partner rewiring range preference in spatially embedded social networks. In contrast to local rewiring, global rewiring has no distance restriction but incurs a one-time cost upon establishing any long range link. We find that under a wide range of model parameters, global partner switching preference can coevolve with cooperation. Moreover, the resulting partner network is highly degree-heterogeneous with small average shortest path length while maintaining high clustering, thereby possessing small-world properties. We also discover an optimum availability of reputation information for the emergence of global cooperators, who form distant partnerships at a cost to themselves. From the coevolutionary perspective, our work may help explain the ubiquity of small-world topologies arising alongside cooperation in the real world.

Spatial access to residential care resources in Beijing, China

PubMed Central

2012-01-01

Background As the population is ageing rapidly in Beijing, the residential care sector is in a fast expansion process with the support of the municipal government. Understanding spatial accessibility to residential care resources by older people supports the need for rational allocation of care resources in future planning. Methods Based on population data and data on residential care resources, this study uses two Geographic Information System (GIS) based methods – shortest path analysis and a two-step floating catchment area (2SFCA) method to analyse spatial accessibility to residential care resources. Results Spatial accessibility varies as the methods and considered factors change. When only time distance is considered, residential care resources are more accessible in the central city than in suburban and exurban areas. If care resources are considered in addition to time distance, spatial accessibility is relatively poor in the central city compared to the northeast to southeast side of the suburban and exurban areas. The resources in the northwest to southwest side of the city are the least accessible, even though several hotspots of residential care resources are located in these areas. Conclusions For policy making, it may require combining various methods for a comprehensive analysis. The methods used in this study provide tools for identifying underserved areas in order to improve equity in access to and efficiency in allocation of residential care resources in future planning. PMID:22877360

Information Spread of Emergency Events: Path Searching on Social Networks

PubMed Central

Hu, Hongzhi; Wu, Tunan

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning. PMID:24600323

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms.

PubMed

Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin

2015-10-19

The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.

Process improvement of knives production in a small scale industry

NASA Astrophysics Data System (ADS)

Ananto, Gamawan; Muktasim, Irfan

2017-06-01

Small scale industry that produces several kinds of knive should increase its capacity due to the demand from the market. Qualitatively, this case study consisted of formulating the problems, collecting and analyzing the necessary data, and determining the possible recommendations for the improvement. While the current capacity is only 9 (nine), it is expected that 20 units of knife will produced per month. The processes sequence are: profiling (a), truing (b), beveling (c), heat treatment (d), polishing (e), assembly (f), sharpening (g) and finishing (h). The first process (a) is held by out-house vendor company while other steps from (b) to (g) are executed by in-house vendor. However, there is a high dependency upon the high skilled operator who executes the in -house processes that are mostly held manually with several unbalance successive tasks, where the processing time of one or two tasks require longer duration than others since the operation is merely relied on the operator's skill. The idea is the improvement or change of the profiling and beveling process. Due to the poor surface quality and suboptimal hardness resulted from the laser cut machine for profiling, it is considered to subst itute this kind of process with wire cut that is capable to obtain good surface quality with certain range levels of roughness. Through simple cutting experiments on the samples, it is expected that the generated surface quality is adequate to omit the truing process (b). In addition, the cutting experiments on one, two, and four test samples resulted the shortest time that was obtained through four pieces in one cut. The technical parameters were set according to the recommendation of machine standard as referred to samples condition such as thickness and path length that affect ed the rate of wear. Meanwhile, in order to guarantee the uniformity of knife angles that are formed through beveling process (c), a grinding fixture was created. This kind of tool diminishes the dependency upon the operator's skill as well. The main conclusions are: the substitution of laser cut with wire cut machine for the first task (a) could reduce the operation time from 60 to 39.26 minutes with good result of surface quality and the truing process (b) could be omitted; the additional grinding fixture in beveling process (c) is required and two workstations have to be assigned instead of one as in previous condition. They lead to improvements including the guarantee of the uniformity of knifes' angle, the reduction on the operators' skills dependency, the shortening of cycle time from 855 to 420 minutes, and the higher number of productivity from 9 units/month into 20units/month.

Depression among Parents Two to Six Years Following the Loss of a Child by Suicide: A Novel Prediction Model.

PubMed

Nyberg, Tommy; Hed Myrberg, Ida; Omerov, Pernilla; Steineck, Gunnar; Nyberg, Ullakarin

2016-01-01

Parents who lose a child by suicide have elevated risks of depression. No clinical prediction tools exist to identify which suicide-bereaved parents will be particularly vulnerable; we aimed to create a prediction model for long-term depression for this purpose. During 2009 and 2010 we collected data using a nationwide study-specific questionnaire among parents in Sweden who had lost a child aged 15-30 by suicide in years 2004-2007. Current depression was assessed with the Patient Health Questionnaire (PHQ-9) and a single question on antidepressant use. We considered 26 potential predictors assumed clinically assessable at the time of loss, including socio-economics, relationship status, history of psychological stress and morbidity, and suicide-related circumstances. We developed a novel prediction model using logistic regression with all subsets selection and stratified cross-validation. The model was assessed for classification performance and calibration, overall and stratified by time since loss. In total 666/915 (73%) participated. The model showed acceptable classification performance (adjusted area under the curve [AUC] = 0.720, 95% confidence interval [CI] 0.673-0.766), but performed classification best for those at shortest time since loss. Agreement between model-predicted and observed risks was fair, but with a tendency for underestimation and overestimation for individuals with shortest and longest time since loss, respectively. The identified predictors include female sex (odds ratio [OR] = 1.84); sick-leave (OR = 2.81) or unemployment (OR = 1.64); psychological premorbidity debuting during the last 10 years, before loss (OR = 3.64), or more than 10 years ago (OR = 4.96); suicide in biological relatives (OR = 1.54); with non-legal guardianship during the child's upbringing (OR = 0.48); and non-biological parenthood (OR = 0.22) found as protective. Our prediction model shows promising internal validity, but should be externally validated before application. Psychological premorbidity seems to be a prominent predictor of long-term depression among suicide-bereaved parents, and thus important for healthcare providers to assess.

The effects of sampling frequency on the climate statistics of the European Centre for Medium-Range Weather Forecasts

NASA Astrophysics Data System (ADS)

Phillips, Thomas J.; Gates, W. Lawrence; Arpe, Klaus

1992-12-01

The effects of sampling frequency on the first- and second-moment statistics of selected European Centre for Medium-Range Weather Forecasts (ECMWF) model variables are investigated in a simulation of "perpetual July" with a diurnal cycle included and with surface and atmospheric fields saved at hourly intervals. The shortest characteristic time scales (as determined by the e-folding time of lagged autocorrelation functions) are those of ground heat fluxes and temperatures, precipitation and runoff, convective processes, cloud properties, and atmospheric vertical motion, while the longest time scales are exhibited by soil temperature and moisture, surface pressure, and atmospheric specific humidity, temperature, and wind. The time scales of surface heat and momentum fluxes and of convective processes are substantially shorter over land than over oceans. An appropriate sampling frequency for each model variable is obtained by comparing the estimates of first- and second-moment statistics determined at intervals ranging from 2 to 24 hours with the "best" estimates obtained from hourly sampling. Relatively accurate estimation of first- and second-moment climate statistics (10% errors in means, 20% errors in variances) can be achieved by sampling a model variable at intervals that usually are longer than the bandwidth of its time series but that often are shorter than its characteristic time scale. For the surface variables, sampling at intervals that are nonintegral divisors of a 24-hour day yields relatively more accurate time-mean statistics because of a reduction in errors associated with aliasing of the diurnal cycle and higher-frequency harmonics. The superior estimates of first-moment statistics are accompanied by inferior estimates of the variance of the daily means due to the presence of systematic biases, but these probably can be avoided by defining a different measure of low-frequency variability. Estimates of the intradiurnal variance of accumulated precipitation and surface runoff also are strongly impacted by the length of the storage interval. In light of these results, several alternative strategies for storage of the EMWF model variables are recommended.

The Importance of Rotational Time-scales in Accretion Variability

NASA Astrophysics Data System (ADS)

Costigan, Gráinne; Vink, Joirck; Scholz, Aleks; Testi, Leonardo; Ray, Tom

2013-07-01

For the first few million years, one of the dominant sources of emission from a low mass young stellar object is from accretion. This process regulates the flow of material and angular moments from the surroundings to the central object, and is thought to play an important role in the definition of the long term stellar properties. Variability is a well documented attribute of accretion, and has been observed on time-scales of from days to years. However, where these variations come from is not clear. Th current model for accretion is magnetospheric accretion, where the stellar magnetic field truncates the disc, allowing the matter to flow from the disc onto the surface of the star. This model allows for variations in the accretion rate to come from many different sources, such as the magnetic field, the circumstellar disc and the interaction of the different parts of the system. We have been studying unbiased samples of accretors in order to identify the dominant time-scales and typical magnitudes of variations. In this way different sources of variations can be excluded and any missing physics in these systems identified. Through our previous work with the Long-term Accretion Monitoring Program (LAMP), we found 10 accretors in the ChaI region, whose variability is dominated by short term variations of 2 weeks. This was the shortest time period between spectroscopic observations which spanned 15 months, and rules out large scale processes in the disk as origins of this variability. On the basis of this study we have gone further to study the accretion signature H-alpha, over the time-scales of minutes and days in a set of Herbig Ae and T Tauri stars. Using the same methods as we used in LAMP we found the dominant time-scales of variations to be days. These samples both point towards rotation period of these objects as being an important time-scale for accretion variations. This allows us to indicate which are the most likely sources of these variations.

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.

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.

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.

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.

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.

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

PubMed Central

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds.

PubMed

Zhang, Dezhi; Wang, Xin; Li, Shuangyan; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.

Alternative RNA splicing of leucocyte tissue transglutaminase in coeliac disease.

PubMed

Arbildi, P; Sóñora, C; Del Río, N; Marqués, J M; Hernández, A

2018-05-01

Tissue transglutaminase is a ubiquitous and multifunctional protein that contributes to several processes such as apoptosis/survival, efferocytosis, inflammation and tissue repairing under physiological and pathological conditions. Several activities can be associated with well-established functional domains; in addition, four RNA alternative splice variants have been described, characterized by sequence divergences and residues deletion at the C-terminal domains. Tissue transglutaminase is recognized as the central player in the physiopathology of coeliac disease (CD) mainly through calcium-dependent enzymatic activities. It can be hypothesized that differential regulation of tissue transglutaminase splice variants expression in persons with CD contributes to pathology by altering the protein functionality. We characterized the expression pattern of RNA alternative splice variants by RT-PCR in peripheral cells from patients with CD under free gluten diet adhesion; we considered inflammatory parameters and specific antibodies as markers of the stage of disease. We found significant higher expression of both the full length and the shortest C-truncated splice variants in leucocytes from patients with CD in comparison with healthy individuals. As tissue transglutaminase expression and canonical enzymatic activity are linked to inflammation, we studied the RNA expression of inflammatory cytokines in peripheral leucocytes of persons with CD in relation with splice variants expression; interestingly, we found that recently diagnosed patients showed significant correlation between both the full length and the shortest alternative spliced variants with IL-1 expression. Our results points that regulation of alternative splicing of tissue transglutaminase could account for the complex physiopathology of CD. © 2018 The Foundation for the Scandinavian Journal of Immunology.

Using Planetarium Programs to Teach Climate Change

NASA Astrophysics Data System (ADS)

Reiff, P. H.; Sumners, C.; Handron, K.

2007-12-01

By creating engaging and entertaining fulldome immersive planetarium shows, we are able to "sneak the science in", teaching about climate change on short, long, and extremely long time scales. In our show "Force 5", we talk about the shortest times: not really climate, but weather, including hurricanes, tornadoes, and space storms. Our show "Night of the Titanic" extends the time line to include changes in ocean currents, glaciers, and icebergs on decadal time periods, associated with global warming and changes in the sun. Our show "Dinosaur Prophecy" uses four dinosaur death sites to investigate the long-term changes or events that caused their demise. And finally, in "Lucy's Cradle: the Birth of Wonder" we investigate very long-term changes that spurred human development and migration. In this paper we discuss the techniques of creating planetarium shows and the "Discovery Dome" outreach network which has grown from six sites to 30 sites in 15 states and 7 countries. If space allows, we will demonstrate the shows in a portable dome in the poster session.

Improved Results for Route Planning in Stochastic Transportation Networks

NASA Technical Reports Server (NTRS)

Boyan, Justin; Mitzenmacher, Michael

2000-01-01

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Planification de trajectoires pour une flotte d'UAVs

NASA Astrophysics Data System (ADS)

Ait El Cadi, Abdessamad

In this thesis we address the problem of coordinating and controlling a fleet of Unmanned Aerial Vehicles (UAVs) during a surveillance mission in a dynamic context. The problem is vast and is related to several scientific domains. We have studied three important parts of this problem: • modeling the ground with all its constraints; • computing a shortest non-holonomic continuous path in a risky environment with a presence of obstacles; • planning a surveillance mission for a fleet of UAVs in a real context. While investigating the scientific literature related to these topics, we have detected deficiencies in the modeling of the ground and in the computation of the shortest continuous path, two critical aspects for the planning of a mission. So after the literature review, we have proposed answers to these two aspects and have applied our developments to the planning of a mission of a fleet of UAVs in a risky environment with the presence of obstacles. Obstacles could be natural like mountain or any non flyable zone. We have first modeled the ground as a directed graph. However, instead of using a classic mesh, we opted for an intelligent modeling that reduces the computing time on the graph without losing accuracy. The proposed model is based on the concept of visibility graph, and it also takes into account the obstacles, the danger areas and the constraint of non-holonomy of the UAVs- the kinematic constraint of the planes that imposes a maximum steering angle. The graph is then cleaned to keep only the minimum information needed for the calculation of trajectories. The generation of this graph possibly requires a lot of computation time, but it is done only once before the planning and will not affect the performance of trajectory calculations. We have also developed another simpler graph that does not take into account the constraint of non-holonomy. The advantage of this second graph is that it reduces the computation time. However, it requires the use of a correction procedure to make the resulting trajectory non-holonomic. This correction is possible within the context of our missions, but not for all types of autonomous vehicles. Once the directed graph is generated, we propose the use of a procedure for calculating the shortest continuous non-holonomic path in a risky environment with the presence of obstacles. The directed graph already incorporates all the constraints, which makes it possible to model the problem as a shortest path problem with resource a resource constraint (the resource here is the amount of permitted risk). The results are very satisfactory since the resulting routes are non-holonomic paths that meet all constraints. Moreover, the computing time is very short. For cases based on the simpler graph, we have created a procedure for correcting the trajectory to make it non-holonomic. All calculations of non-holonomy are based on Dubins curves (1957). We have finally applied our results to the planning of a mission of a fleet of UAVs in a risky environment with the presence of obstacles. For this purpose, we have developed a directed multi-graph where, for each pair of targets (points of departure and return of the mission included), we calculate a series of shorter trajectories with different limits of risk -- from the risk-free path to the riskiest path. We then use a Tabu Search with two tabu lists. Using these procedures, we have been able to produce routes for a fleet of UAVs that minimize the cost of the mission while respecting the limit of risk and avoiding obstacles. Tests are conducted on examples created on the basis of descriptions given by the Canadian Defense and, also on some instances of the CVRP (Capacitated Vehicle Routing Problem), those described by Christofides et Elion and those described by Christofides, Mingozzi et Toth. The results are of very satisfactory since all trajectories are non-holonomic and the improvement of the objective, when compared to a simple constructive method, achieves in some cases between 10 % and 43 %. We have even obtained an improvement of 69 %, but on a poor solution generated by a greedy algorithm. (Abstract shortened by UMI.)

Evaluating the effect of human activity patterns on air pollution exposure using an integrated field-based and agent-based modelling framework

NASA Astrophysics Data System (ADS)

Schmitz, Oliver; Beelen, Rob M. J.; de Bakker, Merijn P.; Karssenberg, Derek

2015-04-01

Constructing spatio-temporal numerical models to support risk assessment, such as assessing the exposure of humans to air pollution, often requires the integration of field-based and agent-based modelling approaches. Continuous environmental variables such as air pollution are best represented using the field-based approach which considers phenomena as continuous fields having attribute values at all locations. When calculating human exposure to such pollutants it is, however, preferable to consider the population as a set of individuals each with a particular activity pattern. This would allow to account for the spatio-temporal variation in a pollutant along the space-time paths travelled by individuals, determined, for example, by home and work locations, road network, and travel times. Modelling this activity pattern requires an agent-based or individual based modelling approach. In general, field- and agent-based models are constructed with the help of separate software tools, while both approaches should play together in an interacting way and preferably should be combined into one modelling framework, which would allow for efficient and effective implementation of models by domain specialists. To overcome this lack in integrated modelling frameworks, we aim at the development of concepts and software for an integrated field-based and agent-based modelling framework. Concepts merging field- and agent-based modelling were implemented by extending PCRaster (http://www.pcraster.eu), a field-based modelling library implemented in C++, with components for 1) representation of discrete, mobile, agents, 2) spatial networks and algorithms by integrating the NetworkX library (http://networkx.github.io), allowing therefore to calculate e.g. shortest routes or total transport costs between locations, and 3) functions for field-network interactions, allowing to assign field-based attribute values to networks (i.e. as edge weights), such as aggregated or averaged concentration values. We demonstrate the approach by using six land use regression (LUR) models developed in the ESCAPE (European Study of Cohorts for Air Pollution Effects) project. These models calculate several air pollutants (e.g. NO2, NOx, PM2.5) for the entire Netherlands at a high (5 m) resolution. Using these air pollution maps, we compare exposure of individuals calculated at their x, y location of their home, their work place, and aggregated over the close surroundings of these locations. In addition, total exposure is accumulated over daily activity patterns, summing exposure at home, at the work place, and while travelling between home and workplace, by routing individuals over the Dutch road network, using the shortest route. Finally, we illustrate how routes can be calculated with the minimum total exposure (instead of shortest distance).

Research on strategy and optimization method of PRT empty vehicles resource allocation based on traffic demand forecast

NASA Astrophysics Data System (ADS)

Xiang, Yu; Tao, Cheng

2018-05-01

During the operation of the personal rapid transit system(PRT), the empty vehicle resources is distributed unevenly because of different passenger demand. In order to maintain the balance between supply and demand, and to meet the passenger needs of the ride, PRT empty vehicle resource allocation model is constructed based on the future demand forecasted by historical demand in this paper. The improved genetic algorithm is implied in distribution of the empty vehicle which can reduce the customers waiting time and improve the operation efficiency of the PRT system so that all passengers can take the PRT vehicles in the shortest time. The experimental result shows that the improved genetic algorithm can allocate the empty vehicle from the system level optimally, and realize the distribution of the empty vehicle resources reasonably in the system.

Differences in duration of eye fixation for conditions in a numerical stroop-effect experiment.

PubMed

Crespo, Antonio; Cabestrero, Raúl; Quirós, Pilar

2009-02-01

Durations of eye fixation were recorded for a numerical Stroop effect experiment. Participants (6 men, 19 women; M age=22 yr.) reported the number of characters present in sequences of variable length (2 to 5 characters) while attempting to ignore the identity of the character. Three conditions were included: congruent (the number of characters and the numeral were matched, e.g., responding "two" to 22), incongruent (the number of characters and the numeral were mismatched, e.g., responding "two" to 55), and control (baseline of stimuli made up of "X"s, e.g., responding "two" to XX). Comparisons among the three conditions produced the longest response times and average durations of fixation for the incongruent condition. The shortest response times and average durations of fixation were obtained for the congruent condition.

Survival of Anisakis simplex in arrowtooth flounder (Atheresthes stomia) during frozen storage.

PubMed

Adams, Ann M; Ton, My N; Wekell, Marleen M; MacKenzie, Alan P; Dong, Faye M

2005-07-01

Survival of naturally occurring larvae of Anisakis simplex in fresh arrowtooth flounder (Atheresthes stomia) was determined after storage for specified periods at four freezing temperatures. All larvae were killed by 96, 60, 12, and 9 h at temperatures of -15, -20, -30, and -40 degrees C, respectively. The average percentages of live larvae per fillet at the next shortest holding time were as follows: 72 h at -15 degrees C, 0 to 3%; 48 h at -20 degrees C, 11 to 30%; 9 h at -30 degrees C, 5%; and 6 h at -40 degrees C, 0 to 3%. Larval survival was directly related to fillet thickness or weight (P < or = 0.05). Larval death was directly correlated to freezing temperatures. Holding time necessary to kill larval nematodes decreased as storage temperature decreased.

[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.

Optimizing Mars Airplane Trajectory with the Application Navigation System

NASA Technical Reports Server (NTRS)

Frumkin, Michael; Riley, Derek

2004-01-01

Planning complex missions requires a number of programs to be executed in concert. The Application Navigation System (ANS), developed in the NAS Division, can execute many interdependent programs in a distributed environment. We show that the ANS simplifies user effort and reduces time in optimization of the trajectory of a martian airplane. We use a software package, Cart3D, to evaluate trajectories and a shortest path algorithm to determine the optimal trajectory. ANS employs the GridScape to represent the dynamic state of the available computer resources. Then, ANS uses a scheduler to dynamically assign ready task to machine resources and the GridScape for tracking available resources and forecasting completion time of running tasks. We demonstrate system capability to schedule and run the trajectory optimization application with efficiency exceeding 60% on 64 processors.

Artificial night lighting inhibits feeding in moths

PubMed Central

van Grunsven, Roy H. A.; Veenendaal, Elmar M.

2017-01-01

One major, yet poorly studied, change in the environment is nocturnal light pollution, which strongly alters habitats of nocturnally active species. Artificial night lighting is often considered as driving force behind rapid moth population declines in severely illuminated countries. To understand these declines, the question remains whether artificial light causes only increased mortality or also sublethal effects. We show that moths subjected to artificial night lighting spend less time feeding than moths in darkness, with the shortest time under light conditions rich in short wavelength radiation. These findings provide evidence for sublethal effects contributing to moth population declines. Because effects are strong under various types of light compared with dark conditions, the potential of spectral alterations as a conservation tool may be overestimated. Therefore, restoration and maintenance of darkness in illuminated areas is essential for reversing declines of moth populations. PMID:28250209

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.

Extraction of actionable information from crowdsourced disaster data.

PubMed

Kiatpanont, Rungsun; Tanlamai, Uthai; Chongstitvatana, Prabhas

Natural disasters cause enormous damage to countries all over the world. To deal with these common problems, different activities are required for disaster management at each phase of the crisis. There are three groups of activities as follows: (1) make sense of the situation and determine how best to deal with it, (2) deploy the necessary resources, and (3) harmonize as many parties as possible, using the most effective communication channels. Current technological improvements and developments now enable people to act as real-time information sources. As a result, inundation with crowdsourced data poses a real challenge for a disaster manager. The problem is how to extract the valuable information from a gigantic data pool in the shortest possible time so that the information is still useful and actionable. This research proposed an actionable-data-extraction process to deal with the challenge. Twitter was selected as a test case because messages posted on Twitter are publicly available. Hashtag, an easy and very efficient technique, was also used to differentiate information. A quantitative approach to extract useful information from the tweets was supported and verified by interviews with disaster managers from many leading organizations in Thailand to understand their missions. The information classifications extracted from the collected tweets were first performed manually, and then the tweets were used to train a machine learning algorithm to classify future tweets. One particularly useful, significant, and primary section was the request for help category. The support vector machine algorithm was used to validate the results from the extraction process of 13,696 sample tweets, with over 74 percent accuracy. The results confirmed that the machine learning technique could significantly and practically assist with disaster management by dealing with crowdsourced data.

Tidal flushing time of marine fish culture zones in Hong Kong

NASA Astrophysics Data System (ADS)

Mao, Jing-Qiao; Wong, Ken T. M.; Lee, Joseph H. W.; Choi, K. W.

2011-12-01

Accurate determination of flushing time is crucial for maintaining sustainable production in fish culture zones (FCZs), as it represents the physical self-purification capability via tidal exchange with clean water in the outer sea. However, owing to the temporal and spatial complexity of the coastal flushing process, existing methods for determining flushing time may not be generally applicable. In this paper, a systematic method for determining the flushing time in FCZs is presented, in which bathymetry, runoff, tidal range and stratification are properly accounted for. We determine the flushing time via numerical tracer experiments, using robust 3D hydrodynamic and mass transport models. For FCZs located in sheltered and land-locked tidal inlets, the system boundary can be naturally defined at the connection with the open sea. For FCZs located in open waters, hydrodynamic tracking is first used to assess the extent of tidal excursion and thus delimit the initial boundary between clean water and polluted water. This general method is applied to all designated marine FCZs in Hong Kong for both the dry and wet seasons, including 20 sheltered FCZs (in semi-enclosed waters of Tolo Harbour, Mirs Bay, and Port Shelter) and 6 FCZs in open waters. Our results show that flushing time is the longest in inner Port Shelter (about 40 days in dry season), and the shortest for the FCZs in open waters (less than one week in dry season). In addition, the flushing time in dry season is commonly longer than that in wet season: 20%˜40% for most well-sheltered FCZs; 2.6˜4 times for the others. Our results indicate a positive correlation between the flushing time and distance to open boundary, supporting the view that the flushing time of a FCZ is closely related to its location. This study provides a solid basis for mariculture management such as the determination of carrying capacity of FCZs.

A novel comparator featured with input data characteristic

NASA Astrophysics Data System (ADS)

Jiang, Xiaobo; Ye, Desheng; Xu, Xiangmin; Zheng, Shuai

2016-03-01

Two types of low-power asynchronous comparators featured with input data statistical characteristic are proposed in this article. The asynchronous ripple comparator stops comparing at the first unequal bit but delivers the result to the least significant bit. The pre-stop asynchronous comparator can completely stop comparing and obtain results immediately. The proposed and contrastive comparators were implemented in SMIC 0.18 μm process with different bit widths. Simulation shows that the proposed pre-stop asynchronous comparator features the lowest power consumption, shortest average propagation delay and highest area efficiency among the comparators. Data path of low-density parity check decoder using the proposed pre-stop asynchronous comparators are most power efficient compared with other data paths with synthesised, clock gating and bitwise competition logic comparators.

[Professor SONG Nanchang's experience for treatment of peripheral facial paralysis].

PubMed

He, Yong; Pan, Hao; Xu, Hanbin

2015-06-01

Professor SONG Nanchang's clinical experience and characteristics for treatment of peripheral facial paralysis are introduced. In clinical treatment, professor SONG has adopted staging treatment strategy, and performed acupuncture stimulation with different levels. He attaches great importance to the acupoint selection on distal limbs. For the treatment on the face, he takes temperature as necessity; he inherits from famous Chinese doctor ZONG Ruilin's acupuncture technique of slow-twisting and gentle-pressing. Meanwhile, he excels in combination, of different therapies, using acupuncture, moxibustion, electroacupuncture, auricular point sticking, Chinese herbal medicine, etc. according to individual condition and disease stages. He also emphasizes on psychological counseling and daily life care to achieve rehabilitation within the shortest time.

The new eclipsing magnetic binary system E 1114 + 182

NASA Technical Reports Server (NTRS)

Biermann, P.; Schmidt, G. D.; Liebert, J.; Tapia, S.; Strittmatter, P. A.; West, S.; Stockman, H. S.; Kuehr, H.; Lamb, D. Q.

1985-01-01

A comprehensive analysis of E 1114 + 182, the first eclipsing AM Herculis binary system and the shortest-period eclipsing cataclysmic variable known, is presented. The time-resolved X-ray observations which led to the system's recognition as an AM Her system with a roughly 90 minute orbital period are reported. The current optical photometric and polarimetric ephemeris and a description of the system's phase-modulated properties are given. The detailed photometric eclipse profile and the highly variable spectroscopic behavior are addressed. This information is used to determine systemic parameters and derive new information on the line emission regions. The data put severe constraints on current torque models for keeping the binary and white dwarf rotation in phase.

An Energy-Efficient Target-Tracking Strategy for Mobile Sensor Networks.

PubMed

Mahboubi, Hamid; Masoudimansour, Walid; Aghdam, Amir G; Sayrafian-Pour, Kamran

2017-02-01

In this paper, an energy-efficient strategy is proposed for tracking a moving target in an environment with obstacles, using a network of mobile sensors. Typically, the most dominant sources of energy consumption in a mobile sensor network are sensing, communication, and movement. The proposed algorithm first divides the field into a grid of sufficiently small cells. The grid is then represented by a graph whose edges are properly weighted to reflect the energy consumption of sensors. The proposed technique searches for near-optimal locations for the sensors in different time instants to route information from the target to destination, using a shortest path algorithm. Simulations confirm the efficacy of the proposed algorithm.

CW and passively Q-switched laser performance of Nd:Lu2SiO5 crystal

NASA Astrophysics Data System (ADS)

Xu, Xiaodong; Di, Juqing; Zhang, Jian; Tang, Dingyuan; Xu, Jun

2016-01-01

We demonstrated an efficient and controllable dual-wavelength continuous-wave (CW) laser of Nd:Lu2SiO5 (Nd:LSO) crystal. The maximum output power was 3.02 W at wavelength of 1075 nm and 1079 nm, and with increasing of absorbed pump power, the ratio of 1079 nm laser rose. The slope efficiency of 65.6% and optical-to-optical conversion efficiency of 63.3% were obtained. The passively Q-switched laser properties of Nd:LSO were investigated for the first time. The shortest pulse, maximum pulse energy and peak power were 11.58 ns, 29.05 μJ and 2.34 kW, respectively.

152 fs nanotube-mode-locked thulium-doped all-fiber laser

PubMed Central

Wang, Jinzhang; Liang, Xiaoyan; Hu, Guohua; Zheng, Zhijian; Lin, Shenghua; Ouyang, Deqin; Wu, Xu; Yan, Peiguang; Ruan, Shuangchen; Sun, Zhipei; Hasan, Tawfique

2016-01-01

Ultrafast fiber lasers with broad bandwidth and short pulse duration have a variety of applications, such as ultrafast time-resolved spectroscopy and supercontinuum generation. We report a simple and compact all-fiber thulium-doped femtosecond laser mode-locked by carbon nanotubes. The oscillator operates in slightly normal cavity dispersion at 0.055 ps2, and delivers 152 fs pulses with 52.8 nm bandwidth and 0.19 nJ pulse energy. This is the shortest pulse duration and the widest spectral width demonstrated from Tm-doped all-fiber lasers based on 1 or 2 dimensional nanomaterials, underscoring their growing potential as versatile saturable absorber materials. PMID:27374764

Bright and ultra-fast scintillation from a semiconductor?

PubMed Central

Derenzo, Stephen E.; Bourret-Courshesne, Edith; Bizarri, Gregory; Canning, Andrew

2015-01-01

Semiconductor scintillators are worth studying because they include both the highest luminosities and shortest decay times of all known scintillators. Moreover, many semiconductors have the heaviest stable elements (Tl, Hg, Pb, Bi) as a major constituent and a high ion pair yield that is proportional to the energy deposited. We review the scintillation properties of semiconductors activated by native defects, isoelectronic impurities, donors and acceptors with special emphasis on those that have exceptionally high luminosities (e.g. ZnO:Zn, ZnS:Ag,Cl, CdS:Ag,Cl) and those that have ultra-fast decay times (e.g. ZnO:Ga; CdS:In). We discuss underlying mechanisms that are consistent with these properties and the possibilities for achieving (1) 200,000 photons/MeV and 1% fwhm energy resolution for 662 keV gamma rays, (2) ultra-fast (ns) decay times and coincident resolving times of 30 ps fwhm for time-of-flight positron emission tomography, and (3) both a high luminosity and an ultra-fast decay time from the same scintillator at cryogenic temperatures. PMID:26855462

Sorting signed permutations by inversions in O(nlogn) time.

PubMed

Swenson, Krister M; Rajan, Vaibhav; Lin, Yu; Moret, Bernard M E

2010-03-01

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inversions, improved algorithms have been designed, culminating with an optimal linear-time algorithm for computing the inversion distance and a subquadratic algorithm for providing a shortest sequence of inversions--also known as sorting by inversions. Remaining open was the question of whether sorting by inversions could be done in O(nlogn) time. In this article, we present a qualified answer to this question, by providing two new sorting algorithms, a simple and fast randomized algorithm and a deterministic refinement. The deterministic algorithm runs in time O(nlogn + kn), where k is a data-dependent parameter. We provide the results of extensive experiments showing that both the average and the standard deviation for k are small constants, independent of the size of the permutation. We conclude (but do not prove) that almost all signed permutations can be sorted by inversions in O(nlogn) time.

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...