Path Planning and Navigation for Mobile Robots in a Hybrid Sensor Network without Prior Location Information

Directory of Open Access Journals (Sweden)

Zheng Zhang

2013-03-01

Full Text Available In a hybrid wireless sensor network with mobile and static nodes, which have no prior geographical knowledge, successful navigation for mobile robots is one of the main challenges. In this paper, we propose two novel navigation algorithms for outdoor environments, which permit robots to travel from one static node to another along a planned path in the sensor field, namely the RAC and the IMAP algorithms. Using this, the robot can navigate without the help of a map, GPS or extra sensor modules, only using the received signal strength indication (RSSI and odometry. Therefore, our algorithms have the advantage of being cost-effective. In addition, a path planning algorithm to schedule mobile robots' travelling paths is presented, which focuses on shorter distances and robust paths for robots by considering the RSSI-Distance characteristics. The simulations and experiments conducted with an autonomous mobile robot show the effectiveness of the proposed algorithms in an outdoor environment.

Video distribution system cost model

Science.gov (United States)

Gershkoff, I.; Haspert, J. K.; Morgenstern, B.

1980-01-01

A cost model that can be used to systematically identify the costs of procuring and operating satellite linked communications systems is described. The user defines a network configuration by specifying the location of each participating site, the interconnection requirements, and the transmission paths available for the uplink (studio to satellite), downlink (satellite to audience), and voice talkback (between audience and studio) segments of the network. The model uses this information to calculate the least expensive signal distribution path for each participating site. Cost estimates are broken downy by capital, installation, lease, operations and maintenance. The design of the model permits flexibility in specifying network and cost structure.

Teleconnection Paths via Climate Network Direct Link Detection.

Science.gov (United States)

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

Zero-Slack, Noncritical Paths

Science.gov (United States)

Simons, Jacob V., Jr.

2017-01-01

The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

Solving a Class of Spatial Reasoning Problems: Minimal-Cost Path Planning in the Cartesian Plane.

Science.gov (United States)

1987-06-01

as in Figure 72. By the Theorem of Pythagoras : Z1 <a z 2 < C Yl(bl+b 2)uI, the cost of going along (a,b,c) is greater that the...preceding lemmas to an indefinite number of boundary-crossing episodes is accomplished by the following theorems . Theorem 1 extends the result of Lemma 1... Theorem 1: Any two Snell’s-law paths within a K-explored wedge defined by Snell’s-law paths RL and R. do not intersect within the K-explored portion of

The same-location cost is unrelated to attentional settings: an object-updating account.

Science.gov (United States)

Carmel, Tomer; Lamy, Dominique

2014-08-01

What mechanisms allow us to ignore salient yet irrelevant visual information has been a matter of intense debate. According to the contingent-capture hypothesis, such information is filtered out, whereas according to the salience-based account, it captures attention automatically. Several recent studies have reported a same-location cost that appears to fit neither of these accounts. These showed that responses may actually be slower when the target appears at the location just occupied by an irrelevant singleton distractor. Here, we investigated the mechanisms underlying this same-location cost. Our findings show that the same-location cost is unrelated to automatic attentional capture or strategic setting of attentional priorities, and therefore invalidate the feature-based inhibition and fast attentional disengagement accounts of this effect. In addition, we show that the cost is wiped out when the cue and target are not perceived as parts of the same object. We interpret these findings as indicating that the same-location cost has been previously misinterpreted by both bottom-up and top-down theories of attentional capture. We propose that it is better understood as a consequence of object updating, namely, as the cost of updating the information stored about an object when this object changes across time.

Impacts of facility size and location decisions on ethanol production cost

International Nuclear Information System (INIS)

Kocoloski, Matt; Michael Griffin, W.; Scott Matthews, H.

2011-01-01

Cellulosic ethanol has been identified as a promising alternative to fossil fuels to provide energy for the transportation sector. One of the obstacles cellulosic ethanol must overcome in order to contribute to transportation energy demand is the infrastructure required to produce and distribute the fuel. Given a nascent cellulosic ethanol industry, locating cellulosic ethanol refineries and creating the accompanying infrastructure is essentially a greenfield problem that may benefit greatly from quantitative analysis. This study models cellulosic ethanol infrastructure investment using a mixed integer program (MIP) that locates ethanol refineries and connects these refineries to the biomass supplies and ethanol demands in a way that minimizes the total cost. For the single- and multi-state regions examined in this study, larger facilities can decrease ethanol costs by $0.20-0.30 per gallon, and placing these facilities in locations that minimize feedstock and product transportation costs can decrease ethanol costs by up to $0.25 per gallon compared to uninformed placement that could result from influences such as local subsidies to encourage economic development. To best benefit society, policies should allow for incentives that encourage these low-cost production scenarios and avoid politically motivated siting of plants. - Research highlights: → Mixed-integer programming can be used to model ethanol infrastructure investment. → Large cellulosic ethanol facilities can decrease production cost by $0.20/gallon. → Optimized facility placement can save $0.25/gallon.

A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time

Directory of Open Access Journals (Sweden)

Wen-Xiang Wu

2014-01-01

Full Text Available The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.

Tool path in torus tool CNC machining

Directory of Open Access Journals (Sweden)

XU Ying

2016-10-01

Full Text Available This paper is about tool path in torus tool CNC machining.The mathematical model of torus tool is established.The tool path planning algorithm is determined through calculation of the cutter location,boundary discretization,calculation of adjacent tool path and so on,according to the conversion formula,the cutter contact point will be converted to the cutter location point and then these points fit a toolpath.Lastly,the path planning algorithm is implemented by using Matlab programming.The cutter location points for torus tool are calculated by Matlab,and then fit these points to a toolpath.While using UG software,another tool path of free surface is simulated of the same data.It is drew compared the two tool paths that using torus tool is more efficient.

Approximation algorithms for facility location problems with discrete subadditive cost functions

NARCIS (Netherlands)

Gabor, A.F.; van Ommeren, Jan C.W.

2005-01-01

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\epsilon,1)$- reduction of the

The effect of solar and lunar currents on simultaneous phase path, group path and amplitude measurements

International Nuclear Information System (INIS)

Baulch, R.N.E.; Butcher, E.C.

1984-01-01

The solar and lunar variations in the phase path, group path and amplitude of a fixed frequency transmission were obtained at the September equinox over a slightly oblique path. The phase of the lunar semi-diurnal tide in the phase path and amplitude were similar, the maxima occurring near 0200 lunar time, whereas the group path had a maximum near 0800 lunar time. These results were compared with other results obtained near the same location. The results suggest a complex situation in the E-region, where the height of the lunar current depends on season, and also suggest that the location and distribution of the solar and lunar currents may be different. (author)

A Low-Cost Collaborative Location Scheme with GNSS and RFID for the Internet of Things

Directory of Open Access Journals (Sweden)

Changfeng Jing

2018-05-01

Full Text Available The emergence and development of the Internet of Things (IoT has attracted growing attention to low-cost location systems when facing the dramatically increased number of public infrastructure assets in smart cities. Various radio frequency identification (RFID-based locating systems have been developed. However, most of them are impractical for infrastructure asset inspection and management on a large scale due to their high cost, inefficient deployment, and complex environments such as emergencies or high-rise buildings. In this paper, we proposed a novel locating system by combing the Global Navigation Satellite System (GNSS with RFID, in which a target tag was located with one RFID reader and one GNSS receiver with sufficient accuracy for infrastructure asset management. To overcome the cost challenge, one mobile RFID reader-mounted GNSS receiver is used to simulate multiple location known reference tags. A vast number of reference tags are necessary for current RFID-based locating systems, which means higher cost. To achieve fine-grained location accuracy, we utilize a distance-based power law weight algorithm to estimate the exact coordinates. Our experiment demonstrates the effectiveness and advantages of the proposed scheme with sufficient accuracy, low cost and easy deployment on a large scale. The proposed scheme has potential applications for location-based services in smart cities.

Construction of Time-Stamped Mobility Map for Path Tracking via Smith-Waterman Measurement Matching

Directory of Open Access Journals (Sweden)

Mu Zhou

2014-01-01

Full Text Available Path tracking in wireless and mobile environments is a fundamental technology for ubiquitous location-based services (LBSs. In particular, it is very challenging to develop highly accurate and cost-efficient tracking systems applied to the anonymous areas where the floor plans are not available for security and privacy reasons. This paper proposes a novel path tracking approach for large Wi-Fi areas based on the time-stamped unlabeled mobility map which is constructed from Smith-Waterman received signal strength (RSS measurement matching. Instead of conventional location fingerprinting, we construct mobility map with the technique of dimension reduction from the raw measurement space into a low-dimensional embedded manifold. The feasibility of our proposed approach is verified by the real-world experiments in the HKUST campus Wi-Fi networks, sMobileNet. The experimental results prove that our approach is adaptive and capable of achieving an adequate precision level in path tracking.

Effective caching of shortest paths for location-based services

DEFF Research Database (Denmark)

Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

2012-01-01

Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

A novel cost-effective parallel narrowband ANC system with local secondary-path estimation

Science.gov (United States)

Delegà, Riccardo; Bernasconi, Giancarlo; Piroddi, Luigi

2017-08-01

Many noise reduction applications are targeted at multi-tonal disturbances. Active noise control (ANC) solutions for such problems are generally based on the combination of multiple adaptive notch filters. Both the performance and the computational cost are negatively affected by an increase in the number of controlled frequencies. In this work we study a different modeling approach for the secondary path, based on the estimation of various small local models in adjacent frequency subbands, that greatly reduces the impact of reference-filtering operations in the ANC algorithm. Furthermore, in combination with a frequency-specific step size tuning method it provides a balanced attenuation performance over the whole controlled frequency range (and particularly in the high end of the range). Finally, the use of small local models is greatly beneficial for the reactivity of the online secondary path modeling algorithm when the characteristics of the acoustic channels are time-varying. Several simulations are provided to illustrate the positive features of the proposed method compared to other well-known techniques.

Multiobjective Location Routing Problem considering Uncertain Data after Disasters

Directory of Open Access Journals (Sweden)

Keliang Chang

2017-01-01

Full Text Available The relief distributions after large disasters play an important role for rescue works. After disasters there is a high degree of uncertainty, such as the demands of disaster points and the damage of paths. The demands of affected points and the velocities between two points on the paths are uncertain in this article, and the robust optimization method is applied to deal with the uncertain parameters. This paper proposes a nonlinear location routing problem with half-time windows and with three objectives. The affected points can be visited more than one time. The goals are the total costs of the transportation, the satisfaction rates of disaster nodes, and the path transport capacities which are denoted by vehicle velocities. Finally, the genetic algorithm is applied to solve a number of numerical examples, and the results show that the genetic algorithm is very stable and effective for this problem.

Remembered landmarks enhance the precision of path integration

Directory of Open Access Journals (Sweden)

Shannon O´Leary

2005-01-01

Full Text Available When navigating by path integration, knowledge of one’s position becomes increasingly uncertain as one walks from a known location. This uncertainty decreases if one perceives a known landmark location nearby. We hypothesized that remembering landmarks might serve a similar purpose for path integration as directly perceiving them. If this is true, walking near a remembered landmark location should enhance response consistency in path integration tasks. To test this, we asked participants to view a target and then attempt to walk to it without vision. Some participants saw the target plus a landmark during the preview. Compared with no-landmark trials, response consistency nearly doubled when participants passed near the remembered landmark location. Similar results were obtained when participants could audibly perceive the landmark while walking. A control experiment ruled out perceptual context effects during the preview. We conclude that remembered landmarks can enhance path integration even though they are not directly perceived.

Locating operations in high labor cost countries – Evidence from Spain

Directory of Open Access Journals (Sweden)

Angel Diaz

2017-06-01

Full Text Available The location of operations in high labor cost countries is increasingly discussed in the media, in part for recent declarations and actions from the president of USA, Donald Trump. While this particular instance can be labeled as populist or protectionist, the factors underlying the debate are extremely important: advances in systematic increases in productivity, low population growth, and the transfer of jobs to countries with lower labor costs are creating unemployment and underemployment in developed countries that could eventually result in protectionism and restrictions to free trade. This phenomenon has enormous social and economic implications, and has attracted considerable interest from researchers. In particular, this study provides empirical evidence of the location of manufacturing and services in the context of a European country (Spain, exploring the drivers, social implications and organizational theories that can explain it.

Identification of MHF (massive hydraulic fracturing) fracture planes and flow paths: A correlation of well log data with patterns in locations of induced seismicity

Energy Technology Data Exchange (ETDEWEB)

Dreesen, D.; Malzahn, M.; Fehler, M.; Dash, Z.

1987-01-01

One of the critical steps in developing a hot dry rock geothermal system is the creation of flow paths through the rock between two wellbores. To date, circulation systems have only been created by drilling one wellbore, hydraulically fracturing the well (which induces microearthquakes), locating the microearthquakes and then drilling a second wellbore through the zone of seismicity. A technique for analyzing the pattern of seismicity to determine where fracture planes are located in the seismically active region has recently been developed. This allows us to distinguish portions of the seismically active volume which are most likely to contain significant flow paths. We applied this technique to seismic data collected during a massive hydraulic fracturing (MHF) treatment and found that the fracture planes determined by the seismic method are confirmed by borehole temperature and caliper logs which indicate where permeable fractures and/or zones of weakness intersect the wellbores. A geometric model based on these planes and well log data has enhanced our understanding of the reservoir flow paths created by fracturing and is consistent with results obtained during production testing of the reservoir.

Optimal Path Determination for Flying Vehicle to Search an Object

Science.gov (United States)

Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.

2018-01-01

In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.

How do we select multiple features? Transient costs for selecting two colors rather than one, persistent costs for color-location conjunctions.

Science.gov (United States)

Lo, Shih-Yu; Holcombe, Alex O

2014-02-01

In a previous study Lo, Howard, & Holcombe (Vision Research 63:20-33, 2012), selecting two colors did not induce a performance cost, relative to selecting one color. For example, requiring possible report of both a green and a red target did not yield a worse performance than when both targets were green. Yet a cost of selecting multiple colors was observed when selection needed be contingent on both color and location. When selecting a red target to the left and a green target to the right, superimposing a green distractor to the left and a red distractor to the right impeded performance. Possibly, participants cannot confine attention to a color at a particular location. As a result, distractors that share the target colors disrupt attentional selection of the targets. The attempt to select the targets must then be repeated, which increases the likelihood that the trial terminates when selection is not effective, even for long trials. Consistent with this, here we find a persistent cost of selecting two colors when the conjunction of color and location is needed, but the cost is confined to short exposure durations when the observer just has to monitor red and green stimuli without the need to use the location information. These results suggest that selecting two colors is time-consuming but effective, whereas selection of simultaneous conjunctions is never entirely successful.

A focussed dynamic path finding algorithm with constraints

CSIR Research Space (South Africa)

Leenen, L

2013-11-01

Full Text Available heuristic to focus the search for an optimal path. Existing approaches to solving path planning problems tend to combine path costs with various other criteria such as obstacle avoidance in the objective function which is being optimised. The authors...

Optimal path-finding through mental exploration based on neural energy field gradients.

Science.gov (United States)

Wang, Yihong; Wang, Rubin; Zhu, Yating

2017-02-01

Rodent animal can accomplish self-locating and path-finding task by forming a cognitive map in the hippocampus representing the environment. In the classical model of the cognitive map, the system (artificial animal) needs large amounts of physical exploration to study spatial environment to solve path-finding problems, which costs too much time and energy. Although Hopfield's mental exploration model makes up for the deficiency mentioned above, the path is still not efficient enough. Moreover, his model mainly focused on the artificial neural network, and clear physiological meanings has not been addressed. In this work, based on the concept of mental exploration, neural energy coding theory has been applied to the novel calculation model to solve the path-finding problem. Energy field is constructed on the basis of the firing power of place cell clusters, and the energy field gradient can be used in mental exploration to solve path-finding problems. The study shows that the new mental exploration model can efficiently find the optimal path, and present the learning process with biophysical meaning as well. We also analyzed the parameters of the model which affect the path efficiency. This new idea verifies the importance of place cell and synapse in spatial memory and proves that energy coding is effective to study cognitive activities. This may provide the theoretical basis for the neural dynamics mechanism of spatial memory.

Low-Cost Bluetooth Mobile Positioning for Location-based Application

OpenAIRE

Barahim, Zaafir; Doomun, M. Razvi; Joomun, Nazrana

2012-01-01

Bluetooth is a promising short-range radio network technology. We present a low cost and easily deployed, scalable infrastructure for indoor location-based computing of mobile devices based on Bluetooth technology. The system consists of 2 main components, namely the Bluetooth (BT) Sensor System and the Central Navigation System which have been developed using the JDK 6.0. The Bluetooth Sensor System allows mobile devices whose Bluetooth mode is set to discoverable, to be scanned and detected...

Approximation algorithms for facility location problems with a special class of subadditive cost functions

NARCIS (Netherlands)

Gabor, Adriana F.; van Ommeren, Jan C.W.

2006-01-01

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\varepsilon, 1)$-reduction of

Optimal Paths in Gliding Flight

Science.gov (United States)

Wolek, Artur

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Approximation algorithms for facility location problems with a special class of subadditive cost functions

NARCIS (Netherlands)

Gabor, A.F.; Ommeren, van J.C.W.

2006-01-01

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1+e,1)-reduction of the facility

Intersection Recognition and Guide-Path Selection for a Vision-Based AGV in a Bidirectional Flow Network

Directory of Open Access Journals (Sweden)

Wu Xing

2014-03-01

Full Text Available Vision recognition and RFID perception are used to develop a smart AGV travelling on fixed paths while retaining low-cost, simplicity and reliability. Visible landmarks can describe features of shapes and geometric dimensions of lines and intersections, and RFID tags can directly record global locations on pathways and the local topological relations of crossroads. A topological map is convenient for building and editing without the need for accurate poses when establishing a priori knowledge of a workplace. To obtain the flexibility of bidirectional movement along guide-paths, a camera placed in the centre of the AGV looks downward vertically at landmarks on the floor. A small visual field presents many difficulties for vision guidance, especially for real-time, correct and reliable recognition of multi-branch crossroads. First, the region projection and contour scanning methods are both used to extract the features of shapes. Then LDA is used to reduce the number of the features' dimensions. Third, a hierarchical SVM classifier is proposed to classify their multi-branch patterns once the features of the shapes are complete. Our experiments in landmark recognition and navigation show that low-cost vision systems are insusceptible to visual noises, image breakages and floor changes, and a vision-based AGV can locate itself precisely on its paths, recognize different crossroads intelligently by verifying the conformance of vision and RFID information, and select its next pathway efficiently in a bidirectional flow network.

Special cases of the quadratic shortest path problem

NARCIS (Netherlands)

Sotirov, Renata; Hu, Hao

2017-01-01

The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP

Unusual bond paths in organolithium compounds

International Nuclear Information System (INIS)

Bachrach, S.M.; Ritchie, J.P.

1986-01-01

We have applied the topological method to a number of organolithium compounds. The wavefunctions were determined with GAUSSIAN-82 using 3-21G basis set and fully optimized geometries. Gradient paths were obtained using the RHODER package and critical points were located using EXTREME. These results indicate the unusual nature of organolithium compounds. The strange bond paths arise mainly from the ionic nature of the C-Li interaction. We suggest that the term ''bond path'' may best be suited for covalent bonds. 4 figs., 1 tab

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

Directory of Open Access Journals (Sweden)

Longxiang Li

Full Text Available 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.

Impulsive noise suppression in color images based on the geodesic digital paths

Science.gov (United States)

Smolka, Bogdan; Cyganek, Boguslaw

2015-02-01

In the paper a novel filtering design based on the concept of exploration of the pixel neighborhood by digital paths is presented. The paths start from the boundary of a filtering window and reach its center. The cost of transitions between adjacent pixels is defined in the hybrid spatial-color space. Then, an optimal path of minimum total cost, leading from pixels of the window's boundary to its center is determined. The cost of an optimal path serves as a degree of similarity of the central pixel to the samples from the local processing window. If a pixel is an outlier, then all the paths starting from the window's boundary will have high costs and the minimum one will also be high. The filter output is calculated as a weighted mean of the central pixel and an estimate constructed using the information on the minimum cost assigned to each image pixel. So, first the costs of optimal paths are used to build a smoothed image and in the second step the minimum cost of the central pixel is utilized for construction of the weights of a soft-switching scheme. The experiments performed on a set of standard color images, revealed that the efficiency of the proposed algorithm is superior to the state-of-the-art filtering techniques in terms of the objective restoration quality measures, especially for high noise contamination ratios. The proposed filter, due to its low computational complexity, can be applied for real time image denoising and also for the enhancement of video streams.

Methodology for using root locus technique for mobile robots path planning

Directory of Open Access Journals (Sweden)

Mario Ricardo Arbulú Saavedra

2015-11-01

Full Text Available This paper shows the analysis and the implementation methodology of the technique of dynamic systems roots location used in free-obstacle path planning for mobile robots. First of all, the analysis and morphologic behavior identification of the paths depending on roots location in complex plane are performed, where paths type and their attraction and repulsion features in the presence of other roots similarly to the obtained with artificial potential fields are identified. An implementation methodology for this technique of mobile robots path planning is proposed, starting from three different methods of roots location for obstacles in the scene. Those techniques change depending on the obstacle key points selected for roots, such as borders, crossing points with original path, center and vertices. Finally, a behavior analysis of general technique and the effectiveness of each tried method is performed, doing 20 tests for each one, obtaining a value of 65% for the selected method. Modifications and possible improvements to this methodology are also proposed.

Diagnostic and therapeutic path of breast cancer: effectiveness, appropriateness, and costs – results from the DOCMa study

Directory of Open Access Journals (Sweden)

Giovagnoli MR

2015-04-01

Full Text Available Maria Rosaria Giovagnoli,1 Adriana Bonifacino,2 Cosimo Neglia,3 Marco Benvenuto,3,4 Francesco Vincenzo Sambati,3 Lorenzo Giolli,5 Alessandra Giovagnoli,6 Prisco Piscitelli7,8 1Department of Clinical and Molecular Medicine, 2Department of Medical-Surgical Sciences and Translational Medicine, Sapienza University of Rome, Sant’Andrea University Hospital, Rome, 3Euro Mediterranean Scientific Biomedical Institute (ISBEM, Brindisi, 4Department of Economics, Scuola Superiore Sant’Anna, Pisa, 5eCampus University, Novedrate, 6Department of Statistical Sciences, University of Bologna, Bologna, 7Coleman Ltd, 8IOS, Southern Italy Hospital Institute, Naples, ItalyObjective: An increase in breast cancer incidence has been documented in Italy and in other countries, and some women decide by themselves to undergo diagnostic examinations outside the official screening campaigns. The aim of this paper was to analyze – in terms of effectiveness, appropriate access, and related costs – the path spontaneously followed by a sample of Italian women for the early diagnosis of breast cancer.Subjects and methods: A total of 143 women who consecutively referred themselves to the breast cancer outpatient facilities at the Sant’Andrea University Hospital in Rome from May to June 2007 were enrolled in the study, gave their consent, and were screened according to their individual risk factors for breast cancer. The entire diagnostic and therapeutic path followed in the previous 2 years by each of them, either at Sant’Andrea or in other medical facilities, was reviewed and evaluated in terms of its operative efficiency and fair economic value.Results: The subjects’ mean age was 47.5 years (standard deviation 13.6 years; 55% of the women were <50 years old (28% <40 years, and were thus not included in the official screening campaigns; 97 women (70% were requesting a routine control; and 49% of them had already undergone four to seven examinations before the

State and location dependence of action potential metabolic cost in cortical pyramidal neurons

NARCIS (Netherlands)

Hallermann, Stefan; de Kock, Christiaan P. J.; Stuart, Greg J.; Kole, Maarten H. P.

2012-01-01

Action potential generation and conduction requires large quantities of energy to restore Na+ and K+ ion gradients. We investigated the subcellular location and voltage dependence of this metabolic cost in rat neocortical pyramidal neurons. Using Na+/K+ charge overlap as a measure of action

State and location dependence of action potential metabolic cost in cortical pyramidal neurons

NARCIS (Netherlands)

Hallermann, S.; de Kock, C.P.J.; Stuart, G.J.; Kole, M.H.

2012-01-01

Action potential generation and conduction requires large quantities of energy to restore Na + and K + ion gradients. We investigated the subcellular location and voltage dependence of this metabolic cost in rat neocortical pyramidal neurons. Using Na +K + charge overlap as a measure of action

Methodology of Evaluation of the Impact of Picking Area Location on the Total Costs of Warehouse

Directory of Open Access Journals (Sweden)

Apsalons Raitis

2017-12-01

Full Text Available The picking system and the layout of the picking area are the key drivers for the evaluation of a warehouse picking cost. There are five variants for organizing the picking process of orders in a warehouse. The choice of a specific variant depends on the total cost of picking. The picking cost is evaluated within an uninterrupted picking process. It means that no stock out occurs in the time period of the picking process. The storing area and the picking area are created as two separate zones for picking quantities of the customer’s orders; the principle of division of orders is observed strictly. Referring to the locations of stock keeping units (SKU, two approaches of the layout of SKU in the picking area can be estimated. The first one is the single picking location for each single SKU, where replenishment is realized in the picking process. The second one - various picking locations for each single SKU, and the replenishment here is realized just only prior to a picking process or after it. The main benefits of the economy of the picking cost as far as these two approaches are concerned are the shortest picking route in the first case and one common replenishment option in the second case.

Globally Optimal Path Planning with Anisotropic Running Costs

Science.gov (United States)

2013-03-01

Eikonal equation and has numerous applications, for exam- ple, in path planning, computational geometry, computer vision, and image enhancement...Sethian 1999b]. Numerical methods for solving the Eikonal equation include Tsitsiklis’ control-theoretic algorithm [Tsitsiklis 1995], Fast Marching Methods...methods for Eikonal equations on triangular meshes, SIAM J. Numer. Anal. 45(1), 83—107. Rowe, M. P., Sidhu, H. S. & Mercer, G. N. (2009) Military

School-located influenza vaccination with third-party billing: outcomes, cost, and reimbursement.

Science.gov (United States)

Kempe, Allison; Daley, Matthew F; Pyrzanowski, Jennifer; Vogt, Tara; Fang, Hai; Rinehart, Deborah J; Morgan, Nicole; Riis, Mette; Rodgers, Sarah; McCormick, Emily; Hammer, Anne; Campagna, Elizabeth J; Kile, Deidre; Dickinson, Miriam; Hambidge, Simon J; Shlay, Judith C

2014-01-01

To assess rates of immunization; costs of conducting clinics; and reimbursements for a school-located influenza vaccination (SLIV) program that billed third-party payers. SLIV clinics were conducted in 19 elementary schools in the Denver Public School district (September 2010 to February 2011). School personnel obtained parental consent, and a community vaccinator conducted clinics and performed billing. Vaccines For Children vaccine was available for eligible students. Parents were not billed for any fees. Data were collected regarding implementation costs and vaccine cost was calculated using published private sector prices. Reimbursement amounts were compared to costs. Overall, 30% of students (2784 of 9295) received ≥1 influenza vaccine; 39% (1079 of 2784) needed 2 doses and 80% received both. Excluding vaccine costs, implementation costs were $24.69 per vaccination. The percentage of vaccine costs reimbursed was 62% overall (82% from State Child Health Insurance Program (SCHIP), 50% from private insurance). The percentage of implementation costs reimbursed was 19% overall (23% from private, 27% from Medicaid, 29% from SCHIP and 0% among uninsured). Overall, 25% of total costs (implementation plus vaccine) were reimbursed. A SLIV program resulted in vaccination of nearly one third of elementary students. Reimbursement rates were limited by 1) school restrictions on charging parents fees, 2) low payments for vaccine administration from public payers and 3) high rates of denials from private insurers. Some of these problems might be reduced by provisions in the Affordable Care Act. Copyright © 2014 Academic Pediatric Association. Published by Elsevier Inc. All rights reserved.

A PROCEDURE FOR DETERMINING OPTIMAL FACILITY LOCATION AND SUB-OPTIMAL POSITIONS

Directory of Open Access Journals (Sweden)

P.K. Dan

2012-01-01

Full Text Available

ENGLISH ABSTRACT: This research presents a methodology for determining the optimal location of a new facility, having physical flow interaction of various degrees with other existing facilities in the presence of barriers impeding the shortest flow-path as well as the sub-optimal iso-cost positions. It also determines sub-optimal iso-cost positions with additional cost or penalty for not being able to site it at the computed optimal point. The proposed methodology considers all types of quadrilateral barrier or forbidden region configurations to generalize and by-pass such impenetrable obstacles, and adopts a scheme of searching through the vertices of the quadrilaterals to determine the alternative shortest flow-path. This procedure of obstacle avoidance is novel. Software has been developed to facilitate computations for the search algorithm to determine the optimal and iso-cost co-ordinates. The test results are presented.

AFRIKAANSE OPSOMMING: Die navorsing behandel ‘n procedure vir die bepaling van optimum stigtingsposisie vir ‘n onderneming met vloei vanaf ander bestaande fasiliteite in die teenwoordigheid van ‘n verskeidenheid van randvoorwaardes. Die prodedure lewer as resultaat suboptimale isokoste-stigtingsplekke met bekendmaking van die koste wat onstaan a.g.v. afwyking van die randvoorwaardlose optimum oplossingskoste, die prosedure maak gebruik van ‘n vindingryke soekmetode wat toegepas word op niersydige meerkundige voorstellings vir die bepaling van korste roetes wat versperring omseil. Die prosedure word onderskei deur programmatuur. Toetsresultate word voorgehou.

Variational nature, integration, and properties of Newton reaction path.

Science.gov (United States)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-21

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Variational nature, integration, and properties of Newton reaction path

Science.gov (United States)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-01

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Optimization of educational paths for higher education

Science.gov (United States)

Tarasyev, Alexandr A.; Agarkov, Gavriil; Medvedev, Aleksandr

2017-11-01

In our research, we combine the theory of economic behavior and the methodology of increasing efficiency of the human capital to estimate the optimal educational paths. We provide an optimization model for higher education process to analyze possible educational paths for each rational individual. The preferences of each rational individual are compared to the best economically possible educational path. The main factor of the individual choice, which is formed by the formation of optimal educational path, deals with higher salaries level in the chosen economic sector after graduation. Another factor that influences on the economic profit is the reduction of educational costs or the possibility of the budget support for the student. The main outcome of this research consists in correction of the governmental policy of investment in human capital based on the results of educational paths optimal control.

Medial temporal lobe roles in human path integration.

Directory of Open Access Journals (Sweden)

Naohide Yamamoto

Full Text Available Path integration is a process in which observers derive their location by integrating self-motion signals along their locomotion trajectory. Although the medial temporal lobe (MTL is thought to take part in path integration, the scope of its role for path integration remains unclear. To address this issue, we administered a variety of tasks involving path integration and other related processes to a group of neurosurgical patients whose MTL was unilaterally resected as therapy for epilepsy. These patients were unimpaired relative to neurologically intact controls in many tasks that required integration of various kinds of sensory self-motion information. However, the same patients (especially those who had lesions in the right hemisphere walked farther than the controls when attempting to walk without vision to a previewed target. Importantly, this task was unique in our test battery in that it allowed participants to form a mental representation of the target location and anticipate their upcoming walking trajectory before they began moving. Thus, these results put forth a new idea that the role of MTL structures for human path integration may stem from their participation in predicting the consequences of one's locomotor actions. The strengths of this new theoretical viewpoint are discussed.

The influence of (toll-related) travel costs in residential location decisions of households : A stated choice approach

NARCIS (Netherlands)

Tillema, T.; van Wee, B.; Ettema, D.

2010-01-01

In this paper, we investigate the impact of travel costs, in particular toll costs, on the residential location choice of households, using a stated choice survey. Within the stated choice experiment, car drivers that frequently face traffic congestion, traded-off several trip-related (including

Tuning of Lee Path Loss Model based on recent RF measurements in 400 MHZ conducted in Riyadh City, Saudi Arabia

International Nuclear Information System (INIS)

Alotaibi, Faihan D.; Ali, Adel A.

2008-01-01

In mobile radio systems, path loss models are necessary for proper planning, interference estimations, frequently assignments and cell parameters which are basic for network planning process as well as Location Based Services (LBS) techniques that are not based on GPS system. Empirical models are the most adjustable models that can be suited to different types of environments. In this paper, the Lee path loss model has been tuned using Least Square (LS) algorithm to fit measured data for TETRA system operating 400 MHz in Riyadh urban and suburbs. Consequently, Lee model's parameter (L0, y) are obtained for the targeted areas. The performance of the tuned Lee model is then compared to the three most widely used empirical path loss models: Hat, ITU-R and Cost 231 Walfisch-Ikegami non line-of-sight (CWI-NLOS) path loss models. The performance criterion selected for the comparison of various empirical path loss models are the Root Mean Square Error (RMSE) and goodness of fit (R2). The RMSE and R2between the actual and predicted data are calculated for various path loss models. It turned that the tuned Lee model outperforms the other empirical models. (author)

Ecological Security Pattern Analysis Based on InVEST and Least-Cost Path Model: A Case Study of Dongguan Water Village

Directory of Open Access Journals (Sweden)

Qian Lin

2016-02-01

Full Text Available The famous “world’s factory” city, Dongguan, like many other places in China, is a typical beneficiary of China’s Reform and Opening-up Policy. However, rapid urban sprawl and economic growth are at the expense of the destruction of the local environment. Therefore, it is of great importance to establish an ecological security network for sustainable development. InVEST models, effective tools to measure sensitivity and intensity of external threats to quantify habitat value, are used to calculate habitat quality of water and land. By combining structural connectivity and the Least-Cost Path model (LCP model, in which corridors are determined based on the minimum accumulative cost path between each critical point, ecological security patterns were calculated. According to the results, the northwest region of Dongguan, having a large quantity of farmlands and water and therefore many corridors and critical patches, is the most essential area in the overall security of ecological environments, which should be protected first. If developed, it should be dominated by eco-tourism and eco-agriculture. We hope that research on the ecological network, which includes critical patches and corridors formed by greenland and rivers, will lead toward better-informed proposals for local urban planning and regional sustainable development.

Low-cost asset tracking using location-aware camera phones

Science.gov (United States)

Chen, David; Tsai, Sam; Kim, Kyu-Han; Hsu, Cheng-Hsin; Singh, Jatinder Pal; Girod, Bernd

2010-08-01

Maintaining an accurate and up-to-date inventory of one's assets is a labor-intensive, tedious, and costly operation. To ease this difficult but important task, we design and implement a mobile asset tracking system for automatically generating an inventory by snapping photos of the assets with a smartphone. Since smartphones are becoming ubiquitous, construction and deployment of our inventory management solution is simple and costeffective. Automatic asset recognition is achieved by first segmenting individual assets out of the query photo and then performing bag-of-visual-features (BoVF) image matching on the segmented regions. The smartphone's sensor readings, such as digital compass and accelerometer measurements, can be used to determine the location of each asset, and this location information is stored in the inventory for each recognized asset. As a special case study, we demonstrate a mobile book tracking system, where users snap photos of books stacked on bookshelves to generate a location-aware book inventory. It is shown that segmenting the book spines is very important for accurate feature-based image matching into a database of book spines. Segmentation also provides the exact orientation of each book spine, so more discriminative upright local features can be employed for improved recognition. This system's mobile client has been implemented for smartphones running the Symbian or Android operating systems. The client enables a user to snap a picture of a bookshelf and to subsequently view the recognized spines in the smartphone's viewfinder. Two different pose estimates, one from BoVF geometric matching and the other from segmentation boundaries, are both utilized to accurately draw the boundary of each spine in the viewfinder for easy visualization. The BoVF representation also allows matching each photo of a bookshelf rack against a photo of the entire bookshelf, and the resulting feature matches are used in conjunction with the smartphone

MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

CERN Document Server

Al-Shabibi, Ali; Martin, Brian

2011-06-11

This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

Solving fuzzy shortest path problem by genetic algorithm

Science.gov (United States)

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.

Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity

Directory of Open Access Journals (Sweden)

Fei Dou

2014-01-01

Full Text Available Passenger’s optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

Piloting and Path Integration within and across Boundaries

Science.gov (United States)

Mou, Weimin; Wang, Lin

2015-01-01

Three experiments investigated whether navigation is less efficient across boundaries than within boundaries. In an immersive virtual environment, participants learned objects' locations in a large room or a small room. Participants then pointed to the objects' original locations after physically walking a circuitous path without vision.…

Location aware event driven multipath routing in Wireless Sensor Networks: Agent based approach

Directory of Open Access Journals (Sweden)

A.V. Sutagundar

2013-03-01

Full Text Available Wireless Sensor Networks (WSNs demand reliable and energy efficient paths for critical information delivery to sink node from an event occurrence node. Multipath routing facilitates reliable data delivery in case of critical information. This paper proposes an event triggered multipath routing in WSNs by employing a set of static and mobile agents. Every sensor node is assumed to know the location information of the sink node and itself. The proposed scheme works as follows: (1 Event node computes the arbitrary midpoint between an event node and the sink node by using location information. (2 Event node establishes a shortest path from itself to the sink node through the reference axis by using a mobile agent with the help of location information; the mobile agent collects the connectivity information and other parameters of all the nodes on the way and provides the information to the sink node. (3 Event node finds the arbitrary location of the special (middle intermediate nodes (above/below reference axis by using the midpoint location information given in step 1. (4 Mobile agent clones from the event node and the clones carry the event type and discover the path passing through special intermediate nodes; the path above/below reference axis looks like an arc. While migrating from one sensor node to another along the traversed path, each mobile agent gathers the node information (such as node id, location information, residual energy, available bandwidth, and neighbors connectivity and delivers to the sink node. (5 The sink node constructs a partial topology, connecting event and sink node by using the connectivity information delivered by the mobile agents. Using the partial topology information, sink node finds the multipath and path weight factor by using link efficiency, energy ratio, and hop distance. (6 The sink node selects the number of paths among the available paths based upon the criticalness of an event, and (7 if the event is non

A cost effective topology migration path towards fibre

OpenAIRE

Phillipson, F.

2013-01-01

If an operator has as starting position a Full Copper topology in which ADSL or VDSL is offered from the Central Office, the next choice he has to make is to provide Full FttH or use an other topology option, e.g. FttCab, first as intermediate step to provide a next generation service package. In this paper we present a gradual topology migration path from Full Copper via FttCab and Hybrid FttH towards Full FttH. We look at the planning issues of this topology migration and the financial impa...

Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.

Science.gov (United States)

Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S

2013-01-01

The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.

Which coordinate system for modelling path integration?

Science.gov (United States)

Vickerstaff, Robert J; Cheung, Allen

2010-03-21

Path integration is a navigation strategy widely observed in nature where an animal maintains a running estimate, called the home vector, of its location during an excursion. Evidence suggests it is both ancient and ubiquitous in nature, and has been studied for over a century. In that time, canonical and neural network models have flourished, based on a wide range of assumptions, justifications and supporting data. Despite the importance of the phenomenon, consensus and unifying principles appear lacking. A fundamental issue is the neural representation of space needed for biological path integration. This paper presents a scheme to classify path integration systems on the basis of the way the home vector records and updates the spatial relationship between the animal and its home location. Four extended classes of coordinate systems are used to unify and review both canonical and neural network models of path integration, from the arthropod and mammalian literature. This scheme demonstrates analytical equivalence between models which may otherwise appear unrelated, and distinguishes between models which may superficially appear similar. A thorough analysis is carried out of the equational forms of important facets of path integration including updating, steering, searching and systematic errors, using each of the four coordinate systems. The type of available directional cue, namely allothetic or idiothetic, is also considered. It is shown that on balance, the class of home vectors which includes the geocentric Cartesian coordinate system, appears to be the most robust for biological systems. A key conclusion is that deducing computational structure from behavioural data alone will be difficult or impossible, at least in the absence of an analysis of random errors. Consequently it is likely that further theoretical insights into path integration will require an in-depth study of the effect of noise on the four classes of home vectors. Copyright 2009 Elsevier Ltd

Tax policy can change the production path: A model of optimal oil extraction in Alaska

International Nuclear Information System (INIS)

Leighty, Wayne; Lin, C.-Y. Cynthia

2012-01-01

We model the economically optimal dynamic oil production decisions for seven production units (fields) on Alaska's North Slope. We use adjustment cost and discount rate to calibrate the model against historical production data, and use the calibrated model to simulate the impact of tax policy on production rate. We construct field-specific cost functions from average cost data and an estimated inverse production function, which incorporates engineering aspects of oil production into our economic modeling. Producers appear to have approximated dynamic optimality. Consistent with prior research, we find that changing the tax rate alone does not change the economically optimal oil production path, except for marginal fields that may cease production. Contrary to prior research, we find that the structure of tax policy can be designed to affect the economically optimal production path, but at a cost in net social benefit. - Highlights: ► We model economically optimal dynamic oil production decisions for 7 Alaska fields. ► Changing tax rate alone does not alter the economically optimal oil production path. ► But change in tax structure can affect the economically optimal oil production path. ► Tax structures that modify the optimal production path reduce net social benefit. ► Field-specific cost functions and inverse production functions are estimated

State and location dependence of action potential metabolic cost in cortical pyramidal neurons.

Science.gov (United States)

Hallermann, Stefan; de Kock, Christiaan P J; Stuart, Greg J; Kole, Maarten H P

2012-06-03

Action potential generation and conduction requires large quantities of energy to restore Na(+) and K(+) ion gradients. We investigated the subcellular location and voltage dependence of this metabolic cost in rat neocortical pyramidal neurons. Using Na(+)/K(+) charge overlap as a measure of action potential energy efficiency, we found that action potential initiation in the axon initial segment (AIS) and forward propagation into the axon were energetically inefficient, depending on the resting membrane potential. In contrast, action potential backpropagation into dendrites was efficient. Computer simulations predicted that, although the AIS and nodes of Ranvier had the highest metabolic cost per membrane area, action potential backpropagation into the dendrites and forward propagation into axon collaterals dominated energy consumption in cortical pyramidal neurons. Finally, we found that the high metabolic cost of action potential initiation and propagation down the axon is a trade-off between energy minimization and maximization of the conduction reliability of high-frequency action potentials.

Do illness rating systems predict discharge location, length of stay, and cost after total hip arthroplasty?

Directory of Open Access Journals (Sweden)

Sarah E. Rudasill, BA

2018-06-01

Conclusions: These findings suggest that although ASA classifications predict discharge location and SOI scores predict length of stay and total costs, other factors beyond illness rating systems remain stronger predictors of discharge for THA patients.

Adaptive Cost-Based Task Scheduling in Cloud Environment

Directory of Open Access Journals (Sweden)

Mohammed A. S. Mosleh

2016-01-01

Full Text Available Task execution in cloud computing requires obtaining stored data from remote data centers. Though this storage process reduces the memory constraints of the user’s computer, the time deadline is a serious concern. In this paper, Adaptive Cost-based Task Scheduling (ACTS is proposed to provide data access to the virtual machines (VMs within the deadline without increasing the cost. ACTS considers the data access completion time for selecting the cost effective path to access the data. To allocate data access paths, the data access completion time is computed by considering the mean and variance of the network service time and the arrival rate of network input/output requests. Then the task priority is assigned to the removed tasks based data access time. Finally, the cost of data paths are analyzed and allocated based on the task priority. Minimum cost path is allocated to the low priority tasks and fast access path are allocated to high priority tasks as to meet the time deadline. Thus efficient task scheduling can be achieved by using ACTS. The experimental results conducted in terms of execution time, computation cost, communication cost, bandwidth, and CPU utilization prove that the proposed algorithm provides better performance than the state-of-the-art methods.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

Science.gov (United States)

Wang, Ying; Zhang, Jie; Zhao, Yongli; Zhang, Jiawei; Zhao, Jie; Wang, Xinbo; Gu, Wanyi

2013-01-28

Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.

Path to Market for Compact Modular Fusion Power Cores

Science.gov (United States)

Woodruff, Simon; Baerny, Jennifer K.; Mattor, Nathan; Stoulil, Don; Miller, Ronald; Marston, Theodore

2012-08-01

The benefits of an energy source whose reactants are plentiful and whose products are benign is hard to measure, but at no time in history has this energy source been more needed. Nuclear fusion continues to promise to be this energy source. However, the path to market for fusion systems is still regularly a matter for long-term (20 + year) plans. This white paper is intended to stimulate discussion of faster commercialization paths, distilling guidance from investors, utilities, and the wider energy research community (including from ARPA-E). There is great interest in a small modular fusion system that can be developed quickly and inexpensively. A simple model shows how compact modular fusion can produce a low cost development path by optimizing traditional systems that burn deuterium and tritium, operating not only at high magnetic field strength, but also by omitting some components that allow for the core to become more compact and easier to maintain. The dominant hurdles to the development of low cost, practical fusion systems are discussed, primarily in terms of the constraints placed on the cost of development stages in the private sector. The main finding presented here is that the bridge from DOE Office of Science to the energy market can come at the Proof of Principle development stage, providing the concept is sufficiently compact and inexpensive that its development allows for a normal technology commercialization path.

The processing of spatial information in short-term memory: insights from eye tracking the path length effect.

Science.gov (United States)

Guérard, Katherine; Tremblay, Sébastien; Saint-Aubin, Jean

2009-10-01

Serial memory for spatial locations increases as the distance between successive stimuli locations decreases. This effect, known as the path length effect [Parmentier, F. B. R., Elford, G., & Maybery, M. T. (2005). Transitional information in spatial serial memory: Path characteristics affect recall performance. Journal of Experimental Psychology: Learning, Memory & Cognition, 31, 412-427], was investigated in a systematic manner using eye tracking and interference procedures to explore the mechanisms responsible for the processing of spatial information. In Experiment 1, eye movements were monitored during a spatial serial recall task--in which the participants have to remember the location of spatially and temporally separated dots on the screen. In the experimental conditions, eye movements were suppressed by requiring participants to incessantly move their eyes between irrelevant locations. Ocular suppression abolished the path length effect whether eye movements were prevented during item presentation or during a 7s retention interval. In Experiment 2, articulatory suppression was combined with a spatial serial recall task. Although articulatory suppression impaired performance, it did not alter the path length effect. Our results suggest that rehearsal plays a key role in serial memory for spatial information, though the effect of path length seems to involve other processes located at encoding, such as the time spent fixating each location and perceptual organization.

76 FR 64943 - Proposed Cercla Administrative Cost Recovery Settlement; ACM Smelter and Refinery Site, Located...

Science.gov (United States)

2011-10-19

... Settlement; ACM Smelter and Refinery Site, Located in Cascade County, MT AGENCY: Environmental Protection... projected future response costs concerning the ACM Smelter and Refinery NPL Site (Site), Operable Unit 1..., Helena, MT 59626. Mr. Sturn can be reached at (406) 457-5027. Comments should reference the ACM Smelter...

Toward solving the sign problem with path optimization method

Science.gov (United States)

Mori, Yuto; Kashiwa, Kouji; Ohnishi, Akira

2017-12-01

We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost function which represents the seriousness of the sign problem. We call it the path optimization method. In this method, we do not need to solve the gradient flow required in the Lefschetz-thimble method and then the construction of the integration-path contour arrives at the optimization problem where several efficient methods can be applied. In a simple model with a serious sign problem, the path optimization method is demonstrated to work well; the residual sign problem is resolved and precise results can be obtained even in the region where the global sign problem is serious.

Flight Path Recovery System (FPRS) design study

International Nuclear Information System (INIS)

1978-09-01

The study contained herein presents a design for a Flight Path Recovery System (FPPS) for use in the NURE Program which will be more accurate than systems presently used, provide position location data in digital form suitable for automatic data processing, and provide for flight path recovery in a more economic and operationally suitable manner. The design is based upon the use of presently available hardware and technoloy, and presents little, it any, development risk. In addition, a Flight Test Plan designed to test the FPRS design concept is presented

Flight Path Recovery System (FPRS) design study

Energy Technology Data Exchange (ETDEWEB)

1978-09-01

The study contained herein presents a design for a Flight Path Recovery System (FPPS) for use in the NURE Program which will be more accurate than systems presently used, provide position location data in digital form suitable for automatic data processing, and provide for flight path recovery in a more economic and operationally suitable manner. The design is based upon the use of presently available hardware and technoloy, and presents little, it any, development risk. In addition, a Flight Test Plan designed to test the FPRS design concept is presented.

Active Path Planning for Drones in Object Search

OpenAIRE

Wang, Zeyangyi

2017-01-01

Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...

Coordination Costs for School-Located Influenza Vaccination Clinics, Maine, 2009 H1N1 Pandemic

Science.gov (United States)

Asay, Garrett R. Beeler; Cho, Bo-Hyun; Lorick, Suchita A.; Tipton, Meredith L.; Dube, Nancy L.; Messonnier, Mark L.

2012-01-01

School nurses played a key role in Maine's school-located influenza vaccination (SLV) clinics during the 2009-2010 pandemic season. The objective of this study was to determine, from the school district perspective, the labor hours and costs associated with outside-clinic coordination activities (OCA). The authors defined OCA as labor hours spent…

PRELIMINARY PROJECT PLAN FOR LANSCE INTEGRATED FLIGHT PATHS 11A, 11B, 12, and 13

International Nuclear Information System (INIS)

Bultman, D. H.; Weinacht, D.

2000-01-01

This Preliminary Project Plan Summarizes the Technical, Cost, and Schedule baselines for an integrated approach to developing several flight paths at the Manual Lujan Jr. Neutron Scattering Center at the Los Alamos Neutron Science Center. For example, the cost estimate is intended to serve only as a rough order of magnitude assessment of the cost that might be incurred as the flight paths are developed. Further refinement of the requirements and interfaces for each beamline will permit additional refinement and confidence in the accuracy of all three baselines (Technical, Cost, Schedule)

DISPOSITION PATHS FOR ROCKY FLATS GLOVEBOXES: EVALUATING OPTIONS

International Nuclear Information System (INIS)

Lobdell, D.; Geimer, R.; Larsen, P.; Loveland, K.

2003-01-01

The Kaiser-Hill Company, LLC has the responsibility for closure activities at the Rocky Flats Environmental Technology Site (RFETS). One of the challenges faced for closure is the disposition of radiologically contaminated gloveboxes. Evaluation of the disposition options for gloveboxes included a detailed analysis of available treatment capabilities, disposal facilities, and lifecycle costs. The Kaiser-Hill Company, LLC followed several processes in determining how the gloveboxes would be managed for disposition. Currently, multiple disposition paths have been chosen to accommodate the needs of the varying styles and conditions of the gloveboxes, meet the needs of the decommissioning team, and to best manage lifecycle costs. Several challenges associated with developing a disposition path that addresses both the radiological and RCRA concerns as well as offering the most cost-effective solution were encountered. These challenges included meeting the radiological waste acceptance criteria of available disposal facilities, making a RCRA determination, evaluating treatment options and costs, addressing void requirements associated with disposal, and identifying packaging and transportation options. The varying disposal facility requirements affected disposition choices. Facility conditions that impacted decisions included radiological and chemical waste acceptance criteria, physical requirements, and measurement for payment options. The facility requirements also impacted onsite activities including management strategies, decontamination activities, and life-cycle cost

Transaction costs and technological development: The case of the Danish fruit and vegetable industry

DEFF Research Database (Denmark)

Foss, Kirsten

1996-01-01

It is argued that technological change can be understood in terms of attempts to reduce transaction costs as well as production costs. Two types of paths of technological development are identified: a production cost minimizing path, and a transac cost minimizing path. The creation of new...... technological opportunites underlying the path of production-cost.minimizing depends on the emergence of problems of optimizing the performance of products and processing technology. The exploitation of su opportunities may easily be interpreted within a production perspective since the economic consequences...... would be reduced production costs. The creation of new technological opportunities within the transaction-costs-minimizing path depends on th continual emergence of problems related to the control of variablility in product quality or performance. The economic consequence from exploiting...

Efficient Guiding Towards Cost-Optimality in UPPAAL

DEFF Research Database (Denmark)

Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas S.

2001-01-01

with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra’s shortest path algorithm, we show that the search order of the algorithm can be chosen......In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). This model can be seen as a submodel of the recently suggested model of linearly priced timed automata, which extends timed automata...

Gibbon travel paths are goal oriented.

Science.gov (United States)

Asensio, Norberto; Brockelman, Warren Y; Malaivijitnond, Suchinda; Reichard, Ulrich H

2011-05-01

Remembering locations of food resources is critical for animal survival. Gibbons are territorial primates which regularly travel through small and stable home ranges in search of preferred, limited and patchily distributed resources (primarily ripe fruit). They are predicted to profit from an ability to memorize the spatial characteristics of their home range and may increase their foraging efficiency by using a 'cognitive map' either with Euclidean or with topological properties. We collected ranging and feeding data from 11 gibbon groups (Hylobates lar) to test their navigation skills and to better understand gibbons' 'spatial intelligence'. We calculated the locations at which significant travel direction changes occurred using the change-point direction test and found that these locations primarily coincided with preferred fruit sources. Within the limits of biologically realistic visibility distances observed, gibbon travel paths were more efficient in detecting known preferred food sources than a heuristic travel model based on straight travel paths in random directions. Because consecutive travel change-points were far from the gibbons' sight, planned movement between preferred food sources was the most parsimonious explanation for the observed travel patterns. Gibbon travel appears to connect preferred food sources as expected under the assumption of a good mental representation of the most relevant sources in a large-scale space.

A Neural Path Integration Mechanism for Adaptive Vector Navigation in Autonomous Agents

DEFF Research Database (Denmark)

Goldschmidt, Dennis; Dasgupta, Sakyasingha; Wörgötter, Florentin

2015-01-01

Animals show remarkable capabilities in navigating their habitat in a fully autonomous and energy-efficient way. In many species, these capabilities rely on a process called path integration, which enables them to estimate their current location and to find their way back home after long-distance...... of autonomous agent navigation, but it also reproduces various aspects of animal navigation. Finally, we discuss how the proposed path integration mechanism may be used as a scaffold for spatial learning in terms of vector navigation.......Animals show remarkable capabilities in navigating their habitat in a fully autonomous and energy-efficient way. In many species, these capabilities rely on a process called path integration, which enables them to estimate their current location and to find their way back home after long...

Path Planning Method for UUV Homing and Docking in Movement Disorders Environment

Directory of Open Access Journals (Sweden)

Zheping Yan

2014-01-01

Full Text Available Path planning method for unmanned underwater vehicles (UUV homing and docking in movement disorders environment is proposed in this paper. Firstly, cost function is proposed for path planning. Then, a novel particle swarm optimization (NPSO is proposed and applied to find the waypoint with minimum value of cost function. Then, a strategy for UUV enters into the mother vessel with a fixed angle being proposed. Finally, the test function is introduced to analyze the performance of NPSO and compare with basic particle swarm optimization (BPSO, inertia weight particle swarm optimization (LWPSO, EPSO, and time-varying acceleration coefficient (TVAC. It has turned out that, for unimodal functions, NPSO performed better searching accuracy and stability than other algorithms, and, for multimodal functions, the performance of NPSO is similar to TVAC. Then, the simulation of UUV path planning is presented, and it showed that, with the strategy proposed in this paper, UUV can dodge obstacles and threats, and search for the efficiency path.

A chain-of-states acceleration method for the efficient location of minimum energy paths

Energy Technology Data Exchange (ETDEWEB)

Hernández, E. R., E-mail: Eduardo.Hernandez@csic.es; Herrero, C. P. [Instituto de Ciencia de Materiales de Madrid (ICMM–CSIC), Campus de Cantoblanco, 28049 Madrid (Spain); Soler, J. M. [Departamento de Física de la Materia Condensada and IFIMAC, Universidad Autónoma de Madrid, 28049 Madrid (Spain)

2015-11-14

We describe a robust and efficient chain-of-states method for computing Minimum Energy Paths (MEPs) associated to barrier-crossing events in poly-atomic systems, which we call the acceleration method. The path is parametrized in terms of a continuous variable t ∈ [0, 1] that plays the role of time. In contrast to previous chain-of-states algorithms such as the nudged elastic band or string methods, where the positions of the states in the chain are taken as variational parameters in the search for the MEP, our strategy is to formulate the problem in terms of the second derivatives of the coordinates with respect to t, i.e., the state accelerations. We show this to result in a very simple and efficient method for determining the MEP. We describe the application of the method to a series of test cases, including two low-dimensional problems and the Stone-Wales transformation in C{sub 60}.

A chain-of-states acceleration method for the efficient location of minimum energy paths

International Nuclear Information System (INIS)

Hernández, E. R.; Herrero, C. P.; Soler, J. M.

2015-01-01

We describe a robust and efficient chain-of-states method for computing Minimum Energy Paths (MEPs) associated to barrier-crossing events in poly-atomic systems, which we call the acceleration method. The path is parametrized in terms of a continuous variable t ∈ [0, 1] that plays the role of time. In contrast to previous chain-of-states algorithms such as the nudged elastic band or string methods, where the positions of the states in the chain are taken as variational parameters in the search for the MEP, our strategy is to formulate the problem in terms of the second derivatives of the coordinates with respect to t, i.e., the state accelerations. We show this to result in a very simple and efficient method for determining the MEP. We describe the application of the method to a series of test cases, including two low-dimensional problems and the Stone-Wales transformation in C 60

The impact of path crossing on visuo-spatial serial memory: encoding or rehearsal effect?

Science.gov (United States)

Parmentier, Fabrice B R; Andrés, Pilar

2006-11-01

The determinants of visuo-spatial serial memory have been the object of little research, despite early evidence that not all sequences are equally remembered. Recently, empirical evidence was reported indicating that the complexity of the path formed by the to-be-remembered locations impacted on recall performance, defined for example by the presence of crossings in the path formed by successive locations (Parmentier, Elford, & Maybery, 2005). In this study, we examined whether this effect reflects rehearsal or encoding processes. We examined the effect of a retention interval and spatial interference on the ordered recall of spatial sequences with and without path crossings. Path crossings decreased recall performance, as did a retention interval. In line with the encoding hypothesis, but in contrast with the rehearsal hypothesis, the effect of crossing was not affected by the retention interval nor by tapping. The possible nature of the impact of path crossing on encoding mechanisms is discussed.

White Paper on Dish Stirling Technology: Path Toward Commercial Deployment

Energy Technology Data Exchange (ETDEWEB)

Andraka, Charles E. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Concentrating Solar Power Dept.; Stechel, Ellen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Concentrating Solar Power Dept.; Becker, Peter [Stirling Energy Systems, Scottsdale, AZ (United States); Messick, Brian [Stirling Energy Systems, Scottsdale, AZ (United States)

2016-07-01

Dish Stirling energy systems have been developed for distributed and large-scale utility deployment. This report summarizes the state of the technology in a joint project between Stirling Energy Systems, Sandia National Laboratories, and the Department of Energy in 2011. It then lays out a feasible path to large scale deployment, including development needs and anticipated cost reduction paths that will make a viable deployment product.

Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

Science.gov (United States)

Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

2014-01-01

In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

Path coupling and aggregate path coupling

CERN Document Server

Kovchegov, Yevgeniy

2018-01-01

This book describes and characterizes an extension to the classical path coupling method applied to statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, the aggregate path coupling method is used to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibit discontinuous phase transitions which have traditionally been more difficult to analyze rigorously. The book shows how the parameter regions for rapid mixing for several classes of statistical mechanical models are derived using the aggregate path coupling method.

Centralized manure digestion. Selection of locations and estimation of costs of large-scale manure storage application

International Nuclear Information System (INIS)

1995-03-01

A study to assess the possibilities and the consequences of the use of existing Dutch large scale manure silos at centralised anaerobic digestion plants (CAD-plants) for manure and energy-rich organic wastes is carried out. Reconstruction of these large scale manure silos into digesters for a CAD-plant is not self-evident due to the high height/diameter ratio of these silos and the extra investments that have to be made for additional facilities for roofing, insulation, mixing and heating. From the results of an inventory and selection of large scale manure silos with a storage capacity above 1,500 m 3 it appeared that there are 21 locations in The Netherlands that can be qualified for realisation of a CAD plant with a processing capacity of 100 m 3 biomass (80% manure, 20% additives) per day. These locations are found in particular at the 'shortage-areas' for manure fertilisation in the Dutch provinces Groningen and Drenthe. Three of these 21 locations with large scale silos are considered to be the most suitable for realisation of a large scale CAD-plant. The selection is based on an optimal scale for a CAD-plant of 300 m 3 material (80% manure, 20% additives) to be processed per day and the most suitable consuming markets for the biogas produced at the CAD-plant. The three locations are at Middelharnis, Veendam, and Klazinaveen. Applying the conditions as used in this study and accounting for all costs for transport of manure, additives and end-product including the costs for the storage facilities, a break-even operation might be realised at a minimum income for the additives of approximately 50 Dutch guilders per m 3 (including TAV). This income price is considerably lower than the prevailing costs for tipping or processing of organic wastes in The Netherlands. This study revealed that a break-even exploitation of a large scale CAD-plant for the processing of manure with energy-rich additives is possible. (Abstract Truncated)

SEM technique for experimentally locating latch-up paths in integrated circuits

International Nuclear Information System (INIS)

Dressendorfer, P.V.; Armendariz, M.G.

1980-01-01

A technique is presented for using the scanning electron microscope (SEM) in the electron-beam-induced current (EBIC) mode to delineate latch-up paths in CMOS ICs. In the EBIC mode, the current produced by the collection and separation of the electron-beam-generated electron-hole pairs in the space charge regions of the device is measured and used to form an image. Since the collection of these carriers is dependent on space charge region width (and thus junction potential), anything that alters the depletion layer width will affect the collection efficiency. In a latch condition the junctions involved in the latch will be biased differently from those which are not, and thus the EBIC signal from those regions should be measurably different

Using Kalman Filters to Reduce Noise from RFID Location System

Science.gov (United States)

Xavier, José; Reis, Luís Paulo; Petry, Marcelo

2014-01-01

Nowadays, there are many technologies that support location systems involving intrusive and nonintrusive equipment and also varying in terms of precision, range, and cost. However, the developers some time neglect the noise introduced by these systems, which prevents these systems from reaching their full potential. Focused on this problem, in this research work a comparison study between three different filters was performed in order to reduce the noise introduced by a location system based on RFID UWB technology with an associated error of approximately 18 cm. To achieve this goal, a set of experiments was devised and executed using a miniature train moving at constant velocity in a scenario with two distinct shapes—linear and oval. Also, this train was equipped with a varying number of active tags. The obtained results proved that the Kalman Filter achieved better results when compared to the other two filters. Also, this filter increases the performance of the location system by 15% and 12% for the linear and oval paths respectively, when using one tag. For a multiple tags and oval shape similar results were obtained (11–13% of improvement). PMID:24592186

Approximate Shortest Homotopic Paths in Weighted Regions

KAUST Repository

Cheng, Siu-Wing

2010-01-01

Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.

Approximate shortest homotopic paths in weighted regions

KAUST Repository

Cheng, Siuwing

2012-02-01

A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn polylog (k,n,1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2012 World Scientific Publishing Company.

Path Creation, Path Dependence and Breaking Away from the Path

OpenAIRE

Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

2016-01-01

The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

The effect of location and facility demand on the marginal cost of delivered wood chips from energy crops: A case study of the state of Tennessee

International Nuclear Information System (INIS)

Graham, R.L.; Liu, W.; Downing, M.; Noon, C.; Daly, M.; Moore, A.

1995-01-01

Cost-supply curves for delivered wood chips from short rotation woody crops were calculated for 21 regularly-spaced locations spanning the state of Tennessee. These curves were used to systematically evaluate the combined effects of location and facility demand on wood chip feedstock costs in Tennessee. The cost-supply curves were developed using BRAVO, a GIS-based decision support system which calculates marginal cost of delivering wood chips to a specific location given road network maps and maps of farmgate prices and supplies of woody chips from short rotation energy crops. Marginal costs of delivered chips varied by both facility location in the state and facility demand. Marginal costs were lowest in central Tennessee unless the facility demand was greater than 2.7 million dry Mg per year (3 million dry tons per year) in which case west Tennessee was the lowest cost region. Marginal costs rose rapidly with increasing facility demand in the mountainous eastern portion of the state. Transportation costs accounted for 18 to 29% of the delivered cost and ranged between $8 and $18/dry Mg ($7 and $16/dry ton). Reducing the expected farmer participation rate from 100% to 50% or 25% dramatically raised the marginal costs of feedstock supply in the east and central regions of the state. The analysis demonstrates the need to use geographically-specific information when projecting the potential costs and supplies of biomass feedstock

Characterizing the speed and paths of shared bicycles in Lyon

OpenAIRE

Jensen , Pablo; Rouquier , Jean-Baptiste; Ovtracht , Nicolas; Robardet , Céline

2010-01-01

Thanks to numerical data gathered by Lyon's shared bicycling system V\\'elo'v, we are able to analyze 11.6 millions bicycle trips, leading to the first robust characterization of urban bikers' behaviors. We show that bicycles outstrip cars in downtown Lyon, by combining high speed and short paths.These data also allows us to calculate V\\'elo'v fluxes on all streets, pointing to interesting locations for bike paths.

The antisaccade task: visual distractors elicit a location-independent planning 'cost'.

Science.gov (United States)

DeSimone, Jesse C; Everling, Stefan; Heath, Matthew

2015-01-01

The presentation of a remote - but not proximal - distractor concurrent with target onset increases prosaccade reaction times (RT) (i.e., the remote distractor effect: RDE). The competitive integration model asserts that the RDE represents the time required to resolve the conflict for a common saccade threshold between target- and distractor-related saccade generating commands in the superior colliculus. To our knowledge however, no previous research has examined whether remote and proximal distractors differentially influence antisaccade RTs. This represents a notable question because antisaccades require decoupling of the spatial relations between stimulus and response (SR) and therefore provide a basis for determining whether the sensory- and/or motor-related features of a distractor influence response planning. Participants completed pro- and antisaccades in a target-only condition and conditions wherein the target was concurrently presented with a proximal or remote distractor. As expected, prosaccade RTs elicited a reliable RDE. In contrast, antisaccade RTs were increased independent of the distractor's spatial location and the magnitude of the effect was comparable across each distractor location. Thus, distractor-related antisaccade RT costs are not accounted for by a competitive integration between conflicting saccade generating commands. Instead, we propose that a visual distractor increases uncertainty related to the evocation of the response-selection rule necessary for decoupling SR relations.

The principal nuclear wastes paths at the Cea

International Nuclear Information System (INIS)

Toly, J.A.

2001-01-01

The different channels of radioactive waste are detailed, the objectives, the particularities, the costs for the different paths are reviewed, and the question of the waste acceptance by the public is a part in the choice of solutions. (N.C.)

A Socio-Ecological Approach to GIS Least-Cost Modelling for Regional Mining Infrastructure Planning: A Case Study from South-East Sulawesi, Indonesia

Directory of Open Access Journals (Sweden)

Alex M. Lechner

2017-01-01

Full Text Available Regional planning approaches to mining infrastructure aim to reduce the conflict associated with mining operations and existing land uses, such as urban areas and biodiversity conservation, as well as the cumulative impacts that occur offsite. In this paper, we describe a method for conducting Geographical Information System (GIS least-cost path and least-cost corridor analysis for linear mining infrastructure, such as roads. Least-cost path analysis identifies the optimal pathways between two locations as a function of the cost of traveling through different land use/cover types. In a case study from South-East Sulawesi, Indonesia, we identify potential linear networks for road infrastructure connecting mines, smelters, and ports. The method used interview data from government officials to characterise their orientation (perceived importance and positive/negative attitude toward the social and environmental factors associated with mining infrastructure. A cost-surface was constructed by integrating spatial layers representing the social and environmental factors to identify areas that should be avoided and areas that were compatible with linear infrastructure using the least-cost path analysis. We compared infrastructure scenario outputs from local and national government officials by the degree of spatial overlap and found broad spatial agreement for infrastructure corridors. We conclude by discussing this approach in relation to the wider social-ecological and mine planning literature and how quantitative approaches can reduce the conflict associated with infrastructure planning.

MANAGING HANFORD'S LEGACY NO-PATH-FORWARD WASTES TO DISPOSITION

International Nuclear Information System (INIS)

West, L.D.

2011-01-01

The U.S. Department of Energy (DOE) Richland Operations Office (RL) has adopted the 2015 Vision for Cleanup of the Hanford Site. This vision will protect the Columbia River, reduce the Site footprint, and reduce Site mortgage costs. The CH2M HILL Plateau Remediation Company's (CHPRC) Waste and Fuels Management Project (W and FMP) and their partners support this mission by providing centralized waste management services for the Hanford Site waste generating organizations. At the time of the CHPRC contract award (August 2008) slightly more than 9,000 m 3 of waste was defined as 'no-path-forward waste.' The majority of these wastes are suspect transuranic mixed (TRUM) wastes which are currently stored in the low-level Burial Grounds (LLBG), or stored above ground in the Central Waste Complex (CWC). A portion of the waste will be generated during ongoing and future site cleanup activities. The DOE-RL and CHPRC have collaborated to identify and deliver safe, cost-effective disposition paths for 90% (∼8,000 m 3 ) of these problematic wastes. These paths include accelerated disposition through expanded use of offsite treatment capabilities. Disposal paths were selected that minimize the need to develop new technologies, minimize the need for new, on-site capabilities, and accelerate shipments of transuranic (TRU) waste to the Waste Isolation Pilot Plant (WIPP) in Carlsbad, New Mexico.

Using step and path selection functions for estimating resistance to movement: Pumas as a case study

Science.gov (United States)

Katherine A. Zeller; Kevin McGarigal; Samuel A. Cushman; Paul Beier; T. Winston Vickers; Walter M. Boyce

2015-01-01

GPS telemetry collars and their ability to acquire accurate and consistently frequent locations have increased the use of step selection functions (SSFs) and path selection functions (PathSFs) for studying animal movement and estimating resistance. However, previously published SSFs and PathSFs often do not accommodate multiple scales or multiscale modeling....

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian

2017-01-07

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang; Ding, Qingzhu; Li, Qing

2017-01-01

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

KAUST Repository

Fareed, Muhammad Mehboob

2014-01-06

In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

KAUST Repository

Fareed, Muhammad Mehboob; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2014-01-01

In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

i-Locate - Indoor/Outdoor location and Asset Management through Open Data

Directory of Open Access Journals (Sweden)

Claudio Eccher

2015-02-01

Full Text Available Studi recenti hanno evidenziato che, in media, trascorriamo circa il 90% del nostro tempo in ambienti chiusi e, spesso, non familiari. L’esigenza di localizzare/guidare persone o ogg etti in spazi sia esterni che interni (senza discontinuità tra esterno ed interno darà origine ad una serie di nuovi servizi di tipo LBS (Location-Based Services che potranno avere anche una notevole rilevanza economica. i-locate (Indoor / outdoor location and Asset Management Through open geodata is a project that aims to develop a set of tools and services based on geo location technologies based on open data for the location and management of objects in indoor and outdoor spaces. The tools are intended both to citizens who use their smartphones to access services, aids to navigation from the front door to internal destinations to buildings (public office, clinic, shop, etc.. Obtaining any information available to support (code , unforeseen changes in the path, suggestions, etc., and professionals for specific activities that require the location of people, equipment, etc. i-locate to an intense use of GIS technologies for navigation and tracking "indoor" (indoor GIS, 3D GIS, to locate people (eg. Alzheimer's patients and their movements in areas not suited (geofencing to identify and track objects / portable equipment for their location, management and maintenance.

i-Locate - Indoor/Outdoor location and Asset Management through Open Data

Directory of Open Access Journals (Sweden)

Claudio Eccher

2015-02-01

Full Text Available Studi recenti hanno evidenziato che, in media, trascorriamo circa il 90% del nostro tempo in ambienti chiusi e, spesso, non familiari. L’esigenza di localizzare/guidare persone o ogg etti in spazi sia esterni che interni (senza discontinuità tra esterno ed interno darà origine ad una serie di nuovi servizi di tipo LBS (Location-Based Services che potranno avere anche una notevole rilevanza economica.i-locate (Indoor / outdoor location and Asset Management Through open geodata is a project that aims to develop a set of tools and services based on geo location technologies based on open data for the location and management of objects in indoor and outdoor spaces. The tools are intended both to citizens who use their smartphones to access services, aids to navigation from the front door to internal destinations to buildings (public office, clinic, shop, etc.. Obtaining any information available to support (code , unforeseen changes in the path, suggestions, etc., and professionals for specific activities that require the location of people, equipment, etc. i-locate to an intense use of GIS technologies for navigation and tracking "indoor" (indoor GIS, 3D GIS, to locate people (eg. Alzheimer's patients and their movements in areas not suited (geofencing to identify and track objects / portable equipment for their location, management and maintenance.

Magnetized Target Fusion (MTF): A Low-Cost Fusion Development Path

International Nuclear Information System (INIS)

Lindemuth, I.R.; Siemon, R.E.; Kirkpatrick, R.C.; Reinovsky, R.E.

1998-01-01

Simple transport-based scaling laws are derived to show that a density and time regime intermediate between conventional magnetic confinement and conventional inertial confinement offers attractive reductions in system size and energy when compared to magnetic confinement and attractive reductions in heating power and intensity when compared to inertial confinement. This intermediate parameter space appears to be readily accessible by existing and near term pulsed power technologies. Hence, the technology of the Megagauss conference opens up an attractive path to controlled thermonuclear fusion

Path Dependency

OpenAIRE

Mark Setterfield

2015-01-01

Path dependency is defined, and three different specific concepts of path dependency – cumulative causation, lock in, and hysteresis – are analyzed. The relationships between path dependency and equilibrium, and path dependency and fundamental uncertainty are also discussed. Finally, a typology of dynamical systems is developed to clarify these relationships.

On the Path to SunShot - Emerging Opportunities and Challenges in U.S. Solar Manufacturing

Energy Technology Data Exchange (ETDEWEB)

Chung, Donald [National Renewable Energy Lab. (NREL), Golden, CO (United States); Horowitz, Kelsey [National Renewable Energy Lab. (NREL), Golden, CO (United States); Kurup, Parthiv [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2016-05-01

Innovation-driven cost and performance improvements, along with strong projected solar demand in the United States and across the Americas, could increase the attractiveness of U.S.-based solar manufacturing (see Chung et al. 2016). Although improvements to standard PV modules have produced deep cost reductions over the past 5 years, the returns on such incremental improvements appear to be diminishing, and more dramatic innovations in module design and manufacturing are required to continue along the path of rapid progress. At the same time, major opportunities exist for innovation to unlock the potential of CSP technologies. This need for innovation could benefit U.S. PV and CSP manufacturers. The United States has been rated one of the world’s most competitive and innovative countries as well as one of the best locations for PV manufacturing. It is a global leader in PV and CSP R&D and patent production, and U.S. PV manufacturers are already pursuing highly differentiated innovations.

GIS-based approach for defining bioenergy facilities location: A case study in Northern Spain based on marginal delivery costs and resources competition between facilities

Energy Technology Data Exchange (ETDEWEB)

Panichelli, Luis; Gnansounou, Edgard [Laboratory of Energy Systems, Swiss Federal Institute of Technology, LASEN-ICARE-ENAC, Station 18, EPFL, CH-1015 Lausanne (Switzerland)

2008-04-15

This paper presents a GIS-based decision support system for selecting least-cost bioenergy locations when there is a significant variability in biomass farmgate price and when more than one bioenergy plant with a fixed capacity has to be placed in the region. The methodology tackles the resources competition problem between energy facilities through a location-allocation model based on least-cost biomass quantities. Whole system least delivery cost including intermediate bioenergy products is estimated. The methodology is based on a case study where forest wood residues (FWR) from final cuttings (FCs) are used to produce torrefied wood (TW) in two torrefaction plants (TUs) that supply a gasification unit (GU) in order to produce electricity. The provinces of Navarra, Bizkaia, Gipuzkoa, Alava, La Rioja, Cantabria and Burgos are assessed in order to find the best locations for settling down the TUs and the GU according to biomass availability, FWR and TW marginal delivery costs. (author)

Appraising manufacturing location

NARCIS (Netherlands)

Steenhuis, H.J.; de Bruijn, E.J.

2002-01-01

International location of manufacturing activities is an issue for managers of manufacturing companies as well as public policy makers. For managers, the issue is relevant because international locations offer opportunities for lowering costs due to productivity improvements. For governments the

Path planning algorithms for assembly sequence planning. [in robot kinematics

Science.gov (United States)

Krishnan, S. S.; Sanderson, Arthur C.

1991-01-01

Planning for manipulation in complex environments often requires reasoning about the geometric and mechanical constraints which are posed by the task. In planning assembly operations, the automatic generation of operations sequences depends on the geometric feasibility of paths which permit parts to be joined into subassemblies. Feasible locations and collision-free paths must be present for part motions, robot and grasping motions, and fixtures. This paper describes an approach to reasoning about the feasibility of straight-line paths among three-dimensional polyhedral parts using an algebra of polyhedral cones. A second method recasts the feasibility conditions as constraints in a nonlinear optimization framework. Both algorithms have been implemented and results are presented.

Designing and evaluation of three alternatives highway routes using the Analytical Hierarchy Process and the least-cost path analysis, application in Sinai Peninsula, Egypt

Directory of Open Access Journals (Sweden)

Hala A. Effat

2013-12-01

Full Text Available Land use planning in a remote desert zone is usually dependent on an efficient corridor and main road network system. In this paper, Geographic Information System (GIS tools were used to develop a least-cost path for a corridor to link three cities in Sinai Peninsula desert environment. It is supposed to create a backbone for developing the middle part of peninsula by facilitating the transport of mineral resources and accessibility to such region and encourage populating the remote desert city of Nekhel and the coastal cities of Taba and El Shatt. Therefore, such a route should have the least cost and should be protected from the negative impacts that may be caused by the surrounding environment. Environmental and economical factors were integrated through a spatial multicriteria model using the Analytical Hierarchy Process. Cost factors were identified and a cost surface was created for each factor, standardized, weighed and aggregated. Three visions were modelled: an engineering vision, an environmental vision and a hybrid vision. A multicriteria evaluation was used to compare the three routes. The hybrid route was finally recommended.

A Sun Path Observation System Based on Augment Reality and Mobile Learning

Directory of Open Access Journals (Sweden)

Wernhuar Tarng

2018-01-01

Full Text Available This study uses the augmented reality technology and sensor functions of GPS, electronic compass, and three-axis accelerometer on mobile devices to develop a Sun path observation system for applications in astronomy education. The orientation and elevation of the Sun can be calculated by the system according to the user’s location and local time to simulate the Sun path. When holding the mobile device toward the sky, the screen will show the virtual Sun at the same position as that of the real Sun. The user can record the Sun path and the data of observation date, time, longitude, and latitude using the celestial hemisphere and the pole shadow on the system. By setting different observation times and locations, it can be seen that the Sun path changes with seasons and latitudes. The system provides contextual awareness of the Sun path concepts, and it can convert the observation data into organized and meaningful astronomical knowledge to enable combination of situated learning with spatial cognition. The system can solve the problem of being not able to record the Sun path due to a bad weather or topographical restrictions, and therefore it is helpful for elementary students when conducting observations. A teaching experiment has been conducted to analyze the learning achievement of students after using the system, and the results show that it is more effective than traditional teaching aids. The questionnaire results also reveal that the system is easy to operate and useful in recording the Sun path data. Therefore, it is an effective tool for astronomy education in elementary schools.

Intelligent coverage path planning for agricultural robots and autonomous machines on three-dimensional terrain

DEFF Research Database (Denmark)

Hameed, Ibahim

2014-01-01

Field operations should be done in a manner that minimizes time and travels over the field surface. Automated and intelligent path planning can help to find the best coverage path so that costs of various field operations can be minimized. The algorithms for generating an optimized field coverage...

Learning to improve path planning performance

International Nuclear Information System (INIS)

Chen, Pang C.

1995-04-01

In robotics, path planning refers to finding a short. collision-free path from an initial robot configuration to a desired configuratioin. It has to be fast to support real-time task-level robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To remedy this situation, we present and analyze a learning algorithm that uses past experience to increase future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a speedup-learning framework in which a slow but capable planner may be improved both cost-wise and capability-wise by a faster but less capable planner coupled with experience. The basic algorithm is suitable for stationary environments, and can be extended to accommodate changing environments with on-demand experience repair and object-attached experience abstraction. To analyze the algorithm, we characterize the situations in which the adaptive planner is useful, provide quantitative bounds to predict its behavior, and confirm our theoretical results with experiments in path planning of manipulators. Our algorithm and analysis are sufficiently, general that they may also be applied to other planning domains in which experience is useful

Residential Location, Job Location, and Wages: Theory and Empirics

DEFF Research Database (Denmark)

Vejlin, Rune Majlund

-to-job transition without changing workplace location. However, workers making a job-to-job transition which makes the workplace location closer to the residence experiences a wage drop. Furthermore, low wage workers and workers with high transportation costs are more likely to make job-to-job transitions, but also......I develop a stylized partial on-the-job equilibrium search model which incorporate a spatial dimension. Workers reside on a circle and can move at a cost. Each point on the circle has a wage distribution. Implications about wages and job mobility are drawn from the model and tested on Danish...... matched employer-employee data. The model predictions hold true. I find that workers working farther away from their residence earn higher wages. When a worker is making a job-to-job transition where he changes workplace location he experiences a higher wage change than a worker making a job...

Quivers of Bound Path Algebras and Bound Path Coalgebras

Directory of Open Access Journals (Sweden)

Dr. Intan Muchtadi

2010-09-01

Full Text Available bras and coalgebras can be represented as quiver (directed graph, and from quiver we can construct algebras and coalgebras called path algebras and path coalgebras. In this paper we show that the quiver of a bound path coalgebra (resp. algebra is the dual quiver of its bound path algebra (resp. coalgebra.

Fractional path planning and path tracking

International Nuclear Information System (INIS)

Melchior, P.; Jallouli-Khlif, R.; Metoui, B.

2011-01-01

This paper presents the main results of the application of fractional approach in path planning and path tracking. A new robust path planning design for mobile robot was studied in dynamic environment. The normalized attractive force applied to the robot is based on a fictitious fractional attractive potential. This method allows to obtain robust path planning despite robot mass variation. The danger level of each obstacles is characterized by the fractional order of the repulsive potential of the obstacles. Under these conditions, the robot dynamic behavior was studied by analyzing its X - Y path planning with dynamic target or dynamic obstacles. The case of simultaneously mobile obstacles and target is also considered. The influence of the robot mass variation is studied and the robustness analysis of the obtained path shows the robustness improvement due to the non integer order properties. Pre shaping approach is used to reduce system vibration in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual vibration. This technique, developed by N.C. Singer and W.P.Seering, is used for flexible structure control, particularly in the aerospace field. In a previous work, this method was extended for explicit fractional derivative systems and applied to second generation CRONE control, the robustness was also studied. CRONE (the French acronym of C ommande Robuste d'Ordre Non Entier ) control system design is a frequency-domain based methodology using complex fractional integration.

Physical mechanism of mind changes and tradeoffs among speed, accuracy, and energy cost in brain decision making: Landscape, flux, and path perspectives

International Nuclear Information System (INIS)

Yan Han; Wang Jin; Zhang Kun

2016-01-01

Cognitive behaviors are determined by underlying neural networks. Many brain functions, such as learning and memory, have been successfully described by attractor dynamics. For decision making in the brain, a quantitative description of global attractor landscapes has not yet been completely given. Here, we developed a theoretical framework to quantify the landscape associated with the steady state probability distributions and associated steady state curl flux, measuring the degree of non-equilibrium through the degree of detailed balance breaking for decision making. We quantified the decision-making processes with optimal paths from the undecided attractor states to the decided attractor states, which are identified as basins of attractions, on the landscape. Both landscape and flux determine the kinetic paths and speed. The kinetics and global stability of decision making are explored by quantifying the landscape topography through the barrier heights and the mean first passage time. Our theoretical predictions are in agreement with experimental observations: more errors occur under time pressure. We quantitatively explored two mechanisms of the speed-accuracy tradeoff with speed emphasis and further uncovered the tradeoffs among speed, accuracy, and energy cost. Our results imply that there is an optimal balance among speed, accuracy, and the energy cost in decision making. We uncovered the possible mechanisms of changes of mind and how mind changes improve performance in decision processes. Our landscape approach can help facilitate an understanding of the underlying physical mechanisms of cognitive processes and identify the key factors in the corresponding neural networks. (paper)

Simulation and validation of concentrated subsurface lateral flow paths in an agricultural landscape

Science.gov (United States)

Zhu, Q.; Lin, H. S.

2009-08-01

The importance of soil water flow paths to the transport of nutrients and contaminants has long been recognized. However, effective means of detecting concentrated subsurface flow paths in a large landscape are still lacking. The flow direction and accumulation algorithm based on single-direction flow algorithm (D8) in GIS hydrologic modeling is a cost-effective way to simulate potential concentrated flow paths over a large area once relevant data are collected. This study tested the D8 algorithm for simulating concentrated lateral flow paths at three interfaces in soil profiles in a 19.5-ha agricultural landscape in central Pennsylvania, USA. These interfaces were (1) the interface between surface plowed layers of Ap1 and Ap2 horizons, (2) the interface with subsoil water-restricting clay layer where clay content increased to over 40%, and (3) the soil-bedrock interface. The simulated flow paths were validated through soil hydrologic monitoring, geophysical surveys, and observable soil morphological features. The results confirmed that concentrated subsurface lateral flow occurred at the interfaces with the clay layer and the underlying bedrock. At these two interfaces, the soils on the simulated flow paths were closer to saturation and showed more temporally unstable moisture dynamics than those off the simulated flow paths. Apparent electrical conductivity in the soil on the simulated flow paths was elevated and temporally unstable as compared to those outside the simulated paths. The soil cores collected from the simulated flow paths showed significantly higher Mn content at these interfaces than those away from the simulated paths. These results suggest that (1) the D8 algorithm is useful in simulating possible concentrated subsurface lateral flow paths if used with appropriate threshold value of contributing area and sufficiently detailed digital elevation model (DEM); (2) repeated electromagnetic surveys can reflect the temporal change of soil water storage

A bat algorithm with mutation for UCAV path planning.

Science.gov (United States)

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.

Analysis Of Economic Motivation When Individuals Choose An Educational Path

Directory of Open Access Journals (Sweden)

Viktor Anatolyevich Koksharov

2015-03-01

Full Text Available The authors consider the economic motivations when individuals choose an educational path. This line of research is relevant from both, the point of view of science — research of economic behavior of an individual, and the point of view of practice — allows to increase efficiency of investments in a human capital. The authors have developed the economic and mathematical model of choice of optimum educational paths by individuals. The model is realized in the software and approved on real data on more than 5,5 thousand students. For the analysis of the importance of rational economic expectations when an educational path has to be chosen, the paths chosen by students is compared and the educational paths optimum from the point of view of economic rationality are calculated. The analysis of the results has showed that mainly, the choice of educational paths happens according to the economic motivations. On the considered selection, 66 % of prospective students have chosen an optimum path from the point of view of economic preferences. The most significant factor providing development of optimum educational paths is an expectation of higher income upon completion of education — 22 % of all educational paths, and a possibility of cost-cutting of educating or state-subsidized education — 12 %. In our opinion, one of the most important practical results of the research of optimum educational path is the need to consider expectations of students and prospective student when developing a state policy of investment in human capital.

Potential Offshore Wind Energy Areas in California: An Assessment of Locations, Technology, and Costs

Energy Technology Data Exchange (ETDEWEB)

Musial, Walter [National Renewable Energy Lab. (NREL), Golden, CO (United States); Beiter, Philipp [National Renewable Energy Lab. (NREL), Golden, CO (United States); Tegen, Suzanne [National Renewable Energy Lab. (NREL), Golden, CO (United States); Smith, Aaron [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2016-12-01

This report summarizes a study of possible offshore wind energy locations, technologies, and levelized cost of energy in the state of California between 2015 and 2030. The study was funded by the U.S. Department of the Interior's Bureau of Ocean Energy Management (BOEM), the federal agency responsible for regulating renewable energy development on the Outer Continental Shelf. It is based on reference wind energy areas where representative technology and performance characteristics were evaluated. These reference areas were identified as sites that were suitable to represent offshore wind cost and technology based on physical site conditions, wind resource quality, known existing site use, and proximity to necessary infrastructure. The purpose of this study is to assist energy policy decision-making by state utilities, independent system operators, state government officials and policymakers, BOEM, and its key stakeholders. The report is not intended to serve as a prescreening exercise for possible future offshore wind development.

New spatial clustering-based models for optimal urban facility location considering geographical obstacles

Science.gov (United States)

Javadi, Maryam; Shahrabi, Jamal

2014-03-01

The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which focused on solving facility location problems by performing spatial clustering, have used the Euclidean distance between two points as the dissimilarity function. Natural obstacles, such as mountains and rivers, can have drastic impacts on the distance that needs to be traveled between two geographical locations. While calculating the distance between various supply chain entities (including facilities and demand points), it is necessary to take such obstacles into account to obtain better and more realistic results regarding location-allocation. In this article, new models were presented for location of urban facilities while considering geographical obstacles at the same time. In these models, three new distance functions were proposed. The first function was based on the analysis of shortest path in linear network, which was called SPD function. The other two functions, namely PD and P2D, were based on the algorithms that deal with robot geometry and route-based robot navigation in the presence of obstacles. The models were implemented in ArcGIS Desktop 9.2 software using the visual basic programming language. These models were evaluated using synthetic and real data sets. The overall performance was evaluated based on the sum of distance from demand points to their corresponding facilities. Because of the distance between the demand points and facilities becoming more realistic in the proposed functions, results indicated desired quality of the proposed models in terms of quality of allocating points to centers and logistic cost. Obtained results show promising

An adaptive dual-optimal path-planning technique for unmanned air vehicles

Directory of Open Access Journals (Sweden)

Whitfield Clifford A.

2016-01-01

Full Text Available A multi-objective technique for unmanned air vehicle path-planning generation through task allocation has been developed. The dual-optimal path-planning technique generates real-time adaptive flight paths based on available flight windows and environmental influenced objectives. The environmentally-influenced flight condition determines the aircraft optimal orientation within a downstream virtual window of possible vehicle destinations that is based on the vehicle’s kinematics. The intermittent results are then pursued by a dynamic optimization technique to determine the flight path. This path-planning technique is a multi-objective optimization procedure consisting of two goals that do not require additional information to combine the conflicting objectives into a single-objective. The technique was applied to solar-regenerative high altitude long endurance flight which can benefit significantly from an adaptive real-time path-planning technique. The objectives were to determine the minimum power required flight paths while maintaining maximum solar power for continual surveillance over an area of interest (AOI. The simulated path generation technique prolonged the flight duration over a sustained turn loiter flight path by approximately 2 months for a year of flight. The potential for prolonged solar powered flight was consistent for all latitude locations, including 2 months of available flight at 60° latitude, where sustained turn flight was no longer capable.

Robust Sensor Placements at Informative and Communication-efficient Locations

Science.gov (United States)

2010-08-01

tree T ∗ with cost `∗, spanning a setA∗. Then PSPIEL can find a tree T with costO (r dim(V,E))×`∗, spanning a setAwith expected sensing quality F (A...V, E), s, t ∈ V and an (r, γ)-local monotone submodular function F , PSPIEL will find an s− t path P with costO (r dim(V,E))× `∗, spanning a setA with

A proposal to design a Location-based Mobile Cardiac Emergency System (LMCES).

Science.gov (United States)

Keikhosrokiani, Pantea; Mustaffa, Norlia; Zakaria, Nasriah; Sarwar, Muhammad Imran

2012-01-01

Healthcare for elderly people has become a vital issue. The Wearable Health Monitoring System (WHMS) is used to manage and monitor chronic disease in elderly people, postoperative rehabilitation patients and persons with special needs. Location-aware healthcare is achievable as positioning systems and telecommunications have been developed and have fulfilled the technology needed for this kind of healthcare system. In this paper, the researchers propose a Location-Based Mobile Cardiac Emergency System (LMCES) to track the patient's current location when Emergency Medical Services (EMS) has been activated as well as to locate the nearest healthcare unit for the ambulance service. The location coordinates of the patients can be retrieved by GPS and sent to the healthcare centre using GPRS. The location of the patient, cell ID information will also be transmitted to the LMCES server in order to retrieve the nearest health care unit. For the LMCES, we use Dijkstra's algorithm for selecting the shortest path between the nearest healthcare unit and the patient location in order to facilitate the ambulance's path under critical conditions.

Accelerating cleanup. Paths to closure Hanford Site

International Nuclear Information System (INIS)

Edwards, C.

1998-01-01

This document was previously referred to as the Draft 2006 Plan. As part of the DOE's national strategy, the Richland Operations Office's Paths to Closure summarizes an integrated path forward for environmental cleanup at the Hanford Site. The Hanford Site underwent a concerted effort between 1994 and 1996 to accelerate the cleanup of the Site. These efforts are reflected in the current Site Baseline. This document describes the current Site Baseline and suggests strategies for further improvements in scope, schedule and cost. The Environmental Management program decided to change the name of the draft strategy and the document describing it in response to a series of stakeholder concerns, including the practicality of achieving widespread cleanup by 2006. Also, EM was concerned that calling the document a plan could be misconstrued to be a proposal by DOE or a decision-making document. The change in name, however, does not diminish the 2006 vision. To that end, Paths to Closure retains a focus on 2006, which serves as a point in time around which objectives and goals are established

Location Prediction Based on Transition Probability Matrices Constructing from Sequential Rules for Spatial-Temporal K-Anonymity Dataset

Science.gov (United States)

Liu, Zhao; Zhu, Yunhong; Wu, Chenxue

2016-01-01

Spatial-temporal k-anonymity has become a mainstream approach among techniques for protection of users’ privacy in location-based services (LBS) applications, and has been applied to several variants such as LBS snapshot queries and continuous queries. Analyzing large-scale spatial-temporal anonymity sets may benefit several LBS applications. In this paper, we propose two location prediction methods based on transition probability matrices constructing from sequential rules for spatial-temporal k-anonymity dataset. First, we define single-step sequential rules mined from sequential spatial-temporal k-anonymity datasets generated from continuous LBS queries for multiple users. We then construct transition probability matrices from mined single-step sequential rules, and normalize the transition probabilities in the transition matrices. Next, we regard a mobility model for an LBS requester as a stationary stochastic process and compute the n-step transition probability matrices by raising the normalized transition probability matrices to the power n. Furthermore, we propose two location prediction methods: rough prediction and accurate prediction. The former achieves the probabilities of arriving at target locations along simple paths those include only current locations, target locations and transition steps. By iteratively combining the probabilities for simple paths with n steps and the probabilities for detailed paths with n-1 steps, the latter method calculates transition probabilities for detailed paths with n steps from current locations to target locations. Finally, we conduct extensive experiments, and correctness and flexibility of our proposed algorithm have been verified. PMID:27508502

Feynman's path integrals and Bohm's particle paths

International Nuclear Information System (INIS)

Tumulka, Roderich

2005-01-01

Both Bohmian mechanics, a version of quantum mechanics with trajectories, and Feynman's path integral formalism have something to do with particle paths in space and time. The question thus arises how the two ideas relate to each other. In short, the answer is, path integrals provide a re-formulation of Schroedinger's equation, which is half of the defining equations of Bohmian mechanics. I try to give a clear and concise description of the various aspects of the situation. (letters and comments)

Spatial Updating Strategy Affects the Reference Frame in Path Integration.

Science.gov (United States)

He, Qiliang; McNamara, Timothy P

2018-06-01

This study investigated how spatial updating strategies affected the selection of reference frames in path integration. Participants walked an outbound path consisting of three successive waypoints in a featureless environment and then pointed to the first waypoint. We manipulated the alignment of participants' final heading at the end of the outbound path with their initial heading to examine the adopted reference frame. We assumed that the initial heading defined the principal reference direction in an allocentric reference frame. In Experiment 1, participants were instructed to use a configural updating strategy and to monitor the shape of the outbound path while they walked it. Pointing performance was best when the final heading was aligned with the initial heading, indicating the use of an allocentric reference frame. In Experiment 2, participants were instructed to use a continuous updating strategy and to keep track of the location of the first waypoint while walking the outbound path. Pointing performance was equivalent regardless of the alignment between the final and the initial headings, indicating the use of an egocentric reference frame. These results confirmed that people could employ different spatial updating strategies in path integration (Wiener, Berthoz, & Wolbers Experimental Brain Research 208(1) 61-71, 2011), and suggested that these strategies could affect the selection of the reference frame for path integration.

MANAGING HANFORD'S LEGACY NO-PATH-FORWARD WASTES TO DISPOSITION

Energy Technology Data Exchange (ETDEWEB)

WEST LD

2011-01-13

The U.S. Department of Energy (DOE) Richland Operations Office (RL) has adopted the 2015 Vision for Cleanup of the Hanford Site. This vision will protect the Columbia River, reduce the Site footprint, and reduce Site mortgage costs. The CH2M HILL Plateau Remediation Company's (CHPRC) Waste and Fuels Management Project (W&FMP) and their partners support this mission by providing centralized waste management services for the Hanford Site waste generating organizations. At the time of the CHPRC contract award (August 2008) slightly more than 9,000 m{sup 3} of waste was defined as 'no-path-forward waste.' The majority of these wastes are suspect transuranic mixed (TRUM) wastes which are currently stored in the low-level Burial Grounds (LLBG), or stored above ground in the Central Waste Complex (CWC). A portion of the waste will be generated during ongoing and future site cleanup activities. The DOE-RL and CHPRC have collaborated to identify and deliver safe, cost-effective disposition paths for 90% ({approx}8,000 m{sup 3}) of these problematic wastes. These paths include accelerated disposition through expanded use of offsite treatment capabilities. Disposal paths were selected that minimize the need to develop new technologies, minimize the need for new, on-site capabilities, and accelerate shipments of transuranic (TRU) waste to the Waste Isolation Pilot Plant (WIPP) in Carlsbad, New Mexico.

Multi-Dimensional Path Queries

DEFF Research Database (Denmark)

Bækgaard, Lars

1998-01-01

to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path...

Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1981-01-01

Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

Path Forward to Space Solar Power using the O'Neill - Glaser Model Modified for Climate Change Demand and Considering the Increasing Risk of Human Self-Extinction if Confined to Earth

Science.gov (United States)

Curreri, Peter A.; Nall, Mark

2013-01-01

The cost of energy is humanity's economic exchange rate with the universe. Space solar power is the first great step that our technological species has to utilize the energy of its star. The classic Peter Glaser Solar Power Satellite, SPS, and later designs collect a large area of solar energy in space and beam it back to Earth for use in the electric grid, but even with optimistic launch costs and technology innovation a clear economic path is not evident using Earth launch of SPS. O Neill in 1969 solved the transportation costs problem by a model that uses lunar and asteroid materials to build SPS and locates the labor force permanently in space (O Neill free space habitats). This solution closes the economics and predicts large profits after 17-35 years. However the costs of time have up to now prevented this solution. We discuss a strategy to move forward in SPS with the motivations to stop global warming and prevent human selfextinction. There are near term steps that can be taken that place us on this path forward. First, we must reevaluate the technologies for the classic model and update the parameters to current technology. As technological capability continues to increase exponentially, we need to understand when the monetary potential energy hills are small as the technology gets larger. But the chance for self-extinction, if humanity remains in a single vulnerable habitat, also increased exponentially with time. The path forward is to identify investment points while assessing the risks of non-action.

Location Systems An Introduction to the Technology Behind Location Awareness

CERN Document Server

LaMarca, Anthony

2008-01-01

Advances in electronic location technology and the coming of age of mobile computing have opened the door for location-aware applications to permeate all aspects of everyday life. Location is at the core of a large number of high-value applications ranging from the life-and-death context of emergency response to serendipitous social meet-ups. For example, the market for GPS products and services alone is expected to grow to US200 billion by 2015. Unfortunately, there is no single location technology that is good for every situation and exhibits high accuracy, low cost, and universal coverage.

Charting a Path to Location Intelligence for STD Control.

Science.gov (United States)

Gerber, Todd M; Du, Ping; Armstrong-Brown, Janelle; McNutt, Louise-Anne; Coles, F Bruce

2009-01-01

This article describes the New York State Department of Health's GeoDatabase project, which developed new methods and techniques for designing and building a geocoding and mapping data repository for sexually transmitted disease (STD) control. The GeoDatabase development was supported through the Centers for Disease Control and Prevention's Outcome Assessment through Systems of Integrated Surveillance workgroup. The design and operation of the GeoDatabase relied upon commercial-off-the-shelf tools that other public health programs may also use for disease-control systems. This article provides a blueprint of the structure and software used to build the GeoDatabase and integrate location data from multiple data sources into the everyday activities of STD control programs.

Dynamic Path Exploration on Mobile Devices

KAUST Repository

Birsak, Michael

2017-03-31

We present a novel framework for visualizing routes on mobile devices. Our framework is suitable for helping users explore their environment. First, given a starting point and a maximum route length, the system retrieves nearby points of interest (POIs). Second, we automatically compute an attractive walking path through the environment trying to pass by as many highly ranked POIs as possible. Third, we automatically compute a route visualization that shows the current user position, POI locations via pins, and detail lenses for more information about the POIs. The visualization is an animation of an orthographic map view that follows the current user position. We propose an optimization based on a binary integer program (BIP) that models multiple requirements for an effective placement of detail lenses. We show that our path computation method outperforms recently proposed methods and we evaluate the overall impact of our framework in two user studies.

A lower cost development path for heavy ion fusion

International Nuclear Information System (INIS)

Hogan, W.J.; Meier, W.R.

1993-01-01

If two features of the inertial fusion process are exploited successfully, they can lead to significantly lower costs for demonstrating the feasibility of commercial electric power production from this source of energy. First, fusion capsule ignition and burn physics is independent of reaction chamber size and hydrodynamically-equivalent capsules can be designed to perform at small yield, exactly as they do at large yield. This means that an integrated test of all power plant components and feasibility tests of various reaction chamber concepts can be done at much smaller sizes (about 1--2 m first wall radius) and much lower powers (tens of MWs) than magnetic fusion development facilities such as ITER. Second, the driver, which is the most expensive component of currently conceived IFE development facilities, can be used to support more than one experiment target chamber/reactor (simultaneously and/or sequentially). These two factors lead to lower development facility costs, modular facilities, and the planning flexibility to spread costs over time or do several things in parallel and thus shorten the total time needed for development of Inertial Fusion Energy (IFE). In this paper the authors describe the general feature of a heavy ion fusion development plan that takes advantage of upgradable accelerators and the ability to test chambers and reactor systems at small scale in order to reduce development time and costs

Plans to Observe the 2017 Total Solar Eclipse from near the Path Edges

Science.gov (United States)

Waring Dunham, David; Nugent, Richard; Guhl, Konrad; Bode, Hans-Joachim

2015-08-01

The August 21st, 2017 solar eclipse provides a good opportunity, to time the totality contacts, other Baily’s bead phenomena, and observe other dynamic edge phenomena, from locations near the edges of the path of totality. A good network of roads and generally favorable weather prospects means that more observers will likely be able to deploy more equipment than during most previous eclipses. The value of contact and Baily’s bead timings of total solar eclipses, for determining solar diameter and intensity variations, was described in an earlier presentation in Focus Meeting 13. This presentation will concentrate on how observations of different types that have been used during past eclipses can be made by different observers, to obtain better information about the accuracy of the different types of observations for determining the mean solar diameter, and the systematic differences between them. A problem has been that the few observers who have attempted recording Baily’s beads from path edge locations have wanted to use the latest technology, to try to record the observations better, rather than try to make the observations in the same ways that were used for many past eclipses. Several observers trying different techniques at the same location, and doing that at several locations at different places along the path, is needed. Past techniques that we would like to compare include direct visual observation (but keeping eye safety in mind); visual observation of telescopically projected images; direct filtered video telescopic observations; and recording the flash spectrum. There are several towns that straddle the path edges. The International Occultation Timing Association would like to mobilize people in those towns to observe the eclipse from many places, to say whether or not the eclipse happened, and if it did, time it. A suitable cell phone app could be designed to report observations, including the observer’s location, as was attempted for an

Cost Optimisation in Freight Distribution with Cross-Docking: N-Echelon Location Routing Problem

Directory of Open Access Journals (Sweden)

Jesus Gonzalez-Feliu

2012-03-01

Full Text Available Freight transportation constitutes one of the main activities that influence the economy and society, as it assures a vital link between suppliers and customers and represents a major source of employment. Multi-echelon distribution is one of the most common strategies adopted by the transportation companies in an aim of cost reduction. Although vehicle routing problems are very common in operational research, they are essentially related to single-echelon cases. This paper presents the main concepts of multi-echelon distribution with cross-docks and a unified notation for the N-echelon location routing problem. A literature review is also presented, in order to list the main problems and methods that can be helpful for scientists and transportation practitioners.

The Role of Spatial Memory and Frames of Reference in the Precision of Angular Path Integration

OpenAIRE

Arthur, Joeanna C.; Philbeck, John W.; Kleene, Nicholas J.; Chichka, David

2012-01-01

Angular path integration refers to the ability to maintain an estimate of self-location after a rotational displacement by integrating internally-generated (idiothetic) self-motion signals over time. Previous work has found that non-sensory inputs, namely spatial memory, can play a powerful role in angular path integration (Arthur et al., 2007, 2009). Here we investigated the conditions under which spatial memory facilitates angular path integration. We hypothesized that the benefit of spatia...

Adaptation of Dubins Paths for UAV Ground Obstacle Avoidance When Using a Low Cost On-Board GNSS Sensor

Directory of Open Access Journals (Sweden)

Ramūnas Kikutis

2017-09-01

Full Text Available Current research on Unmanned Aerial Vehicles (UAVs shows a lot of interest in autonomous UAV navigation. This interest is mainly driven by the necessity to meet the rules and restrictions for small UAV flights that are issued by various international and national legal organizations. In order to lower these restrictions, new levels of automation and flight safety must be reached. In this paper, a new method for ground obstacle avoidance derived by using UAV navigation based on the Dubins paths algorithm is presented. The accuracy of the proposed method has been tested, and research results have been obtained by using Software-in-the-Loop (SITL simulation and real UAV flights, with the measurements done with a low cost Global Navigation Satellite System (GNSS sensor. All tests were carried out in a three-dimensional space, but the height accuracy was not assessed. The GNSS navigation data for the ground obstacle avoidance algorithm is evaluated statistically.

Adaptation of Dubins Paths for UAV Ground Obstacle Avoidance When Using a Low Cost On-Board GNSS Sensor.

Science.gov (United States)

Kikutis, Ramūnas; Stankūnas, Jonas; Rudinskas, Darius; Masiulionis, Tadas

2017-09-28

Current research on Unmanned Aerial Vehicles (UAVs) shows a lot of interest in autonomous UAV navigation. This interest is mainly driven by the necessity to meet the rules and restrictions for small UAV flights that are issued by various international and national legal organizations. In order to lower these restrictions, new levels of automation and flight safety must be reached. In this paper, a new method for ground obstacle avoidance derived by using UAV navigation based on the Dubins paths algorithm is presented. The accuracy of the proposed method has been tested, and research results have been obtained by using Software-in-the-Loop (SITL) simulation and real UAV flights, with the measurements done with a low cost Global Navigation Satellite System (GNSS) sensor. All tests were carried out in a three-dimensional space, but the height accuracy was not assessed. The GNSS navigation data for the ground obstacle avoidance algorithm is evaluated statistically.

Low-Cost Impact Detection and Location for Automated Inspections of 3D Metallic Based Structures

Directory of Open Access Journals (Sweden)

Carlos Morón

2015-05-01

Full Text Available This paper describes a new low-cost means to detect and locate mechanical impacts (collisions on a 3D metal-based structure. We employ the simple and reasonably hypothesis that the use of a homogeneous material will allow certain details of the impact to be automatically determined by measuring the time delays of acoustic wave propagation throughout the 3D structure. The location of strategic piezoelectric sensors on the structure and an electronic-computerized system has allowed us to determine the instant and position at which the impact is produced. The proposed automatic system allows us to fully integrate impact point detection and the task of inspecting the point or zone at which this impact occurs. What is more, the proposed method can be easily integrated into a robot-based inspection system capable of moving over 3D metallic structures, thus avoiding (or minimizing the need for direct human intervention. Experimental results are provided to show the effectiveness of the proposed approach.

Pulled Motzkin paths

International Nuclear Information System (INIS)

Janse van Rensburg, E J

2010-01-01

In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

Pulled Motzkin paths

Energy Technology Data Exchange (ETDEWEB)

Janse van Rensburg, E J, E-mail: rensburg@yorku.c [Department of Mathematics and Statistics, York University, Toronto, ON, M3J 1P3 (Canada)

2010-08-20

In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) {yields} f as f {yields} {infinity}, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) {yields} 2f as f {yields} {infinity}, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

Pulled Motzkin paths

Science.gov (United States)

Janse van Rensburg, E. J.

2010-08-01

In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

Total Path Length and Number of Terminal Nodes for Decision Trees

KAUST Repository

Hussain, Shahid

2014-09-13

This paper presents a new tool for study of relationships between total path length (average depth) and number of terminal nodes for decision trees. These relationships are important from the point of view of optimization of decision trees. In this particular case of total path length and number of terminal nodes, the relationships between these two cost functions are closely related with space-time trade-off. In addition to algorithm to compute the relationships, the paper also presents results of experiments with datasets from UCI ML Repository1. These experiments show how two cost functions behave for a given decision table and the resulting plots show the Pareto frontier or Pareto set of optimal points. Furthermore, in some cases this Pareto frontier is a singleton showing the total optimality of decision trees for the given decision table.

The Vertical-Tube Solar Collector: A Low-Cost Design Suitable for Temperate High-Latitude Locations

Directory of Open Access Journals (Sweden)

Luis Juanicó

2014-01-01

Full Text Available A new low-cost solar collector based on thick (4.5′′ vertical tubes related to the previous design based on long 1.5′′ plastic hoses connected directly between water-grid supply and consumption is presented. This novel design could noticeably improve its performance for temperate locations mid and high latitudes, as was demonstrated by dynamic thermal modeling. This tool has been useful for understanding the particular characteristics of this kind of water-pond collector and besides, for noticeably improving its performance by optimizing its parameters, like tube diameter and number of glazing layers. By this way, the optimized design could fully satisfy the household demand up to midnight along the whole year for Buenos Aires (35°S and during summers (remaining as a useful preheater for the whole year for Ushuaia (55°S. Besides, its high simplicity makes it available for user’s own construction, costing down 50 dollars for a single-family unit.

The Best Path Analysis in Military Highway Transport Based on DEA and Multiobjective Fuzzy Decision-Making

Directory of Open Access Journals (Sweden)

Wu Juan

2014-01-01

Full Text Available Military transport path selection directly affects the transport speed, efficiency, and safety. To a certain degree, the results of the path selection determine success or failure of the war situation. The purpose of this paper is to propose a model based on DEA (data envelopment analysis and multiobjective fuzzy decision-making for path selection. The path decision set is established according to a search algorithm based on overlapping section punishment. Considering the influence of various fuzzy factors, the model of optimal path is constructed based on DEA and multitarget fuzzy decision-making theory, where travel time, transport risk, quick response capability, and transport cost constitute the evaluation target set. A reasonable path set can be calculated and sorted according to the comprehensive scores of the paths. The numerical results show that the model and the related algorithms are effective for path selection of military transport.

Path dependence and independent utility regulation

DEFF Research Database (Denmark)

Ibsen, Christian Lyhne; Skovgaard Poulsen, Lauge

2007-01-01

The establishment of the Danish independent regulatory authorities for the energy and telecommunications sectors was based upon EU directives as part of their liberalisation process. Following the concepts of transaction costs and path dependency this article analyses differences in independence...... between the two authorities - the Danish Energy Regulatory Authority (Energitilsynet) and the National IT and Telecommunications Agency (IT- og Telestyrelsen) respectively. We find that the state's negligible interest in the energy sector until the 1970s formed the basis for strong energy companies...

The force control and path planning of electromagnetic induction-based massage robot.

Science.gov (United States)

Wang, Wendong; Zhang, Lei; Li, Jinzhe; Yuan, Xiaoqing; Shi, Yikai; Jiang, Qinqin; He, Lijing

2017-07-20

Massage robot is considered as an effective physiological treatment to relieve fatigue, improve blood circulation, relax muscle tone, etc. The simple massage equipment quickly spread into market due to low cost, but they are not widely accepted due to restricted massage function. Complicated structure and high cost caused difficulties for developing multi-function massage equipment. This paper presents a novel massage robot which can achieve tapping, rolling, kneading and other massage operations, and proposes an improved reciprocating path planning algorithm to improve massage effect. The number of coil turns, the coil current and the distance between massage head and yoke were chosen to investigate the influence on massage force by finite element method. The control system model of the wheeled massage robot was established, including control subsystem of the motor, path algorithm control subsystem, parameter module of the massage robot and virtual reality interface module. The improved reciprocating path planning algorithm was proposed to improve regional coverage rate and massage effect. The influence caused by coil current, the number of coil turns and the distance between massage head and yoke were simulated in Maxwell. It indicated that coil current has more important influence compared to the other two factors. The path planning simulation of the massage robot was completed in Matlab, and the results show that the improved reciprocating path planning algorithm achieved higher coverage rate than the traditional algorithm. With the analysis of simulation results, it can be concluded that the number of coil turns and the distance between the moving iron core and the yoke could be determined prior to coil current, and the force can be controllable by optimizing structure parameters of massage head and adjusting coil current. Meanwhile, it demonstrates that the proposed algorithm could effectively improve path coverage rate during massage operations, therefore

Ranking shortest paths in Stochastic time-denpendent networks

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

K shortest paths in stochastic time-dependent networks

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

2004-01-01

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

Science.gov (United States)

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

PENGEVALUASIAN KOMPARASI DARI EFEK SISTEM KONTROL MANAJEMEN MANUFAKTUR KINERJA SAAT OPERASIONAL DENGAN PROGRAM AUDITAN BERBASIS HISTORICAL COST BERPOSTULAT GOING CONCERN: MODEL PATH ANALITIS

Directory of Open Access Journals (Sweden)

Petrolis Nusa Perdana

2017-03-01

Full Text Available Comparison of the Effects Evaluating Management Control System Manufacturing Current Performance Based Operational Program Audited Historical Cost that postuled Going Concern: Path Analytic Model. Faculty of Economics, University of Jakarta. 2016 This study uses a linear model of structural relations (LISREL to investigate the influence of management control system (that is the objectives associated with quality, quality feedback and incentive-compensation on the suitability of the quality and suistainability influence on the quality of customer satisfaction. Comparison management control on the spot with the results of normative audited based on historical cost with going concern postulated where the results show support for the theoretical framework that links objectives, feedback and incentives for quality conformance which is more optimal than the evaluation of past or simultaneously with current implementation. The results also demonstrate the suitability of which has a significant impact on customer satisfaction and also mediates the relationship between the management control system, audit results and customer satisfaction.

Intercomparison of open-path trace gas measurements with two dual-frequency-comb spectrometers

Directory of Open Access Journals (Sweden)

E. M. Waxman

2017-09-01

Full Text Available We present the first quantitative intercomparison between two open-path dual-comb spectroscopy (DCS instruments which were operated across adjacent 2 km open-air paths over a 2-week period. We used DCS to measure the atmospheric absorption spectrum in the near infrared from 6023 to 6376 cm−1 (1568 to 1660 nm, corresponding to a 355 cm−1 bandwidth, at 0.0067 cm−1 sample spacing. The measured absorption spectra agree with each other to within 5 × 10−4 in absorbance without any external calibration of either instrument. The absorption spectra are fit to retrieve path-integrated concentrations for carbon dioxide (CO2, methane (CH4, water (H2O, and deuterated water (HDO. The retrieved dry mole fractions agree to 0.14 % (0.57 ppm for CO2, 0.35 % (7 ppb for CH4, and 0.40 % (36 ppm for H2O at  ∼  30 s integration time over the 2-week measurement campaign, which included 24 °C outdoor temperature variations and periods of strong atmospheric turbulence. This agreement is at least an order of magnitude better than conventional active-source open-path instrument intercomparisons and is particularly relevant to future regional flux measurements as it allows accurate comparisons of open-path DCS data across locations and time. We additionally compare the open-path DCS retrievals to a World Meteorological Organization (WMO-calibrated cavity ring-down point sensor located along the path with good agreement. Short-term and long-term differences between the open-path DCS and point sensor are attributed, respectively, to spatial sampling discrepancies and to inaccuracies in the current spectral database used to fit the DCS data. Finally, the 2-week measurement campaign yields diurnal cycles of CO2 and CH4 that are consistent with the presence of local sources of CO2 and absence of local sources of CH4.

Shortest path problem on a grid network with unordered intermediate points

Science.gov (United States)

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.

Path Expressions

Science.gov (United States)

1975-06-01

Traditionally, synchronization of concurrent processes is coded in line by operations on semaphores or similar objects. Path expressions move the...discussion about a variety of synchronization primitives . An analysis of their relative power is found in [3]. Path expressions do not introduce yet...another synchronization primitive . A path expression relates to such primitives as a for- or while-statement of an ALGOL-like language relates to a JUMP

Research and application of genetic algorithm in path planning of logistics distribution vehicle

Science.gov (United States)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.

A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning.

Science.gov (United States)

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.

Army ants dynamically adjust living bridges in response to a cost-benefit trade-off.

Science.gov (United States)

Reid, Chris R; Lutz, Matthew J; Powell, Scott; Kao, Albert B; Couzin, Iain D; Garnier, Simon

2015-12-08

The ability of individual animals to create functional structures by joining together is rare and confined to the social insects. Army ants (Eciton) form collective assemblages out of their own bodies to perform a variety of functions that benefit the entire colony. Here we examine ‟bridges" of linked individuals that are constructed to span gaps in the colony's foraging trail. How these living structures adjust themselves to varied and changing conditions remains poorly understood. Our field experiments show that the ants continuously modify their bridges, such that these structures lengthen, widen, and change position in response to traffic levels and environmental geometry. Ants initiate bridges where their path deviates from their incoming direction and move the bridges over time to create shortcuts over large gaps. The final position of the structure depended on the intensity of the traffic and the extent of path deviation and was influenced by a cost-benefit trade-off at the colony level, where the benefit of increased foraging trail efficiency was balanced by the cost of removing workers from the foraging pool to form the structure. To examine this trade-off, we quantified the geometric relationship between costs and benefits revealed by our experiments. We then constructed a model to determine the bridge location that maximized foraging rate, which qualitatively matched the observed movement of bridges. Our results highlight how animal self-assemblages can be dynamically modified in response to a group-level cost-benefit trade-off, without any individual unit's having information on global benefits or costs.

Substation Location in Offshore Wind Farms - A Planar Multi-Facility Location-Routing Problem

OpenAIRE

Amland, Thomas

2014-01-01

In offshore wind farms, two important parts of the design are to determine locations for substations and a cabling layout that connects every turbine to a substation. These problems are interconnected, as the cable layout depends on the choice of location for the substation. In this thesis we investigate how to set the location of substations such that the total cable cost is minimized.

Potential paths for male-mediated gene flow to and from an isolated grizzly bear population

Science.gov (United States)

Peck, Christopher P.; van Manen, Frank T.; Costello, Cecily M.; Haroldson, Mark A.; Landenburger, Lisa; Roberts, Lori L.; Bjornlie, Daniel D.; Mace, Richard D.

2017-01-01

For several decades, grizzly bear populations in the Greater Yellowstone Ecosystem (GYE) and the Northern Continental Divide Ecosystem (NCDE) have increased in numbers and range extent. The GYE population remains isolated and although effective population size has increased since the early 1980s, genetic connectivity between these populations remains a long-term management goal. With only ~110 km distance separating current estimates of occupied range for these populations, the potential for gene flow is likely greater now than it has been for many decades. We sought to delineate potential paths that would provide the opportunity for male-mediated gene flow between the two populations. We first developed step-selection functions to generate conductance layers using ecological, physical, and anthropogenic landscape features associated with non-stationary GPS locations of 124 male grizzly bears (199 bear-years). We then used a randomized shortest path (RSP) algorithm to estimate the average number of net passages for all grid cells in the study region, when moving from an origin to a destination node. Given habitat characteristics that were the basis for the conductance layer, movements follow certain grid cell sequences more than others and the resulting RSP values thus provide a measure of movement potential. Repeating this process for 100 pairs of random origin and destination nodes, we identified paths for three levels of random deviation (θ) from the least-cost path. We observed broad-scale concordance between model predictions for paths originating in the NCDE and those originating in the GYE for all three levels of movement exploration. Model predictions indicated that male grizzly bear movement between the ecosystems could involve a variety of routes, and verified observations of grizzly bears outside occupied range supported this finding. Where landscape features concentrated paths into corridors (e.g., because of anthropogenic influence), they typically

Oil and gas pipeline construction cost analysis and developing regression models for cost estimation

Science.gov (United States)

Thaduri, Ravi Kiran

In this study, cost data for 180 pipelines and 136 compressor stations have been analyzed. On the basis of the distribution analysis, regression models have been developed. Material, Labor, ROW and miscellaneous costs make up the total cost of a pipeline construction. The pipelines are analyzed based on different pipeline lengths, diameter, location, pipeline volume and year of completion. In a pipeline construction, labor costs dominate the total costs with a share of about 40%. Multiple non-linear regression models are developed to estimate the component costs of pipelines for various cross-sectional areas, lengths and locations. The Compressor stations are analyzed based on the capacity, year of completion and location. Unlike the pipeline costs, material costs dominate the total costs in the construction of compressor station, with an average share of about 50.6%. Land costs have very little influence on the total costs. Similar regression models are developed to estimate the component costs of compressor station for various capacities and locations.

Heading-vector navigation based on head-direction cells and path integration.

Science.gov (United States)

Kubie, John L; Fenton, André A

2009-05-01

Insect navigation is guided by heading vectors that are computed by path integration. Mammalian navigation models, on the other hand, are typically based on map-like place representations provided by hippocampal place cells. Such models compute optimal routes as a continuous series of locations that connect the current location to a goal. We propose a "heading-vector" model in which head-direction cells or their derivatives serve both as key elements in constructing the optimal route and as the straight-line guidance during route execution. The model is based on a memory structure termed the "shortcut matrix," which is constructed during the initial exploration of an environment when a set of shortcut vectors between sequential pairs of visited waypoint locations is stored. A mechanism is proposed for calculating and storing these vectors that relies on a hypothesized cell type termed an "accumulating head-direction cell." Following exploration, shortcut vectors connecting all pairs of waypoint locations are computed by vector arithmetic and stored in the shortcut matrix. On re-entry, when local view or place representations query the shortcut matrix with a current waypoint and goal, a shortcut trajectory is retrieved. Since the trajectory direction is in head-direction compass coordinates, navigation is accomplished by tracking the firing of head-direction cells that are tuned to the heading angle. Section 1 of the manuscript describes the properties of accumulating head-direction cells. It then shows how accumulating head-direction cells can store local vectors and perform vector arithmetic to perform path-integration-based homing. Section 2 describes the construction and use of the shortcut matrix for computing direct paths between any pair of locations that have been registered in the shortcut matrix. In the discussion, we analyze the advantages of heading-based navigation over map-based navigation. Finally, we survey behavioral evidence that nonhippocampal

MRS/IS facility co-located with a repository: preconceptual design and life-cycle cost estimates

International Nuclear Information System (INIS)

Smith, R.I.; Nesbitt, J.F.

1982-11-01

A program is described to examine the various alternatives for monitored retrievable storage (MRS) and interim storage (IS) of spent nuclear fuel, solidified high-level waste (HLW), and transuranic (TRU) waste until appropriate geologic repository/repositories are available. The objectives of this study are: (1) to develop a preconceptual design for an MRS/IS facility that would become the principal surface facility for a deep geologic repository when the repository is opened, (2) to examine various issues such as transportation of wastes, licensing of the facility, and environmental concerns associated with operation of such a facility, and (3) to estimate the life cycle costs of the facility when operated in response to a set of scenarios which define the quantities and types of waste requiring storage in specific time periods, which generally span the years from 1990 until 2016. The life cycle costs estimated in this study include: the capital expenditures for structures, casks and/or drywells, storage areas and pads, and transfer equipment; the cost of staff labor, supplies, and services; and the incremental cost of transporting the waste materials from the site of origin to the MRS/IS facility. Three scenarios are examined to develop estimates of life cycle costs of the MRS/IS facility. In the first scenario, HLW canisters are stored, starting in 1990, until the co-located repository is opened in the year 1998. Additional reprocessing plants and repositories are placed in service at various intervals. In the second scenario, spent fuel is stored, starting in 1990, because the reprocessing plants are delayed in starting operations by 10 years, but no HLW is stored because the repositories open on schedule. In the third scenario, HLW is stored, starting in 1990, because the repositories are delayed 10 years, but the reprocessing plants open on schedule

A Sun Path Observation System Based on Augment Reality and Mobile Learning

OpenAIRE

Tarng, Wernhuar; Ou, Kuo-Liang; Lu, Yun-Chen; Shih, Yi-Syuan; Liou, Hsin-Hun

2018-01-01

This study uses the augmented reality technology and sensor functions of GPS, electronic compass, and three-axis accelerometer on mobile devices to develop a Sun path observation system for applications in astronomy education. The orientation and elevation of the Sun can be calculated by the system according to the user’s location and local time to simulate the Sun path. When holding the mobile device toward the sky, the screen will show the virtual Sun at the same position as that of the rea...

World nuclear energy paths

International Nuclear Information System (INIS)

Connolly, T.J.; Hansen, U.; Jaek, W.; Beckurts, K.H.

1979-01-01

In examing the world nuclear energy paths, the following assumptions were adopted: the world economy will grow somewhat more slowly than in the past, leading to reductions in electricity demand growth rates; national and international political impediments to the deployment of nuclear power will gradually disappear over the next few years; further development of nuclear power will proceed steadily, without serious interruption but with realistic lead times for the introduction of advanced technologies. Given these assumptions, this paper attempts a study of possible world nuclear energy developments, disaggregated on a regional and national basis. The scenario technique was used and a few alternative fuel-cycle scenarios were developed. Each is an internally consistent model of technically and economically feasible paths to the further development of nuclear power in an aggregate of individual countries and regions of the world. The main purpose of this modeling exercise was to gain some insight into the probable international locations of reactors and other nuclear facilities, the future requirements for uranium and for fuel-cycle services, and the problems of spent-fuel storage and waste management. The study also presents an assessment of the role that nuclear power might actually play in meeting future world energy demand

Path Creation, Path Dependence and Breaking Away from the Path: Re-Examining the Case of Nokia

OpenAIRE

Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

2016-01-01

The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

Path-dependent functions

International Nuclear Information System (INIS)

Khrapko, R.I.

1985-01-01

A uniform description of various path-dependent functions is presented with the help of expansion of the type of the Taylor series. So called ''path-integrals'' and ''path-tensor'' are introduced which are systems of many-component quantities whose values are defined for arbitrary paths in coordinated region of space in such a way that they contain a complete information on the path. These constructions are considered as elementary path-dependent functions and are used instead of power monomials in the usual Taylor series. Coefficients of such an expansion are interpreted as partial derivatives dependent on the order of the differentiations or else as nonstandard cavariant derivatives called two-point derivatives. Some examples of pathdependent functions are presented.Space curvature tensor is considered whose geometrica properties are determined by the (non-transitive) translator of parallel transport of a general type. Covariant operation leading to the ''extension'' of tensor fiels is pointed out

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

Science.gov (United States)

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.

Rotational error in path integration: encoding and execution errors in angle reproduction.

Science.gov (United States)

Chrastil, Elizabeth R; Warren, William H

2017-06-01

Path integration is fundamental to human navigation. When a navigator leaves home on a complex outbound path, they are able to keep track of their approximate position and orientation and return to their starting location on a direct homebound path. However, there are several sources of error during path integration. Previous research has focused almost exclusively on encoding error-the error in registering the outbound path in memory. Here, we also consider execution error-the error in the response, such as turning and walking a homebound trajectory. In two experiments conducted in ambulatory virtual environments, we examined the contribution of execution error to the rotational component of path integration using angle reproduction tasks. In the reproduction tasks, participants rotated once and then rotated again to face the original direction, either reproducing the initial turn or turning through the supplementary angle. One outstanding difficulty in disentangling encoding and execution error during a typical angle reproduction task is that as the encoding angle increases, so does the required response angle. In Experiment 1, we dissociated these two variables by asking participants to report each encoding angle using two different responses: by turning to walk on a path parallel to the initial facing direction in the same (reproduction) or opposite (supplementary angle) direction. In Experiment 2, participants reported the encoding angle by turning both rightward and leftward onto a path parallel to the initial facing direction, over a larger range of angles. The results suggest that execution error, not encoding error, is the predominant source of error in angular path integration. These findings also imply that the path integrator uses an intrinsic (action-scaled) rather than an extrinsic (objective) metric.

A Comprehensive and Cost-Effective Computer Infrastructure for K-12 Schools

Science.gov (United States)

Warren, G. P.; Seaton, J. M.

1996-01-01

Since 1993, NASA Langley Research Center has been developing and implementing a low-cost Internet connection model, including system architecture, training, and support, to provide Internet access for an entire network of computers. This infrastructure allows local area networks which exceed 50 machines per school to independently access the complete functionality of the Internet by connecting to a central site, using state-of-the-art commercial modem technology, through a single standard telephone line. By locating high-cost resources at this central site and sharing these resources and their costs among the school districts throughout a region, a practical, efficient, and affordable infrastructure for providing scale-able Internet connectivity has been developed. As the demand for faster Internet access grows, the model has a simple expansion path that eliminates the need to replace major system components and re-train personnel. Observations of optical Internet usage within an environment, particularly school classrooms, have shown that after an initial period of 'surfing,' the Internet traffic becomes repetitive. By automatically storing requested Internet information on a high-capacity networked disk drive at the local site (network based disk caching), then updating this information only when it changes, well over 80 percent of the Internet traffic that leaves a location can be eliminated by retrieving the information from the local disk cache.

Prediction of the Sun-Glint Locations for the Communication, Ocean and Meteorological Satellite

Directory of Open Access Journals (Sweden)

Jae-Ik Park

2005-09-01

Full Text Available For the Communication, Ocean and Meteorological Satellite (COMS which will be launched in 2008, an algorithm for finding the precise location of the sun-glint point on the ocean surface is studied. The precise locations of the sun-glint are estimated by considering azimuth and elevation angles of Sun-satellite-Earth geometric position and the law of reflection. The obtained nonlinear equations are solved by using the Newton-Raphson method. As a result, when COMS is located at 116.2°E or 128.2°E longitude, the sun-glint covers region of ±10° (N-S latitude and 80-150° (E-W longitude. The diurnal path of the sun-glint in the southern hemisphere is curved towards the North Pole, and the path in the northern hemisphere is forwards the south pole. The algorithm presented in this paper can be applied to predict the precise location of sun-glint region in any other geostationary satellites.

A fast tomographic method for searching the minimum free energy path

International Nuclear Information System (INIS)

Chen, Changjun; Huang, Yanzhao; Xiao, Yi; Jiang, Xuewei

2014-01-01

Minimum Free Energy Path (MFEP) provides a lot of important information about the chemical reactions, like the free energy barrier, the location of the transition state, and the relative stability between reactant and product. With MFEP, one can study the mechanisms of the reaction in an efficient way. Due to a large number of degrees of freedom, searching the MFEP is a very time-consuming process. Here, we present a fast tomographic method to perform the search. Our approach first calculates the free energy surfaces in a sequence of hyperplanes perpendicular to a transition path. Based on an objective function and the free energy gradient, the transition path is optimized in the collective variable space iteratively. Applications of the present method to model systems show that our method is practical. It can be an alternative approach for finding the state-to-state MFEP

Virtual Fiber Networking and Impact of Optical Path Grooming on Creating Efficient Layer One Services

Science.gov (United States)

Naruse, Fumisato; Yamada, Yoshiyuki; Hasegawa, Hiroshi; Sato, Ken-Ichi

This paper presents a novel “virtual fiber” network service that exploits wavebands. This service provides virtual direct tunnels that directly convey wavelength paths to connect customer facilities. To improve the resource utilization efficiency of the service, a network design algorithm is developed that can allow intermediate path grooming at limited nodes and can determine the best node location. Numerical experiments demonstrate the effectiveness of the proposed service architecture.

Time path of marginal cost for measures against global warming toward the greenhouse gas concentration target. Analytic solution and case study of the electric power sector; Onshitsu koka gas nodo mokuhyoka deno ondanka taisaku genkai hiyo no jikan keiro. Kaisekikai to denryoku bumon no case study

Energy Technology Data Exchange (ETDEWEB)

Nagano, K.; Sugiyama, H.; Takahashi, M. [Central Research Institute of Electric Power Industry, Tokyo (Japan)

1997-01-30

The United Nations Framework Convention on Climate Change is studied from the viewpoint of implementing costs. As far as the global warming issue is concerned, the factor to affect the environment is not the emitted volume but the concentration in the air. The ultimate target is the stabilization of greenhouse gas concentration at a level not to impose serious artificial damage on the ecosystem. Accordingly, various time paths are considered, including one in which much emission is allowed at the beginning and suppression is enforced acceleratedly in the later stage. In this study, a path demanding but the minimal cost in the period up to the target time point is discussed, using as the tool the marginal cost for measure implementation. In a reasonable emission control strategy, the emission control marginal cost follows a time path that is dependent upon an increase function to be determined by the discount rate and survival rate (time constant) in the atmosphere. In the industrial branch, instead of imposing short-term and rigid emission volume control limits, a longer-term target may be set for reduction in the loads responsible for concentration acceleration, concrete emission controls under the given conditions may be implemented at the discretion of the implementing organizations, and reduction in cost may be realized by time distribution with the environmental impacts kept at approximately equal levels. 5 refs., 2 figs., 3 tabs.

IoT Enabled Low Cost Wearable Device for Location and Information Tracking System

Directory of Open Access Journals (Sweden)

Kamaludin Nur Atika Binti

2017-01-01

Full Text Available An internet-of-things (IoT enabled low cost wearable device for location and information tracking system is developed to monitor and ensure the safety of the children while their parents are away either to work or abroad. This system aims to ensure human safety especially the children and efficiently initiate search and rescue in the event of emergencies. The device will notify the parents on the condition of the surroundings of the children, specifically inside the house and notify the parents if the children are outside the target area by using the application developed in the smartphone. The system uses a microcomputer called Beagle-Bone Black (BBB as the processor while GPS and LTE technology for wireless communication. Future improvement mainly focuses on reducing the size and power consumption of the device, improving communication module, and optimizing microcomputer’s specification.

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways

Science.gov (United States)

Koumakis, Lefteris; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Vassou, Despoina; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-01-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the

Reachability by paths of bounded curvature in a convex polygon

KAUST Repository

Ahn, Heekap; Cheong, Otfried; Matoušek, Jiřǐ; Vigneron, Antoine E.

2012-01-01

Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.

Analysis of cost estimation and wind energy evaluation using wind energy conversion systems (WECS) for electricity generation in six selected high altitude locations in Nigeria

International Nuclear Information System (INIS)

Ohunakin, S. Olayinka; Ojolo, S. Joshua; Ogunsina, S. Babatunde; Dinrifo, R. Rufus

2012-01-01

Two commercial wind turbines namely AN Bonus 300 kW/33 and AN Bonus 1 MW/54 were technically assessed for electricity generation in six selected high altitude sites spreading across the North-West and North-East geopolitical regions of Nigeria by computing their capacity factors, annual power and energy outputs. The economic evaluation of using the two wind energy conversion systems (medium and large) for electric power generation in the selected locations were also estimated using the present value cost method. The results showed that capacity factors of the two turbines in the selected sites ranged between 4.6 and 43%. Average minimum cost per kW h was obtained in Kano as $0.0222/kW h with AN Bonus 1 MW while the highest average cost is $0.2074/kW h with AN Bonus 300 kW in Kaduna. The highest cost in each of the location was obtained with the medium WECs (AN Bonus 300 kW). In addition, Kano and Katsina were also found to be very economical for any of the adopted wind turbine models. Gusau and Kaduna, at cost of unit energy of about $0.30/kW h were found to be more profitable for non-connected electrical and mechanical applications (water pumping, battery charging) than diesel generator. - Highlights: ► All the locations considered have mean wind speeds above 4.8 m/s. ► Economical wind applications are possible in Kano and Katsina. ► Highest capacity factor and energy output are obtained using AN Bonus 1 MW in Kano. ► Specific cost of unit energy per kW h is cheaper using AN Bonus 1 MW.

Modeling of tool path for the CNC sheet cutting machines

Science.gov (United States)

Petunin, Aleksandr A.

2015-11-01

In the paper the problem of tool path optimization for CNC (Computer Numerical Control) cutting machines is considered. The classification of the cutting techniques is offered. We also propose a new classification of toll path problems. The tasks of cost minimization and time minimization for standard cutting technique (Continuous Cutting Problem, CCP) and for one of non-standard cutting techniques (Segment Continuous Cutting Problem, SCCP) are formalized. We show that the optimization tasks can be interpreted as discrete optimization problem (generalized travel salesman problem with additional constraints, GTSP). Formalization of some constraints for these tasks is described. For the solution GTSP we offer to use mathematical model of Prof. Chentsov based on concept of a megalopolis and dynamic programming.

Turbine steam path replacement at the Grafenrheinfeld Nuclear Power Station

International Nuclear Information System (INIS)

Weschenfelder, K.D.; Oeynhausen, H.; Bergmann, D.; Hosbein, P.; Termuehlen, H.

1994-01-01

In the last few years, replacement of old vintage steam turbine flow path components has been well established as a valid approach to improve thermal performance of aged turbines. In nuclear power plants, performance improvement is generally achieved only by design improvements since performance deterioration of old units is minor or nonexistent. With fossil units operating over decades loss in performance is an additional factor which can be taken into account. Such loss of performance can be caused by deposits, solid particle erosion, loss of shaft and inter-stage seal strips, etc. Improvement of performance is typically guaranteed as output increases for operation at full load. This value can be evaluated as a direct gain in unit capacity without fuel or steam supply increase. Since fuel intake does not change, the relative improvement of the net plant heat rate or efficiency is equal to the relative increase in output. The heat rate improvement is achieved not only at full load but for the entire load range. Such heat rate improvement not only moves a plant up on the load dispatch list increasing its capacity factor, but also extensive fuel savings can pay off for the investment cost of new steam path components. Another important factor is that quite often older turbine designs show a deterioration of their reliability and need costly repairs. With new flow path components an aged steam turbine starts a new useful life

Location-based restoration mechanism for multi-domain GMPLS networks

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Calle, Eusibi; Ruepp, Sarah Renée

2009-01-01

In this paper we propose and evaluate the efficiency of a location-based restoration mechanism in a dynamic multi-domain GMPLS network. We focus on inter-domain link failures and utilize the correlation between the actual position of a failed link along the path with the applied restoration...

Path analyses of yield and some agronomic and quality traits of ...

African Journals Online (AJOL)

ONOS

2010-08-09

Aug 9, 2010 ... This research was conducted to determine characters effecting grain yield in fifty bread wheat (Triticum aestivum L.) cultivars and advanced lines by using simple correlation coefficient and path analysis under 2 locations (high rainfall and low rainfall; 745 and 506 mm, respectively). A total of 50 genotypes,.

Accelerating Sequential Gaussian Simulation with a constant path

Science.gov (United States)

Nussbaumer, Raphaël; Mariethoz, Grégoire; Gravey, Mathieu; Gloaguen, Erwan; Holliger, Klaus

2018-03-01

Sequential Gaussian Simulation (SGS) is a stochastic simulation technique commonly employed for generating realizations of Gaussian random fields. Arguably, the main limitation of this technique is the high computational cost associated with determining the kriging weights. This problem is compounded by the fact that often many realizations are required to allow for an adequate uncertainty assessment. A seemingly simple way to address this problem is to keep the same simulation path for all realizations. This results in identical neighbourhood configurations and hence the kriging weights only need to be determined once and can then be re-used in all subsequent realizations. This approach is generally not recommended because it is expected to result in correlation between the realizations. Here, we challenge this common preconception and make the case for the use of a constant path approach in SGS by systematically evaluating the associated benefits and limitations. We present a detailed implementation, particularly regarding parallelization and memory requirements. Extensive numerical tests demonstrate that using a constant path allows for substantial computational gains with very limited loss of simulation accuracy. This is especially the case for a constant multi-grid path. The computational savings can be used to increase the neighbourhood size, thus allowing for a better reproduction of the spatial statistics. The outcome of this study is a recommendation for an optimal implementation of SGS that maximizes accurate reproduction of the covariance structure as well as computational efficiency.

Minimum cost connection networks

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Tvede, Mich

In the present paper we consider the allocation of cost in connection networks. Agents have connection demands in form of pairs of locations they want to be connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection demands...

Cost vs. safety: A novel design for t

Directory of Open Access Journals (Sweden)

Komali Kantamaneni

2017-08-01

Full Text Available Tornadoes are dangerous and destructive weather phenomena. The strongest category of tornadoes on the enhanced Fujita and TORRO scales is responsible for 75% of property destruction and deaths across the globe. These issues highlight the need for new design practices aimed at producing tornado proof homes in particular 3D CAD models in tornado prone zones at current climatic scenarios. Previous studies were entirely based on traditional slants and failed to offer a reliable tornado proof home, other than small rooms and trailers, while, none of the literature concentrated on multiple factors (cost, safety and high-wind proof. Therefore, a knowledge gap exists. In order to address the current research gap, this study attempts to develop an innovative 3D CAD model for tornado resistant homes by incorporating 2 PA (Two Path Analysis. Consequently, this study provides a new design using a 3D-CAD model for a tornado resistant home as in Path One and cost and safety scenarios in Path Two. However, this new design utilizes missile steel and shield technology. Preliminary results showed that, while this new design is safer and more technically sophisticated, it involves an increase of 25–30% in construction costs. However, this increased expense is low in comparison with rebuilding costs.

Probabilistic Path Planning of Montgolfier Balloons in Strong, Uncertain Wind Fields

Science.gov (United States)

Wolf, Michael; Blackmore, James C.; Kuwata, Yoshiaki

2011-01-01

Lighter-than-air vehicles such as hot-air balloons have been proposed for exploring Saturn s moon Titan, as well as other bodies with significant atmospheres. For these vehicles to navigate effectively, it is critical to incorporate the effects of surrounding wind fields, especially as these winds will likely be strong relative to the control authority of the vehicle. Predictive models of these wind fields are available, and previous research has considered problems of planning paths subject to these predicted forces. However, such previous work has considered the wind fields as known a priori, whereas in practical applications, the actual wind vector field is not known exactly and may deviate significantly from the wind velocities estimated by the model. A probabilistic 3D path-planning algorithm was developed for balloons to use uncertain wind models to generate time-efficient paths. The nominal goal of the algorithm is to determine what altitude and what horizontal actuation, if any is available on the vehicle, to use to reach a particular goal location in the least expected time, utilizing advantageous winds. The solution also enables one to quickly evaluate the expected time-to-goal from any other location and to avoid regions of large uncertainty. This method is designed for balloons in wind fields but may be generalized for any buoyant vehicle operating in a vector field. To prepare the planning problem, the uncertainty in the wind field is modeled. Then, the problem of reaching a particular goal location is formulated as a Markov decision process (MDP) using a discretized space approach. Solving the MDP provides a policy of what actuation option (how much buoyancy change and, if applicable, horizontal actuation) should be selected at any given location to minimize the expected time-to-goal. The results provide expected time-to-goal values from any given location on the globe in addition to the action policy. This stochastic approach can also provide

Optimization of Reliability Centered Maintenance Bassed on Maintenance Costs and Reliability with Consideration of Location of Components

Directory of Open Access Journals (Sweden)

Mahdi Karbasian

2011-03-01

Full Text Available The reliability of designing systems such as electrical and electronic circuits, power generation/ distribution networks and mechanical systems, in which the failure of a component may cause the whole system failure, and even the reliability of cellular manufacturing systems that their machines are connected to as series are critically important. So far approaches for improving the reliability of these systems have been mainly based on the enhancement of inherent reliability of any system component or increasing system reliability based on maintenance strategies. Also in some of the resources, only the influence of the location of systems' components on reliability is studied. Therefore, it seems other approaches have been rarely applied. In this paper, a multi criteria model has been proposed to perform a balance among a system's reliability, location costs, and its system maintenance. Finally, a numerical example has been presented and solved by the Lingo software.

Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.

Directory of Open Access Journals (Sweden)

Zengliang Han

Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.

Two paths from lab to market: Product and standard

Science.gov (United States)

Knapp, Robert H.

2018-01-01

To shed light on the movement of sustainable technologies from basic science to widespread use, this chapter describes key aspects of the quite different paths followed by two important examples—photovoltaics (a product) and passive-house buildings (a standard). Discussion of photovoltaics includes the experience curve concept, the increasing significance of balance-of-system costs, and the importance of market heterogeneity (niches and sub-national markets) to the long-term trajectory of major cost reductions. Discussion of passive-houses highlights the array of technical developments needed for present-day energy efficient houses, and the relevance of "stretch" standards to the development of a market for very high-performance houses.

A Dynamic Bayesian Observer Model Reveals Origins of Bias in Visual Path Integration.

Science.gov (United States)

Lakshminarasimhan, Kaushik J; Petsalis, Marina; Park, Hyeshin; DeAngelis, Gregory C; Pitkow, Xaq; Angelaki, Dora E

2018-06-20

Path integration is a strategy by which animals track their position by integrating their self-motion velocity. To identify the computational origins of bias in visual path integration, we asked human subjects to navigate in a virtual environment using optic flow and found that they generally traveled beyond the goal location. Such a behavior could stem from leaky integration of unbiased self-motion velocity estimates or from a prior expectation favoring slower speeds that causes velocity underestimation. Testing both alternatives using a probabilistic framework that maximizes expected reward, we found that subjects' biases were better explained by a slow-speed prior than imperfect integration. When subjects integrate paths over long periods, this framework intriguingly predicts a distance-dependent bias reversal due to buildup of uncertainty, which we also confirmed experimentally. These results suggest that visual path integration in noisy environments is limited largely by biases in processing optic flow rather than by leaky integration. Copyright © 2018 Elsevier Inc. All rights reserved.

Integral transforms of the quantum mechanical path integral: Hit function and path-averaged potential

Science.gov (United States)

Edwards, James P.; Gerber, Urs; Schubert, Christian; Trejo, Maria Anabel; Weber, Axel

2018-04-01

We introduce two integral transforms of the quantum mechanical transition kernel that represent physical information about the path integral. These transforms can be interpreted as probability distributions on particle trajectories measuring respectively the relative contribution to the path integral from paths crossing a given spatial point (the hit function) and the likelihood of values of the line integral of the potential along a path in the ensemble (the path-averaged potential).

The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits

DEFF Research Database (Denmark)

Plum, Christian Edinger Munk; Pisinger, David; Salazar-González, Juan-José

2012-01-01

The design of container shipping networks is an important real world problem, with assets and operational costs in billions of dollars. To guide the optimal deployment of the ships, a single vessel roundtrip is considered by minimizing operational costs and flowing the best paying cargo under...... commercial constraints. Inspiration for formulation and solution method is taken from the rich research done within pickup and delivery problems. The problem, the multicommodity one-toone pickup and delivery traveling salesman problem with path duration limits is, to the best of out knowledge, considered...... for the first time. An arc flow and a path flow model are presented. A Branch and Cut and Price solution method is proposed and implemented....

Impact of the magnetic superstorm on March 17-19, 2015 on subpolar HF radio paths: Experiment and modeling

Science.gov (United States)

Blagoveshchensky, D. V.; Maltseva, O. A.; Anishin, M. M.; Sergeeva, M. A.; Rogov, D. D.

2016-09-01

The ionospheric phenomena which significantly influenced radio propagation during March 17-19, 2015 are considered in the study. The data of oblique ionospheric sounding (OIS) were analyzed at six radio paths. These paths are located in the zone of North Siberia in Russia and have different lengths: from 1000 to 5000 km. The results are the following. The magnetic storm drastically changed the character of radio propagation at all the considered paths: in most cases the reflections from the ionospheric F2-layer were changed by the reflections only from the sporadic Es-layer. The parameters of movement of the disturbance front were estimated on the basis of OIS data of the paths. The average velocity of the front movements from east to west was about V = 440 m/s. Even the moderate growth of riometer absorption within the region of radio paths' locations, resulted in loss of multihop modes in the signal reflections from sporadic layers. It also resulted in a sharp decrease of signal strength at the paths. Real distance-frequency characteristics (DFC) of the paths were compared to DFC calculated on the basis of International Reference Ionosphere (IRI) model. It was revealed that on a quiet day of March, 15th, the real and the calculated DFC are similar or coincide in the majority of cases. During the disturbed days of March, 17-19, most commonly observed are the significant differences between the calculated and the experimental data. The most pronounced difference is revealed while estimating the character of OIS signals' reflections from Es-layers.

Costs associated with wheeling

International Nuclear Information System (INIS)

Anon.

1991-01-01

Wheeling costs are incurred by all companies that experience a change in power flows over their transmission lines during a specific transaction, whether or not the lines of that company are part of the contract path. The costs of providing wheeling service differ from one system to another and from one kind of wheeling transaction to another. While most transactions may be completed using existing capacity, others may require an increase in line. Depending on the situation, some cost components may be high, low, negative, or not incurred at all. This article discusses two general categories of costs; transactional and capital. The former are all operation, maintenance and opportunity costs incurred in completing a specific transaction assuming the existence of adequate capacity. Capital costs are the costs of major new equipment purchases and lines necessary to provide any increased level of transmission services

Evaluation of Shortest Paths in Road Network

Directory of Open Access Journals (Sweden)

Farrukh Shehzad

2009-06-01

Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

Self-Configuring Indoor Localization Based on Low-Cost Ultrasonic Range Sensors

Directory of Open Access Journals (Sweden)

Can Basaran

2014-10-01

Full Text Available In smart environments, target tracking is an essential service used by numerous applications from activity recognition to personalized infotaintment. The target tracking relies on sensors with known locations to estimate and keep track of the path taken by the target, and hence, it is crucial to have an accurate map of such sensors. However, the need for manually entering their locations after deployment and expecting them to remain fixed, significantly limits the usability of target tracking. To remedy this drawback, we present a self-configuring and device-free localization protocol based on genetic algorithms that autonomously identifies the geographic topology of a network of ultrasonic range sensors as well as automatically detects any change in the established network structure in less than a minute and generates a new map within seconds. The proposed protocol significantly reduces hardware and deployment costs thanks to the use of low-cost off-the-shelf sensors with no manual configuration. Experiments on two real testbeds of different sizes show that the proposed protocol achieves an error of 7.16~17.53 cm in topology mapping, while also tracking a mobile target with an average error of 11.71~18.43 cm and detecting displacements of 1.41~3.16 m in approximately 30 s.

Uncapacitated facility location problem with self-serving demands

Directory of Open Access Journals (Sweden)

E Monabbati

2013-12-01

Full Text Available In classical uncapacitated facility location problems (UFLP the goal is to satisfy requirements of some demand points by setting up some servers, among potential facility locations, such that the total cost including service costs and fixed costs are minimized. In this paper a generalization of UFLP is considered in which some demand points, called self-serving, could be served exclusively by a new server at that point. Numerical experiments show that near optimal solutions are achieved by the proposed method.

Interactive multi-objective path planning through a palette-based user interface

Science.gov (United States)

Shaikh, Meher T.; Goodrich, Michael A.; Yi, Daqing; Hoehne, Joseph

2016-05-01

n a problem where a human uses supervisory control to manage robot path-planning, there are times when human does the path planning, and if satisfied commits those paths to be executed by the robot, and the robot executes that plan. In planning a path, the robot often uses an optimization algorithm that maximizes or minimizes an objective. When a human is assigned the task of path planning for robot, the human may care about multiple objectives. This work proposes a graphical user interface (GUI) designed for interactive robot path-planning when an operator may prefer one objective over others or care about how multiple objectives are traded off. The GUI represents multiple objectives using the metaphor of an artist's palette. A distinct color is used to represent each objective, and tradeoffs among objectives are balanced in a manner that an artist mixes colors to get the desired shade of color. Thus, human intent is analogous to the artist's shade of color. We call the GUI an "Adverb Palette" where the word "Adverb" represents a specific type of objective for the path, such as the adverbs "quickly" and "safely" in the commands: "travel the path quickly", "make the journey safely". The novel interactive interface provides the user an opportunity to evaluate various alternatives (that tradeoff between different objectives) by allowing her to visualize the instantaneous outcomes that result from her actions on the interface. In addition to assisting analysis of various solutions given by an optimization algorithm, the palette has additional feature of allowing the user to define and visualize her own paths, by means of waypoints (guiding locations) thereby spanning variety for planning. The goal of the Adverb Palette is thus to provide a way for the user and robot to find an acceptable solution even though they use very different representations of the problem. Subjective evaluations suggest that even non-experts in robotics can carry out the planning tasks with a

Location-Aided Reliable Routing for Opportunistic Networks

Institute of Scientific and Technical Information of China (English)

Yong Yang; Zhi Ren; Jibi Li

2012-01-01

In our study, we investigate the problem of location-based routing in opportunistic networks. Due to the uncertainty of end-to-end paths between sources and destinations, the classical location-based ad hoc routing protocols cannot adapt to the environment of opportunistic networks, which leads to the decrease of the delivery rate of data. To address it, we propose in this paper a novel location-aided routing protocol which is suitable for opportunistic networks. In our protocol, a node can send location information on demand by using prediction mechanism, and when sending a data packet, the node chooses multiple neighbors which are closer to the destination as next hops. If the candidate neighbors do not exist, the node carries the data till it meets a proper neighbor or the destination. Theoretical analysis and simulation results show that our proposed protocol outperforms DREAM (Distance Routing Effect Protocol Mobility) and one of its improved versions, BFDREAM (Boundary Forwarding DREAM), in terms of the delivery rate and overhead.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

2018-04-23

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

NSRD-10: Leak Path Factor Guidance Using MELCOR

Energy Technology Data Exchange (ETDEWEB)

Louie, David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Humphries, Larry L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-03-01

Estimates of the source term from a U.S. Department of Energy (DOE) nuclear facility requires that the analysts know how to apply the simulation tools used, such as the MELCOR code, particularly for a complicated facility that may include an air ventilation system and other active systems that can influence the environmental pathway of the materials released. DOE has designated MELCOR 1.8.5, an unsupported version, as a DOE ToolBox code in its Central Registry, which includes a leak-path-factor guidance report written in 2004 that did not include experimental validation data. To continue to use this MELCOR version requires additional verification and validations, which may not be feasible from a project cost standpoint. Instead, the recent MELCOR should be used. Without any developer support and lack of experimental data validation, it is difficult to convince regulators that the calculated source term from the DOE facility is accurate and defensible. This research replaces the obsolete version in the 2004 DOE leak path factor guidance report by using MELCOR 2.1 (the latest version of MELCOR with continuing modeling development and user support) and by including applicable experimental data from the reactor safety arena and from applicable experimental data used in the DOE-HDBK-3010. This research provides best practice values used in MELCOR 2.1 specifically for the leak path determination. With these enhancements, the revised leak-path-guidance report should provide confidence to the DOE safety analyst who would be using MELCOR as a source-term determination tool for mitigated accident evaluations.

Path-based Queries on Trajectory Data

DEFF Research Database (Denmark)

Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

2014-01-01

In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

Hippocampal “Time Cells”: Time versus Path Integration

Science.gov (United States)

Kraus, Benjamin J.; Robinson, Robert J.; White, John A.; Eichenbaum, Howard; Hasselmo, Michael E.

2014-01-01

SUMMARY Recent studies have reported the existence of hippocampal “time cells,” neurons that fire at particular moments during periods when behavior and location are relatively constant. However, an alternative explanation of apparent time coding is that hippocampal neurons “path integrate” to encode the distance an animal has traveled. Here, we examined hippocampal neuronal firing patterns as rats ran in place on a treadmill, thus “clamping” behavior and location, while we varied the treadmill speed to distinguish time elapsed from distance traveled. Hippocampal neurons were strongly influenced by time and distance, and less so by minor variations in location. Furthermore, the activity of different neurons reflected integration over time and distance to varying extents, with most neurons strongly influenced by both factors and some significantly influenced by only time or distance. Thus, hippocampal neuronal networks captured both the organization of time and distance in a situation where these dimensions dominated an ongoing experience. PMID:23707613

Demand response with locational dynamic pricing to support the integration of renewables

International Nuclear Information System (INIS)

Dupont, B.; De Jonghe, C.; Olmos, L.; Belmans, R.

2014-01-01

Electricity production from centralised and decentralised renewable energy resources in Europe is gaining significance, resulting in operational challenges in the electricity system. Although these challenges add to the locational and time dependency of the underlying cost of operating the system, this variability in time and location is not reflected in residential tariff schemes. Consequently, residential users are not incentivised to react to varying system conditions and to help the integration of renewable energy resources. Therefore, this paper provides a theoretical framework for designing a locational dynamic pricing scheme. This can be used to assess existing tariff structures for consumption and injection, and can serve as a theoretical background for developing new tariff schemes. Starting from the underlying costs, this paper shows that the potential for locational dynamic pricing depends on the locational and time dependency of its cost drivers. When converting costs into tariffs, the tariff design should be determined. This includes the advance notice of sending tariffs to users, and the length of price blocks and price patterns. This tariff design should find a balance between tariff principles related to costs, practicality and social acceptability on the one hand, and the resulting demand response incentive on the other. - Highlights: • The integration of renewables affects the locational and time dependency of costs. • Locational dynamic pricing reflects cost variability and allows demand response. • A theoretical framework for designing and assessing tariff schemes is proposed. • Tariff variability depends on the locational and time dependency of its cost drivers. • The tariff design should consider the resulting demand response incentive

41 CFR 301-70.505 - May any travel costs be reimbursed if the employee travels to an alternate location for medical...

Science.gov (United States)

2010-07-01

... 41 Public Contracts and Property Management 4 2010-07-01 2010-07-01 false May any travel costs be reimbursed if the employee travels to an alternate location for medical treatment? 301-70.505 Section 301-70.505 Public Contracts and Property Management Federal Travel Regulation System TEMPORARY DUTY (TDY) TRAVEL ALLOWANCES AGENCY RESPONSIBILITIES...

Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective

OpenAIRE

Pereira, Hernane Borges de Barros; Pérez Vidal, Lluís; Lozada, Eleazar G. Madrid

2003-01-01

Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach. After the mathematical model building, optimization problem and resolution problem by a behavioral impedance algorithm, it is discussed how behavioral impedance cost function is embedded in the k-shortest path model. From the pedestrian's route planning persp...

Gas-path leakage seal for a gas turbine

Science.gov (United States)

Wolfe, C.E.; Dinc, O.S.; Bagepalli, B.S.; Correia, V.H.; Aksit, M.F.

1996-04-23

A gas-path leakage seal is described for generally sealing a gas-path leakage-gap between spaced-apart first and second members of a gas turbine (such as combustor casing segments). The seal includes a generally imperforate foil-layer assemblage which is generally impervious to gas and is located in the leakage-gap. The seal also includes a cloth-layer assemblage generally enclosingly contacting the foil-layer assemblage. In one seal, the first edge of the foil-layer assemblage is left exposed, and the foil-layer assemblage resiliently contacts the first member near the first edge to reduce leakage in the ``plane`` of the cloth-layer assemblage under conditions which include differential thermal growth of the two members. In another seal, such leakage is reduced by having a first weld-bead which permeates the cloth-layer assemblage, is attached to the metal-foil-layer assemblage near the first edge, and unattachedly contacts the first member. 4 figs.

Spatial quality, location theory and spatial planning

NARCIS (Netherlands)

Assink, Mathijs; Groenendijk, Nico

2009-01-01

This paper deals with spatial quality as a possible factor in location choices made by companies. Actual location decisions as well as location theory have changed over time. In the industrial era primary “hard” cost factors were dominant, to be supplemented by agglomeration factors ever since the

Dynamic path planning for autonomous driving on various roads with avoidance of static and moving obstacles

Science.gov (United States)

Hu, Xuemin; Chen, Long; Tang, Bo; Cao, Dongpu; He, Haibo

2018-02-01

This paper presents a real-time dynamic path planning method for autonomous driving that avoids both static and moving obstacles. The proposed path planning method determines not only an optimal path, but also the appropriate acceleration and speed for a vehicle. In this method, we first construct a center line from a set of predefined waypoints, which are usually obtained from a lane-level map. A series of path candidates are generated by the arc length and offset to the center line in the s - ρ coordinate system. Then, all of these candidates are converted into Cartesian coordinates. The optimal path is selected considering the total cost of static safety, comfortability, and dynamic safety; meanwhile, the appropriate acceleration and speed for the optimal path are also identified. Various types of roads, including single-lane roads and multi-lane roads with static and moving obstacles, are designed to test the proposed method. The simulation results demonstrate the effectiveness of the proposed method, and indicate its wide practical application to autonomous driving.

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

Energy Technology Data Exchange (ETDEWEB)

Vandewouw, Marlee M., E-mail: marleev@mie.utoronto.ca; Aleman, Dionne M. [Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8 (Canada); Jaffray, David A. [Radiation Medicine Program, Princess Margaret Cancer Centre, Toronto, Ontario M5G 2M9 (Canada)

2016-08-15

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

International Nuclear Information System (INIS)

Vandewouw, Marlee M.; Aleman, Dionne M.; Jaffray, David A.

2016-01-01

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.

Design Change Model for Effective Scheduling Change Propagation Paths

Science.gov (United States)

Zhang, Hai-Zhu; Ding, Guo-Fu; Li, Rong; Qin, Sheng-Feng; Yan, Kai-Yin

2017-09-01

Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how requirement changes propagate in the design of complex product systems and be able to select best options to guide design. Currently, a most approach for design change is lack of take the multi-disciplinary coupling relationships and the number of parameters into account integrally. A new design change model is presented to systematically analyze and search change propagation paths. Firstly, a PDS-Behavior-Structure-based design change model is established to describe requirement changes causing the design change propagation in behavior and structure domains. Secondly, a multi-disciplinary oriented behavior matrix is utilized to support change propagation analysis of complex product systems, and the interaction relationships of the matrix elements are used to obtain an initial set of change paths. Finally, a rough set-based propagation space reducing tool is developed to assist in narrowing change propagation paths by computing the importance of the design change parameters. The proposed new design change model and its associated tools have been demonstrated by the scheduling change propagation paths of high speed train's bogie to show its feasibility and effectiveness. This model is not only supportive to response quickly to diversified market requirements, but also helpful to satisfy customer requirements and reduce product development lead time. The proposed new design change model can be applied in a wide range of engineering systems design with improved efficiency.

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR

Science.gov (United States)

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-01-01

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner. PMID:29439447

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR.

Science.gov (United States)

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-02-11

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner.

Determinants of industrial location : Kingdom of Yugoslavia in the interwar period

NARCIS (Netherlands)

Nikolić, Stefan

2018-01-01

What determines the location of industry? Using panel data econometrics and a new dataset on interwar Yugoslavia the predictions of three theories—Heckscher-Ohlin, New Economic Geography, and Path Dependence—are quantified and compared. Results show that all three theories mattered and that New

Three formulations of the multi-type capacitated facility location problem

DEFF Research Database (Denmark)

Klose, Andreas

The "multi-type" or "modular" capacitated facility location problem is a discrete location model that addresses non-convex piecewise linear production costs as, for instance, staircase cost functions. The literature basically distinguishes three different ways to formulate non-convex piecewise...

Path integration quantization

International Nuclear Information System (INIS)

DeWitt-Morette, C.

1983-01-01

Much is expected of path integration as a quantization procedure. Much more is possible if one recognizes that path integration is at the crossroad of stochastic and differential calculus and uses the full power of both stochastic and differential calculus in setting up and computing path integrals. In contrast to differential calculus, stochastic calculus has only comparatively recently become an instrument of thought. It has nevertheless already been used in a variety of challenging problems, for instance in the quantization problem. The author presents some applications of the stochastic scheme. (Auth.)

The graph-theoretic minimum energy path problem for ionic conduction

Directory of Open Access Journals (Sweden)

Ippei Kishida

2015-10-01

Full Text Available A new computational method was developed to analyze the ionic conduction mechanism in crystals through graph theory. The graph was organized into nodes, which represent the crystal structures modeled by ionic site occupation, and edges, which represent structure transitions via ionic jumps. We proposed a minimum energy path problem, which is similar to the shortest path problem. An effective algorithm to solve the problem was established. Since our method does not use randomized algorithm and time parameters, the computational cost to analyze conduction paths and a migration energy is very low. The power of the method was verified by applying it to α-AgI and the ionic conduction mechanism in α-AgI was revealed. The analysis using single point calculations found the minimum energy path for long-distance ionic conduction, which consists of 12 steps of ionic jumps in a unit cell. From the results, the detailed theoretical migration energy was calculated as 0.11 eV by geometry optimization and nudged elastic band method. Our method can refine candidates for possible jumps in crystals and it can be adapted to other computational methods, such as the nudged elastic band method. We expect that our method will be a powerful tool for analyzing ionic conduction mechanisms, even for large complex crystals.

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Directory of Open Access Journals (Sweden)

Mario Miler

2014-02-01

Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

PATH ANALYSIS OF RECORDING SYSTEM INNOVATION FACTORS AFFECTING ADOPTION OF GOAT FARMERS

Directory of Open Access Journals (Sweden)

S. Okkyla

2014-09-01

Full Text Available The objective of this study was to evaluate the path analysis of recording system innovation factorsaffecting adoption of goat farmers. This study was conducted from January to February 2014 inPringapus District, Semarang Regency by using survey method. For determining the location, this studyused purposive sampling method. The amount of respondents were determined by quota samplingmethod. Total respondents randomly chosed were 146 farmers. The data were descriptively andquantitatively analyzed by using path analysis of statistical package for the social science (SPSS 16.Independent variables in this study were internal factor, motivation, innovation characteristics,information source, and dependent variable was adoption. Analysis of linear regression showed thatthere was no significant effect of internal factor on adoption, so that it was important to use the trimmingmethod in path analysis. The result of path analysis showed that the influence of motivation, innovationcharacteristics and information source on adoption were 0.168; 0.720 and 0.09, respectively. Innovationcharacteristics were the greatest effect on adoption. In conclusion, by improving innovationcharacteristics of respondent through motivation and information source may significantly increase theadoption of recording system in goat farmers.

Research on Navigation Path Planning for An Underground Load Haul Dump

Directory of Open Access Journals (Sweden)

Qi Yulong

2015-11-01

Full Text Available The improved A * algorithm is a method of navigation path planning for articulated underground scrapers. Firstly, an environment model based on a mining Geographic Information System (GIS map is established, and then combined with improved A * algorithm, the underground global path planning problem of the intelligent Load Haul Dump (LHD is solved. In this paper, for the articulated structure, the method of expanding nodes by articulation angle is adopted to make expanded nodes meet the trajectory characteristics. In addition, collision threat cost is introduced in the evaluation function to avoid collisions between the LHD and the tunnel walls. As peran analysis of the simulation test to verify the effectiveness of the improved A * algorithm and a comparison with the traditional A * algorithm, the improved A * algorithm can enhance search efficiency. Acontrast of multiple sets of test parameters suggests that when the price weighted coefficient of collision is 0.2, the shortest path can be derived to avoid impact. Finally, tracking results indicate that the proposed algorithm for navigation path planning can maintain the tracking error to within 0.2 m in line with the structural characteristics of the scraper in the laboratory environment to realize the path planning of unmanned scrapers and trajectory tracking. Moreover, the algorithm can enhance the safety of scrapers and prevent roadway collisions. The feasibility and practicality of the proposed method is verified in this work.

Reparametrization in the path integral

International Nuclear Information System (INIS)

Storchak, S.N.

1983-01-01

The question of the invariance of a measure in the n-dimensional path integral under the path reparametrization is considered. The non-invariance of the measure through the jacobian is suggeste. After the path integral reparametrization the representatioq for the Green's function of the Hamilton operator in terms of the path integral with the classical Hamiltonian has been obtained

Unique Path Partitions

DEFF Research Database (Denmark)

Bessenrodt, Christine; Olsson, Jørn Børling; Sellers, James A.

2013-01-01

We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.......We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions....

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Directory of Open Access Journals (Sweden)

Ji Ung Sun

2015-01-01

Full Text Available We consider a capacitated hub location-routing problem (HLRP which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

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

Science.gov (United States)

Teichroeb, Julie A

2015-10-01

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

Determining the Edges of the Path of Totality on August 21, 2017

Science.gov (United States)

Dunham, David W.; Maley, Paul D.; Kok, Jan; Bruenjes, Fred

2018-01-01

The International Occultation Timing Association (IOTA) attempted a citizen-science project to determine the locations of the edges of the path of totality, similar to what was done visually in New York City during the 1925 eclipse. With ubiquitous smart phones, we asked observers to record the eclipse, preferably with clip-on 8x telephoto lenses. The limits are not sharp since the solar intensity drops off gradually at the path edges. We hoped to determine how accurately the path edges could be determined, and the width of their “fuzziness”. But it was not possible to find any astronomers who weren’t also going to the center, who might otherwise help organize some path edge observations. In 1925, people were less concerned about the possibility of suffering eye damage from quick glimpses at the eclipse. In 2017, several were concerned about damage to their cell phones, although our tests showed this was not a problem for the two minutes desired. The only successes were at Minden, Nebraska where high school students set up 15 stations across the southern limit and recorded the eclipse with iPads, and near Wheatland, Wyoming, where Jan Kok set up 21 pre-pointed smart phones with 8x lenses that he was able to program, to record the eclipse during the critical two minutes. We found that the dynamic range of the smart phone recordings could not distinguish between the corona, and the Baily’s beads around the contacts, so useful times of the duration of “totality” could not be determined. A few IOTA observers recorded Baily’s beads telescopically at a few locations near the eclipse limits. An especially good color recording of Baily’s beads was made by Fred Bruenjes from only 1.3 km inside the southern limit. We hope that similar recordings with accurate time stamping can be obtained at a few locations near both limits of future eclipses. Even better might be recordings of the flash spectrum near both limits, to measure the transition from absorption

When the 'soft-path' gets hard: demand management and financial instability for water utilities

Science.gov (United States)

Zeff, H. B.; Characklis, G. W.

2014-12-01

In the past, cost benefit analysis (CBA) has been viewed as an effective means of evaluating water utility strategies, particularly those that were dependent on the construction of new supply infrastructure. As water utilities have begun to embrace 'soft-path' approaches as a way to reduce the need for supply-centric development, CBA fails to recognize some important financial incentives affected by reduced water consumption. Demand management, both as a short-term response to drought and in longer-term actions to accommodate demand growth, can introduce revenue risks that adversely affect a utility's ability to repay debt, re-invest in aging infrastructure, or maintain reserve funds for use in a short-term emergency. A utility that does not generate sufficient revenue to support these functions may be subject to credit rating downgrades, which in turn affect the interest rate it pays on its debt. Interest rates are a critical consideration for utility managers in the capital-intensive water sector, where debt payments for infrastructure often account for a large portion of a utility's overall costs. Even a small increase in interest rates can add millions of dollars to the cost of new infrastructure. Recent studies have demonstrated that demand management techniques can lead to significant revenue variability, and credit rating agencies have begun to take notice of drought response plans when evaluating water utility credit ratings, providing utilities with a disincentive to fully embrace soft-path approaches. This analysis examines the impact of demand management schemes on key credit rating metrics for a water utility in Raleigh, North Carolina. The utility's consumer base is currently experiencing rapid population growth, and demand management has the potential to reduce the dependence on costly new supply infrastructure but could lead to financial instability that will significantly increase the costs of financing future projects. This work analyzes how 'soft-path

A biomimetic, energy-harvesting, obstacle-avoiding, path-planning algorithm for UAVs

Science.gov (United States)

Gudmundsson, Snorri

This dissertation presents two new approaches to energy harvesting for Unmanned Aerial Vehicles (UAV). One method is based on the Potential Flow Method (PFM); the other method seeds a wind-field map based on updraft peak analysis and then applies a variant of the Bellman-Ford algorithm to find the minimum-cost path. Both methods are enhanced by taking into account the performance characteristics of the aircraft using advanced performance theory. The combined approach yields five possible trajectories from which the one with the minimum energy cost is selected. The dissertation concludes by using the developed theory and modeling tools to simulate the flight paths of two small Unmanned Aerial Vehicles (sUAV) in the 500 kg and 250 kg class. The results show that, in mountainous regions, substantial energy can be recovered, depending on topography and wind characteristics. For the examples presented, as much as 50% of the energy was recovered for a complex, multi-heading, multi-altitude, 170 km mission in an average wind speed of 9 m/s. The algorithms constitute a Generic Intelligent Control Algorithm (GICA) for autonomous unmanned aerial vehicles that enables an extraction of atmospheric energy while completing a mission trajectory. At the same time, the algorithm. automatically adjusts the flight path in order to avoid obstacles, in a fashion not unlike what one would expect from living organisms, such as birds and insects. This multi-disciplinary approach renders the approach biomimetic, i.e. it constitutes a synthetic system that “mimics the formation and function of biological mechanisms and processes.”.

Location of Farmers Warehouse at Adaklu Traditional Area, Volta Region, Ghana

Directory of Open Access Journals (Sweden)

Vincent Tulasi

2016-01-01

Full Text Available Postharvest loss is one major problem farmers in Adaklu Traditional Area that most Ghanaian farmers face. As a result, many farmers wallow in abject poverty. Warehouses are important facilities that help to reduce postharvest loss. In this research, Beresnev pseudo-Boolean Simple Plant Location Problem (SPLP model is used to locate a warehouse at Adaklu Traditional Area, Volta Region, Ghana. This model was used because it gives a straightforward computation and produces no iteration as compared with other models. The SPLP is a problem of selecting a site from candidate sites to locate a plant so that customers can be supplied from the plant at a minimum cost. The model is made up of fixed cost and transportation cost. Location index ordering matrix was developed from the transportation cost matrix and we used it with the fixed cost and differences between variable costs to formulate the Beresnev function. Linear term developed from the function which was partial is pegged to obtain a complete solution. Of the 14 notable communities considered, Adaklu Waya is found most suitable for the setting of the warehouse. The total cost involved is Gh₵ 78,180.00.

Chemical solution deposition: a path towards low cost coated conductors

International Nuclear Information System (INIS)

Obradors, X; Puig, T; Pomar, A; Sandiumenge, F; Pinol, S; Mestres, N; Castano, O; Coll, M; Cavallaro, A; Palau, A; Gazquez, J; Gonzalez, J C; Gutierrez, J; Roma, N; Ricart, S; Moreto, J M; Rossell, M D; Tendeloo, G van

2004-01-01

The achievement of low cost deposition techniques for high critical current YBa 2 Cu 3 O 7 coated conductors is one of the major objectives to achieve a widespread use of superconductivity in power applications. Chemical solution deposition techniques are appearing as a very promising methodology to achieve epitaxial oxide thin films at a low cost, so an intense effort is being carried out to develop routes for all chemical coated conductor tapes. In this work recent achievements will be presented towards the goal of combining the deposition of different type of buffer layers on metallic substrates based on metal-organic decomposition with the growth of YBa 2 Cu 3 O 7 layers using the trifluoroacetate route. The influence of processing parameters on the microstructure and superconducting properties will be stressed. High critical currents are demonstrated in 'all chemical' multilayers

An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

Directory of Open Access Journals (Sweden)

Sultan Alamri

2018-03-01

Full Text Available Routing systems for outdoor space have become the focus of many research works. Such routing systems are based on spatial road networks where moving objects (such as cars are affected by the directed roads and the movement of traffic, which may include traffic jams. Indoor routing, on the other hand, must take into account the features of indoor space such as walls and rooms. In this paper, we take indoor routing in a new direction whereby we consider the features that a building has in common with outdoor spaces. Inside some buildings, there may be directed floors where moving objects must move in a certain direction through directed corridors in order to reach a certain location. For example, on train platforms or in museums, movement in the corridors may be directed. In these directed floor spaces, a routing system enabling a visitor to take the shortest path to a certain location is essential. Therefore, this work proposes a new approach for buildings with directed indoor spaces, where each room can be affected by the density of the moving objects. The proposed system obtains the shortest path between objects or rooms taking into consideration the directed indoor space and the capacity of the objects to move within each room/cell.

Explore Stochastic Instabilities of Periodic Points by Transition Path Theory

Science.gov (United States)

Cao, Yu; Lin, Ling; Zhou, Xiang

2016-06-01

We consider the noise-induced transitions from a linearly stable periodic orbit consisting of T periodic points in randomly perturbed discrete logistic map. Traditional large deviation theory and asymptotic analysis at small noise limit cannot distinguish the quantitative difference in noise-induced stochastic instabilities among the T periodic points. To attack this problem, we generalize the transition path theory to the discrete-time continuous-space stochastic process. In our first criterion to quantify the relative instability among T periodic points, we use the distribution of the last passage location related to the transitions from the whole periodic orbit to a prescribed disjoint set. This distribution is related to individual contributions to the transition rate from each periodic points. The second criterion is based on the competency of the transition paths associated with each periodic point. Both criteria utilize the reactive probability current in the transition path theory. Our numerical results for the logistic map reveal the transition mechanism of escaping from the stable periodic orbit and identify which periodic point is more prone to lose stability so as to make successful transitions under random perturbations.

Iterated Leavitt Path Algebras

International Nuclear Information System (INIS)

Hazrat, R.

2009-11-01

Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

Path Dependence

DEFF Research Database (Denmark)

Madsen, Mogens Ove

Begrebet Path Dependence blev oprindelig udviklet inden for New Institutionel Economics af bl.a. David, Arthur og North. Begrebet har spredt sig vidt i samfundsvidenskaberne og undergået en udvikling. Dette paper propagerer for at der er sket så en så omfattende udvikling af begrebet, at man nu kan...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...

Minimum cost connection networks

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Tvede, Mich

2015-01-01

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...... demands. We use a few axioms to characterize allocation rules that truthfully implement cost minimizing networks satisfying all connection demands in a game where: (1) a central planner announces an allocation rule and a cost estimation rule; (2) every agent reports her own connection demand as well...... as all connection costs; (3) the central planner selects a cost minimizing network satisfying reported connection demands based on the estimated costs; and, (4) the planner allocates the true costs of the selected network. It turns out that an allocation rule satisfies the axioms if and only if relative...

Shortest Paths and Vehicle Routing

DEFF Research Database (Denmark)

Petersen, Bjørn

This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

[Dual insertion paths design characteristics and short-term clinical observation of rotational path removable partial dentures].

Science.gov (United States)

Li, Jian; Jiang, Ting; Li, Sai; Chen, Wei

2013-02-18

To investigate design methods of dual insertion paths and observe a short-term clinic overview of rotational path removable partial dentures (RPDs). In the study, 40 patients with partial edentulous arches were included and divided into two groups. The patients in group one were restored with rotational path RPDs (10 Kennedy class III and 10 Kennedy class IV respectively). The patients in group two (20 patients), whose edentulous area was matched with the patients' in group one, were restored with the linear path RPDs. After surveying and simulative preparation on diagnostic casts, the basic laws of designing rotational path RPDs were summarized. The oral preparation was accurately performed under the guidance of indices made on diagnostic casts after simulative preparation. The 40 dentures were recalled two weeks and one year after the insertion. The evaluations of the clinic outcome, including retention, stability, mastication function, esthetics and wearing convenience, were marked out as good, acceptable, and poor. The comparison of the evaluation results was performed between the two groups. In the rotational path design for Kennedy class III or IV RPDs, the angles (α) of dual insertion paths should be designed within a scope, approximate 10°-15°.When the angle (α) became larger, the denture retention turned to be better, but accordingly the posterior abutments needed more preparation. In the clinical application, the first insertions of the 40 dentures were all favorably accomplished. When the rotational path RPDs were compared to linear path RPDs, the time consuming on first insertion had no statistical difference[(32±8) min and (33±8) min respectively, P>0.05]. Recalled two weeks and one year after the insertion, in the esthetics evaluation, 20 rotational path RPDs were all evaluated as "A", but only 7(two weeks after) and 6 (one year after) linear path RPDs were evaluated as "A"(P<0.05). There was no significant difference in other evaluation results

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Energy Technology Data Exchange (ETDEWEB)

Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

2011-01-15

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

Path planning in changeable environments

NARCIS (Netherlands)

Nieuwenhuisen, D.

2007-01-01

This thesis addresses path planning in changeable environments. In contrast to traditional path planning that deals with static environments, in changeable environments objects are allowed to change their configurations over time. In many cases, path planning algorithms must facilitate quick

Comparison of classical reaction paths and tunneling paths studied with the semiclassical instanton theory.

Science.gov (United States)

Meisner, Jan; Markmeyer, Max N; Bohner, Matthias U; Kästner, Johannes

2017-08-30

Atom tunneling in the hydrogen atom transfer reaction of the 2,4,6-tri-tert-butylphenyl radical to 3,5-di-tert-butylneophyl, which has a short but strongly curved reaction path, was investigated using instanton theory. We found the tunneling path to deviate qualitatively from the classical intrinsic reaction coordinate, the steepest-descent path in mass-weighted Cartesian coordinates. To perform that comparison, we implemented a new variant of the predictor-corrector algorithm for the calculation of the intrinsic reaction coordinate. We used the reaction force analysis method as a means to decompose the reaction barrier into structural and electronic components. Due to the narrow energy barrier, atom tunneling is important in the abovementioned reaction, even above room temperature. Our calculated rate constants between 350 K and 100 K agree well with experimental values. We found a H/D kinetic isotope effect of almost 10 6 at 100 K. Tunneling dominates the protium transfer below 400 K and the deuterium transfer below 300 K. We compared the lengths of the tunneling path and the classical path for the hydrogen atom transfer in the reaction HCl + Cl and quantified the corner cutting in this reaction. At low temperature, the tunneling path is about 40% shorter than the classical path.

Regular paths in SparQL: querying the NCI Thesaurus.

Science.gov (United States)

Detwiler, Landon T; Suciu, Dan; Brinkley, James F

2008-11-06

OWL, the Web Ontology Language, provides syntax and semantics for representing knowledge for the semantic web. Many of the constructs of OWL have a basis in the field of description logics. While the formal underpinnings of description logics have lead to a highly computable language, it has come at a cognitive cost. OWL ontologies are often unintuitive to readers lacking a strong logic background. In this work we describe GLEEN, a regular path expression library, which extends the RDF query language SparQL to support complex path expressions over OWL and other RDF-based ontologies. We illustrate the utility of GLEEN by showing how it can be used in a query-based approach to defining simpler, more intuitive views of OWL ontologies. In particular we show how relatively simple GLEEN-enhanced SparQL queries can create views of the OWL version of the NCI Thesaurus that match the views generated by the web-based NCI browser.

A Path Based Model for a Green Liner Shipping Network Design

DEFF Research Database (Denmark)

Brouer, Berit Dangaard; Jepsen, Mads Kehlet; Plum, Christian Edinger Munk

Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost eectiveness and environmentally conscious transport solutions. This article proposes...... a new path based MIP model for the Liner shipping Network Design Problem minimizing the cost of vessels and their fuel consumption facilitating a green network. The proposed model reduces problem size using a novel aggregation of demands. A decomposition method enabling delayed column generation...... is presented. The subproblems have similar structure to Vehicle Routing Problems, which can be solved using dynamic programming. An algorithm has been implemented for this model, unfortunately with discouraging results due to the structure of the subproblem and the lack of proper dominance criteria...

The High Field Path to Practical Fusion Energy

Science.gov (United States)

Mumgaard, Robert; Whyte, D.; Greenwald, M.; Hartwig, Z.; Brunner, D.; Sorbom, B.; Marmar, E.; Minervini, J.; Bonoli, P.; Irby, J.; Labombard, B.; Terry, J.; Vieira, R.; Wukitch, S.

2017-10-01

We propose a faster, lower cost development path for fusion energy enabled by high temperature superconductors, devices at high magnetic field, innovative technologies and modern approaches to technology development. Timeliness, scale, and economic-viability are the drivers for fusion energy to combat climate change and aid economic development. The opportunities provided by high-temperature superconductors, innovative engineering and physics, and new organizational structures identified over the last few years open new possibilities for realizing practical fusion energy that could meet mid-century de-carbonization needs. We discuss re-factoring the fusion energy development path with an emphasis on concrete risk retirement strategies utilizing a modular approach based on the high-field tokamak that leverages the broader tokamak physics understanding of confinement, stability, and operational limits. Elements of this plan include development of high-temperature superconductor magnets, simplified immersion blankets, advanced long-leg divertors, a compact divertor test tokamak, efficient current drive, modular construction, and demountable magnet joints. An R&D plan culminating in the construction of an integrated pilot plant and test facility modeled on the ARC concept is presented.

Path Planning Algorithms for the Adaptive Sensor Fleet

Science.gov (United States)

Stoneking, Eric; Hosler, Jeff

2005-01-01

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

Smart location system; Sistema de localizacao inteligente Smart Location System

Energy Technology Data Exchange (ETDEWEB)

Silva, Jose Augusto Pereira da; Antunes, Rodrigo de Castro; Azevedo, Fabio Augusto Ferreira de [PipeWay Engenharia, Rio de Janeiro, RJ (Brazil); Afonso, Orlando de Jesus Ribeiro [Instituto de Pesquisas da Marinha, Rio de Janeiro, RJ (Brazil); Matsuura, Minoru; Santa Cruz, Sergio de Freitas [TRANSPETRO - PETROBRAS Transportes, Rio de Janeiro, RJ (Brazil); Santos, Jose Alberto Costa dos; Hashiguchi, Decio Issao [GDK Engenharia (Brazil)

2003-07-01

This paper describes the technology used in the Intelligent Location System developed by Pipeway and includes some of the results already obtained optimizing repair time and logistic costs during the location of anomalies detected by intelligent pigs, a joint operation within the scope of the contract for Sub sea Pipeline Recovery in the Guanabara Bay with PETROBRAS/TRANSPETRO and GDK Engenharia. The system uses the ELF (Extra Low Frequency) transmission and reception technology at points near a pipe, with or without concrete coating, whose signals are recorded in the inspection tool memory to accurately establish reference points, thus preventing excessive dig work or dredging when human and operational risks tend to be high. (author)

Evaluating methods for estimating space-time paths of individuals in calculating long-term personal exposure to air pollution

Science.gov (United States)

Schmitz, Oliver; Soenario, Ivan; Vaartjes, Ilonca; Strak, Maciek; Hoek, Gerard; Brunekreef, Bert; Dijst, Martin; Karssenberg, Derek

2016-04-01

Air pollution is one of the major concerns for human health. Associations between air pollution and health are often calculated using long-term (i.e. years to decades) information on personal exposure for each individual in a cohort. Personal exposure is the air pollution aggregated along the space-time path visited by an individual. As air pollution may vary considerably in space and time, for instance due to motorised traffic, the estimation of the spatio-temporal location of a persons' space-time path is important to identify the personal exposure. However, long term exposure is mostly calculated using the air pollution concentration at the x, y location of someone's home which does not consider that individuals are mobile (commuting, recreation, relocation). This assumption is often made as it is a major challenge to estimate space-time paths for all individuals in large cohorts, mostly because limited information on mobility of individuals is available. We address this issue by evaluating multiple approaches for the calculation of space-time paths, thereby estimating the personal exposure along these space-time paths with hyper resolution air pollution maps at national scale. This allows us to evaluate the effect of the space-time path and resulting personal exposure. Air pollution (e.g. NO2, PM10) was mapped for the entire Netherlands at a resolution of 5×5 m2 using the land use regression models developed in the European Study of Cohorts for Air Pollution Effects (ESCAPE, http://escapeproject.eu/) and the open source software PCRaster (http://www.pcraster.eu). The models use predictor variables like population density, land use, and traffic related data sets, and are able to model spatial variation and within-city variability of annual average concentration values. We approximated space-time paths for all individuals in a cohort using various aggregations, including those representing space-time paths as the outline of a persons' home or associated parcel

Spatio-temporal structure, path characteristics and perceptual grouping in immediate serial spatial recall

Directory of Open Access Journals (Sweden)

Carlo De Lillo

2016-11-01

Full Text Available Immediate serial spatial recall measures the ability to retain sequences of locations in short-term memory and is considered the spatial equivalent of digit span. It is tested by requiring participants to reproduce sequences of movements performed by an experimenter or displayed on a monitor. Different organizational factors dramatically affect serial spatial recall but they are often confounded or underspecified. Untangling them is crucial for the characterization of working-memory models and for establishing the contribution of structure and memory capacity to spatial span. We report five experiments assessing the relative role and independence of factors that have been reported in the literature. Experiment 1 disentangled the effects of spatial clustering and path-length by manipulating the distance of items displayed on a touchscreen monitor. Long-path sequences segregated by spatial clusters were compared with short-path sequences not segregated by clusters. Recall was more accurate for sequences segregated by clusters independently from path-length. Experiment 2 featured conditions where temporal pauses were introduced between or within cluster boundaries during the presentation of sequences with the same paths. Thus, the temporal structure of the sequences was either consistent or inconsistent with a hierarchical representation based on segmentation by spatial clusters but the effect of structure could not be confounded with effects of path-characteristics. Pauses at cluster boundaries yielded more accurate recall, as predicted by a hierarchical model. In Experiment 3, the systematic manipulation of sequence structure, path-length and presence of path-crossings of sequences showed that structure explained most of the variance, followed by the presence/absence of path-crossings, and path-length. Experiments 4 and 5 replicated the results of the previous experiments in immersive virtual reality navigation tasks where the viewpoint of the

DiversePathsJ: diverse shortest paths for bioimage analysis.

Science.gov (United States)

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.

Methodological application of Location of service Public Bike. Service MUyBICI of Murcia

Energy Technology Data Exchange (ETDEWEB)

LiÑan Ruiz, R.J.; Berenguer Sempere, F.J.; Vera Lopez, J.A.; Pabon Dueñas, A.B.; Merino Cordoba, S.

2016-07-01

The use of non-motorized means of transport such as the bicycle, brings many benefits to the user and for the city in terms of costs and health for the first and decreased environmental pollution for the city. To find the optimal location for placement of the different parties to public bike, aims to attract the usual user and potential, have the feasibility of switching modes without any restrictions, while generating the ability to balance the demands users towards sustainable modes of transport, with special attention to cycling and public bike loan. The implementation of this methodology is performed in the municipality of Murcia (Spain) due to the opening of its public bicycle system MUyBICI which will have 60 benches, with a total of 1,200 posts anchor and put into circulation 600 public bicycles. As selection criteria to be considered for the optimal location of the beds, the existing network of bike paths were considered, roads used by all users of the public highway, a description of travel and a database information with different land uses and socioeconomic data transport areas. In this paper an analysis model and application for optimal design of banking locations for Murcia MUyBICI service occurs. Specifically, they define what are the best locations to attract a larger number of users, in order to achieve a change in the percentage of the modal split of the municipality, increasing the number of users MUyBICI service. This work comes under the direction of the Bicycle Office of Murcia, part of the ALEM (Local Agency for Energy and Environment) service under the Department of Environment of the City of Murcia. (Author)

The price path due to order imbalances: evidence from the Amsterdam agricultural futures exchange.

NARCIS (Netherlands)

Pennings, J.M.E.; Kuiper, W.E.; Hofstede, ter F.; Meulenberg, M.T.G.

1998-01-01

The lack of sufficient market depth particularly in many newly initiated futures markets results in relatively high hedging costs, and this inhibits the growth of futures contract volume. In this article the price path due to order imbalances is analyzed and a two-dimensional market depth measure is

Path integrals on curved manifolds

International Nuclear Information System (INIS)

Grosche, C.; Steiner, F.

1987-01-01

A general framework for treating path integrals on curved manifolds is presented. We also show how to perform general coordinate and space-time transformations in path integrals. The main result is that one has to subtract a quantum correction ΔV ∝ ℎ 2 from the classical Lagrangian L, i.e. the correct effective Lagrangian to be used in the path integral is L eff = L-ΔV. A general prescription for calculating the quantum correction ΔV is given. It is based on a canonical approach using Weyl-ordering and the Hamiltonian path integral defined by the midpoint prescription. The general framework is illustrated by several examples: The d-dimensional rotator, i.e. the motion on the sphere S d-1 , the path integral in d-dimensional polar coordinates, the exact treatment of the hydrogen atom in R 2 and R 3 by performing a Kustaanheimo-Stiefel transformation, the Langer transformation and the path integral for the Morse potential. (orig.)

Institutional path dependence and environmental water recovery in Australia’s Murray-Darling Basin

Directory of Open Access Journals (Sweden)

Graham R. Marshall

2016-10-01

Full Text Available The concept of institutional path dependence offers useful ways of understanding the trajectories of water policy reforms and how past institutional arrangements, policy paradigms and development patterns constrain current and future choices and limit institutional adaptability. The value of this concept is demonstrated through an analysis of environmental water recovery in Australia’s Murray-Darling Basin, where while significant water volumes have been reallocated to the environment, the costs have also been significant. While there are significant lessons from the Australian experience, attempts to emulate the approach involve substantive risks and may be prohibitively costly for less wealthy nations. Context-specific institutional analysis is emphasised as fundamental to water reform and critical for reform architecture and sequencing. A key finding is that while crisis can provide powerful catalysts for institutional innovation, institutional path dependence in the absence of active and disruptive policy entrepreneurs fosters a strong tendency to reinforce the status quo and limit innovation, potentially exposing social-ecological systems to greater shocks due to climate change and other sources of escalating uncertainty.

Social costs and benefits of nuclear futures

International Nuclear Information System (INIS)

Pearce, D.

1979-01-01

The conceptual framework for evaluating which energy path is chosen is one of trading-off costs and benefits in a world of technological, economic and social uncertainty. The translation of this conceptual framework into an analytical format with empirical relevance is dealt with. Some salient features of cost benefit analysis are discussed. Actual costs and benefits of nuclear futures are then considered. Subjects discussed are: routine and non-routine radiation, waste management, proliferation, and civil liberties. A 'regret' matrix is presented showing the cost to any future generation if a decision on nuclear power is made now. (U.K.)

Robust H∞ output-feedback control for path following of autonomous ground vehicles

Science.gov (United States)

Hu, Chuan; Jing, Hui; Wang, Rongrong; Yan, Fengjun; Chadli, Mohammed

2016-03-01

This paper presents a robust H∞ output-feedback control strategy for the path following of autonomous ground vehicles (AGVs). Considering the vehicle lateral velocity is usually hard to measure with low cost sensor, a robust H∞ static output-feedback controller based on the mixed genetic algorithms (GA)/linear matrix inequality (LMI) approach is proposed to realize the path following without the information of the lateral velocity. The proposed controller is robust to the parametric uncertainties and external disturbances, with the parameters including the tire cornering stiffness, vehicle longitudinal velocity, yaw rate and road curvature. Simulation results based on CarSim-Simulink joint platform using a high-fidelity and full-car model have verified the effectiveness of the proposed control approach.

Effects of T-type Channel on Natural Convection Flows in Airflow-Path of Concrete Storage Cask

Energy Technology Data Exchange (ETDEWEB)

Kang, Gyeong Uk; Kim, Hyoung Jin; Cho, Chun Hyung [KORAD, Daejeon (Korea, Republic of)

2016-05-15

The natural convection flows occurring in airflow-path are not simple due to complex flow-path configurations such as horizontal ducts, bent tube and annular flow-path. In addition, 16 T type channels acting as the shroud are attached vertically and 16 channel supporting the canister are attached horizontally on the inner surface of over-pack. The existence and nonexistence of T type channels have influences on the flow fields in airflow- path. The concrete storage cask has to satisfy the requirements to secure the thermal integrity under the normal, off-normal, and accident conditions. The present work is aiming at investigating the effects of T type channels on the flows in airflow-path under the normal conditions using the FLUENT 16.1 code. In order to focus on the flows in airflow-path, fuel regions in the canister are regarded as a single cylinder with heat sources and other components are fully modeled. This study investigated the flow fields in airflow-path of concrete storage cask, numerically. It was found that excepting for the fuel regions, maximum temperatures on other components were evaluated below allowable values. The location of maximum velocities depended on support channels, T type channels and flow area. The flows through air inlets developed along annular flow- path with forming the hot plumes. According to the existence and nonexistence of T type channel, the plume behavior showed the different flow patterns.

Welding Robot Collision-Free Path Optimization

Directory of Open Access Journals (Sweden)

Xuewu Wang

2017-02-01

Full Text Available Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization objective is analyzed. For local collision-free path planning, an ant colony algorithm is selected as the search strategy. Then, to overcome the shortcomings of the ant colony algorithm, a secondary optimization is presented to improve the optimization performance. Finally, the particle swarm optimization algorithm is used to realize global path planning. Simulation results show that the desired welding path can be obtained based on the optimization strategy.

Estimating cost-effectiveness of mass cardiopulmonary resuscitation training strategies to improve survival from cardiac arrest in private locations.

Science.gov (United States)

Swor, Robert; Compton, Scott

2004-01-01

Most cardiopulmonary resuscitation (CPR) trainees are young, and most cardiac arrests occur in private residences witnessed by older individuals. To estimate the cost-effectiveness of a CPR training program targeted at citizens over the age of 50 years compared with that of current nontargeted public CPR training. A model was developed using cardiac arrest and known demographic data from a single suburban zip code (population 36,325) including: local data (1997-1999) regarding cardiac arrest locations (public vs. private); incremental survival with CPR (historical survival rate 7.8%, adjusted odds ratio for CPR 2.0); arrest bystander demographics obtained from bystander telephone interviews; zip code demographics regarding population age and distribution; and 12.50 dollars per student for the cost of CPR training. Published rates of CPR training programs by age were used to estimate the numbers typically trained. Several assumptions were made: 1) there would be one bystander per. arrest; 2) the bystander would always perform CPR if trained; 3) cardiac arrest would be evenly distributed in the population; and 4) CPR training for a proportion of the population would proportionally increase CPR provision. Rates of arrest, bystanders by age, number of CPR trainees needed to result in increased arrest survival, and training cost per life saved for a one-year study period were calculated. There were 24.3 cardiac arrests per year, with 21.9 (90%) occurring in homes. In 66.5% of the home arrests, the bystander was more than 50 years old. To yield one additional survivor using the current CPR training strategy, 12,306 people needed to be trained (3,510 bystanders aged 50 years), which resulted in CPR provision to 7.14 additional patients. The training cost per life saved for a bystander aged 50 years was 785,040 dollars. Using a strategy of training only those cost of 53,383 dollars per life saved. Using these assumptions, current CPR training strategy is not a cost

Path spectra derived from inversion of source and site spectra for earthquakes in Southern California

Science.gov (United States)

Klimasewski, A.; Sahakian, V. J.; Baltay, A.; Boatwright, J.; Fletcher, J. B.; Baker, L. M.

2017-12-01

A large source of epistemic uncertainty in Ground Motion Prediction Equations (GMPEs) is derived from the path term, currently represented as a simple geometric spreading and intrinsic attenuation term. Including additional physical relationships between the path properties and predicted ground motions would produce more accurate and precise, region-specific GMPEs by reclassifying some of the random, aleatory uncertainty as epistemic. This study focuses on regions of Southern California, using data from the Anza network and Southern California Seismic network to create a catalog of events magnitude 2.5 and larger from 1998 to 2016. The catalog encompasses regions of varying geology and therefore varying path and site attenuation. Within this catalog of events, we investigate several collections of event region-to-station pairs, each of which share similar origin locations and stations so that all events have similar paths. Compared with a simple regional GMPE, these paths consistently have high or low residuals. By working with events that have the same path, we can isolate source and site effects, and focus on the remaining residual as path effects. We decompose the recordings into source and site spectra for each unique event and site in our greater Southern California regional database using the inversion method of Andrews (1986). This model represents each natural log record spectra as the sum of its natural log event and site spectra, while constraining each record to a reference site or Brune source spectrum. We estimate a regional, path-specific anelastic attenuation (Q) and site attenuation (t*) from the inversion site spectra and corner frequency from the inversion event spectra. We then compute the residuals between the observed record data, and the inversion model prediction (event*site spectra). This residual is representative of path effects, likely anelastic attenuation along the path that varies from the regional median attenuation. We examine the

A low-cost colorimeter.

Science.gov (United States)

Jones, N B; Riley, C; Sheya, M S; Hosseinmardi, M M

1984-01-01

A need for a colorimeter with low capital and maintenance costs has been suggested for countries with foreign exchange problems and no local medical instrumentation industry. This paper puts forward a design for such a device based on a domestic light-bulb, photographic filters and photovoltaic cells. The principle of the design is the use of a balancing technique involving twin light paths for test solution and reference solution and an electronic bridge circuit. It is shown that proper selection of the components will allow the cost objectives to be met and also provide acceptable linearity, precision, accuracy and repeatability.

Hamiltonian path integrals

International Nuclear Information System (INIS)

Prokhorov, L.V.

1982-01-01

The properties of path integrals associated with the allowance for nonstandard terms reflecting the operator nature of the canonical variables are considered. Rules for treating such terms (''equivalence rules'') are formulated. Problems with a boundary, the behavior of path integrals under canonical transformations, and the problem of quantization of dynamical systems with constraints are considered in the framework of the method

Spreading paths in partially observed social networks

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

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

Spreading paths in partially observed social networks.

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

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

Location of an intermediate hub for port activities

Science.gov (United States)

Burciu, Ş.; Ştefănică, C.; Roşca, E.; Dragu, V.; Ruscă, F.

2015-11-01

An intermediate hub might increase the accessibility level of ports but also hinterland and so it can be considered more than a facility with a transhipment role. These hubs might lead to the development of other transport services and enhance their role in gathering and covering economic centres within hinterlands and also getting the part of logistic facility for the ports, with effects on port utilization and its connectivity to global economy. A new location for a hub terminal leads to reduced transport distances within hinterland, with decreased transport costs and external effects, so with gains in people's life quality. Because the production and distribution systems are relatively fixed on short and medium term and the location decisions are strategic and on long term, the logistic chains activities location models have to consider the uncertainties regarding the possible future situations. In most models, production costs are considered equal, the location problem reducing itself to a problem that aims to minimize the total transport costs, meaning the transport problem. The main objective of the paper is to locate a hub terminal that links the producers of cereals that are going to be exported by naval transportation with the Romanian fluvial-maritime ports (Galaţi, Brăila). GIS environment can be used to integrate and analyse a great amount of data and has the ability of using functions as location - allocation models necessary both to private and public sector, being able to determine the optimal location for services like factories, warehouses, logistic platforms and other public services.

Indoor Positioning with Radio Location Fingerprinting

DEFF Research Database (Denmark)

Kjærgaard, Mikkel Baun

. A promising indoor positioning technique is radio-based location ngerprinting, having the major advantage of exploiting already existing radio infrastructures, like IEEE 802.11 or GSM, which avoids extra deployment costs and eort. The research goal of this thesis is to address the limitations of current...... indoor location ngerprinting systems. In particular the aim is to advance location ngerprinting techniques for the challenges of handling heterogeneous clients, scalability to many clients, and interference between communication and positioning. The wireless clients used for location ngerprinting...... are heterogeneous even when only considering clients for the same technology. The heterogeneity is due to dierent radios, antennas, and rmwares causing measurements for location ngerprinting not to be directly comparable among clients. Heterogeneity is a challenge for location ngerprinting because it severely...

Software-based data path for raster-scanned multi-beam mask lithography

Science.gov (United States)

Rajagopalan, Archana; Agarwal, Ankita; Buck, Peter; Geller, Paul; Hamaker, H. Christopher; Rao, Nagswara

2016-10-01

According to the 2013 SEMATECH Mask Industry Survey,i roughly half of all photomasks are produced using laser mask pattern generator ("LMPG") lithography. LMPG lithography can be used for all layers at mature technology nodes, and for many non-critical and semi-critical masks at advanced nodes. The extensive use of multi-patterning at the 14-nm node significantly increases the number of critical mask layers, and the transition in wafer lithography from positive tone resist to negative tone resist at the 14-nm design node enables the switch from advanced binary masks back to attenuated phase shifting masks that require second level writes to remove unwanted chrome. LMPG lithography is typically used for second level writes due to its high productivity, absence of charging effects, and versatile non-actinic alignment capability. As multi-patterning use expands from double to triple patterning and beyond, the number of LMPG second level writes increases correspondingly. The desire to reserve the limited capacity of advanced electron beam writers for use when essential is another factor driving the demand for LMPG capacity. The increasing demand for cost-effective productivity has kept most of the laser mask writers ever manufactured running in production, sometimes long past their projected lifespan, and new writers continue to be built based on hardware developed some years ago.ii The data path is a case in point. While state-ofthe- art when first introduced, hardware-based data path systems are difficult to modify or add new features to meet the changing requirements of the market. As data volumes increase, design styles change, and new uses are found for laser writers, it is useful to consider a replacement for this critical subsystem. The availability of low-cost, high-performance, distributed computer systems combined with highly scalable EDA software lends itself well to creating an advanced data path system. EDA software, in routine production today, scales

Symbolic PathFinder v7

DEFF Research Database (Denmark)

Luckow, Kasper Søe; Păsăreanu, Corina

2014-01-01

We describe Symbolic PathFinder v7 in terms of its updated design addressing the changes of Java PathFinder v7 and of its new optimization when computing path conditions. Furthermore, we describe the Symbolic Execution Tree Extension; a newly added feature that allows for outputting the symbolic...... execution tree that characterizes the execution paths covered during symbolic execution. The new extension can be tailored to the needs of subsequent analyses/processing facilities, and we demonstrate this by presenting SPF-Visualizer, which is a tool for customizable visualization of the symbolic execution...

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-01-01

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-03-18

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shaobo Wu

2018-03-01

Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

The effect of handover location on trauma theatre start time: An estimated cost saving of £131 000 per year.

Science.gov (United States)

Nahas, Sam; Ali, Adam; Majid, Kiran; Joseph, Roshan; Huber, Chris; Babu, Victor

2018-02-08

The National Health Service was estimated to be in £2.45 billion deficit in 2015 to 2016. Trauma theatre utilization and efficiency has never been so important as it is estimated to cost £15/minute. Structured questionnaires were given to 23 members of staff at our Trust who are actively involved in the organization or delivery of orthopaedic trauma lists at least once per week. This was used to identify key factors that may improve theatre efficiency. Following focus group evaluation, the location of the preoperative theatre meeting was changed, with all staff involved being required to attend this. Our primary outcome measure was mean theatre start time (time of arrival in the anaesthetic room) during the 1 month immediately preceding the change and the month following the change. Theatre start time was improved on average 24 minutes (1 month premeeting and postmeeting change). This equates to a saving of £360 per day, or £131 040 per year. Changing the trauma meeting location to a venue adjacent to the trauma theatre can improve theatre start times, theatre efficiency, and therefore result in significant cost savings. Copyright © 2018 John Wiley & Sons, Ltd.

Approximation Algorithm for a Heterogeneous Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Jungyun Bae

2015-08-01

Full Text Available This article addresses a fundamental path planning problem which aims to route a collection of heterogeneous vehicles such that each target location is visited by some vehicle and the sum of the travel costs of the vehicles is minimal. Vehicles are heterogeneous as the cost of traveling between any two locations depends on the type of the vehicle. Algorithms are developed for this path planning problem with bounds on the quality of the solutions produced by the algorithms. Computational results show that high quality solutions can be obtained for the path planning problem involving four vehicles and 40 targets using the proposed approach.

Exploring chemical reaction mechanisms through harmonic Fourier beads path optimization.

Science.gov (United States)

Khavrutskii, Ilja V; Smith, Jason B; Wallqvist, Anders

2013-10-28

Here, we apply the harmonic Fourier beads (HFB) path optimization method to study chemical reactions involving covalent bond breaking and forming on quantum mechanical (QM) and hybrid QM∕molecular mechanical (QM∕MM) potential energy surfaces. To improve efficiency of the path optimization on such computationally demanding potentials, we combined HFB with conjugate gradient (CG) optimization. The combined CG-HFB method was used to study two biologically relevant reactions, namely, L- to D-alanine amino acid inversion and alcohol acylation by amides. The optimized paths revealed several unexpected reaction steps in the gas phase. For example, on the B3LYP∕6-31G(d,p) potential, we found that alanine inversion proceeded via previously unknown intermediates, 2-iminopropane-1,1-diol and 3-amino-3-methyloxiran-2-ol. The CG-HFB method accurately located transition states, aiding in the interpretation of complex reaction mechanisms. Thus, on the B3LYP∕6-31G(d,p) potential, the gas phase activation barriers for the inversion and acylation reactions were 50.5 and 39.9 kcal∕mol, respectively. These barriers determine the spontaneous loss of amino acid chirality and cleavage of peptide bonds in proteins. We conclude that the combined CG-HFB method further advances QM and QM∕MM studies of reaction mechanisms.

MEASURING PATH DEPENDENCY

Directory of Open Access Journals (Sweden)

Peter Juhasz

2017-03-01

Full Text Available While risk management gained popularity during the last decades even some of the basic risk types are still far out of focus. One of these is path dependency that refers to the uncertainty of how we reach a certain level of total performance over time. While decision makers are careful in accessing how their position will look like the end of certain periods, little attention is given how they will get there through the period. The uncertainty of how a process will develop across a shorter period of time is often “eliminated” by simply choosing a longer planning time interval, what makes path dependency is one of the most often overlooked business risk types. After reviewing the origin of the problem we propose and compare seven risk measures to access path. Traditional risk measures like standard deviation of sub period cash flows fail to capture this risk type. We conclude that in most cases considering the distribution of the expected cash flow effect caused by the path dependency may offer the best method, but we may need to use several measures at the same time to include all the optimisation limits of the given firm

Developing and Validating Path-Dependent Uncertainty Estimates for use with the Regional Seismic Travel Time (RSTT) Model

Science.gov (United States)

Begnaud, M. L.; Anderson, D. N.; Phillips, W. S.; Myers, S. C.; Ballard, S.

2016-12-01

The Regional Seismic Travel Time (RSTT) tomography model has been developed to improve travel time predictions for regional phases (Pn, Sn, Pg, Lg) in order to increase seismic location accuracy, especially for explosion monitoring. The RSTT model is specifically designed to exploit regional phases for location, especially when combined with teleseismic arrivals. The latest RSTT model (version 201404um) has been released (http://www.sandia.gov/rstt). Travel time uncertainty estimates for RSTT are determined using one-dimensional (1D), distance-dependent error models, that have the benefit of being very fast to use in standard location algorithms, but do not account for path-dependent variations in error, and structural inadequacy of the RSTTT model (e.g., model error). Although global in extent, the RSTT tomography model is only defined in areas where data exist. A simple 1D error model does not accurately model areas where RSTT has not been calibrated. We are developing and validating a new error model for RSTT phase arrivals by mathematically deriving this multivariate model directly from a unified model of RSTT embedded into a statistical random effects model that captures distance, path and model error effects. An initial method developed is a two-dimensional path-distributed method using residuals. The goals for any RSTT uncertainty method are for it to be both readily useful for the standard RSTT user as well as improve travel time uncertainty estimates for location. We have successfully tested using the new error model for Pn phases and will demonstrate the method and validation of the error model for Sn, Pg, and Lg phases.

Path integration in conical space

International Nuclear Information System (INIS)

Inomata, Akira; Junker, Georg

2012-01-01

Quantum mechanics in conical space is studied by the path integral method. It is shown that the curvature effect gives rise to an effective potential in the radial path integral. It is further shown that the radial path integral in conical space can be reduced to a form identical with that in flat space when the discrete angular momentum of each partial wave is replaced by a specific non-integral angular momentum. The effective potential is found proportional to the squared mean curvature of the conical surface embedded in Euclidean space. The path integral calculation is compatible with the Schrödinger equation modified with the Gaussian and the mean curvature. -- Highlights: ► We study quantum mechanics on a cone by the path integral approach. ► The path integral depends only on the metric and the curvature effect is built in. ► The approach is consistent with the Schrödinger equation modified by an effective potential. ► The effective potential is found to be of the “Jensen–Koppe” and “da Costa” type.

Reflector construction by sound path curves - A method of manual reflector evaluation in the field

International Nuclear Information System (INIS)

Siciliano, F.; Heumuller, R.

1985-01-01

In order to describe the time-of-flight behavior of various reflectors we have set up models and derived from them analytical and graphic approaches to reflector reconstruction. In the course of this work, maximum achievable accuracy and possible simplifications were investigated. The aim of the time-of-flight reconstruction method is to determine the points of a reflector on the basis of a sound path function (sound path as the function of the probe index position). This method can only be used on materials which are isotropic in terms of sound velocity since the method relies on time of flight being converted into sound path. This paper deals only with two-dimensional reconstruction, in other words all statements relate to the plane of incidence. The method is based on the fact that the geometrical location of the points equidistant from a certain probe index position is a circle. If circles with radiuses equal to the associated sound path are drawn for various search unit positions the points of intersection of the circles are the desired reflector points

Interference factors regarding the path of insertion of rotational-path removable partial dentures.

Science.gov (United States)

Huang, Chan-Te; Liu, Fang-Chun; Luk, Kwing-Chi

2017-02-01

The aims of this study were to evaluate the effect of the location of the rotational center and the morphology of teeth resulting in interference with the rotational path of insertion and to estimate when an interference test should be performed. A total of 400 dental radiograms of maxillary and mandibular first and second molars (100 for each position) were selected. The radiograms were used to hand-sketch the outlines on tracing paper. Then, an interference test was simulated using calipers. Mesial long occlusal rest seats with three different lengths were designed. A curve-simulated rotational path was drawn on the tracing paper showing the outline of a molar. If the curve was intersected by the mesial outline, interference was occurred. A total of 1200 tests were performed. A significant number of interference cases (18.5%, N = 400) occurred when the rotational center was placed at the most distal margin of the occlusal surface. The interference was reduced (2.75%, N = 400) but still present at the distal fourth of the occlusal surface. At the distal one-third of the occlusal surface, interference did not occur (0%, N = 400). There was a significant difference between the results of the three rotational centers (p < 0.0001). The interference test was not required for a rotational center at the distal third to half of the occlusal surface. However, if the length of the long occlusal rest extends beyond the distal third, an interference test is recommended before final impression. Copyright © 2017 Chang Gung University. Published by Elsevier B.V. All rights reserved.

Two dimensional simplicial paths

International Nuclear Information System (INIS)

Piso, M.I.

1994-07-01

Paths on the R 3 real Euclidean manifold are defined as 2-dimensional simplicial strips which are orbits of the action of a discrete one-parameter group. It is proven that there exists at least one embedding of R 3 in the free Z-module generated by S 2 (x 0 ). The speed is defined as the simplicial derivative of the path. If mass is attached to the simplex, the free Lagrangian is proportional to the width of the path. In the continuum limit, the relativistic form of the Lagrangian is recovered. (author). 7 refs

Integrated assessment of energy efficiency technologies and CO_2 abatement cost curves in China’s road passenger car sector

International Nuclear Information System (INIS)

Peng, Bin-Bin; Fan, Ying; Xu, Jin-Hua

2016-01-01

Highlights: • Energy efficiency technologies in Chinese passenger cars are classified in detail. • CO_2-reduction potential and abatement cost are analyzed for technology bundles. • Marginal abatement cost curve is established from both micro and macro perspectives. • Spark ignition, diesel and hybrid electric vehicle paths should be firstly promoted. • Technology promotion should start from the area of taxies and high-performance cars. - Abstract: Road transport is one of the main sources of energy consumption and CO_2 emissions. It is essential to conserve energy and reduce emissions by promoting energy efficiency technologies (EETs) in this sector. This study first identifies EETs for the passenger cars and then classifies them into various technology bundles. It then analyzes the CO_2-reduction potentials and emissions abatement costs of 55 type-path, 246 type-path-technology, and 465 type-path-subtechnology bundles from micro-vehicular and macro-industrial perspectives during 2010–2030, based on which marginal abatement cost (MAC) curve for China’s road passenger car sector is established. Results show that the cumulative CO_2-reduction potential of EETs on passenger cars in China during 2010–2030 is about 2698.8 Mt, but only 4% is cost-effective. The EETs with low emissions abatement costs are mainly available in the spark ignition (SI), diesel, and hybrid electric vehicle (HEV) paths on the taxis and high-performance cars, and also in the transmission, vehicle body and SI technologies on the private cars, which could be promoted at present. The technologies with large emissions reduction potential are mainly available in the plug-in hybrid electric vehicle (PHEV) and electric vehicle (EV) paths, which would be the main channels for reducing carbon emissions in the long run.

A study of critical paths for feasibility studies of mining projects

International Nuclear Information System (INIS)

Sayadi, R.

2002-01-01

This work develops a model for design and realisation of profitability's and feasibility studies of a mining project. The model provides the structure of various necessary procedures to establish the feasibility studies and presents a logical system of task sequencing and information circulating between tasks. The specifications of mining projects, particularly their duration, complexity and high costs, necessitate design and realisation of feasibility study bases on the sufficient understanding of task behaviour and the critical path method view. For this purpose, critical paths with the highest frequency of occurrence were studied through several simulations. In addition, the critical tasks and sub tasks with the most probability were identified. The model introduced in this paper can serve as a perfect tool in feasibility study of a mining project. It can also be used as a basis of future development of mining software

Effectiveness of light paths coupled with personal emergency response systems in preventing functional decline among the elderly

Directory of Open Access Journals (Sweden)

Florent Lachal

2016-08-01

Full Text Available Introduction: The elderly population is at high risk of functional decline, which will induce significant costs due to long-term care. Dependency could be delayed by preventing one of its major determinants: falls. Light paths coupled with personal emergency response systems could prevent the functional decline through fall prevention. Methods: This study aimed to evaluate the effectiveness of light paths coupled with personal emergency response systems on the functional decline in an elderly population living at home. It is a secondary analysis on data from a previous cohort. In all, 190 older adults (aged 65 years or more living at home participated. Participants in the exposed group were equipped with home-based technologies: light paths coupled with personal emergency response systems. The participants’ functional status was assessed using the Functional Autonomy Measurement System scale at baseline (T0 and at the end of the study (T12-month. Baseline characteristics were evaluated by a comprehensive geriatric assessment. Results: After 1 year, 43% of the unexposed group had functional decline versus 16% of the exposed group. Light paths coupled with personal emergency response systems were significantly associated with a decrease in the functional decline (Δ Functional Autonomy Measurement System ⩾ 5 at home (odds ratio = 0.24, 95% confidence interval (0.11–0.54, p = 0.002. Discussion: This study suggests that light paths coupled with personal emergency response systems prevent the functional decline over 12 months. This result may encourage the prescription and use of home-based technologies to postpone dependency and institutionalization, but they need a larger cost-effectiveness study to demonstrate the efficiency of these technologies.

DESIGN OF A REAL TIME REMOTE VEHICLE LOCATION SYSTEM

Directory of Open Access Journals (Sweden)

Ahmet Emir DİRİK

2004-02-01

Full Text Available In this study, a low-cost, real-time vehicle location system is developed. The vehicle location system includes three main modules, i.e. positioning, wireless communication and digital map modules. The positioning module used in location systems computes position of the mobile vehicle. These vehicle location data are transmitted through a wireless communication system to host. The host has a capability to monitor a fleet of vehicles by analyzing data collected from wireless communication system. In this project, mobile vehicle location positions can be computed in a range of 10m position error and by using these position data, its possible to monitor the fleet of mobile vehicles on a digital map in the observation and control center. In this study, vehicle analog mobile radios are used to establish wireless communication system. Thus, there is no need to use satellite or GSM systems for communication and a low-cost and high-performance vehicle location system is realized.

The role of spatial memory and frames of reference in the precision of angular path integration.

Science.gov (United States)

Arthur, Joeanna C; Philbeck, John W; Kleene, Nicholas J; Chichka, David

2012-09-01

Angular path integration refers to the ability to maintain an estimate of self-location after a rotational displacement by integrating internally-generated (idiothetic) self-motion signals over time. Previous work has found that non-sensory inputs, namely spatial memory, can play a powerful role in angular path integration (Arthur et al., 2007, 2009). Here we investigated the conditions under which spatial memory facilitates angular path integration. We hypothesized that the benefit of spatial memory is particularly likely in spatial updating tasks in which one's self-location estimate is referenced to external space. To test this idea, we administered passive, non-visual body rotations (ranging 40°-140°) about the yaw axis and asked participants to use verbal reports or open-loop manual pointing to indicate the magnitude of the rotation. Prior to some trials, previews of the surrounding environment were given. We found that when participants adopted an egocentric frame of reference, the previously-observed benefit of previews on within-subject response precision was not manifested, regardless of whether remembered spatial frameworks were derived from vision or spatial language. We conclude that the powerful effect of spatial memory is dependent on one's frame of reference during self-motion updating. Copyright © 2012 Elsevier B.V. All rights reserved.

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

Directory of Open Access Journals (Sweden)

Yueyue Deng

2013-01-01

Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.

Time optimal paths for high speed maneuvering

Energy Technology Data Exchange (ETDEWEB)

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.

A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

Directory of Open Access Journals (Sweden)

A. A. Heidari

2016-06-01

Full Text Available 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.

Cooperative organic mine avoidance path planning

Science.gov (United States)

McCubbin, Christopher B.; Piatko, Christine D.; Peterson, Adam V.; Donnald, Creighton R.; Cohen, David

2005-06-01

The JHU/APL Path Planning team has developed path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Extending on previous years' efforts, we investigated real-world Naval mine avoidance requirements and developed a tactical decision aid (TDA) that satisfies those requirements. APL has developed new mine path planning techniques using graph based and genetic algorithms which quickly produce near-minimum risk paths for complicated fitness functions incorporating risk, path length, ship kinematics, and naval doctrine. The TDA user interface, a Java Swing application that obtains data via Corba interfaces to path planning databases, allows the operator to explore a fusion of historic and in situ mine field data, control the path planner, and display the planning results. To provide a context for the minefield data, the user interface also renders data from the Digital Nautical Chart database, a database created by the National Geospatial-Intelligence Agency containing charts of the world's ports and coastal regions. This TDA has been developed in conjunction with the COMID (Cooperative Organic Mine Defense) system. This paper presents a description of the algorithms, architecture, and application produced.

Quick start users guide for the PATH/AWARE decision support system.

Energy Technology Data Exchange (ETDEWEB)

Knowlton, Robert G.; Melton, Brad J; Einfeld, Wayne; Tucker, Mark D; Franco, David Oliver; Yang, Lynn I.

2013-06-01

The Prioritization Analysis Tool for All-Hazards/Analyzer for Wide Area Restoration Effectiveness (PATH/AWARE) software system, developed by Sandia National Laboratories, is a comprehensive decision support tool designed to analyze situational awareness, as well as response and recovery actions, following a wide-area release of chemical, biological or radiological materials. The system provides capability to prioritize critical infrastructure assets and services for restoration. It also provides a capability to assess resource needs (e.g., number of sampling teams, laboratory capacity, decontamination units, etc.), timelines for consequence management activities, and costs. PATH/AWARE is a very comprehensive tool set with a considerable amount of database information managed through a Microsoft SQL (Structured Query Language) database engine, a Geographical Information System (GIS) engine that provides comprehensive mapping capabilities, as well as comprehensive decision logic to carry out the functional aspects of the tool set. This document covers the basic installation and operation of the PATH/AWARE tool in order to give the user enough information to start using the tool. A companion users manual is under development with greater specificity of the PATH/AWARE functionality.

A Dual-Based Procedure for Dynamic Facility Location

OpenAIRE

Tony J. Van Roy; Donald Erlenkotter

1982-01-01

In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location problem as a combinatorial optimization problem. The formulation permits both the opening of new facilities and the closing of existing ones. A branch-and-bound procedure incorporating a dual ascent me...

Localization Decisions of Entrepreneurs: The Role of Path Dependency and Market Forces

Science.gov (United States)

Pylak, Korneliusz; Majerek, Dariusz

2017-10-01

The purpose of this research is to determine the role of path dependency and market forces in the localization decisions of entrepreneurs from different industries. We hypothesize that most industries develop new entities based on the number of companies from the same industry that already exist in a region. We also hypothesize that entrepreneurs create new entities based on related industries operating within the same knowledge pool. To test these hypotheses, we used the machine learning decision tree method. The input variables are the number of companies from 86 industries located in 2,531 communities in Poland in 2009. The target values are the number of new companies from these industries created in the years 2009-2015. The principal results show that localization decisions are mostly based on demand and supply industries, in which manufacturing industries play crucial role. Path dependency appears in less than half of the industries’ models and thus is not the main factor influencing decisions regarding the creation of new companies. The highest share of path-dependent industries is in manufacturing sector, but the degree of the dependence is lower than in the service sector. The service sector seems to be the least path-dependent, as services usually serve other industries. Competition in industries is a rare factor in new company creation; however, if it appears, it usually shrinks the industry.

Infrastructure Development: Public Private Partnership Path for Developing Rural Telecommunications in Africa

Directory of Open Access Journals (Sweden)

Idongesit William Williams

2012-06-01

Full Text Available It is the quest of every government to achieve universal Access and service of telecommunication services and ICTs. Unfortunately due to the high cost of deploying infrastructure in rural areas of developing countries due to non-significant or no economic activity, this dream of achieving Universal access and service of telecommunications/ICTs have been stalled. This paper throws light on a possible Public Private Partnership framework as a development path that will enable affordable network technologies to be deployed in rural areas at a cost that will translate to what the rural dweller in a developing country in Africa can afford. The paper is a conceptual paper

Formal language constrained path problems

Energy Technology Data Exchange (ETDEWEB)

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

Tornado hazard model with the variation effects of tornado intensity along the path length

International Nuclear Information System (INIS)

Hirakuchi, Hiromaru; Nohara, Daisuke; Sugimoto, Soichiro; Eguchi, Yuzuru; Hattori, Yasuo

2015-01-01

Most of Japanese tornados have been reported near the coast line, where all of Japanese nuclear power plants are located. It is necessary for Japanese electric power companies to assess tornado risks on the plants according to a new regulation in 2013. The new regulatory guide exemplifies a tornado hazard model, which cannot consider the variation of tornado intensity along the path length and consequently produces conservative risk estimates. The guide also recommends the long narrow strip area along the coast line with the width of 5-10 km as a region of interest, although the model tends to estimate inadequate wind speeds due to the limit of application. The purpose of this study is to propose a new tornado hazard model which can be apply to the long narrow strip area. The new model can also consider the variation of tornado intensity along the path length and across the path width. (author)

Intermediate-level crossings of a first-passage path

International Nuclear Information System (INIS)

Bhat, Uttam; Redner, S

2015-01-01

We investigate some simple and surprising properties of a one-dimensional Brownian trajectory with diffusion coefficient D that starts at the origin and: (i) is at X at time T, or (ii) first reaches X at time T. We determine the most likely location of the first-passage trajectory from (0, 0) to (X, T) and its distribution at any intermediate time t < T. A first-passage path typically starts out by being repelled from its final location when X 2 /DT ≪ 1. We also determine the distribution of times when the trajectory first crosses and last crosses an arbitrary intermediate position x < X. The distribution of first-crossing times may be unimodal or bimodal, depending on whether X 2 /DT ≪ 1 or X 2 /DT ≫ 1. The form of the first-crossing probability in the bimodal regime is qualitatively similar to, but more singular than, the well-known arcsine law. (paper)

On the structure of path-like trees

OpenAIRE

Muntaner Batle, Francesc Antoni; Rius Font, Miquel

2007-01-01

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

On the Design of Energy-Efficient Location Tracking Mechanism in Location-Aware Computing

Directory of Open Access Journals (Sweden)

MoonBae Song

2005-01-01

Full Text Available The battery, in contrast to other hardware, is not governed by Moore's Law. In location-aware computing, power is a very limited resource. As a consequence, recently, a number of promising techniques in various layers have been proposed to reduce the energy consumption. The paper considers the problem of minimizing the energy used to track the location of mobile user over a wireless link in mobile computing. Energy-efficient location update protocol can be done by reducing the number of location update messages as possible and switching off as long as possible. This can be achieved by the concept of mobility-awareness we propose. For this purpose, this paper proposes a novel mobility model, called state-based mobility model (SMM to provide more generalized framework for both describing the mobility and updating location information of complexly moving objects. We also introduce the state-based location update protocol (SLUP based on this mobility model. An extensive experiment on various synthetic datasets shows that the proposed method improves the energy efficiency by 2 ∼ 3 times with the additional 10% of imprecision cost.

Mixed time slicing in path integral simulations

International Nuclear Information System (INIS)

Steele, Ryan P.; Zwickl, Jill; Shushkov, Philip; Tully, John C.

2011-01-01

A simple and efficient scheme is presented for using different time slices for different degrees of freedom in path integral calculations. This method bridges the gap between full quantization and the standard mixed quantum-classical (MQC) scheme and, therefore, still provides quantum mechanical effects in the less-quantized variables. Underlying the algorithm is the notion that time slices (beads) may be 'collapsed' in a manner that preserves quantization in the less quantum mechanical degrees of freedom. The method is shown to be analogous to multiple-time step integration techniques in classical molecular dynamics. The algorithm and its associated error are demonstrated on model systems containing coupled high- and low-frequency modes; results indicate that convergence of quantum mechanical observables can be achieved with disparate bead numbers in the different modes. Cost estimates indicate that this procedure, much like the MQC method, is most efficient for only a relatively few quantum mechanical degrees of freedom, such as proton transfer. In this regime, however, the cost of a fully quantum mechanical simulation is determined by the quantization of the least quantum mechanical degrees of freedom.

Introduction to Mobile Trajectory Based Services: A New Direction in Mobile Location Based Services

Science.gov (United States)

Khokhar, Sarfraz; Nilsson, Arne A.

The mandate of E911 gave birth to the idea of Location Based Services (LBS) capitalizing on the knowledge of the mobile location. The underlying estimated location is a feasible area. There is yet another class of mobile services that could be based on the mobility profiling of a mobile user. The mobility profile of a mobile user is a set of the routine trajectories of his or her travel paths. We called such services as Mobile Trajectory Based Services (MTBS). This paper introduces MTBS and functional architecture of an MTBS system. Suitability of different location estimation technologies for MTBS has been discussed and supported with simulation results.

Controlling the optical path length in turbid media using differential path-length spectroscopy: fiber diameter dependence

NARCIS (Netherlands)

Kaspers, O. P.; Sterenborg, H. J. C. M.; Amelink, A.

2008-01-01

We have characterized the path length for the differential path-length spectroscopy (DPS) fiber optic geometry for a wide range of optical properties and for fiber diameters ranging from 200 mu m to 1000 mu m. Phantom measurements show that the path length is nearly constant for scattering

RFID Location Algorithm

Directory of Open Access Journals (Sweden)

Wang Zi Min

2016-01-01

Full Text Available With the development of social services, people’s living standards improve further requirements, there is an urgent need for a way to adapt to the complex situation of the new positioning technology. In recent years, RFID technology have a wide range of applications in all aspects of life and production, such as logistics tracking, car alarm, security and other items. The use of RFID technology to locate, it is a new direction in the eyes of the various research institutions and scholars. RFID positioning technology system stability, the error is small and low-cost advantages of its location algorithm is the focus of this study.This article analyzes the layers of RFID technology targeting methods and algorithms. First, RFID common several basic methods are introduced; Secondly, higher accuracy to political network location method; Finally, LANDMARC algorithm will be described. Through this it can be seen that advanced and efficient algorithms play an important role in increasing RFID positioning accuracy aspects.Finally, the algorithm of RFID location technology are summarized, pointing out the deficiencies in the algorithm, and put forward a follow-up study of the requirements, the vision of a better future RFID positioning technology.

Evolutionary paths of Old French reciprocal markers. New and old methodological tools

Directory of Open Access Journals (Sweden)

Mikołaj Nkollo

2012-01-01

Full Text Available The present paper revolves around unusual paths of grammaticalization of Old French (12th century reciprocal markers. This methodological framework requires medieval means of expressing reciprocity to be compared both with their parent forms in Classical Latin and with the markers introduced in subsequent stages of the history of French language. The first hypothesis deals with how parallel markers, i.e. ones that have a common origin and that are used inside the same area of grammar (se… entre- and entre eux < Lat. inter se, are different from each other. This path is claimed to materialize provided one of the two terms begins to serve a particular function not performed by the other one. The second hypothesis accounts for what means were used to prevent ongoing reflexive / reciprocal homonymy. This task happened to be provisionally fulfilled by cors a cors and coste a coste until the advent of adverbs ending in -ment in 14th century. As a consequence, body-part nouns lost most of their grammatical potential. The third hypothesis, formulated in terms of exaptation, explains how and why languages are likely to recycle erstwhile peripheral lexical elements. This evolutionary path takes place in response to a need to convey a given meaning unambiguously. Attempts at avoiding reflexive / reciprocal homonymy prompted the revival of seemingly forgotten Latin items reciprocus / mutuus. Concluding remarks address the problem of whether the concept of exaptation is useful in historical linguistics and contain a proposal towards constraining its scope. As for current views of grammaticalization, this notion seems to call for further refinements, as well.

Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach

Directory of Open Access Journals (Sweden)

Hyunseung Choo

2009-03-01

Full Text Available Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs. They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR that efficiently forwards (or relays data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.

Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach.

Science.gov (United States)

Jeon, Hyeonjae; Park, Kwangjin; Hwang, Dae-Joon; Choo, Hyunseung

2009-01-01

Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs). They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS) approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA) system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR) that efficiently forwards (or relays) data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.

Service Locator - Family Planning Title X

Data.gov (United States)

U.S. Department of Health & Human Services — This locator tool will help you find Title X family planning centers that provide high quality and cost-effective family planning and related preventive health...

Multi-path transportation futures study : vehicle characterization and scenario analyses.

Energy Technology Data Exchange (ETDEWEB)

Plotkin, S. E.; Singh, M. K.; Energy Systems; TA Engineering; ORNL

2009-12-03

Projecting the future role of advanced drivetrains and fuels in the light vehicle market is inherently difficult, given the uncertainty (and likely volatility) of future oil prices, inadequate understanding of likely consumer response to new technologies, the relative infancy of several important new technologies with inevitable future changes in their performance and costs, and the importance - and uncertainty - of future government marketplace interventions (e.g., new regulatory standards or vehicle purchase incentives). This Multi-Path Transportation Futures (MP) Study has attempted to improve our understanding of this future role by examining several scenarios of vehicle costs, fuel prices, government subsidies, and other key factors. These are projections, not forecasts, in that they try to answer a series of 'what if' questions without assigning probabilities to most of the basic assumptions.

Critical path analysis in early stage of nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2009-01-01

The technical program and contract model as well as project management system and preliminary design defined in the early stage of nuclear power project are the key condition impact on the quality, schedule and cost of the nuclear power project. This paper, taking the CPR1000 coastal nuclear power station as an example, analyzes the critical path in the early stage of nuclear power project for five fields, i.e. licensing, design and procurement, site preparation, tender of construction contracts and construction preparation, and organization. (authors)

A unified model of heading and path perception in primate MSTd.

Directory of Open Access Journals (Sweden)

Oliver W Layton

2014-02-01

Full Text Available Self-motion, steering, and obstacle avoidance during navigation in the real world require humans to travel along curved paths. Many perceptual models have been proposed that focus on heading, which specifies the direction of travel along straight paths, but not on path curvature, which humans accurately perceive and is critical to everyday locomotion. In primates, including humans, dorsal medial superior temporal area (MSTd has been implicated in heading perception. However, the majority of MSTd neurons respond optimally to spiral patterns, rather than to the radial expansion patterns associated with heading. No existing theory of curved path perception explains the neural mechanisms by which humans accurately assess path and no functional role for spiral-tuned cells has yet been proposed. Here we present a computational model that demonstrates how the continuum of observed cells (radial to circular in MSTd can simultaneously code curvature and heading across the neural population. Curvature is encoded through the spirality of the most active cell, and heading is encoded through the visuotopic location of the center of the most active cell's receptive field. Model curvature and heading errors fit those made by humans. Our model challenges the view that the function of MSTd is heading estimation, based on our analysis we claim that it is primarily concerned with trajectory estimation and the simultaneous representation of both curvature and heading. In our model, temporal dynamics afford time-history in the neural representation of optic flow, which may modulate its structure. This has far-reaching implications for the interpretation of studies that assume that optic flow is, and should be, represented as an instantaneous vector field. Our results suggest that spiral motion patterns that emerge in spatio-temporal optic flow are essential for guiding self-motion along complex trajectories, and that cells in MSTd are specifically tuned to extract

A Unified Model of Heading and Path Perception in Primate MSTd

Science.gov (United States)

Layton, Oliver W.; Browning, N. Andrew

2014-01-01

Self-motion, steering, and obstacle avoidance during navigation in the real world require humans to travel along curved paths. Many perceptual models have been proposed that focus on heading, which specifies the direction of travel along straight paths, but not on path curvature, which humans accurately perceive and is critical to everyday locomotion. In primates, including humans, dorsal medial superior temporal area (MSTd) has been implicated in heading perception. However, the majority of MSTd neurons respond optimally to spiral patterns, rather than to the radial expansion patterns associated with heading. No existing theory of curved path perception explains the neural mechanisms by which humans accurately assess path and no functional role for spiral-tuned cells has yet been proposed. Here we present a computational model that demonstrates how the continuum of observed cells (radial to circular) in MSTd can simultaneously code curvature and heading across the neural population. Curvature is encoded through the spirality of the most active cell, and heading is encoded through the visuotopic location of the center of the most active cell's receptive field. Model curvature and heading errors fit those made by humans. Our model challenges the view that the function of MSTd is heading estimation, based on our analysis we claim that it is primarily concerned with trajectory estimation and the simultaneous representation of both curvature and heading. In our model, temporal dynamics afford time-history in the neural representation of optic flow, which may modulate its structure. This has far-reaching implications for the interpretation of studies that assume that optic flow is, and should be, represented as an instantaneous vector field. Our results suggest that spiral motion patterns that emerge in spatio-temporal optic flow are essential for guiding self-motion along complex trajectories, and that cells in MSTd are specifically tuned to extract complex trajectory

Storage and Management of Open-pit Transportation Path

Directory of Open Access Journals (Sweden)

Jiusheng Du

2013-07-01

Full Text Available This paper is aiming at the actual demand of open-pit mine daily production scheduling and positioning monitoring. After extracting data from existing topographic maps and other information, it discusses the feasibility of using this data to establish thematic database. By considering the extensive application of GPS data, utilizing new spatial data types of SQL Server 2008 for data storage and management. Extracting data algorithms such as the node spatial data, the regional boundary and the path are implemented, then spatial data storage and management is also realized. It provides the basis for the production of decision-making and production cost savings.

Panning for Gold: The personal journey of mental health wellness and its relationships with Planning Alternatives Tomorrows with Hope (PATH

Directory of Open Access Journals (Sweden)

Matthew Lyndon Armstrong

2015-12-01

Full Text Available This study explored how the Planning Alternatives Tomorrows with Hope (PATH process could enhance and strengthen an individual’s personal journey of recovery. This article utilised the knowledge base of members of a Community of Practice, located in Brisbane Australia. Members had a deep concern and passion to promote and strengthen wellbeing for people who live with the experience of mental ill health. They were invited to form a focus group to explore the use of PATH and its relationship with mental health wellness. After contemplating and reflecting on an example of the PATH process, the focus group explored opportunities for PATH to become one of many wellness resources for people experiencing and overcoming mental ill health. Through the exploration of personal meaning, storytelling and community connection (anchored in the visuals and graphics of the PATH example, the study found that PATH can make a valuable contribution by restoring some of the power inbalances in traditonal service frameworks and enhancing personal self direction. Keywords: mental health distress, practitioners, recovery, facilitation, creativity, planning

Re-evaluation of P-T paths across the Himalayan Main Central Thrust

Science.gov (United States)

Catlos, E. J.; Harrison, M.; Kelly, E. D.; Ashley, K.; Lovera, O. M.; Etzel, T.; Lizzadro-McPherson, D. J.

2016-12-01

The Main Central Thrust (MCT) is the dominant crustal thickening structure in the Himalayas, juxtaposing high-grade Greater Himalayan Crystalline rocks over the lower-grade Lesser Himalaya Formations. The fault is underlain by a 2 to 12-km-thick sequence of deformed rocks characterized by an apparent inverted metamorphic gradient, termed the MCT shear zone. Garnet-bearing rocks sampled from across the MCT along the Marysandi River in central Nepal contain monazite that decrease in age from Early Miocene (ca. 20 Ma) in the hanging wall to Late Miocene-Pliocene (ca. 7 Ma and 3 Ma) towards structurally lower levels in the shear zone. We obtained high-resolution garnet-zoning pressure-temperature (P-T) paths from 11 of the same rocks used for monazite geochronology using a recently-developed semi-automated Gibbs-free-energy-minimization technique. Quartz-in-garnet Raman barometry refined the locations of the paths. Diffusional re-equilibration of garnet zoning in hanging wall samples prevented accurate path determinations from most Greater Himalayan Crystalline samples, but one that shows a bell-shaped Mn zoning profile shows a slight decrease in P (from 8.2 to 7.6kbar) with increase in T (from 590 to 640ºC). Three MCT shear zone samples were modeled: one yields a simple path increasing in both P and T (6 to 7kbar, 540 to 580ºC); the others yield N-shaped paths that occupy similar P-T space (4 to 5.5 kbar, 500 to 560ºC). Five lower lesser Himalaya garnet-bearing rocks were modeled. One yields a path increasing in both P-T (6 to 7 kbar, 525 to 550ºC) but others show either sharp compression/decompression or N-shape paths (within 4.5-6 kbar and 530-580ºC). The lowermost sample decreases in P (5.5 to 5 kbar) over increasing T (540 to 580°C). No progressive change is seen from one type of path to another within the Lesser Himalayan Formations to the MCT zone. The results using the modeling approach yield lower P-T conditions compared to the Gibbs method and lower

Walking path-planning method for multiple radiation areas

International Nuclear Information System (INIS)

Liu, Yong-kuo; Li, Meng-kun; Peng, Min-jun; Xie, Chun-li; Yuan, Cheng-qian; Wang, Shuang-yu; Chao, Nan

2016-01-01

Highlights: • Radiation environment modeling method is designed. • Path-evaluating method and segmented path-planning method are proposed. • Path-planning simulation platform for radiation environment is built. • The method avoids to be misled by minimum dose path in single area. - Abstract: Based on minimum dose path-searching method, walking path-planning method for multiple radiation areas was designed to solve minimum dose path problem in single area and find minimum dose path in the whole space in this paper. Path-planning simulation platform was built using C# programming language and DirectX engine. The simulation platform was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method is effective in providing safety for people walking in nuclear facilities.

Optimal sensor locations for the backward Lagrangian stochastic technique in measuring lagoon gas emission

Science.gov (United States)

This study evaluated the impact of gas concentration and wind sensor locations on the accuracy of the backward Lagrangian stochastic inverse-dispersion technique (bLS) for measuring gas emission rates from a typical lagoon environment. Path-integrated concentrations (PICs) and 3-dimensional (3D) wi...

An Approach for Indoor Path Computation among Obstacles that Considers User Dimension

Directory of Open Access Journals (Sweden)

Liu Liu

2015-12-01

Full Text Available People often transport objects within indoor environments, who need enough space for the motion. In such cases, the accessibility of indoor spaces relies on the dimensions, which includes a person and her/his operated objects. This paper proposes a new approach to avoid obstacles and compute indoor paths with respect to the user dimension. The approach excludes inaccessible spaces for a user in five steps: (1 compute the minimum distance between obstacles and find the inaccessible gaps; (2 group obstacles according to the inaccessible gaps; (3 identify groups of obstacles that influence the path between two locations; (4 compute boundaries for the selected groups; and (5 build a network in the accessible area around the obstacles in the room. Compared to the Minkowski sum method for outlining inaccessible spaces, the proposed approach generates simpler polygons for groups of obstacles that do not contain inner rings. The creation of a navigation network becomes easier based on these simple polygons. By using this approach, we can create user- and task-specific networks in advance. Alternatively, the accessible path can be generated on the fly before the user enters a room.

On Pure and (approximate) Strong Equilibria of Facility Location Games

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Telelis, Orestis A.

2008-01-01

We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents using the same facility share fairly its installation cost, but every...... agent pays individually a (weighted) connection cost to the chosen location. We study the Price of Stability (PoS) of pure Nash equilibria and the Price of Anarchy of strong equilibria (SPoA), that generalize pure equilibria by being resilient to coalitional deviations. For unweighted agents on metric...

Cooperative path planning of unmanned aerial vehicles

CERN Document Server

Tsourdos, Antonios; Shanmugavel, Madhavan

2010-01-01

An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully. Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles. Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in...

Quantitative analytical hierarchy process to marketing store location selection

OpenAIRE

Harwati; Utami Intan

2018-01-01

The selection of Store to market the product is belong to Multi Criteria Decision Making problem. The criteria used have conflict of interest with each other to produce an optimal location. This research uses four important criteria to select new location of marketing store appropriate with the references: distance to location, competition level with competitor, number of potential customer, and location rent cost. Quantitative data is used to determine the optimum location with AHP method. Q...

On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games

DEFF Research Database (Denmark)

Thang, Nguyen Kim

2010-01-01

in an allowable location that minimizes the utilitarian social cost — the sum of agents costs. A mechanism is strategyproof (SP) if no agent may misreport its locations and be better off; it is group-strategyproof (GSP) if no coalition of agents benefits by jointly misreporting their locations The requirement...... for (G)SP in this setting makes optimum placement of the facility impossible and, therefore, we consider approximation (G)SP mechanisms. For SP mechanisms, we give a simple 3-approximation randomized mechanism and also provide asymptotic lower bounds for different variants. For GSP mechanisms, a (2N + 1......We characterize the performance of strategyproof and group-strategyproof social choice rules, for placing a facility on the nodes of a metric network inhabited by N autonomous self-interested agents. Every agent owns a set of locations and caters to minimization of its cost which is the total...

Energy consumption of ProTaper Next X1 after glide path with PathFiles and ProGlider.

Science.gov (United States)

Berutti, Elio; Alovisi, Mario; Pastorelli, Michele Angelo; Chiandussi, Giorgio; Scotti, Nicola; Pasqualini, Damiano

2014-12-01

Instrument failure caused by excessive torsional stress can be controlled by creating a manual or mechanical glide path. The ProGlider single-file system (Dentsply Maillefer, Ballaigues, Switzerland) was recently introduced to perform a mechanical glide path. This study was designed to compare the effect of a glide path performed with PathFiles (Dentsply Maillefer) and ProGlider on torque, time, and pecking motion required for ProTaper Next X1 (Dentsply Maillefer) to reach the full working length in simulated root canals. Forty Endo Training Blocks (Dentsply Maillefer) were used. Twenty were prepared with a mechanical glide path using PathFiles 1 and 2 (the PathFile group), and 20 were prepared with a mechanical glide path using a ProGlider single file (the ProGlider group). All samples were shaped with ProTaper Next X1 driven by an endodontic motor connected to a digital wattmeter. The required torque for root canal instrumentation was analyzed by evaluating the electrical power consumption of the endodontic engine. Electric power consumption (mW/h), elapsed time (seconds), and number of pecking motions required to reach the full working length with ProTaper Next X1 were calculated. Differences among groups were analyzed with the parametric Student t test for independent data (P < .05). Elapsed time and electric power consumption were significantly different between groups (P = .0001 for both). ProGlider appears to perform more efficiently than PathFiles in decreasing electric power consumption of ProTaper Next X1 to reach the full working length. This study confirmed the ability of ProGlider to reduce stress in ProTaper Next X1 during shaping through a glide path and preliminary middle and coronal preflaring. Copyright © 2014 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Strain path dependency in metal plasticity

NARCIS (Netherlands)

Viatkina, E.M.; Brekelmans, W.A.M.; Geers, M.G.D.

2003-01-01

A change in strain path has a significant effect on the mechanical response of metals. Strain path change effects physically originate from a complex microstructure evolution. This paper deals with the contribution of cell structure evolution to the strain path change effect. The material with cells

Study of a Country Level Facility LocationSelection for a Small Company

OpenAIRE

Eterovic, Mirko; Özgül, Simge

2012-01-01

Selection of an optimal facility location is a challenging decision for companies, since it would be costly and dicult to change the location after an installation has been already made. Existing numerical methods in the decision-making process help companies to perform their operations with minimum cost and maximum value based on their strategic objectives. Decision making process requires the selection of relative processes among several alternatives corresponding to a set of location facto...

Modeling the highway transportation of spent fuel

International Nuclear Information System (INIS)

Harrison, I.G.

1986-01-01

There will be a substantial increase in the number of spent fuel shipments on the nation's highway system in the next thirty years. Most of the spent fuel will be moving from reactors to a spent fuel repository. This study develops two models that evaluate the risk and cost of moving the spent fuel. The Minimum Total Transport Risk Model (MTTRM) seeks an efficient solution for this problem by finding the minimum risk path through the network and sending all the spent fuel shipments over this one path. The Equilibrium Transport Risk Model (ETRM) finds an equitable solution by distributing the shipments over a number of paths in the network. This model decreases the risk along individual paths, but increases society's risk because the spent fuel shipments are traveling over more links in the network. The study finds that there is a trade off between path risk and societal risk. As path risk declines, societal risk rises. The cost of shipping also increases as the number of paths expand. The cost and risk of shipping spent fuel from ten reactors to four potential repository sites are evaluated using the MTTRM. The temporary monitored retrievable storage (MRS) facility in Tennessee is found to be the minimum cost and minimum risk solution. When direct shipment to the permanent sites is considered, Deaf Smith, Texas is the least cost and least incident free transport risk location. Yucca Mountain, Nevada is the least risk location when the focus is placed on the potential consequences of an accident

Path-Goal Theory of Leadership

Science.gov (United States)

1975-04-01

Leadership and Turnover Among Managers ," Organization Behavior and Human Performance, 10(1973), pp. 184-200; R. J. House, "A Path-Goal Theory of...of Leadership ." 6R. J. House and G. Dessler, "Path-Goal Theory of Leadership " R. M. Stqg- dill. Managers , Employees, Organization (Ohio State...of Control." 23 R. J. House, "Notes on the Path-Goal Theory of Leadership " (University of Toronto, Faculty of Management Studies, May 1974). 24 R

Path integral in Snyder space

Energy Technology Data Exchange (ETDEWEB)

Mignemi, S., E-mail: smignemi@unica.it [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy); Štrajn, R. [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy)

2016-04-29

The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

Path integral in Snyder space

International Nuclear Information System (INIS)

Mignemi, S.; Štrajn, R.

2016-01-01

The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

A Mathematical Model for the Industrial Hazardous Waste Location-Routing Problem

Directory of Open Access Journals (Sweden)

Omid Boyer

2013-01-01

Full Text Available Technology progress is a cause of industrial hazardous wastes increasing in the whole world . Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixed integer programing model for location-routing industrial hazardous waste with two objectives is developed. First objective is total cost minimization including transportation cost, operation cost, initial investment cost, and cost saving from selling recycled waste. Second objective is minimization of transportation risk. Risk of population exposure within bandwidth along route is used to measure transportation risk. This model can help decision makers to locate treatment, recycling, and disposal centers simultaneously and also to route waste between these facilities considering risk and cost criteria. The results of the solved problem prove conflict between two objectives. Hence, it is possible to decrease the cost value by marginally increasing the transportation risk value and vice versa. A weighted sum method is utilized to combine two objectives function into one objective function. To solve the problem GAMS software with CPLEX solver is used. The problem is applied in Markazi province in Iran.

Evaluating Trajectory Queries over Imprecise Location Data

DEFF Research Database (Denmark)

Xie, Scott, Xike; Cheng, Reynold; Yiu, Man Lung

2012-01-01

Trajectory queries, which retrieve nearby objects for every point of a given route, can be used to identify alerts of potential threats along a vessel route, or monitor the adjacent rescuers to a travel path. However, the locations of these objects (e.g., threats, succours) may not be precisely...... obtained due to hardware limitations of measuring devices, as well as the constantly-changing nature of the external environment. Ignoring data uncertainty can render low query quality, and cause undesirable consequences such as missing alerts of threats and poor response time in rescue operations. Also......, the query is quite time-consuming, since all the points on the trajectory are considered. In this paper, we study how to efficiently evaluate trajectory queries over imprecise location data, by proposing a new concept called the u-bisector. In general, the u-bisector is an extension of bisector to handle...

Leavitt path algebras

CERN Document Server

Abrams, Gene; Siles Molina, Mercedes

2017-01-01

This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

Paths correlation matrix.

Science.gov (United States)

Qian, Weixian; Zhou, Xiaojun; Lu, Yingcheng; Xu, Jiang

2015-09-15

Both the Jones and Mueller matrices encounter difficulties when physically modeling mixed materials or rough surfaces due to the complexity of light-matter interactions. To address these issues, we derived a matrix called the paths correlation matrix (PCM), which is a probabilistic mixture of Jones matrices of every light propagation path. Because PCM is related to actual light propagation paths, it is well suited for physical modeling. Experiments were performed, and the reflection PCM of a mixture of polypropylene and graphite was measured. The PCM of the mixed sample was accurately decomposed into pure polypropylene's single reflection, pure graphite's single reflection, and depolarization caused by multiple reflections, which is consistent with the theoretical derivation. Reflection parameters of rough surface can be calculated from PCM decomposition, and the results fit well with the theoretical calculations provided by the Fresnel equations. These theoretical and experimental analyses verify that PCM is an efficient way to physically model light-matter interactions.

Techniques and applications of path integration

CERN Document Server

Schulman, L S

2005-01-01

A book of techniques and applications, this text defines the path integral and illustrates its uses by example. It is suitable for advanced undergraduates and graduate students in physics; its sole prerequisite is a first course in quantum mechanics. For applications requiring specialized knowledge, the author supplies background material.The first part of the book develops the techniques of path integration. Topics include probability amplitudes for paths and the correspondence limit for the path integral; vector potentials; the Ito integral and gauge transformations; free particle and quadra

Joint modeling of constrained path enumeration and path choice behavior: a semi-compensatory approach

DEFF Research Database (Denmark)

Kaplan, Sigal; Prato, Carlo Giacomo

2010-01-01

A behavioural and a modelling framework are proposed for representing route choice from a path set that satisfies travellers’ spatiotemporal constraints. Within the proposed framework, travellers’ master sets are constructed by path generation, consideration sets are delimited according to spatio...

Spatial connectivity in a highly heterogeneous aquifer: From cores to preferential flow paths

Science.gov (United States)

Bianchi, M.; Zheng, C.; Wilson, C.; Tick, G.R.; Liu, Gaisheng; Gorelick, S.M.

2011-01-01

This study investigates connectivity in a small portion of the extremely heterogeneous aquifer at the Macrodispersion Experiment (MADE) site in Columbus, Mississippi. A total of 19 fully penetrating soil cores were collected from a rectangular grid of 4 m by 4 m. Detailed grain size analysis was performed on 5 cm segments of each core, yielding 1740 hydraulic conductivity (K) estimates. Three different geostatistical simulation methods were used to generate 3-D conditional realizations of the K field for the sampled block. Particle tracking calculations showed that the fastest particles, as represented by the first 5% to arrive, converge along preferential flow paths and exit the model domain within preferred areas. These 5% fastest flow paths accounted for about 40% of the flow. The distribution of preferential flow paths and particle exit locations is clearly influenced by the occurrence of clusters formed by interconnected cells with K equal to or greater than the 0.9 decile of the data distribution (10% of the volume). The fraction of particle paths within the high-K clusters ranges from 43% to 69%. In variogram-based K fields, some of the fastest paths are through media with lower K values, suggesting that transport connectivity may not require fully connected zones of relatively homogenous K. The high degree of flow and transport connectivity was confirmed by the values of two groups of connectivity indicators. In particular, the ratio between effective and geometric mean K (on average, about 2) and the ratio between the average arrival time and the arrival time of the fastest particles (on average, about 9) are consistent with flow and advective transport behavior characterized by channeling along preferential flow paths. ?? 2011 by the American Geophysical Union.

Planning of optimal work path for minimizing exposure dose during radiation work in radwaste storage

International Nuclear Information System (INIS)

Kim, Yoon Hyuk; Park, Won Man; Kim, Kyung Soo; Whang, Joo Ho

2005-01-01

Since the safety of nuclear power plant has been becoming a big social issue, the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate dose not depend on the location within a work space, thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation during radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, the developed numerical method and simulation program could be useful tools in the planning of radiation work

Efficient Guiding Towards Cost-Optimality in Uppaal

DEFF Research Database (Denmark)

Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas S.

2001-01-01

with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra’s shortest path algorithm, we show that the search order of the algorithm can be chosen...

LOCATING LEAKS WITH ACOUSTIC TECHNOLOGY

Science.gov (United States)

Many water distribution systems in this country are almost 100 years old. About 26 percent of piping in these systems is made of unlined cast iron or steel and is in poor condition. Many methods that locate leaks in these pipes are time-consuming, costly, disruptive to operations...

Isomorphisms and traversability of directed path graphs

NARCIS (Netherlands)

Broersma, Haitze J.; Li, Xueliang; Li, X.

1998-01-01

The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

Sensitivity study of optimal CO2 emission paths using a simplified structural integrated assessment model (SIAM)

International Nuclear Information System (INIS)

Hasselmann, K.; Hasselmann, S.; Giering, R.; Ocana, V.; Storch, H. von

1997-01-01

A structurally highly simplified, globally integrated coupled climate-economic costs model SIAM (Structural Integrated Assessment Model) is used to compute optimal paths of global CO 2 emissions that minimize the net sum of climate damage and mitigation costs. It studies the sensitivity of the computed optimal emission paths. The climate module is represented by a linearized impulse-response model calibrated against a coupled ocean-atmosphere general circulation climate model and a three-dimensional global carbon-cycle model. The cost terms are presented by expressions designed with respect to input assumptions. These include the discount rates for mitigation and damage costs, the inertia of the socio-economic system, and the dependence of climate damages on the changes in temperature and the rate of change of temperature. Different assumptions regarding these parameters are believed to cause the marked divergences of existing cost-benefit analyses. The long memory of the climate system implies that very long time horizons of several hundred years need to be considered to optimize CO 2 emissions on time scales relevant for a policy of sustainable development. Cost-benefit analyses over shorter time scales of a century or two can lead to dangerous underestimates of the long term climate impact of increasing greenhouse-gas emissions. To avert a major long term global warming, CO 2 emissions need to be reduced ultimately to very low levels. This may be done slowly but should not be interpreted as providing a time cushion for inaction: the transition becomes more costly the longer the necessary mitigation policies are delayed. However, the long time horizon provides adequate flexibility for later adjustments. Short term energy conservation alone is insufficient and can be viewed only as a useful measure in support of the necessary long term transition to carbon-free energy technologies. 46 refs., 9 figs., 2 tabs

Environmental influences on fruit and vegetable intake: Results from a path analytic model

Science.gov (United States)

Liese, Angela D.; Bell, Bethany A.; Barnes, Timothy L.; Colabianchi, Natalie; Hibbert, James D.; Blake, Christine E.; Freedman, Darcy A.

2014-01-01

Objective Fruit and vegetable intake (F&V) is influenced by behavioral and environmental factors, but these have rarely been assessed simultaneously. We aimed to quantify the relative influence of supermarket availability, perceptions of the food environment, and shopping behavior on F&V intake. Design A cross-sectional study. Setting Eight-counties in South Carolina, USA, with verified locations of all supermarkets. Subjects A telephone survey of 831 household food shoppers ascertained F&V intake with a 17-item screener, primary food store location, shopping frequency, perceptions of healthy food availability, and calculated GIS-based supermarket availability. Path analysis was conducted. We report standardized beta coefficients on paths significant at the 0.05 level. Results Frequency of grocery shopping at primary food store (β=0.11) was the only factor exerting an independent, statistically significant direct effect on F&V intake. Supermarket availability was significantly associated with distance to food store (β=-0.24) and shopping frequency (β=0.10). Increased supermarket availability was significantly and positively related to perceived healthy food availability in the neighborhood (β=0.18) and ease of shopping access (β=0.09). Collectively considering all model paths linked to perceived availability of healthy foods, this measure was the only other factor to have a significant total effect on F&V intake. Conclusions While the majority of literature to date has suggested an independent and important role of supermarket availability for F&V intake, our study found only indirect effects of supermarket availability and suggests that food shopping frequency and perceptions of healthy food availability are two integral components of a network of influences on F&V intake. PMID:24192274

Is there any way out there? Environmental and cultural influences in computing least-cost paths with GIS

Directory of Open Access Journals (Sweden)

Fairén Jiménez, Sara

2004-12-01

Full Text Available One of the most interesting subjects in post-structural landscape studies is the analysis of the relationships between its natural and cultural components: the structuring of the landscape, with the identification of the social practices and patterns of movement that took part around them. These patterns depend both on the natural form of the terrain and on socio-cultural decisions. In relation to the settlement pattern and distribution of rock art sites in the central- Mediterranean coastal area of Spain, a method is proposed to evaluate the role of cultural aspects of landscape in computing least-cost paths.

Entre los recientes estudios dentro de la Arqueología del Paisaje, uno de los aspectos que presenta mayor potencial interpretativo es el análisis de la relación entre sus distintos componentes naturales y culturales: la articulación del paisaje – con la identificación de las prácticas sociales que se realizarían en torno a estos elementos y de las pautas de movimiento entre unos y otros. Este movimiento dependería tanto de las características naturales del terreno como de decisiones prácticas de carácter socio-cultural. A partir del estudio de la distribución del poblamiento y abrigos con arte rupestre neolíticos en las tierras centro-meridionales valencianas, se propone un sistema para la introducción y valoración del papel de los componentes culturales del paisaje en el cálculo de caminos óptimos mediante Sistemas de Información Geográfica.

Design and performance analysis of global path planning techniques for autonomous mobile robots in grid environments

Directory of Open Access Journals (Sweden)

Imen Chaari

2017-03-01

Full Text Available This article presents the results of the 2-year iroboapp research project that aims at devising path planning algorithms for large grid maps with much faster execution times while tolerating very small slacks with respect to the optimal path. We investigated both exact and heuristic methods. We contributed with the design, analysis, evaluation, implementation and experimentation of several algorithms for grid map path planning for both exact and heuristic methods. We also designed an innovative algorithm called relaxed A-star that has linear complexity with relaxed constraints, which provides near-optimal solutions with an extremely reduced execution time as compared to A-star. We evaluated the performance of the different algorithms and concluded that relaxed A-star is the best path planner as it provides a good trade-off among all the metrics, but we noticed that heuristic methods have good features that can be exploited to improve the solution of the relaxed exact method. This led us to design new hybrid algorithms that combine our relaxed A-star with heuristic methods which improve the solution quality of relaxed A-star at the cost of slightly higher execution time, while remaining much faster than A* for large-scale problems. Finally, we demonstrate how to integrate the relaxed A-star algorithm in the robot operating system as a global path planner and show that it outperforms its default path planner with an execution time 38% faster on average.

Column Number Density Expressions Through M = 0 and M = 1 Point Source Plumes Along Any Straight Path

Science.gov (United States)

Woronowicz, Michael

2016-01-01

Analytical expressions for column number density (CND) are developed for optical line of sight paths through a variety of steady free molecule point source models including directionally-constrained effusion (Mach number M = 0) and flow from a sonic orifice (M = 1). Sonic orifice solutions are approximate, developed using a fair simulacrum fitted to the free molecule solution. Expressions are also developed for a spherically-symmetric thermal expansion (M = 0). CND solutions are found for the most general paths relative to these sources and briefly explored. It is determined that the maximum CND from a distant location through directed effusion and sonic orifice cases occurs along the path parallel to the source plane that intersects the plume axis. For the effusive case this value is exactly twice the CND found along the ray originating from that point of intersection and extending to infinity along the plume's axis. For sonic plumes this ratio is reduced to about 4/3. For high Mach number cases the maximum CND will be found along the axial centerline path. Keywords: column number density, plume flows, outgassing, free molecule flow.

Costs comparison of electric energy in Brazil

International Nuclear Information System (INIS)

Goncalves, D.; Menegassi, J.

1981-01-01

A cost comparison study of various sources of electric energy generation was performed using uniform analysis criteria. The results indicate higher costs for coal, followed by nuclear and hidro. It was verified that presently, large hidro-power plants can only be located far from the load centers, with increasing costs of hidro-power energy in Brazil. These costs become higher than the nuclear plant if the hidro plant is located at distances exceeding 1000 Km. (Author) [pt

Graphs with not all possible path-kernels

DEFF Research Database (Denmark)

Aldred, Robert; Thomassen, Carsten

2004-01-01

The Path Partition Conjecture states that the vertices of a graph G with longest path of length c may be partitioned into two parts X and Y such that the longest path in the subgraph of G induced by X has length at most a and the longest path in the subgraph of G induced by Y has length at most b...

Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

Science.gov (United States)

2013-12-01

solution RALP Random-attacker linear program SALP Strategic-attacker linear program SMDP Semi-Markov decision process SP Shortest path SPR1 Shortest...average cost per attack among all vertices, which we refer to as the strategic-attacker linear program ( SALP ): min x zOPT (3.1a) subject to ∑ (k,l)∈A c...the SALP is indicated by zOPT. The lower bound that is obtained from using the LBLP is indicated by zLB. Solutions obtained from using a heuristic

Design of Active N-path Filters

NARCIS (Netherlands)

Darvishi, M.; van der Zee, Ronan A.R.; Nauta, Bram

2013-01-01

A design methodology for synthesis of active N-path bandpass filters is introduced. Based on this methodology, a 0.1-to-1.2 GHz tunable 6th-order N-path channel-select filter in 65 nm LP CMOS is introduced. It is based on coupling N-path filters with gyrators, achieving a “flat‿ passband shape and

Trade Costs and Location of Foreign Firms in China

OpenAIRE

International Monetary Fund

2005-01-01

This study examines the determinants of entry into by foreign firms, using information on 515 Chinese industries at the provincial level during 1998-2001. The analysis, rooted in the new economic geography, focuses on market and supplier access within and outside the province of entry, as well as production and trade costs. The results indicate that market and supplier access are the most important factors affecting foreign entry. Access to markets and suppliers in the province of entry matte...

Low Cost and Flexible UAV Deployment of Sensors

DEFF Research Database (Denmark)

Sørensen, Lars Yndal; Jacobsen, Lars Toft; Hansen, John Paulin

2017-01-01

-collection needs. The main contribution is the extensible architecture for modularized airborne sensor deployment and real-time data visualisation. Our open-source Android application provides data collection, flight path definition and map tools. Total cost of the system is below 800 dollars. The flexibility...

Optimal hub location in pipeline networks

Energy Technology Data Exchange (ETDEWEB)

Dott, D.R.; Wirasinghe, S.C.; Chakma, A. [Univ. of Calgary, Alberta (Canada)

1996-12-31

This paper discusses optimization strategies and techniques for the location of natural gas marketing hubs in the North American gas pipeline network. A hub is a facility at which inbound and outbound network links meet and freight is redirected towards their destinations. Common examples of hubs used in the gas pipeline industry include gas plants, interconnects and market centers. Characteristics of the gas pipeline industry which are relevant to the optimization of transportation costs using hubs are presented. Allocation techniques for solving location-allocation problems are discussed. An outline of the research in process by the authors in the field of optimal gas hub location concludes the paper.

Path integrals and geometry of trajectories

International Nuclear Information System (INIS)

Blau, M.; Keski-Vakkuri, E.; Niemi, A.J.

1990-01-01

A geometrical interpretation of path integrals is developed in the space of trajectories. This yields a supersymmetric formulation of a generic path integral, with the supersymmetry resembling the BRST supersymmetry of a first class constrained system. If the classical equation of motion is a Killing vector field in the space of trajectories, the supersymmetry localizes the path integral to classical trajectories and the WKB approximation becomes exact. This can be viewed as a path integral generalization of the Duistermaat-Heckman theorem, which states the conditions for the exactness of the WKB approximation for integrals in a compact phase space. (orig.)

On the Path to SunShot - Executive Summary

Energy Technology Data Exchange (ETDEWEB)

None, None

2016-05-01

The halfway mark of the SunShot Initiative’s 2020 target date is a good time to take stock: How much progress has been made? What have we learned? What barriers and opportunities must still be addressed to ensure that solar technologies achieve cost parity in 2020 and realize their full potential in the decades beyond? To answer these questions, the Solar Energy Technology Office launched the On the Path to SunShot series in early 2015 in collaboration with the National Renewable Energy Laboratory (NREL) and with contributions from Lawrence Berkeley National Laboratory (LBNL), Sandia National Laboratories (SNL), and Argonne National Laboratory (ANL). The reports focus on the areas of technology development, systems integration, and market enablers.

Perfect discretization of path integrals

International Nuclear Information System (INIS)

Steinhaus, Sebastian

2012-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Perfect discretization of path integrals

Science.gov (United States)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Target-to-Target Repetition Cost and Location Negative Priming Are Dissociable: Evidence for Different Mechanisms

Science.gov (United States)

Chao, Hsuan-Fu

2011-01-01

In a location-selection task, the repetition of a prior distractor location as the target location would slow down the response. This effect is termed the location negative priming (NP) effect. Recently, it has been demonstrated that repetition of a prior target location as the current target location would also slow down response. Because such…

Design of a TDOA location engine and development of a location system based on chirp spread spectrum.

Science.gov (United States)

Wang, Rui-Rong; Yu, Xiao-Qing; Zheng, Shu-Wang; Ye, Yang

2016-01-01

Location based services (LBS) provided by wireless sensor networks have garnered a great deal of attention from researchers and developers in recent years. Chirp spread spectrum (CSS) signaling formatting with time difference of arrival (TDOA) ranging technology is an effective LBS technique in regards to positioning accuracy, cost, and power consumption. The design and implementation of the location engine and location management based on TDOA location algorithms were the focus of this study; as the core of the system, the location engine was designed as a series of location algorithms and smoothing algorithms. To enhance the location accuracy, a Kalman filter algorithm and moving weighted average technique were respectively applied to smooth the TDOA range measurements and location results, which are calculated by the cooperation of a Kalman TDOA algorithm and a Taylor TDOA algorithm. The location management server, the information center of the system, was designed with Data Server and Mclient. To evaluate the performance of the location algorithms and the stability of the system software, we used a Nanotron nanoLOC Development Kit 3.0 to conduct indoor and outdoor location experiments. The results indicated that the location system runs stably with high accuracy at absolute error below 0.6 m.

Costs of groundwater contamination

International Nuclear Information System (INIS)

O'Neil, W.B.; Raucher, R.S.

1990-01-01

Two factors determine the cost of groundwater contamination: (1) the ways in which water was being used or was expected to be used in the future and (2) the physical characteristics of the setting that constrain the responses available to regain lost uses or to prevent related damages to human health and the environment. Most contamination incidents can be managed at a low enough cost that uses will not be foreclosed. It is important to take into account the following when considering costs: (1) natural cleansing through recharge and dilution can take many years; (2) it is difficult and costly to identify the exact area and expected path of a contamination plume; and (3) treatment or replacement of contaminated water often may represent the cost-effective strategy for managing the event. The costs of contamination include adverse health effects, containment and remediation, treatment and replacement costs. In comparing the costs and benefits of prevention programs with those of remediation, replacement or treatment, it is essential to adjust the cost/benefit numbers by the probability of their actual occurrence. Better forecasts of water demand are needed to predict more accurately the scarcity of new supply and the associated cost of replacement. This research should include estimates of the price elasticity of water demand and the possible effect on demand of more rational cost-based pricing structures. Research and development of techniques for in situ remediation should be encouraged

On Hilbert space of paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1980-01-01

A Hilbert space of paths, the elements of which are determined by trigonometric series, was proposed and used recently by Truman. This space is shown to consist precisely of all absolutely continuous paths ending in the origin with square-integrable derivatives

Spatial interaction models facility location using game theory

CERN Document Server

D'Amato, Egidio; Pardalos, Panos

2017-01-01

Facility location theory develops the idea of locating one or more facilities by optimizing suitable criteria such as minimizing transportation cost, or capturing the largest market share. The contributions in this book focus an approach to facility location theory through game theoretical tools highlighting situations where a location decision is faced by several decision makers and leading to a game theoretical framework in non-cooperative and cooperative methods. Models and methods regarding the facility location via game theory are explored and applications are illustrated through economics, engineering, and physics. Mathematicians, engineers, economists and computer scientists working in theory, applications and computational aspects of facility location problems using game theory will find this book useful.

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Directory of Open Access Journals (Sweden)

Yong Zhang

2017-01-01

Full Text Available The application of automated vehicles in logistics can efficiently reduce the cost of logistics and reduce the potential risks in the last mile. Considering the path restriction in the initial stage of the application of automated vehicles in logistics, the conventional model for a vehicle routing problem (VRP is modified. Thus, the automated vehicle routing problem with time windows (AVRPTW model considering path interruption is established. Additionally, an improved particle swarm optimisation (PSO algorithm is designed to solve this problem. Finally, a case study is undertaken to test the validity of the model and the algorithm. Four automated vehicles are designated to execute all delivery tasks required by 25 stores. Capacities of all of the automated vehicles are almost fully utilised. It is of considerable significance for the promotion of automated vehicles in last-mile situations to develop such research into real problems arising in the initial period.

Path Creation

DEFF Research Database (Denmark)

Karnøe, Peter; Garud, Raghu

2012-01-01

This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts. Competenc......This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts....... Competencies emerged through processes and mechanisms such as co-creation that implicated multiple learning processes. The process was not an orderly linear one as emergent contingencies influenced the learning processes. An implication is that public policy to catalyse clusters cannot be based...

Column Number Density Expressions Through M = 0 and M = 1 Point Source Plumes Along Any Straight Path

Science.gov (United States)

Woronowicz, Michael

2017-01-01

Providers of payloads carried aboard the International Space Station must conduct analyses to demonstrate that any planned gaseous venting events generate no more than a certain level of material that may interfere with optical measurements from other experiments or payloads located nearby. This requirement is expressed in terms of a maximum column number density (CND). Depending on the level of rarefaction, such venting may be characterized by effusion for low flow rates, or by a sonic distribution at higher levels. Since the relative locations of other sensitive payloads are often unknown because they may refer to future projects, this requirement becomes a search for the maximum CND along any path.In another application, certain astronomical observations make use of CND to estimate light attenuation from a distant star through gaseous plumes, such as the Fermi Bubbles emanating from the vicinity of the black hole at the center of our Milky Way galaxy, in order to infer the amount of material being expelled via those plumes.This paper presents analytical CND expressions developed for general straight paths based upon a free molecule point source model for steady effusive flow and for a distribution fitted to model flows from a sonic orifice. Among other things, in this Mach number range it is demonstrated that the maximum CND from a distant location occurs along the path parallel to the source plane that intersects the plume axis. For effusive flows this value is exactly twice the CND found along the ray originating from that point of intersection and extending to infinity along the plumes axis. For sonic plumes this ratio is reduced to about 43.

Quantitative analytical hierarchy process to marketing store location selection

Directory of Open Access Journals (Sweden)

Harwati

2018-01-01

Full Text Available The selection of Store to market the product is belong to Multi Criteria Decision Making problem. The criteria used have conflict of interest with each other to produce an optimal location. This research uses four important criteria to select new location of marketing store appropriate with the references: distance to location, competition level with competitor, number of potential customer, and location rent cost. Quantitative data is used to determine the optimum location with AHP method. Quantitative data are preferred to avoid inconsistency when using expert opinion. The AHP result optimum location among three alternatives places.

Side-to-side 3D coverage path planning approach for agricultural robots to minimize skip/overlap areas between swaths

DEFF Research Database (Denmark)

Hameed, Ibrahim; la Cour-Harbo, Anders; Osen, O. L.

2016-01-01

Automated path planning is important for the automation and optimization of field operations. It can provide the waypoints required for guidance, navigation and control of agricultural robots and autonomous tractors throughout the execution of these field operations. In agriculture, field...... operations are usually repeated in the same field and from year to year as well, therefore, it should be carried out in a manner that minimizes environmental impact and cost taking into account the topographic land features. Current 3D terrain field coverage path planning algorithms are simply 2D coverage...

Data path design and image quality aspects of the next generation multifunctional printer

Science.gov (United States)

Brassé, M. H. H.; de Smet, S. P. R. C.

2008-01-01

Multifunctional devices (MFDs) are increasingly used as a document hub. The MFD is used as a copier, scanner, printer, and it facilitates digital document distribution and sharing. This imposes new requirements on the design of the data path and its image processing. Various design aspects need to be taken into account, including system performance, features, image quality, and cost price. A good balance is required in order to develop a competitive MFD. A modular datapath architecture is presented that supports all the envisaged use cases. Besides copying, colour scanning is becoming an important use case of a modern MFD. The copy-path use case is described and it is shown how colour scanning can also be supported with a minimal adaptation to the architecture. The key idea is to convert the scanner data to an opponent colour space representation at the beginning of the image processing pipeline. The sub-sampling of chromatic information allows for the saving of scarce hardware resources without significant perceptual loss of quality. In particular, we have shown that functional FPGA modules from the copy application can also be used for the scan-to-file application. This makes the presented approach very cost-effective while complying with market conform image quality standards.

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †.

Science.gov (United States)

Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa

2017-07-11

This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

How to solve path integrals in quantum mechanics

International Nuclear Information System (INIS)

Grosche, C.

1994-10-01

A systematic classification of Feynman path integrals in quantum mechanics is presented and a table of solvable path integrals is given which reflects the progress made during the last 15 years, including, of course, the main contributions since the invention of the path integral by Feynman in 1942. An outline of the general theory is given which will serve as a quick reference for solving path integrals. Explicit formulae for the so-called basic path integrals are presented on which our general scheme to classify and calculate path integrals in quantum mechanics is based. (orig.)

Path integrals for arbitrary canonical transformations

International Nuclear Information System (INIS)

Oliveira, L.A.R. de.

1980-01-01

Some aspects of the path integral formulation of quantum mechanics are studied. This formalism is generalized to arbitrary canonical transformations, by means of an association between path integral probalility amplitudes and classical generators of transformations, analogous to the usual Hamiltonian time development phase space expression. Such association turns out to be equivalent to the Weyl quantization rule, and it is also shown that this formalism furnishes a path integral representation for a Lie algebra of a given set of classical generators. Some physical considerations about the path integral quantization procedure and about the relationship between classical and quantum dynamical structures are also discussed. (Author) [pt

An Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption

Directory of Open Access Journals (Sweden)

Davood Shishebori

2015-05-01

Full Text Available Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability of link disruptions, the objective function of the model minimizes the total costs, including location costs, link construction costs and also the expected transportation costs. An efficient hybrid algorithm based on LP relaxation and variable neighbourhood search metaheuristic is developed in order to solve the mathematical model. Numerical results demonstrate that the proposed hybrid algorithm has suitable efficiency in terms of duration of solution time and determining excellent solution quality.

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

2018-05-01

We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

Swimming behaviour and ascent paths of brook trout in a corrugated culvert

Science.gov (United States)

Goerig, Elsa; Bergeron, Normand E.; Castro-Santos, Theodore R.

2017-01-01

Culverts may restrict fish movements under some hydraulic conditions such as shallow flow depths or high velocities. Although swimming capacity imposes limits to passage performance, behaviour also plays an important role in the ability of fish to overcome velocity barriers. Corrugated metal culverts are characterized by unsteady flow and existence of low‐velocity zones, which can improve passage success. Here, we describe swimming behaviour and ascent paths of 148 wild brook trout in a 1.5‐m section of a corrugated metal culvert located in Raquette Stream, Québec, Canada. Five passage trials were conducted in mid‐August, corresponding to specific mean cross‐sectional flow velocities ranging from 0.30 to 0.63 m/s. Fish were individually introduced to the culvert and their movements recorded with a camera located above the water. Lateral and longitudinal positions were recorded at a rate of 3 Hz in order to identify ascent paths. These positions were related to the distribution of flow depths and velocities in the culvert. Brook trout selected flow velocities from 0.2 to 0.5 m/s during their ascents, which corresponded to the available flow velocities in the culvert at the low‐flow conditions. This however resulted in the use of low‐velocity zones at higher flows, mainly located along the walls of the culvert. Some fish also used the corrugations for sheltering, although the behaviour was marginal and did not occur at the highest flow condition. This study improves knowledge on fish behaviour during culvert ascents, which is an important aspect for developing reliable and accurate estimates of fish passage ability.

Long open-path instrument for simultaneously monitoring of methane, CO2 and water vapor

Science.gov (United States)

Simeonov, Valentin; Parlange, Marc

2013-04-01

A new, long open-path instrument for monitoring of path-averaged methane, CO2 and water vapor concentrations will be presented. The instrument is built on the monostatic scheme (transceiver -distant retroreflector). A VCSEL with a central wavelength of 1654 nm is used as a light source. The receiver is built around a 20 cm Newtonian telescope. The design optical path length is 2000 m but can be further extended. To avoid distortions in the shape of the spectral lines caused by atmospheric turbulences they are scanned within 1 µs. The expected concentration resolution for the above mentioned path length is of the order of 2 ppb for methane, 100 ppb for CO2 and 100 ppm for water vapor. The instrument is developed at the Swiss Federal Institute of Technology - Lausanne (EPFL) Switzerland and will be used within the GAW+ CH program for long-term monitoring of background methane and CO2 concentrations in the Swiss Alps. The initial calibration validation tests at EPFL were completed in December 2012 and the instrument will be installed at the beginning of 2013 at the High Altitude Research Station Jungfraujoch (HARSJ). The HARSJ is located at 3580 m ASL and is one of the 24 global GAW stations. One of the goals of the project is to compare path-averaged to the ongoing point measurements of methane in order to identify possible influence of the station. Future deployments of a copy of the instrument include the Canadian arctic and Siberian wetlands. The instrument can be used for ground truthing of satellite observation as well.

Investigating the Feedback Path in a Jet-Surface Resonant Interaction

Science.gov (United States)

Zaman, Khairul; Fagan, Amy; Bridges, James; Brown, Cliff

2015-01-01

A resonant interaction between an 8:1 aspect ratio rectangular jet and flat-plates, placed parallel to the jet, is addressed in this study. For certain relative locations of the plates, the resonance takes place with accompanying audible tones. Even when the tone is not audible the sound pressure level spectra is often marked by conspicuous peaks. The frequencies of the spectral peaks, as functions of the streamwise length of the plate and its relative location to the jet as well as the jet Mach number, are explored in an effort of understand the flow mechanism. It is demonstrated that the tones are not due to a simple feedback between the plates trailing edge and the nozzle exit; the leading edge also comes into play in determining the frequency. An acoustic feedback path, involving diffraction from the leading edge, appears to explain the frequencies of some of the spectral peaks.

Manufacturing plant location selection in logistics network using Analytic Hierarchy Process

Directory of Open Access Journals (Sweden)

Ping-Yu Chang

2015-11-01

Full Text Available Purpose: In recent years, numerous companies have moved their manufacturing plants to China to capitalize on lower cost and tax. Plant location has such an impact on cost, stocks, and logistics network but location selection in the company is usually based on subjective preference of high ranking managers. Such a decision-making process might result in selecting a location with a lower fixed cost but a higher operational cost. Therefore, this research adapts real data from an electronics company to develop a framework that incorporates both quantitative and qualitative factors for selecting new plant locations. Design/methodology/approach: In-depth interviews were conducted with 12 high rank managers (7 of them are department manager, 2 of them are vice-president, 1 of them is senior engineer, and 2 of them are plant manager in the departments of construction, finance, planning, production, and warehouse to determine the important factors. A questionnaire survey is then conducted for comparing factors which are analyzed using the Analytic Hierarchy Process (AHP. Findings: Results show that the best location chosen by the developed framework coincides well with the company’s primal production base. The results have been presented to the company’s high ranking managers for realizing the accuracy of the framework. Positive responses of the managers indicate usefulness of implementing the proposed model into reality, which adds to the value of this research. Practical implications: The proposed framework can save numerous time-consuming meetings called to compromise opinions and conflictions from different departments in location selection. Originality/value: This paper adapts the Analytic Hierarchy Process (AHP to incorporate quantitative and qualitative factors which are obtained through in-depth interviews with high rank managers in a company into the location decision.

Path probability distribution of stochastic motion of non dissipative systems: a classical analog of Feynman factor of path integral

International Nuclear Information System (INIS)

Lin, T.L.; Wang, R.; Bi, W.P.; El Kaabouchi, A.; Pujos, C.; Calvayrac, F.; Wang, Q.A.

2013-01-01

We investigate, by numerical simulation, the path probability of non dissipative mechanical systems undergoing stochastic motion. The aim is to search for the relationship between this probability and the usual mechanical action. The model of simulation is a one-dimensional particle subject to conservative force and Gaussian random displacement. The probability that a sample path between two fixed points is taken is computed from the number of particles moving along this path, an output of the simulation, divided by the total number of particles arriving at the final point. It is found that the path probability decays exponentially with increasing action of the sample paths. The decay rate increases with decreasing randomness. This result supports the existence of a classical analog of the Feynman factor in the path integral formulation of quantum mechanics for Hamiltonian systems

Future Energy Grid. Migration paths into the energy Internet; Future Energy Grid. Migrationspfade ins Internet der Energie

Energy Technology Data Exchange (ETDEWEB)

Appelrath, Hans-Juergen [Oldenburg Univ. (Germany); Kagermann, Henning [acatech - Deutsche Akademie der Technikwissenschaften, Berlin (Germany). Hauptstadtbuero; Mayer, Christoph (eds.) [OFFIS e.V., Oldenburg (Germany)

2012-07-01

The present study describes the migration path that must be taken up to the year 2030 in pursuit of the Future Energy Grid. For this purpose it has explored what possible future scenarios must be taken into account along the migration path. The following key factors were identified in preparation of drawing up scenarios: expansion of the electrical infrastructure; system-wide availability of an information and communication technology infrastructure; flexibilisation of consumption; energy mix; new services and products; final consumer costs; and standardisation and political framework conditions. These eight key factors were combined with each other in different variants to give three consistent scenarios for the year 2030.

Path Integral Formulation of Anomalous Diffusion Processes

OpenAIRE

Friedrich, Rudolf; Eule, Stephan

2011-01-01

We present the path integral formulation of a broad class of generalized diffusion processes. Employing the path integral we derive exact expressions for the path probability densities and joint probability distributions for the class of processes under consideration. We show that Continuous Time Random Walks (CTRWs) are included in our framework. A closed expression for the path probability distribution of CTRWs is found in terms of their waiting time distribution as the solution of a Dyson ...

Strategic Team AI Path Plans: Probabilistic Pathfinding

Directory of Open Access Journals (Sweden)

Tng C. H. John

2008-01-01

Full Text Available This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002, in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006. We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

Baseline System Costs for 50.0 MW Enhanced Geothermal System -- A Function of: Working Fluid, Technology, and Location, Location, Location

Energy Technology Data Exchange (ETDEWEB)

Dunn, Paul [Gas Equipment Engineering Corp., Milford, CT (United States); Selman, Nancy [Gas Equipment Engineering Corp., Milford, CT (United States); Volpe, Anthony Della [Gas Equipment Engineering Corp., Milford, CT (United States); Moss, Deborah [Gas Equipment Engineering Corp., Milford, CT (United States); Mobley, Rick [Plasma Energy Services, LLC, Putnam, CT (United States); Dickey, Halley [Turbine Air Systems, Houston, TX (United States); Unruh, Jeffery [Fugro NV/Wm. Lettis & Associates, Houston, TX (United States); Hitchcock, Chris [Fugro NV/Wm. Lettis & Associates, Houston, TX (United States); Tanguay, Jasmine [Conservation Law Foundation/CLF Ventures, Boston, MA (United States); Larsen, Walker [Conservation Law Foundation/CLF Ventures, Boston, MA (United States); Sanyal, Sabir [GeothermEx, Inc., San Pablo, CA (United States); Butler, Steven [GeothermEx, Inc., San Pablo, CA (United States); Stacey, Robert [GeothermEx, Inc., San Pablo, CA (United States); Robertson-Tait, Ann [GeothermEx, Inc., San Pablo, CA (United States); Pruess, Karsten [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Gutoski, Greg [Fairbanks Morse Engines (FME), Beloit, WI (United States); Fay, Jamie M. [Fort Point Associates, Boston, MA (United States); Stitzer, John T. [Fort Point Associates, Boston, MA (United States); Oglesby, Ken [Impact Technologies LLC, Tulsa, OK (United States)

2012-04-30

Substantial unexploited opportunity exists for the US, and the world, in Enhanced Geothermal Systems (EGS). As a result of US DOE investment, new drilling technology, new power generation equipment and cycles enable meaningful power production, in a compact and modular fashion; at lower and lower top side EGS working fluid temperatures and in a broader range of geologies and geographies. This cost analysis effort supports the expansion of Enhanced Geothermal Systems (EGS), furthering DOE strategic themes of energy security and sub goal of energy diversity; reducing the Nation's dependence on foreign oil while improving the environment.

Assessment of waterfront location in hardened concrete by GPR within COST Action TU1208

Science.gov (United States)

Rodríguez-Abad, Isabel; Klysz, Gilles; Balayssac, Jean Paul; Pajewski, Lara

2016-04-01

This work focuses on the analysis of the capability of Ground-Penetrating radar (GPR) technique for evaluating how the water penetrates into concrete samples by means of the assessment of the waterfront advance. Research activities have been carried out during a Short-Term Scientific Missions (STSMs) funded by the COST (European Cooperation in Science and Technology) Action TU1208 "Civil Engineering Applications of Ground Penetrating Radar" in November 2015. The evaluation of water penetrability is crucial in most building materials, such us concrete, since, water and aggressive chemical agents dissolved therein contribute to the deterioration of the material. A number of techniques have been developed to measure their advance in concrete. Although the most common method for measuring water content is the gravimetric method by observing the change in mass, this method has a large number of disadvantages. In this context, non-destructive techniques as GPR play an interesting role. In particular, the application of GPR in the building materials area is providing very promising and interesting results regarding the building materials characterization and especially concrete deterioration evaluation [1-3]. In addition, recent experimental studies highlight the strong relation between wave propagation parameters (velocity and energy level) and water content advance [4-5]. Water content has a decisive influence on dielectric properties and those might be assessed by the study of the wave properties that are derived by using GPR. Therefore, the waterfront advance will result in a change on wave parameters. In line with this, this research is focused on the development of specific processing algorithms necessary to understand how the water penetrates and how the wave parameters will be affected regarding the location of the antenna in reference to the water absorption direction. For this purpose, concrete samples were manufactured, which after curing (90 days) and oven

Two Generations of Path Dependence

DEFF Research Database (Denmark)

Madsen, Mogens Ove

  Even if there is no fully articulated and generally accepted theory of Path Dependence it has eagerly been taken up across a wide range of social sciences - primarily coming from economics. Path Dependence is most of all a metaphor that offers reason to believe, that some political, social...

Partial Path Column Generation for the ESPPRC

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn

This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing algorit...

Competition and the Location of Overseas Assembly

OpenAIRE

Deborah Swenson

2006-01-01

How does international competition affect overseas outsourcing? While it is commonly believed that international competition enables firms to desert high cost countries in favor of low wage locations, the frequency of such responses may be reduced if the movement of outsourcing activities involves sunk costs. To put these factors in perspective, I study the production decisions of participants in the U.S. overseas assembly program (OAP). A number of interesting regularities emerge. First, the...

A Novel Location-Centric IoT-Cloud Based On-Street Car Parking Violation Management System in Smart Cities.

Science.gov (United States)

Dinh, Thanh; Kim, Younghan

2016-06-02

Nowadays, in big cities, parking management is a critical issue from both the driver's side and the city government's side. From the driver's side, how to find an available parking lot in a city is a considerable concern. As a result, smart parking systems recently have received great interest, both in academia and industry. From the city government's side, how to manage and distribute such a limited public parking resource efficiently to give every visitor a fair chance of finding an on-street parking lot is also a considerable concern. However, existing studies of smart parking management focus only on assisting the driver's side to find available parking spaces. This study aims to raise a new perspective on such smart parking management and to propose a novel location-centric IoT-cloud-based parking violation management system. The system is designed to assist authoritative officers in finding parking violations easily and recommends the least cost path for officers so that officers can achieve their highest productivity in finding parking violations and issuing parking tickets. Experimental results show that the system not only improves the productivity of officers in finding parking violations and issuing tickets, but also helps reduce the traveling cost of officers and to reduce the average violation period of violating cars considerably.

Application of path analysis to urinary findings of cadmium-induced renal dysfunction.

Science.gov (United States)

Abe, T; Kobayashi, E; Okubo, Y; Suwazono, Y; Kido, T; Shaikh, Z A; Nogawa, K

2001-01-01

In order to identify some causal relations among various urinary indices of cadmium-induced renal dysfunction, such as glucose, total protein, amino nitrogen, beta 2-microglobulin (beta 2-m), metallothionein (MT), and cadmium (Cd), we applied path analysis method to previous epidemiological studies targeting the residents of the Cd-polluted Kakehashi River basin of Ishikawa Prefecture, Japan. We obtained a diagram-termed path model, representing some causal relations among the above urinary indices. It shows that urinary Cd is located at the beginning point in the diagram, and Cd-induced renal dysfunction develops in the following order: Cd exposure-->increase of beta 2-m and/or MT excretion-->increase of amino-N and/or total protein excretion-->increase of glucose excretion. It was proved mathematically, that in the case of both males and females, increased excretions of beta 2-m and/or MT were the most sensitive urinary indices of the early stage of chronic Cd-induced renal dysfunction.

Cost estimating for CERCLA remedial alternatives a unit cost methodology

International Nuclear Information System (INIS)

Brettin, R.W.; Carr, D.J.; Janke, R.J.

1995-06-01

The United States Environmental Protection Agency (EPA) Guidance for Conducting Remedial Investigations and Feasibility Studies Under CERCLA, Interim Final, dated October 1988 (EPA 1988) requires a detailed analysis be conducted of the most promising remedial alternatives against several evaluation criteria, including cost. To complete the detailed analysis, order-of-magnitude cost estimates (having an accuracy of +50 percent to -30 percent) must be developed for each remedial alternative. This paper presents a methodology for developing cost estimates of remedial alternatives comprised of various technology and process options with a wide range of estimated contaminated media quantities. In addition, the cost estimating methodology provides flexibility for incorporating revisions to remedial alternatives and achieves the desired range of accuracy. It is important to note that the cost estimating methodology presented here was developed as a concurrent path to the development of contaminated media quantity estimates. This methodology can be initiated before contaminated media quantities are estimated. As a result, this methodology is useful in developing cost estimates for use in screening and evaluating remedial technologies and process options. However, remedial alternative cost estimates cannot be prepared without the contaminated media quantity estimates. In the conduct of the feasibility study for Operable Unit 5 at the Fernald Environmental Management Project (FEMP), fourteen remedial alternatives were retained for detailed analysis. Each remedial alternative was composed of combinations of remedial technologies and processes which were earlier determined to be best suited for addressing the media-specific contaminants found at the FEMP site, and achieving desired remedial action objectives

Allocation and Location of Transport Logistics Centres

Directory of Open Access Journals (Sweden)

D. Mocková

2010-01-01

Full Text Available The facility allocation problem sets out to determine the optimal number of facilities to be opened. Based on multiple criteria evaluation, the optimal location of the facilities is usually solved subsequently. Several considerations, e.g. technical parameters, costs and finance must be taken into account. Economic analysis is carried out on the basis of the specific instance of the problem.Let us assume that the number of potentially located facilities is known. Then the problem of the optimal location of a given number of facilities in a network is referred to as the facility location problem. The solution to the problem is a set of facilities optimally located in an area such that this area is fully covered by the required services that the facilities provide. An example of a real-life problem of this type is the location of logistics centers. 

Folded-light-path colloidal quantum dot solar cells.

KAUST Repository

Koleilat, Ghada I; Kramer, Illan J; Wong, Chris T O; Thon, Susanna M; Labelle, André J; Hoogland, Sjoerd; Sargent, Edward H

2013-01-01

Colloidal quantum dot photovoltaics combine low-cost solution processing with quantum size-effect tuning to match absorption to the solar spectrum. Rapid advances have led to certified solar power conversion efficiencies of over 7%. Nevertheless, these devices remain held back by a compromise in the choice of quantum dot film thickness, balancing on the one hand the need to maximize photon absorption, mandating a thicker film, and, on the other, the need for efficient carrier extraction, a consideration that limits film thickness. Here we report an architecture that breaks this compromise by folding the path of light propagating in the colloidal quantum dot solid. Using this method, we achieve a substantial increase in short-circuit current, ultimately leading to improved power conversion efficiency.

Least cost supply strategies for wood chips

DEFF Research Database (Denmark)

Möller, Bernd

The abstract presents a study based on a geographical information system, which produce  cost-supply curves by location for forest woods chips in Denmark.......The abstract presents a study based on a geographical information system, which produce  cost-supply curves by location for forest woods chips in Denmark....

Path integration on hyperbolic spaces

Energy Technology Data Exchange (ETDEWEB)

Grosche, C [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

1991-11-01

Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S{sub 1} {approx equal} SO (n,1)/SO(n) and S{sub 2} {approx equal} SU(n,1)/S(U(1) x U(n)) in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E{sub O} = h{sup 2} /8m(m{sub {alpha}} +2m{sub 2} {alpha}){sup 2} (m {alpha} and m{sub 2}{alpha} denote the dimension of the root subspace corresponding to the roots {alpha} and 2{alpha}, respectively). I also discuss the case, where a constant magnetic field on H{sup n} is incorporated. (orig.).

Path integration on hyperbolic spaces

International Nuclear Information System (INIS)

Grosche, C.

1991-11-01

Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S 1 ≅ SO (n,1)/SO(n) and S 2 ≅ SU(n,1)/S[U(1) x U(n)] in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E O = h 2 /8m(m α +2m 2 α) 2 (m α and m 2 α denote the dimension of the root subspace corresponding to the roots α and 2α, respectively). I also discuss the case, where a constant magnetic field on H n is incorporated. (orig.)

Improved initial guess for minimum energy path calculations

International Nuclear Information System (INIS)

Smidstrup, Søren; Pedersen, Andreas; Stokbro, Kurt; Jónsson, Hannes

2014-01-01

A method is presented for generating a good initial guess of a transition path between given initial and final states of a system without evaluation of the energy. An objective function surface is constructed using an interpolation of pairwise distances at each discretization point along the path and the nudged elastic band method then used to find an optimal path on this image dependent pair potential (IDPP) surface. This provides an initial path for the more computationally intensive calculations of a minimum energy path on an energy surface obtained, for example, by ab initio or density functional theory. The optimal path on the IDPP surface is significantly closer to a minimum energy path than a linear interpolation of the Cartesian coordinates and, therefore, reduces the number of iterations needed to reach convergence and averts divergence in the electronic structure calculations when atoms are brought too close to each other in the initial path. The method is illustrated with three examples: (1) rotation of a methyl group in an ethane molecule, (2) an exchange of atoms in an island on a crystal surface, and (3) an exchange of two Si-atoms in amorphous silicon. In all three cases, the computational effort in finding the minimum energy path with DFT was reduced by a factor ranging from 50% to an order of magnitude by using an IDPP path as the initial path. The time required for parallel computations was reduced even more because of load imbalance when linear interpolation of Cartesian coordinates was used

Location estimation in wireless sensor networks using spring-relaxation technique.

Science.gov (United States)

Zhang, Qing; Foh, Chuan Heng; Seet, Boon-Chong; Fong, A C M

2010-01-01

Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization.

The location choice of graduate entrepreneurs in the United Kingdom

Directory of Open Access Journals (Sweden)

Polonyová Eva

2015-12-01

Full Text Available The graduates’ startup formation process represents a possible future role for universities in the form of active-participation, when speaking of the regional development. Tracking the path of entrepreneurial graduates who are moving between home, university, and employment, allows us to identify the specific motives that determine their migration decisions. The choice of location of graduate entrepreneurs is naturally affected by the context of their home region, as the availability of resources leads to a rising entrepreneurial intention. Similarly, the location of the startups flourish in densely populated urban regions, as well as in wealthier locations. At the same time, the vibrancy of the local entrepreneurial ecosystems is enhanced through mutual exchange and collaboration; and the higher the number of startups already present in a region, the higher the probability becomes for interaction and creativity. A leading tendency, not least to be mentioned, is that the preference to start new businesses is connected to highly-skilled creative sectors of the economy.

Hub location proplems under polyhedral demand uncertainty

OpenAIRE

Meraklı, Merve

2015-01-01

Cataloged from PDF version of thesis. Includes bibliographical references (leaves 69-74). Thesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2015. Hubs are points of consolidation and transshipment in many-to-many distribution systems that bene t from economies of scale. In hub location problems, the aim is to locate hub facilities such that each pairwise demand is satis ed and the total cost is minimized. The problem...

Locomotor adjustments for circumvention of an obstacle in the travel path.

Science.gov (United States)

Vallis, Lori Ann; McFadyen, Bradford J

2003-10-01

Independent living requires the navigation of a surrounding environment which is often cluttered with obstacles. When walking around an obstacle in the travel path, safe clearance requires some degree of body-segment reorientation. While body-segmental coordination strategies have been well studied for steering tasks that require moving the body in a new walking direction, it has never been established just what coordination strategies are used in different walking tasks. To address this issue, the current study was designed to investigate the timing of body segment coordination strategies and whole-body anticipatory locomotor adjustments employed when circumventing an obstacle placed in the travel path. Six healthy adults were asked to walk at their natural pace during unobstructed walking, as well as during avoidance to the right or left of a cylindrical obstacle (OBS) located in the travel path. Data analyzed were center of mass (COM) clearance from the OBS, forward velocity, step length and width, yaw angles of the head and trunk, roll angle of the trunk, and medial-lateral COM displacement. Onset of change in these variables from unobstructed walking was calculated as the time from OBS crossing. Avoidance involved two equally used strategies: lead limb close to or away from the OBS during the crossing step. Medial-lateral COM deviations were controlled by changes in step width without changes in trunk roll. There were no differences in the onset times of body segment reorientation for path deviation. These results are in contrast to previous studies on change in travel direction where the head segment initiates the body reorientation. Contrary to a steering task, circumventing an obstacle requires a different coordination for a transient change in COM trajectory with the underlying travel-direction maintained.

Path Integration on the Upper Half-Plane

OpenAIRE

Reijiro, KUBO; Research Institute for Theoretical Physics Hiroshima University

1987-01-01

Feynman's path integral is considered on the Poincare upper half-plane. It is shown that the fundamental solution to the heat equation ∂f/∂t=Δ_Hf can be expressed in terms of a path integral. A simple relation between the path integral and the Selberg trace formula is discussed briefly.

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Directory of Open Access Journals (Sweden)

Jean Chamberlain Chedjou

2015-01-01

Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.

Path planning for persistent surveillance applications using fixed-wing unmanned aerial vehicles

Science.gov (United States)

Keller, James F.

This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C 2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length. • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction. • A smooth path generator that provides C 2 routes that satisfy user specified curvature constraints. C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles. C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have developed a diverse range of solutions for persistent

Pedestrian paths: why path-dependence theory leaves health policy analysis lost in space.

Science.gov (United States)

Brown, Lawrence D

2010-08-01

Path dependence, a model first advanced to explain puzzles in the diffusion of technology, has lately won allegiance among analysts of the politics of public policy, including health care policy. Though the central premise of the model--that past events and decisions shape options for innovation in the present and future--is indisputable (indeed path dependence is, so to speak, too shallow to be false), the approach, at least as applied to health policy, suffers from ambiguities that undercut its claims to illuminate policy projects such as managed care, on which this article focuses. Because path dependence adds little more than marginal value to familiar images of the politics of policy--incrementalism, for one--analysts might do well to put it on the back burner and pursue instead "thick descriptions" that help them to distinguish different degrees of openness to exogenous change among diverse policy arenas.

The Thinnest Path Problem

Science.gov (United States)

2016-07-22

be reduced to TP in -D UDH for any . We then show that the 2-D disk hypergraph constructed in the proof of Theorem 1 can be modified to an exposed...transmission range that induces hy- peredge , i.e., (3) GAO et al.: THINNEST PATH PROBLEM 1181 Theorem 5 shows that the covered area of the path...representation of (the two hyperedges rooted at from the example given in Fig. 6 are illustrated in green and blue, respectively). step, we show in this

Curvature-Continuous 3D Path-Planning Using QPMI Method

Directory of Open Access Journals (Sweden)

Seong-Ryong Chang

2015-06-01

Full Text Available It is impossible to achieve vertex movement and rapid velocity control in aerial robots and aerial vehicles because of momentum from the air. A continuous-curvature path ensures such robots and vehicles can fly with stable and continuous movements. General continuous path-planning methods use spline interpolation, for example B-spline and Bézier curves. However, these methods cannot be directly applied to continuous path planning in a 3D space. These methods use a subset of the waypoints to decide curvature and some waypoints are not included in the planned path. This paper proposes a method for constructing a curvature-continuous path in 3D space that includes every waypoint. The movements in each axis, x, y and z, are separated by the parameter u. Waypoint groups are formed, each with its own continuous path derived using quadratic polynomial interpolation. The membership function then combines each continuous path into one continuous path. The continuity of the path is verified and the curvature-continuous path is produced using the proposed method.

Path integration on the upper half-plane

International Nuclear Information System (INIS)

Kubo, Reijiro.

1987-06-01

Feynman's path integral is considered on the Poincare upper half-plane. It is shown that the fundamental solution to the heat equation δf/δt = Δ H f can be expressed in terms of a path integral. A simple relation between the path integral and the Selberg trace formula is discussed briefly. (author)

Chromatic roots and hamiltonian paths

DEFF Research Database (Denmark)

Thomassen, Carsten

2000-01-01

We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t(n) = 2/3 + 1/3 (3)root (26 + 6 root (33)) + 1/3 (3)root (26 - 6 root (33)) = 1.29559.... then the graph has no hamiltonian path. This result...

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †

Directory of Open Access Journals (Sweden)

Wenyu Cai

2017-07-01

Full Text Available This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP problem and the Genetic Algorithm (GA is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB or Tour Length Balance (TLB constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X − Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

Kinematics and Path Following Control of an Articulated Drum Roller

Science.gov (United States)

BIAN, Yongming; YANG, Meng; FANG, Xiaojun; WANG, Xiahui

2017-07-01

Automatic navigation of an articulated drum roller, which is an articulated steering type vehicle widely used in the construction industry, is highly expected for operation cost reduction and improvement of work efficiency. In order to achieve the path following control, considering that its steering system is articulated steering and two frames are articulated by an active revolute joint, a kinematic model and an error dynamic state-space equation of an articulated drum roller are proposed. Besides, a state-feedback control law based on Lyapunov stability theory is also designed, which can be proved to achieve the purpose of control by the analysis of stability. What's more, to evaluate the performance of the proposed method, simulation under the MATLAB/Simulink and experiments using positioning algorithm and errors correction at the uneven construction site are performed, with initial displacement error (-1.5 m), heading error (-0.11 rad) and steering angle (-0.19 rad). Finally, simulation and experimental results show that the errors and steering angle can decrease gradually, and converge to zero with time. Meanwhile, the control input is not saturated. An articulated drum roller can lock into a desired path with the proposed method in uneven fields.

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...... depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0....

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

Path diversity improves the identification of influential spreaders

Science.gov (United States)

Chen, Duan-Bing; Xiao, Rui; Zeng, An; Zhang, Yi-Cheng

2013-12-01

Identifying influential spreaders in complex networks is a crucial problem which relates to wide applications. Many methods based on the global information such as K-shell and PageRank have been applied to rank spreaders. However, most of the related previous works overwhelmingly focus on the number of paths for propagation, while whether the paths are diverse enough is usually overlooked. Generally, the spreading ability of a node might not be strong if its propagation depends on one or two paths while the other paths are dead ends. In this letter, we introduced the concept of path diversity and find that it can largely improve the ranking accuracy. We further propose a local method combining the information of path number and path diversity to identify influential nodes in complex networks. This method is shown to outperform many well-known methods in both undirected and directed networks. Moreover, the efficiency of our method makes it possible to apply it to very large systems.

Path integration of head direction: updating a packet of neural activity at the correct speed using neuronal time constants.

Science.gov (United States)

Walters, D M; Stringer, S M

2010-07-01

A key question in understanding the neural basis of path integration is how individual, spatially responsive, neurons may self-organize into networks that can, through learning, integrate velocity signals to update a continuous representation of location within an environment. It is of vital importance that this internal representation of position is updated at the correct speed, and in real time, to accurately reflect the motion of the animal. In this article, we present a biologically plausible model of velocity path integration of head direction that can solve this problem using neuronal time constants to effect natural time delays, over which associations can be learned through associative Hebbian learning rules. The model comprises a linked continuous attractor network and competitive network. In simulation, we show that the same model is able to learn two different speeds of rotation when implemented with two different values for the time constant, and without the need to alter any other model parameters. The proposed model could be extended to path integration of place in the environment, and path integration of spatial view.

Modeling a four-layer location-routing problem

Directory of Open Access Journals (Sweden)

Mohsen Hamidi

2012-01-01

Full Text Available Distribution is an indispensable component of logistics and supply chain management. Location-Routing Problem (LRP is an NP-hard problem that simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the decisions at multiple layers of a distribution network where multiple products are transported within and between layers of the network. This paper focuses on modeling a complicated four-layer and multi-product LRP which has not been tackled yet. The distribution network consists of plants, central depots, regional depots, and customers. In this study, the structure, assumptions, and limitations of the distribution network are defined and the mathematical optimization programming model that can be used to obtain the optimal solution is developed. Presented by a mixed-integer programming model, the LRP considers the location problem at two layers, the allocation problem at three layers, the vehicle routing problem at three layers, and a transshipment problem. The mathematical model locates central and regional depots, allocates customers to plants, central depots, and regional depots, constructs tours from each plant or open depot to customers, and constructs transshipment paths from plants to depots and from depots to other depots. Considering realistic assumptions and limitations such as producing multiple products, limited production capacity, limited depot and vehicle capacity, and limited traveling distances enables the user to capture the real world situations.

Los Alamos National Laboratory progress and path to inertial confinement fusion commercialization

International Nuclear Information System (INIS)

Harris, D.B.; Dudziak, D.J.

1989-01-01

KrF lasers appear to be an attractive driver for inertial confinement fusion commercial applications such as electric power production. Los Alamos National Laboratory is working to develop the technology required to demonstrate that KrF lasers can satisfy all of the driver requirements. The latest experimental and theoretical results indicate that cost currently appears to be the main issue for KrF lasers. The Los Alamos program is working to reduce the cost of KrF laser systems by developing damage-resistant optical coatings, low-cost optical blanks, high-intrinsic-efficiency gas mixtures, low-cost and high-efficiency pulsed power, and optimized system architectures. Other potential issues may cause problems after the 5 kJ Aurora KrF laser system becomes operational, such as amplified spontaneous emission, cross talk or temporal pulse distortion. Design solutions to issues such as these have been identified and will be experimentally demonstrated on Aurora. Issues specific to commercial-application drivers, such as cost, gas flow, repetively pulsed power, and high reliability cannot be experimentally addressed at this time. Projections will be made on the ability of KrF lasers to satisfy these requirements. The path to commercialization of inertial fusion for KrF lasers is also described. (orig.)

42 CFR 412.204 - Payment to hospitals located in Puerto Rico.

Science.gov (United States)

2010-10-01

... 42 Public Health 2 2010-10-01 2010-10-01 false Payment to hospitals located in Puerto Rico. 412... Payment System for Inpatient Operating Costs for Hospitals Located in Puerto Rico § 412.204 Payment to hospitals located in Puerto Rico. (a) FY 1988 through FY 1997. For discharges occurring on or after October...

Electron Inelastic-Mean-Free-Path Database

Science.gov (United States)

SRD 71 NIST Electron Inelastic-Mean-Free-Path Database (PC database, no charge)   This database provides values of electron inelastic mean free paths (IMFPs) for use in quantitative surface analyses by AES and XPS.

Hanford spent nuclear fuel project recommended path forward, volume III: Alternatives and path forward evaluation supporting documentation

International Nuclear Information System (INIS)

Fulton, J.C.

1994-10-01

Volume I of the Hanford Spent Nuclear Fuel Project - Recommended Path Forward constitutes an aggressive series of projects to construct and operate systems and facilities to safely retrieve, package, transport, process, and store K Basins fuel and sludge. Volume II provided a comparative evaluation of four Alternatives for the Path Forward and an evaluation for the Recommended Path Forward. Although Volume II contained extensive appendices, six supporting documents have been compiled in Volume III to provide additional background for Volume II

Understanding and applying open-path optical sensing data

Science.gov (United States)

Virag, Peter; Kricks, Robert J.

1999-02-01

During the last 10 years, open-path air monitors have evolved to yield reliable and effective measurements of single and multiple compounds on a real-time basis. To many individuals within the optical remote sensing community, the attributes of open-path and its the potential uses seem unlimited. Then why has the market has been stagnant for the last few years? The reason may center on how open-path information is applied and how well the end user understands that information. We constantly try to compare open-path data to risk/health or safety levels that are based for use at a single point and for a specific averaging period often far longer than a typical open-path data point. Often this approach is perceived as putting a square peg in a round hole. This perception may be well founded, as open-path data at times may need to go through extensive data manipulation and assumptions before it can be applied. This paper will review pervious open-path monitoring programs and their success in applying the data collected. We will also look at how open-path data is being currently used, some previous pitfalls in data use, alternate methods of data interpretation, and how open-path data can be best practically applied to fit current needs.

On the Path to SunShot. The Role of Advancements in Solar Photovoltaic Efficiency, Reliability, and Costs

Energy Technology Data Exchange (ETDEWEB)

Woodhouse, Michael [National Renewable Energy Lab. (NREL), Golden, CO (United States); Jones-Albertus, Rebecca [U.S. Dept. of Energy, Washington, DC (United States); Feldman, David [National Renewable Energy Lab. (NREL), Golden, CO (United States); Fu, Ran [National Renewable Energy Lab. (NREL), Golden, CO (United States); Horowitz, Kelsey [National Renewable Energy Lab. (NREL), Golden, CO (United States); Chung, Donald [National Renewable Energy Lab. (NREL), Golden, CO (United States); Jordan, Dirk [National Renewable Energy Lab. (NREL), Golden, CO (United States); Kurtz, Sarah [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2016-05-01

This report examines the remaining challenges to achieving the competitive photovoltaic (PV) costs and large-scale deployment envisioned under the U.S. Department of Energy's SunShot Initiative. Solar-energy cost reductions can be realized through lower PV module and balance-of-system (BOS) costs as well as improved system efficiency and reliability. Numerous combinations of PV improvements could help achieve the levelized cost of electricity (LCOE) goals because of the tradeoffs among key metrics like module price, efficiency, and degradation rate as well as system price and lifetime. Using LCOE modeling based on bottom-up cost analysis, two specific pathways are mapped to exemplify the many possible approaches to module cost reductions of 29%-38% between 2015 and 2020. BOS hardware and soft cost reductions, ranging from 54%-77% of total cost reductions, are also modeled. The residential sector's high supply-chain costs, labor requirements, and customer-acquisition costs give it the greatest BOS cost-reduction opportunities, followed by the commercial sector, although opportunities are available to the utility-scale sector as well. Finally, a future scenario is considered in which very high PV penetration requires additional costs to facilitate grid integration and increased power-system flexibility--which might necessitate even lower solar LCOEs. The analysis of a pathway to 3-5 cents/kWh PV systems underscores the importance of combining robust improvements in PV module and BOS costs as well as PV system efficiency and reliability if such aggressive long-term targets are to be achieved.

Roadmap for import of sustainable biomass. Elaboration of transition path 2. Realisation of the Biomass Import Chain

International Nuclear Information System (INIS)

Faaij, A.

2006-12-01

The main objective of the activities described in this document is to formulate a transition path for realizing sustainable biomass import chains. The following elements are crucial in this process: definition of required activities (research, demonstration, technology development), as well as a description of main uncertainties and barriers; setting up a time path and assessing costs (government investments and market investments); and engaging the main actors in the Netherlands, making an inventory of the current positions and motivation to contribute to the realization of sustainable biomass import chains. This document sketches a road map for the development of sustainable biomass import capacity in time, especially from a national point of view. [mk] [nl

Two-path plasmonic interferometer with integrated detector

Science.gov (United States)

Dyer, Gregory Conrad; Shaner, Eric A.; Aizin, Gregory

2016-03-29

An electrically tunable terahertz two-path plasmonic interferometer with an integrated detection element can down convert a terahertz field to a rectified DC signal. The integrated detector utilizes a resonant plasmonic homodyne mixing mechanism that measures the component of the plasma waves in-phase with an excitation field that functions as the local oscillator in the mixer. The plasmonic interferometer comprises two independently tuned electrical paths. The plasmonic interferometer enables a spectrometer-on-a-chip where the tuning of electrical path length plays an analogous role to that of physical path length in macroscopic Fourier transform interferometers.

Optical biopsy of breast tissue using differential path-length spectroscopy

International Nuclear Information System (INIS)

Veen, Robert L P van; Amelink, Arjen; Menke-Pluymers, Marian; Pol, Carmen van der; Sterenborg, Henricus J C M

2005-01-01

Differential path-length spectroscopy (DPS) was used to determine the local optical properties of breast tissue in vivo. DPS measurements were made on healthy and malignant breast tissue using a fibre-optic needle probe, and were correlated to the histological outcome of core-needle biopsies taken from the same location as the measurements. DPS yields information on the local tissue blood content, the local blood oxygenation, the average micro-vessel diameter, the β-carotene concentration and the scatter slope. Our data show that malignant breast tissue is characterized by a significant decrease in tissue oxygenation and a higher blood content compared to normal breast tissue

Strategies to Evaluate the Visibility Along AN Indoor Path in a Point Cloud Representation

Science.gov (United States)

Grasso, N.; Verbree, E.; Zlatanova, S.; Piras, M.

2017-09-01

Many research works have been oriented to the formulation of different algorithms for estimating the paths in indoor environments from three-dimensional representations of space. The architectural configuration, the actions that take place within it, and the location of some objects in the space influence the paths along which is it possible to move, as they may cause visibility problems. To overcome the visibility issue, different methods have been proposed which allow to identify the visible areas and from a certain point of view, but often they do not take into account the user's visual perception of the environment and not allow estimating how much may be complicated to follow a certain path. In the field of space syntax and cognitive science, it has been attempted to describe the characteristics of a building or an urban environment by the isovists and visibility graphs methods; some numerical properties of these representations allow to describe the space as for how it is perceived by a user. However, most of these studies are directed to analyze the environment in a two-dimensional space. In this paper we propose a method to evaluate in a quantitative way the complexity of a certain path within an environment represented by a three-dimensional point cloud, by the combination of some of the previously mentioned techniques, considering the space visible from a certain point of view, depending on the moving agent (pedestrian , people in wheelchairs, UAV, UGV, robot).

Characterizing and locating air pollution sources in a complex industrial district using optical remote sensing technology and multivariate statistical modeling.

Science.gov (United States)

Chang, Pao-Erh Paul; Yang, Jen-Chih Rena; Den, Walter; Wu, Chang-Fu

2014-09-01

Emissions of volatile organic compounds (VOCs) are most frequent environmental nuisance complaints in urban areas, especially where industrial districts are nearby. Unfortunately, identifying the responsible emission sources of VOCs is essentially a difficult task. In this study, we proposed a dynamic approach to gradually confine the location of potential VOC emission sources in an industrial complex, by combining multi-path open-path Fourier transform infrared spectrometry (OP-FTIR) measurement and the statistical method of principal component analysis (PCA). Close-cell FTIR was further used to verify the VOC emission source by measuring emitted VOCs from selected exhaust stacks at factories in the confined areas. Multiple open-path monitoring lines were deployed during a 3-month monitoring campaign in a complex industrial district. The emission patterns were identified and locations of emissions were confined by the wind data collected simultaneously. N,N-Dimethyl formamide (DMF), 2-butanone, toluene, and ethyl acetate with mean concentrations of 80.0 ± 1.8, 34.5 ± 0.8, 103.7 ± 2.8, and 26.6 ± 0.7 ppbv, respectively, were identified as the major VOC mixture at all times of the day around the receptor site. As the toxic air pollutant, the concentrations of DMF in air samples were found exceeding the ambient standard despite the path-average effect of OP-FTIR upon concentration levels. The PCA data identified three major emission sources, including PU coating, chemical packaging, and lithographic printing industries. Applying instrumental measurement and statistical modeling, this study has established a systematic approach for locating emission sources. Statistical modeling (PCA) plays an important role in reducing dimensionality of a large measured dataset and identifying underlying emission sources. Instrumental measurement, however, helps verify the outcomes of the statistical modeling. The field study has demonstrated the feasibility of

Location Estimation in Wireless Sensor Networks Using Spring-Relaxation Technique

Directory of Open Access Journals (Sweden)

Qing Zhang

2010-05-01

Full Text Available Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN. Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization.

A multi-objective location routing problem using imperialist competitive algorithm

Directory of Open Access Journals (Sweden)

Amir Mohammad Golmohammadi

2016-06-01

Full Text Available Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

Path operator algebras in conformal quantum field theories

International Nuclear Information System (INIS)

Roesgen, M.

2000-10-01

Two different kinds of path algebras and methods from noncommutative geometry are applied to conformal field theory: Fusion rings and modular invariants of extended chiral algebras are analyzed in terms of essential paths which are a path description of intertwiners. As an example, the ADE classification of modular invariants for minimal models is reproduced. The analysis of two-step extensions is included. Path algebras based on a path space interpretation of character identities can be applied to the analysis of fusion rings as well. In particular, factorization properties of character identities and therefore of the corresponding path spaces are - by means of K-theory - related to the factorization of the fusion ring of Virasoro- and W-algebras. Examples from nonsupersymmetric as well as N=2 supersymmetric minimal models are discussed. (orig.)

Locating leaks in water mains using noise loggers

OpenAIRE

El-Abbasy, Mohammed S.; Mosleh, Fadi; Senouci, Ahmed; Zayed, Tarek; Al-Derham, Hassan

2016-01-01

Because of their potential danger to public health, economic loss, environmental damage, and energy waste, underground water pipelines leaks have received more attention globally. Researchers have proposed active leakage control approaches to localize, locate, and pinpoint leaks. Noise loggers have usually been used only for localizing leaks while other tools were used for locating and pinpointing. These approaches have resulted in additional cost and time. Thus, regression and artificial neu...

Cross Validation Through Two-Dimensional Solution Surface for Cost-Sensitive SVM.

Science.gov (United States)

Gu, Bin; Sheng, Victor S; Tay, Keng Yeow; Romano, Walter; Li, Shuo

2017-06-01

Model selection plays an important role in cost-sensitive SVM (CS-SVM). It has been proven that the global minimum cross validation (CV) error can be efficiently computed based on the solution path for one parameter learning problems. However, it is a challenge to obtain the global minimum CV error for CS-SVM based on one-dimensional solution path and traditional grid search, because CS-SVM is with two regularization parameters. In this paper, we propose a solution and error surfaces based CV approach (CV-SES). More specifically, we first compute a two-dimensional solution surface for CS-SVM based on a bi-parameter space partition algorithm, which can fit solutions of CS-SVM for all values of both regularization parameters. Then, we compute a two-dimensional validation error surface for each CV fold, which can fit validation errors of CS-SVM for all values of both regularization parameters. Finally, we obtain the CV error surface by superposing K validation error surfaces, which can find the global minimum CV error of CS-SVM. Experiments are conducted on seven datasets for cost sensitive learning and on four datasets for imbalanced learning. Experimental results not only show that our proposed CV-SES has a better generalization ability than CS-SVM with various hybrids between grid search and solution path methods, and than recent proposed cost-sensitive hinge loss SVM with three-dimensional grid search, but also show that CV-SES uses less running time.

On the benefits of location-based relay selection in mobile wireless networks

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

2016-01-01

We consider infrastructure-based mobile networks that are assisted by a single relay transmission where both the downstream destination and relay nodes are mobile. Selecting the optimal transmission path for a destination node requires up-to-date link quality estimates of all relevant links....... If the relay selection is based on link quality measurements, the number of links to update grows quadratically with the number of nodes, and measurements need to be updated frequently when nodes are mobile. In this paper, we consider a location-based relay selection scheme where link qualities are estimated...... from node positions; in the scenario of a node-based location system such as GPS, the location-based approach reduces signaling overhead, which in this case only grows linearly with the number of nodes. This paper studies these two relay selection approaches and investigates how they are affected...

Cost analysis of teg-powered and solar-powered cathodic protection system for a-50 km long buried natural gas pipeline located in Sindh, Pakistan

International Nuclear Information System (INIS)

Shahid, M.; Inam, F.; Farooq, M.; Khan, F.N.

2005-01-01

Corrosion leaks are of significant concern to oil and gas industry and is considered to be the largest controllable factor in pipeline safety. Cathodic Protection (CP) is a well-established method for preventing corrosion of metallic materials. Electrical power is required and it is usually difficult and expensive to install conventional power lines in remote areas for readily available power supply. Oil/gas organizations make use of thermo-electric generators (TEG), which is relatively expensive in terms of running expenditures. Utilization of renewable energies is now being widely explored due to potential danger of running out of natural resources and dates back mid of 20th century [I]. However, use of solar powered CP system for oil/gas pipelines hasn't been encouraged much in Pakistan, probably due to lack of understanding. A project was undertaken for designing a solar powered CP system for a 52.4 km buried gas pipeline located at Sui/Sara gas fields (Latitude 27.5) of Tullow Pakistan (Dev.) Ltd. in Dharki, Sindh, Pakistan. After detailed analysis of soil condition, electrochemical testing, local climatic variation and cost analysis, it has been revealed that use of solar power is quite feasible for the above-mentioned pipeline section. Cost analysis and comparison have also favored this system since the maintenance cost of the solar-powered system is much less compared to TEG system. Installation cost of the solar system is about 1.57 times the cost of TEG; however, the maintenance cost is only -20% of that for TEG system. The higher installation cost has been estimated to be recoverable in less than one year of service. (author)

Cost-Effective Location Management for Mobile Agents on the Internet

OpenAIRE

Chien-Sheng Chen; Jiing-Dong Hwang; Chyuan-Der Lu; Ting-Yuan Yeh

2015-01-01

Many mobile agent system-related services and applications require interacting with a mobile agent by passing messages. However, an agent’s mobility raises several challenges in delivering messages to a mobile agent accurately. Consisting of tracking and message delivery phases, most mobile agent location management schemes create or receive many update messages and interaction messages to ensure the effectiveness of the schemes. In addition to downgrading the overall performance of a mobile ...

Estimation of distributed Fermat-point location for wireless sensor networking.