Adaptively Ubiquitous Learning in Campus Math Path
Shih, Shu-Chuan; Kuo, Bor-Chen; Liu, Yu-Lung
2012-01-01
The purposes of this study are to develop and evaluate the instructional model and learning system which integrate ubiquitous learning, computerized adaptive diagnostic testing system and campus math path learning. The researcher first creates a ubiquitous learning environment which is called "adaptive U-learning math path system". This system…
Adaptive robot path planning in changing environments
Energy Technology Data Exchange (ETDEWEB)
Chen, P.C.
1994-08-01
Path planning needs to be fast to facilitate real-time 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 overcome this difficulty, we present an adaptive algorithm that uses past experience to speed up future performance. It is a learning algorithm suitable for incrementally-changing environments such as those encountered in manufacturing of evolving products and waste-site remediation. The algorithm allows the robot to adapt to its environment by having two experience manipulation schemes: For minor environmental change, we use an object-attached experience abstraction scheme to increase the flexibility of the learned experience; for major environmental change, we use an on-demand experience repair scheme to retain those experiences that remain valid and useful. Using this algorithm, we can effectively reduce the overall robot planning time by re-using the computation result for one task to plan a path for another.
ACO in e-Learning: Towards an adaptive learning path
Directory of Open Access Journals (Sweden)
Pushpa. M
2012-03-01
Full Text Available Today we are in an era where drastic advancements in networking and information technology are in action. The learning process has also taken these advancements, as a result of which e-learning came to thescene. Personalization in e-learning will improve the performance of the system. Recent researches are concentrating on providing adaptability to the learning management systems, depending upon the varying user needs and contexts. Adaptability can be provided at different levels .Providing an adaptive learning path according to the context of the learners’ is an important issue. An optimal adaptive learning path will help the learners in reducing the cognitive overload and disorientation, and thereby improving the efficiency of the Learning Management System (LMS. Ant Colony Optimization (ACO is a widely accepted technique since it provides an adaptive learning path to the learners. Meta-heuristic which is used in intelligent tutoring systems provides the learning path in an adaptive way. The most interesting feature of ACO is its adaptation and robustness in an environment where the learning materials and learners are changing frequently. In this paper we can have a look through the existing ACO approaches towards providing an adaptive learning path and an introduction towards an enhanced attribute ant for making the e-learning system more adaptive.
Spatial Path Following for AUVs Using Adaptive Neural Network Controllers
Directory of Open Access Journals (Sweden)
Jiajia Zhou
2013-01-01
Full Text Available The spatial path following control problem of autonomous underwater vehicles (AUVs is addressed in this paper. In order to realize AUVs’ spatial path following control under systemic variations and ocean current, three adaptive neural network controllers which are based on the Lyapunov stability theorem are introduced to estimate uncertain parameters of the vehicle’s model and unknown current disturbances. These controllers are designed to guarantee that all the error states in the path following system are asymptotically stable. Simulation results demonstrated that the proposed controller was effective in reducing the path following error and was robust against the disturbances caused by vehicle's uncertainty and ocean currents.
Adaptive path planning: Algorithm and analysis
Energy Technology Data Exchange (ETDEWEB)
Chen, Pang C.
1995-03-01
To address the need for a fast path planner, we present a learning algorithm that improves path planning by using past experience to enhance future performance. The algorithm relies on an existing path planner to provide solutions difficult tasks. From these solutions, an evolving sparse work of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a framework in which a slow but effective planner may be improved both cost-wise and capability-wise by a faster but less effective planner coupled with experience. We analyze algorithm by formalizing the concept of improvability and deriving conditions under which a planner can be improved within the framework. The analysis is based on two stochastic models, one pessimistic (on task complexity), the other randomized (on experience utility). Using these models, we derive quantitative bounds to predict the learning behavior. We use these estimation tools to characterize the situations in which the algorithm is useful and to provide bounds on the training time. In particular, we show how to predict the maximum achievable speedup. Additionally, our analysis techniques are elementary and should be useful for studying other types of probabilistic learning as well.
Robust Adaptive Photon Tracing using Photon Path Visibility
DEFF Research Database (Denmark)
Hachisuka, Toshiya; Jensen, Henrik Wann
2011-01-01
algorithm is the use of visibility of photon path as the importance function which ensures that our sampling algorithm focuses on paths that are visible from the given viewpoint. Our sampling algorithm builds on two recent developments in Markov chain Monte Carlo methods: adaptive Markov chain sampling...... and replica exchange. Using these techniques, each photon path is adaptively mutated and it explores the sampling space efficiently without being stuck at a local peak of the importance function. We have implemented this sampling approach in the progressive photon mapping algorithm which provides visibility...... information in a natural way when a photon path contributes to a measurement point. We demonstrate that the final algorithm is strikingly simple, yet effective at sampling photons under lighting conditions that would be difficult for existing Monte Carlo ray tracing-based methods....
Channel Adaptive Shortest Path Routing for Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
TIAN Hui; XIE Fang; HU Jian-dong; ZHANG Ping
2003-01-01
Routing in Mobile Ad Hoc Network (MANET) is a challenge owing to the dynamic nature of network topology and the resource constraints. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with the minimum hops approach is often adopted. However, the quality of wireless channels among the mobile nodes is time varying owing to fading, shadowing and path loss. Considering adaptive channel coding and modulation scheme, the channel state can be characterized by different link throughputs. If routing selection based on the link throughput is implemented, the minimum transfer delay from source to destination and the maximal throughput may be obtained. In this paper, a Channel Adaptive Shortest Path Routing (CASPR) is presented. Based on the adaptive channel coding and modulation, the CASPR transforms the link throughput into the channel quality factor Q and finds the shortest routing according to the Q measure. Simulation results show that the average path length in the proposed routing scheme may be slightly higher than that of the conventional shortest path with the minimum hops approach, but it can reduce the average transfer delay and increase the packet deliver rate.
Minimum-Risk Path Finding by an Adaptive Amoebal Network
Nakagaki, Toshiyuki; Iima, Makoto; Ueda, Tetsuo; Nishiura, Yasumasa; Saigusa, Tetsu; Tero, Atsushi; Kobayashi, Ryo; Showalter, Kenneth
2007-08-01
When two food sources are presented to the slime mold Physarum in the dark, a thick tube for absorbing nutrients is formed that connects the food sources through the shortest route. When the light-avoiding organism is partially illuminated, however, the tube connecting the food sources follows a different route. Defining risk as the experimentally measurable rate of light-avoiding movement, the minimum-risk path is exhibited by the organism, determined by integrating along the path. A model for an adaptive-tube network is presented that is in good agreement with the experimental observations.
Line-of-Sight Path Following for Dubins Paths with Adaptive Sideslip Compensation of Drift Forces
DEFF Research Database (Denmark)
Fossen, Thor Inge; Pettersen, Kristin Ytterstad; Galeazzi, Roberto
2015-01-01
guidance law is intended for maneuvering in the horizontal-plane at given speeds and typical applications are marine craft, autonomous underwater vehicles (AUVs), unmanned aerial vehicles (UAVs) as well as other vehicles and craft where the goal is to follow a predefined parametrized curve without time......We present a nonlinear adaptive path-following controller that compensates for drift forces through vehicle sideslip. Vehicle sideslip arises during path following when the vehicle is subject to drift forces caused by ocean currents, wind and waves. The proposed algorithm is motivated by a lineof...... constraints. Two vehicle cases studies are included to verify the theoretical results....
Robot path adaptation for shared human-robot workspaces
Zube, Angelika; Jung, A.; Frese, Christian
2014-01-01
In shared human-robot workspaces, safety has to be ensured by monitoring humans and other obstacles in the robot’s environment and by performing suitable robot motions to avoid collisions. In this contribution, information from multiple depth sensors is fused in an octree representing the current obstacles in consideration of occlusions. Based on this octree, the previously planned robot path is adapted using elastic bands in order to prevent collisions with humans.
Adaptation in protein fitness landscapes is facilitated by indirect paths
Wu, Nicholas C; Dai, Lei; Olson, C Anders; Lloyd-Smith, James O; Sun, Ren
2016-01-01
The structure of fitness landscapes is critical for understanding adaptive protein evolution. Previous empirical studies on fitness landscapes were confined to either the neighborhood around the wild type sequence, involving mostly single and double mutants, or a combinatorially complete subgraph involving only two amino acids at each site. In reality, the dimensionality of protein sequence space is higher (20L) and there may be higher-order interactions among more than two sites. Here we experimentally characterized the fitness landscape of four sites in protein GB1, containing 204 = 160,000 variants. We found that while reciprocal sign epistasis blocked many direct paths of adaptation, such evolutionary traps could be circumvented by indirect paths through genotype space involving gain and subsequent loss of mutations. These indirect paths alleviate the constraint on adaptive protein evolution, suggesting that the heretofore neglected dimensions of sequence space may change our views on how proteins evolve. DOI: http://dx.doi.org/10.7554/eLife.16965.001 PMID:27391790
Variance Analysis and Adaptive Sampling for Indirect Light Path Reuse
Institute of Scientific and Technical Information of China (English)
Hao Qin; Xin Sun; Jun Yan; Qi-Ming Hou; Zhong Ren; Kun Zhou
2016-01-01
In this paper, we study the estimation variance of a set of global illumination algorithms based on indirect light path reuse. These algorithms usually contain two passes — in the first pass, a small number of indirect light samples are generated and evaluated, and they are then reused by a large number of reconstruction samples in the second pass. Our analysis shows that the covariance of the reconstruction samples dominates the estimation variance under high reconstruction rates and increasing the reconstruction rate cannot effectively reduce the covariance. We also find that the covariance represents to what degree the indirect light samples are reused during reconstruction. This analysis motivates us to design a heuristic approximating the covariance as well as an adaptive sampling scheme based on this heuristic to reduce the rendering variance. We validate our analysis and adaptive sampling scheme in the indirect light field reconstruction algorithm and the axis-aligned filtering algorithm for indirect lighting. Experiments are in accordance with our analysis and show that rendering artifacts can be greatly reduced at a similar computational cost.
A morphological adaptation approach to path planning inspired by slime mould
Jones, Jeff
2015-04-01
Path planning is a classic problem in computer science and robotics which has recently been implemented in unconventional computing substrates such as chemical reaction-diffusion computers. These novel computing schemes utilise the parallel spatial propagation of information and often use a two-stage method involving diffusive propagation to discover all paths and a second stage to highlight or visualise the path between two particular points in the arena. The true slime mould Physarum polycephalum is known to construct efficient transport networks between nutrients in its environment. These networks are continuously remodelled as the organism adapts its body plan to changing spatial stimuli. It can be guided towards attractant stimuli (nutrients, warm regions) and it avoids locations containing hazardous stimuli (light irradiation, repellents, or regions occupied by predatory threats). Using a particle model of slime mould we demonstrate scoping experiments which explore how path planning may be performed by morphological adaptation. We initially demonstrate simple path planning by a shrinking blob of virtual plasmodium between two attractant sources within a polygonal arena. We examine the case where multiple paths are required and the subsequent selection of a single path from multiple options. Collision-free paths are implemented via repulsion from the borders of the arena. Finally, obstacle avoidance is implemented by repulsion from obstacles as they are uncovered by the shrinking blob. These examples show proof-of-concept results of path planning by morphological adaptation which complement existing research on path planning in novel computing substrates.
UCAV Path Planning by Fitness-Scaling Adaptive Chaotic Particle Swarm Optimization
Yudong Zhang; Lenan Wu; Shuihua Wang
2013-01-01
Path planning plays an extremely important role in the design of UCAVs to accomplish the air combat task fleetly and reliably. The planned path should ensure that UCAVs reach the destination along the optimal path with minimum probability of being found and minimal consumed fuel. Traditional methods tend to find local best solutions due to the large search space. In this paper, a Fitness-scaling Adaptive Chaotic Particle Swarm Optimization (FAC-PSO) approach was proposed as a fast and robust ...
Adaptive management of social-ecological systems: the path forward
Allen, Craig R.
2015-01-01
Adaptive management remains at the forefront of environmental management nearly 40 years after its original conception, largely because we have yet to develop other methodologies that offer the same promise. Despite the criticisms of adaptive management and the numerous failed attempts to implement it, adaptive management has yet to be replaced with a better alternative. The concept persists because it is simple, allows action despite uncertainty, and fosters learning. Moving forward, adaptive management of social-ecological systems provides policymakers, managers and scientists a powerful tool for managing for resilience in the face of uncertainty.
Adaptive Management of Social-Ecological Systems: The Path Forward
Adaptive management remains at the forefront of environmental management nearly 40 years after its original conception, largely because we have yet to develop other methodologies that offer the same promise. Despite the criticisms of adaptive management and the numerous failed at...
Hayes, Joanna L.; Rafaely, Boaz
2002-05-01
Hearing aid system modeling based on two-port network theory has been used previously to study the forward gain and the feedback path in hearing aids. The two-port modeling approach is employed in this work to develop an analytic model of the feedback path by reducing the model matrices to simplified analytic expressions. Such an analytic model can simulate the frequency response of the feedback path given the values of relatively few physical parameters such as vent dimensions. The model was extended to include variability in the feedback path due to slit leaks, for example. The analytic model was then incorporated in an adaptive feedback cancellation system, where the physical parameters of the model were adapted to match the actual feedback path and cancel the feedback signal. In the initial stage of this study, the ability of the model to match the frequency response of various measured feedback paths was studied using numerical optimization. Then, an adaptive filtering configuration based on the physical model was developed and studied using computer simulations. Results show that this new approach to adaptive feedback cancellation has the potential to improve both adaptation speed and performance robustness.
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.
Adaptive Deployment Scheme and Multi-path Routing Protocol for WMSNs
Directory of Open Access Journals (Sweden)
Enyan Sun
2013-09-01
Full Text Available Multi-path routing protocols have many advantages in wireless multimedia sensor networks. To succeed in setting up multiple paths in the wireless multimedia sensor network, the Adaptive Deployment Scheme of sensor Nodes which is based upon multi-path routing protocol (ADSN is proposed in the paper. ADSN deploys the sensor nodes on the basis of the number of paths, camera nodes’ positions and the sink’s position etc. Compared to the uniform deployment scheme, ADSN can save 67% sensor nodes when setting up multiple paths. And it can avoid the hotspot area in the vicinity of the sink. Energy Equalization Multi-path Routing protocol (EEMR can consume the energy of sensor nodes more evenly and extends the network lifetime compared to TPGF.
Adaptive feedback cancellation in hearing aids with clipping in the feedback path.
Freed, Daniel J
2008-03-01
Adaptive linear filtering algorithms are commonly used to cancel feedback in hearing aids. The use of these algorithms is based on the assumption that the feedback path is linear, so nonlinearities in the feedback path may affect performance. This study investigated the effect on feedback canceller performance of clipping of the feedback signal arriving at the microphone, as well as the benefit of applying identical clipping to the cancellation signal so that the cancellation path modeled the nonlinearity of the feedback path. Feedback signal clipping limited the amount of added stable gain that the feedback canceller could provide, and caused misadjustment in response to high-level inputs, by biasing adaptive filter coefficients toward lower magnitudes. Cancellation signal clipping mitigated these negative effects, permitting higher amounts of added stable gain and less misadjustment in response to high-level inputs, but the benefit was reduced in the presence of the highest-level inputs. PMID:18345849
An adaptation of Krylov subspace methods to path following
Energy Technology Data Exchange (ETDEWEB)
Walker, H.F. [Utah State Univ., Logan, UT (United States)
1996-12-31
Krylov subspace methods at present constitute a very well known and highly developed class of iterative linear algebra methods. These have been effectively applied to nonlinear system solving through Newton-Krylov methods, in which Krylov subspace methods are used to solve the linear systems that characterize steps of Newton`s method (the Newton equations). Here, we will discuss the application of Krylov subspace methods to path following problems, in which the object is to track a solution curve as a parameter varies. Path following methods are typically of predictor-corrector form, in which a point near the solution curve is {open_quotes}predicted{close_quotes} by some easy but relatively inaccurate means, and then a series of Newton-like corrector iterations is used to return approximately to the curve. The analogue of the Newton equation is underdetermined, and an additional linear condition must be specified to determine corrector steps uniquely. This is typically done by requiring that the steps be orthogonal to an approximate tangent direction. Augmenting the under-determined system with this orthogonality condition in a straightforward way typically works well if direct linear algebra methods are used, but Krylov subspace methods are often ineffective with this approach. We will discuss recent work in which this orthogonality condition is imposed directly as a constraint on the corrector steps in a certain way. The means of doing this preserves problem conditioning, allows the use of preconditioners constructed for the fixed-parameter case, and has certain other advantages. Experiments on standard PDE continuation test problems indicate that this approach is effective.
Adaptation in protein fitness landscapes is facilitated by indirect paths.
Wu, N.; Dai, L.; Olson, CA; Lloyd-Smith, JO; Sun, R
2016-01-01
The structure of fitness landscapes is critical for understanding adaptive protein evolution. Previous empirical studies on fitness landscapes were confined to either the neighborhood around the wild type sequence, involving mostly single and double mutants, or a combinatorially complete subgraph involving only two amino acids at each site. In reality, the dimensionality of protein sequence space is higher (20(L)) and there may be higher-order interactions among more than two sites. Here we e...
Wang, H.; Wang, D.; Peng, Z. H.
2016-01-01
This paper addresses the cooperative path-following problem of multiple marine surface vehicles subject to dynamical uncertainties and ocean disturbances induced by unknown wind, wave and ocean current. The control design falls neatly into two parts. One is to steer individual marine surface vehicle to track a predefined path and the other is to synchronise the along-path speed and path variables under the constraints of an underlying communication network. Within these two formulations, a robust adaptive path-following controller is first designed for individual vehicles based on backstepping and neural network techniques. Then, a decentralised synchronisation control law is derived by means of consensus on along-path speed and path variables based on graph theory. The distinct feature of this design lies in that synchronised path following can be reached for any undirected connected communication graphs without accurate knowledge of the model. This result is further extended to the output feedback case, where an observer-based cooperative path-following controller is developed without measuring the velocity of each vehicle. For both designs, rigorous theoretical analysis demonstrate that all signals in the closed-loop system are semi-global uniformly ultimately bounded. Simulation results validate the performance and robustness improvement of the proposed strategy.
Adaptive QoS Class Allocation Schemes in Multi-Domain Path-Based Networks
Ogino, Nagao; Nakamura, Hajime
MPLS-based path technology shows promise as a means of realizing reliable IP networks. Real-time services such as VoIP and video-conference supplied through a multi-domain MPLS network must be able to guarantee end-to-end QoS of the inter-domain paths. Thus, it is important to allocate an appropriate QoS class to the inter-domain paths in each domain traversed by the inter-domain paths. Because each domain has its own policy for QoS class allocation, it is necessary to adaptively allocate the optimum QoS class based on estimation of the QoS class allocation policies in other domains. This paper proposes two kinds of adaptive QoS class allocation schemes, assuming that the arriving inter-domain path requests include the number of downstream domains traversed by the inter-domain paths and the remaining QoS value toward the destination nodes. First, a measurement-based scheme, based on measurement of the loss rates of inter-domain paths in the downstream domains, is proposed. This scheme estimates the QoS class allocation policies in the downstream domains, using the measured loss rates of path requests. Second, a state-dependent type scheme, based on measurement of the arrival rates of path requests in addition to the loss rates of paths in the downstream domains, is also proposed. This scheme allows an appropriate QoS class to be allocated according to the domain state. This paper proposes an application of the Markov decision theory to the modeling of state-dependent type scheme. The performances of the proposed schemes are evaluated and compared with those of the other less complicated non-adaptive schemes using a computer simulation. The results of the comparison reveal that the proposed schemes can adaptively increase the number of inter-domain paths accommodated in the considered domain, even when the QoS class allocation policies change in the other domains and the arrival pattern of path requests varies in the considered domain.
Russell, Joanne; Mascher, Martin; Dawson, Ian K; Kyriakidis, Stylianos; Calixto, Cristiane; Freund, Fabian; Bayer, Micha; Milne, Iain; Marshall-Griffiths, Tony; Heinen, Shane; Hofstad, Anna; Sharma, Rajiv; Himmelbach, Axel; Knauft, Manuela; van Zonneveld, Maarten; Brown, John W S; Schmid, Karl; Kilian, Benjamin; Muehlbauer, Gary J; Stein, Nils; Waugh, Robbie
2016-09-01
After domestication, during a process of widespread range extension, barley adapted to a broad spectrum of agricultural environments. To explore how the barley genome responded to the environmental challenges it encountered, we sequenced the exomes of a collection of 267 georeferenced landraces and wild accessions. A combination of genome-wide analyses showed that patterns of variation have been strongly shaped by geography and that variant-by-environment associations for individual genes are prominent in our data set. We observed significant correlations of days to heading (flowering) and height with seasonal temperature and dryness variables in common garden experiments, suggesting that these traits were major drivers of environmental adaptation in the sampled germplasm. A detailed analysis of known flowering-associated genes showed that many contain extensive sequence variation and that patterns of single- and multiple-gene haplotypes exhibit strong geographical structuring. This variation appears to have substantially contributed to range-wide ecogeographical adaptation, but many factors key to regional success remain unidentified. PMID:27428750
Walking on an Oscillating Treadmill: Two Paths to Functional Adaptation
Brady, Rachel A.; Peters, Brian T.; Bloomberg, Jacob J.
2010-01-01
We mounted a treadmill on top of a six degree-of-freedom motion base platform to investigate and characterize locomotor responses produced by healthy adults when introduced to a novel walking condition. Subjects were classified into two groups according to how their stride times were affected by the perturbation. Our data suggest that a person's choice of adaptation strategy is influenced by the relationship between his unique, natural stride frequency and the external frequency imposed by the motion base. Our data suggest that a person's stride time response while walking on a laterally oscillating treadmill is influenced by the relationship between his unique, natural stride frequency and the imposed external frequency of the motion base. This relationship may be useful for checking the efficacy of gait training and rehabilitation programs. Preselecting and manipulating a person's EST could be one way to draw him out of his preferred "entrainment well" during therapy or training.
Thanatosis as an adaptive male mating strategy in the nuptial gift-giving spider Pisaura mirabilis
DEFF Research Database (Denmark)
Hansen, Line S.; Gonzalez, Sofía F.; Toft, Søren;
2008-01-01
(death feigning). Thanatosis in a sexual context is exceptional and was suggested to function as an antipredation strategy toward potentially cannibalistic females. If thanatosis serves as a protection strategy, males should death feign in response to female aggression or when they are more vulnerable...... vulnerability increased the propensity of males to perform thanatosis. Instead, death-feigning males were more successful in obtaining copulations and gained longer copulations. Hence, our results suggest that thanatosis functions as an adaptive male mating strategy to overcome female resistance. All males were...... capable of performing thanatosis although some males use it more frequently than others, suggesting a cost of death feigning which maintains the variation in thanatosis during courtship....
Khoubrouy, Soudeh A; Panahi, Issa M S
2011-01-01
Various methods have been proposed to overcome the problem of compensating the acoustic feedback path that negatively impacts the performance of hearing aid devices. However, in most of them feedback path model is assumed to be fixed which is not quite realistic. In this paper, we consider fixed and variable feedback paths and analyze for each case the performance of one of the robust Adaptive Feedback Cancellation (AFC) schemes, i.e. the Prediction Error Method AFC which uses Partitioned Block Frequency-Domain Normalized Least Mean Square (PBFD-NLMS) algorithm. Based on the analysis results we propose varying the step size values for the same adaptive algorithm on the fly by monitoring the misalignment criteria. The experimental results using the proposed method show improvement made on the system performance. PMID:22256175
Non-common path aberration correction in an adaptive optics scanning ophthalmoscope.
Sulai, Yusufu N; Dubra, Alfredo
2014-09-01
The correction of non-common path aberrations (NCPAs) between the imaging and wavefront sensing channel in a confocal scanning adaptive optics ophthalmoscope is demonstrated. NCPA correction is achieved by maximizing an image sharpness metric while the confocal detection aperture is temporarily removed, effectively minimizing the monochromatic aberrations in the illumination path of the imaging channel. Comparison of NCPA estimated using zonal and modal orthogonal wavefront corrector bases provided wavefronts that differ by ~λ/20 in root-mean-squared (~λ/30 standard deviation). Sequential insertion of a cylindrical lens in the illumination and light collection paths of the imaging channel was used to compare image resolution after changing the wavefront correction to maximize image sharpness and intensity metrics. Finally, the NCPA correction was incorporated into the closed-loop adaptive optics control by biasing the wavefront sensor signals without reducing its bandwidth.
Online adaptation of path formation in UAV search-and-identify missions
Willigen, W.H. van; Schut, M.C.; Eiben, A.E.; Kester, L.J.H.M.
2011-01-01
In this paper, we propose a technique for optimisation and online adaptation of search paths of unmanned aerial vehicles (UAVs) in search-and-identify missions. In these missions, a UAV has the objective to search for targets and to identify those. We extend earlier work that was restricted to offli
A note on "Multicriteria adaptive paths in stochastic, time-varying networks"
DEFF Research Database (Denmark)
Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan
In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property...
Eckstrand, Kristen L; Potter, Jennifer; Bayer, Carey Roth; Englander, Robert
2016-07-01
Delineating the requisite competencies of a 21st-century physician is the first step in the paradigm shift to competency-based medical education. Over the past two decades, more than 150 lists of competencies have emerged. In a synthesis of these lists, the Physician Competency Reference Set (PCRS) provided a unifying framework of competencies that define the general physician. The PCRS is not context or population specific; however, competently caring for certain underrepresented populations or specific medical conditions can require more specific context. Previously developed competency lists describing care for these populations have been disconnected from an overarching competency framework, limiting their uptake. To address this gap, the Association of American Medical Colleges Advisory Committee on Sexual Orientation, Gender Identity, and Sex Development adapted the PCRS by adding context- and content-specific qualifying statements to existing PCRS competencies to better meet the needs of diverse patient populations. This Article describes the committee's process in developing these qualifiers of competence. To facilitate widespread adoption of the contextualized competencies in U.S. medical schools, the committee used an established competency framework to develop qualifiers of competence to improve the health of individuals who are lesbian, gay, bisexual, transgender; gender nonconforming; or born with differences in sexual development. This process can be applied to other underrepresented populations or medical conditions, ensuring that relevant topics are included in medical education and, ultimately, health care outcomes are improved for all patients inclusive of diversity, background, and ability. PMID:26796092
Eckstrand, Kristen L.; Potter, Jennifer; Bayer, Carey Roth; Englander, Robert
2016-01-01
Delineating the requisite competencies of a 21st-century physician is the first step in the paradigm shift to competency-based medical education. Over the past two decades, more than 150 lists of competencies have emerged. In a synthesis of these lists, the Physician Competency Reference Set (PCRS) provided a unifying framework of competencies that define the general physician. The PCRS is not context or population specific; however, competently caring for certain underrepresented populations or specific medical conditions can require more specific context. Previously developed competency lists describing care for these populations have been disconnected from an overarching competency framework, limiting their uptake. To address this gap, the Association of American Medical Colleges Advisory Committee on Sexual Orientation, Gender Identity, and Sex Development adapted the PCRS by adding context- and content-specific qualifying statements to existing PCRS competencies to better meet the needs of diverse patient populations. This Article describes the committee’s process in developing these qualifiers of competence. To facilitate widespread adoption of the contextualized competencies in U.S. medical schools, the committee used an established competency framework to develop qualifiers of competence to improve the health of individuals who are lesbian, gay, bisexual, transgender; gender nonconforming; or born with differences in sexual development. This process can be applied to other underrepresented populations or medical conditions, ensuring that relevant topics are included in medical education and, ultimately, health care outcomes are improved for all patients inclusive of diversity, background, and ability. PMID:26796092
Eckstrand, Kristen L; Potter, Jennifer; Bayer, Carey Roth; Englander, Robert
2016-07-01
Delineating the requisite competencies of a 21st-century physician is the first step in the paradigm shift to competency-based medical education. Over the past two decades, more than 150 lists of competencies have emerged. In a synthesis of these lists, the Physician Competency Reference Set (PCRS) provided a unifying framework of competencies that define the general physician. The PCRS is not context or population specific; however, competently caring for certain underrepresented populations or specific medical conditions can require more specific context. Previously developed competency lists describing care for these populations have been disconnected from an overarching competency framework, limiting their uptake. To address this gap, the Association of American Medical Colleges Advisory Committee on Sexual Orientation, Gender Identity, and Sex Development adapted the PCRS by adding context- and content-specific qualifying statements to existing PCRS competencies to better meet the needs of diverse patient populations. This Article describes the committee's process in developing these qualifiers of competence. To facilitate widespread adoption of the contextualized competencies in U.S. medical schools, the committee used an established competency framework to develop qualifiers of competence to improve the health of individuals who are lesbian, gay, bisexual, transgender; gender nonconforming; or born with differences in sexual development. This process can be applied to other underrepresented populations or medical conditions, ensuring that relevant topics are included in medical education and, ultimately, health care outcomes are improved for all patients inclusive of diversity, background, and ability.
Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States
Liu, Keqin
2012-01-01
We consider the adaptive shortest-path routing problem in wireless networks under unknown and stochastically varying link states. In this problem, we aim to optimize the quality of communication between a source and a destination through adaptive path selection. Due to the randomness and uncertainties in the network dynamics, the quality of each link varies over time according to a stochastic process with unknown distributions. After a path is selected for communication, the aggregated quality of all links on this path (e.g., total path delay) is observed. The quality of each individual link is not observable. We formulate this problem as a multi-armed bandit with dependent arms. We show that by exploiting arm dependencies, a regret polynomial with network size can be achieved while maintaining the optimal logarithmic order with time. This is in sharp contrast with the exponential regret order with network size offered by a direct application of the classic MAB policies that ignore arm dependencies. Furthermo...
Boz, Utku; Basdogan, Ipek
2015-12-01
Structural vibrations is a major cause for noise problems, discomfort and mechanical failures in aerospace, automotive and marine systems, which are mainly composed of plate-like structures. In order to reduce structural vibrations on these structures, active vibration control (AVC) is an effective approach. Adaptive filtering methodologies are preferred in AVC due to their ability to adjust themselves for varying dynamics of the structure during the operation. The filtered-X LMS (FXLMS) algorithm is a simple adaptive filtering algorithm widely implemented in active control applications. Proper implementation of FXLMS requires availability of a reference signal to mimic the disturbance and model of the dynamics between the control actuator and the error sensor, namely the secondary path. However, the controller output could interfere with the reference signal and the secondary path dynamics may change during the operation. This interference problem can be resolved by using an infinite impulse response (IIR) filter which considers feedback of the one or more previous control signals to the controller output and the changing secondary path dynamics can be updated using an online modeling technique. In this paper, IIR filtering based filtered-U LMS (FULMS) controller is combined with online secondary path modeling algorithm to suppress the vibrations of a plate-like structure. The results are validated through numerical and experimental studies. The results show that the FULMS with online secondary path modeling approach has more vibration rejection capabilities with higher convergence rate than the FXLMS counterpart.
Assessment of Service Protocols Adaptability Using a Novel Path Computation Technique
Zhou, Zhangbing; Bhiri, Sami; Haller, Armin; Zhuge, Hai; Hauswirth, Manfred
In this paper we propose a new kind of adaptability assessment that determines whether service protocols of a requestor and a provider are adaptable, computes their adaptation degree, and identifies conditions that determine when they can be adapted. We also propose a technique that implements this adaptability assessment: (1) we construct a complete adaptation graph that captures all service interactions adaptable between these two service protocols. The emptiness or non-emptiness of this graph corresponds to the fact that whether or not they are adaptable; (2) we propose a novel path computation technique to generate all instance sub-protocols which reflect valid executions of a particular service protocol, and to derive all instance sub-protocol pairs captured by the complete adaptation graph. An adaptation degree is computed as a ratio between the number of instance sub-protocols captured by these instance sub-protocol pairs with respect to a service protocol and that of this service protocol; (3) and finally we identify a set of conditions based on these instance sub-protocol pairs. A condition is the conjunction of all conditions specified on the transitions of a given pair of instance sub-protocols. This assessment is a comprehensive means of selecting the suitable service protocol among functionally-equivalent candidates according to the requestor's business requirements.
Institute of Scientific and Technical Information of China (English)
Liu Wei; Zheng Zheng; Cai Kaiyuan
2013-01-01
This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs' relevant performances,with respect to sensory capability,maneuverability,and flight velocity limit.On the basis of a novel adaptability-involved problem statement,bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization.Additionally,both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability.A discrete-search-based path planning solution,embedded with four optimization strategies,is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces,within which different surface-to-air missiles (SAMs) are deployed.Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner,and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.
Aircraft-on-ground path following control by dynamical adaptive backstepping
Institute of Scientific and Technical Information of China (English)
Chen Bihua; Jiao Zongxia; Shuzhi Sam Ge
2013-01-01
The necessity of improving the air traffic and reducing the aviation emissions drives to investigate automatic steering for aircraft to effectively roll on the ground.This paper addresses the path following control problem of aircraft-on-ground and focuses on the task that the aircraft is required to follow the desired path on the runway by nose wheel automatic steering.The proposed approach is based on dynamical adaptive backstepping so that the system model does not have to be transformed into a canonical triangular form which is necessary in conventional backstepping design.This adaptive controller performs well despite the lack of information on the aerodynamic load and the tire cornering stiffness parameters.Simulation results clearly demonstrate the advantages and effectiveness of the proposed approach.
An Approach for Self-Adaptive Path Loss Modelling for Positioning in Underground Environments
Directory of Open Access Journals (Sweden)
Evgeny Osipov
2016-01-01
Full Text Available This paper proposes a real-time self-adaptive approach for accurate path loss estimation in underground mines or tunnels based on signal strength measurements from heterogeneous radio communication technologies. The proposed model features simplicity of implementation. The methodology is validated in simulations and verified by measurements taken in real environments. The proposed method leverages accuracy of positioning matching the existing approaches while requiring smaller engineering efforts.
Directory of Open Access Journals (Sweden)
Francesco Colace
2014-03-01
Full Text Available The E-Learning is becoming an effective approach for the improving of quality of learning. Many institutions are adopting this approach both to improve their traditional courses both to increase the potential audience. In the last period great attention is paid in the introduction of methodologies and techniques for the adaptation of learning process to the real needs of students. In this scenario the Adaptive Educational Hypermedia System can be an effective approach. Adaptive hypermedia is a promising area of research at the crossroads of hypermedia and adaptive systems. One of the most important fields where this approach can be applied is just the e-Learning. In this context the adaptive learning resources selection and sequencing is recognized as among one of the most interesting research questions. An Adaptive Educational Hypermedia System is composed by services for the management of the Knowledge Space, the definition of a User Model, the observation of student during his learning period and, as previously said, the adaptation of the learning path according to the real needs of the students. In particular the use of ontologyཿs formalism for the modeling of the ཿknowledge space related to the course can increase the sharable of learning objects among similar courses or better contextualize their role in the course. This paper addresses the design problem of an Adaptive hypermedia system by the definition of methodologies able to manage each its components, In particular an original user, learning contents, tracking strategies and adaptation model are developed. The proposed Adaptive Educational Hypermedia System has been integrated in an e-Learning platform and an experimental campaign has been conducted. In particular the proposed approach has been introduced in three different blended courses. A comparison with traditional approach has been described and the obtained results seem to be very promising.
Directory of Open Access Journals (Sweden)
Barış Fidan
2015-12-01
Full Text Available Accurate signal-source and signal-reflector target localization tasks via mobile sensory units and wireless sensor networks (WSNs, including those for environmental monitoring via sensory UAVs, require precise knowledge of specific signal propagation properties of the environment, which are permittivity and path loss coefficients for the electromagnetic signal case. Thus, accurate estimation of these coefficients has significant importance for the accuracy of location estimates. In this paper, we propose a geometric cooperative technique to instantaneously estimate such coefficients, with details provided for received signal strength (RSS and time-of-flight (TOF-based range sensors. The proposed technique is integrated to a recursive least squares (RLS-based adaptive localization scheme and an adaptive motion control law, to construct adaptive target localization and adaptive target tracking algorithms, respectively, that are robust to uncertainties in aforementioned environmental signal propagation coefficients. The efficiency of the proposed adaptive localization and tracking techniques are both mathematically analysed and verified via simulation experiments.
APF-guided adaptive immune network algorithm for robot path planning
Institute of Scientific and Technical Information of China (English)
Mingxin YUAN; Sunan WANG; Canyang WU; Kunpeng LI
2009-01-01
Inspired by the mechanism of Jerne's idiotypic network hypothesis, a new adaptive immune network algorithm (AINA) is presented through the stimulation and suppression between the antigen and antibody by taking the environment and robot behavior as antigen and antibody respectively. A guiding weight is defined based on the artificial potential field (APF) method, and the guiding weight is combined with antibody vitality to construct a new antibody selection operator, which improves the searching efficiency. In addition, an updating operator of antibody vi-tality is provided based on the Baldwin effect, which results in a positive feedback mechanism of search and accelerates the convergence of the immune network. The simulation and experimental results show that the proposed algorithm is characterized by high searching speed, good convergence performance and strong planning ability, which solves the path planning well in complicated environments.
Transverse Pupil Shifts for Adaptive Optics Non-Common Path Calibration
Bloemhof, Eric E.
2011-01-01
A simple new way of obtaining absolute wavefront measurements with a laboratory Fizeau interferometer was recently devised. In that case, the observed wavefront map is the difference of two cavity surfaces, those of the mirror under test and of an unknown reference surface on the Fizeau s transmission flat. The absolute surface of each can be determined by applying standard wavefront reconstruction techniques to two grids of absolute surface height differences of the mirror under test, obtained from pairs of measurements made with slight transverse shifts in X and Y. Adaptive optics systems typically provide an actuated periscope between wavefront sensor (WFS) and commonmode optics, used for lateral registration of deformable mirror (DM) to WFS. This periscope permits independent adjustment of either pupil or focal spot incident on the WFS. It would be used to give the required lateral pupil motion between common and non-common segments, analogous to the lateral shifts of the two phase contributions in the lab Fizeau. The technique is based on a completely new approach to calibration of phase. It offers unusual flexibility with regard to the transverse spatial frequency scales probed, and will give results quite quickly, making use of no auxiliary equipment other than that built into the adaptive optics system. The new technique may be applied to provide novel calibration information about other optical systems in which the beam may be shifted transversely in a controlled way.
Determining paths by which farmers can adapt effectively to scarce freshwater resources
Watson, R.; Hornberger, G.; Carrico, A. R.
2012-12-01
Stress on freshwater resources is a significant risk associated with climatic change. The risk is even greater given the expected changes in overall resource use as the developing world develops, as the world's population continues to grow, and as land use changes dramatically. Effective water management has implications for food security, health, and political stability worldwide. This is particularly true in developing regions heavily dependent on agriculture, and where agriculture depends on irrigation. Adaptation to water stress requires both managing water allocation among competing users and ensuring that each user is efficient in his or her use of a limited allotment: the problem is a quintessential common-pool resource (CPR) dilemma. In the future even more so than in the past, adaptation will be essential as the world evolves. The problem that we identify—determining paths by which farmers can adapt effectively to increasingly scarce freshwater resources—is one of great scientific and societal importance. The issue lies at the intersection of water-cycle processes and social-psychological processes that influence and are influenced by water availability and use. This intersection harbors intriguing unresolved scientific questions; advances in natural and social sciences will stem from attacks on the overall problem. The issue is societally compelling because the ability of the world to supply adequate food for a population expected to grow to over 9 billion by 2050 may well be determined by how farmers, consumers, and government institutions adapt to changing conditions of water availability. Major strides have been made in recent decades in understanding why Hardin's envisioned "tragedy of the commons" is avoided under certain circumstances, in some cases through self-organization rather than government intervention originally considered a necessity. Furthermore, we now know that the impacts of decisions about allocation and use of water can be
Agarwal, Animesh
2015-01-01
Quantum effects due to the spatial delocalization of light atoms are treated in molecular simulation via the path integral technique. Among several methods, Path Integral (PI) Molecular Dynamics (MD) is nowadays a powerful tool to investigate properties induced by spatial delocalization of atoms; however computationally this technique is very demanding. The abovementioned limitation implies the restriction of PIMD applications to relatively small systems and short time scales. One possible solution to overcome size and time limitation is to introduce PIMD algorithms into the Adaptive Resolution Simulation Scheme (AdResS). AdResS requires a relatively small region treated at path integral level and embeds it into a large molecular reservoir consisting of generic spherical coarse grained molecules. It was previously shown that the realization of the idea above, at a simple level, produced reasonable results for toy systems or simple/test systems like liquid parahydrogen. Encouraged by previous results, in this ...
Gehb, C. M.; Platz, R.; Melz, T.
2016-09-01
Load-bearing structures with kinematic functions enable and disable degrees of freedom and are part of many mechanical engineering applications. The relative movement between a wheel and the body of a car or a landing gear and an aircraft fuselage are examples for load-bearing systems with defined kinematics. In most cases, the load is transmitted through a predetermined load path to the structural support interfaces. However, unexpected load peaks or varying health condition of the system's supports, which means for example varying damping and stiffness characteristics, may require an active adjustment of the load path. However, load paths transmitted through damaged or weakened supports can be the reason for reduced comfort or even failure. In this paper a simplified 2D two mass oscillator with two supports is used to numerically investigate the potential of controlled adaptive auxiliary kinematic guidance elements in a load-bearing structure to adapt the load path depending on the stiffness change, representing damage of the supports. The aim is to provide additional forces in the auxiliary kinematic guidance elements for two reasons. On the one hand, one of the two supports that may become weaker through stiffness change will be relieved from higher loading. On the other hand, tilting due to different compliance in the supports will be minimized. Therefore, shifting load between the supports during operation could be an effective option.
Fuchs, Gerhard; Hinderer, Nele; Kungl, Gregor; Neukirch, Mario
2012-01-01
"Since the proclamation of the German 'Energiewende' by the Federal Government in 2011, the transition of the energy supply system has accelerated. In 2011, the 'Helmholtz-Alliance' - 'ENERGY TRANS - Future Infrastructures for Meeting Energy Demands. Towards Sustainability and Social Compatibility" - was launched to perform an interdisciplinary analysis of the social challenges presented by the energy transition. The study presented here, 'Adaptive Capacities, Path Creation, and Variants o...
Ellis, Mark
1997-01-01
This is part of a series of books, which gives training in key business communication skills. Emphasis is placed on building awareness of language appropriateness and fluency in typical business interactions. This new edition is in full colour.
Zhang, Jiayong; Zhang, Hongwu; Ye, Hongfei; Zheng, Yonggang
2016-09-01
A free-end adaptive nudged elastic band (FEA-NEB) method is presented for finding transition states on minimum energy paths, where the energy barrier is very narrow compared to the whole paths. The previously proposed free-end nudged elastic band method may suffer from convergence problems because of the kinks arising on the elastic band if the initial elastic band is far from the minimum energy path and weak springs are adopted. We analyze the origin of the formation of kinks and present an improved free-end algorithm to avoid the convergence problem. Moreover, by coupling the improved free-end algorithm and an adaptive strategy, we develop a FEA-NEB method to accurately locate the transition state with the elastic band cut off repeatedly and the density of images near the transition state increased. Several representative numerical examples, including the dislocation nucleation in a penta-twinned nanowire, the twin boundary migration under a shear stress, and the cross-slip of screw dislocation in face-centered cubic metals, are investigated by using the FEA-NEB method. Numerical results demonstrate both the stability and efficiency of the proposed method. PMID:27608986
The optimal paths of climate change mitigation and adaptation under certainty and uncertainty
Felgenhauer, T.; Bruin, de K.C.
2009-01-01
Tradeoffs between climate change mitigation and adaptation policies are explored under both certainty and uncertainty with learning using a numerical two-period decision model. We first replicate a version of the Adaptation in DICE climate model (AD-DICE) (de Bruin et al., 2009), which modifies the
Adaptive Gait Control for a Quadruped Robot on 3D Path Planning
Igarashi, Hiroshi; Kakikura, Masayoshi
A legged walking robot is able to not only move on irregular terrain but also change its posture. For example, the robot can pass under overhead obstacles by crouching. The purpose of our research is to realize efficient path planning with a quadruped robot. Therefore, the path planning is expected to extended in three dimensions because of the mobility. However, some issues of the quadruped robot, which are instability, workspace limitation, deadlock and slippage, complicate realizing such application. In order to improve these issues and reinforce the mobility, a new static gait pattern for a quadruped robot, called TFG: Trajectory Following Gait, is proposed. The TFG intends to obtain high controllability like a wheel robot. Additionally, the TFG allows to change it posture during the walk. In this paper, some experimental results show that the TFG improves the issues and it is available for efficient locomotion in three dimensional environment.
Energy Technology Data Exchange (ETDEWEB)
Agarwal, Animesh, E-mail: animesh@zedat.fu-berlin.de; Delle Site, Luigi, E-mail: dellesite@fu-berlin.de [Institute for Mathematics, Freie Universität Berlin, Berlin (Germany)
2015-09-07
Quantum effects due to the spatial delocalization of light atoms are treated in molecular simulation via the path integral technique. Among several methods, Path Integral (PI) Molecular Dynamics (MD) is nowadays a powerful tool to investigate properties induced by spatial delocalization of atoms; however, computationally this technique is very demanding. The above mentioned limitation implies the restriction of PIMD applications to relatively small systems and short time scales. One of the possible solutions to overcome size and time limitation is to introduce PIMD algorithms into the Adaptive Resolution Simulation Scheme (AdResS). AdResS requires a relatively small region treated at path integral level and embeds it into a large molecular reservoir consisting of generic spherical coarse grained molecules. It was previously shown that the realization of the idea above, at a simple level, produced reasonable results for toy systems or simple/test systems like liquid parahydrogen. Encouraged by previous results, in this paper, we show the simulation of liquid water at room conditions where AdResS, in its latest and more accurate Grand-Canonical-like version (GC-AdResS), is merged with two of the most relevant PIMD techniques available in the literature. The comparison of our results with those reported in the literature and/or with those obtained from full PIMD simulations shows a highly satisfactory agreement.
International Nuclear Information System (INIS)
Quantum effects due to the spatial delocalization of light atoms are treated in molecular simulation via the path integral technique. Among several methods, Path Integral (PI) Molecular Dynamics (MD) is nowadays a powerful tool to investigate properties induced by spatial delocalization of atoms; however, computationally this technique is very demanding. The above mentioned limitation implies the restriction of PIMD applications to relatively small systems and short time scales. One of the possible solutions to overcome size and time limitation is to introduce PIMD algorithms into the Adaptive Resolution Simulation Scheme (AdResS). AdResS requires a relatively small region treated at path integral level and embeds it into a large molecular reservoir consisting of generic spherical coarse grained molecules. It was previously shown that the realization of the idea above, at a simple level, produced reasonable results for toy systems or simple/test systems like liquid parahydrogen. Encouraged by previous results, in this paper, we show the simulation of liquid water at room conditions where AdResS, in its latest and more accurate Grand-Canonical-like version (GC-AdResS), is merged with two of the most relevant PIMD techniques available in the literature. The comparison of our results with those reported in the literature and/or with those obtained from full PIMD simulations shows a highly satisfactory agreement
Perner, M.; Monner, H. P.; Krombholz, C.; Kruse, F. F.
2015-04-01
Smart fiber placement is an ambitious topic in current research for automated manufacturing of large-scale composite structures, e.g. wing covers. Adaptive systems get in focus to obtain a high degree of observability and controllability of the manufacturing process. In particular, vibrational issues and material failure have to be studied to significantly increase the production rate with no loss in accuracy of the fiber layup. As one contribution, an adaptive system has been developed to be integrated into the fiber placement head. It decouples the compaction roller from disturbances caused by misalignments, varying components' behavior over a large work area and acceleration changes during operation. Therefore, the smart system axially adapts the position of the compaction roller in case of disturbances. This paper investigates the behavior of the system to compensate quasi-static deviations from the desired path. In particular, the compensation efficiency of a constant offset, a linear drift with constant gradient and a single-curved drift is studied. Thus, the test bed with measurement devices and scenarios is explained. Based on the knowledge obtained by the experimental data, the paper concludes with a discussion of the proposed approach for its use under operating conditions and further implementation.
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
to a simulated sixlegged artificial agent. Input signals from an allothetic compass and odometry are sustained through leaky neural integrator circuits, which are then used to compute the home vector by local excitation-global inhibition interactions. The home vector is computed and represented in circular...... arrays of neurons, where compass directions are population-coded and linear displacements are rate-coded. The mechanism allows for robust homing behavior in the presence of external sensory noise. The emergent behavior of the controlled agent does not only show a robust solution for the problem......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...
Kreis, Karsten; Tuckerman, Mark E; Donadio, Davide; Kremer, Kurt; Potestio, Raffaello
2016-07-12
Quantum delocalization of atomic nuclei affects the physical properties of many hydrogen-rich liquids and biological systems even at room temperature. In computer simulations, quantum nuclei can be modeled via the path-integral formulation of quantum statistical mechanics, which implies a substantial increase in computational overhead. By restricting the quantum description to a small spatial region, this cost can be significantly reduced. Herein, we derive a bottom-up, rigorous, Hamiltonian-based scheme that allows molecules to change from quantum to classical and vice versa on the fly as they diffuse through the system, both reducing overhead and making quantum grand-canonical simulations possible. The method is validated via simulations of low-temperature parahydrogen. Our adaptive resolution approach paves the way to efficient quantum simulations of biomolecules, membranes, and interfaces. PMID:27214610
Progress in Adaptive Immunotherapy for Cancer in Companion Animals: Success on the Path to a Cure
Directory of Open Access Journals (Sweden)
Katie L. Anderson
2015-10-01
Full Text Available Harnessing the ability of the immune system to eradicate cancer has been a long-held goal of oncology. Work from the last two decades has finally brought immunotherapy into the forefront for cancer treatment, with demonstrable clinical success for aggressive tumors where other therapies had failed. In this review, we will discuss a range of therapies that are in different stages of clinical or preclinical development for companion animals with cancer, and which share the common objective of eliciting adaptive, anti-tumor immune responses. Even though challenges remain, manipulating the immune system holds significant promise to create durable responses and improve outcomes in companion animals with cancer. Furthermore, what we learn from this process will inform and accelerate development of comparable therapies for human cancer patients.
Complex Adaptive Immunity to enteric fevers in humans: Lessons learned and the path forward
Directory of Open Access Journals (Sweden)
Marcelo B. Sztein
2014-10-01
Full Text Available Salmonella enterica serovar Typhi (S. Typhi, the causative agent of typhoid fever, and S. Paratyphi A and B, causative agents of paratyphoid fever, are major public health threats throughout the world. Although two licensed typhoid vaccines are currently available, they are only moderately protective and immunogenic necessitating the development of novel vaccines. A major obstacle in the development of improved typhoid, as well as paratyphoid vaccines is the lack of known immunological correlates of protection in humans. Considerable progress has been made in recent years in understanding the complex adaptive host responses against S. Typhi. Although the induction of S. Typhi-specific antibodies (including their functional properties and memory B cells, as well as their cross-reactivity with S. Paratyphi A and S. Paratyphi B has been shown, the role of humoral immunity in protection remains undefined. Cell mediated immunity (CMI is likely to play a dominant role in protection against enteric fever pathogens. Detailed measurements of CMI performed in volunteers immunized with attenuated strains of S. Typhi have shown, among others, the induction of lymphoproliferation, multifunctional type 1 cytokine production and CD8+ cytotoxic T cell responses. In addition to systemic responses, the local microenvironment of the gut is likely to be of paramount importance in protection from these infections. In this review we will critically assess current knowledge regarding the role of CMI and humoral immunity following natural S. Typhi and S. Paratyphi infections, experimental challenge, and immunization in humans. We will also address recent advances regarding cross-talk between the host’s gut microbiota and immunization with attenuated S. Typhi, mechanisms of systemic immune responses, and the homing potential of S. Typhi-specific B and T cells to the gut and other tissues.
Baek, Jang Woon; Nam, Young Jin; Seo, Dae-Wha
Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k > 1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.
Dynamic Adaptive RRT Path Planning Algorithm%动态自适应快速扩展树航迹规划算法研究
Institute of Scientific and Technical Information of China (English)
潘广贞; 秦帆; 张文斌
2013-01-01
快速扩展随机树(RRT)是航迹规划的重要算法,针对其难以直接应用于无人机航迹规划的问题,提出了动态自适应RRT算法.动态自适应RRT算法在随机点产生过程中加入无人机转弯角约束,使航迹更适合无人机直接跟踪；同时引入动态调节因子,根据环境中障碍密集程度调整规划步长,有效避免各类障碍.计算机实验结果表明动态自适应RRT算法在单航迹规划和多航迹规划中明显优于基本RRT算法和其它改进RRT算法,更适用于无人机航迹规划.%RRT is the important path planning algorithm. In view of its difficult to directly apply in UAVS path planning, this paper puts forwards the dynamic adaptive RRT algorithm. Adding turn corner constraints in the process of random point produce in order to make track for UAVS tracking more directly. At the same time, introduce dynamic adjustment factor, according to the environment of intensive degree to adjust the planning step length and avoid all kinds of barriers effectively. The computer experimental results show that the dynamic adaptive RRT algorithm in single path planning and more significantly than the basic path planning algorithm and other improvements RRT RRT algorithm, more applicable for UAVS path planning.
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....
Directory of Open Access Journals (Sweden)
Fumio Mizuno
2011-10-01
Full Text Available To investigate flexible adaptation of visual system, we developed a system to provide a user an artificial oculomotor function to control directions of both eyes. The system named “Virtual Chameleon” consists of two CCD cameras independently controlled and a head-mounted display. The user can control each tracking directions of two cameras with sensors set to both hands so that the user can get independent arbitrary view fields for both eyes. We performed fundamental experiments to evaluate capability to evaluate adaptation to use of Virtual Chameleon and effects on the user's capabilities. Eleven healthy volunteers with normal and corrected-to-normal vision participated in the experiments. The experiments were tests to find out each position of targets put in both side of a subject. In the experiments, a condition using Virtual Chameleon and a condition without it was adopted. We obtained accuracy rates and time intervals to find out target positions as experimental results. The experiments showed all of volunteers became able to actively control independent visual axes and correctly understood two different views by using Virtual Chameleon, even though two independent view fields yielded binocular rivalry to volunteers and binocular rivalry reduced human capabilities compared to cases without Virtual Chameleon.
适应性学习路径推荐算法及应用研究%Recommendation Algorithm and Application of Adaptive Learning Path
Institute of Scientific and Technical Information of China (English)
赵呈领; 陈智慧; 黄志芳
2015-01-01
在适应性学习路径推荐中，推荐算法起着至关重要的作用。本研究从算法性质的角度归类，将学习路径推荐系统中的推荐算法归为三大类：智能优化算法、数据挖掘算法以及基于知识的推荐算法。结合已开发的学习路径推荐系统，本文从算法性能、学习路径推荐中考虑的因素及算法应用三方面进行比较与分析，总结出上述推荐算法在学习路径推荐中的应用策略和应用中的优势及不足，最后探讨了学习路径推荐的实践应用价值，以期为适应性学习路径推荐领域的研究提供有价值的参考与借鉴。%In the adaptive learning path recommendation, the recommendation algorithm plays a vital role. From the perspective of the nature of algorithm, the recommendation algorithm in learning path recommendation system are grouped into three categories:swarm intelligence optimization algorithm, data mining algorithms and knowledge-based recommendation algorithm. Combined with the developed recommendation system, the paper compared and analyzed from three aspects including performance of the algorithm, the parameter settings in the learning path recommendation and the application. the paper summarized the application strategies of relevant algorithm in the learning path recommendation, as well as the strengths and weaknesses in the application, and discussed the practical application value of learning path recommendation to provide valuable information and reference for research in the ifeld of adaptive learning path recommendation.
Physarum Can Compute Shortest Paths
Bonifaci, Vincenzo; Varma, Girish
2011-01-01
A mathematical model has been proposed by biologists to describe the feedback mechanism used by the Physarum Polycephalum slime mold to adapt its tubular channels while foraging two food sources $s_0$ and $s_1$. We give a proof of the fact that, under this model, the mass of the mold will eventually converge to the shortest $s_0$-$s_1$ path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by the biologists and can be seen as an example of a "natural algorithm", that is, an algorithm developed by evolution over millions of years.
科技型中小企业适应性成长路径研究%Towards an adaptive growth path of medium and small technological enterprises
Institute of Scientific and Technical Information of China (English)
黄春萍; 刘奎颖; 曾珍香
2011-01-01
Medium and small technological enterprises are the main force of national economic development. Their healthy growth is the common concern of both the business and academic circles. The adaptation of these enterprises and their adaptive growth stages are analyzed and a model for their adaptive growth path is established. Finally, cluster analysis is applied in an empirical study.%科技型中小企业是国民经济发展的主力军,其健康成长是企业界和学术界共同关心的热点问题.本文首先分析了科技型中小企业的适应性及其适应性成长阶段,分别是创业阶段、发展阶段、成熟阶段和蜕变阶段；进而基于企业适应性这一视角,提出了科技型中小企业适应性成长路径为自主发展型、动态模仿型和创新涌现型,并构建了其适应性成长路径模型,最后应用聚类分析进行了实证研究.
Path Creation, Path Dependence and Breaking Away from the Path
DEFF Research Database (Denmark)
Wang, Jens Erik; 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 dependence at these four interdependent layers can blindfold the organization from seeing and understanding...... the importance of intermediate outcomes, which in the case of Nokia was the importance of software ecosystems and adaptable mobile devices. Furthermore, we show how the layers of path dependence mutually reinforce each other and become stronger....
... medlineplus.gov/ency/patientinstructions/000660.htm Giving an insulin injection To use the sharing features on this ... and syringes. Filling the Syringe - One Type of Insulin Wash your hands with soap and water. Dry ...
Business Gift Giving Etiquette
Paris, Dubravka
2015-01-01
Business world today is faced with cultural similarities and cultural gaps. Every business person should be familiar with the business etiquette, in order to avoid a cultural faux pas. The topic of this paper is business gift giving in various parts of the world with the special emphasis on the English speaking countries. It comprises the basic rules of business gift giving etiquette, the types of gifts, especially the difference between the gifts for clients, the gifts for employees and the ...
Path Integral and Asset Pricing
Zura Kakushadze
2014-01-01
We give a pragmatic/pedagogical discussion of using Euclidean path integral in asset pricing. We then illustrate the path integral approach on short-rate models. By understanding the change of path integral measure in the Vasicek/Hull-White model, we can apply the same techniques to "less-tractable" models such as the Black-Karasinski model. We give explicit formulas for computing the bond pricing function in such models in the analog of quantum mechanical "semiclassical" approximation. We al...
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.
Bargatze, L. F.
2015-12-01
Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted
Charkiewicz, A
2000-01-01
Before the Career Path system, jobs were classified according to grades with general statutory definitions, guided by the "Job Catalogue" which defined 6 evaluation criteria with example illustrations in the form of "typical" job descriptions. Career Paths were given concise statutory definitions necessitating a method of description and evaluation adapted to their new wider-band salary concept. Evaluations were derived from the same 6 criteria but the typical descriptions became unusable. In 1999, a sub-group of the Standing Concertation Committee proposed a new guide for describing Career Paths, adapted to their wider career concept by expanding the 6 evaluation criteria into 9. For each criterion several levels were established tracing the expected evolution of job level profiles and personal competencies over their longer salary ranges. While providing more transparency to supervisors and staff, the Guide's official use would be by services responsible for vacancy notices, Career Path evaluations and rela...
SC Unit
2008-01-01
ACCIDENTS and ILLNESSES don’t take a break! DO SOMETHING AMAZING - GIVE BLOOD! IT’S IN ALL OUR INTERESTS. 30 July 2008 from 9.30 a.m. to 4 p.m. CERN RESTAURANT NOVAE First floor - Salle des Pas Perdus After you have given blood, you are invited to partake of refreshments kindly offered by NOVAE.
Adaptive Path Planning of the UAV Based on Genetic Algorithm%基于遗传算法的UAV自适应航迹规划
Institute of Scientific and Technical Information of China (English)
王琪; 马璐; 邓会亨
2013-01-01
根据遗传算法与动态的稀疏A*搜索(Dynamic Sparse A* Search, DASA)算法各自的特点,提出一种组合优化算法来实现在不确定战场环境中自适应航迹规划。在无人机(UAV, Unmanned Aerial Vehicles)飞行前,采用全局搜索能力强的遗传算法进行全局搜索,对从起始点到目标点的飞行航线进行规划,生成全局最优或次优的可行参考飞行航线；在无人机任务执行阶段,以参考飞行航线为基准,采用 DASA 算法进行在线实时航迹再规划。仿真结果表明,与遗传算法相比,该组合算法不但能生成近似最优解,而且能够满足在线实时应用的要求。%According to the characteristics of genetic algorithm and the Dynamic Sparse A*Search (Dynamic Sparse A*Search, DASA) algorithm, this paper puts forward a combinational optimal algorithm fulfilling adaptive path planning in flying environment with unknown threat. Before flight, the ground station adopt genetic algorithm which possess the powerful ability of global search to realize Universal Search, we proceed programme from the starting point to the target point to generate the global optimal or suboptimal feasible reference airline. When the UAV is executing fly missions, DASA algorithm is used for on line route re planning based on the reference flight line as the benchmark. The simulation results show that compared with the genetic algorithm, the combined algorithm cannot only produce an approximate optimal solution, but also meet the requirements of real-time online application.
Institute of Scientific and Technical Information of China (English)
赵著行; 闵应骅; 等
1997-01-01
For different delay models,the concept of sensitization can be very different.Traditonal concepts of sensitization cannot precisely describe circuit behavior when the input vectors change very fast.Using Boolean process aporoach,this paper presents a new definition of sensitization for arbitrary input waveforms.By this new concept it is found that if the inputs of a combinational circuit can change at any time,and each gate's delay varies within an interval (bounded gate delay model),then every path,which is not necessarily a single topological path,is sensitizable.From the experimental results it can be seen that,all nonsensitizable paths for traditional concepts actually can propagate transitions along them for some input waveforms.However,specified time between input transitions(STBIT) and minimum permissible pulse width(ε）are two major factors to make some paths non-sensitizable.
Path Integrals in Quantum Physics
Rosenfelder, R
2012-01-01
These lectures aim at giving graduate students an introduction to and a working knowledge of path integral methods in a wide variety of fields in physics. Consequently, the lecture notes are organized in three main parts dealing with non-relativistic quantum mechanics, many-body physics and field theory. In the first part the basic concepts of path integrals are developed in the usual heuristic, non-mathematical way followed by standard examples and special applications including numerical evaluation of (euclidean) path integrals by Monte-Carlo methods with a program for the anharmonic oscillator. The second part deals with the application of path integrals in statistical mechanics and many-body problems treating the polaron problem, dissipative quantum systems, path integrals over ordinary and Grassmannian coherent states and perturbation theory for both bosons and fermions. Again a simple Fortran program is included for illustrating the use of strong-coupling methods. Finally, in the third part path integra...
Yu, Baohua
2013-01-01
This study examined the interrelationships of integrative motivation, competence in second language (L2) communication, sociocultural adaptation, academic adaptation and persistence of international students at an Australian university. Structural equation modelling demonstrated that the integrative motivation of international students has a…
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 k...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...
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...
Are stationary hyperinflation paths learnable?
Adam, Klaus; W., George; Honkapohja, Seppo
2003-01-01
Earlier studies of the seigniorage inflation model have found that the high-inflation steady state is not stable under adaptive learning. We reconsider this issue and analyze the full set of solutions for the linearized model. Our main focus is on stationary hyperinflationary paths near the high-inflation steady state. The hyperinflationary paths are stable under learning if agents can utilize contemporaneous data. However, in an economy populated by a mixture of agents, some of whom only hav...
Gender differences in charitable giving
Piper, Greg; Schnepf, Sylke Viola
2008-01-01
The predominant part of the literature states that women are more likely to donate to charitable causes but men are more generous in terms of the amount given. The latter result generally derives from the focus on mean amount given. This paper examines gender differences in giving focusing on the distribution of amounts donated and the probability of giving using UK micro-data on individual giving to charitable causes. Results indicate that most women are more generous than men also in te...
Who gives for overseas development?
Micklewright, John; Schnepf, Sylke Viola
2007-01-01
Individuals' donations to overseas charities are an important source of funding for development assistance from rich industrialised countries. But little is known about the nature of these charitable donations. The literature on giving focuses on total donations to all causes and does not identify separately the pattern or the determinants of giving to any particular cause. We investigate giving to overseas causes using UK survey microdata that record individuals' donations to different types...
Molecular path for ligand search
Institute of Scientific and Technical Information of China (English)
Tao Lu; Yuan Yuan Qiao; Pan Wen Shen
2011-01-01
A ligand is a small molecule bind to several residues of a receptor. We adapt the concept of molecular path for effective ligand search with its contacting residues. Additionally, we allow wild type definitions on atoms and bonds of molecular paths for fuzzy algorithms on structural match. We choose hydrogen bond interactions to characterize the binding mode of a ligand by several proper molecular paths and use them to query the deposited ligands in PDBe that interact with their residues in the same way. Expression of molecular path and format of database entries are described with examples. Our molecular path provides a new approach to explore the ligand-receptor interactions and to provide structural framework reference on new ligand design.
DEFF Research Database (Denmark)
Nielsen, Rikke K.; Straub-Bauer, Andrea
2014-01-01
Adapting your leadership style to a different cultural setting can be tough, especially when the new setting demands a style different from how you would normally and comfortably behave at home. So how do you adapt your leadership behavior across cultures without losing yourself in the process?...
Institute of Scientific and Technical Information of China (English)
高瑜; 过金超; 崔光照
2013-01-01
Based on the study of the traditional multi-robot path planning,an improved adaptive artificial potential field method was proposed.In this method,the local minimum problem of the traditional artificial potential field could be solved by setting the virtual target point for mobile robot to escape local minimum. At the same time,according to the task and speed of the robot,it used the adaptive priority strategy to real-ize the adaptive obstacle avoidance of the robot.The results of the simulation proved the effectiveness and feasibility of this method.%在研究多机器人路径规划传统方法的基础上，提出了一种改进的自适应人工势场法。该方法通过设置虚拟目标点来解决传统人工势场法易陷入局部极小点的问题，同时根据各个机器人所承担的任务和速度，采用自适应优先权策略来实现机器人之间的自适应避障。仿真实验验证了该方法的有效性和可行性。
Deconstructing Giving: Donor Types and How They Give
Lata Gangadharan; Philip J. Grossman; Kristy Jones
2014-01-01
We examine the extent to which individual donors are warm glow or altruistic givers and whether this distinction motivates giving decisions, particularly paternalism. Results from our experiment suggest that motivations for giving are heterogeneous, ranging from pure altruism to impure altruism to pure warm glow. Of 115 donors, in our setting 30 are purely altruistic givers, 36 are impure givers and up to 17 could be considered pure warm-glow givers. We find that donors are predominantly pate...
Institute of Scientific and Technical Information of China (English)
王海云
2006-01-01
@@ When you sign your name, that's known as giving your John Hancock. John Hancock is most famous for his bold1 signature2. On August 2, 1776, he was the first member of the Continental Congress3 to sign the Declaration of Independence4, the document first demanding independence for the United States from the rule of Great Britain. Hancock wrote his name in big, bold letters that day, acting as5 president of the Second Continental Congress. This inspired6 the phrase "give me your John Hancock", meaning "give me your signature".
Directory of Open Access Journals (Sweden)
Jade S. Sasser
2014-07-01
Full Text Available In this thematic section, authors consider the limitations on giving back that they faced in field research, or saw others face. For some authors, their attempts at giving back were severely limited by the scope of their projects, or their understandings of local cultures or histories. For others, very specific circumstances and historical interventions of foreigners in certain places can limit how and to what extent a researcher is able to have a reciprocal relationship with the participating community. Some authors, by virtue of their lesser positions of power relative to those that they were studying, simply decided not to give back to those communities. In each article it becomes apparent that how and in what ways people give back is unique (and limited both to their personal values and the contexts in which they do research.
Sussams, L W; Sheate, W R; Eales, R P
2015-01-01
As dangerous climate change looms, decision-makers are increasingly realising that societies will need to adapt to this threat as well as mitigate against it. Green infrastructure (GI) is increasingly seen as an ideal climate change adaptation policy response. However, with this research the authors identify a number of crucial knowledge gaps within GI and, consequently, call for caution and for a concerted effort to understand the concept and what it can really deliver. GI has risen to prominence in a range of policy areas in large part due to its perceived ability to produce multiple benefits simultaneously, termed 'multifunctionality'. This characteristic strengthens the political appeal of the policy in question at a time when environmental issues have slipped down political agendas. Multifunctionality, however, brings its own set of new challenges that should be evaluated fully before the policy is implemented. This research takes important first steps to developing a critical understanding of what is achievable within GI's capacity. It focuses on one of GI's single objectives, namely climate change adaptation, to focus the analysis of how current obstacles in applying GI's multifunctionality could lead to the ineffective delivery of its objective. By drawing on expert opinion from government officials and representatives from the private, non-government organisation (NGO) and academic sectors, this research questions GI's ability to be effectively 'multifunctional' with an inconsistent definition at its core, deficiencies in its understanding and conflicts within its governance. In light of these observations, the authors then reflect on the judiciousness of applying GI to achieve the other objectives it has also been charged with delivering.
DEFF Research Database (Denmark)
Schürmann, Carsten; Sarnat, Jeffrey
2009-01-01
Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of equality in type theory, equivalence testing of traces in security, etc. Although the principle of transfinite induction...... an induction principle that combines the comfort of structural induction with the expressive strength of transfinite induction. Using lexicographic path induction, we give a consistency proof of Martin-Löf’s intuitionistic theory of inductive definitions. The consistency of Heyting arithmetic follows directly...
Path integral evaluation of Dbrane amplitudes
Chaudhuri, Shyamoli
1999-01-01
We extend Polchinski's evaluation of the measure for the one-loop closed string path integral to open string tree amplitudes with boundaries and crosscaps embedded in Dbranes. We explain how the nonabelian limit of near-coincident Dbranes emerges in the path integral formalism. We give a careful path integral derivation of the cylinder amplitude including the modulus dependence of the volume of the conformal Killing group.
Path Minima Queries in Dynamic Weighted Trees
DEFF Research Database (Denmark)
Davoodi, Pooya; Brodal, Gerth Stølting; Satti, Srinivasa Rao
2011-01-01
In the path minima problem on a tree, each edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem, where the edge weights can be updated, we give data structures that achieve optimal query time\\todo{what about...
Infinite Unicorn Paths and Gromov Boundaries
Pho-on, Witsarut
2015-01-01
We extend the notion of unicorn paths between two arcs introduced by Hensel, Przytycki and Webb to the case where we replace one arc with a geodesic asymptotic to a lamination. Using these paths, we give new proofs of the results of Klarreich and Schleimer identifying the Gromov boundaries of the curve graph and the arc graph, respectively, as spaces of laminations.
Give Someone the Cold Shoulder
Institute of Scientific and Technical Information of China (English)
程炜
2002-01-01
The snowman in this illustration is happy to allow a bird to rest on its cold shoulder.., but that's not what this idiom means.To give someone the cold shoulder is to be un-friendly, usually by ignoring them.
基于网格化曲面的自适应自动铺放轨迹算法%Algorithm of Adaptive Path Planning for Automated Placement on Meshed Surface
Institute of Scientific and Technical Information of China (English)
熊文磊; 肖军; 王显峰; 李俊斐; 黄志军
2013-01-01
This paper analyzes the causes of prepreg distortion and discusses its influence for the requirement of trajectory placement ability. A new algorithm of geodesic generation based on meshed surfaces is proposed according to the definition of geodesic, which possesses features of efficiency and highaccuracy, etc. Both the manufacturability of the prepreg and its distribution of strength in a product are considered in the algorithm of path planning, providing it with the ability of adapting to surfaces. The algorithm first figures out the maximum geodesic curvature allowed for the central path, and applies it to the design of trajectory. The trajectory obtained both has good ability of placement and can satisfy the demands of strength distribution in a product. Finally, the path planning aiming at one type of S-inlet with database of SQL Server and VC+ + is carried out. The disperse trajectory points are then fitted to be a curve in CATIA to verify the validity and effectiveness of the algorithm of geodesic generation and trajectory placement generation.%基于轨迹的可铺放性要求分析了铺放过程中预浸料产生畸变的原因及影响轨迹可铺放性的因素.根据测地线定义构造了一种基于网格化曲面的测地线新算法,具有高效率、高精度等特点；在此基础上综合考虑预浸料的可铺放性和构件强度分布要求,提出了具有曲面自适应功能的铺放轨迹算法,可根据预浸料带宽计算得到铺放轨迹容许的最大测地曲率,并将其运用于铺放轨迹设计,使轨迹能够保证预浸料良好可铺放性的同时又满足构件的强度分布要求.最后通过数据库SQL Server和VC++针对某型号S型进气道进行铺放轨迹设计,在CATIA中将计算获取的离散轨迹点拟合成曲线并进行了实际的铺放试验,验证了测地线生成算法和铺放轨迹生成算法的正确性和有效性.
Institute of Scientific and Technical Information of China (English)
胡中华; 赵敏; 刘世豪; 章婷
2012-01-01
To solve the problem of Unmanned Aerial Vehicle（UAV）route planning, Adaptive Ant Golony Optlmiza- tion（AACO）algorithm was proposed. Different from the global search mode of standard Ant Colony Optimizatio （ACO）, local search mode was adopted by AACO. Based on the relative position of starting node and destination node, one of the appropriate search mode in four was selected, and transition probabilities of each candidate node were calculated. The next node was selected according to the roulette principle. The simulation result showed that AACO algorithm had advantages such as few search nodes, quick speed and so on. It could reduce flight path cost and computing time. In addition, AACO could also avoided singular flight path segment, thus the attained practical flight path could fly was guaranteed. Therefore,the performance of AACO was much better than standard ACO.%为求解无人飞行器航迹规划问题，提出自适应蚁群算法，区别于标准蚁群算法的全部搜索模式，该算法采用局部搜索模式。首先根据起始节点与目标节点的相对位置关系选择相应的搜索模式，然后计算各个待选节点的转移概率，最后按照轮盘赌规则选择下一个节点。仿真结果表明，自适应蚁群算法具有搜寻节点数少、速度快等优点，在降低了航迹代价的同时，减小了计算时间。此外，自适应蚁群算法可以避免奇异航迹段的出现，从而保证所获的航迹实际可飞，表明所提算法整体性能明显较标准蚁群算法优异。
Institute of Scientific and Technical Information of China (English)
孙玲芳; 候志鲁; 许锋; 周家波
2016-01-01
The paper proposes an energy-saving multi-path adaptive algorithm based on random network coding in wireless sensor networks (RNC-ESMP). First of all, This algorithm considers the nodesˊenergy, let the data packets transmitted on the paths which have least energy consumption during data transferring. Second, considering the decoding probability of the sink nodes as the feedback factor, the algorithm builds a feedback mechanism from the sink nodes to the source nodes to make self-adaptive impossible. Then the algorithm proposes the encoding options and probability of the intermediate nodes so as to reduce the complexity of encoding. At last, it builds the platform on MATLAB to simulate the algorithm. The results of the experiment shows that this algorithm not only can reduce the average energy consumption of networks efficiently but also can extend the networksˊlife-time.%提出一种多路径的无线传感器网络（WSN）自适应节能算法，该算法的实现基于随机网络编码（RNC－ESMP）。其基本思想是：首先，该算法以WSN节点能量为考量，将数据经由节点能量最多的路径传输；其次，以目的节点解码成功率为反馈因子，构建目的节点到源节点的反馈机制，实现自适应；再次，选择合适的编码策略对数据包进行编码。最后在MATLAB环境下搭建仿真平台进行模拟仿真。实验结果表明，相比于传统的多路径算法，RNC－ESMP算法能够有效降低网络平均能耗，延长网络生命周期。
Paths of algebraic hyperbolic curves
Institute of Scientific and Technical Information of China (English)
Ya-juan LI; Li-zheng LU; Guo-zhao WANG
2008-01-01
Cubic algebraic hyperbolic (AH) Bezier curves and AH spline curves are defined with a positive parameter α in the space spanned by {1, t, sinht, cosht}. Modifying the value of α yields a family of AH Bezier or spline curves with the family parameter α. For a fixed point on the original curve, it will move on a defined curve called "path of AH curve" (AH Bezier and AH spline curves) when α changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.
Giving a grand rounds presentation.
Morrison, Laura J; Portenoy, Russell
2010-12-01
Giving a Grand Rounds presentation provides the hospice and palliative medicine subspecialist with the occasion to participate in a time-honored and respected event. It remains an opportunity to promote the discipline, support institutional culture change, and favorably influence the attitudes, knowledge, skills, and performance of colleagues. For those pursuing academic careers, it also is a chance to establish academic currency and develop teaching and presentation skills. In most academic settings, the format of Grand Rounds has shifted over time from a patient and problem-based discussion to a didactic, topic-focused lecture. A body of literature questions the value of this shift toward a more passive learner. Limited evidence prevents a definitive answer but many advocate for the integration of more interactive methods to improve the effectiveness of Grand Rounds. This article provides a flexible framework to guide those preparing to give a Grand Rounds and those teaching and supporting others to do so. To do this well, adult learning principles must be thoughtfully incorporated into a presentation style and method appropriate to the venue. The approach emphasizes learner-centeredness, interactive strategies, and evaluation. Room for creativity exists at every step and can add enjoyment and challenge along the way. PMID:21155643
Institute of Scientific and Technical Information of China (English)
罗艺; 曹小萍; 孟润堂; 刘冰
2014-01-01
目的：探讨护士角色适应、职业紧张对组织氛围的影响及其相互作用。方法采用多阶段抽样法抽取湖北省十堰市579名护理人员，采用医院组织气氛量表、职业紧张简洁量表和护士角色适应量表进行问卷调查。采用SPSS 18.0统计软件进行Spearman相关分析和路径分析。结果护士组织氛围处于中等偏上水平，职业紧张处于中等水平，角色适应处于中等偏下水平。职业紧张的工作控制维度和工作支持维度呈正相关[ Spearman相关系数（rS）＝0．514， P＜0．01]。角色适应的工作与家人维度和护理者与医院职工维度呈正相关（rS ＝0．327，P＜0．01），和工作与本我维度呈正相关（rS＝0．419， P＜0．01）。角色适应、工作控制维度和工作支持维度对组织氛围的标准回归系数分别为0．386、-0．232、-0．411（P＜0．01）。工作需求、工作控制和工作支持3个维度对角色适应的标准回归系数分别为-0．377、-0．126、-0．289（P＜0．01）。职业紧张3个维度均直接反向影响角色适应，角色适应直接正向作用于组织氛围，职业紧张的工作需求维度可通过角色适应间接作用于组织氛围。结论职业紧张反向影响角色适应，角色适应正向作用于组织氛围，职业紧张的工作需求维度在角色适应与组织氛围之间起中介作用。%Objective To explore the effect of nursing role adaptation , occupational stress on organizational climate and its interaction.Methods Five hundred and seventy-nine nurses participated in the study according to multi-stage stratified sampling and the questionnaires of Organizational Climate Questionnaire , Brief Job Stress Questionnaire and Role Adapta-tion Questionnaire .Spearman correlation analysis and Path analysis were performed by SPSS 18.0 statistical software . Results The score of nurses ’ organizational climate was higher than the average level
Robot path planning in dynamic environment based on reinforcement learning
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Proposes an adaptive learning method based on reinforcement learning for robot path planning prob lem, which enables the robot to adaptively learn and perform effective path planning, to avoid the moving obsta cles and reach the target. Thereby achieving automatic construction of path planning strategy and making the system adaptive to multi-robots system dynamic environments, and concludes from computer simulation experi ment that the method is powerful to solve the problem of multi-robot path planning, and it is a meaningful try to apply reinforcement learning techniques in multi-robot systems to develop the system's intelligence degree.
Institute of Scientific and Technical Information of China (English)
马宪民; 刘妮
2014-01-01
To solve basic artificial fish-swarm algorithm(AFSA)’s drawbacks of low convergence rate in the latter stage, a large amount of computation and easiness of trapping in local optimal solution, caused by the constant vision of the ar-tificial fish, an improved artificial fish-swarm algorithm based on adaptive vision(AVAFSA) was proposed. The improved algorithm only adjusted the vision of the preying behavior of artificial fish to make the vision gradually decrease with the increase of the number of iterations of the algorithm. When the value became less than half the initial value, it made the value be equal to half the initial value. The proposed improved artificial fish swarm algorithm was applied to the static shortest path problem based on road network to provide customers with the best path. Simulation results depict the im-proved algorithm has higher convergence rate, a smaller amount of calculation, and is more accurate and stable than the basic AFSA and ant colony optimization(ACO).%针对基本人工鱼群算法的参数视野固定不变导致算法后期收敛速度慢、运算量大、易陷入局部最优等问题，提出自适应视野的改进人工鱼群算法。改进后的算法只对人工鱼的觅食行为的视野进行调整，使其随着算法的迭代次数的增加而逐渐减小，但当视野小于初始值的一半时，停止减小，使其等于初始值的一半。将提出的改进型人工鱼群算法应用到求解基于道路网络的最短路径问题中，并通过实验证明了改进后的人工鱼群算法比基本人工鱼群算法及蚁群优化算法收敛速度快、计算量小，而且更加准确和稳定。
Ranking shortest paths in Stochastic time-denpendent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele
, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately......, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...... 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....
K shortest paths in stochastic time-dependent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan
2004-01-01
, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately......, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...... 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....
Broersma, Hajo; Li, Xueliang
1996-01-01
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\overrightarrow 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
To Give or Not to Give, That Is the Question : How Methodology Is Destiny in Dutch Giving Data
Bekkers, René; Wiepking, Pamala
2006-01-01
In research on giving, methodology is destiny. The volume of donations estimated from sample surveys strongly depends on the length of the questionnaire used to measure giving. By comparing two giving surveys from the Netherlands, the authors show that a short questionnaire on giving not only undere
Institute of Scientific and Technical Information of China (English)
2015-01-01
针对灵活网格光网络中如何节约转发器与频谱资源的问题，该文研究了多点到多点组播业务的光路环路由机制，提出一种基于距离自适应和有效共享路径感知的光疏导方法。通过设计一种基于距离自适应的预处理机制，该疏导方法能根据业务成员节点的分布特点和距离自适应准则灵活地为业务构建光路环；在路由与频谱分配阶段，该疏导方法通过构造一个面向光疏导的业务决策矩阵和一个优先调度向量，将业务疏导到与当前业务具有有效共享路径最多的已路由业务上，并优先分配所需的频谱空间以提高光疏导的成功率，实现节约转发器与频谱资源的目的。仿真结果表明，该文提出的光疏导方法可以有效地减少业务消耗的转发器数目和子载波数目。%In order to address the problem of reducing the resources of transponder and spectrum in flexible grid optical networks, a lightpath circle mechanism is studied for many-to-many multicast requests, and a method of optical grooming is proposed based on distance-adaptive and effective sharing path-aware. By designing a strategy of traffic pre-processing based on distance-adaptive, a lightpath circle is constructed according to the distribution characteristics of member nodes and the distance-adaptive criterion in the proposed method. In the process of routing and spectrum allocation, by constructing a decision matrix oriented optical grooming and a priority scheduling vector, the multicast request is groomed into the established traffic with the highest effective sharing links. Moreover, the appropriate spectrum resources are allocated for the groomed requests to increase the success rates of grooming and to save the resources of transponder and spectrum. Simulation results show that the proposed method can significantly reduce the number of traffic consumed transponders and sub-carriers.
Lloyd, Seth; Dreyer, Olaf
2013-01-01
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration. This paper defines a universal path integral, which sums over all computable structures. This path integral contains as sub-integrals all possible computable path integrals, including those of field theory, the standard model of elementary particles, discrete...
Multi-Dimensional Path Queries
DEFF Research Database (Denmark)
Bækgaard, Lars
1998-01-01
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...... that connects a pair of paths. A path expression is a function that maps a set of path sets into a path set. Path sets can be joined, filtering conditions can restrict the set of qualifying paths, and aggregation functions can be applied to path elements. In particular, the aggregation function SET can be used...... 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...
Income Tax Policy and Charitable Giving
Brooks, Arthur C.
2007-01-01
Many studies over the past 20 years have looked at the response of charitable donations to tax incentives--the tax price elasticity of giving. Generally, authors have assumed this elasticity is constant across all types of giving. Using the 2001 Panel Study of Income Dynamics data on charitable giving, this paper estimates the tax price elasticity…
Mapping the imaginary of charitable giving
DEFF Research Database (Denmark)
Bajde, Domen
2012-01-01
The meaningfulness of charitable giving is largely owed to the imaginary conceptions that underpin this form of giving. Building on Taylor's notion of “social imaginary” and Godelier's work on “gift imaginary,” we theorize the imaginary of charitable giving. Through a combination of qualitative...
Directory of Open Access Journals (Sweden)
Vincent DUSSOL
2007-06-01
Full Text Available I am grateful to Ray DiPalma for his generously giving me access to copies of An August Daybook (2005, Mules at the Wake (2006 and Ascoso (2006. All other quotes from DiPalma are from a private correspondence.There is a delicate balance in iDEATH. It suits us.(Richard Brautigan In Watermelon SugarAn autobiography is about an “I” and it traces a path. But the “I” and teleology have long been called into question by poets. This interrogation continues: wanderers blaze new trails. We propose...
International Nuclear Information System (INIS)
This paper describes the circuits and programs in assembly language, developed to control the two DC motors that give mobility to a mechanical arm with two degrees of freedom. As a whole, the system is based in a adaptable regulator designed around a 8 bit microprocessor that, starting from a mode of regulation based in the successive approximation method, evolve to another mode through which, only one approximation is sufficient to get the right position of each motor. (Author) 22 fig. 6 ref
The Practical Realities of Giving Back
Directory of Open Access Journals (Sweden)
Ashton Bree Wesner
2014-07-01
Full Text Available In this thematic section, authors consider practical ways of giving back to the communities in which they conduct research. Each author discusses their evolving thoughts on how to give back in these practical ways. Some of these authors discuss giving back by giving money, food, rides, parties, and water bottles. In other cases, authors discuss giving back by creating jobs in the short or long term, grant writing, advocacy, and education. Story-telling is also a theme that many of the authors in this section discuss. For some authors, non-material forms of giving back are critical—simply maintaining social ties to the communities in which they worked, or sharing humor. The authors consider the utility of their attempts at giving back, and in some cases present their personal philosophy or guidelines on the subject.
Path Integral Methods for Stochastic Differential Equations
Chow, Carson C.; Buice, Michael A.
2015-01-01
Stochastic differential equations (SDEs) have multiple applications in mathematical neuroscience and are notoriously difficult. Here, we give a self-contained pedagogical review of perturbative field theoretic and path integral methods to calculate moments of the probability density function of SDEs. The methods can be extended to high dimensional systems such as networks of coupled neurons and even deterministic systems with quenched disorder.
Hamiltonian Paths in Two Classes of Grid Graphs
Keshavarz-Kohjerdi, Fatemeh; Bagheri, Alireza
2011-01-01
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in $L-$alphabet and $C-$alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
Baras, John
2010-01-01
The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path pr
Identification Method of Attack Path Based on Immune Intrusion Detection
Directory of Open Access Journals (Sweden)
Wenhua Huang
2014-04-01
Full Text Available This thesis takes researches on the immune intrusion detection and IP trace back technology. To find out the network data features of the real-time analyses, the distributed immune intrusion detection system and the packet marking theory are used; to guide the dynamically processing of path signs technology, the immune intrusion detection system is used; what’s more, to dynamically adaptive different methods of characteristics of network data, the path signs technology is adopted. After that, the attack paths can be quickly identified to provide path information for feature detector on attack path in the immune intrusion detection system. Experiment results show that this scheme can quickly reconstruct the attack path information, and the performance on the aspects of the convergence is with efficiency rate and false positive rate, which is superior to the current probabilistic packet marking algorithm and can provide characteristic path information for immune intrusion detection system
Giving Back: Nature Conservation in Madagascar
Directory of Open Access Journals (Sweden)
Claire Kremen
2014-07-01
Full Text Available This research note is part of the thematic section, Practical Realities of Giving Back, in the special issue titled “Giving Back in Field Research,” published as Volume 10, Issue 2 in the Journal of Research Practice.
DEFF Research Database (Denmark)
Garud, Raghu; Karnøe, Peter
the place of agency in these theories that take history so seriously. In the end, they are as interested in path creation and destruction as they are in path dependence. This book is compiled of both theoretical and empirical writing. It shows relatively well-known industries such as the automobile...
Free path groupoid grading on Leavitt path algebras
Goncalves, Daniel; Yoneda, Gabriela
2015-01-01
In this work we realize Leavitt path algebras as partial skew groupoid rings. This yields a free path groupoid grading on Leavitt path algebras. Using this grading we characterize free path groupoid graded isomorphisms of Leavitt path algebras that preserves generators.
*-Regular Leavitt Path Algebras of Arbitrary Graphs
Institute of Scientific and Technical Information of China (English)
Gonzalo ARANDA PINO; Kulumani RANGASWAMY; Lia VA(S)
2012-01-01
If K is a field with involution and E an arbitrary graph,the involution from K naturally induces an involution of the Leavitt path algebra LK(E).We show that the involution on LK(E) is proper if the involution on K is positive-definite,even in the case when the graph E is not necessarily finite or row-finite.It has been shown that the Leavitt path algebra LK(E) is regular if and only if E is acyclic.We give necessary and sufficient conditions for LK(E) to be *-regular (i.e.,regular with proper involution).This characterization of *-regularity of a Leavitt path algebra is given in terms of an algebraic property of K,not just a graph-theoretic property of E.This differs from the.known characterizations of various other algebraic properties of a Leavitt path algebra in terms of graphtheoretic properties of E alone.As a corollary,we show that Handelman's conjecture (stating that every *-regular ring is unit-regular) holds for Leavitt path algebras.Moreover,its generalized version for rings with local units also continues to hold for Leavitt path algebras over arbitrary graphs.
Quantum Thermal Bath for Path Integral Molecular Dynamics Simulation.
Brieuc, Fabien; Dammak, Hichem; Hayoun, Marc
2016-03-01
The quantum thermal bath (QTB) method has been recently developed to account for the quantum nature of the nuclei by using standard molecular dynamics (MD) simulation. QTB-MD is an efficient but approximate method when dealing with strongly anharmonic systems, while path integral molecular dynamics (PIMD) gives exact results but in a huge amount of computation time. The QTB and PIMD methods have been combined in order to improve the PIMD convergence or correct the failures of the QTB-MD technique. Therefore, a new power spectral density of the random force within the QTB has been developed. A modified centroid-virial estimator of the kinetic energy, especially adapted to QTB-PIMD, has also been proposed. The method is applied to selected systems: a one-dimensional double-well system, a ferroelectric phase transition, and the position distribution of an hydrogen atom in a fuel cell material. The advantage of the QTB-PIMD method is its ability to give exact results with a more reasonable computation time for strongly anharmonic systems. PMID:26799437
Tortuous path chemical preconcentrator
Manginell, Ronald P.; Lewis, Patrick R.; Adkins, Douglas R.; Wheeler, David R.; Simonson, Robert J.
2010-09-21
A non-planar, tortuous path chemical preconcentrator has a high internal surface area having a heatable sorptive coating that can be used to selectively collect and concentrate one or more chemical species of interest from a fluid stream that can be rapidly released as a concentrated plug into an analytical or microanalytical chain for separation and detection. The non-planar chemical preconcentrator comprises a sorptive support structure having a tortuous flow path. The tortuosity provides repeated twists, turns, and bends to the flow, thereby increasing the interfacial contact between sample fluid stream and the sorptive material. The tortuous path also provides more opportunities for desorption and readsorption of volatile species. Further, the thermal efficiency of the tortuous path chemical preconcentrator is comparable or superior to the prior non-planar chemical preconcentrator. Finally, the tortuosity can be varied in different directions to optimize flow rates during the adsorption and desorption phases of operation of the preconcentrator.
Directory of Open Access Journals (Sweden)
Deepak Goyal
2013-07-01
Full Text Available This paper addresses the malicious node detection and path optimization problem for wireless sensor networks. Malicious node detection in neighborhood is a needed because that node may cause incorrect decisions or energy depletion. In this paper APSO (combination of Artificial bee colony and particular swarm optimization is used to choose an optimized path. Through this improved version we will overcome the disadvantage of local optimal which comes when we use PSO approach.
Deepak Goyal; Malay Ranjan Tripathy
2013-01-01
This paper addresses the malicious node detection and path optimization problem for wireless sensor networks. Malicious node detection in neighborhood is a needed because that node may cause incorrect decisions or energy depletion. In this paper APSO (combination of Artificial bee colony and particular swarm optimization) is used to choose an optimized path. Through this improved version we will overcome the disadvantage of local optimal which comes when we use PSO approach.
Self-calibrating common-path interferometry.
Porras-Aguilar, Rosario; Falaggis, Konstantinos; Ramirez-San-Juan, Julio C; Ramos-Garcia, Ruben
2015-02-01
A quantitative phase measuring technique is presented that estimates the object phase from a series of phase shifted interferograms that are obtained in a common-path configuration with unknown phase shifts. The derived random phase shifting algorithm for common-path interferometers is based on the Generalized Phase Contrast theory [pl. Opt.40(2), 268 (2001)10.1063/1.1404846], which accounts for the particular image formation and includes effects that are not present in two-beam interferometry. It is shown experimentally that this technique can be used within common-path configurations employing nonlinear liquid crystal materials as self-induced phase filters for quantitative phase imaging without the need of phase shift calibrations. The advantages of such liquid crystal elements compared to spatial light modulator based solutions are given by the cost-effectiveness, self-alignment, and the generation of diminutive dimensions of the phase filter size, giving unique performance advantages. PMID:25836191
SVC VIDEO STREAM ALLOCATION AND ADAPTATION IN HETEROGENEOUS NETWORK
Directory of Open Access Journals (Sweden)
E. A. Pakulova
2016-07-01
Full Text Available The paper deals with video data transmission in format H.264/SVC standard with QoS requirements satisfaction. The Sender-Side Path Scheduling (SSPS algorithm and Sender-Side Video Adaptation (SSVA algorithm were developed. SSPS algorithm gives the possibility to allocate video traffic among several interfaces while SSVA algorithm dynamically changes the quality of video sequence in relation to QoS requirements. It was shown that common usage of two developed algorithms enables to aggregate throughput of access networks, increase parameters of Quality of Experience and decrease losses in comparison with Round Robin algorithm. For evaluation of proposed solution, the set-up was made. The trace files with throughput of existing public networks were used in experiments. Based on this information the throughputs of networks were limited and losses for paths were set. The results of research may be used for study and transmission of video data in heterogeneous wireless networks.
Robot Swarms in an Uncertain World: Controllable Adaptability
Directory of Open Access Journals (Sweden)
Alexandr Shillerov
2008-11-01
Full Text Available There is a belief that complexity and chaos are essential for adaptability. But life deals with complexity every moment, without the chaos that engineers fear so, by invoking goal-directed behaviour. Goals can be programmed. That is why living organisms give us hope to achieve adaptability in robots. In this paper a method for the description of a goal-directed, or programmed, behaviour, interacting with uncertainty of environment, is described. We suggest reducing the structural (goals, intentions and stochastic components (probability to realise the goal of individual behaviour to random variables with nominal values to apply probabilistic approach. This allowed us to use a Normalized Entropy Index to detect the system state by estimating the contribution of each agent to the group behaviour. The number of possible group states is 27. We argue that adaptation has a limited number of possible paths between these 27 states. Paths and states can be programmed so that after adjustment to any particular case of task and conditions, adaptability will never involve chaos. We suggest the application of the model to operation of robots or other devices in remote and/or dangerous places.
Differential Equations driven by \\Pi-rough paths
Gyurkó, Lajos Gergely
2012-01-01
This paper revisits the concept of rough paths of inhomogeneous degree of smoothness (geometric \\Pi-rough paths in our terminology) sketched by Lyons ("Differential equations driven by rough signals", Revista Mathematica Iber. Vol 14, Nr. 2,215-310, 1998). Although geometric \\Pi-rough paths can be treated as p-rough paths for a sufficiently large p and the theory of integration of Lip-\\gamma one-forms (\\gamma>p-1) along geometric p-rough paths applies, we prove the existence of integrals of one-forms under weaker conditions. Moreover, we consider differential equations driven by geometric \\Pi-rough paths and give sufficient conditions for existence and uniqueness of solution.
Termination of Commercial Contracts by giving Notice
DEFF Research Database (Denmark)
Edlund, Hans Henrik
2008-01-01
or not the contract can be terminated by giving notice. The international UNIDROIT principles and the Lando Commission have included a rule allowing the parties to a contract which is for an indefinite period to give notice, but it can be very difficult to distinguish between indefinite and definite periods....... Furthermore, it is open to question whether the continuation of an expired contract is to be considered as a contract for an indefinite period, and whether contracts for definite periods are irrevocable. Even though these questions are not regulated, it is not recommended that new and more detailed principles...
Give and Take in Dictator Games
DEFF Research Database (Denmark)
Cappelen, Alexander W.; Nielsen, Ulrik Haagen; Sørensen, Erik Ø.;
2014-01-01
It has been shown that participants in the dictator game are less willing to give money to the other participant when their choice set also includes the option to take money. We examine whether this effect is due to the choice set providing a signal about entitlements in a setting where...... Denmark. The findings are consistent with dictator giving partly being motivated by a desire to signal that one is not entirely selfish or by a desire to follow a social norm that is choice-set dependent....
On path hypercompositions in graphs and automata
Directory of Open Access Journals (Sweden)
Massouros Christos G.
2016-01-01
Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
The effect of varying path properties in path steering tasks
Liu, L.; Liere, R. van
2010-01-01
Path steering is a primitive 3D interaction task that requires the user to navigate through a path of a given length and width. In a previous paper, we have conducted controlled experiments in which users operated a pen input device to steer a cursor through a 3D path subject to fixed path propertie
Path Integration Working Memory for Multi Task Dead Reckoning and Visual Navigation
Hasson, Cyril; Gaussier, Philippe
2010-01-01
International audience Biologically inspired models for navigation use mechanisms like path integration or sensori-motor learning. This paper describes the use of a proprioceptive working memory to give path integration the potential to store several goals. Then we coupled the path integration working memory to place cell sensori-motor learning to test the potential autonomy this gives to the robot. This navigation architecture intends to combine the benefits of both strategies in order to...
S. Onderstal; A.J.H.C. Schram; A.R. Soetevent
2013-01-01
In a door-to-door fundraising field experiment, we study the impact of fundraising mechanisms on charitable giving. We approached about 4500 households, each participating in an all-pay auction, a lottery, a non-anonymous voluntary contribution mechanism (VCM), or an anonymous VCM. In contrast to th
Charitable Giving, Emotions, and the Default Effect
Noussair, Charles; Habetinova, Lenka
2015-01-01
We report an experiment to study the effect of defaults on charitable giving. In three different treatments, participants face varying default levels of donation. In three other treatments that are paired with the first three, they receive the same defaults, but are informed that defaults are though
Homework: should we give it or not?
Simpson, Adam John
2014-01-01
Homework… should we or shouldn’t we? What are the benefits and what are the drawbacks? Are we really helping our learners develop their language skills or are we merely complicating their lives? Here are my favourite four arguments for and against giving learners homework
CAS paleoichthyologist gives Artedi Lecture in Sweden
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
@@ Prof. ZHANG Miman (CHANG Mee-mann), a CAS Member from the CAS Institute of Vertebrate Paleontology and Paleoanthropology, was invited to give a talk at the Artedi Lectures at the Royal Swedish Academy of Sciences in Stockholm, Sweden, on 5 December, 2008.
Adaptive Modulation with Channel Estimation in High-Speed Packet-Based OFDM Communication Systems
Institute of Scientific and Technical Information of China (English)
HOU Xiao-lin; WU Jun-li; YIN Chang-chuan; YUE Guang-xin
2004-01-01
In this paper, adaptive modulation with channel estimation in high-speed packet-based Orthogonal Frequency Division Multiplexing (OFDM) communication systems for beyond 3G are discussed. Different adaptive modulation and channel estimation methods are presented and compared, then those methods suitable for our intended application are chosen. Conclusions can be drawn from computer simulations that with proper selection of packet length and subband width, wide subband adaptive modulation with Least Square plus Discrete-time Fourier Transform (LS-DFT) channel estimation can give an acceptable performance with low complexity for channel with low Doppler shift and small path delay. Otherwise, narrow subband or subcarrier adaptive modulation together with LS-DFT plus Decision Directed (LS-DFT-DD) must be used.
Shortest Paths in Microseconds
Agarwal, Rachit; Godfrey, P Brighten; Zhao, Ben Y
2013-01-01
Computing shortest paths is a fundamental primitive for several social network applications including socially-sensitive ranking, location-aware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency while maintaining feasible memory requirements. We present ASAP, a system that achieves this goal by exploiting the structure of social networks. ASAP preprocesses a given network to compute and store a partial shortest path tree (PSPT) for each node. The PSPTs have the property that for any two nodes, each edge along the shortest path is with high probability contained in the PSPT of at least one of the nodes. We show that the structure of social networks enable the PSPT of each node to be an extremely small fraction of the entire network; hence, PSPTs can be stored efficiently and each shortest path can be computed extremely quickly. For a real network with 5 million nodes and 69 million edges, ASAP computes a short...
Intergenerational Transmission of Religious Giving: Instilling Giving Habits across the Life Course
Directory of Open Access Journals (Sweden)
Patricia Snell Herzog
2016-07-01
Full Text Available This paper investigates the research question: How do religious youth learn to give? While it is likely that youth learn religious financial giving from a variety of different sources, this investigation focuses primarily on how parents teach giving to their children. Supplementary data are also analyzed on the frequency in which youth hear extra-familial calls to give within their religious congregations. In focusing on parental transmission, the analysis identifies a number of approaches that parents report using to teach their children religious financial giving. It also investigates thoughts and feelings about religious financial giving by the children of these parents as a means of assessing the potential impacts of parental methods. Additionally, congregation member reflections on how they learned to give provide insights on giving as a process that develops across the life course, often instilled in childhood, but not appearing behaviorally until adulthood. As such, this paper contributes to a life course understanding of religious giving and has implications for giving across generations.
TRACING EFFICIENT PATH USING WEB PATH TRACING
Directory of Open Access Journals (Sweden)
L.K. Joshila Grace
2014-01-01
Full Text Available In the fast improving society, people depend on online purchase of goods than spending time physically. So there are lots of resources emerged for this online buying and selling of materials. Efficient and attractive web sites would be the best to sell the goods to people. To know whether a web site is reaching the mind of the customers or not, a high speed analysis is done periodically by the web developers. This works helps for the web site developers in knowing the weaker and stronger section of their web site. Parameters like frequency and utility are used for quantitative and qualitative analysis respectively. Addition to this down loads, book marks and the like/dislike of the particular web site is also considered. A new web path trace tree structure is implemented. A mathematical implementation is done to predict the efficient pattern used by the web site visitors.
Li, Fajie
2011-01-01
This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs i
When does an interest path "look good"? Criteria for an appropriate future interest rate path
Qvigstad, Jan F.
2006-01-01
Svensson (2004) suggested that a monetary policy committee of a central bank (MPC) should “find an instrument-rate path such that projections of inflation and output gap ‘look good’.” Academic literature on monetary policy gives guidance as to what the words “look good” means. However, there is a need for a translation of the theoretical framework into concrete criteria when an MPC shall evaluate interest rate paths in practice. Six criteria for an appropriate interest rate ...
Giving Birth No Longer Means Death
Institute of Scientific and Technical Information of China (English)
1999-01-01
GIVING birth to a child was a life-or-death struggle forthe mother and baby as late as the early half of thiscentury;an estimate survey revealed a mortality rate amongmothers as high as 15 per thousand and infant mortality as highas 200 per tnousand at that time.Midwifery was oftenpracticed by the mother-in-law,the mother herself,or morepopularly,by an elderly woman in the village who practiced
Giving to Africa and Perceptions of Poverty
Alvin Etang Ndip; David Fielding; Stephen Knowles
2010-01-01
We conduct a simple experiment in which student participants are invited to give some of the money that they have earned to an international development charity. In different treatments, participants are given different information about the country in which the donation will be spent. The information on the country includes the countryÕs income per capita and, in some treatments, different possible reasons as to why the country is poor. We find that experimental behaviour depends largely on ...
International Nuclear Information System (INIS)
These notes form a fairly standard introduction to Wiener integration on Rsup(n) and on Riemannian manifolds. Feynman path integrals for non-relativistic quantum mechanics are also considered and compared to Wiener integrals. The basic approach is via cylinder set measures, Gaussian measures, and abstract Wiener spaces. (Auth.)
International Nuclear Information System (INIS)
The problem of time evolution of a quantum-mechanical system, which is continually observed, is rev+sited. The theorem about ''Zeno's paradox'' due to Subarshan and Misra is strengthened. Recent results of Aharonov and Vardi about ''Feynman paths'' are obtained rigorously without particular assumptions about Hamiltonian and a measuring device
Adaptive kernel estimation of the L\\'evy density
Bec, Mélina
2012-01-01
This paper is concerned with adaptive kernel estimation of the L\\'evy density $N(x)$ for pure jump L\\'evy processes. The sample path is observed at $n$ discrete instants in the "high frequency" context ($ \\Delta $ = $ \\Delta_n $ tends to zero while $n \\Delta_n $ tends to infinity). We construct a collection of kernel estimators of the function $g(x)=xN(x)$ and propose a method of local adaptive selection of the bandwidth. We provide an oracle inequality and a rate of convergence for the quadratic pointwise risk. This rate is proved to be the optimal minimax rate. We give examples and simulation results for processes fitting in our framework.
Evolution of adaptation mechanisms: Adaptation energy, stress, and oscillating death.
Gorban, Alexander N; Tyukina, Tatiana A; Smirnova, Elena V; Pokidysheva, Lyudmila I
2016-09-21
In 1938, Selye proposed the notion of adaptation energy and published 'Experimental evidence supporting the conception of adaptation energy.' Adaptation of an animal to different factors appears as the spending of one resource. Adaptation energy is a hypothetical extensive quantity spent for adaptation. This term causes much debate when one takes it literally, as a physical quantity, i.e. a sort of energy. The controversial points of view impede the systematic use of the notion of adaptation energy despite experimental evidence. Nevertheless, the response to many harmful factors often has general non-specific form and we suggest that the mechanisms of physiological adaptation admit a very general and nonspecific description. We aim to demonstrate that Selye׳s adaptation energy is the cornerstone of the top-down approach to modelling of non-specific adaptation processes. We analyze Selye׳s axioms of adaptation energy together with Goldstone׳s modifications and propose a series of models for interpretation of these axioms. Adaptation energy is considered as an internal coordinate on the 'dominant path' in the model of adaptation. The phenomena of 'oscillating death' and 'oscillating remission' are predicted on the base of the dynamical models of adaptation. Natural selection plays a key role in the evolution of mechanisms of physiological adaptation. We use the fitness optimization approach to study of the distribution of resources for neutralization of harmful factors, during adaptation to a multifactor environment, and analyze the optimal strategies for different systems of factors. PMID:26801872
Path Constitution Analysis: A Methodology for Understanding Path Dependence and Path Creation
Sydow, Jörg; Windeler, Arnold; Müller-Seitz, Gordon; Lange, Knut
2012-01-01
Although an increasing number of studies of technological, institutional and organizational change refer to the concepts of path dependence and path creation, few attempts have been made to consider these concepts explicitly in their methodological accounts. This paper addresses this gap and contributes to the literature by developing a comprehensive methodology that originates from the concepts of path dependence and path creation – path constitution analysis (PCA) – and allows for the integ...
Nurses' intentions to give lifestyle support.
McKenzie, Karen
Models of behaviour change can help identify factors that influence health behaviours such as eating a healthy diet and physical activity. The Theory of Planned Behaviour has been shown to be relatively effective at predicting people's intention to engage in health-related behaviours. More recent research has explored whether it can help predict the intentions of one group of people to support another group to engage in healthy behaviour. This has implications for nurses, who are often facilitators of patient health. This article gives an overview of the model and discusses its potential implications for nurses.
Nurses' intentions to give lifestyle support.
McKenzie, Karen
Models of behaviour change can help identify factors that influence health behaviours such as eating a healthy diet and physical activity. The Theory of Planned Behaviour has been shown to be relatively effective at predicting people's intention to engage in health-related behaviours. More recent research has explored whether it can help predict the intentions of one group of people to support another group to engage in healthy behaviour. This has implications for nurses, who are often facilitators of patient health. This article gives an overview of the model and discusses its potential implications for nurses. PMID:25087266
AWG Foundation to give new award
The Association for Women Geoscientists Foundation will give its first Outstanding Educator Award at the Geological Society of America meeting in November in Denver, Colo., and is asking for nominations. The award was established to honor college and university teachers who have demonstrated support for their women students.Nominees must teach at institutions that grant undergraduate or advanced degrees in Earth science fields. Support for women students can take many forms, for example, appointing them to committees, recommending them for employment, nominating them for awards, encouraging them to explore career options, and sustaining them while they finish academic work.
Performance analysis of FXLMS algorithm with secondary path modeling error
Institute of Scientific and Technical Information of China (English)
SUN Xu; CHEN Duanshi
2003-01-01
Performance analysis of filtered-X LMS (FXLMS) algorithm with secondary path modeling error is carried out in both time and frequency domain. It is shown firstly that the effects of secondary path modeling error on the performance of FXLMS algorithm are determined by the distribution of the relative error of secondary path model along with frequency.In case of that the distribution of relative error is uniform the modeling error of secondary path will have no effects on the performance of the algorithm. In addition, a limitation property of FXLMS algorithm is proved, which implies that the negative effects of secondary path modeling error can be compensated by increasing the adaptive filter length. At last, some insights into the "spillover" phenomenon of FXLMS algorithm are given.
Automatic tool path generation for finish machining
Energy Technology Data Exchange (ETDEWEB)
Kwok, Kwan S.; Loucks, C.S.; Driessen, B.J.
1997-03-01
A system for automatic tool path generation was developed at Sandia National Laboratories for finish machining operations. The system consists of a commercially available 5-axis milling machine controlled by Sandia developed software. This system was used to remove overspray on cast turbine blades. A laser-based, structured-light sensor, mounted on a tool holder, is used to collect 3D data points around the surface of the turbine blade. Using the digitized model of the blade, a tool path is generated which will drive a 0.375 inch diameter CBN grinding pin around the tip of the blade. A fuzzified digital filter was developed to properly eliminate false sensor readings caused by burrs, holes and overspray. The digital filter was found to successfully generate the correct tool path for a blade with intentionally scanned holes and defects. The fuzzified filter improved the computation efficiency by a factor of 25. For application to general parts, an adaptive scanning algorithm was developed and presented with simulation results. A right pyramid and an ellipsoid were scanned successfully with the adaptive algorithm.
Dvořák, Tomáš; Gregor, Petr; Koubek, Václav
2005-01-01
Given a family \\u_i,v_i\\_i=1^k of pairwise distinct vertices of the n-dimensional hypercube Q_n such that the distance of u_i and v_i is odd and k≤n-1, there exists a family \\P_i\\_i=1^k of paths such that u_i and v_i are the endvertices of P_i and \\V(P_i)\\_i=1^k partitions V(Q_n). This holds for any n≥2 with one exception in the case when n=k+1=4. On the other hand, for any n≥3 there exist n pairs of vertices satisfying the above condition for which such a family of spanning paths does not ex...
Chew, Geoffrey F
2008-01-01
Arrowed-time divergence-free rules or cosmological quantum dynamics are formulated through stepped Feynman paths across macroscopic slices of Milne spacetime. Slice boundaries house totally-relativistic rays representing elementary entities--preons. Total relativity and the associated preon Fock space, despite distinction from special relativity (which lacks time arrow), are based on the Lorentz group. Each path is a set of cubic vertices connected by straight, directed and stepped arcs that carry inertial, electromagnetic and gravitational action. The action of an arc step comprises increments each bounded by Planck's constant. Action from extremely-distant sources is determined by universe mean energy density. Identifying the arc-step energy that determines inertial action with that determining gravitational action establishes both arc-step length and universe density. Special relativity is accurate for physics at laboratory spacetime scales far below that of Hubble and far above that of Planck.
Learning to improve path planning performance
International Nuclear Information System (INIS)
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
Damage detection using frequency shift path
Wang, Longqi; Lie, Seng Tjhen; Zhang, Yao
2016-01-01
This paper introduces a novel concept called FREquency Shift (FRESH) path to describe the dynamic behavior of structures with auxiliary mass. FRESH path combines the effects of frequency shifting and amplitude changing into one space curve, providing a tool for analyzing structure health status and properties. A damage index called FRESH curvature is then proposed to detect local stiffness reduction. FRESH curvature can be easily adapted for a particular problem since the sensitivity of the index can be adjusted by changing auxiliary mass or excitation power. An algorithm is proposed to adjust automatically the contribution from frequency and amplitude in the method. Because the extraction of FRESH path requires highly accurate frequency and amplitude estimators; therefore, a procedure based on discrete time Fourier transform is introduced to extract accurate frequency and amplitude with the time complexity of O (n log n), which is verified by simulation signals. Moreover, numerical examples with different damage sizes, severities and damping are presented to demonstrate the validity of the proposed damage index. In addition, applications of FRESH path on two steel beams with different damages are presented and the results show that the proposed method is valid and computational efficient.
Quad-rotor flight path energy optimization
Kemper, Edward
Quad-Rotor unmanned areal vehicles (UAVs) have been a popular area of research and development in the last decade, especially with the advent of affordable microcontrollers like the MSP 430 and the Raspberry Pi. Path-Energy Optimization is an area that is well developed for linear systems. In this thesis, this idea of path-energy optimization is extended to the nonlinear model of the Quad-rotor UAV. The classical optimization technique is adapted to the nonlinear model that is derived for the problem at hand, coming up with a set of partial differential equations and boundary value conditions to solve these equations. Then, different techniques to implement energy optimization algorithms are tested using simulations in Python. First, a purely nonlinear approach is used. This method is shown to be computationally intensive, with no practical solution available in a reasonable amount of time. Second, heuristic techniques to minimize the energy of the flight path are tested, using Ziegler-Nichols' proportional integral derivative (PID) controller tuning technique. Finally, a brute force look-up table based PID controller is used. Simulation results of the heuristic method show that both reliable control of the system and path-energy optimization are achieved in a reasonable amount of time.
Learning to improve path planning performance
Energy Technology Data Exchange (ETDEWEB)
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.
Ranking paths in stochastic time-dependent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele D.
2014-01-01
In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless...... be easily extended to the ranking of the first K shortest paths. Our method exploits the solution of the time-adaptive routing problem as a relaxation of the a priori problem. Computational results are presented showing that, under realistic distributions of travel times and costs, our solution methods...
Giving Devices the Ability to Exercise Reason
Directory of Open Access Journals (Sweden)
Thomas Keeley
2008-10-01
Full Text Available One of the capabilities that separates humans from computers has been the ability to exercise "reason / judgment". Computers and computerized devices have provided excellent platforms for following rules. Computer programs provide the scripts for processing the rules. The exercise of reason, however, is more of an image processing function than a function composed of a series of rules. The exercise of reason is more right brain than left brain. It involves the interpretation of information and balancing inter-related alternatives. This paper will discuss a new way to define and process information that will give devices the ability to exercise human-like reasoning and judgment. The paper will discuss the characteristics of a "dynamic graphical language" in the context of addressing judgment, since judgment is often required to adjust rules when operating in a dynamic environment. The paper will touch on architecture issues and how judgment is integrated with rule processing.
PATHS groundwater hydrologic model
Energy Technology Data Exchange (ETDEWEB)
Nelson, R.W.; Schur, J.A.
1980-04-01
A preliminary evaluation capability for two-dimensional groundwater pollution problems was developed as part of the Transport Modeling Task for the Waste Isolation Safety Assessment Program (WISAP). Our approach was to use the data limitations as a guide in setting the level of modeling detail. PATHS Groundwater Hydrologic Model is the first level (simplest) idealized hybrid analytical/numerical model for two-dimensional, saturated groundwater flow and single component transport; homogeneous geology. This document consists of the description of the PATHS groundwater hydrologic model. The preliminary evaluation capability prepared for WISAP, including the enhancements that were made because of the authors' experience using the earlier capability is described. Appendixes A through D supplement the report as follows: complete derivations of the background equations are provided in Appendix A. Appendix B is a comprehensive set of instructions for users of PATHS. It is written for users who have little or no experience with computers. Appendix C is for the programmer. It contains information on how input parameters are passed between programs in the system. It also contains program listings and test case listing. Appendix D is a definition of terms.
Giving to Family versus Giving to the Community Within and Across Generations
Partha Deb; Cagla Okten; Una Okonkwo Osili
2002-01-01
In this paper, we examine relationship between giving to family, and community institutions, within and across generations, a previously unexplored subject. We investigate the relationship between these two types of transfer networks using new data from the Indonesian Family Life Surveys (IFLS). From our results, financial transfers to family members are positively correlated with giving to community organizations for both parent or origin households and adult split-offs living outside their ...
Quantum Measurement and Extended Feynman Path Integral
Institute of Scientific and Technical Information of China (English)
文伟; 白彦魁
2012-01-01
Quantum measurement problem has existed many years and inspired a large of literature in both physics and philosophy, but there is still no conclusion and consensus on it. We show it can be subsumed into the quantum theory if we extend the Feynman path integral by considering the relativistic effect of Feynman paths. According to this extended theory, we deduce not only the Klein-Gordon equation, but also the wave-function-collapse equation. It is shown that the stochastic and instantaneous collapse of the quantum measurement is due to the ＂potential noise＂ of the apparatus or environment and ＂inner correlation＂ of wave function respectively. Therefore, the definite-status of the macroscopic matter is due to itself and this does not disobey the quantum mechanics. This work will give a new recognition for the measurement problem.
Broadband Phase Spectroscopy over Turbulent Air Paths.
Giorgetta, Fabrizio R; Rieker, Gregory B; Baumann, Esther; Swann, William C; Sinclair, Laura C; Kofler, Jon; Coddington, Ian; Newbury, Nathan R
2015-09-01
Broadband atmospheric phase spectra are acquired with a phase-sensitive dual-frequency-comb spectrometer by implementing adaptive compensation for the strong decoherence from atmospheric turbulence. The compensation is possible due to the pistonlike behavior of turbulence across a single spatial-mode path combined with the intrinsic frequency stability and high sampling speed associated with dual-comb spectroscopy. The atmospheric phase spectrum is measured across 2 km of air at each of the 70,000 comb teeth spanning 233 cm(-1) across hundreds of near-infrared rovibrational resonances of CO(2), CH(4), and H(2)O with submilliradian uncertainty, corresponding to a 10(-13) refractive index sensitivity. Trace gas concentrations extracted directly from the phase spectrum reach 0.7 ppm uncertainty, demonstrated here for CO(2). While conventional broadband spectroscopy only measures intensity absorption, this approach enables measurement of the full complex susceptibility even in practical open path sensing.
Path Integral for Quantum Operations
Tarasov, Vasily E.
2007-01-01
In this paper we consider a phase space path integral for general time-dependent quantum operations, not necessarily unitary. We obtain the path integral for a completely positive quantum operation satisfied Lindblad equation (quantum Markovian master equation). We consider the path integral for quantum operation with a simple infinitesimal generator.
Path planning in dynamic environments
Berg, J.P. van den
2007-01-01
Path planning plays an important role in various fields of application, such as CAD design, computer games and virtual environments, molecular biology, and robotics. In its most general form, the path planning problem is formulated as finding a collision-free path for a moving entity between a start
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...... or economic processes have multiple possible paths of outcomes, rather than a unique path of equilibria. The selection among outcomes may depend on contingent choices or events - outcomes of path-dependent processes require a very relevant study - a perception of history....
Mehhtz, Peter
2005-01-01
JPF is an explicit state software model checker for Java bytecode. Today, JPF is a swiss army knife for all sort of runtime based verification purposes. This basically means JPF is a Java virtual machine that executes your program not just once (like a normal VM), but theoretically in all possible ways, checking for property violations like deadlocks or unhandled exceptions along all potential execution paths. If it finds an error, JPF reports the whole execution that leads to it. Unlike a normal debugger, JPF keeps track of every step how it got to the defect.
Thermoalgebras and path integral
Khanna, F. C.; Malbouisson, A. P. C.; Malbouisson, J. M. C.; Santana, A. E.
2009-09-01
Using a representation for Lie groups closely associated with thermal problems, we derive the algebraic rules of the real-time formalism for thermal quantum field theories, the so-called thermo-field dynamics (TFD), including the tilde conjugation rules for interacting fields. These thermo-group representations provide a unified view of different approaches for finite-temperature quantum fields in terms of a symmetry group. On these grounds, a path integral formalism is constructed, using Bogoliubov transformations, for bosons, fermions and non-abelian gauge fields. The generalization of the results for quantum fields in (S1)d×R topology is addressed.
Directory of Open Access Journals (Sweden)
Jamie Waters
2014-09-01
Full Text Available This project uses Newton’s Second Law of Motion, Euler’s method, basic physics, and basic calculus to model the flight path of a rocket. From this, one can find the height and velocity at any point from launch to the maximum altitude, or apogee. This can then be compared to the actual values to see if the method of estimation is a plausible. The rocket used for this project is modeled after Bullistic-1 which was launched by the Society of Aeronautics and Rocketry at the University of South Florida.
Noncommutative Quantum Mechanics with Path Integral
Dragovich, B; Dragovich, Branko; Rakic, Zoran
2005-01-01
We consider classical and quantum mechanics related to an additional noncommutativity, symmetric in position and momentum coordinates. We show that such mechanical system can be transformed to the corresponding one which allows employment of the usual formalism. In particular, we found explicit connections between quadratic Hamiltonians and Lagrangians, in their commutative and noncommutative regimes. In the quantum case we give general procedure how to compute Feynman's path integral in this noncommutative phase space with quadratic Lagrangians (Hamiltonians). This approach is applied to a charged particle in the noncommutative plane exposed to constant homogeneous electric and magnetic fields.
Cognitive patterns: giving autonomy some context
Dumond, Danielle; Stacy, Webb; Geyer, Alexandra; Rousseau, Jeffrey; Therrien, Mike
2013-05-01
Today's robots require a great deal of control and supervision, and are unable to intelligently respond to unanticipated and novel situations. Interactions between an operator and even a single robot take place exclusively at a very low, detailed level, in part because no contextual information about a situation is conveyed or utilized to make the interaction more effective and less time consuming. Moreover, the robot control and sensing systems do not learn from experience and, therefore, do not become better with time or apply previous knowledge to new situations. With multi-robot teams, human operators, in addition to managing the low-level details of navigation and sensor management while operating single robots, are also required to manage inter-robot interactions. To make the most use of robots in combat environments, it will be necessary to have the capability to assign them new missions (including providing them context information), and to have them report information about the environment they encounter as they proceed with their mission. The Cognitive Patterns Knowledge Generation system (CPKG) has the ability to connect to various knowledge-based models, multiple sensors, and to a human operator. The CPKG system comprises three major internal components: Pattern Generation, Perception/Action, and Adaptation, enabling it to create situationally-relevant abstract patterns, match sensory input to a suitable abstract pattern in a multilayered top-down/bottom-up fashion similar to the mechanisms used for visual perception in the brain, and generate new abstract patterns. The CPKG allows the operator to focus on things other than the operation of the robot(s).
A discrete history of the Lorentzian path integral
Loll, R.
2006-01-01
In these lecture notes, I describe the motivation behind a recent formulation of a non-perturbative gravitational path integral for Lorentzian (instead of the usual Euclidean) space-times, and give a pedagogical introduction to its main features. At the regularized, discrete level this approach solv
Teaching Techniques: Give or Take? Test Review in the ESL/EFL Classroom
Mermelstein, Aaron David
2016-01-01
This article describes "Give or Take?", a fun game that teachers can use to review vocabulary in the English as a second language or foreign language (ESL/EFL) classroom. This game is easy to prepare, and it is a fun and efficient way to review for quizzes or larger midterm or final exams. It can be adapted to almost any grade level or…
Polymer density functional approach to efficient evaluation of path integrals
DEFF Research Database (Denmark)
Brukhno, Andrey; Vorontsov-Velyaminov, Pavel N.; Bohr, Henrik
2005-01-01
A polymer density functional theory (P-DFT) has been extended to the case of quantum statistics within the framework of Feynman path integrals. We start with the exact P-DFT formalism for an ideal open chain and adapt its efficient numerical solution to the case of a ring. We show that, similarly...
Institute of Scientific and Technical Information of China (English)
陆岷峰; 史丽霞
2014-01-01
LOpment Law,fOLLOw the principLe Of the Law Of vaLue. This paper aLsO gives the basic strategies Of cOmmerciaL bank executive pay refOrm under the new nOrmaL back-grOund,such as prOmOte the restrictive Ownership system,stOck OptiOn system and the perfOrmance recycLing system, increase the deferred payments,buiLd sOciaL parity guidance and active prOfessiOnaL manager market,and imprOve the gOvernance structure Of cOmmerciaL banks.
AUV Local Path Planning Based on Acoustic Image Processing
Institute of Scientific and Technical Information of China (English)
LI Ye; CHANG Wen-tian; JIANG Da-peng; ZHANG Tie-dong; SU Yu-min
2006-01-01
The forward-looking image sonar is a necessary vision device for Autonomous Underwater Vehicles (AUV). Based on the acoustic image received from forward-looking image sonar, AUV local path is planned. When the environment model is made to adapt to local path planning, an iterative algorithm of binary conversion is used for image segmentation. Raw data of the acoustic image, which were received from serial port, are processed. By the use of "Mathematic Morphology" to filter noise, a mathematic model of environment for local path planning is established after coordinate transformation. The optimal path is searched by the distant transmission (Dt) algorithm. Simulation is conducted for the analysis of the algorithm. Experiment on the sea proves it reliable.
Path Integral Quantization of the Symplectic Leaves of the SU(2)* Poisson-Lie Group
Morariu, Bogdan
1997-01-01
The Feynman path integral is used to quantize the symplectic leaves of the Poisson-Lie group SU(2)*. In this way we obtain the unitary representations of U_q(su(2)). This is achieved by finding explicit Darboux coordinates and then using a phase space path integral. I discuss the *-structure of SU(2)* and give a detailed description of its leaves using various parametrizations and also compare the results with the path integral quantization of spin.
Krenn, Mario; Lahiri, Mayukh; Zeilinger, Anton
2016-01-01
Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional photonic systems, exploiting an idea introduced by the group of Leonard Mandel 25 years ago. The two ingredients are 1) superposition of photon pairs with different origins and 2) aligning photon paths such that they emerge from the same output mode. We explain examples for the creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces -- starting only from separable (non-entangled) photon pairs. For two photons, we show how arbitrary high-dimensional entanglement can be created. Interestingly, a common source for two-photon polarization entanglement is found as a special case. We discovered the technique by analyzing the output of a computer algorithm designing quantum experiments, and generalized it ...
Directory of Open Access Journals (Sweden)
Li Jian
2016-01-01
Full Text Available The world has entered the information age, all kinds of information technologies such as cloud technology, big data technology are in rapid development, and the “Internet plus” appeared. The main purpose of “Internet plus” is to provide an opportunity for the further development of the enterprise, the enterprise technology, business and other aspects of factors combine. For enterprises, grasp the “Internet plus” the impact of the market economy will undoubtedly pave the way for the future development of enterprises. This paper will be on the innovation path of the enterprise management “Internet plus” era tied you study, hope to be able to put forward some opinions and suggestions.
Adapting agriculture to climate change
Howden, S.M.; Soussana, J.F.; Tubiello, F.N.; Chhetri, N.; Dunlop, M.; Meinke, H.B.
2007-01-01
The strong trends in climate change already evident, the likelihood of further changes occurring, and the increasing scale of potential climate impacts give urgency to addressing agricultural adaptation more coherently. There are many potential adaptation options available for marginal change of exi
Optimal Path Selection for Mobile Robot Navigation Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
D Tamilselvi
2011-07-01
Full Text Available The proposed Navigation Strategy using GA(Genetic Algorithm finds an optimal path in the simulated grid environment. GA forces to find a path that is connected to the robot start and target positions via predefined points. Each point in the environmental model is called genome and the path connecting Start and Target is called as Chromosome. According to the problem formulation, the length of the algorithm chromosomes (number of genomes is dynamic. Moreover every genome is not a simple digit. In this case, every genome represents the nodes in the 2D grid environment. After implementing the cross over and mutation concepts the resultant chromosome (path is subjected to optimization process which gives the optimal path as a result. The problem faced with is there may be chances for the loss of the fittest chromosome while performing the reproduction operations. The solution is achieved by inducing the concept of elitism thereby maintaining the population richness. The efficiency of the algorithm is analyzed with respect to execution time and path cost to reach the destination. Path planning, collision avoidance and obstacle avoidance are achieved in both static and dynamic environment.
Adaptive Clustering of Hypermedia Documents.
Johnson, Andrew; Fotouhi, Farshad
1996-01-01
Discussion of hypermedia systems focuses on a comparison of two types of adaptive algorithm (genetic algorithm and neural network) in clustering hypermedia documents. These clusters allow the user to index into the nodes to find needed information more quickly, since clustering is "personalized" based on the user's paths rather than representing…
Risk Sensitive Path Integral Control
Broek, L.J. van den; Wiegerinck, W.A.J.J.; Kappen, H. J.
2012-01-01
Recently path integral methods have been developed for stochastic optimal control for a wide class of models with non-linear dynamics in continuous space-time. Path integral methods find the control that minimizes the expected cost-to-go. In this paper we show that under the same assumptions, path integral methods generalize directly to risk sensitive stochastic optimal control. Here the method minimizes in expectation an exponentially weighted cost-to-go. Depending on the exponential weight,...
Thomas, EGF
1996-01-01
We construct an analogue of the Feynman path integral for the case of -1/i partial derivative/partial derivative t phi t = H-o phi t in which H-o is a self-adjoint operator in the space L(2)(M) = C-M, where M is a finite set, the paths being functions of R with values in M. The path integral is a fa
Path Integral and Asian Options
Peng Zhang
2010-01-01
In this paper we analytically study the problem of pricing an arithmetically averaged Asian option in the path integral formalism. By a trick about the Dirac delta function, the measure of the path integral is defined by an effective action functional whose potential term is an exponential function. This path integral is evaluated by use of the Feynman-Kac theorem. After working out some auxiliary integrations involving Bessel and Whittaker functions, we arrive at the spectral expansion for t...
Spin Path Integral And Quantum Mechanics In Rotating Reference of Frame
Chern, Tong; Ning, Wu; Yue, YU
2011-01-01
We developed a path integral formalism for the quantum mechanics in a rotating reference of frame, and proposed a spin path integral description for the spin degrees of freedom in it. We have also give some examples for the applications of our foramlism.
Path Constitution Analysis: A Methodology for Understanding Path Dependence and Path Creation
Directory of Open Access Journals (Sweden)
Jörg Sydow
2012-11-01
Full Text Available Although an increasing number of studies of technological, institutional and organizational change refer to the concepts of path dependence and path creation, few attempts have been made to consider these concepts explicitly in their methodological accounts. This paper addresses this gap and contributes to the literature by developing a comprehensive methodology that originates from the concepts of path dependence and path creation – path constitution analysis (PCA – and allows for the integration of multi-actor constellations on multiple levels of analysis within a process perspective. Based upon a longitudinal case study in the field of semiconductors, we illustrate PCA ‘in action’ as a template for other researchers and critically examine its adequacy. We conclude with implications for further path-oriented inquiries.
Rethinking the social and cultural dimensions of charitable giving
DEFF Research Database (Denmark)
Bajde, Domen
2009-01-01
-giving and focuses on charitable gifts as an emblem of postmodern gift-giving to distant others. Historical evidence and sociological theory on postmodern solidarity are combined to shed light on the fluid duality of contemporary giving and the importance of the imaginary in charitable giving. The outlined socially...... symbolic dimensions of charitable giving are critically examined in light of postmodern consumer culture and the recent social corporate responsibility trends. By openly engaging the proposed complexities of gift-giving, our vocabulary and understanding of postmodern giving can be revised so as to invite...
Petersen, Kjell Yngve; Søndergaard, Karin; Kongshaug, Jesper
2015-01-01
Adaptive LightingAdaptive lighting is based on a partial automation of the possibilities to adjust the colour tone and brightness levels of light in order to adapt to people’s needs and desires. IT support is key to the technical developments that afford adaptive control systems. The possibilities offered by adaptive lighting control are created by the ways that the system components, the network and data flow can be coordinated through software so that the dynamic variations are controlled i...
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 is...
Path Integral Simulations of Graphene
Yousif, Hosam
2007-10-01
Some properties of graphene are explored using a path integral approach. The path integral method allows us to simulate relatively large systems using monte carlo techniques and extract thermodynamic quantities. We simulate the effects of screening a large external charge potential, as well as conductivity and charge distributions in graphene sheets.
Rainbow paths with prescribed ends
DEFF Research Database (Denmark)
Alishahi, Meysam; Taherkhani, Ali; Thomassen, Carsten
2011-01-01
It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs. Preprint] that, if G is a connected graph distinct from C-7, then there is a chi(G)-coloring of G in which every vertex v is an element of V(G) is an initial vertex of a path P with chi...
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...
Directory of Open Access Journals (Sweden)
Hiromi Yamamoto
2005-12-01
Full Text Available The uses of fossil fuels cause not only the resources exhaustion but also the environmental problems such as global warming. The purposes of this study are to evaluate paths toward sustainable energy systems and roles of each renewable. In order to realize the purposes, the authors developed the global land use and energy model that figured the global energy supply systems in the future considering the cost minimization. Using the model, the authors conducted a simulation in C30R scenario, which is a kind of strict CO2 emission limit scenarios and reduced CO2 emissions by 30% compared with Kyoto protocol forever scenario, and obtained the following results. In C30R scenario bioenergy will supply 33% of all the primary energy consumption. However, wind and photovoltaic will supply 1.8% and 1.4% of all the primary energy consumption, respectively, because of the limits of power grid stability. The results imply that the strict limits of CO2 emissions are not sufficient to achieve the complete renewable energy systems. In order to use wind and photovoltaic as major energy resources, we need not only to reduce the plant costs but also to develop unconventional renewable technologies.
Ask-Elle: an adaptable programming tutor for Haskell giving automated feedback
Gerdes, Alex; Heeren, Bastiaan; Jeuring, J.T.; Binsbergen, Thomas van
2015-01-01
Ask-Elle is a tutor for learning the higher-order, strongly-typed functional programming language Haskell. It supports the stepwise development of Haskell programs by verifying the correctness of incomplete programs, and by providing hints. Programming exercises are added to Ask-Elle by providing a
Intelligent Speed Adaptation in Company Vehicles
DEFF Research Database (Denmark)
Agerholm, Niels; Tradisauskas, Nerius; Waagepetersen, Rasmus;
2008-01-01
This paper describes an intelligent speed adaptation project for company vehicles. The intelligent speed adaptation function in the project is both information and incentive, which means that the intelligent speed adaptation equipment gives a warning as well as penalty points if the driver...
LP-Based Approximation Algorithms for Traveling Salesman Path Problems
An, Hyung-Chan
2011-01-01
We present a (5/3 - epsilon)-approximation algorithm for some constant epsilon>0 for the traveling salesman path problem under the unit-weight graphical metric, and prove an upper bound on the integrality gap of the path-variant Held-Karp relaxation both under this metric and the general metric. Given a complete graph with the metric cost and two designated endpoints in the graph, the traveling salesman path problem is to find a minimum Hamiltonian path between these two endpoints. The best previously known performance guarantee for this problem was 5/3 and was due to Hoogeveen. We give the first constant upper bound on the integrality gap of the path-variant Held-Karp relaxation, showing it to be at most 5/3 by providing a new analysis of Hoogeveen's algorithm. This analysis exhibits a well-characterized critical case, and we show that the recent result of Oveis Gharan, Saberi and Singh on the traveling salesman circuit problem under the unit-weight graphical metric can be modified for the path case to compl...
Bjälkebring, Pär; Västfjäll, Daniel; Dickert, Stephan; Slovic, Paul
2016-01-01
Older adults have been shown to avoid negative and prefer positive information to a higher extent than younger adults. This positivity bias influences their information processing as well as decision-making. We investigate age-related positivity bias in charitable giving in two studies. In Study 1 we examine motivational factors in monetary donations, while Study 2 focuses on the emotional effect of actual monetary donations. In Study 1, participants (n = 353, age range 20-74 years) were asked to rate their affect toward a person in need and then state how much money they would be willing to donate to help this person. In Study 2, participants (n = 108, age range 19-89) were asked to rate their affect toward a donation made a few days prior. Regression analysis was used to investigate whether or not the positivity bias influences the relationship between affect and donations. In Study 1, we found that older adults felt more sympathy and compassion and were less motivated by negative affect when compared to younger adults, who were motivated by both negative and positive affect. In Study 2, we found that the level of positive emotional reactions from monetary donations was higher in older participants compared to younger participants. We find support for an age-related positivity bias in charitable giving. This is true for motivation to make a future donation, as well as affective thinking about a previous donation. We conclude that older adults draw more positive affect from both the planning and outcome of monetary donations and hence benefit more from engaging in monetary charity than their younger counterparts. PMID:27378966
On the direct path problem of s-elementary frame wavelets
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper, we discuss the path-connectivity between two s-elementary normalized tight frame wavelets via the so-called direct paths. We show that the existence of such a direct path is equivalent to the non-existence of an atom of a σ-algebra defined over the defining sets of the corresponding frame wavelets, using a mapping defined by the natural translation and dilation operations between the sets. In particular, this gives an equivalent condition for the existence of a direct path between two s-elementary wavelets.
Adaptive radar resource management
Moo, Peter
2015-01-01
Radar Resource Management (RRM) is vital for optimizing the performance of modern phased array radars, which are the primary sensor for aircraft, ships, and land platforms. Adaptive Radar Resource Management gives an introduction to radar resource management (RRM), presenting a clear overview of different approaches and techniques, making it very suitable for radar practitioners and researchers in industry and universities. Coverage includes: RRM's role in optimizing the performance of modern phased array radars The advantages of adaptivity in implementing RRMThe role that modelling and
2010-01-01
... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Takeoff path. 23.57 Section 23.57... path. For each commuter category airplane, the takeoff path is as follows: (a) The takeoff path extends... completed; and (1) The takeoff path must be based on the procedures prescribed in § 23.45; (2) The...
Institute of Scientific and Technical Information of China (English)
XIANG; Kainan
2001-01-01
［1］ Cruzeiro, A. B., Malliavin, P., Renormalized differential geometry on path spaces: Structural equation, curvature, J. Funct. Anal., 1996, 139: 119-181.［2］ Stroock, D. W., Some thoughts about Riemannian structures on path spaces, preprint, 1996.［3］ Driver, B., A Cameron-Martin type quasi-invariance theorem for Brownian motion on a compact manifold, J. Funct. Anal., 1992, 109: 272-376.［4］ Enchev, O., Stroock, D. W., Towards a Riemannian geometry on the path space over a Riemannian manifold, J. Funct. Anal., 1995, 134: 392-416.［5］ Hsu, E., Quasi-invariance of the Wiener measure on the path space over a compact Riemannian manifold, J. Funct. Anal., 1995, 134: 417-450.［6］ Lyons, T. J., Qian, Z. M., A class of vector fields on path space, J.Funct. Anal., 1997, 145: 205-223.［7］ Li, X. D., Existence and uniqueness of geodesics on path spaces, J. Funct. Anal., to be published.［8］ Driver, B., Towards calculus and geometry on path spaces, in Proc. Symp. Pure and Appl. Math. 57 (ed. Cranston, M., Pinsky, M.), Cornell: AMS, 1993, 1995.
Measey, John G.; Vences, M.; Drewes, R. C.; Chiari, Y.; Melo, M.; Bourlès, Bernard
2007-01-01
Aim Amphibians are a model group for studies of the biogeographical origins of salt-intolerant taxa on oceanic islands. We used the Gulf of Guinea islands to explore the biogeographical origins of island endemism of one species of frog, and used this to gain insights into potential colonization mechanisms. Location Sao Tome and Principe, two of the four major islands in the Gulf of Guinea, West Africa, are truly oceanic and have an exceptionally high biodiversity. Methods Mitochondrial DNA is...
Path Dependent Option Pricing: the path integral partial averaging method
Andrew Matacz
2000-01-01
In this paper I develop a new computational method for pricing path dependent options. Using the path integral representation of the option price, I show that in general it is possible to perform analytically a partial averaging over the underlying risk-neutral diffusion process. This result greatly eases the computational burden placed on the subsequent numerical evaluation. For short-medium term options it leads to a general approximation formula that only requires the evaluation of a one d...
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...
Who gives? Multilevel effects of gender and ethnicity on workplace charitable giving.
Leslie, Lisa M; Snyder, Mark; Glomb, Theresa M
2013-01-01
Research on diversity in organizations has largely focused on the implications of gender and ethnic differences for performance, to the exclusion of other outcomes. We propose that gender and ethnic differences also have implications for workplace charitable giving, an important aspect of corporate social responsibility. Drawing from social role theory, we hypothesize and find that gender has consistent effects across levels of analysis; women donate more money to workplace charity than do men, and the percentage of women in a work unit is positively related to workplace charity, at least among men. Alternatively and consistent with social exchange theory, we hypothesize and find that ethnicity has opposing effects across levels of analysis; ethnic minorities donate less money to workplace charity than do Whites, but the percentage of minorities in a work unit is positively related to workplace charity, particularly among minorities. The findings provide a novel perspective on the consequences of gender and ethnic diversity in organizations and highlight synergies between organizational efforts to increase diversity and to build a reputation for corporate social responsibility. PMID:22985116
Chaichian, M.; Demichev, A. P.
1993-01-01
Using differential and integral calculi on the quantum plane which are invariant with respect to quantum inhomogeneous Euclidean group E(2)q , we construct path integral representation for the quantum mechanical evolution operator kernel of q-oscillator.
The Internet's unexploited path diversity
Arjona-Villicaña, Pedro David; Stepanenko, Alexander S
2009-01-01
The connectivity of the Internet at the Autonomous System level is influenced by the network operator policies implemented. These in turn impose a direction to the announcement of address advertisements and, consequently, to the paths that can be used to reach back such destinations. We propose to use directed graphs to properly represent how destinations propagate through the Internet and the number of arc-disjoint paths to quantify this network's path diversity. Moreover, in order to understand the effects that policies have on the connectivity of the Internet, numerical analyses of the resulting directed graphs were conducted. Results demonstrate that, even after policies have been applied, there is still path diversity which the Border Gateway Protocol cannot currently exploit.
Adaptive positioner; Posicionador adaptativo
Energy Technology Data Exchange (ETDEWEB)
Labrador Pavon, I.
1993-07-01
This paper describes the circuits and programs in assembly language, developed to control the two DC motors that give mobility to a mechanical arm with two degrees of freedom. As a whole, the system is based in a adaptable regulator designed around a 8 bit microprocessor that, starting from a mode of regulation based in the successive approximation method, evolve to another mode through which, only one approximation is sufficient to get the right position of each motor. (Author) 6 refs.
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.
Bailleul, Ismael
2012-01-01
We show in this work how the familiar Taylor formula can be used in a simple way to reprove from scratch the main existence and well-posedness results from rough paths theory; the explosion question and Taylor expansion are also dealt with. Unlike other approaches, we work mainly with flows of maps rather than with paths. We illustrate our approach by proving a well-posedness result for some mean field rough differential equation.
Path Integral for Lattice Staggered Fermions in the Loop Representation
Aroca, J M; Gambini, R
1998-01-01
The path integral formulation in terms of loop variables is introduced for lattice gauge theories with dynamical fermions. The path integral of lattice compact QED with staggered fermions is expressed as a sum over surfaces with border on self-avoiding fermionic paths. Each surface is weighted with a classical action -- written in terms of integer gauge invariant variables -- which gives via transfer matrix method the Hamiltonian of the loop or P-representation. The surfaces correspond to the world sheets of loop-like pure electric flux excitations and meson-like configurations (open electric flux tubes carrying matter fields at their ends). The gauge non-redundancy and the geometric transparency are two appealing features of this description. From the computational point of view, it involves fewer degrees of freedom than the Kogut-Susskind formulation and offers the possibility of alternative numerical methods for dynamical fermions.
DEFF Research Database (Denmark)
Petersen, Kjell Yngve; Søndergaard, Karin; Kongshaug, Jesper
2015-01-01
Adaptive Lighting Adaptive lighting is based on a partial automation of the possibilities to adjust the colour tone and brightness levels of light in order to adapt to people’s needs and desires. IT support is key to the technical developments that afford adaptive control systems. The possibilities...... offered by adaptive lighting control are created by the ways that the system components, the network and data flow can be coordinated through software so that the dynamic variations are controlled in ways that meaningfully adapt according to people’s situations and design intentions. This book discusses...... distributed differently into an architectural body. We also examine what might occur when light is dynamic and able to change colour, intensity and direction, and when it is adaptive and can be brought into interaction with its surroundings. In short, what happens to an architectural space when artificial...
Multi- Path Routing and Resource Allocation in Active Network
Institute of Scientific and Technical Information of China (English)
XU Wu-ping; YAN Pu-liu; WU Ming
2005-01-01
An algorithm of traffic distribution called active multi-path routing (AMR) in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimize approximate method to distribute network traffic amongmultiple paths. It is combined to bandwidth resource allocation and the congestion restraint mechanism to avoid congestion happening and worsen. So network performance can be improved greatly. The frame of AMR includes adaptive trafficallocation model, the conception of supply bandwidth and its'allocation model, the principle of congestion restraint and its'model, and the implement of AMR based on multi-agents system in active network. Through simulations, AMR has distinct effects on network performance. The results show AMR is a valid traffic regulation algorithm.
Path Control Experiment of Mobile Robot Based on Supervised Learning
Directory of Open Access Journals (Sweden)
Gao Chi
2013-07-01
Full Text Available To solve the weak capacity and low control accuracy of the robots which adapt to the complex working conditions, proposed that a path control method based on the driving experience and supervised learning. According to the slope road geometry characteristics, established the modeling study due to ramp pavement path control method and the control structure based on monitoring and self-learning. Made use of the Global Navigation Satellite System did the experiment. The test data illustrates that when the running speed is not greater than 5 m / s, the straight-line trajectory path transverse vertical deviation within 士20cm ,which proved that the control method has a high feasibility.
Path-partitioned encoding supports wildcard-awareness twig queries
Institute of Scientific and Technical Information of China (English)
XU; Xiao-shuang; FENG; Yu-cai; WANG; Feng
2009-01-01
Finding all occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. It is important to effectively handle twig queries with wildcards. In this paper, a novel path-partitioned encoding scheme is proposed for XML documents to capture paths of all elements, and a twig query is modeled as an XPattern extended from tree pattern. After definition, simplification, normalization, verification and initialization of the XPattern, both work sets and a join plan are generated. According to these measures, an effective algorithm to answer for a twig query, called DMTwig, is designed without unnecessary elements and invalid structural joins. The algorithm can adaptively deal with twig queries with branch([]), child edge(/), descendant edge(//), and wildcard(*)synthetically. We show that path-partitioned encoding scheme and XPattern guarantee the I/O and CPU optimality for twig queries. Experiments on representative data set indicate that the proposed solution performs significantly.
A New Class of Lattice Paths and Partitions with Copies of
Indian Academy of Sciences (India)
S Anand; A K Agarwal
2012-02-01
Agarwal and Bressoud (Pacific J. Math. 136(2)(1989) 209–228) defined a class of weighted lattice paths and interpreted several -series combinatorially. Using the same class of lattice paths, Agarwal (Utilitas Math. 53(1998) 71–80; ARS Combinatoria 76(2005) 151–160) provided combinatorial interpretations for several more -series. In this paper, a new class of weighted lattice paths, which we call associated lattice paths is introduced. It is shown that these new lattice paths can also be used for giving combinatorial meaning to certain -series. However, the main advantage of our associated lattice paths is that they provide a graphical representation for partitions with + copies of introduced and studied by Agarwal (Partitions with copies of , Lecture Notes in Math., No. 1234 (Berlin/New York: Springer-Verlag) (1985) 1–4) and Agarwal and Andrews (J. Combin. Theory A45(1)(1987) 40–49).
RFID-Based Critical Path Expert System for Agility Manufacture Process Management
Cheng, Haifang; Xiang, Yuli
This paper presents a critical path expert system for the agility manufacture process management based on radio frequency identification (RFID) technology. The paper explores that the agility manufacture processes can be visible and controllable with RFID. The critical paths or activities can be easily found out and tracked by the RFID tracing technology. And the expert system can optimize the bottle neck of the task process of the agility management with the critical path adjusting and reforming method. Finally, the paper gives a simple application example of the system to discuss how to adjust the critical paths and how to make the process more agility and flexibility with the critical path expert system. With an RFID-based critical path expert system, the agility manufacture process management will be more effective and efficient.
A New Approach to Determine the Critical Path in Stochastic Activity Network
Directory of Open Access Journals (Sweden)
Weng-Ming Chu
2014-01-01
Full Text Available The determination of the critical path (CP in stochastic networks is difficult. It is partly due to the randomness of path durations and partly due to the probability issue of the selection of the critical path in the network. What we are confronted with is not only the complexity among random variables but also the problem of path dependence of the network. Besides, we found that CP is not necessarily the longest (or shortest path in the network, which was a conventional assumption in use. The Program Evaluation and Review Technique (PERT and Critical Path Index (CPI approaches are not able to deal with this problem efficiently. In this study, we give a new definition on the CP in stochastic network and propose a modified label-correcting tracing algorithm (M-LCTA to solve it. Based on the numerical results, compared with Monte Carlo simulation (MCS, the proposed approach can accurately determine the CP in stochastic networks.
Particle production and complex path analysis
Srinivasan, K
1999-01-01
This paper discusses particle production in Schwarzchild-like spacetimes and in an uniform electric field. Both problems are approached using the method of complex path analysis. Particle production in Schwarzchild-like spacetimes with a horizon is obtained here by a new and simple semi-classical method based on the method of complex paths. Hawking radiation is obtained in the (t,r) co-ordinate system of the standard Schwarzchild metric {\\it without} requiring the Kruskal extension. The co-ordinate singularity present at the horizon manifests itself as a singularity in the expression for the semi-classical propagator for a scalar field. We give a prescription whereby this singularity is regularised with Hawking's result being recovered. In the case of the electric field, standard quantum field theoretic methods can be used to obtain particle production in a purely time-dependent gauge. In a purely space-dependent gauge, however, the tunnelling interpretation has to be resorted to. We attempt, in this paper, t...
Asteroidal Quadruples in non Rooted Path Graphs
Directory of Open Access Journals (Sweden)
Gutierrez Marisa
2015-11-01
Full Text Available A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
Optimum Strategies for Selecting Descent Flight-Path Angles
Wu, Minghong G. (Inventor); Green, Steven M. (Inventor)
2016-01-01
An information processing system and method for adaptively selecting an aircraft descent flight path for an aircraft, are provided. The system receives flight adaptation parameters, including aircraft flight descent time period, aircraft flight descent airspace region, and aircraft flight descent flyability constraints. The system queries a plurality of flight data sources and retrieves flight information including any of winds and temperatures aloft data, airspace/navigation constraints, airspace traffic demand, and airspace arrival delay model. The system calculates a set of candidate descent profiles, each defined by at least one of a flight path angle and a descent rate, and each including an aggregated total fuel consumption value for the aircraft following a calculated trajectory, and a flyability constraints metric for the calculated trajectory. The system selects a best candidate descent profile having the least fuel consumption value while the fly ability constraints metric remains within aircraft flight descent flyability constraints.
Majorana and the path-integral approach to Quantum Mechanics
Esposito, S
2006-01-01
We give, for the first time, the English translation of a manuscript by Ettore Majorana, which probably corresponds to the text for a seminar delivered at the University of Naples in 1938, where he lectured on Theoretical Physics. Some passages reveal a physical interpretation of the Quantum Mechanics which anticipates of several years the Feynman approach in terms of path integrals, independently of the underlying mathematical formulation.
Verification and Generation of Safe Straight Paths for a 4-DOF Spherical Manipulator
Directory of Open Access Journals (Sweden)
Rawand Ehsan J.T.
2013-04-01
Full Text Available Sometimes in a manufacturing environment, a robotic arm is wanted to move in a straight path such as welding, painting and assembling. This straight path causes the manipulator to actuate all or most of its joints in the same time to track the path. Along this path, the manipulator may reach a specific singular configuration in its workspace at which one or more joints are in their limits, or a part of the path lies outside the workspace. These conditions make the arm’s movement be unsmooth and may cause damage to the manufacturing process. In this paper, the singularities inside the workspace of a 4-DOF spherical manipulator are indicated and a method is presented for finding the arm configurations (assuming that all joints are actuated at the same time along a straight path between an initial and a goal configurations. All joint limits are presented and if a part of the path lies outside the workspace, the model processes this condition by introducing a new initial configuration through changing the third joint’s (q3 position only. A smooth straight path is generated between any two configurations using the parametric equations of the line connecting them. Unlike the analytical inverse kinematics, which needs a (4 x 4 homogeneous transformations convention matrix (DH to find the joint variables, this method needs only the initial configuration, goal configuration, link lengths and the corresponding Cartesian coordinates of the path. It always gives the correct solution for the under taken path.
DEFF Research Database (Denmark)
Petersen, Kjell Yngve; Søndergaard, Karin; Kongshaug, Jesper
2015-01-01
Adaptive Lighting Adaptive lighting is based on a partial automation of the possibilities to adjust the colour tone and brightness levels of light in order to adapt to people’s needs and desires. IT support is key to the technical developments that afford adaptive control systems. The possibilities...... offered by adaptive lighting control are created by the ways that the system components, the network and data flow can be coordinated through software so that the dynamic variations are controlled in ways that meaningfully adapt according to people’s situations and design intentions. This book discusses...... the investigations of lighting scenarios carried out in two test installations: White Cube and White Box. The test installations are discussed as large-scale experiential instruments. In these test installations we examine what could potentially occur when light using LED technology is integrated and...
Discrete Coherent State Path Integrals
Marchioro, Thomas L., II
1990-01-01
The quantum theory provides a fundamental understanding of the physical world; however, as the number of degrees of freedom rises, the information required to specify quantum wavefunctions grows geometrically. Because basis set expansions mirror this geometric growth, a strict practical limit on quantum mechanics as a numerical tool arises, specifically, three degrees of freedom or fewer. Recent progress has been made utilizing Feynman's Path Integral formalism to bypass this geometric growth and instead calculate time -dependent correlation functions directly. The solution of the Schrodinger equation is converted into a large dimensional (formally infinite) integration, which can then be attacked with Monte Carlo techniques. To date, work in this area has concentrated on developing sophisticated mathematical algorithms for evaluating the highly oscillatory integrands occurring in Feynman Path Integrals. In an alternative approach, this work demonstrates two formulations of quantum dynamics for which the number of mathematical operations does not scale geometrically. Both methods utilize the Coherent State basis of quantum mechanics. First, a localized coherent state basis set expansion and an approximate short time propagator are developed. Iterations of the short time propagator lead to the full quantum dynamics if the coherent state basis is sufficiently dense along the classical phase space path of the system. Second, the coherent state path integral is examined in detail. For a common class of Hamiltonians, H = p^2/2 + V( x) the path integral is reformulated from a phase space-like expression into one depending on (q,dot q). It is demonstrated that this new path integral expression contains localized damping terms which can serve as a statistical weight for Monte Carlo evaluation of the integral--a process which scales approximately linearly with the number of degrees of freedom. Corrections to the traditional coherent state path integral, inspired by a
Harrell, William
1999-01-01
Provides information on various adaptive technology resources available to people with disabilities. (Contains 19 references, an annotated list of 129 websites, and 12 additional print resources.) (JOW)
National Aeronautics and Space Administration — Advanced Diagnostics and Prognostics Testbed (ADAPT) Project Lead: Scott Poll Subject Fault diagnosis in electrical power systems Description The Advanced...
Modeling Adaptive Educational Methods with IMS Learning Design
Specht, Marcus; Burgos, Daniel
2007-01-01
The paper describes a classification system for adaptive methods developed in the area of adaptive educational hypermedia based on four dimensions: What components of the educational system are adapted? To what features of the user and the current context does the system adapt? Why does the system adapt? How does the system get the necessary information? Based on this taxonomy several classical methods of adaptive educational hypermedia are classified. In a second step the paper gives an over...
Isomorphisms and traversability of directed path graphs
Broersma, H.J.; 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$
Isomorphisms and traversability of directed path graphs
Broersma, Hajo; Li, Xueliang
2002-01-01
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pk(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 form a directed
Population Monotonic Path Schemes for Simple Games
Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.
2006-01-01
A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as the pa
2010-01-01
... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Takeoff path. 25.111 Section 25.111... STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.111 Takeoff path. (a) The takeoff path... and VFTO is reached, whichever point is higher. In addition— (1) The takeoff path must be based on...
Innovation paths in wind power
DEFF Research Database (Denmark)
Lema, Rasmus; Nordensvärd, Johan; Urban, Frauke;
Denmark and Germany both make substantial investments in low carbon innovation, not least in the wind power sector. These investments in wind energy are driven by the twin objectives of reducing carbon emissions and building up international competitive advantage. Support for wind power dates back...... Denmark and Germany have common national causes, while company-specific strategies also influence the innovation paths in significant ways. This raises important questions about the national specificity of innovation paths in wind power development. Finally, the paper briefly addresses the increasing...... wind turbine deployment, both countries have moved along broadly similar paths. There are now fewer turbines deployed than at any time in the past 10 to 20 years, but on average these are concentrated in larger projects and the production capacity and total electricity output has increased...
Calculating Least Risk Paths in 3d Indoor Space
Vanclooster, A.; De Maeyer, Ph.; Fack, V.; Van de Weghe, N.
2013-08-01
Over the last couple of years, research on indoor environments has gained a fresh impetus; more specifically applications that support navigation and wayfinding have become one of the booming industries. Indoor navigation research currently covers the technological aspect of indoor positioning and the modelling of indoor space. The algorithmic development to support navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. However, alternative algorithms for outdoor navigation have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behaviour (e.g. simplest paths, least risk paths). These algorithms are currently restricted to outdoor applications. The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). As such, the clarity and easiness of route instructions is of paramount importance when distributing indoor routes. A shortest or fastest path indoors not necessarily aligns with the cognitive mapping of the building. Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-storey building. The results of several least risk path calculations are compared to the shortest paths in indoor environments in terms of total length, improvement in route description complexity and number of turns. Several scenarios are tested in this comparison: paths covering a single floor, paths crossing several building wings and/or floors. Adjustments to the algorithm are proposed to be more aligned to the
Arithmetic area for m planar Brownian paths
Desbois, Jean
2012-01-01
We pursue the analysis made in [1] on the arithmetic area enclosed by m closed Brownian paths. We pay a particular attention to the random variable S{n1,n2, ...,n} (m) which is the arithmetic area of the set of points, also called winding sectors, enclosed n1 times by path 1, n2 times by path 2, ...,nm times by path m. Various results are obtained in the asymptotic limit m->infinity. A key observation is that, since the paths are independent, one can use in the m paths case the SLE information, valid in the 1-path case, on the 0-winding sectors arithmetic area.
Path Decomposition of Graphs with Given Path Length
Institute of Scientific and Technical Information of China (English)
Ming-qing Zhai; Chang-hong Lü
2006-01-01
A path decomposition of a graph G is a list of paths such that each edge appears in exactly one path in the list. G is said to admit a {Pl}-decomposition if G can be decomposed into some copies of Pl, where Pl is a path of length ι - 1. Similarly, G is said to admit a {Pl, Pκ}-decomposition if G can be decomposed into some copies of Pl or Pκ. An κ-cycle, denoted by Cκ, is a cycle with κ vertices. An odd tree is a tree of which all vertices have odd degree. In this paper, it is shown that a connected graph G admits a {P3, P4}-decomposition if and only if G is neither a 3-cycle nor an odd tree. This result includes the related result of Yan, Xu and Mutu. Moreover, two polynomial algorithms are given to find {P3}-decomposition and {P3, P4}-decomposition of graphs, respectively. Hence, {P3}-decomposition problem and {P3, P4}-decomposition problem of graphs are solved completely.
Spin Observables and Path Integrals
López, J A
2000-01-01
We discuss the formulation of spin observables associated to a non-relativistic spinning particles in terms of grassmanian differential operators. We use as configuration space variables for the pseudo-classical description of this system the positions $x$ and a Grassmanian vector quantum amplitudes as path integrals in this superspace. We compute the quantum action necessary for this description including an explicit expression for the boundary terms. Finally we shown how for simple examples, the path integral may be performed in the semi-classical approximation, leading to the correct quantum propagator.
Multiple paths in complex tasks
Galanter, Eugene; Wiegand, Thomas; Mark, Gloria
1987-01-01
The relationship between utility judgments of subtask paths and the utility of the task as a whole was examined. The convergent validation procedure is based on the assumption that measurements of the same quantity done with different methods should covary. The utility measures of the subtasks were obtained during the performance of an aircraft flight controller navigation task. Analyses helped decide among various models of subtask utility combination, whether the utility ratings of subtask paths predict the whole tasks utility rating, and indirectly, whether judgmental models need to include the equivalent of cognitive noise.
Hamiltonian paths on directed grids
Hujter, Mihály; Kaszanyitzky, András
2015-01-01
Our studies are related to a special class of FASS-curves, which can be described in a node-rewriting Lindenmayer-system. These ortho-tile (or diagonal) type recursive curves inducing Hamiltonian paths. We define a special directed graph on a rectangular grid, and we enumerate all Hamiltonian paths on this graph. Our formulas are strongly related to both the Fibonacci numbers and the domino tilings of chessboards. The constructability of the regular $17$-gon with straightedge and compass is a...
Strings, paths, and standard tableaux
Dasmahapatra, S
1996-01-01
For the vacuum sectors of regime-III ABF models, we observe that two sets of combinatorial objects: the strings which parametrize the row-to-row transfer matrix eigenvectors, and the paths which parametrize the corner transfer matrix eigenvectors, can both be expressed in terms of the same set of standard tableaux. Furthermore, the momenta of the strings, the energies of the paths, and the charges of the tableaux are such that there is a weight-preserving bijection between the two sets of eigenvectors, wherein the tableaux play an interpolating role. This bijection is so natural, that we conjecture that it exists in general.
Path modeling and process control
DEFF Research Database (Denmark)
Høskuldsson, Agnar; Rodionova, O.; Pomerantsev, A.
2007-01-01
be performed regarding the foreseeable output property y, and with respect to an admissible range of correcting actions for the parameters of the next stage. In this paper the basic principles of path modeling is presented. The mathematics is presented for processes having only one stage, having two stages...... and having three or more stages. The methods are applied to a process control of a multi-stage production process having 25 variables and one output variable. When moving along the process, variables change their roles. It is shown how the methods of path modeling can be applied to estimate variables...
A Pilot Study of Nurses' Experience of Giving Spiritual Care
Deal, Belinda
2010-01-01
Using spiritual and religious resources gives patients and families strength to cope during a crisis, but nurses often do not offer spiritual care (Kloosterhouse & Ames, 2002). The purpose of this phenomenological study was to explore nurses" lived experience of giving spiritual care. A descriptive phenomenological approach was used to interview 4…
Gratitude, Guilt, Goodwill, and Giving Back: Lessons from Madagascar
Directory of Open Access Journals (Sweden)
Christopher D. Golden
2014-07-01
Full Text Available This research note is part of the thematic section, Practical Realities of Giving Back, in the special issue titled “Giving Back in Field Research,” published as Volume 10, Issue 2 in the Journal of Research Practice.
When breastfeeding is unsuccessful - mothers' experiences after giving up breastfeeding
DEFF Research Database (Denmark)
Larsen, Jette Schilling; Kronborg, Hanne
2013-01-01
Some mothers have to give up breastfeeding even though they want to breastfeed. To give up breastfeeding can be a sensitive issue in a time when breastfeeding is promoted as the healthiest for mother and child. The aim of this study was to describe mothers’ experiences after they gave up breastfe...
Territorial Entanglements: Ambiguities of Giving Back in Northwestern Laos
Directory of Open Access Journals (Sweden)
Michael Benjamin Dwyer
2014-07-01
Full Text Available This research note is part of the thematic section, Limits to Giving Back, in the special issue titled “Giving Back in Field Research,” published as Volume 10, Issue 2 in the Journal of Research Practice.
Moving from ‘Giving Back’ to Engagement
Directory of Open Access Journals (Sweden)
Gautam Bhan
2014-07-01
Full Text Available This research note is part of the thematic section, Giving Back in Solidarity, in the special issue titled “Giving Back in Field Research,” published as Volume 10, Issue 2 in the Journal of Research Practice.
20 CFR 404.704 - Your responsibility for giving evidence.
2010-04-01
... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Your responsibility for giving evidence. 404.704 Section 404.704 Employees' Benefits SOCIAL SECURITY ADMINISTRATION FEDERAL OLD-AGE, SURVIVORS AND DISABILITY INSURANCE (1950- ) Evidence General § 404.704 Your responsibility for giving evidence....
OPINION GIVING SERVICES AS A SOURCE OF CONSUMER INFORMATION
Directory of Open Access Journals (Sweden)
Joanna Wyrwisz
2015-09-01
Full Text Available The goal of the article is to determine the place and role of opinion giving services in consumer behaviours. The discussion is conducted around the thesis saying that in the information society, opinion giving services constitute an important source of information for consumers in the process of selecting and purchasing both products and services. In the article the research approach based on the theoretical and empirical examinations was presented. The discussion starts with presenting a defi nition and types of opinion giving services which constitute the base for the characteristics of activities and usefulness of web portals collecting consumers opinions. The use of opinion giving services provided in the purchase process was evaluated. An essential interest in other consumers opinions, placed in Internet, was observed together with perceiving them as credible. Positive assessment of the functionality of opinion giving services was noticed.
The Conley-Zehnder index for a path of symplectic matrices
Gutt, Jean
2012-01-01
We give here a self contained and elementary introduction to the Conley-Zehnder index for a path of symplectic matrices. We start from the definition of the index as the degree of a map into the circle for a path starting at the identity and ending at a matrix for which 1 is not an eigenvalue. We prove some properties which characterize this index using normal forms for symplectic matrices obtained from geometrical considerations. We explore the relations to Robbin-Salamon index for paths of Lagrangians. We give an axiomatic characterization of the generalization of the Conley-Zehnder index for any continuous path of symplectic matrices defined by Robbin and Salamon.
Economics of adaptation to climate change
International Nuclear Information System (INIS)
This report proposes a general economic framework for the issue of adaptation to climate change in order to help public and private actors to build up efficient adaptation strategies. It proposes a general definition of adaptation, identifies the major stakes for these strategies, and discusses the assessment of global costs of adaptation to climate change. It discusses the role and modalities of public action and gives some examples of possible adaptation measures in some important sectors (building and town planning, energy and transport infrastructures, water and agriculture, ecosystems, insurance). It examines the regional and national dimensions of adaptation and their relationship, and defines steps for implementing an adaptation strategy. It describes and discusses the use of economic tools in the elaboration of an adaptation strategy, i.e. how to take uncertainties into account, which scenarios to choose, how to use economic calculations to assess adaptation policies
On the path to differentiation
DEFF Research Database (Denmark)
Martinsen, Dorte Sindbjerg; Uygur, Ayca
2014-01-01
by examining the ‘path to differentiation’ within EU working time regulation as it has unfolded over time. It identifies the ‘opt-out’ as a means of differentiation adopted to overcome policy deadlocks within collective decision-making, albeit one with unforeseen consequences. In particular, the contribution...
Career Paths in Environmental Sciences
Career paths, current and future, in the environmental sciences will be discussed, based on experiences and observations during the author's 40 + years in the field. An emphasis will be placed on the need for integrated, transdisciplinary systems thinking approaches toward achie...
Determinants of weighted path matrices
Talaska, Kelli
2012-01-01
We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs. The formulas are given in terms of certain flows in the graph.
Pythia: An object-orientated gas path analysis computer program for general applications
Escher, P. C.
1995-01-01
For both civil and military aero gas turbines, technological advances and high cost of ownership have resulted in considerable interest in advanced maintenance techniques. Some of these techniques are now ready for application to industrial gas turbines. This thesis attempts to give an overview of engine maintenance and engine health monitoring techniques. One way to tackle the high cost is to employ Gas Path Analysis techniques. Gas Path C Analysis helps to identify deteriorated co...
Testing for Altruism and Social Pressure in Charitable Giving
Stefano DellaVigna; List, John A.; Ulrike Malmendier
2009-01-01
Every year, 90 percent of Americans give money to charities. Is such generosity necessarily welfare enhancing for the giver? We present a theoretical framework that distinguishes two types of motivation: individuals like to give, e.g., due to altruism or warm glow, and individuals would rather not give but dislike saying no, e.g., due to social pressure. We design a door-to-door fund-raising drive in which some households are informed about the exact time of solicitation with a flyer on their...
Adaptive Gas Metal Arc (GMA) Welder
Nachev, G.; Petkov, B.; Blagoev, L.; Tsankarski, I.
1984-02-01
Unlike NC machine-tools, where the tool path is primary and the product shape results from it, in arc welding the product is primary, and the welder - human or robot - has to contend with poor fitups, bad preparations, inexact positionning etc. All this means one thing - adaptivity. The axtent to which this is reasonable is discussed, and then a research project, conducted at IICR with the aim to create an adaptive GMA robot, is presented.
Optimal paths as correlated random walks
Perlsman, E.; Havlin, S.
2006-01-01
A numerical study of optimal paths in the directed polymer model shows that the paths are similar to correlated random walks. It is shown that when a directed optimal path of length t is divided into 3 segments whose length is t/3, the correlation between the transversal movements along the first and last path segments is independent of the path length t. It is also shown that the transversal correlations along optimal paths decrease as the paths approach their endpoints. The numerical results obtained for optimal paths in 1+4 dimensions are qualitatively similar to those obtained for optimal paths in lower dimensions, and the data supplies a strong numerical indication that 1+4 is not the upper critical dimension of this model, and of the associated KPZ equation.
Scan path entropy and Arrow plots: Capturing scanning behavior of multiple observers
Directory of Open Access Journals (Sweden)
Ignace T C Hooge
2013-12-01
Full Text Available Designers of visual communication material want their material to attract and retain attention. In marketing research, heat maps, dwell time, and time to AOI first hit are often used as evaluation parameters. Here we present two additional measures 1 scan path entropy to quantify gaze guidance and 2 the arrow plot to visualize the average scan path. Both are based on string representations of scan paths. The latter also incorporates transition matrices and time required for 50% of the observers to first hit AOIs (T50. The new measures were tested in an eye tracking study (48 observers, 39 advertisements. Scan path entropy is a sensible measure for gaze guidance and the new visualization method reveals aspects of the average scan path and gives a better indication in what order global scanning takes place.
Scan path entropy and arrow plots: capturing scanning behavior of multiple observers.
Hooge, Ignace; Camps, Guido
2013-01-01
Designers of visual communication material want their material to attract and retain attention. In marketing research, heat maps, dwell time, and time to AOI first hit are often used as evaluation parameters. Here we present two additional measures (1) "scan path entropy" to quantify gaze guidance and (2) the "arrow plot" to visualize the average scan path. Both are based on string representations of scan paths. The latter also incorporates transition matrices and time required for 50% of the observers to first hit AOIs (T50). The new measures were tested in an eye tracking study (48 observers, 39 advertisements). Scan path entropy is a sensible measure for gaze guidance and the new visualization method reveals aspects of the average scan path and gives a better indication in what order global scanning takes place. PMID:24399993
Monitoring the Hydrologic Cycle With the PATH Mission
Lambrigtsen, B.
2012-12-01
One of the 15 decadal-survey missions the National Research Council recommended that NASA undertake is the Precipitation and All-weather Temperature and Humidity (PATH) mission. It consists of a microwave sounder placed on a geostationary platform to observe atmospheric processes related to the hydrologic cycle. The primary observables consist of precipitation, cloud liquid water and vertical profiles of temperature and humidity, and secondary derived products include vertical profiles of horizontal wind vectors (derived by tracking the motion of humidity features) and vertical profiles of reflectivity when there is convection. All products will be available regardless of cloud cover and some even in the presence of precipitation. The Geostationary vantage point makes it possible to get very rapid updates, every 5-30 minutes, which is sufficient to resolve the most dynamic processes. The PATH mission will give a nearly complete simultaneous view of the atmospheric component of the hydrologic cycle and will enable a number of studies that have not yet been feasible. For example, it will be possible to fully resolve the diurnal cycle of cloud formation, convection, precipitation and storm evolution. PATH covers a very wide range in the spatio-temporal domain and will enable studies ranging from the evolution of tornado-generating thunderstorm complexes to continental-scale moisture flow. We describe the sensor system and the technology that enables PATH as well as some of the science applications. We also discuss the prospects for a PATH precursor mission in the near future as well as the long-term prospects for a full PATH mission. Copyright 2012 California Institute of Technology. Government sponsorship acknowledged.
Reciprocity revisited: Give and take in Dutch and immigrant families
A. Komter; J.M.D. Schans
2008-01-01
Classical theory suggests that "generalized reciprocity," giving without clear expectations of returns, is characteristic for exchange within the family. Modern theory assumes differences between Western, "individualistic" cultures, and non-Western, more "collectivistic" cultures, presumably leading
Music Might Give Babies' Language Skills a Boost
... nlm.nih.gov/medlineplus/news/fullstory_158486.html Music Might Give Babies' Language Skills a Boost Small ... April 25, 2016 (HealthDay News) -- Can listening to music boost your baby's brainpower? Maybe, at least in ...
Who, Who, Who Gives a Hoot about Bones?
Dolan, Arthur
1988-01-01
Describes a mouse skeleton reconstruction activity from owl pellets. Gives information about the materials, directions for students, and a five-day unit schedule. Provides some owl pellet sources. (YP)
Music Might Give Babies' Language Skills a Boost
... page: https://medlineplus.gov/news/fullstory_158486.html Music Might Give Babies' Language Skills a Boost Small ... April 25, 2016 (HealthDay News) -- Can listening to music boost your baby's brainpower? Maybe, at least in ...
Intelligent PID guidance control for AUV path tracking
Institute of Scientific and Technical Information of China (English)
李晔; 姜言清; 王磊峰; 曹建; 张国成
2015-01-01
Based on rational behavior model of three layers, a tracking control system is designed for straight line tracking which is commonly used in underwater survey missions. An intelligent PID control law implemented as planning level during the control system using transverse deviation is came up with. Continuous tracking of path expressed by a point sequence can be realized by the law. Firstly, a path tracking control system based on rational behavior model of three layers is designed, mainly satisfying the needs of underactuated AUV. Since there is no need to perform spatially coupled maneuvers, the 3D path tracking control is decoupled into planar 2D path tracking and depth or height tracking separately. Secondly, planar path tracking controller is introduced. For the reason that more attention is paid to comparing with vertical position control, transverse deviation in analytical form is derived. According to the Lyapunov direct theory, control law is designed using discrete PID algorithm whose parameters obey adaptive fuzzy adjustment. Reference heading angle is given as an output of the guidance controller conducted by lateral deviation together with its derivative. For the purpose of improving control quality and facilitating parameter modifying, data normalize modules based on Sigmoid function are applied to input-output data manipulation. Lastly, a sequence of experiments was carried out successfully, including tests in Longfeng lake and at the Yellow sea. In most challenging sea conditions, tracking errors of straight line are below 2 m in general. The results show that AUV is able to compensate the disturbance brought by sea current. The provided test results demonstrate that the designed guidance controller guarantees stably and accurately straight route tracking. Besides, the proposed control system is accessible for continuous comb-shaped path tracking in region searching.
We should give love to whoever needs without hesitation
Institute of Scientific and Technical Information of China (English)
杨彩荣
2010-01-01
@@ The text Fog tells us a touching story, in which an old blind man helped a girl out of a thick fog by his unique sense of touch. From the text, we know the girl has never helped the old man, or even she doesn't know him. But he helped her! What's more, he thinks the fog gives him a chance to pay back the help that 'people give to him when it's sunny" .
Institute of Scientific and Technical Information of China (English)
De-tong Zhu
2001-01-01
In this paper we modify type approximate trust region methods via two curvilinear paths for unconstrained optimization. A mixed strategy using both trust region and line search techniques is adopted which switches to back tracking steps when a trial step produced by the trust region subproblem is unacceptable. We give a series of properties of both optimal path and modified gradient path. The global convergence and fast local convergence rate of the proposed algorithms are established under some reasonable conditions. A nonmonotonic criterion is used to speed up the convergence progress in some ill-conditioned cases.
Arithmetic area for m planar Brownian paths
Desbois, Jean; Ouvry, Stephane
2012-01-01
We pursue the analysis made in [1] on the arithmetic area enclosed by m closed Brownian paths. We pay a particular attention to the random variable S{n1,n2, ...,n} (m) which is the arithmetic area of the set of points, also called winding sectors, enclosed n1 times by path 1, n2 times by path 2, ...,nm times by path m. Various results are obtained in the asymptotic limit m->infinity. A key observation is that, since the paths are independent, one can use in the m paths case the SLE informatio...
Path querying system on mobile devices
Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun
2006-01-01
Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.
Janssen, José
2008-01-01
Jansen, J. (2008). Facilitating Description and Selection of Learning Paths: the learning path specification put to the test. Presentation at the Otec Colloquium. April, 2008, Heerlen, The Netherlands.
Is adaptation. Truly an adaptation? Is adaptation. Truly an adaptation?
Directory of Open Access Journals (Sweden)
Thais Flores Nogueira Diniz
2008-04-01
Full Text Available The article begins by historicizing film adaptation from the arrival of cinema, pointing out the many theoretical approaches under which the process has been seen: from the concept of “the same story told in a different medium” to a comprehensible definition such as “the process through which works can be transformed, forming an intersection of textual surfaces, quotations, conflations and inversions of other texts”. To illustrate this new concept, the article discusses Spike Jonze’s film Adaptation. according to James Naremore’s proposal which considers the study of adaptation as part of a general theory of repetition, joined with the study of recycling, remaking, and every form of retelling. The film deals with the attempt by the scriptwriter Charles Kaufman, cast by Nicholas Cage, to adapt/translate a non-fictional book to the cinema, but ends up with a kind of film which is by no means what it intended to be: a film of action in the model of Hollywood productions. During the process of creation, Charles and his twin brother, Donald, undergo a series of adventures involving some real persons from the world of film, the author and the protagonist of the book, all of them turning into fictional characters in the film. In the film, adaptation then signifies something different from itstraditional meaning. The article begins by historicizing film adaptation from the arrival of cinema, pointing out the many theoretical approaches under which the process has been seen: from the concept of “the same story told in a different medium” to a comprehensible definition such as “the process through which works can be transformed, forming an intersection of textual surfaces, quotations, conflations and inversions of other texts”. To illustrate this new concept, the article discusses Spike Jonze’s film Adaptation. according to James Naremore’s proposal which considers the study of adaptation as part of a general theory of repetition
Nückles, Matthias; Wittwer, Jörg; Renkl, Alexander
2005-12-01
To give effective and efficient advice to laypersons, experts should adapt their explanations to the layperson's knowledge. However, experts often fail to consider the limited domain knowledge of laypersons. To support adaptation in asynchronous helpdesk communication, researchers provided computer experts with information about a layperson's knowledge. A dialogue experiment (N = 80 dyads of experts and laypersons) was conducted that varied the displayed information. Rather than sensitizing the experts to generally improve the intelligibility of their explanations, the individuating information about the layperson enabled them to make specific partner adjustments that increased the effectiveness and efficiency of the communication. The results are suggestive of ways in which the provision of instructional explanations could be enhanced in Internet-based communication.
Adaptation of College English Classroom Materials
Institute of Scientific and Technical Information of China (English)
余跃
2015-01-01
Materials adaptation involves changing existing materials so that they become more suitable for specific learners, teach⁃ers or situations. This paper reviews the current state of this field, and makes suggestions for and gives example of innovative and principled approaches to college English classroom materials adaptation.
Survey on path and cycle embedding in some networks
Institute of Scientific and Technical Information of China (English)
Jun-Ming XU; Meijie MA
2009-01-01
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic problem. A stronger concept than the pancylicity is the panconnectivity. A graph of order n is said tobe panconnected if for any pair of different vertices x and y with distance d there exist xy-paths of every length from of to n. The pancyclicity or the panconnectivity is an important property to determine if the topology of a network is suitable for some applications where mapping cycles or paths of any length into the topology of the network is required. The pancyclicity and the panconnectivity of interconnection networks have attracted much research interest in recent years. A large amount of related work appeared in the literature, with some repetitions. The purpose of this paper is to give a survey of the results related to these topics for the hypercube and somehypercube-like networks.
Shortest Paths With Side Sensors
Salaris, Paolo; Bicchi, Antonio
2011-01-01
We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field--Of--View (FOV). In this paper we provide a generalization to the case of arbitrary FOVs, including the case that the direction of motion is not an axis of symmetry for the FOV, and even that it is not contained in the FOV. The provided solution is of particular relevance to applications using side-scanning, such as e.g. in underwater sonar-based surveying and navigation.
A Knd of Multistage Interconnection Networks with Multiple Paths
Institute of Scientific and Technical Information of China (English)
周应权; 闵应骅
1996-01-01
Mltistage Interconnection Networks(MINs)are orten used to provide interconnections in multiprocessor systems.A unique path MIN usually has lower hardware complexity and a simple control algorithm,but it lacks fault tolerance.This paper proposes a kind of multipat MINs,which are obtained by adding auxiliary links at the final stage in Quad Tree(QT) networks so that they can provide more paths between each source-destination pair,and presents their routing algorithm which is both destination tag based and adaptive.Starting with the routing tag for the minimum path between a given source-destination pair,the routing algorithm uses a set of rules to select switches and modify routing tag.In addition to trying the auxiliary link when link0 an link1 are unavilable,link1 will be tried when link0 ys unavailable.This feature distinguishing the proposed routing algorithm form that for QT networks makes better use of all the possible paths between the given source-destination pair.In the end,this paper introduces a performance index,which is called capacity,to compare different kinds of MINs .Comparison shows that the proposed MINs have better capacity than QT networks.
International Nuclear Information System (INIS)
In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose a new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z2. Generalization to momentum dependent weight factors and applications to worldline formalism are briefly discussed. - Highlights: ► We propose the new path integral formulation on star graph with N edges. ►U(N) family of boundary conditions is well-described by weight factors. ► The scale-invariant weight factor is given by N-dimensional unitary representation of Z2. ► Generalization to momentum dependent weight factors is briefly discussed.
Path optimization for oil probe
Smith, O'Neil; Rahmes, Mark; Blue, Mark; Peter, Adrian
2014-05-01
We discuss a robust method for optimal oil probe path planning inspired by medical imaging. Horizontal wells require three-dimensional steering made possible by the rotary steerable capabilities of the system, which allows the hole to intersect multiple target shale gas zones. Horizontal "legs" can be over a mile long; the longer the exposure length, the more oil and natural gas is drained and the faster it can flow. More oil and natural gas can be produced with fewer wells and less surface disturbance. Horizontal drilling can help producers tap oil and natural gas deposits under surface areas where a vertical well cannot be drilled, such as under developed or environmentally sensitive areas. Drilling creates well paths which have multiple twists and turns to try to hit multiple accumulations from a single well location. Our algorithm can be used to augment current state of the art methods. Our goal is to obtain a 3D path with nodes describing the optimal route to the destination. This algorithm works with BIG data and saves cost in planning for probe insertion. Our solution may be able to help increase the energy extracted vs. input energy.
Willer, Robb; Wimer, Christopher; Owens, Lindsay A
2015-07-01
We draw upon past research on gender and prosocial emotions in hypothesizing that empathy can help explain the gender gap in charitable giving. In a nationally representative survey, we found that men reported less willingness to give money or volunteer time to a poverty relief organization, gaps that were mediated by men's lower reported feelings of empathy toward others. We also experimentally tested how effective a variety of different ways of framing poverty relief were for promoting giving. Framing poverty as an issue that negatively affects all Americans increased men's willingness to donate to the cause, eliminating the gender gap. Mediation analysis revealed that this "aligned self-interest" framing worked by increasing men's reported poverty concern, not by changing their understanding of the causes of poverty. Thus, while men were generally less motivated by empathy, they responded to a framing that recast charitable giving as consistent with their self-interest. Exposure to the same framing, however, led women to report lower willingness to volunteer time for poverty relief, suggesting that framing giving as consistent with self-interest may discourage those who give because of an empathic response to poverty. PMID:26004450
Spreading paths in partially observed social networks
Onnela, Jukka-Pekka
2011-01-01
Understanding 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 path lengths 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 a static, structurally realistic social network as a platform 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)? Alt...
Dragovich, Branko
2000-01-01
Feynman's path integral is generalized to quantum mechanics on p-adic space and time. Such p-adic path integral is analytically evaluated for quadratic Lagrangians. Obtained result has the same form as that one in ordinary quantum mechanics.
Path Integral and the Induction Law
Barone, F. A.; Farina, C.
2005-01-01
We show how the induction law is correctly used in the path integral computation of the free particle propagator. The way this primary path integral example is treated in most textbooks is a little bit missleading.
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.
Electron Inelastic-Mean-Free-Path Database
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.
Social Relations of Fieldwork: Giving Back in a Research Setting
Directory of Open Access Journals (Sweden)
Clare Gupta
2014-07-01
Full Text Available The project of this special issue emerged from the guest editors' experiences as field researchers in sub-Saharan Africa. During this time both researchers faced the difficult question of "giving back" to the communities in which, and with whom, they worked—communities that were often far less privileged than the researchers were in terms of wealth, mobility, education, and access to health care. Returning from their field sites, both researchers felt a combination of guilt and frustration that they had not done enough or had not done things right. Thus emerged the idea of bringing together a group of researchers, from a range of disciplines, to discuss the topic of giving back in field research. This editorial describes the idea and process that led to the present collection of articles. The guest editors situate the project in the literature on feminist studies and briefly summarize each of the four thematic sections in this special issue. They conclude by emphasizing that their collection is not a guide to giving back. Rather than lay out hard and fast rules about what, how much, and to whom field researchers should give, their collection offers a series of examples and considerations for giving back in fieldwork.
Timeless path integral for relativistic quantum mechanics
Chiou, Dah-Wei
2010-01-01
Starting from the canonical formalism of relativistic (timeless) quantum mechanics, the formulation of timeless path integral is rigorously derived. The transition amplitude is reformulated as the sum, or functional integral, over all possible paths in the constraint surface specified by the (relativistic) Hamiltonian constraint, and each path contributes with a phase identical to the classical action divided by $\\hbar$. The timeless path integral manifests the timeless feature as it is compl...
Feynman Path Integrals Over Entangled States
Green, A.G.; Hooley, C. A.; Keeling, J.; Simon, S. H.
2016-01-01
The saddle points of a conventional Feynman path integral are not entangled, since they comprise a sequence of classical field configurations. We combine insights from field theory and tensor networks by constructing a Feynman path integral over a sequence of matrix product states. The paths that dominate this path integral include some degree of entanglement. This new feature allows several insights and applications: i. A Ginzburg-Landau description of deconfined phase transitions. ii. The e...
Dispersion of surface waves along various paths to Uppsala, Sweden
Directory of Open Access Journals (Sweden)
A. S. TETSUO
1962-06-01
Full Text Available In continuation of Part I (Santo 1902, group velocity dispersionof surface waves along various oceanic patlis to Uppsala, Sweden, willbe reported in this paper. Materials and tlie method used are quitesiinilar to the previous ones, i. e. group velocities of Love and Eayleighwaves were obtained from records by ultra-long-period Press-Ewingseismographs for the shocks with numbers 00-60 and 61-90, and forthe other shocks from the records by long-period Benioff seismographsat the Seismological Institute, Uppsala, Sweden. In order to give characteristicnumbers to the dispersion data along every oceanic path, tlieyare compared witli the classifìed curves which the writer has obtainedpreviously (see Fig. 1 of Part I along other oceanic paths. Love wavedispersion curves are denoted by Roman numerals and Rayleigh wavecurves by Arabie numerals.
Robotic Path Finding with Collision Avoidance Using Expert System
Institute of Scientific and Technical Information of China (English)
蔡自兴
1989-01-01
A rule-based expert system has been developed and used into a robotic planning system with collision-avoidance,The world model is represented as the knowledge data and stored in the knowledge base with rules.The expert system can find a collision-avoidance path.Otherwise.it shows the collision secton in which the moved object is blocked,Several examples for the different objects to pass through the different channels and to find a collision-free path have been tested.The simulating results of the palnner give out the planning sequence or blocked section(s).The output information is useful for making decision of the robot motion and modifyting the technological parameters of the world.
Robotic Path Finding with Collision Avoidance Using Expert System
Institute of Scientific and Technical Information of China (English)
蔡自兴
1989-01-01
A rule-based expert system has been developed and used into a robotic planning system with collision-avoidance, The world model is represented as the knowledge data and stored in the knowledge base with rules. The expert system can find a collision-avoidance path . Otherwise, it shows the collision secton in which the moved object is blocked . Several examples for the different objects to pass throngli the different channels and to find a collision-free path have been testnd. The simulating resuks of the planner give out the planning sequence or blocked section(s) . The output information is useful for making decision of the robot motion and modifying the technological parameters of the world .
A discrete history of the Lorentzian path integral
Loll, R
2003-01-01
In these lecture notes, I describe the motivation behind a recent formulation of a non-perturbative gravitational path integral for Lorentzian (instead of the usual Euclidean) space-times, and give a pedagogical introduction to its main features. At the regularized, discrete level this approach solves the problems of (i) having a well-defined Wick rotation, (ii) possessing a coordinate-invariant cutoff, and (iii) leading to_convergent_ sums over geometries. Although little is known as yet about the existence and nature of an underlying continuum theory of quantum gravity in four dimensions, there are already a number of beautiful results in d=2 and d=3 where continuum limits have been found. They include an explicit example of the inequivalence of the Euclidean and Lorentzian path integrals, a non-perturbative mechanism for the cancellation of the conformal factor, and the discovery that causality can act as an effective regulator of quantum geometry.
Reachability by paths of bounded curvature in a convex polygon
Ahn, Heekap
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.
Hierarchical path planning and control of a small fixed-wing UAV: Theory and experimental validation
Jung, Dongwon
2007-12-01
problem is formulated by setting up geometric linear constraints as well as boundary conditions. Subsequently, we construct B-spline path templates by solving a set of distinct optimization problems. For application in UAV motion planning, the path templates are incorporated to replace parts of the entire path by the smooth B-spline paths. Each path segment is stitched together while preserving continuity to obtain a final smooth reference path to be used for path following control. The path following control for a small fixed-wing UAV to track the prescribed smooth reference path is also addressed. Assuming the UAV is equipped with an autopilot for low level control, we adopt a kinematic error model with respect to the moving Serret-Frenet frame attached to a path for tracking controller design. A kinematic path following control law that commands heading rate is presented. Backstepping is applied to derive the roll angle command by taking into account the approximate closed-loop roll dynamics. A parameter adaptation technique is employed to account for the inaccurate time constant of the closed-loop roll dynamics during actual implementation. Finally, we implement the proposed hierarchical path control of a small UAV on the actual hardware platform, which is based on an 1/5 scale R/C model airframe (Decathlon) and the autopilot hardware and software. Based on the hardware-in-the-loop (HIL) simulation environment, the proposed hierarchical path control algorithm has been validated through on-line, real-time implementation on a small micro-controller. By a seamless integration of the control algorithms for path planning, path smoothing, and path following, it has been demonstrated that the UAV equipped with a small autopilot having limited computational resources manages to accomplish the path control objective to reach the goal while avoiding obstacles with minimal human intervention.
Concept Based Approach for Adaptive Personalized Course Learning System
Salahli, Mehmet Ali; Özdemir, Muzaffer; Yasar, Cumali
2013-01-01
One of the most important factors for improving the personalization aspects of learning systems is to enable adaptive properties to them. The aim of the adaptive personalized learning system is to offer the most appropriate learning path and learning materials to learners by taking into account their profiles. In this paper, a new approach to…
The diagnostic path, a useful visualisation tool in virtual microscopy
Directory of Open Access Journals (Sweden)
Hufnagl Peter
2006-11-01
Full Text Available Abstract Background The Virtual Microscopy based on completely digitalised histological slide. Concerning this digitalisation many new features in mircoscopy can be processed by the computer. New applications are possible or old, well known techniques of image analyses can be adapted for routine use. Aims A so called diagnostic path observes in the way of a professional sees through a histological virtual slide combined with the text information of the dictation process. This feature can be used for image retrieval, quality assurance or for educational purpose. Materials and methods The diagnostic path implements a metadata structure of image information. It stores and processes the different images seen by a pathologist during his "slide viewing" and the obtained image sequence ("observation path". Contemporary, the structural details of the pathology reports were analysed. The results were transferred into an XML structure. Based on this structure, a report editor and a search function were implemented. The report editor compiles the "diagnostic path", which is the connection from the image viewing sequence ("observation path" and the oral report sequence of the findings ("dictation path". The time set ups of speech and image viewing serve for the link between the two sequences. The search tool uses the obtained diagnostic path. It allows the user to search for particular histological hallmarks in pathology reports and in the corresponding images. Results The new algorithm was tested on 50 pathology reports and 74 attached histological images. The creation of a new individual diagnostic path is automatically performed during the routine diagnostic process. The test prototype experienced an insignificant prolongation of the diagnosis procedure (oral case description and stated diagnosis by the pathologist and a fast and reliable retrieval, especially useful for continuous education and quality control of case description and diagnostic work
PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORK
Directory of Open Access Journals (Sweden)
Hamzah M A Hijawi
2016-03-01
Full Text Available MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based distributions that can be compiled and installed to be used for both real and experimental scenarios. In this article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
Collective Philanthropy: Describing and Modeling the Ecology of Giving
Gottesman, William L; Dodds, Peter Sheridan
2013-01-01
Reflective of income and wealth distributions, philanthropic gifting appears to follow an approximate power-law size distribution as measured by the size of gifts received by individual institutions. We explore the ecology of gifting by analysing data sets of individual gifts for a diverse group of institutions dedicated to education, medicine, art, public support, and religion. We find that the detailed forms of gift-size distributions differ across but are relatively constant within charity categories. We construct a model for how a donor's income affects their giving preferences in different charity categories, offering a mechanistic explanation for variations in institutional gift-size distributions. We discuss how knowledge of gift-sized distributions may be used to assess an institution's gift-giving profile, to help set fundraising goals, and to design an institution-specific giving pyramid.
Influences on authorship issues: an evaluation of giving credit.
Seeman, Jeffrey I; House, Mark C
2010-05-01
A survey on authorship issues was conducted with academic chemists in Ph.D.-granting institutions in the United States. Six hundred faculty members responded. The respondents reported a wide range in their attitudes and behavior regarding giving credit in a publication. The various guidelines for authorship are independent of academic background factors such as the relationship between the senior author and the contributor-potential author. However, the survey data reveal significant context-dependency by the respondents. Many respondents would give more credit to their own student than to another professor's student for the exact same contribution to a research project. The survey data further shows that the faculty who received their Ph.D. in the 1940s, 1950s, and 1960s are the most likely to provide authorship, while those who received their Ph.D. in the 1990s and 2000s would most likely give either no credit or acknowledgements. PMID:20461570
Heuristic estimates in shortest path algorithms
Pijls, Wim
2006-01-01
textabstractShortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application of binary numbers in the shortest path theory.
Characterizing path graphs by forbidden induced subgraphs
Lévêque, Benjamin; Preissmann, Myriam
2008-01-01
A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graph by forbidden induced subgraphs. Here we answer this question by listing all graphs that are not path graphs and are minimal with this property.
Multi-level Indoor Path Planning Method
Xiong, Q.; Zhu, Q.; Zlatanova, S.; Du, Z.; Zhang, Y.; Zeng, L.
2015-01-01
Indoor navigation is increasingly widespread in complex indoor environments, and indoor path planning is the most important part of indoor navigation. Path planning generally refers to finding the most suitable path connecting two locations, while avoiding collision with obstacles. However, it is a
A SCALED CENTRAL PATH FOR LINEAR PROGRAMMING
Institute of Scientific and Technical Information of China (English)
Ya-xiang Yuan
2001-01-01
Interior point methods are very efficient methods for solving large scale linear programming problems. The central path plays a very important role in interior point methods. In this paper we propose a new central path, which scales the variables. Thus it has the advantage of forcing the path to have roughly the same distance from each active constraint boundary near the solution.
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 ...
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...
DEFF Research Database (Denmark)
Kjeldsen, Lars Peter; Eriksen, Mette Rose
2010-01-01
Artikelen er en evaluering af de adaptive tests, som blev indført i folkeskolen. Artiklen sætter særligt fokus på evaluering i folkeskolen, herunder bidrager den med vejledning til evaluering, evalueringsværktøjer og fagspecifkt evalueringsmateriale.......Artikelen er en evaluering af de adaptive tests, som blev indført i folkeskolen. Artiklen sætter særligt fokus på evaluering i folkeskolen, herunder bidrager den med vejledning til evaluering, evalueringsværktøjer og fagspecifkt evalueringsmateriale....
DEFF Research Database (Denmark)
Andersen, Torben Juul
2015-01-01
This article provides an overview of theoretical contributions that have influenced the discourse around strategic adaptation including contingency perspectives, strategic fit reasoning, decision structure, information processing, corporate entrepreneurship, and strategy process. The related...... concepts of strategic renewal, dynamic managerial capabilities, dynamic capabilities, and strategic response capabilities are discussed and contextualized against strategic responsiveness. The insights derived from this article are used to outline the contours of a dynamic process of strategic adaptation....... This model incorporates elements of central strategizing, autonomous entrepreneurial behavior, interactive information processing, and open communication systems that enhance the organization's ability to observe exogenous changes and respond effectively to them....
Allen, Craig R.; Garmestani, Ahjond S.
2015-01-01
Adaptive management is an approach to natural resource management that emphasizes learning through management where knowledge is incomplete, and when, despite inherent uncertainty, managers and policymakers must act. Unlike a traditional trial and error approach, adaptive management has explicit structure, including a careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. The process is iterative, and serves to reduce uncertainty, build knowledge and improve management over time in a goal-oriented and structured process.
Formulas giving prime numbers under Cram\\'er's conjecture
Farhi, Bakir
2006-01-01
Under Cram\\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$. Under the same conjecture, we also prove that for any $\\epsilon>0$, there exists a positive real number $B$ for which the formula $[B.{n!}^{2+\\epsilon}]$ gives a prime number for any sufficiently large positive integer $n$.
A Path to Collaborative Strategic Learning
Energy Technology Data Exchange (ETDEWEB)
Nancy M. Carlson
2003-10-01
Collaborative learning is critical for the future of any organization and must align with the strategic organizational processes that result in products valued by others. To discover these processes, proposal preparation is explored using topic-oriented ethnography, grounded theory, and an innovative addition to qualitative interviewing, called metainquiry. Using interview data from editors, graphic artists, text processors, scientists, engineers, and technical managers, substantive theory emerges. The research discovers the five essential processes of owning, visioning, reviewing, producing, and contributing needed for organizational strategic learning to occur. The dimensions of these processes are made explicit and can be used to gauge the health of any organization. The substantive theory also provides insight into the ability of collaborative learning to evolve, flourish, and adapt to the strategic advantage of the organization. Lastly, actionable goals with ten essential elements emerge that link owning, visioning, reviewing, producing, and contributing as a path for all organizations to follow to promote collaborative learning communities and enhance their competitive advantage.
Economics of adaptation to climate change; Economie de l'adaptation au changement climatique
Energy Technology Data Exchange (ETDEWEB)
Perthuis, Ch.; Hallegatte, St.; Lecocq, F.
2010-02-15
This report proposes a general economic framework for the issue of adaptation to climate change in order to help public and private actors to build up efficient adaptation strategies. It proposes a general definition of adaptation, identifies the major stakes for these strategies, and discusses the assessment of global costs of adaptation to climate change. It discusses the role and modalities of public action and gives some examples of possible adaptation measures in some important sectors (building and town planning, energy and transport infrastructures, water and agriculture, ecosystems, insurance). It examines the regional and national dimensions of adaptation and their relationship, and defines steps for implementing an adaptation strategy. It describes and discusses the use of economic tools in the elaboration of an adaptation strategy, i.e. how to take uncertainties into account, which scenarios to choose, how to use economic calculations to assess adaptation policies
Link prediction based on path entropy
Xu, Zhongqi; Yang, Jian
2015-01-01
Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path entropy to the link prediction problem in real-world networks. Specifically, we propose a new similarity index, namely Path Entropy (PE) index, which considers the information entropies of shortest paths between node pairs with penalization to long paths. Empirical experiments demonstrate that PE index outperforms the mainstream link predictors.
Rough paths in idealized financial markets
Vladimir Vovk
2010-01-01
This paper considers possible price paths of a financial security in an idealized market. Its main result is that the variation index of typical price paths is at most 2; in this sense, typical price paths are not rougher than typical paths of Brownian motion. We do not make any stochastic assumptions and only assume that the price path is positive and right-continuous. The qualification "typical" means that there is a trading strategy (constructed explicitly in the proof) that risks only one...
Complexity Analysis of the Lasso Regularization Path
Mairal, Julien
2012-01-01
The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at most O(1/sqrt(epsilon)) linear segments can always be obtained, where every point on the path is guaranteed to be optimal up to a relative epsilon-duality gap. We complete our theoretical analysis with a practical algorithm to compute these approximate paths.
Two Generations of Path Dependence in Economics?
DEFF Research Database (Denmark)
Madsen, Mogens Ove
2010-01-01
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...... or economic processes have multiple possible paths of outcomes, rather than a unique path of equilibria. The selection among outcomes may depend on contingent choices or events – outcomes of path-dependent processes require a very relevant study – a perception of history....
Relations between Coherence and Path Information.
Bagan, Emilio; Bergou, János A; Cottrell, Seth S; Hillery, Mark
2016-04-22
We find two relations between coherence and path information in a multipath interferometer. The first builds on earlier results for the two-path interferometer, which used minimum-error state discrimination between detector states to provide the path information. For visibility, which was used in the two-path case, we substitute a recently defined l_{1} measure of quantum coherence. The second is an entropic relation in which the path information is characterized by the mutual information between the detector states and the outcome of the measurement performed on them, and the coherence measure is one based on relative entropy.
Reprint of: Bidding to give in the field
S. Onderstal; A.J.H.C. Schram; A.R. Soetevent
2014-01-01
In a door-to-door fundraising field experiment, we study the impact of fundraising mechanisms on charitable giving. We approached about 4500 households, each participating in an all-pay auction, a lottery, a non-anonymous voluntary contribution mechanism (VCM), or an anonymous VCM. In contrast to th
"What Advice Would You Give to Students Starting Your Course?"
Meedin, Aneeqa
2007-01-01
In this essay, the author, a Biomedical Sciences student at the University of Sheffield, presents an atypical way of addressing the question "What advice would you give to students starting your course?" by transcribing the much-evoked and revered Ten Commandments, the original guide to life, into advice for new and bewildered Biomedical…
Giving the Gift of Life at the End of Life
... a DO Video Library Giving the Gift of Life at the End of Life Page Content Today there are more than 120, ... using organ transplantation to treat a number of life-threatening diseases, there hasn’t been a corresponding ...
Reciprocity Revisited : Give and Take in Dutch and Immigrant Families
Komter, Aafke; Schans, Djamila
2008-01-01
The idea that reciprocity is the basic principle underlying forms of social organization, among which the family, is as old as classical anthropology and sociology. The essence of the principle is that giving prompts receiving, thereby creating forms of ongoing exchange and durable cooperation. Reci
Education Philanthropy Catching a Chill as Economy Cools Charitable Giving
Robelen, Erik W.
2009-01-01
This article reports that the recession tearing into the U.S. economy is not only straining the public coffers that support K-12 schooling, it's also taking a toll on education philanthropy. From family foundations to corporate philanthropies, charitable giving to K-12 education appears to be facing a downturn. Although no national figures are…
33 CFR 54.03 - Persons authorized to give notices.
2010-07-01
... PERSONNEL ALLOTMENTS FROM ACTIVE DUTY PAY FOR CERTAIN SUPPORT OBLIGATIONS § 54.03 Persons authorized to give... effect a plan approved under Part D of Title IV of the Social Security Act (42 U.S.C. 651-664), who has the duty or authority to seek recovery of any amounts owed as child or child and spousal...
Reprint of : Bidding to give in the field
Onderstal, Sander; Schram, Arthur J. H. C.; Soetevent, Adriaan R.
2014-01-01
In a door-to-door fundraising field experiment, we study the impact of fundraising mechanisms on charitable giving. We approached about 4500 households, each participating in an all-pay auction, a lottery, a non-anonymous voluntary contribution mechanism (VCM), or an anonymous VCM. In contrast to th
An Exploration of Giving among Gay Male College Alumni
Vervoort, Alex; Gasman, Marybeth
2016-01-01
This study explores the influence of sexual orientation and race on college alumni giving. The authors use qualitative methods, interviewing alumni at one university in the Northeast. They also provide recommendations for fundraising and alumni practitioners as well as recommendations for those scholars interested in student identity, fundraising,…
Give clean air the economic value it deserves
International Nuclear Information System (INIS)
India contributes more to the management of the atmosphere than a country like the Netherlands. This is not to the credit of the Indian government; rather, it is merely a consequence of poverty. Poor people use almost no fossil fuels and emit almost no CO2. Paying developing countries for this environmental service to the world community would create a financial incentive to continue to provide this service in the future, while at the same time generating additional funds to improve the living standards of the poorest people. The attractiveness of this approach depends on one important assumption: the conventional development path - economic growth implies emissions - must be replaced by a sustainable development path delinks economic growth from increasing emissions. Rich industrialised countries also have an interest in such decoupling. The compensation they pay the developing countries would fall proportionately to the reduction of their CO2 emissions. So an incentive is created on both sides to switch over to a low-carbon energy strategy. After the completion of this transition, every country can use as much energy as it wants, because energy consumption would then no longer cause CO2 emissions. This is the picture of the future to which the United Air Fund aspires
Attention trees and semantic paths
Giusti, Christian; Pieroni, Goffredo G.; Pieroni, Laura
2007-02-01
In the last few decades several techniques for image content extraction, often based on segmentation, have been proposed. It has been suggested that under the assumption of very general image content, segmentation becomes unstable and classification becomes unreliable. According to recent psychological theories, certain image regions attract the attention of human observers more than others and, generally, the image main meaning appears concentrated in those regions. Initially, regions attracting our attention are perceived as a whole and hypotheses on their content are formulated; successively the components of those regions are carefully analyzed and a more precise interpretation is reached. It is interesting to observe that an image decomposition process performed according to these psychological visual attention theories might present advantages with respect to a traditional segmentation approach. In this paper we propose an automatic procedure generating image decomposition based on the detection of visual attention regions. A new clustering algorithm taking advantage of the Delaunay- Voronoi diagrams for achieving the decomposition target is proposed. By applying that algorithm recursively, starting from the whole image, a transformation of the image into a tree of related meaningful regions is obtained (Attention Tree). Successively, a semantic interpretation of the leaf nodes is carried out by using a structure of Neural Networks (Neural Tree) assisted by a knowledge base (Ontology Net). Starting from leaf nodes, paths toward the root node across the Attention Tree are attempted. The task of the path consists in relating the semantics of each child-parent node pair and, consequently, in merging the corresponding image regions. The relationship detected in this way between two tree nodes generates, as a result, the extension of the interpreted image area through each step of the path. The construction of several Attention Trees has been performed and partial
Evaluation of guidewire path reproducibility.
Schafer, Sebastian; Hoffmann, Kenneth R; Noël, Peter B; Ionita, Ciprian N; Dmochowski, Jacek
2008-05-01
The number of minimally invasive vascular interventions is increasing. In these interventions, a variety of devices are directed to and placed at the site of intervention. The device used in almost all of these interventions is the guidewire, acting as a monorail for all devices which are delivered to the intervention site. However, even with the guidewire in place, clinicians still experience difficulties during the interventions. As a first step toward understanding these difficulties and facilitating guidewire and device guidance, we have investigated the reproducibility of the final paths of the guidewire in vessel phantom models on different factors: user, materials and geometry. Three vessel phantoms (vessel diameters approximately 4 mm) were constructed having tortuousity similar to the internal carotid artery from silicon tubing and encased in Sylgard elastomer. Several trained users repeatedly passed two guidewires of different flexibility through the phantoms under pulsatile flow conditions. After the guidewire had been placed, rotational c-arm image sequences were acquired (9 in. II mode, 0.185 mm pixel size), and the phantom and guidewire were reconstructed (512(3), 0.288 mm voxel size). The reconstructed volumes were aligned. The centerlines of the guidewire and the phantom vessel were then determined using region-growing techniques. Guidewire paths appear similar across users but not across materials. The average root mean square difference of the repeated placement was 0.17 +/- 0.02 mm (plastic-coated guidewire), 0.73 +/- 0.55 mm (steel guidewire) and 1.15 +/- 0.65 mm (steel versus plastic-coated). For a given guidewire, these results indicate that the guidewire path is relatively reproducible in shape and position.
Communication path for extreme environments
Jorgensen, Charles C. (Inventor); Betts, Bradley J. (Inventor)
2010-01-01
Methods and systems for using one or more radio frequency identification devices (RFIDs), or other suitable signal transmitters and/or receivers, to provide a sensor information communication path, to provide location and/or spatial orientation information for an emergency service worker (ESW), to provide an ESW escape route, to indicate a direction from an ESW to an ES appliance, to provide updated information on a region or structure that presents an extreme environment (fire, hazardous fluid leak, underwater, nuclear, etc.) in which an ESW works, and to provide accumulated thermal load or thermal breakdown information on one or more locations in the region.
Gibbs Ensembles of Nonintersecting Paths
Borodin, Alexei
2008-01-01
We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures on lozenge and domino tilings of the plane, some of which are non-translation-invariant. The correlation kernels of our processes can be viewed as extensions of the discrete sine kernel, and we show that the Gibbs property is a consequence of simple linear relations satisfied by these kernels. The processes depend on infinitely many parameters, which are closely related to parametrization of totally positive Toeplitz matrices.
Paths and cycles of hypergraphs
Institute of Scientific and Technical Information of China (English)
王建方; Tony; T.Lee
1999-01-01
Hypergraphs are the most general structures in discrete mathematics. Acyclic hypergraphs have been proved very useful in relational databases. New systems of axioms for paths, connectivity and cycles of hypergraphs are constructed. The systems suit the structure properties of relational databases. The concepts of pseudo cycles and essential cycles of hypergraphs are introduced. They are relative to each other. Whether a family of cycles of a hypergraph is dependent or independent is defined. An enumeration formula for the maximum number of independent essential cycles of a hypergraph is given.
Path of Chinese institutional modernization
Sahoo, Ganeswar
2009-01-01
We see the progress today that China has developed a treasure of modernity in terms of its World figure both in economic development and its strong military power with countless path of ups and downs in the past. We are more concerned with the historical study of its institutional modernization than a mere philosophical debate over its development and can discuss its various levels of struggle for ‘Substitute Modernity’2 since mid-19th century(the two opium wars) to till date.
Deterministic Circular Self Test Path
Institute of Scientific and Technical Information of China (English)
WEN Ke; HU Yu; LI Xiaowei
2007-01-01
Circular self test path (CSTP) is an attractive technique for testing digital integrated circuits(IC) in the nanometer era, because it can easily provide at-speed test with small test data volume and short test application time. However, CSTP cannot reliably attain high fault coverage because of difficulty of testing random-pattern-resistant faults. This paper presents a deterministic CSTP (DCSTP) structure that consists of a DCSTP chain and jumping logic, to attain high fault coverage with low area overhead. Experimental results on ISCAS'89 benchmarks show that 100% fault coverage can be obtained with low area overhead and CPU time, especially for large circuits.
Uncommon paths in quantum physics
Kazakov, Konstantin V
2014-01-01
Quantum mechanics is one of the most fascinating, and at the same time most controversial, branches of contemporary science. Disputes have accompanied this science since its birth and have not ceased to this day. Uncommon Paths in Quantum Physics allows the reader to contemplate deeply some ideas and methods that are seldom met in the contemporary literature. Instead of widespread recipes of mathematical physics, based on the solutions of integro-differential equations, the book follows logical and partly intuitional derivations of non-commutative algebra. Readers can directly penetrate the
Dyck Paths, Standard Young Tableaux, and Pattern Avoiding Permutations
Gudmundsson, Hilmar
2009-01-01
We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of another pattern of length three. This gives a refinement of some previously studied statistics, most notably one by Noonan. The formula is also shown to enumerate a family of classes of Dyck paths and Standard Young Tableaux, and a bijection is given between the corresponding classes of these two families of objects. Finally, the results obtained are used to solve an optimization problem for a certain card game.
MM98.83 Quantification of Combined Strain Paths
DEFF Research Database (Denmark)
Nielsen, Morten Sturgård; Lindegren, Maria; Wanheim, Tarras
1998-01-01
concept and the uniqueness of the SHC representation.The SHC may be used to give a useful representation of the total course of the deformation with respect to directions and magnitudes of strains, snd hence the development of the plastic properties, butmay also be used for developing variables describing...... sheared case. Here the latter is a superset of plateworking processes and axisymmetrical processes.The origin and use of the SHC in this paper, is to make a method of classifying processes after strain path and hence the need for using advanced plasticity models. As an example the extrusion process is...
Arithmetic area for m planar Brownian paths
International Nuclear Information System (INIS)
We pursue the analysis made in Desbois and Ouvry (2011 J. Stat. Mech. P05024) on the arithmetic area enclosed by m closed Brownian paths. We pay particular attention to the random variable Sn1,n2,...,nm(m), which is the arithmetic area of the set of points, also called winding sectors, enclosed n1 times by path 1, n2 times by path 2,..., and nm times by path m. Various results are obtained in the asymptotic limit m→∞. A key observation is that, since the paths are independent, one can use in the m-path case the SLE information, valid in the one-path case, on the zero-winding sectors arithmetic area
Arithmetic area for m planar Brownian paths
Desbois, Jean; Ouvry, Stéphane
2012-05-01
We pursue the analysis made in Desbois and Ouvry (2011 J. Stat. Mech. P05024) on the arithmetic area enclosed by m closed Brownian paths. We pay particular attention to the random variable Sn1, n2,..., nm(m), which is the arithmetic area of the set of points, also called winding sectors, enclosed n1 times by path 1, n2 times by path 2,..., and nm times by path m. Various results are obtained in the asymptotic limit m\\to \\infty . A key observation is that, since the paths are independent, one can use in the m-path case the SLE information, valid in the one-path case, on the zero-winding sectors arithmetic area.
Longest-path attacks on complex networks
Pu, Cunlai
2014-01-01
We investigate the longest-path attacks on complex networks. Specifically, we remove approximately the longest simple path from a network iteratively until there are no paths left in the network. We propose two algorithms, the random augmenting approach (RPA) and the Hamilton-path based approach (HPA), for finding the approximately longest simple path in a network. Results demonstrate that steps of longest-path attacks increase with network density linearly for random networks, while exponentially increasing for scale-free networks. The more homogeneous the degree distribution is, the more fragile the network, which is totally different from the previous results of node or edge attacks. HPA is generally more efficient than RPA in the longest-path attacks of complex networks. These findings further help us understand the vulnerability of complex systems, better protect complex systems, and design more tolerant complex systems.
Path integral measure factorization in path integrals for diffusion of Yang--Mills fields
Storchak, S. N.
2007-01-01
Factorization of the (formal) path integral measure in a Wiener path integrals for Yang--Mills diffusion is studied. Using the nonlinear filtering stochastic differential equation, we perform the transformation of the path integral defined on a total space of the Yang--Mills principal fiber bundle and come to the reduced path integral on a Coulomb gauge surface. Integral relation between the path integral representing the "quantum" evolution given on the original manifold of Yang--Mills field...
Climatic change impacts, adaptation and associated costs in France. Intermediate report. June 2008
International Nuclear Information System (INIS)
This report aims at promoting the awareness of sector-based and land challenges of climate change in terms of impacts. It gives a wide overview of the present knowledge on sector-based vulnerabilities, and allows the identification of some paths for the alleviation of these vulnerabilities. After a discussion of objectives and context, of methodological choices (data, modalities to take impacts and adaptation into account, impact assessment approach) thematic woks are reported. They are dealing with health (population vulnerability to climate change with the example of 2006 heat wave), agriculture, forest and water, energy, tourism, natural risks and insurance, territories. For each of these topics, the reports discusses vulnerability aspects, the present knowledge about the impact of climate change, and identifies the core problems as well as studies which remain to be performed
An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective
Faigl, Jan
2016-01-01
In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning. PMID:27340395
An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.
Faigl, Jan
2016-01-01
In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to "see" the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning. PMID:27340395
An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.
Faigl, Jan
2016-01-01
In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to "see" the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.
An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective
Directory of Open Access Journals (Sweden)
Jan Faigl
2016-01-01
Full Text Available In this paper, Self-Organizing Map (SOM for the Multiple Traveling Salesman Problem (MTSP with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots’ workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.
OPEN-PATH FTIR MEASUREMENTS OF NOX AND OTHER DIESEL EMISSIONS
The paper gives results of a demonstration of the feasibility of using an open-path Fourier transform infrared (OP-FTIR) monitoring technique to address the across-road characterization of diesel vehicle emissions of criteria pollutants and hazardous air pollutants. Four sets of ...
Energy Technology Data Exchange (ETDEWEB)
Huq, Saleemul
2011-11-15
Efforts to help the world's poor will face crises in coming decades as climate change radically alters conditions. Action Research for Community Adapation in Bangladesh (ARCAB) is an action-research programme on responding to climate change impacts through community-based adaptation. Set in Bangladesh at 20 sites that are vulnerable to floods, droughts, cyclones and sea level rise, ARCAB will follow impacts and adaptation as they evolve over half a century or more. National and international 'research partners', collaborating with ten NGO 'action partners' with global reach, seek knowledge and solutions applicable worldwide. After a year setting up ARCAB, we share lessons on the programme's design and move into our first research cycle.
DEFF Research Database (Denmark)
Berth, Mette
2005-01-01
This paper focuses on the use of an adaptive ethnography when studying such phenomena as young people's use of mobile media in a learning perspective. Mobile media such as PDAs and mobile phones have a number of affordances which make them potential tools for learning. However, before we begin...... formal and informal learning contexts. The paper also proposes several adaptive methodological techniques for studying young people's interaction with mobiles....... to design and develop educational materials for mobile media platforms we must first understand everyday use and behaviour with a medium such as a mobile phone. The paper outlines the research design for a PhD project on mobile learning which focuses on mobile phones as a way to bridge the gap between...
Directory of Open Access Journals (Sweden)
Paul Rozin
2008-02-01
Full Text Available People live in a world in which they are surrounded by potential disgust elicitors such as ``used'' chairs, air, silverware, and money as well as excretory activities. People function in this world by ignoring most of these, by active avoidance, reframing, or adaptation. The issue is particularly striking for professions, such as morticians, surgeons, or sanitation workers, in which there is frequent contact with major disgust elicitors. In this study, we study the ``adaptation'' process to dead bodies as disgust elicitors, by measuring specific types of disgust sensitivity in medical students before and after they have spent a few months dissecting a cadaver. Using the Disgust Scale, we find a significant reduction in disgust responses to death and body envelope violation elicitors, but no significant change in any other specific type of disgust. There is a clear reduction in discomfort at touching a cold dead body, but not in touching a human body which is still warm after death.
Viney, Mark; Reece, Sarah E.
2013-01-01
In biology, noise implies error and disorder and is therefore something which organisms may seek to minimize and mitigate against. We argue that such noise can be adaptive. Recent studies have shown that gene expression can be noisy, noise can be genetically controlled, genes and gene networks vary in how noisy they are and noise generates phenotypic differences among genetically identical cells. Such phenotypic differences can have fitness benefits, suggesting that evolution can shape noise ...
Governance and value creation in grant-giving foundations
Fabio Monteduro; Alessandro Hinna; Giacomo Boesso
2010-01-01
Grant giving foundation leaders are increasingly concerned with understanding the primary role their institutions are pressured to play in financing the growing non-profit sectors of developed economies. Furthermore, many academics, political leaders and practitioners are expecting foundations to play the unique role of merchant banks and venture capitalists to foster the positive impact of non-profit organizations on societies, people and issues they affect. The main contribution of this stu...
Evolutionary aspects of gift-giving dynamics among Norwegian students
2007-01-01
Data from questionnaires filled out by 336 students during a nine day period in January and February 1999 at the University of Oslo, Norway was analyzed to find patterns in gift-giving behavior corresponding to predicted evolutionary biological and evolutionary psychological hypotheses. Gifts given and received, people given to and received from, monetary value of gifts given and estimated monetary value of gifts received were tallied. We tested the effects of four main factors: kin and non-k...
Incapacity to give informed consent owing to mental disorder
Van Staden, C W; Kruger, C.
2003-01-01
What renders some mentally disordered patients incapable of informed consent to medical interventions? It is argued that a patient is incapable of giving informed consent owing to mental disorder, if a mental disorder prevents a patient from understanding what s/he consents to; if a mental disorder prevents a patient from choosing decisively; if a mental disorder prevents a patient from communicating his/her consent; or if a mental disorder prevents a patient from accepting the need for a med...
PC-give and David Hendry's econometric methodology
Neil R. Ericsson; Julia Campos; Hong-Anh Tran
1991-01-01
This paper summarizes David Hendry's empirical econometric methodology, unifying discussions in many of his and his co-authors' papers. Then, we describe how Hendry's suite of computer programs PC-GIVE helps users implement that methodology. Finally, we illustrate that methodology and the programs with three empirical examples: postwar narrow money demand in the United Kingdom, nominal income determination in the United Kingdom from Friedman and Schwartz (1982), and consumers' expenditure in...
Linguistic incompetence: giving an account of researching multilingually
Phipps, A.
2013-01-01
This paper considers the place of linguistic competence and incompetence in the context of researching multilingually. It offers a critique of the concept of competence and explores the performative dimensions of multilingual research and its narration, through the philosophy of Judith Butler, and in particular her study Giving an account of oneself. It explores aspects of risk, justice, narrative limit and a morality of multilingualism in emergent multilingual research frameworks. These theo...
MP I joint giving way--a case study.
Lohrer, H
2001-02-01
A case history of a 26 year old international class female 400 m hurdle sprinter is presented. While sprinting she felt a sudden and very intensive pain at her left hallux. After this she was unable to run and had episodes of giving way in the MP I joint elicited by minor activity. Operative investigation revealed a broad disruption of the MP I medial collateral ligament. After periosteal flap repair and early functional aftertreatment she returned to full high level sports ability.
Engagement driven Topic Selection for an Information-Giving Agent
Glas, Nadine; Prepin, Ken; Pelachaud, Catherine
2015-01-01
International audience We propose a model for conversational agents to select the topic of interaction in agent-initiated information-giving chat. By taking into account the agent's dynamically updated perception of the user's engagement, the agent's own preferences and its associations between topics, the agent tries to select the topic that max-imises the agent and user's combined engagement. The model offers engagement driven dialogue management on the topic level.
Dictator game giving: Rules of fairness versus acts of kindness
Gary E Bolton; Rami Zwick; Elena Katok
1998-01-01
In both dictator and impunity games, one player, the dictator, divides a fixed amount of money between himself and one other, the recipient. Recent lab studies of these games have produced seemingly inconsistent results, reporting substantially divergent amounts of dictator giving. Also, one prominent explanation for some of these differences, the impact of experimenter observation, displayed weak explanatory power in a different but related lab game. Data from the new experiment reported her...
Path Following of an Underactuated AUV Based on Fuzzy Backstepping Sliding Mode Control
Directory of Open Access Journals (Sweden)
Xiao Liang
2016-06-01
Full Text Available This paper addresses the path following problem of an underactuated autonomous underwater vehicle (AUV with the aim of dealing with parameter uncertainties and current disturbances. An adaptive robust control system was proposed by employing fuzzy logic, backstepping and sliding mode control theory. Fuzzy logic theory is adopted to approximate unknown system function, and the controller was designed by combining sliding mode control with backstepping thought. Firstly, the longitudinal speed was controlled, then the yaw angle was made as input of path following error to design the calm function and the change rate of path parameters. The controller stability was proved by Lyapunov stable theory. Simulation and outfield tests were conducted and the results showed that the controller is of excellent adaptability and robustness in the presence of parameter uncertainties and external disturbances. It is also shown to be able to avoid the chattering of AUV actuators.
Giving an account of one's pain in the anthropological interview.
Buchbinder, Mara
2010-03-01
In this paper, I analyze the illness stories narrated by a mother and her 13-year-old son as part of an ethnographic study of child chronic pain sufferers and their families. In examining some of the moral, relational and communicative challenges of giving an account of one's pain, I focus on what is left out of some accounts of illness and suffering and explore some possible reasons for these elisions. Drawing on recent work by Judith Butler (Giving an Account of Oneself, 2005), I investigate how the pragmatic context of interviews can introduce a form of symbolic violence to narrative accounts. Specifically, I use the term "genre of complaint" to highlight how anthropological research interviews in biomedical settings invoke certain typified forms of suffering that call for the rectification of perceived injustices. Interview narratives articulated in the genre of complaint privilege specific types of pain and suffering and cast others into the background. Giving an account of one's pain is thus a strategic and selective process, creating interruptions and silences as much as moments of clarity. Therefore, I argue that medical anthropologists ought to attend more closely to the institutional structures and relations that shape the production of illness narratives in interview encounters.
Comment on 'Path integral solution for a Mie-type potential'
International Nuclear Information System (INIS)
We comment on several incorrect results given in a recent paper by Erkoc and Sever (ES). In particular, it is pointed out that their path integral formula for the one-dimensional Mie-Lennard-Jones potential is wrong, since a quantum correction proportional to (h/2π)2 - which is a consequence of the stochastic nature of the Feynman paths - has been overlooked. The correct expression can be obtained from a general path integral formula, which we have derived in a previous paper. For the particular potential discussed in detail by ES, we give a complete path integral treatment, which allows us to derive the energies and normalized wave functions of the discrete spectrum. (orig.)
Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visible Midpoint
Directory of Open Access Journals (Sweden)
Motahar Reza
2016-07-01
Full Text Available An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The parallel genetic algorithm (PGA is applied on the visible midpoint approach to find shortest path for mobile robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding local minima. It gives the optimum paths which are always consisting on free trajectories. But the proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to destination due to the sharing of population. The total population is partitioned into a number subgroups to perform the parallel GA. The master thread is the center of information exchange and making selection with fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges quickly with in a less number of iteration.
Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Pisinger, David
2011-01-01
Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...... of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths....
Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Pisinger, David
Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...... of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths....
Integrated assignment and path planning
Murphey, Robert A.
2005-11-01
A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact
Adaptive security systems -- Combining expert systems with adaptive technologies
Energy Technology Data Exchange (ETDEWEB)
Argo, P.; Loveland, R.; Anderson, K. [and others
1997-09-01
The Adaptive Multisensor Integrated Security System (AMISS) uses a variety of computational intelligence techniques to reason from raw sensor data through an array of processing layers to arrive at an assessment for alarm/alert conditions based on human behavior within a secure facility. In this paper, the authors give an overview of the system and briefly describe some of the major components of the system. This system is currently under development and testing in a realistic facility setting.
Adaptive security systems -- Combining expert systems with adaptive technologies
International Nuclear Information System (INIS)
The Adaptive Multisensor Integrated Security System (AMISS) uses a variety of computational intelligence techniques to reason from raw sensor data through an array of processing layers to arrive at an assessment for alarm/alert conditions based on human behavior within a secure facility. In this paper, the authors give an overview of the system and briefly describe some of the major components of the system. This system is currently under development and testing in a realistic facility setting
Adaptive Multilevel Monte Carlo Simulation
Hoel, H
2011-08-23
This work generalizes a multilevel forward Euler Monte Carlo method introduced in Michael B. Giles. (Michael Giles. Oper. Res. 56(3):607–617, 2008.) for the approximation of expected values depending on the solution to an Itô stochastic differential equation. The work (Michael Giles. Oper. Res. 56(3):607– 617, 2008.) proposed and analyzed a forward Euler multilevelMonte Carlo method based on a hierarchy of uniform time discretizations and control variates to reduce the computational effort required by a standard, single level, Forward Euler Monte Carlo method. This work introduces an adaptive hierarchy of non uniform time discretizations, generated by an adaptive algorithmintroduced in (AnnaDzougoutov et al. Raùl Tempone. Adaptive Monte Carlo algorithms for stopped diffusion. In Multiscale methods in science and engineering, volume 44 of Lect. Notes Comput. Sci. Eng., pages 59–88. Springer, Berlin, 2005; Kyoung-Sook Moon et al. Stoch. Anal. Appl. 23(3):511–558, 2005; Kyoung-Sook Moon et al. An adaptive algorithm for ordinary, stochastic and partial differential equations. In Recent advances in adaptive computation, volume 383 of Contemp. Math., pages 325–343. Amer. Math. Soc., Providence, RI, 2005.). This form of the adaptive algorithm generates stochastic, path dependent, time steps and is based on a posteriori error expansions first developed in (Anders Szepessy et al. Comm. Pure Appl. Math. 54(10):1169– 1214, 2001). Our numerical results for a stopped diffusion problem, exhibit savings in the computational cost to achieve an accuracy of ϑ(TOL),from(TOL−3), from using a single level version of the adaptive algorithm to ϑ(((TOL−1)log(TOL))2).
Counting paths with Schur transitions
Díaz, Pablo; Kemp, Garreth; Véliz-Osorio, Alvaro
2016-10-01
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which is valid for any rank of the unitary group, reproduces known asymptotic results. We proceed to establish the general validity of this expression by a formal proof. The form of this equation strongly hints towards a quantum generalization. Thus, we introduce a notion of quantum relative dimension and subject it to the appropriate consistency tests. This new quantity finds its natural environment in the context of RCFTs and fractional statistics; where the already established notion of quantum dimension has proven to be of great physical importance.
Exclusive paths and difficult choices
International Nuclear Information System (INIS)
The authors argue basically for a process by which one may objectively analyze the desirability of future energy goals. A table is presented that projects the U.S. primary energy supply in the year 2000. The authors note that according to the table, oil and gas demand are still dangerously close to today's level. Nuclear and coal production rise sharply, but are limited by practical constraints to the rate of expansion, and new energy sources (geothermal, wind, solar, and biomass) provide only about 5 to 6% of demand in the year 2000. An analysis is given of Amory Lovins's hard and soft path energy projections for the years 2000-2025 for coal, oil and gas, and nuclear energies
Methodologies for tracking learning paths
DEFF Research Database (Denmark)
Frølunde, Lisbeth; Gilje, Øystein; Lindstrand, Fredrik;
2009-01-01
The article concerns the design of a collaborative research project (2008-09) entitled Making a Filmmaker, which examines how young Scandinavian filmmakers create their own learn- ing paths in formal and/or informal contexts. Our interest is how learning experiences and contexts motivate the young...... filmmakers: what furthers their interest and/or hinders it, and what learning patterns emerge. The aim of this article is to present and discuss issues regarding the methodology and meth- ods of the study, such as developing a relationship with interviewees when conducting inter- views online (using MSN). We...... suggest two considerations about using online interviews: how the interviewees value the given subject of conversation and their familiarity with being online. The benefit of getting online communication with the young filmmakers offers ease, because it is both practical and appropriates a meeting...
The Logic Behind Feynman's Paths
García Álvarez, Edgardo T.
The classical notions of continuity and mechanical causality are left in order to reformulate the Quantum Theory starting from two principles: (I) the intrinsic randomness of quantum process at microphysical level, (II) the projective representations of symmetries of the system. The second principle determines the geometry and then a new logic for describing the history of events (Feynman's paths) that modifies the rules of classical probabilistic calculus. The notion of classical trajectory is replaced by a history of spontaneous, random and discontinuous events. So the theory is reduced to determining the probability distribution for such histories accordingly with the symmetries of the system. The representation of the logic in terms of amplitudes leads to Feynman rules and, alternatively, its representation in terms of projectors results in the Schwinger trace formula.
Path Network Recovery Using Remote Sensing Data and Geospatial-Temporal Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
McLendon, William C.,; Brost, Randolph
2016-05-01
Remote sensing systems produce large volumes of high-resolution images that are difficult to search. The GeoGraphy (pronounced Geo-Graph-y) framework [2, 20] encodes remote sensing imagery into a geospatial-temporal semantic graph representation to enable high level semantic searches to be performed. Typically scene objects such as buildings and trees tend to be shaped like blocks with few holes, but other shapes generated from path networks tend to have a large number of holes and can span a large geographic region due to their connectedness. For example, we have a dataset covering the city of Philadelphia in which there is a single road network node spanning a 6 mile x 8 mile region. Even a simple question such as "find two houses near the same street" might give unexpected results. More generally, nodes arising from networks of paths (roads, sidewalks, trails, etc.) require additional processing to make them useful for searches in GeoGraphy. We have assigned the term Path Network Recovery to this process. Path Network Recovery is a three-step process involving (1) partitioning the network node into segments, (2) repairing broken path segments interrupted by occlusions or sensor noise, and (3) adding path-aware search semantics into GeoQuestions. This report covers the path network recovery process, how it is used, and some example use cases of the current capabilities.
Multi-agent Path Planning and Network Flow
Yu, Jingjin
2012-01-01
This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the latter, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invariant, the problem always has a feasible solution path set with a longest finish time of no more than $n + V - 1$ steps, in which $n$ is the number of agents and $V$ is the number of vertices of the underlying graph. We then give a complete algorithm that finds such a solution in $O(nVE)$ time, with $E$ being the number of edges of the graph. Taking a further step, we study time and distance optimality of the feasible solutions, show that they have a pairwise Pareto optimal structure, and again provide efficient algorithms for optimizing each of these practical objectives.
Closed Light Paths in Equiangular Spiral Disks
Hitzer, Eckhard
2013-01-01
A new type of deformation for microscopic laser disks, the \\textit{equiangular spiral deformation} is proposed. First a short review of the geometry of light paths in equiangular spirals in the language of real two-dimensional geometric calculus is given. Second, the constituting equations for \\textit{closed paths} inside equiangular spirals are derived. Third, their numerical solution is performed and found to yield two generic types of closed light paths. \\textit{Degenerate} closed paths that exist over large intervals of the deformation parameter, and \\textit{nondegenerate} closed paths which only exist over relatively small deformation parameter intervals spanning less than 1% of the nondegenerate intervals. Fourth, amongst the nondegenerate paths a \\textit{stable asymmetric bow-tie} shaped light trajectory was found.
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 spatiotemporal constraints, and travellers’ route choices are represented from consideration sets. A semi-compensatory model represents the constrained path enumera-tion with joint hazard-based and ordered probit models, and the path choice with a path size correction logit. Results show that spatiotemporal...... constraints are related to travellers’ socio-economic characteristics and that path choice is related to minimizing time and avoiding congestion....
Path planning based on sliding window and variant A*algorithm for quadruped robot
Institute of Scientific and Technical Information of China (English)
张慧
2016-01-01
In order to improve the adaptability of the quadruped robot in complex environments , a path planning method based on sliding window and variant A * algorithm for quadruped robot is presen-ted .To improve the path planning efficiency and robot security , an incremental A*search algorithm ( IA*) and the A*algorithm having obstacle grids extending ( EA*) are proposed respectively .The IA* algorithm firstly searches an optimal path based on A * algorithm, then a new route from the current path to the new goal projection is added to generate a suboptimum route incrementally .In comparison with traditional method solving path planning problem from scratch , the IA* enables the robot to plan path more efficiently .EA* extends the obstacle by means of increasing grid g-value, which makes the route far away from the obstacle and avoids blocking the narrow passage .To navi-gate the robot running smoothly , a quadratic B-spline interpolation is applied to smooth the path . Simulation results illustrate that the IA* algorithm can increase the re-planning efficiency more than 5 times and demonstrate the effectiveness of the EA * algorithm.
Directory of Open Access Journals (Sweden)
P.O. Judt
2015-10-01
Full Text Available In many engineering applications special requirements are directed to a material's fracture behavior and the prediction of crack paths. Especially if the material exhibits anisotropic elastic properties or fracture toughnesses, e.g. in textured or composite materials, the simulation of crack paths is challenging. Here, the application of path independent interaction integrals (I-integrals, J-, L- and M-integrals is beneficial for an accurate crack tip loading analysis. Numerical tools for the calculation of loading quantities using these path-invariant integrals are implemented into the commercial finite element (FE-code ABAQUS. Global approaches of the integrals are convenient considering crack tips approaching other crack faces, internal boundaries or material interfaces. Curved crack faces require special treatment with respect to integration contours. Numerical crack paths are predicted based on FE calculations of the boundary value problem in connection with an intelligent adaptive re-meshing algorithm. Considering fracture toughness anisotropy and accounting for inelastic effects due to small plastic zones in the crack tip region, the numerically predicted crack paths of different types of specimens with material interfaces and internal boundaries are compared to subcritically grown paths obtained from experiments.
Stress path dependent hydromechanical behaviour of heterogeneous carbonate rock
Directory of Open Access Journals (Sweden)
Dimanov A.
2010-06-01
Full Text Available The influence of stress paths, representative of reservoir conditions, on the hydromechanical behavior of a moderately heterogeneous carbonate has been investigated. Multiscale structural heterogeneities, common for instance in carbonate rocks, can strongly alter the mechanical response and significantly influence the evolution of flow properties with stress. Using a triaxial cell, the permeability evolutions during compression and the effects of brittle (fracture and plastic (pore collapse deformations at yield, were measured. A strong scattering was observed on the mechanical response both in term of compressibility and failure threshold. Using the porosity scaling predicted by an adapted effective medium theory (based on crack growth under Hertzian contact, we have rescaled the critical pressures by the normalized porosity deviation. This procedure reduces efficiently the scattering, revealing in the framework of proportional stress path loading, a linear relation between the critical pressures and the stress path parameter through all the deformation regimes. It leads to a new formulation for the critical state envelope in the 'mean stress, deviatoric stress' diagram. The attractive feature of this new yield envelope formulation relies on the fact that only the two most common different mechanical tests 'Uniaxial Compression' and 'Hydrostatic Compression', are needed to define entirely the yield envelope. Volumic strains and normalized permeabilities are finally mapped in the stresses diagram and correlated.
Dynamic behavior of shortest path routing algorithms for communication networks
Bertsekas, D. P.
1980-06-01
Several proposed routing algorithms for store and forward communication networks, including one currently in operation in the ARPANET, route messages along shortest paths computed by using some set of link lengths. When these lengths depend on current traffic conditions as they must in an adaptive algorithm, dynamic behavior questions such as stability convergence, and speed of convergence are of interest. This paper is the first attempt to analyze systematically these issues. It is shown that minimum queuing delay path algorithms tend to exhibit violent oscillatory behavior in the absence of a damping mechanism. The oscillations can be damped by means of several types of schemes, two of which are analyzed in this paper. In the first scheme a constant bias is added to the queuing delay thereby providing a preference towards paths with a small number of links. In the second scheme the effects of several past routings are averaged as, for example, when the link lengths are computed and communicated asynchronously throughout the network.
Intelligent Online Path Planning for UAVs in Adversarial Environments
Directory of Open Access Journals (Sweden)
Xingguang Peng
2012-03-01
Full Text Available Online path planning (OPP for unmanned aerial vehicles (UAVs is a basic issue of intelligent flight and is indeed a dynamic multi‐objective optimization problem (DMOP. In this paper, an OPP framework is proposed in the sense of model predictive control (MPC to continuously update the environmental information for the planner. For solving the DMOP involved in the MPC we propose a dynamic multi‐objective evolutionary algorithm based on linkage and prediction (LP‐DMOEA. Within this algorithm, the historical Pareto sets are collected and analysed to enhance the performance. For intelligently selecting the best path from the output of the OPP, the Bayesian network and fuzzy logic are used to quantify the bias to each optimization objective. The DMOEA is validated on three benchmark problems characterized by different changing types in decision and objective spaces. Moreover, the simulation results show that the LP‐DMOEA overcomes the restart method for OPP. The decision‐making method for solution selection can assess the situation in an adversarial environment and accordingly adapt the path planner.
Path Planning Control for Mobile Robot
Directory of Open Access Journals (Sweden)
Amenah A.H. Salih
2011-01-01
Full Text Available Autonomous motion planning is important area of robotics research. This type of planning relieves human operator from tedious job of motion planning. This reduces the possibility of human error and increase efficiency of whole process. This research presents a new algorithm to plan path for autonomous mobile robot based on image processing techniques by using wireless camera that provides the desired image for the unknown environment . The proposed algorithm is applied on this image to obtain a optimal path for the robot. It is based on the observation and analysis of the obstacles that lying in the straight path between the start and the goal point by detecting these obstacles, analyzing and studying their shapes, positions and points of intersection with the straight path to find the nearly optimal path which connects the start and the goal point.This work has theoretical part and experimental part. The theoretical part includes building a MATLAB program which is applied to environment image to find the nearly optimal path .MATLAB - C++.NET interface is accomplished then to supply the path information for C++.NET program which is done for programming the pioneer mobile robot to achieve the desired path. The experimental part includes using wireless camera that takes an image for the environment and send it to the computer which processes this image and sends ( by wireless connection the resulted path information to robot which programmed in C++.NET program to walk according to this path.So, the overall system can be represented by:Wireless camera computer wireless connection for the mobile robot .The experimental work including some experiments shows that the developed mobile robot (pioneer p3-dx travels successfully from the start point and reach the goal point across the optimal path (according to time and power which is obtained as result of the proposed path planning algorithm introduced in this paper.
Critical Review of Path Integral Formulation
Fujita, Takehisa
2008-01-01
The path integral formulation in quantum mechanics corresponds to the first quantization since it is just to rewrite the quantum mechanical amplitude into many dimensional integrations over discretized coordinates $x_n$. However, the path integral expression cannot be connected to the dynamics of classical mechanics, even though, superficially, there is some similarity between them. Further, the field theory path integral in terms of many dimensional integrations over fields does not correspo...
Continuous-Discrete Path Integral Filtering
Bhashyam Balaji
2008-01-01
A summary of the relationship between the Langevin equation, Fokker-Planck-Kolmogorov forward equation (FPKfe) and the Feynman path integral descriptions of stochastic processes relevant for the solution of the continuous-discrete filtering problem is provided in this paper. The practical utility of the path integral formula is demonstrated via some nontrivial examples. Specifically, it is shown that the simplest approximation of the path integral formula for the fundamental solution of the F...
Design of active N-path filters
Darvishi, Milad; Zee, van der Ronan; 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 h
Multi-path BGP: motivations and solutions
Valera, Francisco; Van Beijnum, Iljitsch; García-Martínez, Alberto; Bagnulo, Marcelo
2011-01-01
Although there are many reasons towards the adoption of a multi-path routing paradigm in the Internet, nowadays the required multi-path support is far from universal. It is mostly limited to some domains that rely on IGP features to improve load distribution in their internal infrastructure or some multi-homed parties that base their load balance on traffic engineering. This chapter explains the motivations for a multi-path routing Internet scheme, commenting the existing alternatives and det...
N-slit interference: Path integrals, Bohmian trajectories
Sbitnev, Valeriy I
2010-01-01
Path integrals give a possibility to compute in details routes of particles from particle sources through slit gratings and further to detectors. The path integral for a particle passing through the Gaussian slit results in the Gaussian wavepacket. The wavepackets prepared on N slits and superposed together give rise to interference pattern in the near-field zone. It transforms to diffraction in the far-field zone represented by divergent principal rays, at that all rays are partitioned from each other by (N-2) subsidiary rays. The Bohmian trajectories in the near-field zone of N-slit gratings show wavy behavior. And they become straight in the far-field zone. The trajectories show zigzag behavior on the interference Talbot carpet (ratio of particle wavelength to a distance between slits are much smaller than 1 and N >> 1). Namely, the trajectories prefer to pass through caustics and avoid lacunae, i.e., places with small probability densities. Monochromatic thermal neutrons (wavelength=0.5 nm) simulate radia...
Private Giving Crowding Government Funding in Public Higher Education
Directory of Open Access Journals (Sweden)
G. Thomas Sav
2010-01-01
Full Text Available Problem statement: Private giving and government funding are critical revenue sources for public colleges and universities. If increased private giving reduces government funding, then that type and extent of crowding out carries important managerial and public policy implications. Approach: The study used a government funding reaction function and an instrumental variable approach to empirically estimate the potential for crowding out. Results: The study examined the extent to which private giving reduces or crowds out state government funding of public colleges and universities. Government free riding was at question and investigated to determine how active it is in terms of private donations partially or wholly displacing state government funding. The findings suggested that the rate of crowding out was 43% on the dollar. That compares to the 45% political substitution of the 1960’s but is much diminished from the 1980’s dollar for dollar crowding out. Those are aggregate comparisons for all public institutions. A disaggregated approach in this study additionally revealed that doctoral universities were victims of the same 43% crowd out but that at two other levels, master degree granting and associate degree granting colleges, there was the opposite effect of crowding in. Those colleges received state funding augmentations of 32-92% on their dollar of privately provided donations. Conclusion/Recommendations: The study’s finding of the existence of both crowding out and crowding in can carry important policy implications for college and university funding. Future managerial and public policy decision making should take that into account. However, political sustainability and economy wide and localized effects over time of crowding out and in could prove fruitful avenues of inquiry for future research.
Techniques and applications of path integration
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
Cooperative path planning of unmanned aerial vehicles
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.
Path Deviation Equations in AP-Geometry
Wanas, M I
2005-01-01
Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak static gravitational field limits, the paths are applied successfully to interpret the discrepancy in the motion of thermal neutrons in the Earth's gravitational field (COW-experiment). The aim of the present work is to explore the properties of the deviation equations corresponding to these paths. In the present work the deviation equations are derived and compared to the geodesic deviation equation of the Riemannian geometry.
Continuous-Discrete Path Integral Filtering
Balaji, Bhashyam
2008-01-01
A summary of the relationship between the Langevin equation, Fokker-Planck-Kolmogorov forward equation (FPKfe) and the Feynman path integral descriptions of stochastic processes relevant for the solution of the continuous-discrete filtering problem is provided in this paper. The practical utility of the path integral formula is demonstrated via some nontrivial examples. Specifically, it is shown that the simplest approximation of the path integral formula for the fundamental solution of the FPKfe can be applied to solve nonlinear continuous-discrete filtering problems quite accurately. The Dirac-Feynman path integral filtering algorithm is quite simple, and is suitable for real-time implementation.
Continuous-Discrete Path Integral Filtering
Directory of Open Access Journals (Sweden)
Bhashyam Balaji
2009-08-01
Full Text Available A summary of the relationship between the Langevin equation, Fokker-Planck-Kolmogorov forward equation (FPKfe and the Feynman path integral descriptions of stochastic processes relevant for the solution of the continuous-discrete filtering problem is provided in this paper. The practical utility of the path integral formula is demonstrated via some nontrivial examples. Specifically, it is shown that the simplest approximation of the path integral formula for the fundamental solution of the FPKfe can be applied to solve nonlinear continuous-discrete filtering problems quite accurately. The Dirac-Feynman path integral filtering algorithm is quite simple, and is suitable for real-time implementation.
A note on the path interval distance.
Coons, Jane Ivy; Rusinko, Joseph
2016-06-01
The path interval distance accounts for global congruence between locally incongruent trees. We show that the path interval distance provides a lower bound for the nearest neighbor interchange distance. In contrast to the Robinson-Foulds distance, random pairs of trees are unlikely to be maximally distant from one another under the path interval distance. These features indicate that the path interval distance should play a role in phylogenomics where the comparison of trees on a fixed set of taxa is becoming increasingly important.
Arduino & RepRap - Creating Wealth by Giving it Away
DEFF Research Database (Denmark)
2011-01-01
, growth in wealth is longevity and prosperity. Is it possible to grow wealth independently of money? This talk will be from Adrian Bowyer - creator of RepRap, the open-source replicating 3D printer - and from David Cuartielles - creator of Arduino, the open-source microcontroller. Both projects have...... founded significant and growing industries - and hence significant and growing wealth - by giving away all the data required to build RepRaps and Arduinos completely free. They have also short-circuited most conventional industrial infrastructure by placing the ability to create wealth directly...
Reluctant altruism and peer pressure in charitable giving
Directory of Open Access Journals (Sweden)
Diane Reyniers
2013-01-01
Full Text Available Subjects donate individually (control group or in pairs (treatment group. Those in pairs reveal their donation decision to each other. Average donations in the treatment group are significantly higher than in the control group. Paired subjects have the opportunity to revise their donation decision after discussion. Pair members shift toward each others' initial decisions. Subjects are happier with their decision when their donations are larger, but those in pairs are less happy, controlling for amount donated. These findings suggest reluctant altruism due to peer pressure in charitable giving.
A Childhood Rich in Culture Gives a Socioeconomic Bonus
DEFF Research Database (Denmark)
Austring, Bennye Düranc
2015-01-01
Artiklen ridser den nyeste forskning op inden for feltet 'art rich learning', altså æstetiske læreprocesser af god kvalitet. In the book ”Art and Culture Give Children a Life that Works” 60 (Danish and non-Danish) experts, practitioners, artists and several Ministers from the Danish Government...... focus on the significance of Art and Culture for children. The book provides lots of inspiration for teachers, pedagogues and cultural mediators and contains many examples of specific cultural activities, links and bibliographic references....
Different Selection Pressures Give Rise to Distinct Ethnic Phenomena
Moya, Cristina; Boyd, Robert
2015-01-01
Many accounts of ethnic phenomena imply that processes such as stereotyping, essentialism, ethnocentrism, and intergroup hostility stem from a unitary adaptation for reasoning about groups. This is partly justified by the phenomena’s co-occurrence in correlational studies. Here we argue that these behaviors are better modeled as functionally independent adaptations that arose in response to different selection pressures throughout human evolution. As such, different mechanisms may be triggered by different group boundaries within a single society. We illustrate this functionalist framework using ethnographic work from the Quechua-Aymara language boundary in the Peruvian Altiplano. We show that different group boundaries motivate different ethnic phenomena. For example, people have strong stereotypes about socioeconomic categories, which are not cooperative units, whereas they hold fewer stereotypes about communities, which are the primary focus of cooperative activity. We also show that, despite the cross-cultural importance of ethnolinguistic boundaries, the Quechua-Aymara linguistic distinction does not strongly motivate any of these intergroup processes. PMID:25731969
Perturbative Methods in Path Integration
Johnson-Freyd, Theodore Paul
This dissertation addresses a number of related questions concerning perturbative "path" integrals. Perturbative methods are one of the few successful ways physicists have worked with (or even defined) these infinite-dimensional integrals, and it is important as mathematicians to check that they are correct. Chapter 0 provides a detailed introduction. We take a classical approach to path integrals in Chapter 1. Following standard arguments, we posit a Feynman-diagrammatic description of the asymptotics of the time-evolution operator for the quantum mechanics of a charged particle moving nonrelativistically through a curved manifold under the influence of an external electromagnetic field. We check that our sum of Feynman diagrams has all desired properties: it is coordinate-independent and well-defined without ultraviolet divergences, it satisfies the correct composition law, and it satisfies Schrodinger's equation thought of as a boundary-value problem in PDE. Path integrals in quantum mechanics and elsewhere in quantum field theory are almost always of the shape ∫ f es for some functions f (the "observable") and s (the "action"). In Chapter 2 we step back to analyze integrals of this type more generally. Integration by parts provides algebraic relations between the values of ∫ (-) es for different inputs, which can be packaged into a Batalin--Vilkovisky-type chain complex. Using some simple homological perturbation theory, we study the version of this complex that arises when f and s are taken to be polynomial functions, and power series are banished. We find that in such cases, the entire scheme-theoretic critical locus (complex points included) of s plays an important role, and that one can uniformly (but noncanonically) integrate out in a purely algebraic way the contributions to the integral from all "higher modes," reducing ∫ f es to an integral over the critical locus. This may help explain the presence of analytic continuation in questions like the
DEFF Research Database (Denmark)
Hudecz, Adriána
-operation and research into the common problems of the Northern Periphery. This report is an output of the ROADEX “Implementing Accessibility” project (2009-2012). It gives a summary of the results of research into adaptation measures to combat climate change effects on low volume roads in the Northern Periphery....... The research was carried out between January 2000 and March 2012. One of the biggest challenges that mankind has to face is the prospect of climate change resulting from emissions of greenhouse gases. These gases trap energy in the atmosphere and cause global surface temperatures to rise. This warming in turn...... causes changes in other climatic variables such as rainfall, humidity and wind speed that impact on the functioning of infrastructure such road networks. This paper discusses the climate changes predicted by the world’s meteorological organisations and considers how these may impact on the public...
Adaptive dynamics of saturated polymorphisms.
Kisdi, Éva; Geritz, Stefan A H
2016-03-01
We study the joint adaptive dynamics of n scalar-valued strategies in ecosystems where n is the maximum number of coexisting strategies permitted by the (generalized) competitive exclusion principle. The adaptive dynamics of such saturated systems exhibits special characteristics, which we first demonstrate in a simple example of a host-pathogen-predator model. The main part of the paper characterizes the adaptive dynamics of saturated polymorphisms in general. In order to investigate convergence stability, we give a new sufficient condition for absolute stability of an arbitrary (not necessarily saturated) polymorphic singularity and show that saturated evolutionarily stable polymorphisms satisfy it. For the case [Formula: see text], we also introduce a method to construct different pairwise invasibility plots of the monomorphic population without changing the selection gradients of the saturated dimorphism. PMID:26676357
Adaptive Routing Algorithm for MANET:TERMITE
Directory of Open Access Journals (Sweden)
Sharvani G S
2009-12-01
Full Text Available Mobile Ad hoc network consists of a set of mobile nodes. This network does not have anyinfrastructure or central administration, hence it is called infrastructure less network. As the nodes aremobile, it is very difficult to find the path between two end points. This paper presents a solution forfinding path between nodes in mobile ad hoc network. Termite is an innovative algorithm for packetrouting in communication networks. Termite is an adaptive, distributed, mobile-agents-based algorithmwhich was inspired by recent work on the ant colony metaphor. According to this algorithm, a group ofmobile agents (or artificial termites build paths between pair of nodes; exploring the networkconcurrently and exchanging obtained information to update the routing tables. Some of the parametersused to evaluate its performance are packet delays and throughput. The results of this algorithm showsbetter throughput as compared to existing algorithms. So, Termite algorithm is a promising alternativefor routing of data in commercial networks.
Analyzing the applicability of the least risk path algorithm in indoor space
Vanclooster, A.; Viaene, P.; Van de Weghe, N.; Fack, V.; De Maeyer, Ph.
2013-11-01
Over the last couple of years, applications that support navigation and wayfinding in indoor environments have become one of the booming industries. However, the algorithmic support for indoor navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. In outdoor space, several alternative algorithms have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behavior (e.g. simplest paths, least risk paths). The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-story building. Several analyses compare shortest and least risk paths in indoor and in outdoor space. The results of these analyses indicate that the current outdoor least risk path algorithm does not calculate less risky paths compared to its shortest paths. In some cases, worse routes have been suggested. Adjustments to the original algorithm are proposed to be more aligned to the specific structure of indoor environments. In a later stage, other cognitive algorithms will be implemented and tested in both an indoor and combined indoor-outdoor setting, in an effort to improve the overall user experience during navigation in indoor environments.
Path integrals with generalized Grassmann variables
Energy Technology Data Exchange (ETDEWEB)
Chaichian, M. [Helsinki Univ. (Finland). Dept. of Physics; Demichev, A.P.
1995-04-01
The path integral representations the evolution of q-oscillators with root of unity values of q-parameter is constructed using Bargmann-Fock representations with commuting and non-commuting variables, the differential calculi being q-deformed in both cases. For q{sup 2} = -1 a new form of Grassmann-like path integral is obtained. (author). 14 refs.
Heuristic estimates in shortest path algorithms
W.H.L.M. Pijls (Wim)
2006-01-01
textabstractShortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting appli
Path Integral Quantization of Spinning Superparticle
ELEGLA, H. A.; FARAHAT, N. I.
2008-01-01
The Hamilton-Jacobi formalism is used to discuss the path integral quantization of a spinning superparticle model. The equations of motion are obtained as total differential equations in many variables. The equations of motion are integrable, and the path integral is obtained as an integration over the canonical phase space coordinates.
't Hooft's quantum determinism -- path integral viewpoint
Blasone, Massimo; Jizba, Petr; Kleinert, Hagen
2005-01-01
We present a path integral formulation of 't Hooft's derivation of quantum from classical physics. Our approach is based on two concepts: Faddeev-Jackiw's treatment of constrained systems and Gozzi's path integral formulation of classical mechanics. This treatment is compared with our earlier one [quant-ph/0409021] based on Dirac-Bergmann's method.
Path Integral for Relativistic Equations of Motion
Gosselin, Pierre; Polonyi, Janos
1997-01-01
A non-Grassmanian path integral representation is given for the solution of the Klein-Gordon and the Dirac equations. The trajectories of the path integral are rendered differentiable by the relativistic corrections. The nonrelativistic limit is briefly discussed from the point of view of the renormalization group.
Path integral representation for spin systens
Karchev, Naoum
2012-01-01
The present paper is a short review of different path integral representations of the partition function of quantum spin systems. To begin with, I consider coherent states for SU(2) algebra. Different parameterizations of the coherent states lead to different path integral representations. They all are unified within an U(1) gauge theory of quantum spin systems.
Robot path planning using genetic algorithms
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Presents a strategy for soccer robot path planning using genetic algorithms for which, real number coding method is used, to overcome the defects of binary coding method, and the double crossover operation a dopted, to avoid the common defect of early convergence and converge faster than the standard genetic algo rithms concludes from simulation results that the method is effective for robot path planning.
Cost allocation in shortest path games
Voorneveld, M.; Grahn, S.
2001-01-01
A class of cooperative games arising from shortest path problems is dened These shortest path games are shown to be totally balanced and allow a population monotonic allocation scheme Possible methods for obtaining core elements are indicated rst by relating to the allocation rules in taxation and b
The Path of Carbon in Photosynthesis VI.
Calvin, M.
1949-06-30
This paper is a compilation of the essential results of our experimental work in the determination of the path of carbon in photosynthesis. There are discussions of the dark fixation of photosynthesis and methods of separation and identification including paper chromatography and radioautography. The definition of the path of carbon in photosynthesis by the distribution of radioactivity within the compounds is described.
Graphic method for analyzing common path interferometers
DEFF Research Database (Denmark)
Glückstad, J.
1998-01-01
Common path interferometers are widely used for visualizing phase disturbances and fluid flows. They are attractive because of the inherent simplicity and robustness in the setup. A graphic method will be presented for analyzing and optimizing filter parameters in common path interferometers....
DEFF Research Database (Denmark)
Rist, Lucy; Campbell, Bruce Morgan; Frost, Peter
2013-01-01
in scientific articles, policy documents and management plans, but both understanding and application of the concept is mixed. This paper reviews recent literature from conservation and natural resource management journals to assess diversity in how the term is used, highlight ambiguities and consider how...... a management framework, as well as of identified challenges and pathologies, are needed. Further discussion and systematic assessment of the approach is required, together with greater attention to its definition and description, enabling the assessment of new approaches to managing uncertainty, and AM itself.......Adaptive management (AM) emerged in the literature in the mid-1970s in response both to a realization of the extent of uncertainty involved in management, and a frustration with attempts to use modelling to integrate knowledge and make predictions. The term has since become increasingly widely used...
Precision Cleaning - Path to Premier
Mackler, Scott E.
2008-01-01
ITT Space Systems Division s new Precision Cleaning facility provides critical cleaning and packaging of aerospace flight hardware and optical payloads to meet customer performance requirements. The Precision Cleaning Path to Premier Project was a 2007 capital project and is a key element in the approved Premier Resource Management - Integrated Supply Chain Footprint Optimization Project. Formerly precision cleaning was located offsite in a leased building. A new facility equipped with modern precision cleaning equipment including advanced process analytical technology and improved capabilities was designed and built after outsourcing solutions were investigated and found lacking in ability to meet quality specifications and schedule needs. SSD cleans parts that can range in size from a single threaded fastener all the way up to large composite structures. Materials that can be processed include optics, composites, metals and various high performance coatings. We are required to provide verification to our customers that we have met their particulate and molecular cleanliness requirements and we have that analytical capability in this new facility. The new facility footprint is approximately half the size of the former leased operation and provides double the amount of throughput. Process improvements and new cleaning equipment are projected to increase 1st pass yield from 78% to 98% avoiding $300K+/yr in rework costs. Cost avoidance of $350K/yr will result from elimination of rent, IT services, transportation, and decreased utility costs. Savings due to reduced staff expected to net $4-500K/yr.
Path integral for inflationary perturbations
Prokopec, Tomislav; Rigopoulos, Gerasimos
2010-07-01
The quantum theory of cosmological perturbations in single-field inflation is formulated in terms of a path integral. Starting from a canonical formulation, we show how the free propagators can be obtained from the well-known gauge-invariant quadratic action for scalar and tensor perturbations, and determine the interactions to arbitrary order. This approach does not require the explicit solution of the energy and momentum constraints, a novel feature which simplifies the determination of the interaction vertices. The constraints and the necessary imposition of gauge conditions is reflected in the appearance of various commuting and anticommuting auxiliary fields in the action. These auxiliary fields are not propagating physical degrees of freedom but need to be included in internal lines and loops in a diagrammatic expansion. To illustrate the formalism we discuss the tree-level three-point and four-point functions of the inflaton perturbations, reproducing the results already obtained by the methods used in the current literature. Loop calculations are left for future work.
Decision paths in complex tasks
Galanter, Eugene
1991-01-01
Complex real world action and its prediction and control has escaped analysis by the classical methods of psychological research. The reason is that psychologists have no procedures to parse complex tasks into their constituents. Where such a division can be made, based say on expert judgment, there is no natural scale to measure the positive or negative values of the components. Even if we could assign numbers to task parts, we lack rules i.e., a theory, to combine them into a total task representation. We compare here two plausible theories for the amalgamation of the value of task components. Both of these theories require a numerical representation of motivation, for motivation is the primary variable that guides choice and action in well-learned tasks. We address this problem of motivational quantification and performance prediction by developing psychophysical scales of the desireability or aversiveness of task components based on utility scaling methods (Galanter 1990). We modify methods used originally to scale sensory magnitudes (Stevens and Galanter 1957), and that have been applied recently to the measure of task 'workload' by Gopher and Braune (1984). Our modification uses utility comparison scaling techniques which avoid the unnecessary assumptions made by Gopher and Braune. Formula for the utility of complex tasks based on the theoretical models are used to predict decision and choice of alternate paths to the same goal.
Paedomorphic facial expressions give dogs a selective advantage.
Directory of Open Access Journals (Sweden)
Bridget M Waller
Full Text Available How wolves were first domesticated is unknown. One hypothesis suggests that wolves underwent a process of self-domestication by tolerating human presence and taking advantage of scavenging possibilities. The puppy-like physical and behavioural traits seen in dogs are thought to have evolved later, as a byproduct of selection against aggression. Using speed of selection from rehoming shelters as a proxy for artificial selection, we tested whether paedomorphic features give dogs a selective advantage in their current environment. Dogs who exhibited facial expressions that enhance their neonatal appearance were preferentially selected by humans. Thus, early domestication of wolves may have occurred not only as wolf populations became tamer, but also as they exploited human preferences for paedomorphic characteristics. These findings, therefore, add to our understanding of early dog domestication as a complex co-evolutionary process.
The Effect of Giving Feedback to Students' Writing
Directory of Open Access Journals (Sweden)
Mochamad Zainuddin
2004-01-01
Full Text Available Although writing is as important as other skills such as listening, speaking, and reading, it needs more special attention. In order to write well, students need a long process to learn to write and they need continous feedback. The aim of this article is to know whether giving feedback to students' writing has a significant effect or not. Two groups of students, experimental and control, were involved. The compositions of the first group were given feedback, while those of the second group were not given feedback. The study shows that provision of feedback improves student's writing. In light of the result of the study, it is recommended that teachers provide feedback on students' writing.
GIVE VOICES TO SILENT LEARNERS IN SPEAKING CLASS
Institute of Scientific and Technical Information of China (English)
1999-01-01
It is commonly experienced by teachers that they meet silent learners in speaking class,especiallyin an EFL setting at the tertiary level in China.This paper attempts to diagnose the problems inthe current curriculum,curriculum materials and teaching methods used to teach the productiveskill of speaking,which are supposed to be the direct cause of students in"losing their voices",Itbegins with a brief description of the teaching and learning situation in a teachers’ college which isalso typical at other tertiary levels as well.Concrete examples of modification to the teaching ofthe skill are provided with the hope to give back"voices"to the silent students in speaking class.
Giving back: activist research with undocumented migrants in Berlin.
Huschke, Susann
2015-01-01
In this article, I draw on my doctoral field work in Berlin (2008-2010), on the illness experiences of undocumented Latin American labor migrants, and on my work as an activist for the Berlin-based nongovernmental organization Medibüro, an anti-racist migrant health organization. I highlight how my attempts to 'give back,' and the various forms of engagements and commitments that resulted from it, shaped my relationships with actors in the field, the data I gathered, and the analytical framework I employed. I offer solutions on how to address these (unintended) effects of activism, and highlight the unique potential of activist research in regard to the forms of data available to the researcher and in gaining and retaining field access. By probing into some of its concrete methodological and analytical implications, I explore how to do activist research.
When may doctors give nurses telephonic treatment instructions?
McQuoid-Mason, David Jan
2016-08-01
Doctors are expected to examine their patients before issuing telephonic instructions to nurses. However, in emergencies or when they are aware of the health status of their patients, it may be justified for a doctor to issue telephonic instructions to nurses without examining the patient. Doctors on call owe a special duty to patients, who they may have to examine or arrange for another doctor to do so before issuing telephonic instructions. In deciding whether doctors acted reasonably in issuing telephonic instructions to nurses, the courts will decide whether they exercised the same degree of skill and care as reasonably competent practitioners in their branch of the profession. Suggestions are made concerning doctors giving telephonic instructions to nurses regarding patients they have not examined. PMID:27499403
Giving back: activist research with undocumented migrants in Berlin.
Huschke, Susann
2015-01-01
In this article, I draw on my doctoral field work in Berlin (2008-2010), on the illness experiences of undocumented Latin American labor migrants, and on my work as an activist for the Berlin-based nongovernmental organization Medibüro, an anti-racist migrant health organization. I highlight how my attempts to 'give back,' and the various forms of engagements and commitments that resulted from it, shaped my relationships with actors in the field, the data I gathered, and the analytical framework I employed. I offer solutions on how to address these (unintended) effects of activism, and highlight the unique potential of activist research in regard to the forms of data available to the researcher and in gaining and retaining field access. By probing into some of its concrete methodological and analytical implications, I explore how to do activist research. PMID:25084824
What are the impacts of giving up the driving licence?
DEFF Research Database (Denmark)
Siren, Anu Kristiina; Haustein, Sonja
2014-01-01
their activities after giving up their licence. In travel frequency, neither the differences between renewers and non-renewers nor the changes over time within the groups were pronounced. The groups differed in their use of transport modes already at the baseline: the renewers drove, while nonrenewers...... travelled as passengers, used public transport, walked or cycled. Not renewing the licence was a strong predictor of unmet mobility needs, especially in relation to leisure activities. The present study indicates that younger seniors’ mobility is not likely to be affected by the strict renewal policies...... their driving licence. Data were collected in 2009 (N= 1,792) and in 2012 (N=863). The standardised interviews covered respondents’ background information, health and wellbeing, and transportation patterns. Non-renewers had poorer health already at baseline but did become more dependent on others in...
When natural selection gives gene function the cold shoulder.
Cutter, Asher D; Jovelin, Richard
2015-11-01
It is tempting to invoke organismal selection as perpetually optimizing the function of any given gene. However, natural selection can drive genic functional change without improvement of biochemical activity, even to the extinction of gene activity. Detrimental mutations can creep in owing to linkage with other selectively favored loci. Selection can promote functional degradation, irrespective of genetic drift, when adaptation occurs by loss of gene function. Even stabilizing selection on a trait can lead to divergence of the underlying molecular constituents. Selfish genetic elements can also proliferate independent of any functional benefits to the host genome. Here we review the logic and evidence for these diverse processes acting in genome evolution. This collection of distinct evolutionary phenomena - while operating through easily understandable mechanisms - all contribute to the seemingly counterintuitive notion that maintenance or improvement of a gene's biochemical function sometimes do not determine its evolutionary fate.
Feynman Path Integrals Over Entangled States
Green, A G; Keeling, J; Simon, S H
2016-01-01
The saddle points of a conventional Feynman path integral are not entangled, since they comprise a sequence of classical field configurations. We combine insights from field theory and tensor networks by constructing a Feynman path integral over a sequence of matrix product states. The paths that dominate this path integral include some degree of entanglement. This new feature allows several insights and applications: i. A Ginzburg-Landau description of deconfined phase transitions. ii. The emergence of new classical collective variables in states that are not adiabatically continuous with product states. iii. Features that are captured in product-state field theories by proliferation of instantons are encoded in perturbative fluctuations about entangled saddles. We develop a general formalism for such path integrals and a couple of simple examples to illustrate their utility.
Directory of Open Access Journals (Sweden)
Yasmina Zubaedah
2013-04-01
Full Text Available This article provides the results of an exploratory study that investigated the effect of Capabil- ity Lifecycle Path on attaining effective adaptation through innovation. Based on Miles and Snow (1978, an empirical study was conducted to explore whether performing firms are those that indi- cate consistency within the strategy, process, structure and Capability Lifecycle Path arrangement. The basic premise of this study is adaptability for sustainability, where firms go through adapta- tion cycles through Business Model Innovation would perform well when they are able to consis- tently create value and effectively manage adopted business models, or denoted as Business Mod- el Effectiveness. Using data obtained from seven Indonesian firms in various industries, PLS Analy- sis was conducted to investigate the relationships between Business Strategy, Firm Resource Con- figuration, Capability Lifecycle Path and Business Model Effectiveness. Findings indicated that Ca- pability Lifecycle Path, or decisions made on the development of capabilities at the mature stage, is an important part of the series of decisions made during adaptation to ensure performance.
Sparse adaptive filters for echo cancellation
Paleologu, Constantin
2011-01-01
Adaptive filters with a large number of coefficients are usually involved in both network and acoustic echo cancellation. Consequently, it is important to improve the convergence rate and tracking of the conventional algorithms used for these applications. This can be achieved by exploiting the sparseness character of the echo paths. Identification of sparse impulse responses was addressed mainly in the last decade with the development of the so-called ``proportionate''-type algorithms. The goal of this book is to present the most important sparse adaptive filters developed for echo cancellati
A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION
MAZIAR SALAHI; TAMÁS TERLAKY
2009-01-01
Recently, using the framework of self-regularity, Salahi in his Ph.D. thesis proposed an adaptive single step algorithm which takes advantage of the current iterate information to find an appropriate barrier parameter rather than using a fixed fraction of the current duality gap. However, his algorithm might do at most one bad step after each good step in order to keep the iterate in a certain neighborhood of the central path. In this paper, using the same framework, we propose a hybrid adapt...
Kawase, Hiroshi; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi
2016-02-01
An effective solution to the continuous Internet traffic expansion is to offload traffic to lower layers such as the L2 or L1 optical layers. One possible approach is to introduce dynamic optical path operations such as adaptive establishment/tear down according to traffic variation. Path operations cannot be done instantaneously; hence, traffic prediction is essential. Conventional prediction techniques need optimal parameter values to be determined in advance by averaging long-term variations from the past. However, this does not allow adaptation to the ever-changing short-term variations expected to be common in future networks. In this paper, we propose a real-time optical path control method based on a machinelearning technique involving support vector machines (SVMs). A SVM learns the most recent traffic characteristics, and so enables better adaptation to temporal traffic variations than conventional techniques. The difficulty lies in determining how to minimize the time gap between optical path operation and buffer management at the originating points of those paths. The gap makes the required learning data set enormous and the learning process costly. To resolve the problem, we propose the adoption of multiple SVMs running in parallel, trained with non-overlapping subsets of the original data set. The maximum value of the outputs of these SVMs will be the estimated number of necessary paths. Numerical experiments prove that our proposed method outperforms a conventional prediction method, the autoregressive moving average method with optimal parameter values determined by Akaike's information criterion, and reduces the packet-loss ratio by up to 98%.
A HEURISTIC PATH-PLANNING METHOD FOR ENHANCING MACHINE-TOOL CONTOUR-FOLLOWING
Institute of Scientific and Technical Information of China (English)
Pierre-Jean BARRE; Jean-Yves DIEULOT; Richard BEAREE; Ahmed BOUZIDI
2005-01-01
The machine-tools performances within the framework of high-speed machining both depend on the design of the reference trajectory and on the tuning of the servo controllers. The reduction of the contouring error can be achieved by adapting the feedrate to the path profile. An alternative method consists of smoothing the spatial trajectory that allows to decrease the cycle time. A path smoothing technique is provided, which uses an analogy with racing-car piloting. The trajectory is modified pointwise according to a set of rules and is designed using fuzzy control.
Path statistics, memory, and coarse-graining of continuous-time random walks on networks
Manhart, Michael; Kion-Crosby, Willow; Morozov, Alexandre V.
2015-12-01
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states (for example, those employed in studies of molecular kinetics) or spatial disorder can give rise to memory and non-exponential distributions of waiting times and first-passage statistics. However, existing methods for analyzing CTRWs on complex energy landscapes do not address these effects. Here we use statistical mechanics of the nonequilibrium path ensemble to characterize first-passage CTRWs on networks with arbitrary connectivity, energy landscape, and waiting time distributions. Our approach can be applied to calculating higher moments (beyond the mean) of path length, time, and action, as well as statistics of any conservative or non-conservative force along a path. For homogeneous networks, we derive exact relations between length and time moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection. For more general models, we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically. We have implemented our algorithm in PathMAN (Path Matrix Algorithm for Networks), a Python script that users can apply to their model of choice. We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs.
Path statistics, memory, and coarse-graining of continuous-time random walks on networks.
Manhart, Michael; Kion-Crosby, Willow; Morozov, Alexandre V
2015-12-01
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states (for example, those employed in studies of molecular kinetics) or spatial disorder can give rise to memory and non-exponential distributions of waiting times and first-passage statistics. However, existing methods for analyzing CTRWs on complex energy landscapes do not address these effects. Here we use statistical mechanics of the nonequilibrium path ensemble to characterize first-passage CTRWs on networks with arbitrary connectivity, energy landscape, and waiting time distributions. Our approach can be applied to calculating higher moments (beyond the mean) of path length, time, and action, as well as statistics of any conservative or non-conservative force along a path. For homogeneous networks, we derive exact relations between length and time moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection. For more general models, we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically. We have implemented our algorithm in PathMAN (Path Matrix Algorithm for Networks), a Python script that users can apply to their model of choice. We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs.
Fuzzy Optimized Metric for Adaptive Network Routing
Directory of Open Access Journals (Sweden)
Ahmad Khader Haboush
2012-04-01
Full Text Available Network routing algorithms used today calculate least cost (shortest paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Energy Technology Data Exchange (ETDEWEB)
NONE
2008-07-01
This report aims at promoting the awareness of sector-based and land challenges of climate change in terms of impacts. It gives a wide overview of the present knowledge on sector-based vulnerabilities, and allows the identification of some paths for the alleviation of these vulnerabilities. After a discussion of objectives and context, of methodological choices (data, modalities to take impacts and adaptation into account, impact assessment approach) thematic woks are reported. They are dealing with health (population vulnerability to climate change with the example of 2006 heat wave), agriculture, forest and water, energy, tourism, natural risks and insurance, territories. For each of these topics, the reports discusses vulnerability aspects, the present knowledge about the impact of climate change, and identifies the core problems as well as studies which remain to be performed
Directory of Open Access Journals (Sweden)
Biwei Tang
2016-05-01
Full Text Available Global path planning is a challenging issue in the filed of mobile robotics due to its complexity and the nature of nondeterministic polynomial-time hard (NP-hard. Particle swarm optimization (PSO has gained increasing popularity in global path planning due to its simplicity and high convergence speed. However, since the basic PSO has difficulties balancing exploration and exploitation, and suffers from stagnation, its efficiency in solving global path planning may be restricted. Aiming at overcoming these drawbacks and solving the global path planning problem efficiently, this paper proposes a hybrid PSO algorithm that hybridizes PSO and differential evolution (DE algorithms. To dynamically adjust the exploration and exploitation abilities of the hybrid PSO, a novel PSO, the nonlinear time-varying PSO (NTVPSO, is proposed for updating the velocities and positions of particles in the hybrid PSO. In an attempt to avoid stagnation, a modified DE, the ranking-based self adaptive DE (RBSADE, is developed to evolve the personal best experience of particles in the hybrid PSO. The proposed algorithm is compared with four state-of-the-art evolutionary algorithms. Simulation results show that the proposed algorithm is highly competitive in terms of path optimality and can be considered as a vital alternative for solving global path planning.
UAV feasible path planning based on disturbed fluid and trajectory propagation
Directory of Open Access Journals (Sweden)
Yao Peng
2015-08-01
Full Text Available In this paper, a novel algorithm based on disturbed fluid and trajectory propagation is developed to solve the three-dimensional (3-D path planning problem of unmanned aerial vehicle (UAV in static environment. Firstly, inspired by the phenomenon of streamlines avoiding obstacles, the algorithm based on disturbed fluid is developed and broadened. The effect of obstacles on original fluid field is quantified by the perturbation matrix, where the tangential matrix is first introduced. By modifying the original flow field, the modified one is then obtained, where the streamlines can be regarded as planned paths. And the path proves to avoid all obstacles smoothly and swiftly, follow the shape of obstacles effectively and reach the destination eventually. Then, by considering the kinematics and dynamics equations of UAV, the method called trajectory propagation is adopted to judge the feasibility of the path. If the planned path is unfeasible, repulsive and tangential parameters in the perturbation matrix will be adjusted adaptively based on the resolved state variables of UAV. In most cases, a flyable path can be obtained eventually. Simulation results demonstrate the effectiveness of this method.
Speed-up hyperspheres homotopic path tracking algorithm for PWL circuits simulations.
Ramirez-Pinero, A; Vazquez-Leal, H; Jimenez-Fernandez, V M; Sedighi, H M; Rashidi, M M; Filobello-Nino, U; Castaneda-Sheissa, R; Huerta-Chua, J; Sarmiento-Reyes, L A; Laguna-Camacho, J R; Castro-Gonzalez, F
2016-01-01
In the present work, we introduce an improved version of the hyperspheres path tracking method adapted for piecewise linear (PWL) circuits. This enhanced version takes advantage of the PWL characteristics from the homotopic curve, achieving faster path tracking and improving the performance of the homotopy continuation method (HCM). Faster computing time allows the study of complex circuits with higher complexity; the proposed method also decrease, significantly, the probability of having a diverging problem when using the Newton-Raphson method because it is applied just twice per linear region on the homotopic path. Equilibrium equations of the studied circuits are obtained applying the modified nodal analysis; this method allows to propose an algorithm for nonlinear circuit analysis. Besides, a starting point criteria is proposed to obtain better performance of the HCM and a technique for avoiding the reversion phenomenon is also proposed. To prove the efficiency of the path tracking method, several cases study with bipolar (BJT) and CMOS transistors are provided. Simulation results show that the proposed approach can be up to twelve times faster than the original path tracking method and also helps to avoid several reversion cases that appears when original hyperspheres path tracking scheme was employed.
Reaction path synthesis methodology for waste minimization
Institute of Scientific and Technical Information of China (English)
HU; Shanying; LI; Mingheng; LI; Yourun; SHEN; Jingzhu; LIU
2004-01-01
It is a key step for reducing waste generation in chemical processes to design optimal reaction paths. In this paper, methods of waste minimization for reaction path synthesis problems are proposed to realize eco-industrial production mode with minimum waste emission. A new conception of simple stoichiometric reaction is presented for reaction path synthesis problem. All simple stoichiometric reactions can be obtained by mathematical transformation for atom matrix of a reaction system. Based on the conception, a two-tier optimization method for complex reaction path synthesis problems is addressed. The first step is to determine the economic optimal overall reactions, and the second step to decompose each overall reaction into several sub-reactions and find out the best thermodynamic feasible reaction path. Further, a method of reaction path synthesis with waste closed-cycle is proposed based on simple stoichiometric reactions for achieving zero waste emission to poly-generation problem of multi-products. Case studies show that the proposed methods can efficiently solve practical reaction path synthesis problems.
Adaptive Feedback Cancellation With Band-Limited LPC Vocoder in Digital Hearing Aids
Ma, Guilin; Gran, Fredrik; Jacobsen, Finn; Agerkvist, Finn T.
2011-01-01
Feedback oscillation is one of the major issues with hearing aids. An effective way of feedback suppression is adaptive feedback cancellation, which uses an adaptive filter to estimate the feedback path. However, when the external input signal is correlated with the receiver input signal, the estimate of the feedback path is biased. This so-called “bias problem” results in a large modeling error and a cancellation of the desired signal. This paper proposes a band-limited linear predictive cod...
Does friendship give us non-derivative partial reasons ?
Directory of Open Access Journals (Sweden)
Andrew Reisner
2008-02-01
Full Text Available One way to approach the question of whether there are non-derivative partial reasons of any kind is to give an account of what partial reasons are, and then to consider whether there are such reasons. If there are, then it is at least possible that there are partial reasons of friendship. It is this approach that will be taken here, and it produces several interesting results. The first is a point about the structure of partial reasons. It is at least a necessary condition of a reason’s being partial that it has an explicit relational component. This component, technically, is a relatum in the reason relation that itself is a relation between the person to whom the reason applies and the person whom the action for which there is a reason concerns. The second conclusion of the paper is that this relational component is also required for a number of types of putatively impartial reasons. In order to avoid trivialising the distinction between partial and impartial reasons, some further sufficient condition must be applied. Finally, there is some prospect for a way of distinguishing between impartial reasons that contain a relational component and partial reasons, but that this approach suggests that the question of whether ethics is partial or impartial will be settled at the level of normative ethical discourse, or at least not at the level of discourse about the nature of reasons for action.
Small wins matter in advocacy movements: giving voice to patients.
Jason, Leonard A
2012-06-01
In this article, the various players are delineated in a story of a contested illness and patient advocacy, played out within the corridors of federal power. It is suggested that the mistreatment and negative attitudes that health care providers and others have towards those with chronic fatigue syndrome (CFS) is possibly due to the social construction of this illness as being a "Yuppie flu" disease. Institutional factors are identified that created these norms and attributions, as well as the multiple stakeholders and constituent groups invested in exerting pressure on policy makers to effect systemic change. This article also provides examples of how the field of Community Psychology, which is fundamentally committed to/based on listening to and giving voice to patients, is broadly relevant to patient activism communities. This approach focused, over time, on epidemiological studies, the name, the case definition, and ultimately the change in CFS leadership at the Centers for Disease Control and Prevention. Keys to this "small wins" approach were coalition building, use of "oppositional experts" (professionals in the scientific community who support patient advocacy goals) to challenge federal research, and taking advantage of developing events/shifts in power. Ultimately, this approach can result in significant scientific and policy gains, and changes in medical and public perception of an illness. PMID:21858612
Which fMRI clustering gives good brain parcellations?
Directory of Open Access Journals (Sweden)
Bertrand eThirion
2014-07-01
Full Text Available Analysis and interpretation of neuroimaging data often require one to divide the brain into a number of regions, or parcels, with homogeneous characteristics, be these regions defined in the brain volume or on on the cortical surface. While predefined brain atlases do not adapt to the signal in the individual subjects images, parcellation approaches use brain activity (e.g. found in some functional contrasts of interest and clustering techniques to define regions with some degree of signal homogeneity. In this work, we address the question of which clustering technique is appropriate and how to optimize the corresponding model. We use two principled criteria: goodness of fit (accuracy, and reproducibility of the parcellation across bootstrap samples. We study these criteria on both simulated and two task-based functional Magnetic Resonance Imaging datasets for the Ward, spectral and K-means clustering algorithms. We show that in general Ward’s clustering performs better than alternative methods with regards to reproducibility and accuracy and that the two criteria diverge regarding the preferred models (reproducibility leading to more conservative solutions, thus deferring the practical decision to a higher level alternative, namely the choice of a trade-off between accuracy and stability.
Non Abelian Dual Maps in Path Space
Martin, I
1999-01-01
We study an extension of the procedure to construct duality transformations among abelian gauge theories to the non abelian case using a path space formulation. We define a pre-dual functional in path space and introduce a particular non local map among Lie algebra valued 1-form functionals that reduces to the ordinary Hodge-* duality map of the abelian theories. Further, we establish a full set of equations on path space representing the ordinary Yang Mills equations and Bianchi identities of non abelian gauge theories of 4-dimensional euclidean space.
Path integral representations on the complex sphere
Energy Technology Data Exchange (ETDEWEB)
Grosche, C. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik
2007-08-15
In this paper we discuss the path integral representations for the coordinate systems on the complex sphere S{sub 3C}. The Schroedinger equation, respectively the path integral, separates in exactly 21 orthogonal coordinate systems. We enumerate these coordinate systems and we are able to present the path integral representations explicitly in the majority of the cases. In each solution the expansion into the wave-functions is stated. Also, the kernel and the corresponding Green function can be stated in closed form in terms of the invariant distance on the sphere, respectively on the hyperboloid. (orig.)
INVESTMENT DEVELOPMENT PATH – CONCEPT AND TERMS
Directory of Open Access Journals (Sweden)
Ovidiu Serafim TRUFIN
2015-04-01
Full Text Available This article aims to analyze and explain the traditional model of Investment Development Path with new teoretical approaches. Investment Develoment Path is the latest theory about foreign direct investment and explains the relationship between a country’s development level and international investment position of a country. It has become a necessity in this research field of Romanian economy to establish a idiosyncratic model for evolution of inflows and outflows of Foreign Direct Investments after 1990. Also, persistent confusion between static and dynamic nature in using appropriate economic Romanian terms is removed. General theoretical approach is enhanced with new elements of schematic theorizing of Stages of Investment Development Path.
Test Derivation Through Critical Path Transitions
Institute of Scientific and Technical Information of China (English)
李卫东; 魏道政
1992-01-01
In this paper, a new technique called test derivation is presented,aiming at the promotion of the random testing efficiency for combinational circuits,Combined with a fault simulator based on critical path tracing method,we introduce the concept of seed test derivation and attempt to generate a group of new tests from the seed test by means of critical path transition.The neccessary conditions and efficient algorithms are proposed to guarantee the usefulness of the newly derived tests and the correctness of the critical path transitions.Also,examples are given to demonstrate the effectiveness of the technique.
Extending the application of critical path methods.
Coffey, R J; Othman, J E; Walters, J I
1995-01-01
Most health care organizations are using critical pathways in an attempt to reduce the variation in patient care, improve quality, enhance communication, and reduce costs. Virtually all of the critical path efforts to date have developed tables of treatments, medications, and so forth by day and have displayed them in a format known as a Gantt chart. This article presents a methodology for identifying the true "time-limiting" critical path, describes three additional methods for presenting the information--the network, precedent, and resource formats--and shows how these can significantly enhance current critical path efforts.
Path planning strategies for autonomous ground vehicles
Gifford, Kevin Kent
Several key issues involved with the planning and executing of optimally generated paths for autonomous vehicles are addressed. Two new path planning algorithms are developed, and examined, which effectively minimize replanning as unmapped hazards are encountered. The individual algorithms are compared via extensive simulation. The search strategy results are implemented and tested using the University of Colorado's autonomous vehicle test-bed, RoboCar, and results show the advantages of solving the single-destination all-paths problem for autonomous vehicle path planning. Both path planners implement a graph search methodology incorporating dynamic programming that solves the single-destination shortest-paths problem. Algorithm 1, termed DP for dynamic programming, searches a state space where each state represents a potential vehicle location in a breadth-first fashion expanding from the goal to all potential start locations in the state space. Algorithm 2, termed DP*, couples the heuristic search power of the well-known A* search procedure (Nilsson-80) with the dynamic programming principle applied to graph searching to efficiently make use of overlapping subproblems. DP* is the primary research contribution of the work contained within this thesis. The advantage of solving the single-destination shortest-paths problem is that the entire terrain map is solved in terms of reaching a specified goal. Therefore, if the robot is diverted from the pre-planned path, an alternative path is already computed. The search algorithms are extended to include a probabilistic approach using empirical loss functions to incorporate terrain map uncertainties into the path considering terrain planning process. The results show the importance of considering terrain uncertainty. If the map representation ignores uncertainty by marking any area with less than perfect confidence as unpassable or assigns it the worst case rating, then the paths are longer than intuitively necessary. A
Self-Adaptive Systems for Machine Intelligence
He, Haibo
2011-01-01
This book will advance the understanding and application of self-adaptive intelligent systems; therefore it will potentially benefit the long-term goal of replicating certain levels of brain-like intelligence in complex and networked engineering systems. It will provide new approaches for adaptive systems within uncertain environments. This will provide an opportunity to evaluate the strengths and weaknesses of the current state-of-the-art of knowledge, give rise to new research directions, and educate future professionals in this domain. Self-adaptive intelligent systems have wide application
Saving reed lands by giving economic value to reed
Directory of Open Access Journals (Sweden)
F.W. Croon
2014-07-01
Full Text Available Discussions about the need for renewable energy, the need for nature conservation, the need to double the world’s food production to eliminate hunger, the need to reduce carbon dioxide emission, and the wish to reduce dependency on dwindling oil resources, show that these issues are intimately related and sometimes mutually exclusive. The use of food crops for the production of renewable fuels has resulted in the energy vs. food debate; the use of scarce land and fresh water for the dedicated production of biomass conflicts with food production and nature conservation; the collection of harvest residues and forest wastes as biomass to produce renewable fuels is complex and leaves a CO2 footprint. The several species of reed that grow naturally in deltas, river plains etc. can provide large amounts of biomass but are hardly mentioned in the debates. Harvesting reed does not threaten the nature and the natural functions of reed lands, which are carbon neutral or carbon dioxide sinks. Reed production does not need extensive infrastructure or complex cultivation and does not compete with food production for land and fresh water. Reed lands in many places are under threat of reclamation for economic activities and urbanisation. This trend can be countered if reed is seen to have a proven economic value. In this article I argue that giving a sustainable economic value to reed lands can only be realised if the exploitation is recognised as being environmentally acceptable, commercially feasible and a source of economic gains for all stakeholders. Commercial feasibility can be achieved under present economic conditions only if a reliable supply of considerable volumes of reed at a limited price can be guaranteed.
The economic impact of giving up nuclear power in France
International Nuclear Information System (INIS)
French nuclear plants will have to be shut down in the 2020's. Electricite de France (EDF) could replace them by either nuclear or gas-fired plants. Choosing the latter would lead to an increase in Green House Gases (GHG) emissions and to a rise of EDF's generation costs. In 2020, the price of electricity in Europe will be determined by a competitive market. Therefore, a rise of EDF's generation costs will mainly depress its operating profit (and slightly increase the market's price). Giving up nuclear power in 2020 would consequently lead to a fall of EDF's value and would penalize its shareholders, the State. On a macro-economic scale, the shock on the production cost of electricity would lead to a 0,5 to 1,0 percentage point drop of GDP (depending on the hypotheses). Structural unemployment would rise by 0,3 to 0,6 percentage point. The model used to find these results does not take into account the risk of nuclear accidents nor the uncertainty on the costs of nuclear waste disposal. On the other hand, gas-price is assumed to be low, and the costs of gas-fired generation do not integrate the risk premium due to gas-price volatility. In conclusion, the best choice on both micro and macro scales, consists in extending the life of current nuclear plants (if such an extension is authorised by safety regulators). These plants would be financially-amortized, produce electricity at a very competitive cost and emit no GHG. Furthermore, extending the life of current nuclear plants will defer any irreversible commitment on their replacement. The necessary decision could therefore be taken later on, with more information on the cost of alternative generation technologies and their efficiency. (author)
ESTIMATION OF TORTUOSITY AND RECONSTRUCTION OF GEODESIC PATHS IN 3D
Directory of Open Access Journals (Sweden)
Charles Peyrega
2013-03-01
Full Text Available The morphological tortuosity of a geodesic path in a medium can be defined as the ratio between its geodesic length and the Euclidean distance between its two extremities. Thus, the minimum tortuosity of all the geodesic paths into a medium in 2D or in 3D can be estimated by image processing methodsusing mathematical morphology. Considering a medium, the morphological tortuosities of its internal paths are estimated according to one direction, which is perpendicular to both starting and ending opposite extremities of the geodesicpaths. The used algorithm estimates the morphological tortuosities from geodesic distance maps, which are obtained from geodesic propagations. The shape of the propagated structuring element used to estimate the geodesic distance maps on a discrete grid has a direct influence on the morphological tortuosity and has to be chosen very carefully. The results of our algorithm is an image with pixels p having a value equal to the length of the shortest path containing p and connected to two considered opposite boundaries A and B of the image. The analysis of the histogram of the morphological tortuosities gives access to their statistical distribution. Moreover, for each tortuosity the paths can be extracted from the original image, which highlights the location of them into the sample. However, these geodesic paths have to be reconstructed for further processing. The extraction, because applying a threshold on the tortuosities, results in disconnected components, especially for highly tortuous paths. This reconstruction consists in reconnecting these components to the geodesic path linking the two opposite faces, by means of a backtracking algorithm.
Non-classical paths in interference experiments
Sawant, Rahul; Sinha, Aninda; Sinha, Supurna; Sinha, Urbasi
2014-01-01
In a double slit interference experiment, the wave function at the screen with both slits open is not exactly equal to the sum of the wave functions with the slits individually open one at a time. The three scenarios represent three different boundary conditions and as such, the superposition principle should not be applicable. However, most well known text books in quantum mechanics implicitly and/or explicitly use this assumption which is only approximately true. In our present study, we have used the Feynman path integral formalism to quantify contributions from non-classical paths in quantum interference experiments which provide a measurable deviation from a naive application of the superposition principle. A direct experimental demonstration for the existence of these non-classical paths is hard. We find that contributions from such paths can be significant and we propose simple three-slit interference experiments to directly confirm their existence.
Nonclassical Paths in Quantum Interference Experiments
Sawant, Rahul; Samuel, Joseph; Sinha, Aninda; Sinha, Supurna; Sinha, Urbasi
2014-09-01
In a double slit interference experiment, the wave function at the screen with both slits open is not exactly equal to the sum of the wave functions with the slits individually open one at a time. The three scenarios represent three different boundary conditions and as such, the superposition principle should not be applicable. However, most well-known text books in quantum mechanics implicitly and/or explicitly use this assumption that is only approximately true. In our present study, we have used the Feynman path integral formalism to quantify contributions from nonclassical paths in quantum interference experiments that provide a measurable deviation from a naive application of the superposition principle. A direct experimental demonstration for the existence of these nonclassical paths is difficult to present. We find that contributions from such paths can be significant and we propose simple three-slit interference experiments to directly confirm their existence.
Covariant path integrals and black holes
Vendrell, F
1997-01-01
The thermal nature of the propagator in a collapsed black-hole spacetime is shown to follow from the non-trivial topology of the configuration space in tortoise coordinates by using the path integral formalism.
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 ...
Path count asymptotics and Stirling numbers
Petersen, K.; Varchenko, A.
2009-01-01
We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.
Northern Pintail - Flight Path Telemetry [ds117
California Department of Resources — North-south flight paths of radio-tagged female northern pintails were monitored in a section of Highway 152 near Los Banos, California during 4 and 11 November and...
Path integral distance for data interpretation
Volchenkov, D
2015-01-01
The process of data interpretation is always based on the implicit introduction of equivalence relations on the set of walks over the database. Every equivalence relation on the set of walks specifies a Markov chain describing the transitions of a discrete time random walk. In order to geometrize and interpret the data, we propose the new distance between data units defined as a "Feynman path integral", in which all possible paths between any two nodes in a graph model of the data are taken into account, although some paths are more preferable than others. Such a path integral distance approach to the analysis of databases has proven its efficiency and success, especially on multivariate strongly correlated data where other methods fail to detect structural components (urban planning, historical language phylogenies, music, street fashion traits analysis, etc. ). We believe that it would become an invaluable tool for the intelligent complexity reduction and big data interpretation.
Numerical path integration with Coulomb potential
Myrheim, Jan
2003-01-01
A simple and efficient method for quantum Monte Carlo simulation is presented, based on discretization of the action in the path integral, and a Gaussian averaging of the potential, which works well e.g. with the Coulomb potential.
Path integration in relativistic quantum mechanics
Redmount, I H; Redmount, Ian H.; Suen, Wai-Mo
1993-01-01
The simple physics of a free particle reveals important features of the path-integral formulation of relativistic quantum theories. The exact quantum-mechanical propagator is calculated here for a particle described by the simple relativistic action proportional to its proper time. This propagator is nonvanishing outside the light cone, implying that spacelike trajectories must be included in the path integral. The propagator matches the WKB approximation to the corresponding configuration-space path integral far from the light cone; outside the light cone that approximation consists of the contribution from a single spacelike geodesic. This propagator also has the unusual property that its short-time limit does not coincide with the WKB approximation, making the construction of a concrete skeletonized version of the path integral more complicated than in nonrelativistic theory.
Exploring Zika's Path Through the Placenta
... https://medlineplus.gov/news/fullstory_159075.html Exploring Zika's Path Through the Placenta Researchers find the virus ... research seems to shed light on how the Zika virus infects, but doesn't kill, placenta cells. ...
Modeling DNA Dynamics by Path Integrals
Zoli, Marco
2013-01-01
Complementary strands in DNA double helix show temporary fluctuational openings which are essential to biological functions such as transcription and replication of the genetic information. Such large amplitude fluctuations, known as the breathing of DNA, are generally localized and, microscopically, are due to the breaking of the hydrogen bonds linking the base pairs (\\emph{bps}). I apply imaginary time path integral techniques to a mesoscopic Hamiltonian which accounts for the helicoidal geometry of a short circular DNA molecule. The \\emph{bps} displacements with respect to the ground state are interpreted as time dependent paths whose amplitudes are consistent with the model potential for the hydrogen bonds. The portion of the paths configuration space contributing to the partition function is determined by selecting the ensemble of paths which fulfill the second law of thermodynamics. Computations of the thermodynamics in the denaturation range show the energetic advantage for the equilibrium helicoidal g...
Critical paths: maximizing patient care coordination.
Spath, P L
1995-01-01
1. With today's emphasis on horizontal and vertical integration of patient care services and the new initiatives prompted by these challenges, OR nurses are considering new methods for managing the perioperative period. One such method is the critical path. 2. A critical path defines an optimal sequencing and timing of interventions by physicians, nurses, and other staff members for a particular diagnosis or procedure, designed to better use resources, maximize quality of care, and minimize delays. 3. Hospitals implementing path-based patient care have reported cost reductions and improved team-work. Critical paths have been shown to reduce patient care costs by improving hospital efficiency, not merely by reducing physician practice variations.
Building a path in cell biology.
Voeltz, Gia; Cheeseman, Iain
2012-11-01
Setting up a new lab is an exciting but challenging prospect. We discuss our experiences in finding a path to tackle some of the key current questions in cell biology and the hurdles that we have encountered along the way.
A chemist building paths to cell biology.
Weibel, Douglas B
2013-11-01
Galileo is reported to have stated, "Measure what is measurable and make measurable what is not so." My group's trajectory in cell biology has closely followed this philosophy, although it took some searching to find this path.
Path Integral Formulation of Noncommutative Quantum Mechanics
Acatrinei, C S
2001-01-01
We propose a phase-space path integral formulation of noncommutative quantum mechanics, and prove its equivalence to the operatorial formulation. As an illustration, the partition function of a noncommutative two-dimensional harmonic oscillator is calculated.
Local-time representation of path integrals.
Jizba, Petr; Zatloukal, Václav
2015-12-01
We derive a local-time path-integral representation for a generic one-dimensional time-independent system. In particular, we show how to rephrase the matrix elements of the Bloch density matrix as a path integral over x-dependent local-time profiles. The latter quantify the time that the sample paths x(t) in the Feynman path integral spend in the vicinity of an arbitrary point x. Generalization of the local-time representation that includes arbitrary functionals of the local time is also provided. We argue that the results obtained represent a powerful alternative to the traditional Feynman-Kac formula, particularly in the high- and low-temperature regimes. To illustrate this point, we apply our local-time representation to analyze the asymptotic behavior of the Bloch density matrix at low temperatures. Further salient issues, such as connections with the Sturm-Liouville theory and the Rayleigh-Ritz variational principle, are also discussed.
Multi-block and path modelling procedures
DEFF Research Database (Denmark)
Høskuldsson, Agnar
2008-01-01
The author has developed a unified theory of path and multi-block modelling of data. The data blocks are arranged in a directional path. Each data block can lead to one or more data blocks. It is assumed that there is given a collection of input data blocks. Each of them is supposed to describe one...... or more intermediate data blocks. The output data blocks are those that are at the ends of the paths and have no succeeding data blocks. The optimisation procedure finds weights for the input data blocks so that the size of the total loadings for the output data blocks are maximised. When the optimal...... weight vectors have been determined, the score and loading vectors for the data blocks in the path are determined. Appropriate adjustment of the data blocks is carried out at each step. Regression coefficients are computed for each data block that show how the data block is estimated by data blocks...
Adaptive Non-linear Control of Hydraulic Actuator Systems
DEFF Research Database (Denmark)
Hansen, Poul Erik; Conrad, Finn
1998-01-01
Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF).......Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF)....
Is adaptive co-management ethical?
Fennell, David; Plummer, Ryan; Marschke, Melissa
2008-07-01
'Good' governance and adaptive co-management hold broad appeal due to their positive connotations and 'noble ethical claims'. This paper poses a fundamental question: is adaptive co-management ethical? In pursuing an answer to this question, the concept of adaptive co-management is succinctly summarized and three ethical perspectives (deontology, teleology and existentialism) are explored. The case of adaptive co-management in Cambodia is described and subsequently considered through the lens of ethical triangulation. The case illuminates important ethical considerations and directs attention towards the need for meditative thinking which increases the value of tradition, ecology, and culture. Giving ethics a central position makes clear the potential for adaptive co-management to be an agent for governance, which is good, right and authentic as well as an arena to embrace uncertainty. PMID:17391840
Path Integrals over Velocities in Quantum Mechanics
Gitman, D. M.; Shvartsman, Sh. M.
1993-01-01
Representations of propagators by means of path integrals over velocities are discussed both in nonrelativistic and relativistic quantum mechanics. It is shown that all the propagators can only be expressed through bosonic path integrals over velocities of space-time coordinates. In the representations the integration over velocities is not restricted by any boundary conditions; matrices, which have to be inverted in course of doing Gaussian integrals, do not contain any derivatives in time, ...
New Firm Growth: Exploring Processes and Paths
Garnsey, E.; Stam, Erik; Heffernan, P.; Hugo, O.
2003-01-01
textabstractThis paper provides a new methodology for the diachronic study of new firm growth, theoretically grounded in the work of Penrose (1995). We show that a model of firm growth as an unfolding process makes possible draw simple, measurable inferences from firm level to aggregate evidence on growth paths of new firms, expressed as propositions. Metrics on growth paths of new firms in three longitudinal samples of new firms are examined for evidence at the aggregate level consistent wit...
Feasible Path Planning for Autonomous Vehicles
Vu Trieu Minh; John Pumwa
2014-01-01
The objective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, and symmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methods are simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetric polynomial algorithm provides the smoothest trajectory. Therefore, this algorithm is recommended for the d...
Feasible Path Planning for Autonomous Vehicles
Directory of Open Access Journals (Sweden)
Vu Trieu Minh
2014-01-01
Full Text Available The objective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, and symmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methods are simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetric polynomial algorithm provides the smoothest trajectory. Therefore, this algorithm is recommended for the development of an automatic control for autonomous vehicles.
Path Integral Control and State Dependent Feedback
Thijssen, Sep; Kappen, H. J.
2014-01-01
In this paper we address the problem to compute state dependent feedback controls for path integral control problems. To this end we generalize the path integral control formula and utilize this to construct parameterized state dependent feedback controllers. In addition, we show a novel relation between control and importance sampling: better control, in terms of control cost, yields more efficient importance sampling, in terms of effective sample size. The optimal control provides a zero-va...
Time Parameterization of Humanoid-Robot Paths
Suleiman, Wael; Kanehiro, Fumio; Yoshida, Eiichi; Laumond, Jean-Paul; Monin, André
2010-01-01
International audience This paper proposes a unified optimization framework to solve the time-parameterization problem of humanoid-robot paths. Even though the time-parameterization problem is well known in robotics, the application to humanoid robots has not been addressed. This is because of the complexity of the kinematical structure as well as the dynamical motion equation. The main contribution of this paper is to show that the time parameterization of a statically stable path to be t...
Converging towards the optimal path to extinction
Schwartz, Ira B.; Forgoston, Eric; Bianco, Simone; Shaw, Leah B.
2011-01-01
Extinction appears ubiquitously in many fields, including chemical reactions, population biology, evolution, and epidemiology. Even though extinction as a random process is a rare event, its occurrence is observed in large finite populations. Extinction occurs when fluctuations due to random transitions act as an effective force which drives one or more components or species to vanish. Although there are many random paths to an extinct state, there is an optimal path that maximizes the probab...
Create three distinct career paths for innovators.
O'Connor, Gina Colarelli; Corbett, Andrew; Pierantozzi, Ron
2009-12-01
Large companies say they Create Three Distinct want to be Career Paths for Innovators innovative, but they fundamentally mismanage their talent. Expecting innovators to grow along with their projects-from discovery to incubation to acceleration--sets them up to fail. Most people excel at one of the phases, not all three. By allowing innovation employees to develop career paths suited to their strengths, companies will create a sustainable innovation function. PMID:19968059
Marine vehicle path following using inner-outer loop control.
Digital Repository Service at National Institute of Oceanography (India)
Maurya, P.K.; Agular, A.P.; Pascoal, A.M.
spatial paths accurately. An example is the case where an autonomous underwater vehicle (AUV) executes a lawn-mowing manoeuvre along a desired path, at a speed that may be a function of its position along the path. In this case, no strict temporal...-up, each vehicle executes a path following maneuver along its assigned path; a decentralized control law adjusts the different vehicle speeds so that the desired geometrical pattern (compatible with the paths) is achieved. The above comments add weight...
i-PI: A Python interface for ab initio path integral molecular dynamics simulations
Ceriotti, Michele; Manolopoulos, David E
2014-01-01
Recent developments in path integral methodology have significantly reduced the computational expense of including quantum mechanical effects in the nuclear motion in ab initio molecular dynamics simulations. However, the implementation of these developments requires a considerable programming effort, which has hindered their adoption. Here we describe i-PI, an interface written in Python that has been designed to minimise the effort required to bring state-of-the-art path integral techniques to an electronic structure program. While it is best suited to first principles calculations and path integral molecular dynamics, i-PI can also be used to perform classical molecular dynamics simulations, and can just as easily be interfaced with an empirical forcefield code. To give just one example of the many potential applications of the interface, we use it in conjunction with the CP2K electronic structure package to showcase the importance of nuclear quantum effects in high pressure water.
GIVE THE PUBLIC SOMETHING, SOMETHING MORE INTERESTING THAN RADIOACTIVE WASTE
Energy Technology Data Exchange (ETDEWEB)
Codee, Hans D.K.
2003-02-27
In the Netherlands the policy to manage radioactive waste is somewhat different from that in other countries, although the practical outcome is not much different. Long-term, i.e. at least 100 years, storage in above ground engineered structures of all waste types is the first element in the Dutch policy. Second element, but equally important, is that deep geologic disposal is foreseen after the storage period. This policy was brought out in the early eighties and was communicated to the public as a practical, logical and feasible management system for the Dutch situation. Strong opposition existed at that time to deep disposal in salt domes in the Netherlands. Above ground storage at principle was not rejected because the need to do something was obvious. Volunteers for a long term storage site did not automatically emerge. A site selection procedure was followed and resulted in the present site at Vlissingen-Oost. The waste management organization, COVRA, was not really welcomed here , but was tolerated. In the nineties facilities for low and medium level waste were erected and commissioned. In the design of the facilities much attention was given to emotional factors. The first ten operational years were needed to gain trust from the local population. Impeccable conduct and behavior was necessary as well as honesty and full openness to the public Now, after some ten years, the COVRA facilities are accepted. And a new phase is entered with the commissioning of the storage facility for high level waste, the HABOG facility. A visit to that facility will not be very spectacular, activities take place only during loading and unloading. Furthermore it is a facility for waste, so unwanted material will be brought into the community. In order to give the public something more interesting the building itself is transformed into a piece of art and in the inside a special work of art will be displayed. Together with that the attitude of the company will change. We are
Path integral approach to electron scattering in classical electromagnetic potential
Chuang, Xu; Feng, Feng; Ying-Jun, Li
2016-05-01
As is known to all, the electron scattering in classical electromagnetic potential is one of the most widespread applications of quantum theory. Nevertheless, many discussions about electron scattering are based upon single-particle Schrodinger equation or Dirac equation in quantum mechanics rather than the method of quantum field theory. In this paper, by using the path integral approach of quantum field theory, we perturbatively evaluate the scattering amplitude up to the second order for the electron scattering by the classical electromagnetic potential. The results we derive are convenient to apply to all sorts of potential forms. Furthermore, by means of the obtained results, we give explicit calculations for the one-dimensional electric potential. Project supported by the National Natural Science Foundation of China (Grant Nos. 11374360, 11405266, and 11505285) and the National Basic Research Program of China (Grant No. 2013CBA01504).
Path integral formalism for a simple interacting nucleon model
International Nuclear Information System (INIS)
The early onset of the baryon density in QCD simulations can be explained by the high flavour degeneracy when using staggered fermions. A simple interacting nucleon gas model had already shown that the gas condenses at very low chemical potential as in the lattice simulations at four flavours. In order to study more carefully the nucleon gas model in the condensation region we have developed the path integral formalism to treat the first quantization non perturbatively, describing the partition function for the interacting system of nucleons. First Monte Carlo results show good agreement with the lattice QCD simulations for the onset chemical potentials and saturation densities. The extrapolation to nature gives reasonable results. (orig.)
Dynamic Shortest Path Monitoring in Spatial Networks
Institute of Scientific and Technical Information of China (English)
Shuo Shang; Lisi Chen; Zhe-Wei Wei; Dan-Huai Guo; Ji-Rong Wen
2016-01-01
With the increasing availability of real-time traﬃc information, dynamic spatial networks are pervasive nowa-days and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a des-tination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.
The path to corporate responsibility.
Zadek, Simon
2004-12-01
Nike's tagline,"Just do it," is an inspirational call to action for the millions who wear the company's athletic gear. But in terms of corporate responsibility, Nike didn't always follow its own advice. In the 1990s, protesters railed against sweatshop conditions at some of its overseas suppliers and made Nike the global poster child for corporate ethical fecklessness. The intense pressure that activists exerted on the athletic apparel giant forced it to take a long, hard look at corporate responsibility--sooner than it might have otherwise. In this article, Simon Zadek, CEO of the UK-based institute AccountAbility, describes the bumpy route Nike has traveled to get to a better ethical place, one that cultivates and champions responsible business practices. Organizations learn in unique ways, Zadek contends, but they inevitably pass through five stages of corporate responsibility, from defensive ("It's not our fault") to compliance ("We'll do only what we have to") to managerial ("It's the business") to strategic ("It gives us a competitive edge") and, finally, to civil ("We need to make sure everybody does it"). He details Nike's arduous trek through these stages-from the company's initial defensive stance, when accusations about working conditions arose, all the way to its engagement today in the international debate about business's role in society and in public policy. As he outlines this evolution, Zadek offers valuable insights to executives grappling with the challenge of managing responsible business practices. Beyond just getting their own houses in order, the author argues, companies need to stay abreast of the public's evolving ideas about corporate roles and responsibilities. Organizations that do both will engage in what he calls"civil learning". PMID:15605571
The path to corporate responsibility.
Zadek, Simon
2004-12-01
Nike's tagline,"Just do it," is an inspirational call to action for the millions who wear the company's athletic gear. But in terms of corporate responsibility, Nike didn't always follow its own advice. In the 1990s, protesters railed against sweatshop conditions at some of its overseas suppliers and made Nike the global poster child for corporate ethical fecklessness. The intense pressure that activists exerted on the athletic apparel giant forced it to take a long, hard look at corporate responsibility--sooner than it might have otherwise. In this article, Simon Zadek, CEO of the UK-based institute AccountAbility, describes the bumpy route Nike has traveled to get to a better ethical place, one that cultivates and champions responsible business practices. Organizations learn in unique ways, Zadek contends, but they inevitably pass through five stages of corporate responsibility, from defensive ("It's not our fault") to compliance ("We'll do only what we have to") to managerial ("It's the business") to strategic ("It gives us a competitive edge") and, finally, to civil ("We need to make sure everybody does it"). He details Nike's arduous trek through these stages-from the company's initial defensive stance, when accusations about working conditions arose, all the way to its engagement today in the international debate about business's role in society and in public policy. As he outlines this evolution, Zadek offers valuable insights to executives grappling with the challenge of managing responsible business practices. Beyond just getting their own houses in order, the author argues, companies need to stay abreast of the public's evolving ideas about corporate roles and responsibilities. Organizations that do both will engage in what he calls"civil learning".
Making Mistakes: Emotional Adaptation and Classroom Learning
McCaslin, Mary; Vriesema, Christine C.; Burggraf, Susan
2016-01-01
Background: We studied how students in Grades 4-6 participate in and emotionally adapt to the give-and-take of learning in classrooms, particularly when making mistakes. Our approach is consistent with researchers who (a) include cognitive appraisals in the study of emotional experiences, (b) consider how personal concerns might mediate…
An Introduction to the Computerized Adaptive Testing
Tian, Jian-quan; Miao, Dan-min; Zhu, Xia; Gong, Jing-jing
2007-01-01
Computerized adaptive testing (CAT) has unsurpassable advantages over traditional testing. It has become the mainstream in large scale examinations in modern society. This paper gives a brief introduction to CAT including differences between traditional testing and CAT, the principles of CAT, psychometric theory and computer algorithms of CAT, the…
Service Priority based Reliable Routing Path Select Method in Smart Grid Communication Network
Directory of Open Access Journals (Sweden)
Kaixuan Wang
2012-11-01
Full Text Available The new challenges and schemes for the Smart Grid require high reliable transmission technologiesto support various types of electrical services and applications. This paper concentrates the degree of importance of services and tries to allocate more important service to more reliable network routing path to deliver the key instructions in the Smart Grid communication networks. Pareto probability distribution is used to weight the reliability of IP-based router path. In order to definition the relationship of service and reliability of router path, we devise a mapping and optimal function is presented to access. An optimal method is used for adapting to find the appropriate value to match the objective function. Finally, we validate the proposed algorithms by experiments. The simulation results show that the proposed algorithm outperforms the random routing algorithms.
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.
Robot Global Path Planning Based on Improved Artificial Fish-Swarm Algorithm
Directory of Open Access Journals (Sweden)
Jiansheng Peng
2013-02-01
Full Text Available In This study, a new artificial fish-swarm optimization, to improve the foraging behavior of artificial fish swarm algorithm is closer to reality in order to let the fish foraging behavior, increase a look at the link (search ambient, after examining environment, artificial fish can get more status information of the surrounding environment. Artificial fish screened from the information obtained optimal state for the best direction of movement. Will improve the foraging behavior of artificial fish-swarm algorithm applied to robot global path planning, including the robot to bypass the analog obstacles selected three ways: go obstructions outside, go inside the obstacles, both away obstructions and went outside obstacles Thing achieve robot shortest path planning. Via the MATLAB software emulation test: the improved foraging behavior of artificial fish-swarm algorithm to improve the rapid convergence of the algorithm and stability, improve fish swarm algorithm to the adaptability of the robot global path planning.
Application of Artificial Intelligence Methods of Tool Path Optimization in CNC Machines: A Review
Directory of Open Access Journals (Sweden)
Khashayar Danesh Narooei
2014-08-01
Full Text Available Today, in most of metal machining process, Computer Numerical Control (CNC machine tools have been very popular due to their efficiencies and repeatability to achieve high accuracy positioning. One of the factors that govern the productivity is the tool path travel during cutting a work piece. It has been proved that determination of optimal cutting parameters can enhance the machining results to reach high efficiency and minimum the machining cost. In various publication and articles, scientist and researchers adapted several Artificial Intelligence (AI methods or hybrid method for tool path optimization such as Genetic Algorithms (GA, Artificial Neural Network (ANN, Artificial Immune Systems (AIS, Ant Colony Optimization (ACO and Particle Swarm Optimization (PSO. This study presents a review of researches in tool path optimization with different types of AI methods that show the capability of using different types of optimization methods in CNC machining process.