Scalable explicit implementation of anisotropic diffusion with Runge-Kutta-Legendre super-time stepping

Science.gov (United States)

Vaidya, Bhargav; Prasad, Deovrat; Mignone, Andrea; Sharma, Prateek; Rickler, Luca

2017-12-01

An important ingredient in numerical modelling of high temperature magnetized astrophysical plasmas is the anisotropic transport of heat along magnetic field lines from higher to lower temperatures. Magnetohydrodynamics typically involves solving the hyperbolic set of conservation equations along with the induction equation. Incorporating anisotropic thermal conduction requires to also treat parabolic terms arising from the diffusion operator. An explicit treatment of parabolic terms will considerably reduce the simulation time step due to its dependence on the square of the grid resolution (Δx) for stability. Although an implicit scheme relaxes the constraint on stability, it is difficult to distribute efficiently on a parallel architecture. Treating parabolic terms with accelerated super-time-stepping (STS) methods has been discussed in literature, but these methods suffer from poor accuracy (first order in time) and also have difficult-to-choose tuneable stability parameters. In this work, we highlight a second-order (in time) Runge-Kutta-Legendre (RKL) scheme (first described by Meyer, Balsara & Aslam 2012) that is robust, fast and accurate in treating parabolic terms alongside the hyperbolic conversation laws. We demonstrate its superiority over the first-order STS schemes with standard tests and astrophysical applications. We also show that explicit conduction is particularly robust in handling saturated thermal conduction. Parallel scaling of explicit conduction using RKL scheme is demonstrated up to more than 104 processors.

Time step length versus efficiency of Monte Carlo burnup calculations

International Nuclear Information System (INIS)

Dufek, Jan; Valtavirta, Ville

2014-01-01

Highlights: • Time step length largely affects efficiency of MC burnup calculations. • Efficiency of MC burnup calculations improves with decreasing time step length. • Results were obtained from SIE-based Monte Carlo burnup calculations. - Abstract: We demonstrate that efficiency of Monte Carlo burnup calculations can be largely affected by the selected time step length. This study employs the stochastic implicit Euler based coupling scheme for Monte Carlo burnup calculations that performs a number of inner iteration steps within each time step. In a series of calculations, we vary the time step length and the number of inner iteration steps; the results suggest that Monte Carlo burnup calculations get more efficient as the time step length is reduced. More time steps must be simulated as they get shorter; however, this is more than compensated by the decrease in computing cost per time step needed for achieving a certain accuracy

Constraints on a parity-even/time-reversal-odd interaction

International Nuclear Information System (INIS)

Oers, Willem T.H. van

2000-01-01

Time-Reversal-Invariance non-conservation has for the first time been unequivocally demonstrated in a direct measurement, one of the results of the CPLEAR experiment. What is the situation then with regard to time-reversal-invariance non-conservation in systems other than the neutral kaon system? Two classes of tests of time-reversal-invariance need to be distinguished: the first one deals with parity violating (P-odd)/time-reversal-invariance non-conserving (T-odd) interactions, while the second one deals with P-even/T-odd interactions (assuming CPT conservation this implies C-conjugation non-conservation). Limits on a P-odd/T-odd interaction follow from measurements of the electric dipole moment of the neutron. This in turn provides a limit on a P-odd/T-odd pion-nucleon coupling constant which is 10 -4 times the weak interaction strength. Limits on a P-even/T-odd interaction are much less stringent. The better constraint stems also from the measurement of the electric dipole moment of the neutron. Of all the other tests, measurements of charge-symmetry breaking in neutron-proton elastic scattering provide the next better constraint. The latter experiments were performed at TRIUMF (at 477 and 347 MeV) and at IUCF (at 183 MeV). Weak decay experiments (the transverse polarization of the muon in K + →π 0 μ + ν μ and the transverse polarization of the positrons in polarized muon decay) have the potential to provide comparable or possibly better constraints

Using LDPC Code Constraints to Aid Recovery of Symbol Timing

Science.gov (United States)

Jones, Christopher; Villasnor, John; Lee, Dong-U; Vales, Esteban

2008-01-01

A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation

Constraining designs for synthesis and timing analysis a practical guide to synopsys design constraints (SDC)

CERN Document Server

Gangadharan, Sridhar

2013-01-01

This book serves as a hands-on guide to timing constraints in integrated circuit design.  Readers will learn to maximize performance of their IC designs, by specifying timing requirements correctly.  Coverage includes key aspects of the design flow impacted by timing constraints, including synthesis, static timing analysis and placement and routing.  Concepts needed for specifying timing requirements are explained in detail and then applied to specific stages in the design flow, all within the context of Synopsys Design Constraints (SDC), the industry-leading format for specifying constraints.  ·         Provides a hands-on guide to synthesis and timing analysis, using Synopsys Design Constraints (SDC), the industry-leading format for specifying constraints; ·         Includes key topics of interest to a synthesis, static timing analysis or  place and route engineer; ·         Explains which constraints command to use for ease of maintenance and reuse, given several options pos...

Periodic capacity management under a lead-time performance constraint

NARCIS (Netherlands)

Büyükkaramikli, N.C.; Bertrand, J.W.M.; Ooijen, van H.P.G.

2013-01-01

In this paper, we study a production system that operates under a lead-time performance constraint which guarantees the completion of an order before a pre-determined lead-time with a certain probability. The demand arrival times and the service requirements for the orders are random. To reduce the

Notes on Timed Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Valencia, Frank D.

2004-01-01

and program reactive systems. This note provides a comprehensive introduction to the background for and central notions from the theory of tccp. Furthermore, it surveys recent results on a particular tccp calculus, ntcc, and it provides a classification of the expressive power of various tccp languages.......A constraint is a piece of (partial) information on the values of the variables of a system. Concurrent constraint programming (ccp) is a model of concurrency in which agents (also called processes) interact by telling and asking information (constraints) to and from a shared store (a constraint...

Diffeomorphic image registration with automatic time-step adjustment

DEFF Research Database (Denmark)

Pai, Akshay Sadananda Uppinakudru; Klein, S.; Sommer, Stefan Horst

2015-01-01

In this paper, we propose an automated Euler's time-step adjustment scheme for diffeomorphic image registration using stationary velocity fields (SVFs). The proposed variational problem aims at bounding the inverse consistency error by adaptively adjusting the number of Euler's step required to r...... accuracy as a fixed time-step scheme however at a much less computational cost....

Geometry and dynamics with time-dependent constraints

CERN Document Server

Evans, Jonathan M.; Jonathan M Evans; Philip A Tuckey

1995-01-01

We describe how geometrical methods can be applied to a system with explicitly time-dependent second-class constraints so as to cast it in Hamiltonian form on its physical phase space. Examples of particular interest are systems which require time-dependent gauge fixing conditions in order to reduce them to their physical degrees of freedom. To illustrate our results we discuss the gauge-fixing of relativistic particles and strings moving in arbitrary background electromagnetic and antisymmetric tensor fields.

Two-agent cooperative search using game models with endurance-time constraints

Science.gov (United States)

Sujit, P. B.; Ghose, Debasish

2010-07-01

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Minimum Time Trajectory Optimization of CNC Machining with Tracking Error Constraints

Directory of Open Access Journals (Sweden)

Qiang Zhang

2014-01-01

Full Text Available An off-line optimization approach of high precision minimum time feedrate for CNC machining is proposed. Besides the ordinary considered velocity, acceleration, and jerk constraints, dynamic performance constraint of each servo drive is also considered in this optimization problem to improve the tracking precision along the optimized feedrate trajectory. Tracking error is applied to indicate the servo dynamic performance of each axis. By using variable substitution, the tracking error constrained minimum time trajectory planning problem is formulated as a nonlinear path constrained optimal control problem. Bang-bang constraints structure of the optimal trajectory is proved in this paper; then a novel constraint handling method is proposed to realize a convex optimization based solution of the nonlinear constrained optimal control problem. A simple ellipse feedrate planning test is presented to demonstrate the effectiveness of the approach. Then the practicability and robustness of the trajectory generated by the proposed approach are demonstrated by a butterfly contour machining example.

Thinking aloud in the presence of interruptions and time constraints

DEFF Research Database (Denmark)

Hertzum, Morten; Holmegaard, Kristin Due

2013-01-01

and time constraints, two frequent elements of real-world activities. We find that the presence of auditory, visual, audiovisual, or no interruptions interacts with thinking aloud for task solution rate, task completion time, and participants’ fixation rate. Thinking-aloud participants also spend longer......Thinking aloud is widely used for usability evaluation and its reactivity is therefore important to the quality of evaluation results. This study investigates whether thinking aloud (i.e., verbalization at levels 1 and 2) affects the behaviour of users who perform tasks that involve interruptions...... responding to interruptions than control participants. Conversely, the absence or presence of time constraints does not interact with thinking aloud, suggesting that time pressure is less likely to make thinking aloud reactive than previously assumed. Our results inform practitioners faced with the decision...

Logic-based methods for optimization combining optimization and constraint satisfaction

CERN Document Server

Hooker, John

2011-01-01

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible

An explicit multi-time-stepping algorithm for aerodynamic flows

OpenAIRE

Niemann-Tuitman, B.E.; Veldman, A.E.P.

1997-01-01

An explicit multi-time-stepping algorithm with applications to aerodynamic flows is presented. In the algorithm, in different parts of the computational domain different time steps are taken, and the flow is synchronized at the so-called synchronization levels. The algorithm is validated for aerodynamic turbulent flows. For two-dimensional flows speedups in the order of five with respect to single time stepping are obtained.

Newmark local time stepping on high-performance computing architectures

KAUST Repository

Rietmann, Max

2016-11-25

In multi-scale complex media, finite element meshes often require areas of local refinement, creating small elements that can dramatically reduce the global time-step for wave-propagation problems due to the CFL condition. Local time stepping (LTS) algorithms allow an explicit time-stepping scheme to adapt the time-step to the element size, allowing near-optimal time-steps everywhere in the mesh. We develop an efficient multilevel LTS-Newmark scheme and implement it in a widely used continuous finite element seismic wave-propagation package. In particular, we extend the standard LTS formulation with adaptations to continuous finite element methods that can be implemented very efficiently with very strong element-size contrasts (more than 100×). Capable of running on large CPU and GPU clusters, we present both synthetic validation examples and large scale, realistic application examples to demonstrate the performance and applicability of the method and implementation on thousands of CPU cores and hundreds of GPUs.

Newmark local time stepping on high-performance computing architectures

KAUST Repository

Rietmann, Max; Grote, Marcus; Peter, Daniel; Schenk, Olaf

2016-01-01

In multi-scale complex media, finite element meshes often require areas of local refinement, creating small elements that can dramatically reduce the global time-step for wave-propagation problems due to the CFL condition. Local time stepping (LTS) algorithms allow an explicit time-stepping scheme to adapt the time-step to the element size, allowing near-optimal time-steps everywhere in the mesh. We develop an efficient multilevel LTS-Newmark scheme and implement it in a widely used continuous finite element seismic wave-propagation package. In particular, we extend the standard LTS formulation with adaptations to continuous finite element methods that can be implemented very efficiently with very strong element-size contrasts (more than 100×). Capable of running on large CPU and GPU clusters, we present both synthetic validation examples and large scale, realistic application examples to demonstrate the performance and applicability of the method and implementation on thousands of CPU cores and hundreds of GPUs.

Newmark local time stepping on high-performance computing architectures

Energy Technology Data Exchange (ETDEWEB)

Rietmann, Max, E-mail: max.rietmann@erdw.ethz.ch [Institute for Computational Science, Università della Svizzera italiana, Lugano (Switzerland); Institute of Geophysics, ETH Zurich (Switzerland); Grote, Marcus, E-mail: marcus.grote@unibas.ch [Department of Mathematics and Computer Science, University of Basel (Switzerland); Peter, Daniel, E-mail: daniel.peter@kaust.edu.sa [Institute for Computational Science, Università della Svizzera italiana, Lugano (Switzerland); Institute of Geophysics, ETH Zurich (Switzerland); Schenk, Olaf, E-mail: olaf.schenk@usi.ch [Institute for Computational Science, Università della Svizzera italiana, Lugano (Switzerland)

2017-04-01

In multi-scale complex media, finite element meshes often require areas of local refinement, creating small elements that can dramatically reduce the global time-step for wave-propagation problems due to the CFL condition. Local time stepping (LTS) algorithms allow an explicit time-stepping scheme to adapt the time-step to the element size, allowing near-optimal time-steps everywhere in the mesh. We develop an efficient multilevel LTS-Newmark scheme and implement it in a widely used continuous finite element seismic wave-propagation package. In particular, we extend the standard LTS formulation with adaptations to continuous finite element methods that can be implemented very efficiently with very strong element-size contrasts (more than 100x). Capable of running on large CPU and GPU clusters, we present both synthetic validation examples and large scale, realistic application examples to demonstrate the performance and applicability of the method and implementation on thousands of CPU cores and hundreds of GPUs.

Adaptive Neural Network Control for Nonlinear Hydraulic Servo-System with Time-Varying State Constraints

Directory of Open Access Journals (Sweden)

Shu-Min Lu

2017-01-01

Full Text Available An adaptive neural network control problem is addressed for a class of nonlinear hydraulic servo-systems with time-varying state constraints. In view of the low precision problem of the traditional hydraulic servo-system which is caused by the tracking errors surpassing appropriate bound, the previous works have shown that the constraint for the system is a good way to solve the low precision problem. Meanwhile, compared with constant constraints, the time-varying state constraints are more general in the actual systems. Therefore, when the states of the system are forced to obey bounded time-varying constraint conditions, the high precision tracking performance of the system can be easily realized. In order to achieve this goal, the time-varying barrier Lyapunov function (TVBLF is used to prevent the states from violating time-varying constraints. By the backstepping design, the adaptive controller will be obtained. A radial basis function neural network (RBFNN is used to estimate the uncertainties. Based on analyzing the stability of the hydraulic servo-system, we show that the error signals are bounded in the compacts sets; the time-varying state constrains are never violated and all singles of the hydraulic servo-system are bounded. The simulation and experimental results show that the tracking accuracy of system is improved and the controller has fast tracking ability and strong robustness.

Statistical quality analysis of schedulers under soft-real-time constraints

NARCIS (Netherlands)

Baarsma, H.E.; Hurink, Johann L.; Jansen, P.G.

2007-01-01

This paper describes an algorithm to determine the performance of real-time systems with tasks using stochastic processing times. Such an algorithm can be used for guaranteeing Quality of Service of periodic tasks with soft real-time constraints. We use a discrete distribution model of processing

Finite-time stabilisation of a class of switched nonlinear systems with state constraints

Science.gov (United States)

Huang, Shipei; Xiang, Zhengrong

2018-06-01

This paper investigates the finite-time stabilisation for a class of switched nonlinear systems with state constraints. Some power orders of the system are allowed to be ratios of positive even integers over odd integers. A Barrier Lyapunov function is introduced to guarantee that the state constraint is not violated at any time. Using the convex combination method and a recursive design approach, a state-dependent switching law and state feedback controllers of individual subsystems are constructed such that the closed-loop system is finite-time stable without violation of the state constraint. Two examples are provided to show the effectiveness of the proposed method.

The synchronisation of lower limb responses with a variable metronome: the effect of biomechanical constraints on timing.

Science.gov (United States)

Chen, Hui-Ya; Wing, Alan M; Pratt, David

2006-04-01

Stepping in time with a metronome has been reported to improve pathological gait. Although there have been many studies of finger tapping synchronisation tasks with a metronome, the specific details of the influences of metronome timing on walking remain unknown. As a preliminary to studying pathological control of gait timing, we designed an experiment with four synchronisation tasks, unilateral heel tapping in sitting, bilateral heel tapping in sitting, bilateral heel tapping in standing, and stepping on the spot, in order to examine the influence of biomechanical constraints on metronome timing. These four conditions allow study of the effects of bilateral co-ordination and maintenance of balance on timing. Eight neurologically normal participants made heel tapping and stepping responses in synchrony with a metronome producing 500 ms interpulse intervals. In each trial comprising 40 intervals, one interval, selected at random between intervals 15 and 30, was lengthened or shortened, which resulted in a shift in phase of all subsequent metronome pulses. Performance measures were the speed of compensation for the phase shift, in terms of the temporal difference between the response and the metronome pulse, i.e. asynchrony, and the standard deviation of the asynchronies and interresponse intervals of steady state synchronisation. The speed of compensation decreased with increase in the demands of maintaining balance. The standard deviation varied across conditions but was not related to the compensation speed. The implications of these findings for metronome assisted gait are discussed in terms of a first-order linear correction account of synchronisation.

A stabilized Runge–Kutta–Legendre method for explicit super-time-stepping of parabolic and mixed equations

International Nuclear Information System (INIS)

Meyer, Chad D.; Balsara, Dinshaw S.; Aslam, Tariq D.

2014-01-01

Parabolic partial differential equations appear in several physical problems, including problems that have a dominant hyperbolic part coupled to a sub-dominant parabolic component. Explicit methods for their solution are easy to implement but have very restrictive time step constraints. Implicit solution methods can be unconditionally stable but have the disadvantage of being computationally costly or difficult to implement. Super-time-stepping methods for treating parabolic terms in mixed type partial differential equations occupy an intermediate position. In such methods each superstep takes “s” explicit Runge–Kutta-like time-steps to advance the parabolic terms by a time-step that is s 2 times larger than a single explicit time-step. The expanded stability is usually obtained by mapping the short recursion relation of the explicit Runge–Kutta scheme to the recursion relation of some well-known, stable polynomial. Prior work has built temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Chebyshev polynomials. Since their stability is based on the boundedness of the Chebyshev polynomials, these methods have been called RKC1 and RKC2. In this work we build temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Legendre polynomials. We call these methods RKL1 and RKL2. The RKL1 method is first-order accurate in time; the RKL2 method is second-order accurate in time. We verify that the newly-designed RKL1 and RKL2 schemes have a very desirable monotonicity preserving property for one-dimensional problems – a solution that is monotone at the beginning of a time step retains that property at the end of that time step. It is shown that RKL1 and RKL2 methods are stable for all values of the diffusion coefficient up to the maximum value. We call this a convex monotonicity preserving property and show by examples that it is very useful

Parallel Execution of Multi Set Constraint Rewrite Rules

DEFF Research Database (Denmark)

Sulzmann, Martin; Lam, Edmund Soon Lee

2008-01-01

that the underlying constraint rewrite implementation executes rewrite steps in parallel on increasingly popular becoming multi-core architectures. We design and implement efficient algorithms which allow for the parallel execution of multi-set constraint rewrite rules. Our experiments show that we obtain some......Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be applied simultaneously as long as they do not interfere with each other.We wish...

Detection of Common Problems in Real-Time and Multicore Systems Using Model-Based Constraints

Directory of Open Access Journals (Sweden)

Raphaël Beamonte

2016-01-01

Full Text Available Multicore systems are complex in that multiple processes are running concurrently and can interfere with each other. Real-time systems add on top of that time constraints, making results invalid as soon as a deadline has been missed. Tracing is often the most reliable and accurate tool available to study and understand those systems. However, tracing requires that users understand the kernel events and their meaning. It is therefore not very accessible. Using modeling to generate source code or represent applications’ workflow is handy for developers and has emerged as part of the model-driven development methodology. In this paper, we propose a new approach to system analysis using model-based constraints, on top of userspace and kernel traces. We introduce the constraints representation and how traces can be used to follow the application’s workflow and check the constraints we set on the model. We then present a number of common problems that we encountered in real-time and multicore systems and describe how our model-based constraints could have helped to save time by automatically identifying the unwanted behavior.

Automatic Verification of Timing Constraints for Safety Critical Space Systems

Science.gov (United States)

Fernandez, Javier; Parra, Pablo; Sanchez Prieto, Sebastian; Polo, Oscar; Bernat, Guillem

2015-09-01

In this paper is presented an automatic process of verification. We focus in the verification of scheduling analysis parameter. This proposal is part of process based on Model Driven Engineering to automate a Verification and Validation process of the software on board of satellites. This process is implemented in a software control unit of the energy particle detector which is payload of Solar Orbiter mission. From the design model is generated a scheduling analysis model and its verification model. The verification as defined as constraints in way of Finite Timed Automatas. When the system is deployed on target the verification evidence is extracted as instrumented points. The constraints are fed with the evidence, if any of the constraints is not satisfied for the on target evidence the scheduling analysis is not valid.

Time constraints and autonomy at work in the European Union

NARCIS (Netherlands)

Dhondt, S.

1998-01-01

Time constraints and job autonomy are seen as two major dimensions of work content. These two dimensions play a major role in controlling psychosocial stress at work. The European Foundation for the Improvement of Living and Working Conditions (EFILWC) has asked NIA TNO to prepare a report on time

An explicit multi-time-stepping algorithm for aerodynamic flows

NARCIS (Netherlands)

Niemann-Tuitman, B.E.; Veldman, A.E.P.

1997-01-01

An explicit multi-time-stepping algorithm with applications to aerodynamic flows is presented. In the algorithm, in different parts of the computational domain different time steps are taken, and the flow is synchronized at the so-called synchronization levels. The algorithm is validated for

Biomechanical influences on balance recovery by stepping.

Science.gov (United States)

Hsiao, E T; Robinovitch, S N

1999-10-01

Stepping represents a common means for balance recovery after a perturbation to upright posture. Yet little is known regarding the biomechanical factors which determine whether a step succeeds in preventing a fall. In the present study, we developed a simple pendulum-spring model of balance recovery by stepping, and used this to assess how step length and step contact time influence the effort (leg contact force) and feasibility of balance recovery by stepping. We then compared model predictions of step characteristics which minimize leg contact force to experimentally observed values over a range of perturbation strengths. At all perturbation levels, experimentally observed step execution times were higher than optimal, and step lengths were smaller than optimal. However, the predicted increase in leg contact force associated with these deviations was substantial only for large perturbations. Furthermore, increases in the strength of the perturbation caused subjects to take larger, quicker steps, which reduced their predicted leg contact force. We interpret these data to reflect young subjects' desire to minimize recovery effort, subject to neuromuscular constraints on step execution time and step length. Finally, our model predicts that successful balance recovery by stepping is governed by a coupling between step length, step execution time, and leg strength, so that the feasibility of balance recovery decreases unless declines in one capacity are offset by enhancements in the others. This suggests that one's risk for falls may be affected more by small but diffuse neuromuscular impairments than by larger impairment in a single motor capacity.

Effects of Social Constraints on Career Maturity: The Mediating Effect of the Time Perspective

Science.gov (United States)

Kim, Kyung-Nyun; Oh, Se-Hee

2013-01-01

Previous studies have provided mixed results for the effects of social constraints on career maturity. However, there has been growing interest in these effects from the time perspective. Few studies have examined the effects of social constraints on the time perspective which in turn influences career maturity. This study examines the mediating…

Uncertain travel times and activity schedules under conditions of space-time constraints and invariant choice heuristics

NARCIS (Netherlands)

Rasouli, S.; Timmermans, H.J.P.

2014-01-01

The aim of this paper is to assess the impact of uncertain travel times as reflected in travel time variability on the outcomes of individuals’ activity–travel scheduling decisions, assuming they are faced with fixed space–time constraints and apply the set of decision rules that they have developed

Exshall: A Turkel-Zwas explicit large time-step FORTRAN program for solving the shallow-water equations in spherical coordinates

Science.gov (United States)

Navon, I. M.; Yu, Jian

A FORTRAN computer program is presented and documented applying the Turkel-Zwas explicit large time-step scheme to a hemispheric barotropic model with constraint restoration of integral invariants of the shallow-water equations. We then proceed to detail the algorithms embodied in the code EXSHALL in this paper, particularly algorithms related to the efficiency and stability of T-Z scheme and the quadratic constraint restoration method which is based on a variational approach. In particular we provide details about the high-latitude filtering, Shapiro filtering, and Robert filtering algorithms used in the code. We explain in detail the various subroutines in the EXSHALL code with emphasis on algorithms implemented in the code and present the flowcharts of some major subroutines. Finally, we provide a visual example illustrating a 4-day run using real initial data, along with a sample printout and graphic isoline contours of the height field and velocity fields.

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Science.gov (United States)

Yurtkuran, Alkın

2014-01-01

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms. PMID:24723834

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Directory of Open Access Journals (Sweden)

Alkın Yurtkuran

2014-01-01

Full Text Available The traveling salesman problem with time windows (TSPTW is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.

Resolving kinematic redundancy with constraints using the FSP (Full Space Parameterization) approach

International Nuclear Information System (INIS)

Pin, F.G.; Tulloch, F.A.

1996-01-01

A solution method is presented for the motion planning and control of kinematically redundant serial-link manipulators in the presence of motion constraints such as joint limits or obstacles. Given a trajectory for the end-effector, the approach utilizes the recently proposed Full Space Parameterization (FSP) method to generate a parameterized expression for the entire space of solutions of the unconstrained system. At each time step, a constrained optimization technique is then used to analytically find the specific joint motion solution that satisfies the desired task objective and all the constraints active during the time step. The method is applicable to systems operating in a priori known environments or in unknown environments with sensor-based obstacle detection. The derivation of the analytical solution is first presented for a general type of kinematic constraint and is then applied to the problem of motion planning for redundant manipulators with joint limits and obstacle avoidance. Sample results using planar and 3-D manipulators with various degrees of redundancy are presented to illustrate the efficiency and wide applicability of constrained motion planning using the FSP approach

Monocular Visual Odometry Based on Trifocal Tensor Constraint

Science.gov (United States)

Chen, Y. J.; Yang, G. L.; Jiang, Y. X.; Liu, X. Y.

2018-02-01

For the problem of real-time precise localization in the urban street, a monocular visual odometry based on Extend Kalman fusion of optical-flow tracking and trifocal tensor constraint is proposed. To diminish the influence of moving object, such as pedestrian, we estimate the motion of the camera by extracting the features on the ground, which improves the robustness of the system. The observation equation based on trifocal tensor constraint is derived, which can form the Kalman filter alone with the state transition equation. An Extend Kalman filter is employed to cope with the nonlinear system. Experimental results demonstrate that, compares with Yu’s 2-step EKF method, the algorithm is more accurate which meets the needs of real-time accurate localization in cities.

Aggressive time step selection for the time asymptotic velocity diffusion problem

International Nuclear Information System (INIS)

Hewett, D.W.; Krapchev, V.B.; Hizanidis, K.; Bers, A.

1984-12-01

An aggressive time step selector for an ADI algorithm is preseneted that is applied to the linearized 2-D Fokker-Planck equation including an externally imposed quasilinear diffusion term. This method provides a reduction in CPU requirements by factors of two or three compared to standard ADI. More important, the robustness of the procedure greatly reduces the work load of the user. The procedure selects a nearly optimal Δt with a minimum of intervention by the user thus relieving the need to supervise the algorithm. In effect, the algorithm does its own supervision by discarding time steps made with Δt too large

Real-time aircraft continuous descent trajectory optimization with ATC time constraints using direct collocation methods.

OpenAIRE

Verhoeven, Ronald; Dalmau Codina, Ramon; Prats Menéndez, Xavier; de Gelder, Nico

2014-01-01

1 Abstract In this paper an initial implementation of a real - time aircraft trajectory optimization algorithm is presented . The aircraft trajectory for descent and approach is computed for minimum use of thrust and speed brake in support of a “green” continuous descent and approach flight operation, while complying with ATC time constraints for maintaining runway throughput and co...

GOTHIC: Gravitational oct-tree code accelerated by hierarchical time step controlling

Science.gov (United States)

Miki, Yohei; Umemura, Masayuki

2017-04-01

The tree method is a widely implemented algorithm for collisionless N-body simulations in astrophysics well suited for GPU(s). Adopting hierarchical time stepping can accelerate N-body simulations; however, it is infrequently implemented and its potential remains untested in GPU implementations. We have developed a Gravitational Oct-Tree code accelerated by HIerarchical time step Controlling named GOTHIC, which adopts both the tree method and the hierarchical time step. The code adopts some adaptive optimizations by monitoring the execution time of each function on-the-fly and minimizes the time-to-solution by balancing the measured time of multiple functions. Results of performance measurements with realistic particle distribution performed on NVIDIA Tesla M2090, K20X, and GeForce GTX TITAN X, which are representative GPUs of the Fermi, Kepler, and Maxwell generation of GPUs, show that the hierarchical time step achieves a speedup by a factor of around 3-5 times compared to the shared time step. The measured elapsed time per step of GOTHIC is 0.30 s or 0.44 s on GTX TITAN X when the particle distribution represents the Andromeda galaxy or the NFW sphere, respectively, with 224 = 16,777,216 particles. The averaged performance of the code corresponds to 10-30% of the theoretical single precision peak performance of the GPU.

RealWorld evaluation: working under budget, time, data, and political constraints

National Research Council Canada - National Science Library

Bamberger, Michael; Rugh, Jim; Mabry, Linda

2012-01-01

This book addresses the challenges of conducting program evaluations in real-world contexts where evaluators and their clients face budget and time constraints and where critical data may be missing...

Real-Time Attitude Control Algorithm for Fast Tumbling Objects under Torque Constraint

Science.gov (United States)

Tsuda, Yuichi; Nakasuka, Shinichi

This paper describes a new control algorithm for achieving any arbitrary attitude and angular velocity states of a rigid body, even fast and complicated tumbling rotations, under some practical constraints. This technique is expected to be applied for the attitude motion synchronization to capture a non-cooperative, tumbling object in such missions as removal of debris from orbit, servicing broken-down satellites for repairing or inspection, rescue of manned vehicles, etc. For this objective, we have introduced a novel control algorithm called Free Motion Path Method (FMPM) in the previous paper, which was formulated as an open-loop controller. The next step of this consecutive work is to derive a closed-loop FMPM controller, and as the preliminary step toward the objective, this paper attempts to derive a conservative state variables representation of a rigid body dynamics. 6-Dimensional conservative state variables are introduced in place of general angular velocity-attitude angle representation, and how to convert between both representations are shown in this paper.

Constraint Embedding for Multibody System Dynamics

Science.gov (United States)

Jain, Abhinandan

2009-01-01

This paper describes a constraint embedding approach for the handling of local closure constraints in multibody system dynamics. The approach uses spatial operator techniques to eliminate local-loop constraints from the system and effectively convert the system into tree-topology systems. This approach allows the direct derivation of recursive O(N) techniques for solving the system dynamics and avoiding the expensive steps that would otherwise be required for handling the closedchain dynamics. The approach is very effective for systems where the constraints are confined to small-subgraphs within the system topology. The paper provides background on the spatial operator O(N) algorithms, the extensions for handling embedded constraints, and concludes with some examples of such constraints.

Applying the theory of constraints in health care: Part 1--The philosophy.

Science.gov (United States)

Breen, Anne M; Burton-Houle, Tracey; Aron, David C

2002-01-01

The imperative to improve both technical and service quality while simultaneously reducing costs is quite clear. The Theory of Constraints (TOC) is an emerging philosophy that rests on two assumptions: (1) systems thinking and (2) if a constraint "is anything that limits a system from achieving higher performance versus its goal," then every system must have at least one (and at most no more than a few) constraints or limiting factors. A constraint is neither good nor bad in itself. Rather, it just is. In fact, recognition of the existence of constraints represents an excellent opportunity for improvement because it allows one to focus ones efforts in the most productive area--identifying and managing the constraints. This is accomplished by using the five focusing steps of TOC: (1) identify the system's constraint; (2) decide how to exploit it; (3) subordinate/synchronize everything else to the above decisions; (4) elevate the system's constraint; and (5) if the constraint has shifted in the above steps, go back to step 1. Do not allow inertia to become the system's constraint. TOC also refers to a series of tools termed "thinking processes" and the sequence in which they are used.

An adaptive time-stepping strategy for solving the phase field crystal model

International Nuclear Information System (INIS)

Zhang, Zhengru; Ma, Yuan; Qiao, Zhonghua

2013-01-01

In this work, we will propose an adaptive time step method for simulating the dynamics of the phase field crystal (PFC) model. The numerical simulation of the PFC model needs long time to reach steady state, and then large time-stepping method is necessary. Unconditionally energy stable schemes are used to solve the PFC model. The time steps are adaptively determined based on the time derivative of the corresponding energy. It is found that the use of the proposed time step adaptivity cannot only resolve the steady state solution, but also the dynamical development of the solution efficiently and accurately. The numerical experiments demonstrate that the CPU time is significantly saved for long time simulations

Optimal dynamic voltage scaling for wireless sensor nodes with real-time constraints

Science.gov (United States)

Cassandras, Christos G.; Zhuang, Shixin

2005-11-01

Sensors are increasingly embedded in manufacturing systems and wirelessly networked to monitor and manage operations ranging from process and inventory control to tracking equipment and even post-manufacturing product monitoring. In building such sensor networks, a critical issue is the limited and hard to replenish energy in the devices involved. Dynamic voltage scaling is a technique that controls the operating voltage of a processor to provide desired performance while conserving energy and prolonging the overall network's lifetime. We consider such power-limited devices processing time-critical tasks which are non-preemptive, aperiodic and have uncertain arrival times. We treat voltage scaling as a dynamic optimization problem whose objective is to minimize energy consumption subject to hard or soft real-time execution constraints. In the case of hard constraints, we build on prior work (which engages a voltage scaling controller at task completion times) by developing an intra-task controller that acts at all arrival times of incoming tasks. We show that this optimization problem can be decomposed into two simpler ones whose solution leads to an algorithm that does not actually require solving any nonlinear programming problems. In the case of soft constraints, this decomposition must be partly relaxed, but it still leads to a scalable (linear in the number of tasks) algorithm. Simulation results are provided to illustrate performance improvements in systems with intra-task controllers compared to uncontrolled systems or those using inter-task control.

Coherent states for the time dependent harmonic oscillator: the step function

International Nuclear Information System (INIS)

Moya-Cessa, Hector; Fernandez Guasti, Manuel

2003-01-01

We study the time evolution for the quantum harmonic oscillator subjected to a sudden change of frequency. It is based on an approximate analytic solution to the time dependent Ermakov equation for a step function. This approach allows for a continuous treatment that differs from former studies that involve the matching of two time independent solutions at the time when the step occurs

Resolving relative time expressions in Dutch text with Constraint Handling Rules

DEFF Research Database (Denmark)

van de Camp, Matje; Christiansen, Henning

2012-01-01

It is demonstrated how Constraint Handling Rules can be applied for resolution of indirect and relative time expressions in text as part of a shallow analysis, following a specialized tagging phase. A method is currently under development, optimized for a particular corpus of historical biographies...

Parallel-Machine Scheduling with Time-Dependent and Machine Availability Constraints

Directory of Open Access Journals (Sweden)

Cuixia Miao

2015-01-01

Full Text Available We consider the parallel-machine scheduling problem in which the machines have availability constraints and the processing time of each job is simple linear increasing function of its starting times. For the makespan minimization problem, which is NP-hard in the strong sense, we discuss the Longest Deteriorating Rate algorithm and List Scheduling algorithm; we also provide a lower bound of any optimal schedule. For the total completion time minimization problem, we analyze the strong NP-hardness, and we present a dynamic programming algorithm and a fully polynomial time approximation scheme for the two-machine problem. Furthermore, we extended the dynamic programming algorithm to the total weighted completion time minimization problem.

Adaptive Time Stepping for Transient Network Flow Simulation in Rocket Propulsion Systems

Science.gov (United States)

Majumdar, Alok K.; Ravindran, S. S.

2017-01-01

Fluid and thermal transients found in rocket propulsion systems such as propellant feedline system is a complex process involving fast phases followed by slow phases. Therefore their time accurate computation requires use of short time step initially followed by the use of much larger time step. Yet there are instances that involve fast-slow-fast phases. In this paper, we present a feedback control based adaptive time stepping algorithm, and discuss its use in network flow simulation of fluid and thermal transients. The time step is automatically controlled during the simulation by monitoring changes in certain key variables and by feedback. In order to demonstrate the viability of time adaptivity for engineering problems, we applied it to simulate water hammer and cryogenic chill down in pipelines. Our comparison and validation demonstrate the accuracy and efficiency of this adaptive strategy.

High-resolution seismic wave propagation using local time stepping

KAUST Repository

Peter, Daniel; Rietmann, Max; Galvez, Percy; Ampuero, Jean Paul

2017-01-01

High-resolution seismic wave simulations often require local refinements in numerical meshes to accurately capture e.g. steep topography or complex fault geometry. Together with explicit time schemes, this dramatically reduces the global time step

[Collaborative application of BEPS at different time steps.

Science.gov (United States)

Lu, Wei; Fan, Wen Yi; Tian, Tian

2016-09-01

BEPSHourly is committed to simulate the ecological and physiological process of vegetation at hourly time steps, and is often applied to analyze the diurnal change of gross primary productivity (GPP), net primary productivity (NPP) at site scale because of its more complex model structure and time-consuming solving process. However, daily photosynthetic rate calculation in BEPSDaily model is simpler and less time-consuming, not involving many iterative processes. It is suitable for simulating the regional primary productivity and analyzing the spatial distribution of regional carbon sources and sinks. According to the characteristics and applicability of BEPSDaily and BEPSHourly models, this paper proposed a method of collaborative application of BEPS at daily and hourly time steps. Firstly, BEPSHourly was used to optimize the main photosynthetic parameters: the maximum rate of carboxylation (V c max ) and the maximum rate of photosynthetic electron transport (J max ) at site scale, and then the two optimized parameters were introduced into BEPSDaily model to estimate regional NPP at regional scale. The results showed that optimization of the main photosynthesis parameters based on the flux data could improve the simulate ability of the model. The primary productivity of different forest types in descending order was deciduous broad-leaved forest, mixed forest, coniferous forest in 2011. The collaborative application of carbon cycle models at different steps proposed in this study could effectively optimize the main photosynthesis parameters V c max and J max , simulate the monthly averaged diurnal GPP, NPP, calculate the regional NPP, and analyze the spatial distribution of regional carbon sources and sinks.

Balancing healthy meals and busy lives: associations between work, school, and family responsibilities and perceived time constraints among young adults.

Science.gov (United States)

Pelletier, Jennifer E; Laska, Melissa N

2012-01-01

To characterize associations between perceived time constraints for healthy eating and work, school, and family responsibilities among young adults. Cross-sectional survey. A large, Midwestern metropolitan region. A diverse sample of community college (n = 598) and public university (n = 603) students. Time constraints in general, as well as those specific to meal preparation/structure, and perceptions of a healthy life balance. Chi-square tests and multivariate logistic regression (α = .005). Women, 4-year students, and students with lower socioeconomic status perceived more time constraints (P balance (P ≤ .003). Having a heavy course load and working longer hours were important predictors of time constraints among men (P life balance despite multiple time demands. Interventions focused on improved time management strategies and nutrition-related messaging to achieve healthy diets on a low time budget may be more successful if tailored to the factors that contribute to time constraints separately among men and women. Copyright © 2012 Society for Nutrition Education and Behavior. Published by Elsevier Inc. All rights reserved.

Studies on steps affecting tritium residence time in solid blanket

International Nuclear Information System (INIS)

Tanaka, Satoru

1987-01-01

For the self sustaining of CTR fuel cycle, the effective tritium recovery from blankets is essential. This means that not only tritium breeding ratio must be larger than 1.0, but also high recovering speed is required for the short residence time of tritium in blankets. Short residence time means that the tritium inventory in blankets is small. In this paper, the tritium residence time and tritium inventory in a solid blanket are modeled by considering the steps constituting tritium release. Some of these tritium migration processes were experimentally evaluated. The tritium migration steps in a solid blanket using sintered breeding materials consist of diffusion in grains, desorption at grain edges, diffusion and permeation through grain boundaries, desorption at particle edges, diffusion and percolation through interconnected pores to purging stream, and convective mass transfer to stream. Corresponding to these steps, diffusive, soluble, adsorbed and trapped tritium inventories and the tritium in gas phase are conceivable. The code named TTT was made for calculating these tritium inventories and the residence time of tritium. An example of the results of calculation is shown. The blanket is REPUTER-1, which is the conceptual design of a commercial reversed field pinch fusion reactor studied at the University of Tokyo. The experimental studies on the migration steps of tritium are reported. (Kako, I.)

Timing of Family Income, Borrowing Constraints and Child Achievement

DEFF Research Database (Denmark)

Humlum, Maria Knoth

In this paper, I investigate the effects of the timing of family income on child achievement production. Detailed administrative data augmented with PISA test scores at age 15 are used to analyze the effects of the timing of family income on child achievement. Contrary to many earlier studies, te...... with generous child and education subsidies. Actually, later family income (age 12-15) is a more important determinant of child achievement than earlier income.......In this paper, I investigate the effects of the timing of family income on child achievement production. Detailed administrative data augmented with PISA test scores at age 15 are used to analyze the effects of the timing of family income on child achievement. Contrary to many earlier studies......, tests for early borrowing constraints suggest that parents are not constrained in early investments in their children's achievement, and thus that the timing of income does not matter for long-term child outcomes. This is a reasonable result given the setting in a Scandinavian welfare state...

Optimal order and time-step criterion for Aarseth-type N-body integrators

International Nuclear Information System (INIS)

Makino, Junichiro

1991-01-01

How the selection of the time-step criterion and the order of the integrator change the efficiency of Aarseth-type N-body integrators is discussed. An alternative to Aarseth's scheme based on the direct calculation of the time derivative of the force using the Hermite interpolation is compared to Aarseth's scheme, which uses the Newton interpolation to construct the predictor and corrector. How the number of particles in the system changes the behavior of integrators is examined. The Hermite scheme allows a time step twice as large as that for the standard Aarseth scheme for the same accuracy. The calculation cost of the Hermite scheme per time step is roughly twice as much as that of the standard Aarseth scheme. The optimal order of the integrators depends on both the particle number and the accuracy required. The time-step criterion of the standard Aarseth scheme is found to be inapplicable to higher-order integrators, and a more uniformly reliable criterion is proposed. 18 refs

Does a time constraint modify results from rating-based conjoint analysis? Case study with orange/pomegranate juice bottles.

Science.gov (United States)

Reis, Felipe; Machín, Leandro; Rosenthal, Amauri; Deliza, Rosires; Ares, Gastón

2016-12-01

People do not usually process all the available information on packages for making their food choices and rely on heuristics for making their decisions, particularly when having limited time. However, in most consumer studies encourage participants to invest a lot of time for making their choices. Therefore, imposing a time-constraint in consumer studies may increase their ecological validity. In this context, the aim of the present work was to evaluate the influence of a time-constraint on consumer evaluation of pomegranate/orange juice bottles using rating-based conjoint task. A consumer study with 100 participants was carried out, in which they had to evaluate 16 pomegranate/orange fruit juice bottles, differing in bottle design, front-of-pack nutritional information, nutrition claim and processing claim, and to rate their intention to purchase. Half of the participants evaluated the bottle images without time constraint and the other half had a time-constraint of 3s for evaluating each image. Eye-movements were recorded during the evaluation. Results showed that time-constraint when evaluating intention to purchase did not largely modify the way in which consumers visually processed bottle images. Regardless of the experimental condition (with or without time constraint), they tended to evaluate the same product characteristics and to give them the same relative importance. However, a trend towards a more superficial evaluation of the bottles that skipped complex information was observed. Regarding the influence of product characteristics on consumer intention to purchase, bottle design was the variable with the largest relative importance in both conditions, overriding the influence of nutritional or processing characteristics, which stresses the importance of graphic design in shaping consumer perception. Copyright © 2016 Elsevier Ltd. All rights reserved.

Formulation of an explicit-multiple-time-step time integration method for use in a global primitive equation grid model

Science.gov (United States)

Chao, W. C.

1982-01-01

With appropriate modifications, a recently proposed explicit-multiple-time-step scheme (EMTSS) is incorporated into the UCLA model. In this scheme, the linearized terms in the governing equations that generate the gravity waves are split into different vertical modes. Each mode is integrated with an optimal time step, and at periodic intervals these modes are recombined. The other terms are integrated with a time step dictated by the CFL condition for low-frequency waves. This large time step requires a special modification of the advective terms in the polar region to maintain stability. Test runs for 72 h show that EMTSS is a stable, efficient and accurate scheme.

Time dependent theory of two-step absorption of two pulses

Energy Technology Data Exchange (ETDEWEB)

Rebane, Inna, E-mail: inna.rebane@ut.ee

2015-09-25

The time dependent theory of two step-absorption of two different light pulses with arbitrary duration in the electronic three-level model is proposed. The probability that the third level is excited at the moment t is found in depending on the time delay between pulses, the spectral widths of the pulses and the energy relaxation constants of the excited electronic levels. The time dependent perturbation theory is applied without using “doorway–window” approach. The time and spectral behavior of the spectrum using in calculations as simple as possible model is analyzed. - Highlights: • Time dependent theory of two-step absorption in the three-level model is proposed. • Two different light pulses with arbitrary duration is observed. • The time dependent perturbation theory is applied without “door–window” approach. • The time and spectral behavior of the spectra is analyzed for several cases.

Multiple time step integrators in ab initio molecular dynamics

International Nuclear Information System (INIS)

Luehr, Nathan; Martínez, Todd J.; Markland, Thomas E.

2014-01-01

Multiple time-scale algorithms exploit the natural separation of time-scales in chemical systems to greatly accelerate the efficiency of molecular dynamics simulations. Although the utility of these methods in systems where the interactions are described by empirical potentials is now well established, their application to ab initio molecular dynamics calculations has been limited by difficulties associated with splitting the ab initio potential into fast and slowly varying components. Here we present two schemes that enable efficient time-scale separation in ab initio calculations: one based on fragment decomposition and the other on range separation of the Coulomb operator in the electronic Hamiltonian. We demonstrate for both water clusters and a solvated hydroxide ion that multiple time-scale molecular dynamics allows for outer time steps of 2.5 fs, which are as large as those obtained when such schemes are applied to empirical potentials, while still allowing for bonds to be broken and reformed throughout the dynamics. This permits computational speedups of up to 4.4x, compared to standard Born-Oppenheimer ab initio molecular dynamics with a 0.5 fs time step, while maintaining the same energy conservation and accuracy

Stability analysis and time-step limits for a Monte Carlo Compton-scattering method

International Nuclear Information System (INIS)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.

2010-01-01

A Monte Carlo method for simulating Compton scattering in high energy density applications has been presented that models the photon-electron collision kinematics exactly [E. Canfield, W.M. Howard, E.P. Liang, Inverse Comptonization by one-dimensional relativistic electrons, Astrophys. J. 323 (1987) 565]. However, implementing this technique typically requires an explicit evaluation of the material temperature, which can lead to unstable and oscillatory solutions. In this paper, we perform a stability analysis of this Monte Carlo method and develop two time-step limits that avoid undesirable behavior. The first time-step limit prevents instabilities, while the second, more restrictive time-step limit avoids both instabilities and nonphysical oscillations. With a set of numerical examples, we demonstrate the efficacy of these time-step limits.

Financial Constraints: Explaining Your Position.

Science.gov (United States)

Cargill, Jennifer

1988-01-01

Discusses the importance of educating library patrons about the library's finances and the impact of budget constraints and the escalating cost of serials on materials acquisition. Steps that can be taken in educating patrons by interpreting and publicizing financial information are suggested. (MES)

Location-Dependent Query Processing Under Soft Real-Time Constraints

Directory of Open Access Journals (Sweden)

Zoubir Mammeri

2009-01-01

Full Text Available In recent years, mobile devices and applications achieved an increasing development. In database field, this development required methods to consider new query types like location-dependent queries (i.e. the query results depend on the query issuer location. Although several researches addressed problems related to location-dependent query processing, a few works considered timing requirements that may be associated with queries (i.e., the query results must be delivered to mobile clients on time. The main objective of this paper is to propose a solution for location-dependent query processing under soft real-time constraints. Hence, we propose methods to take into account client location-dependency and to maximize the percentage of queries respecting their deadlines. We validate our proposal by implementing a prototype based on Oracle DBMS. Performance evaluation results show that the proposed solution optimizes the percentage of queries meeting their deadlines and the communication cost.

Engineering design constraints of the lunar surface environment

Science.gov (United States)

Morrison, D. A.

1992-01-01

Living and working on the lunar surface will be difficult. Design of habitats, machines, tools, and operational scenarios in order to allow maximum flexibility in human activity will require paying attention to certain constraints imposed by conditions at the surface and the characteristics of lunar material. Primary design drivers for habitat, crew health and safety, and crew equipment are: ionizing radiation, the meteoroid flux, and the thermal environment. Secondary constraints for engineering derive from: the physical and chemical properties of lunar surface materials, rock distributions and regolith thicknesses, topography, electromagnetic properties, and seismicity. Protection from ionizing radiation is essential for crew health and safety. The total dose acquired by a crew member will be the sum of the dose acquired during EVA time (when shielding will be least) plus the dose acquired during time spent in the habitat (when shielding will be maximum). Minimizing the dose acquired in the habitat extends the time allowable for EVA's before a dose limit is reached. Habitat shielding is enabling, and higher precision in predicting secondary fluxes produced in shielding material would be desirable. Means for minimizing dose during a solar flare event while on extended EVA will be essential. Early warning of the onset of flare activity (at least a half-hour is feasible) will dictate the time available to take mitigating steps. Warning capability affects design of rovers (or rover tools) and site layout. Uncertainty in solar flare timing is a design constraint that points to the need for quickly accessible or constructible safe havens.

Quantum states and the Hadamard form. III. Constraints in cosmological space-times

International Nuclear Information System (INIS)

Najmi, A.; Ottewill, A.C.

1985-01-01

We examine the constraints on the construction of Fock spaces for scalar fields in spatially flat Robertson-Walker space-times imposed by requiring that the vacuum state of the theory have a two-point function possessing the Hadamard singularity structure required by standard renormalization theory. It is shown that any such vacuum state must be a second-order adiabatic vacuum. We discuss the global requirements on the two-point function for it to possess the Hadamard form at all times if it possesses it at one time

Reasoning about real-time systems with temporal interval logic constraints on multi-state automata

Science.gov (United States)

Gabrielian, Armen

1991-01-01

Models of real-time systems using a single paradigm often turn out to be inadequate, whether the paradigm is based on states, rules, event sequences, or logic. A model-based approach to reasoning about real-time systems is presented in which a temporal interval logic called TIL is employed to define constraints on a new type of high level automata. The combination, called hierarchical multi-state (HMS) machines, can be used to model formally a real-time system, a dynamic set of requirements, the environment, heuristic knowledge about planning-related problem solving, and the computational states of the reasoning mechanism. In this framework, mathematical techniques were developed for: (1) proving the correctness of a representation; (2) planning of concurrent tasks to achieve goals; and (3) scheduling of plans to satisfy complex temporal constraints. HMS machines allow reasoning about a real-time system from a model of how truth arises instead of merely depending of what is true in a system.

Overcoming Learning Time And Space Constraints Through Technological Tool

Directory of Open Access Journals (Sweden)

Nafiseh Zarei

2015-08-01

Full Text Available Today the use of technological tools has become an evolution in language learning and language acquisition. Many instructors and lecturers believe that integrating Web-based learning tools into language courses allows pupils to become active learners during learning process. This study investigate how the Learning Management Blog (LMB overcomes the learning time and space constraints that contribute to students’ language learning and language acquisition processes. The participants were 30 ESL students at National University of Malaysia. A qualitative approach comprising an open-ended questionnaire and a semi-structured interview was used to collect data. The results of the study revealed that the students’ language learning and acquisition processes were enhanced. The students did not face any learning time and space limitations while being engaged in the learning process via the LMB. They learned and acquired knowledge using the language learning materials and forum at anytime and anywhere. Keywords: learning time, learning space, learning management blog

State control of discrete-time linear systems to be bound in state variables by equality constraints

International Nuclear Information System (INIS)

Filasová, Anna; Krokavec, Dušan; Serbák, Vladimír

2014-01-01

The paper is concerned with the problem of designing the discrete-time equivalent PI controller to control the discrete-time linear systems in such a way that the closed-loop state variables satisfy the prescribed equality constraints. Since the problem is generally singular, using standard form of the Lyapunov function and a symmetric positive definite slack matrix, the design conditions are proposed in the form of the enhanced Lyapunov inequality. The results, offering the conditions of the control existence and the optimal performance with respect to the prescribed equality constraints for square discrete-time linear systems, are illustrated with the numerical example to note effectiveness and applicability of the considered approach

Grief: Difficult Times, Simple Steps.

Science.gov (United States)

Waszak, Emily Lane

This guide presents techniques to assist others in coping with the loss of a loved one. Using the language of 9 layperson, the book contains more than 100 tips for caregivers or loved ones. A simple step is presented on each page, followed by reasons and instructions for each step. Chapters include: "What to Say"; "Helpful Things to Do"; "Dealing…

Appointment Template Redesign in a Women's Health Clinic Using Clinical Constraints to Improve Service Quality and Efficiency.

Science.gov (United States)

Huang, Y; Verduzco, S

2015-01-01

Patient wait time is a critical element of access to care that has long been recognized as a major problem in modern outpatient health care delivery systems. It impacts patient and medical staff productivity, stress, quality and efficiency of medical care, as well as health-care cost and availability. This study was conducted in a Women's Health Clinic. The objective was to improve clinic service quality by redesigning patient appointment template using the clinical constraints. The proposed scheduling template consisted of two key elements: the redesign of appointment types and the determination of the length of time slots using defined constraints. The re-classification technique was used for the redesign of appointment visit types to capture service variation for scheduling purposes. Then, the appointment length was determined by incorporating clinic constraints or goals, such as patient wait time, physician idle time, overtime, finish time, lunch hours, when the last appointment was scheduled, and the desired number of appointment slots, to converge the optimal length of appointment slots for each visit type. The redesigned template was implemented and the results indicated a 73% reduction in average patient waiting from the reported 40 to 11 minutes. The patient no-show rate was reduced by 4% from 24% to 20%. The morning section on average finished about 11:50 am. The clinic day was finished around 4:45 pm. Provider average idle time was estimated to be about 5 minutes, which can be used for charting/documenting patients. This study provided an alternative method of redesigning appointment scheduling templates using only the clinical constraints rather than the traditional way that required an objective function. This paper also documented the employed methods step by step in a real clinic setting. The implementation results concluded a significant improvement on patient wait time and no-show rate.

Adaptive time-stepping Monte Carlo integration of Coulomb collisions

Science.gov (United States)

Särkimäki, K.; Hirvijoki, E.; Terävä, J.

2018-01-01

We report an accessible and robust tool for evaluating the effects of Coulomb collisions on a test particle in a plasma that obeys Maxwell-Jüttner statistics. The implementation is based on the Beliaev-Budker collision integral which allows both the test particle and the background plasma to be relativistic. The integration method supports adaptive time stepping, which is shown to greatly improve the computational efficiency. The Monte Carlo method is implemented for both the three-dimensional particle momentum space and the five-dimensional guiding center phase space. Detailed description is provided for both the physics and implementation of the operator. The focus is in adaptive integration of stochastic differential equations, which is an overlooked aspect among existing Monte Carlo implementations of Coulomb collision operators. We verify that our operator converges to known analytical results and demonstrate that careless implementation of the adaptive time step can lead to severely erroneous results. The operator is provided as a self-contained Fortran 95 module and can be included into existing orbit-following tools that trace either the full Larmor motion or the guiding center dynamics. The adaptive time-stepping algorithm is expected to be useful in situations where the collision frequencies vary greatly over the course of a simulation. Examples include the slowing-down of fusion products or other fast ions, and the Dreicer generation of runaway electrons as well as the generation of fast ions or electrons with ion or electron cyclotron resonance heating.

A parallel nearly implicit time-stepping scheme

OpenAIRE

Botchev, Mike A.; van der Vorst, Henk A.

2001-01-01

Across-the-space parallelism still remains the most mature, convenient and natural way to parallelize large scale problems. One of the major problems here is that implicit time stepping is often difficult to parallelize due to the structure of the system. Approximate implicit schemes have been suggested to circumvent the problem. These schemes have attractive stability properties and they are also very well parallelizable. The purpose of this article is to give an overall assessment of the pa...

Solving point reactor kinetic equations by time step-size adaptable numerical methods

International Nuclear Information System (INIS)

Liao Chaqing

2007-01-01

Based on the analysis of effects of time step-size on numerical solutions, this paper showed the necessity of step-size adaptation. Based on the relationship between error and step-size, two-step adaptation methods for solving initial value problems (IVPs) were introduced. They are Two-Step Method and Embedded Runge-Kutta Method. PRKEs were solved by implicit Euler method with step-sizes optimized by using Two-Step Method. It was observed that the control error has important influence on the step-size and the accuracy of solutions. With suitable control errors, the solutions of PRKEs computed by the above mentioned method are accurate reasonably. The accuracy and usage of MATLAB built-in ODE solvers ode23 and ode45, both of which adopt Runge-Kutta-Fehlberg method, were also studied and discussed. (authors)

Elastic Spatial Query Processing in OpenStack Cloud Computing Environment for Time-Constraint Data Analysis

Directory of Open Access Journals (Sweden)

Wei Huang

2017-03-01

Full Text Available Geospatial big data analysis (GBDA is extremely significant for time-constraint applications such as disaster response. However, the time-constraint analysis is not yet a trivial task in the cloud computing environment. Spatial query processing (SQP is typical computation-intensive and indispensable for GBDA, and the spatial range query, join query, and the nearest neighbor query algorithms are not scalable without using MapReduce-liked frameworks. Parallel SQP algorithms (PSQPAs are trapped in screw-processing, which is a known issue in Geoscience. To satisfy time-constrained GBDA, we propose an elastic SQP approach in this paper. First, Spark is used to implement PSQPAs. Second, Kubernetes-managed Core Operation System (CoreOS clusters provide self-healing Docker containers for running Spark clusters in the cloud. Spark-based PSQPAs are submitted to Docker containers, where Spark master instances reside. Finally, the horizontal pod auto-scaler (HPA would scale-out and scale-in Docker containers for supporting on-demand computing resources. Combined with an auto-scaling group of virtual instances, HPA helps to find each of the five nearest neighbors for 46,139,532 query objects from 834,158 spatial data objects in less than 300 s. The experiments conducted on an OpenStack cloud demonstrate that auto-scaling containers can satisfy time-constraint GBDA in clouds.

Reducing WCET Overestimations by Correcting Errors in Loop Bound Constraints

Directory of Open Access Journals (Sweden)

Fanqi Meng

2017-12-01

Full Text Available In order to reduce overestimations of worst-case execution time (WCET, in this article, we firstly report a kind of specific WCET overestimation caused by non-orthogonal nested loops. Then, we propose a novel correction approach which has three basic steps. The first step is to locate the worst-case execution path (WCEP in the control flow graph and then map it onto source code. The second step is to identify non-orthogonal nested loops from the WCEP by means of an abstract syntax tree. The last step is to recursively calculate the WCET errors caused by the loose loop bound constraints, and then subtract the total errors from the overestimations. The novelty lies in the fact that the WCET correction is only conducted on the non-branching part of WCEP, thus avoiding potential safety risks caused by possible WCEP switches. Experimental results show that our approach reduces the specific WCET overestimation by an average of more than 82%, and 100% of corrected WCET is no less than the actual WCET. Thus, our approach is not only effective but also safe. It will help developers to design energy-efficient and safe real-time systems.

Fast and Easy 3D Reconstruction with the Help of Geometric Constraints and Genetic Algorithms

Science.gov (United States)

Annich, Afafe; El Abderrahmani, Abdellatif; Satori, Khalid

2017-09-01

The purpose of the work presented in this paper is to describe new method of 3D reconstruction from one or more uncalibrated images. This method is based on two important concepts: geometric constraints and genetic algorithms (GAs). At first, we are going to discuss the combination between bundle adjustment and GAs that we have proposed in order to improve 3D reconstruction efficiency and success. We used GAs in order to improve fitness quality of initial values that are used in the optimization problem. It will increase surely convergence rate. Extracted geometric constraints are used first to obtain an estimated value of focal length that helps us in the initialization step. Matching homologous points and constraints is used to estimate the 3D model. In fact, our new method gives us a lot of advantages: reducing the estimated parameter number in optimization step, decreasing used image number, winning time and stabilizing good quality of 3D results. At the end, without any prior information about our 3D scene, we obtain an accurate calibration of the cameras, and a realistic 3D model that strictly respects the geometric constraints defined before in an easy way. Various data and examples will be used to highlight the efficiency and competitiveness of our present approach.

Walking to the Beat of Their Own Drum: How Children and Adults Meet Timing Constraints

Science.gov (United States)

Gill, Simone V.

2015-01-01

Walking requires adapting to meet task constraints. Between 5- and 7-years old, children’s walking approximates adult walking without constraints. To examine how children and adults adapt to meet timing constraints, 57 5- to 7-year olds and 20 adults walked to slow and fast audio metronome paces. Both children and adults modified their walking. However, at the slow pace, children had more trouble matching the metronome compared to adults. The youngest children’s walking patterns deviated most from the slow metronome pace, and practice improved their performance. Five-year olds were the only group that did not display carryover effects to the metronome paces. Findings are discussed in relation to what contributes to the development of adaptation in children. PMID:26011538

Walking to the beat of their own drum: how children and adults meet timing constraints.

Directory of Open Access Journals (Sweden)

Simone V Gill

Full Text Available Walking requires adapting to meet task constraints. Between 5- and 7-years old, children's walking approximates adult walking without constraints. To examine how children and adults adapt to meet timing constraints, 57 5- to 7-year olds and 20 adults walked to slow and fast audio metronome paces. Both children and adults modified their walking. However, at the slow pace, children had more trouble matching the metronome compared to adults. The youngest children's walking patterns deviated most from the slow metronome pace, and practice improved their performance. Five-year olds were the only group that did not display carryover effects to the metronome paces. Findings are discussed in relation to what contributes to the development of adaptation in children.

Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints

DEFF Research Database (Denmark)

Izosimov, Viacheslav; Pop, Paul; Eles, Petru

2008-01-01

In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarantee the deadlines for the hard processes even in the case of faults, while maximizing the overall utility. We use time....../utility functions to capture the utility of soft processes. Process re-execution is employed to recover from multiple faults. A single static schedule computed off-line is not fault tolerant and is pessimistic in terms of utility, while a purely online approach, which computes a new schedule every time a process...

Step-by-Step Model for the Study of the Apriori Algorithm for Predictive Analysis

Directory of Open Access Journals (Sweden)

Daniel Grigore ROŞCA

2015-06-01

Full Text Available The goal of this paper was to develop an educational oriented application based on the Data Mining Apriori Algorithm which facilitates both the research and the study of data mining by graduate students. The application could be used to discover interesting patterns in the corpus of data and to measure the impact on the speed of execution as a function of problem constraints (value of support and confidence variables or size of the transactional data-base. The paper presents a brief overview of the Apriori Algorithm, aspects about the implementation of the algorithm using a step-by-step process, a discussion of the education-oriented user interface and the process of data mining of a test transactional data base. The impact of some constraints on the speed of the algorithm is also experimentally measured without a systematic review of different approaches to increase execution speed. Possible applications of the implementation, as well as its limits, are briefly reviewed.

Rotor Cascade Shape Optimization with Unsteady Passing Wakes Using Implicit Dual-Time Stepping and a Genetic Algorithm

Directory of Open Access Journals (Sweden)

Eun Seok Lee

2003-01-01

Full Text Available An axial turbine rotor cascade-shape optimization with unsteady passing wakes was performed to obtain an improved aerodynamic performance using an unsteady flow, Reynolds-averaged Navier-Stokes equations solver that was based on explicit, finite difference; Runge-Kutta multistage time marching; and the diagonalized alternating direction implicit scheme. The code utilized Baldwin-Lomax algebraic and k-ε turbulence modeling. The full approximation storage multigrid method and preconditioning were implemented as iterative convergence-acceleration techniques. An implicit dual-time stepping method was incorporated in order to simulate the unsteady flow fields. The objective function was defined as minimization of total pressure loss and maximization of lift, while the mass flow rate was fixed during the optimization. The design variables were several geometric parameters characterizing airfoil leading edge, camber, stagger angle, and inter-row spacing. The genetic algorithm was used as an optimizer, and the penalty method was introduced for combining the constraints with the objective function. Each individual's objective function was computed simultaneously by using a 32-processor distributedmemory computer. The optimization results indicated that only minor improvements are possible in unsteady rotor/stator aerodynamics by varying these geometric parameters.

Considerations for the independent reaction times and step-by-step methods for radiation chemistry simulations

Science.gov (United States)

Plante, Ianik; Devroye, Luc

2017-10-01

Ionizing radiation interacts with the water molecules of the tissues mostly by ionizations and excitations, which result in the formation of the radiation track structure and the creation of radiolytic species such as H.,.OH, H2, H2O2, and e-aq. After their creation, these species diffuse and may chemically react with the neighboring species and with the molecules of the medium. Therefore radiation chemistry is of great importance in radiation biology. As the chemical species are not distributed homogeneously, the use of conventional models of homogeneous reactions cannot completely describe the reaction kinetics of the particles. Actually, many simulations of radiation chemistry are done using the Independent Reaction Time (IRT) method, which is a very fast technique to calculate radiochemical yields but which do not calculate the positions of the radiolytic species as a function of time. Step-by-step (SBS) methods, which are able to provide such information, have been used only sparsely because these are time-consuming in terms of calculation. Recent improvements in computer performance now allow the regular use of the SBS method in radiation chemistry. The SBS and IRT methods are both based on the Green's functions of the diffusion equation (GFDE). In this paper, several sampling algorithms of the GFDE and for the IRT method are presented. We show that the IRT and SBS methods are exactly equivalent for 2-particles systems for diffusion and partially diffusion-controlled reactions between non-interacting particles. We also show that the results obtained with the SBS simulation method with periodic boundary conditions are in agreement with the predictions by classical reaction kinetics theory, which is an important step towards using this method for modelling of biochemical networks and metabolic pathways involved in oxidative stress. Finally, the first simulation results obtained with the code RITRACKS (Relativistic Ion Tracks) are presented.

Terrestrial carbon turnover time constraints on future carbon cycle-climate feedback

Science.gov (United States)

Fan, N.; Carvalhais, N.; Reichstein, M.

2017-12-01

Understanding the terrestrial carbon cycle-climate feedback is essential to reduce the uncertainties resulting from the between model spread in prognostic simulations (Friedlingstein et al., 2006). One perspective is to investigate which factors control the variability of the mean residence times of carbon in the land surface, and how these may change in the future, consequently affecting the response of the terrestrial ecosystems to changes in climate as well as other environmental conditions. Carbon turnover time of the whole ecosystem is a dynamic parameter that represents how fast the carbon cycle circulates. Turnover time τ is an essential property for understanding the carbon exchange between the land and the atmosphere. Although current Earth System Models (ESMs), supported by GVMs for the description of the land surface, show a strong convergence in GPP estimates, but tend to show a wide range of simulated turnover times (Carvalhais, 2014). Thus, there is an emergent need of constraints on the projected response of the balance between terrestrial carbon fluxes and carbon stock which will give us more certainty in response of carbon cycle to climate change. However, the difficulty of obtaining such a constraint is partly due to lack of observational data on temporal change of terrestrial carbon stock. Since more new datasets of carbon stocks such as SoilGrid (Hengl, et al., 2017) and fluxes such as GPP (Jung, et al., 2017) are available, improvement in estimating turnover time can be achieved. In addition, previous study ignored certain aspects such as the relationship between τ and nutrients, fires, etc. We would like to investigate τ and its role in carbon cycle by combining observatinoal derived datasets and state-of-the-art model simulations.

On an efficient multiple time step Monte Carlo simulation of the SABR model

NARCIS (Netherlands)

Leitao Rodriguez, A.; Grzelak, L.A.; Oosterlee, C.W.

2017-01-01

In this paper, we will present a multiple time step Monte Carlo simulation technique for pricing options under the Stochastic Alpha Beta Rho model. The proposed method is an extension of the one time step Monte Carlo method that we proposed in an accompanying paper Leitao et al. [Appl. Math.

The hyperbolic step potential: Anti-bound states, SUSY partners and Wigner time delays

Energy Technology Data Exchange (ETDEWEB)

Gadella, M. [Departamento de Física Teórica, Atómica y Óptica and IMUVA, Universidad de Valladolid, E-47011 Valladolid (Spain); Kuru, Ş. [Department of Physics, Faculty of Science, Ankara University, 06100 Ankara (Turkey); Negro, J., E-mail: jnegro@fta.uva.es [Departamento de Física Teórica, Atómica y Óptica and IMUVA, Universidad de Valladolid, E-47011 Valladolid (Spain)

2017-04-15

We study the scattering produced by a one dimensional hyperbolic step potential, which is exactly solvable and shows an unusual interest because of its asymmetric character. The analytic continuation of the scattering matrix in the momentum representation has a branch cut and an infinite number of simple poles on the negative imaginary axis which are related with the so called anti-bound states. This model does not show resonances. Using the wave functions of the anti-bound states, we obtain supersymmetric (SUSY) partners which are the series of Rosen–Morse II potentials. We have computed the Wigner reflection and transmission time delays for the hyperbolic step and such SUSY partners. Our results show that the more bound states a partner Hamiltonian has the smaller is the time delay. We also have evaluated time delays for the hyperbolic step potential in the classical case and have obtained striking similitudes with the quantum case. - Highlights: • The scattering matrix of hyperbolic step potential is studied. • The scattering matrix has a branch cut and an infinite number of poles. • The poles are associated to anti-bound states. • Susy partners using antibound states are computed. • Wigner time delays for the hyperbolic step and partner potentials are compared.

Timing Constraints Based High Performance Des Design And Implementation On 28nm FPGA

DEFF Research Database (Denmark)

Thind, Vandana; Pandey, Sujeet; Hussain, Dil muhammed Akbar

2018-01-01

in this work, we are going to implement DES Algorithm on 28nm Artix-7 FPGA. To achieve high performance design goal, we are using minimum period, maximum frequency, minimum low pulse, minimum high pulse for different cases of worst case slack, maximum delay, setup time, hold time and data skew path....... The cases on which analysis is done are like worst case slack, best case achievable, timing error and timing score, which help in differentiating the amount of timing constraint at two different frequencies. We analyzed that in timing analysis there is maximum of 19.56% of variation in worst case slack, 0...

Errors in Postural Preparation Lead to Increased Choice Reaction Times for Step Initiation in Older Adults

Science.gov (United States)

Nutt, John G.; Horak, Fay B.

2011-01-01

Background. This study asked whether older adults were more likely than younger adults to err in the initial direction of their anticipatory postural adjustment (APA) prior to a step (indicating a motor program error), whether initial motor program errors accounted for reaction time differences for step initiation, and whether initial motor program errors were linked to inhibitory failure. Methods. In a stepping task with choice reaction time and simple reaction time conditions, we measured forces under the feet to quantify APA onset and step latency and we used body kinematics to quantify forward movement of center of mass and length of first step. Results. Trials with APA errors were almost three times as common for older adults as for younger adults, and they were nine times more likely in choice reaction time trials than in simple reaction time trials. In trials with APA errors, step latency was delayed, correlation between APA onset and step latency was diminished, and forward motion of the center of mass prior to the step was increased. Participants with more APA errors tended to have worse Stroop interference scores, regardless of age. Conclusions. The results support the hypothesis that findings of slow choice reaction time step initiation in older adults are attributable to inclusion of trials with incorrect initial motor preparation and that these errors are caused by deficits in response inhibition. By extension, the results also suggest that mixing of trials with correct and incorrect initial motor preparation might explain apparent choice reaction time slowing with age in upper limb tasks. PMID:21498431

A muscle-driven approach to restore stepping with an exoskeleton for individuals with paraplegia.

Science.gov (United States)

Chang, Sarah R; Nandor, Mark J; Li, Lu; Kobetic, Rudi; Foglyano, Kevin M; Schnellenberger, John R; Audu, Musa L; Pinault, Gilles; Quinn, Roger D; Triolo, Ronald J

2017-05-30

Functional neuromuscular stimulation, lower limb orthosis, powered lower limb exoskeleton, and hybrid neuroprosthesis (HNP) technologies can restore stepping in individuals with paraplegia due to spinal cord injury (SCI). However, a self-contained muscle-driven controllable exoskeleton approach based on an implanted neural stimulator to restore walking has not been previously demonstrated, which could potentially result in system use outside the laboratory and viable for long term use or clinical testing. In this work, we designed and evaluated an untethered muscle-driven controllable exoskeleton to restore stepping in three individuals with paralysis from SCI. The self-contained HNP combined neural stimulation to activate the paralyzed muscles and generate joint torques for limb movements with a controllable lower limb exoskeleton to stabilize and support the user. An onboard controller processed exoskeleton sensor signals, determined appropriate exoskeletal constraints and stimulation commands for a finite state machine (FSM), and transmitted data over Bluetooth to an off-board computer for real-time monitoring and data recording. The FSM coordinated stimulation and exoskeletal constraints to enable functions, selected with a wireless finger switch user interface, for standing up, standing, stepping, or sitting down. In the stepping function, the FSM used a sensor-based gait event detector to determine transitions between gait phases of double stance, early swing, late swing, and weight acceptance. The HNP restored stepping in three individuals with motor complete paralysis due to SCI. The controller appropriately coordinated stimulation and exoskeletal constraints using the sensor-based FSM for subjects with different stimulation systems. The average range of motion at hip and knee joints during walking were 8.5°-20.8° and 14.0°-43.6°, respectively. Walking speeds varied from 0.03 to 0.06 m/s, and cadences from 10 to 20 steps/min. A self-contained muscle

Vibration-Driven Microrobot Positioning Methodologies for Nonholonomic Constraint Compensation

Directory of Open Access Journals (Sweden)

Kostas Vlachos

2015-03-01

Full Text Available This paper presents the formulation and practical implementation of positioning methodologies that compensate for the nonholonomic constraints of a mobile microrobot that is driven by two vibrating direct current (DC micromotors. The open-loop and closed-loop approaches described here add the capability for net sidewise displacements of the microrobotic platform. A displacement is achieved by the execution of a number of repeating steps that depend on the desired displacement, the speed of the micromotors, and the elapsed time. Simulation and experimental results verified the performance of the proposed methodologies.

Selecting local constraint for alignment of batch process data with dynamic time warping

DEFF Research Database (Denmark)

Spooner, Max Peter; Kold, David; Kulahci, Murat

2017-01-01

” may be interpreted as a progress signature of the batch which may be appended to the aligned data for further analysis. For the warping function to be a realistic reflection of the progress of a batch, it is necessary to impose some constraints on the dynamic time warping algorithm, to avoid...

Trajectory reshaping based guidance with impact time and angle constraints

Directory of Open Access Journals (Sweden)

Zhao Yao

2016-08-01

Full Text Available This study presents a novel impact time and angle constrained guidance law for homing missiles. The guidance law is first developed with the prior-assumption of a stationary target, which is followed by the practical extension to a maneuvering target scenario. To derive the closed-form guidance law, the trajectory reshaping technique is utilized and it results in defining a specific polynomial function with two unknown coefficients. These coefficients are determined to satisfy the impact time and angle constraints as well as the zero miss distance. Furthermore, the proposed guidance law has three additional guidance gains as design parameters which make it possible to adjust the guided trajectory according to the operational conditions and missile’s capability. Numerical simulations are presented to validate the effectiveness of the proposed guidance law.

Dissolvable fluidic time delays for programming multi-step assays in instrument-free paper diagnostics.

Science.gov (United States)

Lutz, Barry; Liang, Tinny; Fu, Elain; Ramachandran, Sujatha; Kauffman, Peter; Yager, Paul

2013-07-21

Lateral flow tests (LFTs) are an ingenious format for rapid and easy-to-use diagnostics, but they are fundamentally limited to assay chemistries that can be reduced to a single chemical step. In contrast, most laboratory diagnostic assays rely on multiple timed steps carried out by a human or a machine. Here, we use dissolvable sugar applied to paper to create programmable flow delays and present a paper network topology that uses these time delays to program automated multi-step fluidic protocols. Solutions of sucrose at different concentrations (10-70% of saturation) were added to paper strips and dried to create fluidic time delays spanning minutes to nearly an hour. A simple folding card format employing sugar delays was shown to automate a four-step fluidic process initiated by a single user activation step (folding the card); this device was used to perform a signal-amplified sandwich immunoassay for a diagnostic biomarker for malaria. The cards are capable of automating multi-step assay protocols normally used in laboratories, but in a rapid, low-cost, and easy-to-use format.

Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints

Directory of Open Access Journals (Sweden)

He Cheng

2014-02-01

Full Text Available It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2 time. In this paper we give an O(n2 algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm

Variable Step Integration Coupled with the Method of Characteristics Solution for Water-Hammer Analysis, A Case Study

Science.gov (United States)

Turpin, Jason B.

2004-01-01

One-dimensional water-hammer modeling involves the solution of two coupled non-linear hyperbolic partial differential equations (PDEs). These equations result from applying the principles of conservation of mass and momentum to flow through a pipe, and usually the assumption that the speed at which pressure waves propagate through the pipe is constant. In order to solve these equations for the interested quantities (i.e. pressures and flow rates), they must first be converted to a system of ordinary differential equations (ODEs) by either approximating the spatial derivative terms with numerical techniques or using the Method of Characteristics (MOC). The MOC approach is ideal in that no numerical approximation errors are introduced in converting the original system of PDEs into an equivalent system of ODEs. Unfortunately this resulting system of ODEs is bound by a time step constraint so that when integrating the equations the solution can only be obtained at fixed time intervals. If the fluid system to be modeled also contains dynamic components (i.e. components that are best modeled by a system of ODEs), it may be necessary to take extremely small time steps during certain points of the model simulation in order to achieve stability and/or accuracy in the solution. Coupled together, the fixed time step constraint invoked by the MOC, and the occasional need for extremely small time steps in order to obtain stability and/or accuracy, can greatly increase simulation run times. As one solution to this problem, a method for combining variable step integration (VSI) algorithms with the MOC was developed for modeling water-hammer in systems with highly dynamic components. A case study is presented in which reverse flow through a dual-flapper check valve introduces a water-hammer event. The predicted pressure responses upstream of the check-valve are compared with test data.

Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints

International Nuclear Information System (INIS)

Zhang Yunong; Li Zhan

2009-01-01

In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.

Simplicity constraints: A 3D toy model for loop quantum gravity

Science.gov (United States)

Charles, Christoph

2018-05-01

In loop quantum gravity, tremendous progress has been made using the Ashtekar-Barbero variables. These variables, defined in a gauge fixing of the theory, correspond to a parametrization of the solutions of the so-called simplicity constraints. Their geometrical interpretation is however unsatisfactory as they do not constitute a space-time connection. It would be possible to resolve this point by using a full Lorentz connection or, equivalently, by using the self-dual Ashtekar variables. This leads however to simplicity constraints or reality conditions which are notoriously difficult to implement in the quantum theory. We explore in this paper the possibility of using completely degenerate actions to impose such constraints at the quantum level in the context of canonical quantization. To do so, we define a simpler model, in 3D, with similar constraints by extending the phase space to include an independent vielbein. We define the classical model and show that a precise quantum theory by gauge unfixing can be defined out of it, completely equivalent to the standard 3D Euclidean quantum gravity. We discuss possible future explorations around this model as it could help as a stepping stone to define full-fledged covariant loop quantum gravity.

The large discretization step method for time-dependent partial differential equations

Science.gov (United States)

Haras, Zigo; Taasan, Shlomo

1995-01-01

A new method for the acceleration of linear and nonlinear time dependent calculations is presented. It is based on the Large Discretization Step (LDS) approximation, defined in this work, which employs an extended system of low accuracy schemes to approximate a high accuracy discrete approximation to a time dependent differential operator. Error bounds on such approximations are derived. These approximations are efficiently implemented in the LDS methods for linear and nonlinear hyperbolic equations, presented here. In these algorithms the high and low accuracy schemes are interpreted as the same discretization of a time dependent operator on fine and coarse grids, respectively. Thus, a system of correction terms and corresponding equations are derived and solved on the coarse grid to yield the fine grid accuracy. These terms are initialized by visiting the fine grid once in many coarse grid time steps. The resulting methods are very general, simple to implement and may be used to accelerate many existing time marching schemes.

Modeling coupled bending, axial, and torsional vibrations of a CANDU fuel rod subjected to multiple frictional contact constraints

International Nuclear Information System (INIS)

Fadaee, M.; Yu, S.D.

2013-01-01

In this paper, a finite element based dynamic model is presented for bending, axial, and torsional vibrations of an outer CANDU fuel element subjected to multiple unilateral frictional contact (MUFC) constraints. The Bozzak-Newmark relaxation-integration scheme is used to discretize the equations of motion in the time domain. At a time step, equations of state of the fuel element with MUFC constraints reduce to a linear complementarity problem (LCP). Results are compared with those available in the literature. Good agreement is achieved. The 2D sliding and stiction motion of a fuel element at points of contact is obtained for harmonic excitations. (author)

Multi-Step Time Series Forecasting with an Ensemble of Varied Length Mixture Models.

Science.gov (United States)

Ouyang, Yicun; Yin, Hujun

2018-05-01

Many real-world problems require modeling and forecasting of time series, such as weather temperature, electricity demand, stock prices and foreign exchange (FX) rates. Often, the tasks involve predicting over a long-term period, e.g. several weeks or months. Most existing time series models are inheritably for one-step prediction, that is, predicting one time point ahead. Multi-step or long-term prediction is difficult and challenging due to the lack of information and uncertainty or error accumulation. The main existing approaches, iterative and independent, either use one-step model recursively or treat the multi-step task as an independent model. They generally perform poorly in practical applications. In this paper, as an extension of the self-organizing mixture autoregressive (AR) model, the varied length mixture (VLM) models are proposed to model and forecast time series over multi-steps. The key idea is to preserve the dependencies between the time points within the prediction horizon. Training data are segmented to various lengths corresponding to various forecasting horizons, and the VLM models are trained in a self-organizing fashion on these segments to capture these dependencies in its component AR models of various predicting horizons. The VLM models form a probabilistic mixture of these varied length models. A combination of short and long VLM models and an ensemble of them are proposed to further enhance the prediction performance. The effectiveness of the proposed methods and their marked improvements over the existing methods are demonstrated through a number of experiments on synthetic data, real-world FX rates and weather temperatures.

Possibilities of implementation of synchronous Ethernet in popular Ethernet version using timing and interference constraints

Directory of Open Access Journals (Sweden)

Seetaiah KILARU

2015-12-01

Full Text Available Popular network architectures are following packet based architectures instead of conventional Time division multiplexing. The existed Ethernet is basically asynchronous in nature and was not designed based on timing transfer constraints. To achieve the challenge of next generation network with respect to efficient bandwidth and faster data rates, we have to deploy the network which has less latency. This can be achieved by Synchronous Ethernet (SyncE. In Sync-E, Phase Locked Loop (PLL was used to recover the incoming jitter from clock recovery circuit. Then feed the PLL block to transmission device. We have to design the network in an unaffected way that the functions of Ethernet should run in normal way even we introduced timing path at physical layer. This paper will give detailed outlook on how Sync-E is achieved from Asynchronous format. Reference model of 100 Base-TX/FX was analyzed with respect to timing and interference constraints. Finally, it was analyzed with the data rate improvement with the proposed method.

Bayesian Model Selection under Time Constraints

Science.gov (United States)

Hoege, M.; Nowak, W.; Illman, W. A.

2017-12-01

Bayesian model selection (BMS) provides a consistent framework for rating and comparing models in multi-model inference. In cases where models of vastly different complexity compete with each other, we also face vastly different computational runtimes of such models. For instance, time series of a quantity of interest can be simulated by an autoregressive process model that takes even less than a second for one run, or by a partial differential equations-based model with runtimes up to several hours or even days. The classical BMS is based on a quantity called Bayesian model evidence (BME). It determines the model weights in the selection process and resembles a trade-off between bias of a model and its complexity. However, in practice, the runtime of models is another weight relevant factor for model selection. Hence, we believe that it should be included, leading to an overall trade-off problem between bias, variance and computing effort. We approach this triple trade-off from the viewpoint of our ability to generate realizations of the models under a given computational budget. One way to obtain BME values is through sampling-based integration techniques. We argue with the fact that more expensive models can be sampled much less under time constraints than faster models (in straight proportion to their runtime). The computed evidence in favor of a more expensive model is statistically less significant than the evidence computed in favor of a faster model, since sampling-based strategies are always subject to statistical sampling error. We present a straightforward way to include this misbalance into the model weights that are the basis for model selection. Our approach follows directly from the idea of insufficient significance. It is based on a computationally cheap bootstrapping error estimate of model evidence and is easy to implement. The approach is illustrated in a small synthetic modeling study.

A Pilot Study Examining the Effects of Time Constraints on Student Performance in Accounting Classes

Science.gov (United States)

Morris, David E., Sr.; Scott, John

2017-01-01

The purpose of this study was to examine the effects, if any, of time constraints on the success of accounting students completing exams. This study examined how time allowed to take exams affected the grades on examinations in three different accounting classes. Two were sophomore classes and one was a senior accounting class. This limited pilot…

Towards a comprehensive framework for cosimulation of dynamic models with an emphasis on time stepping

Science.gov (United States)

Hoepfer, Matthias

co-simulation approach to modeling and simulation. It lays out the general approach to dynamic system co-simulation, and gives a comprehensive overview of what co-simulation is and what it is not. It creates a taxonomy of the requirements and limits of co-simulation, and the issues arising with co-simulating sub-models. Possible solutions towards resolving the stated problems are investigated to a certain depth. A particular focus is given to the issue of time stepping. It will be shown that for dynamic models, the selection of the simulation time step is a crucial issue with respect to computational expense, simulation accuracy, and error control. The reasons for this are discussed in depth, and a time stepping algorithm for co-simulation with unknown dynamic sub-models is proposed. Motivations and suggestions for the further treatment of selected issues are presented.

Modified Pressure-Correction Projection Methods: Open Boundary and Variable Time Stepping

KAUST Repository

Bonito, Andrea

2014-10-31

© Springer International Publishing Switzerland 2015. In this paper, we design and study two modifications of the first order standard pressure increment projection scheme for the Stokes system. The first scheme improves the existing schemes in the case of open boundary condition by modifying the pressure increment boundary condition, thereby minimizing the pressure boundary layer and recovering the optimal first order decay. The second scheme allows for variable time stepping. It turns out that the straightforward modification to variable time stepping leads to unstable schemes. The proposed scheme is not only stable but also exhibits the optimal first order decay. Numerical computations illustrating the theoretical estimates are provided for both new schemes.

Modified Pressure-Correction Projection Methods: Open Boundary and Variable Time Stepping

KAUST Repository

Bonito, Andrea; Guermond, Jean-Luc; Lee, Sanghyun

2014-01-01

© Springer International Publishing Switzerland 2015. In this paper, we design and study two modifications of the first order standard pressure increment projection scheme for the Stokes system. The first scheme improves the existing schemes in the case of open boundary condition by modifying the pressure increment boundary condition, thereby minimizing the pressure boundary layer and recovering the optimal first order decay. The second scheme allows for variable time stepping. It turns out that the straightforward modification to variable time stepping leads to unstable schemes. The proposed scheme is not only stable but also exhibits the optimal first order decay. Numerical computations illustrating the theoretical estimates are provided for both new schemes.

Proximate effects of temperature versus evolved intrinsic constraints for embryonic development times among temperate and tropical songbirds

Science.gov (United States)

Ton, Riccardo; Martin, Thomas E.

2017-01-01

The relative importance of intrinsic constraints imposed by evolved physiological trade-offs versus the proximate effects of temperature for interspecific variation in embryonic development time remains unclear. Understanding this distinction is important because slow development due to evolved trade-offs can yield phenotypic benefits, whereas slow development from low temperature can yield costs. We experimentally increased embryonic temperature in free-living tropical and north temperate songbird species to test these alternatives. Warmer temperatures consistently shortened development time without costs to embryo mass or metabolism. However, proximate effects of temperature played an increasingly stronger role than intrinsic constraints for development time among species with colder natural incubation temperatures. Long development times of tropical birds have been thought to primarily reflect evolved physiological trade-offs that facilitate their greater longevity. In contrast, our results indicate a much stronger role of temperature in embryonic development time than currently thought.

Scheduling double round-robin tournaments with divisional play using constraint programming

Energy Technology Data Exchange (ETDEWEB)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

2017-06-01

We study a tournament format that extends a traditional double round-robin format with divisional single round-robin tournaments. Elitserien, the top Swedish handball league, uses such a format for its league schedule. We present a constraint programming model that characterizes the general double round-robin plus divisional single round-robin format. This integrated model allows scheduling to be performed in a single step, as opposed to common multistep approaches that decompose scheduling into smaller problems and possibly miss optimal solutions. In addition to general constraints, we introduce Elitserien-specific requirements for its tournament. These general and league-specific constraints allow us to identify implicit and symmetry-breaking properties that reduce the time to solution from hours to seconds. A scalability study of the number of teams shows that our approach is reasonably fast for even larger league sizes. The experimental evaluation of the integrated approach takes considerably less computational effort to schedule Elitserien than does the previous decomposed approach. (C) 2016 Elsevier B.V. All rights reserved

Query by Constraint Propagation in the Concept-Oriented Data Model

Directory of Open Access Journals (Sweden)

Alexandr Savinov

2006-09-01

Full Text Available The paper describes an approach to query processing in the concept-oriented data model. This approach is based on imposing constraints and specifying the result type. The constraints are then automatically propagated over the model and the result contains all related data items. The simplest constraint propagation strategy consists of two steps: propagating down to the most specific level using de-projection and propagating up to the target concept using projection. A more complex strategy described in the paper may consist of many de-projection/projection steps passing through some intermediate concepts. An advantage of the described query mechanism is that it does not need any join conditions because it uses the structure of the model for propagation. Moreover, this mechanism does not require specifying an access path using dimension names. Thus even rather complex queries can be expressed in simple and natural form because they are expressed by specifying what information is available and what related data we want to get.

Some Comments on the Behavior of the RELAP5 Numerical Scheme at Very Small Time Steps

International Nuclear Information System (INIS)

Tiselj, Iztok; Cerne, Gregor

2000-01-01

The behavior of the RELAP5 code at very short time steps is described, i.e., δt [approximately equal to] 0.01 δx/c. First, the property of the RELAP5 code to trace acoustic waves with 'almost' second-order accuracy is demonstrated. Quasi-second-order accuracy is usually achieved for acoustic waves at very short time steps but can never be achieved for the propagation of nonacoustic temperature and void fraction waves. While this feature may be beneficial for the simulations of fast transients describing pressure waves, it also has an adverse effect: The lack of numerical diffusion at very short time steps can cause typical second-order numerical oscillations near steep pressure jumps. This behavior explains why an automatic halving of the time step, which is used in RELAP5 when numerical difficulties are encountered, in some cases leads to the failure of the simulation.Second, the integration of the stiff interphase exchange terms in RELAP5 is studied. For transients with flashing and/or rapid condensation as the main phenomena, results strongly depend on the time step used. Poor accuracy is achieved with 'normal' time steps (δt [approximately equal to] δx/v) because of the very short characteristic timescale of the interphase mass and heat transfer sources. In such cases significantly different results are predicted with very short time steps because of the more accurate integration of the stiff interphase exchange terms

Multi-time-step domain coupling method with energy control

DEFF Research Database (Denmark)

Mahjoubi, N.; Krenk, Steen

2010-01-01

the individual time step. It is demonstrated that displacement continuity between the subdomains leads to cancelation of the interface contributions to the energy balance equation, and thus stability and algorithmic damping properties of the original algorithms are retained. The various subdomains can...... by a numerical example using a refined mesh around concentrated forces. Copyright © 2010 John Wiley & Sons, Ltd....

Temporal Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Palamidessi, Catuscia; Valencia, Frank Dan

2002-01-01

The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...

Sharing Steps in the Workplace: Changing Privacy Concerns Over Time

DEFF Research Database (Denmark)

Jensen, Nanna Gorm; Shklovski, Irina

2016-01-01

study of a Danish workplace participating in a step counting campaign. We find that concerns of employees who choose to participate and those who choose not to differ. Moreover, privacy concerns of participants develop and change over time. Our findings challenge the assumption that consumers...

Drift Reduction in Pedestrian Navigation System by Exploiting Motion Constraints and Magnetic Field

Directory of Open Access Journals (Sweden)

Muhammad Ilyas

2016-09-01

Full Text Available Pedestrian navigation systems (PNS using foot-mounted MEMS inertial sensors use zero-velocity updates (ZUPTs to reduce drift in navigation solutions and estimate inertial sensor errors. However, it is well known that ZUPTs cannot reduce all errors, especially as heading error is not observable. Hence, the position estimates tend to drift and even cyclic ZUPTs are applied in updated steps of the Extended Kalman Filter (EKF. This urges the use of other motion constraints for pedestrian gait and any other valuable heading reduction information that is available. In this paper, we exploit two more motion constraints scenarios of pedestrian gait: (1 walking along straight paths; (2 standing still for a long time. It is observed that these motion constraints (called “virtual sensor”, though considerably reducing drift in PNS, still need an absolute heading reference. One common absolute heading estimation sensor is the magnetometer, which senses the Earth’s magnetic field and, hence, the true heading angle can be calculated. However, magnetometers are susceptible to magnetic distortions, especially in indoor environments. In this work, an algorithm, called magnetic anomaly detection (MAD and compensation is designed by incorporating only healthy magnetometer data in the EKF updating step, to reduce drift in zero-velocity updated INS. Experiments are conducted in GPS-denied and magnetically distorted environments to validate the proposed algorithms.

Time scale of random sequential adsorption.

Science.gov (United States)

Erban, Radek; Chapman, S Jonathan

2007-04-01

A simple multiscale approach to the diffusion-driven adsorption from a solution to a solid surface is presented. The model combines two important features of the adsorption process: (i) The kinetics of the chemical reaction between adsorbing molecules and the surface and (ii) geometrical constraints on the surface made by molecules which are already adsorbed. The process (i) is modeled in a diffusion-driven context, i.e., the conditional probability of adsorbing a molecule provided that the molecule hits the surface is related to the macroscopic surface reaction rate. The geometrical constraint (ii) is modeled using random sequential adsorption (RSA), which is the sequential addition of molecules at random positions on a surface; one attempt to attach a molecule is made per one RSA simulation time step. By coupling RSA with the diffusion of molecules in the solution above the surface the RSA simulation time step is related to the real physical time. The method is illustrated on a model of chemisorption of reactive polymers to a virus surface.

Development of a real time activity monitoring Android application utilizing SmartStep.

Science.gov (United States)

Hegde, Nagaraj; Melanson, Edward; Sazonov, Edward

2016-08-01

Footwear based activity monitoring systems are becoming popular in academic research as well as consumer industry segments. In our previous work, we had presented developmental aspects of an insole based activity and gait monitoring system-SmartStep, which is a socially acceptable, fully wireless and versatile insole. The present work describes the development of an Android application that captures the SmartStep data wirelessly over Bluetooth Low energy (BLE), computes features on the received data, runs activity classification algorithms and provides real time feedback. The development of activity classification methods was based on the the data from a human study involving 4 participants. Participants were asked to perform activities of sitting, standing, walking, and cycling while they wore SmartStep insole system. Multinomial Logistic Discrimination (MLD) was utilized in the development of machine learning model for activity prediction. The resulting classification model was implemented in an Android Smartphone. The Android application was benchmarked for power consumption and CPU loading. Leave one out cross validation resulted in average accuracy of 96.9% during model training phase. The Android application for real time activity classification was tested on a human subject wearing SmartStep resulting in testing accuracy of 95.4%.

Adaptive fuzzy dynamic surface control of nonlinear systems with input saturation and time-varying output constraints

Science.gov (United States)

Edalati, L.; Khaki Sedigh, A.; Aliyari Shooredeli, M.; Moarefianpour, A.

2018-02-01

This paper deals with the design of adaptive fuzzy dynamic surface control for uncertain strict-feedback nonlinear systems with asymmetric time-varying output constraints in the presence of input saturation. To approximate the unknown nonlinear functions and overcome the problem of explosion of complexity, a Fuzzy logic system is combined with the dynamic surface control in the backstepping design technique. To ensure the output constraints satisfaction, an asymmetric time-varying Barrier Lyapunov Function (BLF) is used. Moreover, by applying the minimal learning parameter technique, the number of the online parameters update for each subsystem is reduced to 2. Hence, the semi-globally uniformly ultimately boundedness (SGUUB) of all the closed-loop signals with appropriate tracking error convergence is guaranteed. The effectiveness of the proposed control is demonstrated by two simulation examples.

Private sector involvement in times of armed conflict: What are the constraints for trading medical equipment?

Science.gov (United States)

Schmidt, Georg

Today, healthcare facilities are highly dependent on the private sector to keep their medical equipment functioning. Moreover, private sector involvement becomes particularly important for the supply of spare parts and consumables. However, in times of armed conflict, the capacity of the corporate world appears to be seriously hindered. Subsequently, this study researches the influence of armed conflict on the private medical equipment sector. This study follows a qualitative approach by conducting 19 interviews with representatives of the corporate world in an active conflict zone. A semistructured interview guide, consisting of 10 questions, was used to examine the constraints of this sector. The results reveal that the lack of skilled personnel, complicated importation procedures, and a decrease in financial capacity are the major constraints faced by private companies dealing in medical equipment in conflict zones. Even when no official sanctions and embargoes for medical items exist, constraints for trading medical equipment are clearly recognizable. Countries at war would benefit from a centralized structure that deals with the importation procedures for medical items, to assist local companies in their purchasing procedures. A high degree of adaption is needed to continue operating, despite the emerging constraints of armed conflict. Future studies might research the constraints for manufacturers outside the conflict to export medical items to the country of war.

First passage time for a diffusive process under a geometric constraint

International Nuclear Information System (INIS)

Tateishi, A A; Michels, F S; Dos Santos, M A F; Lenzi, E K; Ribeiro, H V

2013-01-01

We investigate the solutions, survival probability, and first passage time for a two-dimensional diffusive process subjected to the geometric constraints of a backbone structure. We consider this process governed by a fractional Fokker–Planck equation by taking into account the boundary conditions ρ(0,y;t) = ρ(∞,y;t) = 0, ρ(x, ± ∞;t) = 0, and an arbitrary initial condition. Our results show an anomalous spreading and, consequently, a nonusual behavior for the survival probability and for the first passage time distribution that may be characterized by different regimes. In addition, depending on the choice of the parameters present in the fractional Fokker–Planck equation, the survival probability indicates that part of the system may be trapped in the branches of the backbone structure. (paper)

Measuring border delay and crossing times at the US-Mexico border : part II. Step-by-step guidelines for implementing a radio frequency identification (RFID) system to measure border crossing and wait times.

Science.gov (United States)

2012-06-01

The purpose of these step-by-step guidelines is to assist in planning, designing, and deploying a system that uses radio frequency identification (RFID) technology to measure the time needed for commercial vehicles to complete the northbound border c...

Displacement in the parameter space versus spurious solution of discretization with large time step

International Nuclear Information System (INIS)

Mendes, Eduardo; Letellier, Christophe

2004-01-01

In order to investigate a possible correspondence between differential and difference equations, it is important to possess discretization of ordinary differential equations. It is well known that when differential equations are discretized, the solution thus obtained depends on the time step used. In the majority of cases, such a solution is considered spurious when it does not resemble the expected solution of the differential equation. This often happens when the time step taken into consideration is too large. In this work, we show that, even for quite large time steps, some solutions which do not correspond to the expected ones are still topologically equivalent to solutions of the original continuous system if a displacement in the parameter space is considered. To reduce such a displacement, a judicious choice of the discretization scheme should be made. To this end, a recent discretization scheme, based on the Lie expansion of the original differential equations, proposed by Monaco and Normand-Cyrot will be analysed. Such a scheme will be shown to be sufficient for providing an adequate discretization for quite large time steps compared to the pseudo-period of the underlying dynamics

Time-optimal control of reactor power

International Nuclear Information System (INIS)

Bernard, J.A.

1987-01-01

Control laws that permit adjustments in reactor power to be made in minimum time and without overshoot have been formulated and demonstrated. These control laws which are derived from the standard and alternate dynamic period equations, are closed-form expressions of general applicability. These laws were deduced by noting that if a system is subject to one or more operating constraints, then the time-optimal response is to move the system along these constraints. Given that nuclear reactors are subject to limitations on the allowed reactor period, a time-optimal control law would step the period from infinity to the minimum allowed value, hold the period at that value for the duration of the transient, and then step the period back to infinity. The change in reactor would therefore be accomplished in minimum time. The resulting control laws are superior to other forms of time-optimal control because they are general-purpose, closed-form expressions that are both mathematically tractable and readily implanted. Moreover, these laws include provisions for the use of feedback. The results of simulation studies and actual experiments on the 5 MWt MIT Research Reactor in which these time-optimal control laws were used successfully to adjust the reactor power are presented

γ parameter and Solar System constraint in chameleon-Brans-Dicke theory

International Nuclear Information System (INIS)

Saaidi, Kh.; Mohammadi, A.; Sheikhahmadi, H.

2011-01-01

The post Newtonian parameter is considered in the chameleon-Brans-Dicke model. In the first step, the general form of this parameter and also effective gravitational constant is obtained. An arbitrary function for f(Φ), which indicates the coupling between matter and scalar field, is introduced to investigate validity of solar system constraint. It is shown that the chameleon-Brans-Dicke model can satisfy the solar system constraint and gives us an ω parameter of order 10 4 , which is in comparable to the constraint which has been indicated in [19].

Temporal Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Valencia Posso, Frank Dan

2002-01-01

The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...... reflect the reactive interactions between concurrent constraint processes and their environment, as well as internal interactions between individual processes. Relationships between the suggested notions are studied, and they are all proved to be decidable for a substantial fragment of the calculus...

University Course Timetabling using Constraint Programming

Directory of Open Access Journals (Sweden)

Hadi Shahmoradi

2017-03-01

Full Text Available University course timetabling problem is a challenging and time-consuming task on the overall structure of timetable in every academic environment. The problem deals with many factors such as the number of lessons, classes, teachers, students and working time, and these are influenced by some hard and soft constraints. The aim of solving this problem is to assign courses and classes to teachers and students, so that the restrictions are held. In this paper, a constraint programming method is proposed to satisfy maximum constraints and expectation, in order to address university timetabling problem. For minimizing the penalty of soft constraints, a cost function is introduced and AHP method is used for calculating its coefficients. The proposed model is tested on department of management, University of Isfahan dataset using OPL on the IBM ILOG CPLEX Optimization Studio platform. A statistical analysis has been conducted and shows the performance of the proposed approach in satisfying all hard constraints and also the satisfying degree of the soft constraints is on maximum desirable level. The running time of the model is less than 20 minutes that is significantly better than the non-automated ones.

Fluence map optimization (FMO) with dose–volume constraints in IMRT using the geometric distance sorting method

International Nuclear Information System (INIS)

Lan Yihua; Li Cunhua; Ren Haozheng; Zhang Yong; Min Zhifang

2012-01-01

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose–volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose–volume constraints, and then the dose constraints for the voxels violating the dose–volume constraints are gradually added into the quadratic optimization model step by step until all the dose–volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head–neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than

Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method.

Science.gov (United States)

Lan, Yihua; Li, Cunhua; Ren, Haozheng; Zhang, Yong; Min, Zhifang

2012-10-21

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose-volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose-volume constraints, and then the dose constraints for the voxels violating the dose-volume constraints are gradually added into the quadratic optimization model step by step until all the dose-volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head-neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than the dose

Stepping Stones through Time

Directory of Open Access Journals (Sweden)

Emily Lyle

2012-03-01

Full Text Available Indo-European mythology is known only through written records but it needs to be understood in terms of the preliterate oral-cultural context in which it was rooted. It is proposed that this world was conceptually organized through a memory-capsule consisting of the current generation and the three before it, and that there was a system of alternate generations with each generation taking a step into the future under the leadership of a white or red king.

ELMs and constraints on the H-mode pedestal: A model based on peeling-ballooning modes

International Nuclear Information System (INIS)

Snyder, P.B.

2002-01-01

Maximizing the pedestal height while maintaining acceptable ELMs is a key issue for optimizing tokamak performance. We present a model for ELMs and pedestal constraints based upon theoretical analysis of edge instabilities which can limit the pedestal height and drive ELMs. Sharp pedestal pressure gradients drive large bootstrap currents which play a complex dual role in the stability physics. Consequently, the dominant modes are often intermediate-n coupled 'peeling-ballooning' modes, driven both by current and the pressure gradient. A highly efficient new MHD code, ELITE, is used to study these modes, and calculate quantitative stability constraints on the pedestal, including direct constraints on the pedestal height. A model of various ELM types is developed, and quantitatively compared to data from several tokamaks. A number of observations agree with predictions, including ELM onset times, ELM depth, and variation in pedestal height with discharge shape. Projections of pedestal stability constraints for Next Step designs, and nonlinear simulations of peeling-ballooning modes using the BOUT code are also presented. (author)

Finite Time Merton Strategy under Drawdown Constraint: A Viscosity Solution Approach

International Nuclear Information System (INIS)

Elie, R.

2008-01-01

We consider the optimal consumption-investment problem under the drawdown constraint, i.e. the wealth process never falls below a fixed fraction of its running maximum. We assume that the risky asset is driven by the constant coefficients Black and Scholes model and we consider a general class of utility functions. On an infinite time horizon, Elie and Touzi (Preprint, [2006]) provided the value function as well as the optimal consumption and investment strategy in explicit form. In a more realistic setting, we consider here an agent optimizing its consumption-investment strategy on a finite time horizon. The value function interprets as the unique discontinuous viscosity solution of its corresponding Hamilton-Jacobi-Bellman equation. This leads to a numerical approximation of the value function and allows for a comparison with the explicit solution in infinite horizon

Discretionary Time of Chinese College Students: Activities and Impact of SARS-Induced Constraints on Choices

Science.gov (United States)

Yang, He; Hutchinson, Susan; Zinn, Harry; Watson, Alan

2011-01-01

How people make choices about activity engagement during discretionary time is a topic of increasing interest to those studying quality of life issues. Assuming choices are made to maximize individual welfare, several factors are believed to influence these choices. Constraints theory from the leisure research literature suggests these choices are…

Colored thermal noise driven dynamical system in the presence and absence of non-equilibrium constraint: time dependence of information entropy flux and entropy production

International Nuclear Information System (INIS)

Goswami, Gurupada; Mukherjee, Biswajit; Bag, Bidhan Chandra

2005-01-01

We have studied the relaxation of non-Markovian and thermodynamically closed system both in the absence and presence of non-equilibrium constraint in terms of the information entropy flux and entropy production based on the Fokker-Planck and the entropy balance equations. Our calculation shows how the relaxation time depends on noise correlation time. It also considers how the non-equilibrium constraint is affected by system parameters such as noise correlation time, strength of dissipation and frequency of dynamical system. The interplay of non-equilibrium constraint, frictional memory kernel, noise correlation time and frequency of dynamical system reveals the extremum nature of the entropy production

Colored thermal noise driven dynamical system in the presence and absence of non-equilibrium constraint: time dependence of information entropy flux and entropy production

Science.gov (United States)

Goswami, Gurupada; Mukherjee, Biswajit; Bag, Bidhan Chandra

2005-06-01

We have studied the relaxation of non-Markovian and thermodynamically closed system both in the absence and presence of non-equilibrium constraint in terms of the information entropy flux and entropy production based on the Fokker-Planck and the entropy balance equations. Our calculation shows how the relaxation time depends on noise correlation time. It also considers how the non-equilibrium constraint is affected by system parameters such as noise correlation time, strength of dissipation and frequency of dynamical system. The interplay of non-equilibrium constraint, frictional memory kernel, noise correlation time and frequency of dynamical system reveals the extremum nature of the entropy production.

Constraints and Creativity in NPD - Testing the Impact of 'Late Constraints'

DEFF Research Database (Denmark)

Onarheim, Balder; Valgeirsdóttir, Dagný

experiment was conducted, involving 12 teams of industrial designers from three different countries, each team working on two 30 minutes design tasks. In one condition all constraints were given at the start, and in the other one new radical constraint was added after 12 minutes. The output from all 24 tasks......The aim of the presented work is to investigate how the timing of project constraints can influence the creativity of the output in New Product Development (NPD) projects. When seeking to produce a creative output, is it beneficial to know all constraints when initiating a project...... was assessed for creativity using the Consensual Assessment Technique (CAT), and a comparative within-subjects analysis found no significant different between the two conditions. Controlling for task and assessor a small but non-significant effect was found, in favor of the ‘late constraint’ condition. Thus...

Selective constraint on noncoding regions of hominid genomes.

Directory of Open Access Journals (Sweden)

Eliot C Bush

2005-12-01

Full Text Available An important challenge for human evolutionary biology is to understand the genetic basis of human-chimpanzee differences. One influential idea holds that such differences depend, to a large extent, on adaptive changes in gene expression. An important step in assessing this hypothesis involves gaining a better understanding of selective constraint on noncoding regions of hominid genomes. In noncoding sequence, functional elements are frequently small and can be separated by large nonfunctional regions. For this reason, constraint in hominid genomes is likely to be patchy. Here we use conservation in more distantly related mammals and amniotes as a way of identifying small sequence windows that are likely to be functional. We find that putatively functional noncoding elements defined in this manner are subject to significant selective constraint in hominids.

Selective Constraint on Noncoding Regions of Hominid Genomes.

Directory of Open Access Journals (Sweden)

2005-12-01

Full Text Available An important challenge for human evolutionary biology is to understand the genetic basis of human-chimpanzee differences. One influential idea holds that such differences depend, to a large extent, on adaptive changes in gene expression. An important step in assessing this hypothesis involves gaining a better understanding of selective constraint on noncoding regions of hominid genomes. In noncoding sequence, functional elements are frequently small and can be separated by large nonfunctional regions. For this reason, constraint in hominid genomes is likely to be patchy. Here we use conservation in more distantly related mammals and amniotes as a way of identifying small sequence windows that are likely to be functional. We find that putatively functional noncoding elements defined in this manner are subject to significant selective constraint in hominids.

The Optimization of Transportation Costs in Logistics Enterprises with Time-Window Constraints

Directory of Open Access Journals (Sweden)

Qingyou Yan

2015-01-01

Full Text Available This paper presents a model for solving a multiobjective vehicle routing problem with soft time-window constraints that specify the earliest and latest arrival times of customers. If a customer is serviced before the earliest specified arrival time, extra inventory costs are incurred. If the customer is serviced after the latest arrival time, penalty costs must be paid. Both the total transportation cost and the required fleet size are minimized in this model, which also accounts for the given capacity limitations of each vehicle. The total transportation cost consists of direct transportation costs, extra inventory costs, and penalty costs. This multiobjective optimization is solved by using a modified genetic algorithm approach. The output of the algorithm is a set of optimal solutions that represent the trade-off between total transportation cost and the fleet size required to service customers. The influential impact of these two factors is analyzed through the use of a case study.

Discretionary time of Chinese college students: Activities and impact of SARS-induced constraints on choices

Science.gov (United States)

He Yang; Susan Hutchinson; Harry Zinn; Alan Watson

2011-01-01

How people make choices about activity engagement during discretionary time is a topic of increasing interest to those studying quality of life issues. Assuming choices are made to maximize individual welfare, several factors are believed to influence these choices. Constraints theory from the leisure research literature suggests these choices are heavily influenced by...

Error Analysis of a Fractional Time-Stepping Technique for Incompressible Flows with Variable Density

KAUST Repository

Guermond, J.-L.; Salgado, Abner J.

2011-01-01

In this paper we analyze the convergence properties of a new fractional time-stepping technique for the solution of the variable density incompressible Navier-Stokes equations. The main feature of this method is that, contrary to other existing algorithms, the pressure is determined by just solving one Poisson equation per time step. First-order error estimates are proved, and stability of a formally second-order variant of the method is established. © 2011 Society for Industrial and Applied Mathematics.

Time domain localization technique with sparsity constraint for imaging acoustic sources

Science.gov (United States)

Padois, Thomas; Doutres, Olivier; Sgard, Franck; Berry, Alain

2017-09-01

This paper addresses source localization technique in time domain for broadband acoustic sources. The objective is to accurately and quickly detect the position and amplitude of noise sources in workplaces in order to propose adequate noise control options and prevent workers hearing loss or safety risk. First, the generalized cross correlation associated with a spherical microphone array is used to generate an initial noise source map. Then a linear inverse problem is defined to improve this initial map. Commonly, the linear inverse problem is solved with an l2 -regularization. In this study, two sparsity constraints are used to solve the inverse problem, the orthogonal matching pursuit and the truncated Newton interior-point method. Synthetic data are used to highlight the performances of the technique. High resolution imaging is achieved for various acoustic sources configurations. Moreover, the amplitudes of the acoustic sources are correctly estimated. A comparison of computation times shows that the technique is compatible with quasi real-time generation of noise source maps. Finally, the technique is tested with real data.

Efficient constraint-based Sequential Pattern Mining (SPM algorithm to understand customers’ buying behaviour from time stamp-based sequence dataset

Directory of Open Access Journals (Sweden)

Niti Ashish Kumar Desai

2015-12-01

Full Text Available Business Strategies are formulated based on an understanding of customer needs. This requires development of a strategy to understand customer behaviour and buying patterns, both current and future. This involves understanding, first how an organization currently understands customer needs and second predicting future trends to drive growth. This article focuses on purchase trend of customer, where timing of purchase is more important than association of item to be purchased, and which can be found out with Sequential Pattern Mining (SPM methods. Conventional SPM algorithms worked purely on frequency identifying patterns that were more frequent but suffering from challenges like generation of huge number of uninteresting patterns, lack of user’s interested patterns, rare item problem, etc. Article attempts a solution through development of a SPM algorithm based on various constraints like Gap, Compactness, Item, Recency, Profitability and Length along with Frequency constraint. Incorporation of six additional constraints is as well to ensure that all patterns are recently active (Recency, active for certain time span (Compactness, profitable and indicative of next timeline for purchase (Length―Item―Gap. The article also attempts to throw light on how proposed Constraint-based Prefix Span algorithm is helpful to understand buying behaviour of customer which is in formative stage.

Rapid expansion method (REM) for time‐stepping in reverse time migration (RTM)

KAUST Repository

Pestana, Reynam C.

2009-01-01

We show that the wave equation solution using a conventional finite‐difference scheme, derived commonly by the Taylor series approach, can be derived directly from the rapid expansion method (REM). After some mathematical manipulation we consider an analytical approximation for the Bessel function where we assume that the time step is sufficiently small. From this derivation we find that if we consider only the first two Chebyshev polynomials terms in the rapid expansion method we can obtain the second order time finite‐difference scheme that is frequently used in more conventional finite‐difference implementations. We then show that if we use more terms from the REM we can obtain a more accurate time integration of the wave field. Consequently, we have demonstrated that the REM is more accurate than the usual finite‐difference schemes and it provides a wave equation solution which allows us to march in large time steps without numerical dispersion and is numerically stable. We illustrate the method with post and pre stack migration results.

Clock gene evolution: seasonal timing, phylogenetic signal, or functional constraint?

Science.gov (United States)

Krabbenhoft, Trevor J; Turner, Thomas F

2014-01-01

Genetic determinants of seasonal reproduction are not fully understood but may be important predictors of organism responses to climate change. We used a comparative approach to study the evolution of seasonal timing within a fish community in a natural common garden setting. We tested the hypothesis that allelic length variation in the PolyQ domain of a circadian rhythm gene, Clock1a, corresponded to interspecific differences in seasonal reproductive timing across 5 native and 1 introduced cyprinid fishes (n = 425 individuals) that co-occur in the Rio Grande, NM, USA. Most common allele lengths were longer in native species that initiated reproduction earlier (Spearman's r = -0.70, P = 0.23). Clock1a allele length exhibited strong phylogenetic signal and earlier spawners were evolutionarily derived. Aside from length variation in Clock1a, all other amino acids were identical across native species, suggesting functional constraint over evolutionary time. Interestingly, the endangered Rio Grande silvery minnow (Hybognathus amarus) exhibited less allelic variation in Clock1a and observed heterozygosity was 2- to 6-fold lower than the 5 other (nonimperiled) species. Reduced genetic variation in this functionally important gene may impede this species' capacity to respond to ongoing environmental change.

Multiple Time-Step Dual-Hamiltonian Hybrid Molecular Dynamics - Monte Carlo Canonical Propagation Algorithm.

Science.gov (United States)

Chen, Yunjie; Kale, Seyit; Weare, Jonathan; Dinner, Aaron R; Roux, Benoît

2016-04-12

A multiple time-step integrator based on a dual Hamiltonian and a hybrid method combining molecular dynamics (MD) and Monte Carlo (MC) is proposed to sample systems in the canonical ensemble. The Dual Hamiltonian Multiple Time-Step (DHMTS) algorithm is based on two similar Hamiltonians: a computationally expensive one that serves as a reference and a computationally inexpensive one to which the workload is shifted. The central assumption is that the difference between the two Hamiltonians is slowly varying. Earlier work has shown that such dual Hamiltonian multiple time-step schemes effectively precondition nonlinear differential equations for dynamics by reformulating them into a recursive root finding problem that can be solved by propagating a correction term through an internal loop, analogous to RESPA. Of special interest in the present context, a hybrid MD-MC version of the DHMTS algorithm is introduced to enforce detailed balance via a Metropolis acceptance criterion and ensure consistency with the Boltzmann distribution. The Metropolis criterion suppresses the discretization errors normally associated with the propagation according to the computationally inexpensive Hamiltonian, treating the discretization error as an external work. Illustrative tests are carried out to demonstrate the effectiveness of the method.

Positivity-preserving dual time stepping schemes for gas dynamics

Science.gov (United States)

Parent, Bernard

2018-05-01

A new approach at discretizing the temporal derivative of the Euler equations is here presented which can be used with dual time stepping. The temporal discretization stencil is derived along the lines of the Cauchy-Kowalevski procedure resulting in cross differences in spacetime but with some novel modifications which ensure the positivity of the discretization coefficients. It is then shown that the so-obtained spacetime cross differences result in changes to the wave speeds and can thus be incorporated within Roe or Steger-Warming schemes (with and without reconstruction-evolution) simply by altering the eigenvalues. The proposed approach is advantaged over alternatives in that it is positivity-preserving for the Euler equations. Further, it yields monotone solutions near discontinuities while exhibiting a truncation error in smooth regions less than the one of the second- or third-order accurate backward-difference-formula (BDF) for either small or large time steps. The high resolution and positivity preservation of the proposed discretization stencils are independent of the convergence acceleration technique which can be set to multigrid, preconditioning, Jacobian-free Newton-Krylov, block-implicit, etc. Thus, the current paper also offers the first implicit integration of the time-accurate Euler equations that is positivity-preserving in the strict sense (that is, the density and temperature are guaranteed to remain positive). This is in contrast to all previous positivity-preserving implicit methods which only guaranteed the positivity of the density, not of the temperature or pressure. Several stringent reacting and inert test cases confirm the positivity-preserving property of the proposed method as well as its higher resolution and higher computational efficiency over other second-order and third-order implicit temporal discretization strategies.

Constraints or Preferences? Identifying Answers from Part-time Workers’ Transitions in Denmark, France and the United-Kingdom

OpenAIRE

Gash, V.

2008-01-01

This article investigates whether women work part-time through preference or constraint and argues that different countries provide different opportunities for preference attainment. It argues that women with family responsibilities are unlikely to have their working preferences met without national policies supportive of maternal employment. Using event history analysis the article tracks part-time workers' transitions to both full-time employment and to labour market drop-out.The article co...

Quantum information density scaling and qubit operation time constraints of CMOS silicon-based quantum computer architectures

Science.gov (United States)

Rotta, Davide; Sebastiano, Fabio; Charbon, Edoardo; Prati, Enrico

2017-06-01

Even the quantum simulation of an apparently simple molecule such as Fe2S2 requires a considerable number of qubits of the order of 106, while more complex molecules such as alanine (C3H7NO2) require about a hundred times more. In order to assess such a multimillion scale of identical qubits and control lines, the silicon platform seems to be one of the most indicated routes as it naturally provides, together with qubit functionalities, the capability of nanometric, serial, and industrial-quality fabrication. The scaling trend of microelectronic devices predicting that computing power would double every 2 years, known as Moore's law, according to the new slope set after the 32-nm node of 2009, suggests that the technology roadmap will achieve the 3-nm manufacturability limit proposed by Kelly around 2020. Today, circuital quantum information processing architectures are predicted to take advantage from the scalability ensured by silicon technology. However, the maximum amount of quantum information per unit surface that can be stored in silicon-based qubits and the consequent space constraints on qubit operations have never been addressed so far. This represents one of the key parameters toward the implementation of quantum error correction for fault-tolerant quantum information processing and its dependence on the features of the technology node. The maximum quantum information per unit surface virtually storable and controllable in the compact exchange-only silicon double quantum dot qubit architecture is expressed as a function of the complementary metal-oxide-semiconductor technology node, so the size scale optimizing both physical qubit operation time and quantum error correction requirements is assessed by reviewing the physical and technological constraints. According to the requirements imposed by the quantum error correction method and the constraints given by the typical strength of the exchange coupling, we determine the workable operation frequency

The ESS and replicator equation in matrix games under time constraints.

Science.gov (United States)

Garay, József; Cressman, Ross; Móri, Tamás F; Varga, Tamás

2018-06-01

Recently, we introduced the class of matrix games under time constraints and characterized the concept of (monomorphic) evolutionarily stable strategy (ESS) in them. We are now interested in how the ESS is related to the existence and stability of equilibria for polymorphic populations. We point out that, although the ESS may no longer be a polymorphic equilibrium, there is a connection between them. Specifically, the polymorphic state at which the average strategy of the active individuals in the population is equal to the ESS is an equilibrium of the polymorphic model. Moreover, in the case when there are only two pure strategies, a polymorphic equilibrium is locally asymptotically stable under the replicator equation for the pure-strategy polymorphic model if and only if it corresponds to an ESS. Finally, we prove that a strict Nash equilibrium is a pure-strategy ESS that is a locally asymptotically stable equilibrium of the replicator equation in n-strategy time-constrained matrix games.

Automatic pickup of arrival time of channel wave based on multi-channel constraints

Science.gov (United States)

Wang, Bao-Li

2018-03-01

Accurately detecting the arrival time of a channel wave in a coal seam is very important for in-seam seismic data processing. The arrival time greatly affects the accuracy of the channel wave inversion and the computed tomography (CT) result. However, because the signal-to-noise ratio of in-seam seismic data is reduced by the long wavelength and strong frequency dispersion, accurately timing the arrival of channel waves is extremely difficult. For this purpose, we propose a method that automatically picks up the arrival time of channel waves based on multi-channel constraints. We first estimate the Jaccard similarity coefficient of two ray paths, then apply it as a weight coefficient for stacking the multichannel dispersion spectra. The reasonableness and effectiveness of the proposed method is verified in an actual data application. Most importantly, the method increases the degree of automation and the pickup precision of the channel-wave arrival time.

One-step electrodeposition process of CuInSe2: Deposition time effect

Indian Academy of Sciences (India)

Administrator

CuInSe2 thin films were prepared by one-step electrodeposition process using a simplified two- electrodes system. ... homojunctions or heterojunctions (Rincon et al 1983). Efficiency of ... deposition times onto indium thin oxide (ITO)-covered.

Age-related differences in lower-limb force-time relation during the push-off in rapid voluntary stepping.

Science.gov (United States)

Melzer, I; Krasovsky, T; Oddsson, L I E; Liebermann, D G

2010-12-01

This study investigated the force-time relationship during the push-off stage of a rapid voluntary step in young and older healthy adults, to study the assumption that when balance is lost a quick step may preserve stability. The ability to achieve peak propulsive force within a short time is critical for the performance of such a quick powerful step. We hypothesized that older adults would achieve peak force and power in significantly longer times compared to young people, particularly during the push-off preparatory phase. Fifteen young and 15 older volunteers performed rapid forward steps while standing on a force platform. Absolute anteroposterior and body weight normalized vertical forces during the push-off in the preparation and swing phases were used to determine time to peak and peak force, and step power. Two-way analyses of variance ('Group' [young-older] by 'Phase' [preparation-swing]) were used to assess our hypothesis (P ≤ 0.05). Older people exerted lower peak forces (anteroposterior and vertical) than young adults, but not necessarily lower peak power. More significantly, they showed a longer time to peak force, particularly in the vertical direction during the preparation phase. Older adults generate propulsive forces slowly and reach lower magnitudes, mainly during step preparation. The time to achieve a peak force and power, rather than its actual magnitude, may account for failures in quickly performing a preventive action. Such delay may be associated with the inability to react and recruit muscles quickly. Thus, training elderly to step fast in response to relevant cues may be beneficial in the prevention of falls. Copyright © 2010 Elsevier Ltd. All rights reserved.

Stability of the high-order finite elements for acoustic or elastic wave propagation with high-order time stepping

KAUST Repository

De Basabe, Jonás D.

2010-04-01

We investigate the stability of some high-order finite element methods, namely the spectral element method and the interior-penalty discontinuous Galerkin method (IP-DGM), for acoustic or elastic wave propagation that have become increasingly popular in the recent past. We consider the Lax-Wendroff method (LWM) for time stepping and show that it allows for a larger time step than the classical leap-frog finite difference method, with higher-order accuracy. In particular the fourth-order LWM allows for a time step 73 per cent larger than that of the leap-frog method; the computational cost is approximately double per time step, but the larger time step partially compensates for this additional cost. Necessary, but not sufficient, stability conditions are given for the mentioned methods for orders up to 10 in space and time. The stability conditions for IP-DGM are approximately 20 and 60 per cent more restrictive than those for SEM in the acoustic and elastic cases, respectively. © 2010 The Authors Journal compilation © 2010 RAS.

Examining the Effect of Time Constraint on the Online Mastery Learning Approach towards Improving Postgraduate Students' Achievement

Science.gov (United States)

Ee, Mong Shan; Yeoh, William; Boo, Yee Ling; Boulter, Terry

2018-01-01

Time control plays a critical role within the online mastery learning (OML) approach. This paper examines the two commonly implemented mastery learning strategies--personalised system of instructions and learning for mastery (LFM)--by focusing on what occurs when there is an instructional time constraint. Using a large data set from a postgraduate…

Fast Determination of Distribution-Connected PV Impacts Using a Variable Time-Step Quasi-Static Time-Series Approach: Preprint

Energy Technology Data Exchange (ETDEWEB)

Mather, Barry

2017-08-24

The increasing deployment of distribution-connected photovoltaic (DPV) systems requires utilities to complete complex interconnection studies. Relatively simple interconnection study methods worked well for low penetrations of photovoltaic systems, but more complicated quasi-static time-series (QSTS) analysis is required to make better interconnection decisions as DPV penetration levels increase. Tools and methods must be developed to support this. This paper presents a variable-time-step solver for QSTS analysis that significantly shortens the computational time and effort to complete a detailed analysis of the operation of a distribution circuit with many DPV systems. Specifically, it demonstrates that the proposed variable-time-step solver can reduce the required computational time by as much as 84% without introducing any important errors to metrics, such as the highest and lowest voltage occurring on the feeder, number of voltage regulator tap operations, and total amount of losses realized in the distribution circuit during a 1-yr period. Further improvement in computational speed is possible with the introduction of only modest errors in these metrics, such as a 91 percent reduction with less than 5 percent error when predicting voltage regulator operations.

The importance of time-stepping errors in ocean models

Science.gov (United States)

Williams, P. D.

2011-12-01

Many ocean models use leapfrog time stepping. The Robert-Asselin (RA) filter is usually applied after each leapfrog step, to control the computational mode. However, it will be shown in this presentation that the RA filter generates very large amounts of numerical diapycnal mixing. In some ocean models, the numerical diapycnal mixing from the RA filter is as large as the physical diapycnal mixing. This lowers our confidence in the fidelity of the simulations. In addition to the above problem, the RA filter also damps the physical solution and degrades the numerical accuracy. These two concomitant problems occur because the RA filter does not conserve the mean state, averaged over the three time slices on which it operates. The presenter has recently proposed a simple modification to the RA filter, which does conserve the three-time-level mean state. The modified filter has become known as the Robert-Asselin-Williams (RAW) filter. When used in conjunction with the leapfrog scheme, the RAW filter eliminates the numerical damping of the physical solution and increases the amplitude accuracy by two orders, yielding third-order accuracy. The phase accuracy is unaffected and remains second-order. The RAW filter can easily be incorporated into existing models of the ocean, typically via the insertion of just a single line of code. Better simulations are obtained, at almost no additional computational expense. Results will be shown from recent implementations of the RAW filter in various ocean models. For example, in the UK Met Office Hadley Centre ocean model, sea-surface temperature and sea-ice biases in the North Atlantic Ocean are found to be reduced. These improvements are encouraging for the use of the RAW filter in other ocean models.

Constraints of a parity-conserving/time-reversal-non-conserving interaction

International Nuclear Information System (INIS)

Oers, Willem T.H. van

2002-01-01

Time-Reversal-Invariance non-conservation has for the first time been unequivocally demonstrated in a direct measurement at CPLEAR. One then can ask the question: What about tests of time-reversal-invariance in systems other than the kaon system? Tests of time-reversal-invariance can be distinguished as belonging to two classes: the first one deals with time-reversal-invariance-non-conserving (T-odd)/parity violating (P-odd) interactions, while the second one deals with T-odd/P-even interactions (assuming CPT conservation this implies C-conjugation non-conservation). Limits on a T-odd/P-odd interaction follow from measurements of the electric dipole moment of the neutron ( -26 e.cm [95% C.L.]). It provides a limit on a T-odd/P-odd pion-nucleon coupling constant which is less than 10 -4 times the weak interaction strength. Experimental limits on a T-odd/P-even interaction are much less stringent. Following the standard approach of describing the nucleon-nucleon interaction in terms of meson exchanges, it can be shown that only charged ρ-meson exchange and A 1 -meson exchange can lead to a T-odd/P-even interaction. The better constraints stem from measurements of the electric dipole moment of the neutron and from measurements of charge-symmetry breaking in neutron-proton elastic scattering. The latter experiments were executed at TRIUMF (497 and 347 MeV) and at IUCF (183 MeV). All other experiments, like detailed balance experiments, polarization - analyzing power difference determinations, and five-fold correlation experiments with polarized incident nucleons and aligned nuclear targets, have been shown to be at least an order to magnitude less sensitive. Is there room for further experimentation?

Optimal Strong-Stability-Preserving Runge–Kutta Time Discretizations for Discontinuous Galerkin Methods

KAUST Repository

Kubatko, Ethan J.; Yeager, Benjamin A.; Ketcheson, David I.

2013-01-01

Discontinuous Galerkin (DG) spatial discretizations are often used in a method-of-lines approach with explicit strong-stability-preserving (SSP) Runge–Kutta (RK) time steppers for the numerical solution of hyperbolic conservation laws. The time steps that are employed in this type of approach must satisfy Courant–Friedrichs–Lewy stability constraints that are dependent on both the region of absolute stability and the SSP coefficient of the RK method. While existing SSPRK methods have been optimized with respect to the latter, it is in fact the former that gives rise to stricter constraints on the time step in the case of RKDG stability. Therefore, in this work, we present the development of new “DG-optimized” SSPRK methods with stability regions that have been specifically designed to maximize the stable time step size for RKDG methods of a given order in one space dimension. These new methods represent the best available RKDG methods in terms of computational efficiency, with significant improvements over methods using existing SSPRK time steppers that have been optimized with respect to SSP coefficients. Second-, third-, and fourth-order methods with up to eight stages are presented, and their stability properties are verified through application to numerical test cases.

Optimal Strong-Stability-Preserving Runge–Kutta Time Discretizations for Discontinuous Galerkin Methods

KAUST Repository

Kubatko, Ethan J.

2013-10-29

Discontinuous Galerkin (DG) spatial discretizations are often used in a method-of-lines approach with explicit strong-stability-preserving (SSP) Runge–Kutta (RK) time steppers for the numerical solution of hyperbolic conservation laws. The time steps that are employed in this type of approach must satisfy Courant–Friedrichs–Lewy stability constraints that are dependent on both the region of absolute stability and the SSP coefficient of the RK method. While existing SSPRK methods have been optimized with respect to the latter, it is in fact the former that gives rise to stricter constraints on the time step in the case of RKDG stability. Therefore, in this work, we present the development of new “DG-optimized” SSPRK methods with stability regions that have been specifically designed to maximize the stable time step size for RKDG methods of a given order in one space dimension. These new methods represent the best available RKDG methods in terms of computational efficiency, with significant improvements over methods using existing SSPRK time steppers that have been optimized with respect to SSP coefficients. Second-, third-, and fourth-order methods with up to eight stages are presented, and their stability properties are verified through application to numerical test cases.

Elderly fallers enhance dynamic stability through anticipatory postural adjustments during a choice stepping reaction time

Directory of Open Access Journals (Sweden)

Romain Tisserand

2016-11-01

Full Text Available In the case of disequilibrium, the capacity to step quickly is critical to avoid falling for elderly. This capacity can be simply assessed through the choice stepping reaction time test (CSRT, where elderly fallers (F take longer to step than elderly non-fallers (NF. However, reasons why elderly F elongate their stepping time remain unclear. The purpose of this study is to assess the characteristics of anticipated postural adjustments (APA that elderly F develop in a stepping context and their consequences on the dynamic stability. 44 community-dwelling elderly subjects (20 F and 22 NF performed a CSRT where kinematics and ground reaction forces were collected. Variables were analyzed using two-way repeated measures ANOVAs. Results for F compared to NF showed that stepping time is elongated, due to a longer APA phase. During APA, they seem to use two distinct balance strategies, depending on the axis: in the anteroposterior direction, we measured a smaller backward movement and slower peak velocity of the center of pressure (CoP; in the mediolateral direction, the CoP movement was similar in amplitude and peak velocity between groups but lasted longer. The biomechanical consequence of both strategies was an increased margin of stability (MoS at foot-off, in the respective direction. By elongating their APA, elderly F use a safer balance strategy that prioritizes dynamic stability conditions instead of the objective of the task. Such a choice in balance strategy probably comes from muscular limitations and/or a higher fear of falling and paradoxically indicates an increased risk of fall.

Modeling Stepped Leaders Using a Time Dependent Multi-dipole Model and High-speed Video Data

Science.gov (United States)

Karunarathne, S.; Marshall, T.; Stolzenburg, M.; Warner, T. A.; Orville, R. E.

2012-12-01

In summer of 2011, we collected lightning data with 10 stations of electric field change meters (bandwidth of 0.16 Hz - 2.6 MHz) on and around NASA/Kennedy Space Center (KSC) covering nearly 70 km × 100 km area. We also had a high-speed video (HSV) camera recording 50,000 images per second collocated with one of the electric field change meters. In this presentation we describe our use of these data to model the electric field change caused by stepped leaders. Stepped leaders of a cloud to ground lightning flash typically create the initial path for the first return stroke (RS). Most of the time, stepped leaders have multiple complex branches, and one of these branches will create the ground connection for the RS to start. HSV data acquired with a short focal length lens at ranges of 5-25 km from the flash are useful for obtaining the 2-D location of these multiple branches developing at the same time. Using HSV data along with data from the KSC Lightning Detection and Ranging (LDAR2) system and the Cloud to Ground Lightning Surveillance System (CGLSS), the 3D path of a leader may be estimated. Once the path of a stepped leader is obtained, the time dependent multi-dipole model [ Lu, Winn,and Sonnenfeld, JGR 2011] can be used to match the electric field change at various sensor locations. Based on this model, we will present the time-dependent charge distribution along a leader channel and the total charge transfer during the stepped leader phase.

Lateral stability of the spring-mass hopper suggests a two-step control strategy for running.

Science.gov (United States)

Carver, Sean G; Cowan, Noah J; Guckenheimer, John M

2009-06-01

This paper investigates the control of running gaits in the context of a spring loaded inverted pendulum model in three dimensions. Specifically, it determines the minimal number of steps required for an animal to recover from a perturbation to a specified gait. The model has four control inputs per step: two touchdown angles (azimuth and elevation) and two spring constants (compression and decompression). By representing the locomotor movement as a discrete-time return map and using the implicit function theorem we show that the number of recovery steps needed following a perturbation depends upon the goals of the control mechanism. When the goal is to follow a straight line, two steps are necessary and sufficient for small lateral perturbations. Multistep control laws have a larger number of control inputs than outputs, so solutions of the control problem are not unique. Additional constraints, referred to here as synergies, are imposed to determine unique control inputs for perturbations. For some choices of synergies, two-step control can be expressed as two iterations of its first step policy and designed so that recovery occurs in just one step for all perturbations for which one-step recovery is possible.

Infinite Runs in Weighted Timed Automata with Energy Constraints

DEFF Research Database (Denmark)

Bouyer, Patricia; Fahrenberg, Uli; Larsen, Kim Guldstrand

2008-01-01

and locations, corresponding to the production and consumption of some resource (e.g. energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g. remains between 0 and some given upper-bound). We also consider...

Provocative questions in cancer epidemiology in a time of scientific innovation and budgetary constraints.

Science.gov (United States)

Lam, Tram Kim; Schully, Sheri D; Rogers, Scott D; Benkeser, Rachel; Reid, Britt; Khoury, Muin J

2013-04-01

In a time of scientific and technological developments and budgetary constraints, the National Cancer Institute's (NCI) Provocative Questions Project offers a novel funding mechanism for cancer epidemiologists. We reviewed the purposes underlying the Provocative Questions Project, present information on the contributions of epidemiologic research to the current Provocative Questions portfolio, and outline opportunities that the cancer epidemiology community might capitalize on to advance a research agenda that spans a translational continuum from scientific discoveries to population health impact.

Implementation of Real-Time Machining Process Control Based on Fuzzy Logic in a New STEP-NC Compatible System

Directory of Open Access Journals (Sweden)

Po Hu

2016-01-01

Full Text Available Implementing real-time machining process control at shop floor has great significance on raising the efficiency and quality of product manufacturing. A framework and implementation methods of real-time machining process control based on STEP-NC are presented in this paper. Data model compatible with ISO 14649 standard is built to transfer high-level real-time machining process control information between CAPP systems and CNC systems, in which EXPRESS language is used to define new STEP-NC entities. Methods for implementing real-time machining process control at shop floor are studied and realized on an open STEP-NC controller, which is developed using object-oriented, multithread, and shared memory technologies conjunctively. Cutting force at specific direction of machining feature in side mill is chosen to be controlled object, and a fuzzy control algorithm with self-adjusting factor is designed and embedded in the software CNC kernel of STEP-NC controller. Experiments are carried out to verify the proposed framework, STEP-NC data model, and implementation methods for real-time machining process control. The results of experiments prove that real-time machining process control tasks can be interpreted and executed correctly by the STEP-NC controller at shop floor, in which actual cutting force is kept around ideal value, whether axial cutting depth changes suddenly or continuously.

Synchronization of impacting mechanical systems with a single constraint

Science.gov (United States)

Baumann, Michael; Biemond, J. J. Benjamin; Leine, Remco I.; van de Wouw, Nathan

2018-01-01

This paper addresses the synchronization problem of mechanical systems subjected to a single geometric unilateral constraint. The impacts of the individual systems, induced by the unilateral constraint, generally do not coincide even if the solutions are arbitrarily 'close' to each other. The mismatch in the impact time instants demands a careful choice of the distance function to allow for an intuitively correct comparison of the discontinuous solutions resulting from the impacts. We propose a distance function induced by the quotient metric, which is based on an equivalence relation using the impact map. The distance function obtained in this way is continuous in time when evaluated along jumping solutions. The property of maximal monotonicity, which is fulfilled by most commonly used impact laws, is used to significantly reduce the complexity of the distance function. Based on the simplified distance function, a Lyapunov function is constructed to investigate the synchronization problem for two identical one-dimensional mechanical systems. Sufficient conditions for the uncoupled individual systems are provided under which local synchronization is guaranteed. Furthermore, we present an interaction law which ensures global synchronization, also in the presence of grazing trajectories and accumulation points (Zeno behavior). The results are illustrated using numerical examples of a 1-DOF mechanical impact oscillator which serves as stepping stone in the direction of more general systems.

Rapid expansion method (REM) for time‐stepping in reverse time migration (RTM)

KAUST Repository

Pestana, Reynam C.; Stoffa, Paul L.

2009-01-01

an analytical approximation for the Bessel function where we assume that the time step is sufficiently small. From this derivation we find that if we consider only the first two Chebyshev polynomials terms in the rapid expansion method we can obtain the second

Conservative rigid body dynamics by convected base vectors with implicit constraints

DEFF Research Database (Denmark)

Krenk, Steen; Nielsen, Martin Bjerre

2014-01-01

of differential equations without additional algebraic constraints on the base vectors. A discretized form of the equations of motion is obtained by starting from a finite time increment of the Hamiltonian, and retracing the steps of the continuous formulation in discrete form in terms of increments and mean...... of the base vectors. Orthogonality and unit length of the base vectors are imposed by constraining the equivalent Green strain components, and the kinetic energy is represented corresponding to rigid body motion. The equations of motion are obtained via Hamilton’s equations including the zero...... values over each integration time increment. In this discrete form the Lagrange multipliers are given in terms of a representative value within the integration time interval, and the equations of motion are recast into a conservative mean-value and finite difference format. The Lagrange multipliers...

Multi-step-prediction of chaotic time series based on co-evolutionary recurrent neural network

International Nuclear Information System (INIS)

Ma Qianli; Zheng Qilun; Peng Hong; Qin Jiangwei; Zhong Tanwei

2008-01-01

This paper proposes a co-evolutionary recurrent neural network (CERNN) for the multi-step-prediction of chaotic time series, it estimates the proper parameters of phase space reconstruction and optimizes the structure of recurrent neural networks by co-evolutionary strategy. The searching space was separated into two subspaces and the individuals are trained in a parallel computational procedure. It can dynamically combine the embedding method with the capability of recurrent neural network to incorporate past experience due to internal recurrence. The effectiveness of CERNN is evaluated by using three benchmark chaotic time series data sets: the Lorenz series, Mackey-Glass series and real-world sun spot series. The simulation results show that CERNN improves the performances of multi-step-prediction of chaotic time series

Stack Memory Implementation and Analysis of Timing Constraint, Power and Memory using FPGA

DEFF Research Database (Denmark)

Thind, Vandana; Pandey, Nisha; Pandey, Bishwajeet

2017-01-01

real-time output, so that source used to realize the project is not wasted and get an energy efficient design. However, Stack memory is an approach in which information is entered and deleted from the stack memory segment in the pattern of last in first out mechanism. There are several ways...... of implementation of stack memory algorithm but virtex4 and virtex7 low voltage were considered to be the most efficient platforms for its operation. The developed system is energy efficient as the algorim ensures less memory utilization, less power consumption and short time for signal travel.......Abstract— in this work of analysis, stack memory algorithm is implemented on a number of FPGA platforms like virtex4, virtex5, virtex6, virtex6 low power and virtex7 low voltage and very detailed observations/investigations were made about timing constraint, memory and power dissipation. The main...

Long distance communication in the human brain: timing constraints for inter-hemispheric synchrony and the origin of brain lateralization

Directory of Open Access Journals (Sweden)

FRANCISCO ABOITIZ

2003-01-01

Full Text Available Analysis of corpus callosum fiber composition reveals that inter-hemispheric transmission time may put constraints on the development of inter-hemispheric synchronic ensembles, especially in species with large brains like humans. In order to overcome this limitation, a subset of large-diameter callosal fibers are specialized for fast inter-hemispheric transmission, particularly in large-brained species. Nevertheless, the constraints on fast inter-hemispheric communication in large-brained species can somehow contribute to the development of ipsilateral, intrahemispheric networks, which might promote the development of brain lateralization.

A Temporal Concurrent Constraint Programming Calculus

DEFF Research Database (Denmark)

Palamidessi, Catuscia; Valencia Posso, Frank Darwin

2001-01-01

The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus...

Impact Angle and Time Control Guidance Under Field-of-View Constraints and Maneuver Limits

Science.gov (United States)

Shim, Sang-Wook; Hong, Seong-Min; Moon, Gun-Hee; Tahk, Min-Jea

2018-04-01

This paper proposes a guidance law which considers the constraints of seeker field-of-view (FOV) as well as the requirements on impact angle and time. The proposed guidance law is designed for a constant speed missile against a stationary target. The guidance law consists of two terms of acceleration commands. The first one is to achieve zero-miss distance and the desired impact angle, while the second is to meet the desired impact time. To consider the limits of FOV and lateral maneuver capability, a varying-gain approach is applied on the second term. Reduction of realizable impact times due to these limits is then analyzed by finding the longest course among the feasible ones. The performance of the proposed guidance law is demonstrated by numerical simulation for various engagement conditions.

Effect of beamlet step-size on IMRT plan quality

International Nuclear Information System (INIS)

Zhang Guowei; Jiang Ziping; Shepard, David; Earl, Matt; Yu, Cedric

2005-01-01

We have studied the degree to which beamlet step-size impacts the quality of intensity modulated radiation therapy (IMRT) treatment plans. Treatment planning for IMRT begins with the application of a grid that divides each beam's-eye-view of the target into a number of smaller beamlets (pencil beams) of radiation. The total dose is computed as a weighted sum of the dose delivered by the individual beamlets. The width of each beamlet is set to match the width of the corresponding leaf of the multileaf collimator (MLC). The length of each beamlet (beamlet step-size) is parallel to the direction of leaf travel. The beamlet step-size represents the minimum stepping distance of the leaves of the MLC and is typically predetermined by the treatment planning system. This selection imposes an artificial constraint because the leaves of the MLC and the jaws can both move continuously. Removing the constraint can potentially improve the IMRT plan quality. In this study, the optimized results were achieved using an aperture-based inverse planning technique called direct aperture optimization (DAO). We have tested the relationship between pencil beam step-size and plan quality using the American College of Radiology's IMRT test case. For this case, a series of IMRT treatment plans were produced using beamlet step-sizes of 1, 2, 5, and 10 mm. Continuous improvements were seen with each reduction in beamlet step size. The maximum dose to the planning target volume (PTV) was reduced from 134.7% to 121.5% and the mean dose to the organ at risk (OAR) was reduced from 38.5% to 28.2% as the beamlet step-size was reduced from 10 to 1 mm. The smaller pencil beam sizes also led to steeper dose gradients at the junction between the target and the critical structure with gradients of 6.0, 7.6, 8.7, and 9.1 dose%/mm achieved for beamlet step sizes of 10, 5, 2, and 1 mm, respectively

Step-by-step application methodology in practical KEPCO 22.9kV bus-bar system

International Nuclear Information System (INIS)

Yoon, Jae-young; Lee, Seung-yeol

2010-01-01

With the increase of power demand and the progress of power industry deregulation, the transmission and distribution systems will have more complicated problems by the influence of curtailing investment and the NIMBY phenomena in overall power systems. [1-2] It is expected that the route length per MW demand of South Korea will decrease gradually from 0.6[C-km/MW] to 0.53[C-km/MW] in 2010.[3] This comes up to a real serious problem from system planning and operation viewpoints. HTS technologies related to power system have properties to solve these complex transmission and distribution constraints, especially for metropolitan area, in the future. As the HTS technology has developed, the HTS cable technology can be the most effective alternative to solve the future expected power network constraints. This paper describes the application methodology of developing 22.9kV HTS cable by CAST for practical distribution system. 22.9kV HTS cable under development with step-by-step application methodology can substitute the existing and planning conventional 154kV cable.[4-5] If this scheme is applied, part of downtown 154kV substation of metropolitan city such as Seoul can be changed into 22.9kV switching station. Additionally, it can give huge economic, environmental benefits to all of the concerned authorities.

Comparing an Annual and a Daily Time-Step Model for Predicting Field-Scale Phosphorus Loss.

Science.gov (United States)

Bolster, Carl H; Forsberg, Adam; Mittelstet, Aaron; Radcliffe, David E; Storm, Daniel; Ramirez-Avila, John; Sharpley, Andrew N; Osmond, Deanna

2017-11-01

A wide range of mathematical models are available for predicting phosphorus (P) losses from agricultural fields, ranging from simple, empirically based annual time-step models to more complex, process-based daily time-step models. In this study, we compare field-scale P-loss predictions between the Annual P Loss Estimator (APLE), an empirically based annual time-step model, and the Texas Best Management Practice Evaluation Tool (TBET), a process-based daily time-step model based on the Soil and Water Assessment Tool. We first compared predictions of field-scale P loss from both models using field and land management data collected from 11 research sites throughout the southern United States. We then compared predictions of P loss from both models with measured P-loss data from these sites. We observed a strong and statistically significant ( loss between the two models; however, APLE predicted, on average, 44% greater dissolved P loss, whereas TBET predicted, on average, 105% greater particulate P loss for the conditions simulated in our study. When we compared model predictions with measured P-loss data, neither model consistently outperformed the other, indicating that more complex models do not necessarily produce better predictions of field-scale P loss. Our results also highlight limitations with both models and the need for continued efforts to improve their accuracy. Copyright © by the American Society of Agronomy, Crop Science Society of America, and Soil Science Society of America, Inc.

Optimal Pricing and Production Master Planning in a Multiperiod Horizon Considering Capacity and Inventory Constraints

Directory of Open Access Journals (Sweden)

Neale R. Smith

2009-01-01

Full Text Available We formulate and solve a single-item joint pricing and master planning optimization problem with capacity and inventory constrains. The objective is to maximize profits over a discrete-time multiperiod horizon. The solution process consists of two steps. First, we solve the single-period problem exactly. Second, using the exact solution of the single-period problem, we solve the multiperiod problem using a dynamic programming approach. The solution process and the importance of considering both capacity and inventory constraints are illustrated with numerical examples.

Performance environment and nested task constraints influence long jump approach run: a preliminary study.

Science.gov (United States)

Panteli, Flora; Smirniotou, Athanasia; Theodorou, Apostolos

2016-01-01

The purpose of the study was to investigate possible changes at step pattern and technical performance of the long jump approach run in seven young long jumpers by modifying the performance environment (long jump runway versus track lane) and the nested actions (run-through with take-off versus complete long jump). Our findings suggest that the step pattern and technical aspects of the approach run are affected by environmental context and nested task constraints. In terms of environmental context, it appears that practising the training routine of run-through followed by take-off on the long jump runway allows athletes to simulate competition conditions in terms of step regulation and technical efficacy. The task of run-through followed by take-off on the track lane failed to initiate visual perception, step regulation and technical efficiency at the steps preceding the instant of take-off. In terms of nested task constraints, when run-ups were followed by jump for distance instead of only a take-off, a higher level of consistency was achieved and step regulation was based on perception-action coupling. Practising long jump run-up accuracy at a setting not containing the informational elements of the performance environment fails to develop the key elements of the skill.

Incorporating Demand and Supply Constraints into Economic Evaluations in Low-Income and Middle-Income Countries.

Science.gov (United States)

Vassall, Anna; Mangham-Jefferies, Lindsay; Gomez, Gabriela B; Pitt, Catherine; Foster, Nicola

2016-02-01

Global guidelines for new technologies are based on cost and efficacy data from a limited number of trial locations. Country-level decision makers need to consider whether cost-effectiveness analysis used to inform global guidelines are sufficient for their situation or whether to use models that adjust cost-effectiveness results taking into account setting-specific epidemiological and cost heterogeneity. However, demand and supply constraints will also impact cost-effectiveness by influencing the standard of care and the use and implementation of any new technology. These constraints may also vary substantially by setting. We present two case studies of economic evaluations of the introduction of new diagnostics for malaria and tuberculosis control. These case studies are used to analyse how the scope of economic evaluations of each technology expanded to account for and then address demand and supply constraints over time. We use these case studies to inform a conceptual framework that can be used to explore the characteristics of intervention complexity and the influence of demand and supply constraints. Finally, we describe a number of feasible steps that researchers who wish to apply our framework in cost-effectiveness analyses. © 2016 The Authors. Health Economics published by John Wiley & Sons Ltd.

Stability of the high-order finite elements for acoustic or elastic wave propagation with high-order time stepping

KAUST Repository

De Basabe, Joná s D.; Sen, Mrinal K.

2010-01-01

popular in the recent past. We consider the Lax-Wendroff method (LWM) for time stepping and show that it allows for a larger time step than the classical leap-frog finite difference method, with higher-order accuracy. In particular the fourth-order LWM

Sharp Penalty Term and Time Step Bounds for the Interior Penalty Discontinuous Galerkin Method for Linear Hyperbolic Problems

NARCIS (Netherlands)

Geevers, Sjoerd; van der Vegt, J.J.W.

2017-01-01

We present sharp and sucient bounds for the interior penalty term and time step size to ensure stability of the symmetric interior penalty discontinuous Galerkin (SIPDG) method combined with an explicit time-stepping scheme. These conditions hold for generic meshes, including unstructured

A coupled weather generator - rainfall-runoff approach on hourly time steps for flood risk analysis

Science.gov (United States)

Winter, Benjamin; Schneeberger, Klaus; Dung Nguyen, Viet; Vorogushyn, Sergiy; Huttenlau, Matthias; Merz, Bruno; Stötter, Johann

2017-04-01

The evaluation of potential monetary damage of flooding is an essential part of flood risk management. One possibility to estimate the monetary risk is to analyze long time series of observed flood events and their corresponding damages. In reality, however, only few flood events are documented. This limitation can be overcome by the generation of a set of synthetic, physically and spatial plausible flood events and subsequently the estimation of the resulting monetary damages. In the present work, a set of synthetic flood events is generated by a continuous rainfall-runoff simulation in combination with a coupled weather generator and temporal disaggregation procedure for the study area of Vorarlberg (Austria). Most flood risk studies focus on daily time steps, however, the mesoscale alpine study area is characterized by short concentration times, leading to large differences between daily mean and daily maximum discharge. Accordingly, an hourly time step is needed for the simulations. The hourly metrological input for the rainfall-runoff model is generated in a two-step approach. A synthetic daily dataset is generated by a multivariate and multisite weather generator and subsequently disaggregated to hourly time steps with a k-Nearest-Neighbor model. Following the event generation procedure, the negative consequences of flooding are analyzed. The corresponding flood damage for each synthetic event is estimated by combining the synthetic discharge at representative points of the river network with a loss probability relation for each community in the study area. The loss probability relation is based on exposure and susceptibility analyses on a single object basis (residential buildings) for certain return periods. For these impact analyses official inundation maps of the study area are used. Finally, by analyzing the total event time series of damages, the expected annual damage or losses associated with a certain probability of occurrence can be estimated for

Constraint Differentiation

DEFF Research Database (Denmark)

Mödersheim, Sebastian Alexander; Basin, David; Viganò, Luca

2010-01-01

We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation works by eliminating certain kinds of redundancies that arise in the search space when using constraints to represent...... results show that constraint differentiation substantially reduces search and considerably improves the performance of OFMC, enabling its application to a wider class of problems....

Combined Effects of Numerical Method Type and Time Step on Water Stressed Actual Crop ET

Directory of Open Access Journals (Sweden)

B. Ghahraman

2016-02-01

Full Text Available Introduction: Actual crop evapotranspiration (Eta is important in hydrologic modeling and irrigation water management issues. Actual ET depends on an estimation of a water stress index and average soil water at crop root zone, and so depends on a chosen numerical method and adapted time step. During periods with no rainfall and/or irrigation, actual ET can be computed analytically or by using different numerical methods. Overal, there are many factors that influence actual evapotranspiration. These factors are crop potential evapotranspiration, available root zone water content, time step, crop sensitivity, and soil. In this paper different numerical methods are compared for different soil textures and different crops sensitivities. Materials and Methods: During a specific time step with no rainfall or irrigation, change in soil water content would be equal to evapotranspiration, ET. In this approach, however, deep percolation is generally ignored due to deep water table and negligible unsaturated hydraulic conductivity below rooting depth. This differential equation may be solved analytically or numerically considering different algorithms. We adapted four different numerical methods, as explicit, implicit, and modified Euler, midpoint method, and 3-rd order Heun method to approximate the differential equation. Three general soil types of sand, silt, and clay, and three different crop types of sensitive, moderate, and resistant under Nishaboor plain were used. Standard soil fraction depletion (corresponding to ETc=5 mm.d-1, pstd, below which crop faces water stress is adopted for crop sensitivity. Three values for pstd were considered in this study to cover the common crops in the area, including winter wheat and barley, cotton, alfalfa, sugar beet, saffron, among the others. Based on this parameter, three classes for crop sensitivity was considered, sensitive crops with pstd=0.2, moderate crops with pstd=0.5, and resistive crops with pstd=0

ChromAlign: A two-step algorithmic procedure for time alignment of three-dimensional LC-MS chromatographic surfaces.

Science.gov (United States)

Sadygov, Rovshan G; Maroto, Fernando Martin; Hühmer, Andreas F R

2006-12-15

We present an algorithmic approach to align three-dimensional chromatographic surfaces of LC-MS data of complex mixture samples. The approach consists of two steps. In the first step, we prealign chromatographic profiles: two-dimensional projections of chromatographic surfaces. This is accomplished by correlation analysis using fast Fourier transforms. In this step, a temporal offset that maximizes the overlap and dot product between two chromatographic profiles is determined. In the second step, the algorithm generates correlation matrix elements between full mass scans of the reference and sample chromatographic surfaces. The temporal offset from the first step indicates a range of the mass scans that are possibly correlated, then the correlation matrix is calculated only for these mass scans. The correlation matrix carries information on highly correlated scans, but it does not itself determine the scan or time alignment. Alignment is determined as a path in the correlation matrix that maximizes the sum of the correlation matrix elements. The computational complexity of the optimal path generation problem is reduced by the use of dynamic programming. The program produces time-aligned surfaces. The use of the temporal offset from the first step in the second step reduces the computation time for generating the correlation matrix and speeds up the process. The algorithm has been implemented in a program, ChromAlign, developed in C++ language for the .NET2 environment in WINDOWS XP. In this work, we demonstrate the applications of ChromAlign to alignment of LC-MS surfaces of several datasets: a mixture of known proteins, samples from digests of surface proteins of T-cells, and samples prepared from digests of cerebrospinal fluid. ChromAlign accurately aligns the LC-MS surfaces we studied. In these examples, we discuss various aspects of the alignment by ChromAlign, such as constant time axis shifts and warping of chromatographic surfaces.

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

Optimum filters with time width constraints for liquid argon total-absorption detectors

International Nuclear Information System (INIS)

Gatti, E.; Radeka, V.

1977-10-01

Optimum filter responses are found for triangular current input pulses occurring in liquid argon ionization chambers used as total absorption detectors. The filters considered are subject to the following constraints: finite width of the output pulse having a prescribed ratio to the width of the triangular input current pulse and zero area of a bipolar antisymmetrical pulse or of a three lobe pulse, as required for high event rates. The feasibility of pulse shaping giving an output equal to, or shorter than, the input one is demonstrated. It is shown that the signal-to-noise ratio remains constant for the chamber interelectrode gap which gives an input pulse width (i.e., electron drift time) greater than one third of the required output pulse width

Verifying Real-Time Systems using Explicit-time Description Methods

Directory of Open Access Journals (Sweden)

Hao Wang

2009-12-01

Full Text Available Timed model checking has been extensively researched in recent years. Many new formalisms with time extensions and tools based on them have been presented. On the other hand, Explicit-Time Description Methods aim to verify real-time systems with general untimed model checkers. Lamport presented an explicit-time description method using a clock-ticking process (Tick to simulate the passage of time together with a group of global variables for time requirements. This paper proposes a new explicit-time description method with no reliance on global variables. Instead, it uses rendezvous synchronization steps between the Tick process and each system process to simulate time. This new method achieves better modularity and facilitates usage of more complex timing constraints. The two explicit-time description methods are implemented in DIVINE, a well-known distributed-memory model checker. Preliminary experiment results show that our new method, with better modularity, is comparable to Lamport's method with respect to time and memory efficiency.

Time step size limitation introduced by the BSSN Gamma Driver

Energy Technology Data Exchange (ETDEWEB)

Schnetter, Erik, E-mail: schnetter@cct.lsu.ed [Department of Physics and Astronomy, Louisiana State University, LA (United States)

2010-08-21

Many mesh refinement simulations currently performed in numerical relativity counteract instabilities near the outer boundary of the simulation domain either by changes to the mesh refinement scheme or by changes to the gauge condition. We point out that the BSSN Gamma Driver gauge condition introduces a time step size limitation in a similar manner as a Courant-Friedrichs-Lewy condition, but which is independent of the spatial resolution. We give a didactic explanation of this issue, show why, especially, mesh refinement simulations suffer from it, and point to a simple remedy. (note)

Evaluating the impact of spatio-temporal smoothness constraints on the BOLD hemodynamic response function estimation: an analysis based on Tikhonov regularization

International Nuclear Information System (INIS)

Casanova, R; Yang, L; Hairston, W D; Laurienti, P J; Maldjian, J A

2009-01-01

Recently we have proposed the use of Tikhonov regularization with temporal smoothness constraints to estimate the BOLD fMRI hemodynamic response function (HRF). The temporal smoothness constraint was imposed on the estimates by using second derivative information while the regularization parameter was selected based on the generalized cross-validation function (GCV). Using one-dimensional simulations, we previously found this method to produce reliable estimates of the HRF time course, especially its time to peak (TTP), being at the same time fast and robust to over-sampling in the HRF estimation. Here, we extend the method to include simultaneous temporal and spatial smoothness constraints. This method does not need Gaussian smoothing as a pre-processing step as usually done in fMRI data analysis. We carried out two-dimensional simulations to compare the two methods: Tikhonov regularization with temporal (Tik-GCV-T) and spatio-temporal (Tik-GCV-ST) smoothness constraints on the estimated HRF. We focus our attention on quantifying the influence of the Gaussian data smoothing and the presence of edges on the performance of these techniques. Our results suggest that the spatial smoothing introduced by regularization is less severe than that produced by Gaussian smoothing. This allows more accurate estimates of the response amplitudes while producing similar estimates of the TTP. We illustrate these ideas using real data. (note)

A new algorithm for combined dynamic economic emission dispatch with security constraints

International Nuclear Information System (INIS)

Arul, R.; Velusami, S.; Ravi, G.

2015-01-01

The primary objective of CDEED (combined dynamic economic emission dispatch) problem is to determine the optimal power generation schedule for the online generating units over a time horizon considered and simultaneously minimizing the emission level and satisfying the generators and system constraints. The CDEED problem is bi-objective optimization problem, where generation cost and emission are considered as two competing objective functions. This bi-objective CDEED problem is represented as a single objective optimization problem by assigning different weights for each objective functions. The weights are varied in steps and for each variation one compromise solution are generated and finally fuzzy based selection method is used to select the best compromise solution from the set of compromise solutions obtained. In order to reflect the test systems considered as real power system model, the security constraints are also taken into account. Three new versions of DHS (differential harmony search) algorithms have been proposed to solve the CDEED problems. The feasibility of the proposed algorithms is demonstrated on IEEE-26 and IEEE-39 bus systems. The result obtained by the proposed CSADHS (chaotic self-adaptive differential harmony search) algorithm is found to be better than EP (evolutionary programming), DHS, and the other proposed algorithms in terms of solution quality, convergence speed and computation time. - Highlights: • In this paper, three new algorithms CDHS, SADHS and CSADHS are proposed. • To solve DED with emission, poz's, spinning reserve and security constraints. • Results obtained by the proposed CSADHS algorithm are better than others. • The proposed CSADHS algorithm has fast convergence characteristic than others

Effects of the lateral amplitude and regularity of upper body fluctuation on step time variability evaluated using return map analysis.

Science.gov (United States)

Chidori, Kazuhiro; Yamamoto, Yuji

2017-01-01

The aim of this study was to evaluate the effects of the lateral amplitude and regularity of upper body fluctuation on step time variability. Return map analysis was used to clarify the relationship between step time variability and a history of falling. Eleven healthy, community-dwelling older adults and twelve younger adults participated in the study. All of the subjects walked 25 m at a comfortable speed. Trunk acceleration was measured using triaxial accelerometers attached to the third lumbar vertebrae (L3) and the seventh cervical vertebrae (C7). The normalized average magnitude of acceleration, the coefficient of determination ($R^2$) of the return map, and the step time variabilities, were calculated. Cluster analysis using the average fluctuation and the regularity of C7 fluctuation identified four walking patterns in the mediolateral (ML) direction. The participants with higher fluctuation and lower regularity showed significantly greater step time variability compared with the others. Additionally, elderly participants who had fallen in the past year had higher amplitude and a lower regularity of fluctuation during walking. In conclusion, by focusing on the time evolution of each step, it is possible to understand the cause of stride and/or step time variability that is associated with a risk of falls.

Real-time inextensible surgical thread simulation.

Science.gov (United States)

Xu, Lang; Liu, Qian

2018-03-27

This paper discusses a real-time simulation method of inextensible surgical thread based on the Cosserat rod theory using position-based dynamics (PBD). The method realizes stable twining and knotting of surgical thread while including inextensibility, bending, twisting and coupling effects. The Cosserat rod theory is used to model the nonlinear elastic behavior of surgical thread. The surgical thread model is solved with PBD to achieve a real-time, extremely stable simulation. Due to the one-dimensional linear structure of surgical thread, the direct solution of the distance constraint based on tridiagonal matrix algorithm is used to enhance stretching resistance in every constraint projection iteration. In addition, continuous collision detection and collision response guarantee a large time step and high performance. Furthermore, friction is integrated into the constraint projection process to stabilize the twining of multiple threads and complex contact situations. Through comparisons with existing methods, the surgical thread maintains constant length under large deformation after applying the direct distance constraint in our method. The twining and knotting of multiple threads correspond to stable solutions to contact and friction forces. A surgical suture scene is also modeled to demonstrate the practicality and simplicity of our method. Our method achieves stable and fast simulation of inextensible surgical thread. Benefiting from the unified particle framework, the rigid body, elastic rod, and soft body can be simultaneously simulated. The method is appropriate for applications in virtual surgery that require multiple dynamic bodies.

Development and evaluation of a real-time one step Reverse-Transcriptase PCR for quantitation of Chandipura Virus

Directory of Open Access Journals (Sweden)

Tandale Babasaheb V

2008-12-01

Full Text Available Abstract Background Chandipura virus (CHPV, a member of family Rhabdoviridae was attributed to an explosive outbreak of acute encephalitis in children in Andhra Pradesh, India in 2003 and a small outbreak among tribal children from Gujarat, Western India in 2004. The case-fatality rate ranged from 55–75%. Considering the rapid progression of the disease and high mortality, a highly sensitive method for quantifying CHPV RNA by real-time one step reverse transcriptase PCR (real-time one step RT-PCR using TaqMan technology was developed for rapid diagnosis. Methods Primers and probe for P gene were designed and used to standardize real-time one step RT-PCR assay for CHPV RNA quantitation. Standard RNA was prepared by PCR amplification, TA cloning and run off transcription. The optimized real-time one step RT-PCR assay was compared with the diagnostic nested RT-PCR and different virus isolation systems [in vivo (mice in ovo (eggs, in vitro (Vero E6, PS, RD and Sand fly cell line] for the detection of CHPV. Sensitivity and specificity of real-time one step RT-PCR assay was evaluated with diagnostic nested RT-PCR, which is considered as a gold standard. Results Real-time one step RT-PCR was optimized using in vitro transcribed (IVT RNA. Standard curve showed linear relationship for wide range of 102-1010 (r2 = 0.99 with maximum Coefficient of variation (CV = 5.91% for IVT RNA. The newly developed real-time RT-PCR was at par with nested RT-PCR in sensitivity and superior to cell lines and other living systems (embryonated eggs and infant mice used for the isolation of the virus. Detection limit of real-time one step RT-PCR and nested RT-PCR was found to be 1.2 × 100 PFU/ml. RD cells, sand fly cells, infant mice, and embryonated eggs showed almost equal sensitivity (1.2 × 102 PFU/ml. Vero and PS cell-lines (1.2 × 103 PFU/ml were least sensitive to CHPV infection. Specificity of the assay was found to be 100% when RNA from other viruses or healthy

Time Discretization Techniques

KAUST Repository

Gottlieb, S.

2016-10-12

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

Constraint-based Attribute and Interval Planning

Science.gov (United States)

Jonsson, Ari; Frank, Jeremy

2013-01-01

In this paper we describe Constraint-based Attribute and Interval Planning (CAIP), a paradigm for representing and reasoning about plans. The paradigm enables the description of planning domains with time, resources, concurrent activities, mutual exclusions among sets of activities, disjunctive preconditions and conditional effects. We provide a theoretical foundation for the paradigm, based on temporal intervals and attributes. We then show how the plans are naturally expressed by networks of constraints, and show that the process of planning maps directly to dynamic constraint reasoning. In addition, we de ne compatibilities, a compact mechanism for describing planning domains. We describe how this framework can incorporate the use of constraint reasoning technology to improve planning. Finally, we describe EUROPA, an implementation of the CAIP framework.

Method for Determining the Time Parameter

Directory of Open Access Journals (Sweden)

K. P. Baslyk

2014-01-01

values of multipliers and parameter of penalty. The solving problem of the optimization without constraints is one step of the optimization problem with constraints.The proposed method was realized as a computational Pascal-language program. There is the multiple call of Runge-Kutta method procedure for integration of motion equations. To reduce operation-use time, normalization of motion equations is used, and the 4-th order RungeKutta method time step accuracy control is also applied.The program test results were compared with the solution, which was obtained using the existing software for the one stage missile design.The general results obtained in this paper are following: numerical determination method of the attack angle time parameter and maximum allowed value of the attack angle amplitude as functions of the projected and ballistic parameters; software implementation of this method. Deviation of angle trajectory value at the end of active trajectory leg as a function of the error of the time parameter was obtained as well. This paper can be used in the courses of learning such as “Introduction to rocketry” and “Launch vehicle design”.

Real-time, single-step bioassay using nanoplasmonic resonator with ultra-high sensitivity

Energy Technology Data Exchange (ETDEWEB)

Zhang, Xiang; Ellman, Jonathan A; Chen, Fanqing Frank; Su, Kai-Hang; Wei, Qi-Huo; Sun, Cheng

2014-04-01

A nanoplasmonic resonator (NPR) comprising a metallic nanodisk with alternating shielding layer(s), having a tagged biomolecule conjugated or tethered to the surface of the nanoplasmonic resonator for highly sensitive measurement of enzymatic activity. NPRs enhance Raman signals in a highly reproducible manner, enabling fast detection of protease and enzyme activity, such as Prostate Specific Antigen (paPSA), in real-time, at picomolar sensitivity levels. Experiments on extracellular fluid (ECF) from paPSA-positive cells demonstrate specific detection in a complex bio-fluid background in real-time single-step detection in very small sample volumes.

Memory State Feedback RMPC for Multiple Time-Delayed Uncertain Linear Systems with Input Constraints

Directory of Open Access Journals (Sweden)

Wei-Wei Qin

2014-01-01

Full Text Available This paper focuses on the problem of asymptotic stabilization for a class of discrete-time multiple time-delayed uncertain linear systems with input constraints. Then, based on the predictive control principle of receding horizon optimization, a delayed state dependent quadratic function is considered for incorporating MPC problem formulation. By developing a memory state feedback controller, the information of the delayed plant states can be taken into full consideration. The MPC problem is formulated to minimize the upper bound of infinite horizon cost that satisfies the sufficient conditions. Then, based on the Lyapunov-Krasovskii function, a delay-dependent sufficient condition in terms of linear matrix inequality (LMI can be derived to design a robust MPC algorithm. Finally, the digital simulation results prove availability of the proposed method.

New Results on Robust Model Predictive Control for Time-Delay Systems with Input Constraints

Directory of Open Access Journals (Sweden)

Qing Lu

2014-01-01

Full Text Available This paper investigates the problem of model predictive control for a class of nonlinear systems subject to state delays and input constraints. The time-varying delay is considered with both upper and lower bounds. A new model is proposed to approximate the delay. And the uncertainty is polytopic type. For the state-feedback MPC design objective, we formulate an optimization problem. Under model transformation, a new model predictive controller is designed such that the robust asymptotical stability of the closed-loop system can be guaranteed. Finally, the applicability of the presented results are demonstrated by a practical example.

Integrating viscoelastic mass spring dampers into position-based dynamics to simulate soft tissue deformation in real time.

Science.gov (United States)

Xu, Lang; Lu, Yuhua; Liu, Qian

2018-02-01

We propose a novel method to simulate soft tissue deformation for virtual surgery applications. The method considers the mechanical properties of soft tissue, such as its viscoelasticity, nonlinearity and incompressibility; its speed, stability and accuracy also meet the requirements for a surgery simulator. Modifying the traditional equation for mass spring dampers (MSD) introduces nonlinearity and viscoelasticity into the calculation of elastic force. Then, the elastic force is used in the constraint projection step for naturally reducing constraint potential. The node position is enforced by the combined spring force and constraint conservative force through Newton's second law. We conduct a comparison study of conventional MSD and position-based dynamics for our new integrating method. Our approach enables stable, fast and large step simulation by freely controlling visual effects based on nonlinearity, viscoelasticity and incompressibility. We implement a laparoscopic cholecystectomy simulator to demonstrate the practicality of our method, in which liver and gallbladder deformation can be simulated in real time. Our method is an appropriate choice for the development of real-time virtual surgery applications.

A Time-Dependent Λ and G Cosmological Model Consistent with Cosmological Constraints

Directory of Open Access Journals (Sweden)

L. Kantha

2016-01-01

Full Text Available The prevailing constant Λ-G cosmological model agrees with observational evidence including the observed red shift, Big Bang Nucleosynthesis (BBN, and the current rate of acceleration. It assumes that matter contributes 27% to the current density of the universe, with the rest (73% coming from dark energy represented by the Einstein cosmological parameter Λ in the governing Friedmann-Robertson-Walker equations, derived from Einstein’s equations of general relativity. However, the principal problem is the extremely small value of the cosmological parameter (~10−52 m2. Moreover, the dark energy density represented by Λ is presumed to have remained unchanged as the universe expanded by 26 orders of magnitude. Attempts to overcome this deficiency often invoke a variable Λ-G model. Cosmic constraints from action principles require that either both G and Λ remain time-invariant or both vary in time. Here, we propose a variable Λ-G cosmological model consistent with the latest red shift data, the current acceleration rate, and BBN, provided the split between matter and dark energy is 18% and 82%. Λ decreases (Λ~τ-2, where τ is the normalized cosmic time and G increases (G~τn with cosmic time. The model results depend only on the chosen value of Λ at present and in the far future and not directly on G.

Stepping reaction time and gait adaptability are significantly impaired in people with Parkinson's disease: Implications for fall risk.

Science.gov (United States)

Caetano, Maria Joana D; Lord, Stephen R; Allen, Natalie E; Brodie, Matthew A; Song, Jooeun; Paul, Serene S; Canning, Colleen G; Menant, Jasmine C

2018-02-01

Decline in the ability to take effective steps and to adapt gait, particularly under challenging conditions, may be important reasons why people with Parkinson's disease (PD) have an increased risk of falling. This study aimed to determine the extent of stepping and gait adaptability impairments in PD individuals as well as their associations with PD symptoms, cognitive function and previous falls. Thirty-three older people with PD and 33 controls were assessed in choice stepping reaction time, Stroop stepping and gait adaptability tests; measurements identified as fall risk factors in older adults. People with PD had similar mean choice stepping reaction times to healthy controls, but had significantly greater intra-individual variability. In the Stroop stepping test, the PD participants were more likely to make an error (48 vs 18%), took 715 ms longer to react (2312 vs 1517 ms) and had significantly greater response variability (536 vs 329 ms) than the healthy controls. People with PD also had more difficulties adapting their gait in response to targets (poorer stepping accuracy) and obstacles (increased number of steps) appearing at short notice on a walkway. Within the PD group, higher disease severity, reduced cognition and previous falls were associated with poorer stepping and gait adaptability performances. People with PD have reduced ability to adapt gait to unexpected targets and obstacles and exhibit poorer stepping responses, particularly in a test condition involving conflict resolution. Such impaired stepping responses in Parkinson's disease are associated with disease severity, cognitive impairment and falls. Copyright © 2017 Elsevier Ltd. All rights reserved.

HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.

Science.gov (United States)

Darmoni, S J; Fajner, A; Mahé, N; Leforestier, A; Vondracek, M; Stelian, O; Baldenweck, M

1995-01-01

Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.

The perceived constraints, motivation, and physical activity levels of ...

African Journals Online (AJOL)

The purpose of this research was threefold; Are Korean youth physically active to promote health during leisure time? What constraints to physical active do youth experience during leisure time? Are there relationships among constraints, motivation, and physical activity level? Of 1 280 youth randomly selected by a ...

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

Bocewicz, G.; Nielsen, Izabela Ewa; Banaszak, Z.

2013-01-01

Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro......Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research...... is to provide a declarative model enabling to state a constraint satisfaction problem aimed at AGVs fleet scheduling subject to assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured...... orders, the main objective is to provide the declarative framework aimed at conditions allowing one to calculate the AGVs fleet schedule in online mode. An illustrative example of the relevant algebra-like driven step-by-stem cyclic scheduling is provided....

Multiple-time-stepping generalized hybrid Monte Carlo methods

Energy Technology Data Exchange (ETDEWEB)

Escribano, Bruno, E-mail: bescribano@bcamath.org [BCAM—Basque Center for Applied Mathematics, E-48009 Bilbao (Spain); Akhmatskaya, Elena [BCAM—Basque Center for Applied Mathematics, E-48009 Bilbao (Spain); IKERBASQUE, Basque Foundation for Science, E-48013 Bilbao (Spain); Reich, Sebastian [Universität Potsdam, Institut für Mathematik, D-14469 Potsdam (Germany); Azpiroz, Jon M. [Kimika Fakultatea, Euskal Herriko Unibertsitatea (UPV/EHU) and Donostia International Physics Center (DIPC), P.K. 1072, Donostia (Spain)

2015-01-01

Performance of the generalized shadow hybrid Monte Carlo (GSHMC) method [1], which proved to be superior in sampling efficiency over its predecessors [2–4], molecular dynamics and hybrid Monte Carlo, can be further improved by combining it with multi-time-stepping (MTS) and mollification of slow forces. We demonstrate that the comparatively simple modifications of the method not only lead to better performance of GSHMC itself but also allow for beating the best performed methods, which use the similar force splitting schemes. In addition we show that the same ideas can be successfully applied to the conventional generalized hybrid Monte Carlo method (GHMC). The resulting methods, MTS-GHMC and MTS-GSHMC, provide accurate reproduction of thermodynamic and dynamical properties, exact temperature control during simulation and computational robustness and efficiency. MTS-GHMC uses a generalized momentum update to achieve weak stochastic stabilization to the molecular dynamics (MD) integrator. MTS-GSHMC adds the use of a shadow (modified) Hamiltonian to filter the MD trajectories in the HMC scheme. We introduce a new shadow Hamiltonian formulation adapted to force-splitting methods. The use of such Hamiltonians improves the acceptance rate of trajectories and has a strong impact on the sampling efficiency of the method. Both methods were implemented in the open-source MD package ProtoMol and were tested on a water and a protein systems. Results were compared to those obtained using a Langevin Molly (LM) method [5] on the same systems. The test results demonstrate the superiority of the new methods over LM in terms of stability, accuracy and sampling efficiency. This suggests that putting the MTS approach in the framework of hybrid Monte Carlo and using the natural stochasticity offered by the generalized hybrid Monte Carlo lead to improving stability of MTS and allow for achieving larger step sizes in the simulation of complex systems.

Comparison of methods to identify crop productivity constraints in developing countries. A review

NARCIS (Netherlands)

Kraaijvanger, R.G.M.; Sonneveld, M.P.W.; Almekinders, C.J.M.; Veldkamp, T.

2015-01-01

Selecting a method for identifying actual crop productivity constraints is an important step for triggering innovation processes. Applied methods can be diverse and although such methods have consequences for the design of intervention strategies, documented comparisons between various methods are

Modifier constraint in alkali borophosphate glasses using topological constraint theory

Energy Technology Data Exchange (ETDEWEB)

Li, Xiang [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Zeng, Huidan, E-mail: hdzeng@ecust.edu.cn [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Jiang, Qi [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Zhao, Donghui [Unifrax Corporation, Niagara Falls, NY 14305 (United States); Chen, Guorong [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Wang, Zhaofeng; Sun, Luyi [Department of Chemical & Biomolecular Engineering and Polymer Program, Institute of Materials Science, University of Connecticut, Storrs, CT 06269 (United States); Chen, Jianding [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China)

2016-12-01

In recent years, composition-dependent properties of glasses have been successfully predicted using the topological constraint theory. The constraints of the glass network are derived from two main parts: network formers and network modifiers. The constraints of the network formers can be calculated on the basis of the topological structure of the glass. However, the latter cannot be accurately calculated in this way, because of the existing of ionic bonds. In this paper, the constraints of the modifier ions in phosphate glasses were thoroughly investigated using the topological constraint theory. The results show that the constraints of the modifier ions are gradually increased with the addition of alkali oxides. Furthermore, an improved topological constraint theory for borophosphate glasses is proposed by taking the composition-dependent constraints of the network modifiers into consideration. The proposed theory is subsequently evaluated by analyzing the composition dependence of the glass transition temperature in alkali borophosphate glasses. This method is supposed to be extended to other similar glass systems containing alkali ions.

Microsoft Office professional 2010 step by step

CERN Document Server

Cox, Joyce; Frye, Curtis

2011-01-01

Teach yourself exactly what you need to know about using Office Professional 2010-one step at a time! With STEP BY STEP, you build and practice new skills hands-on, at your own pace. Covering Microsoft Word, PowerPoint, Outlook, Excel, Access, Publisher, and OneNote, this book will help you learn the core features and capabilities needed to: Create attractive documents, publications, and spreadsheetsManage your e-mail, calendar, meetings, and communicationsPut your business data to workDevelop and deliver great presentationsOrganize your ideas and notes in one placeConnect, share, and accom

The enhancement of time-stepping procedures in SYVAC A/C

International Nuclear Information System (INIS)

Broyd, T.W.

1986-01-01

This report summarises the work carried out an SYVAC A/C between February and May 1985 aimed at improving the way in which time-stepping procedures are handled. The majority of the work was concerned with three types of problem, viz: i) Long vault release, short geosphere response ii) Short vault release, long geosphere response iii) Short vault release, short geosphere response The report contains details of changes to the logic and structure of SYVAC A/C, as well as the results of code implementation tests. It has been written primarily for members of the UK SYVAC development team, and should not be used or referred to in isolation. (author)

Performance of an attention-demanding task during treadmill walking shifts the noise qualities of step-to-step variation in step width.

Science.gov (United States)

Grabiner, Mark D; Marone, Jane R; Wyatt, Marilynn; Sessoms, Pinata; Kaufman, Kenton R

2018-06-01

The fractal scaling evident in the step-to-step fluctuations of stepping-related time series reflects, to some degree, neuromotor noise. The primary purpose of this study was to determine the extent to which the fractal scaling of step width, step width and step width variability are affected by performance of an attention-demanding task. We hypothesized that the attention-demanding task would shift the structure of the step width time series toward white, uncorrelated noise. Subjects performed two 10-min treadmill walking trials, a control trial of undisturbed walking and a trial during which they performed a mental arithmetic/texting task. Motion capture data was converted to step width time series, the fractal scaling of which were determined from their power spectra. Fractal scaling decreased by 22% during the texting condition (p Step width and step width variability increased 19% and five percent, respectively (p step width fractal scaling. The change of the fractal scaling of step width is consistent with increased cognitive demand and suggests a transition in the characteristics of the signal noise. This may reflect an important advance toward the understanding of the manner in which neuromotor noise contributes to some types of falls. However, further investigation of the repeatability of the results, the sensitivity of the results to progressive increases in cognitive load imposed by attention-demanding tasks, and the extent to which the results can be generalized to the gait of older adults seems warranted. Copyright © 2018 Elsevier B.V. All rights reserved.

Discrete maximal regularity of time-stepping schemes for fractional evolution equations.

Science.gov (United States)

Jin, Bangti; Li, Buyang; Zhou, Zhi

2018-01-01

In this work, we establish the maximal [Formula: see text]-regularity for several time stepping schemes for a fractional evolution model, which involves a fractional derivative of order [Formula: see text], [Formula: see text], in time. These schemes include convolution quadratures generated by backward Euler method and second-order backward difference formula, the L1 scheme, explicit Euler method and a fractional variant of the Crank-Nicolson method. The main tools for the analysis include operator-valued Fourier multiplier theorem due to Weis (Math Ann 319:735-758, 2001. doi:10.1007/PL00004457) and its discrete analogue due to Blunck (Stud Math 146:157-176, 2001. doi:10.4064/sm146-2-3). These results generalize the corresponding results for parabolic problems.

Comparison of step-by-step kinematics of resisted, assisted and unloaded 20-m sprint runs.

Science.gov (United States)

van den Tillaar, Roland; Gamble, Paul

2018-03-26

This investigation examined step-by-step kinematics of sprint running acceleration. Using a randomised counterbalanced approach, 37 female team handball players (age 17.8 ± 1.6 years, body mass 69.6 ± 9.1 kg, height 1.74 ± 0.06 m) performed resisted, assisted and unloaded 20-m sprints within a single session. 20-m sprint times and step velocity, as well as step length, step frequency, contact and flight times of each step were evaluated for each condition with a laser gun and an infrared mat. Almost all measured parameters were altered for each step under the resisted and assisted sprint conditions (η 2  ≥ 0.28). The exception was step frequency, which did not differ between assisted and normal sprints. Contact time, flight time and step frequency at almost each step were different between 'fast' vs. 'slow' sub-groups (η 2  ≥ 0.22). Nevertheless overall both groups responded similarly to the respective sprint conditions. No significant differences in step length were observed between groups for the respective condition. It is possible that continued exposure to assisted sprinting might allow the female team-sports players studied to adapt their coordination to the 'over-speed' condition and increase step frequency. It is notable that step-by-step kinematics in these sprints were easy to obtain using relatively inexpensive equipment with possibilities of direct feedback.

Steps of Supercritical Fluid Extraction of Natural Products and Their Characteristic Times

OpenAIRE

Sovová, H. (Helena)

2012-01-01

Kinetics of supercritical fluid extraction (SFE) from plants is variable due to different micro-structure of plants and their parts, different properties of extracted substances and solvents, and different flow patterns in the extractor. Variety of published mathematical models for SFE of natural products corresponds to this diversification. This study presents simplified equations of extraction curves in terms of characteristic times of four single extraction steps: internal diffusion, exter...

Stabilization Methods for the Integration of DAE in the Presence of Redundant Constraints

International Nuclear Information System (INIS)

Neto, Maria Augusta; Ambrosio, Jorge

2003-01-01

The use of multibody formulations based on Cartesian or natural coordinates lead to sets of differential-algebraic equations that have to be solved. The difficulty in providing compatible initial positions and velocities for a general spatial multibody model and the finite precision of such data result in initial errors that must be corrected during the forward dynamic solution of the system equations of motion.As the position and velocity constraint equations are not explicitly involved in the solution procedure, any integration error leads to the violation of these equations in the long run. Another problem that is very often impossible to avoid is the presence of redundant constraints.Even with no initial redundancy it is possible for some systems to achieve singular configurations in which kinematic constraints become temporarily redundant. In this work several procedures to stabilize the solution of the equations of motion and to handle redundant constraints are revisited. The Baumgarte stabilization, augmented Lagrangian and coordinate partitioning methods are discussed in terms of their efficiency and computational costs. The LU factorization with full pivoting of the Jacobian matrix directs the choice of the set of independent coordinates, required by the coordinate partitioning method.Even when no particular stabilization method is used, a Newton-Raphson iterative procedure is still required in the initial time step to correct the initial positions and velocities, thus requiring the selection of the independent coordinates. However, this initial selection does not guarantee that during the motion of the system other constraints do not become redundant. Two procedures based on the single value decomposition and Gram-Schmidt orthogonalization are revisited for the purpose. The advantages and drawbacks of the different procedures,used separately or in conjunction with each other and their computational costs are finally discussed

A one-step, real-time PCR assay for rapid detection of rhinovirus.

Science.gov (United States)

Do, Duc H; Laus, Stella; Leber, Amy; Marcon, Mario J; Jordan, Jeanne A; Martin, Judith M; Wadowsky, Robert M

2010-01-01

One-step, real-time PCR assays for rhinovirus have been developed for a limited number of PCR amplification platforms and chemistries, and some exhibit cross-reactivity with genetically similar enteroviruses. We developed a one-step, real-time PCR assay for rhinovirus by using a sequence detection system (Applied Biosystems; Foster City, CA). The primers were designed to amplify a 120-base target in the noncoding region of picornavirus RNA, and a TaqMan (Applied Biosystems) degenerate probe was designed for the specific detection of rhinovirus amplicons. The PCR assay had no cross-reactivity with a panel of 76 nontarget nucleic acids, which included RNAs from 43 enterovirus strains. Excellent lower limits of detection relative to viral culture were observed for the PCR assay by using 38 of 40 rhinovirus reference strains representing different serotypes, which could reproducibly detect rhinovirus serotype 2 in viral transport medium containing 10 to 10,000 TCID(50) (50% tissue culture infectious dose endpoint) units/ml of the virus. However, for rhinovirus serotypes 59 and 69, the PCR assay was less sensitive than culture. Testing of 48 clinical specimens from children with cold-like illnesses for rhinovirus by the PCR and culture assays yielded detection rates of 16.7% and 6.3%, respectively. For a batch of 10 specimens, the entire assay was completed in 4.5 hours. This real-time PCR assay enables detection of many rhinovirus serotypes with the Applied Biosystems reagent-instrument platform.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

Science.gov (United States)

Sleesongsom, S.; Bureerat, S.

2018-03-01

This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

A Random Walk Approach to Query Informative Constraints for Clustering.

Science.gov (United States)

Abin, Ahmad Ali

2017-08-09

This paper presents a random walk approach to the problem of querying informative constraints for clustering. The proposed method is based on the properties of the commute time, that is the expected time taken for a random walk to travel between two nodes and return, on the adjacency graph of data. Commute time has the nice property of that, the more short paths connect two given nodes in a graph, the more similar those nodes are. Since computing the commute time takes the Laplacian eigenspectrum into account, we use this property in a recursive fashion to query informative constraints for clustering. At each recursion, the proposed method constructs the adjacency graph of data and utilizes the spectral properties of the commute time matrix to bipartition the adjacency graph. Thereafter, the proposed method benefits from the commute times distance on graph to query informative constraints between partitions. This process iterates for each partition until the stop condition becomes true. Experiments on real-world data show the efficiency of the proposed method for constraints selection.

Analytical design of an industrial two-term controller for optimal regulatory control of open-loop unstable processes under operational constraints.

Science.gov (United States)

Tchamna, Rodrigue; Lee, Moonyong

2018-01-01

This paper proposes a novel optimization-based approach for the design of an industrial two-term proportional-integral (PI) controller for the optimal regulatory control of unstable processes subjected to three common operational constraints related to the process variable, manipulated variable and its rate of change. To derive analytical design relations, the constrained optimal control problem in the time domain was transformed into an unconstrained optimization problem in a new parameter space via an effective parameterization. The resulting optimal PI controller has been verified to yield optimal performance and stability of an open-loop unstable first-order process under operational constraints. The proposed analytical design method explicitly takes into account the operational constraints in the controller design stage and also provides useful insights into the optimal controller design. Practical procedures for designing optimal PI parameters and a feasible constraint set exclusive of complex optimization steps are also proposed. The proposed controller was compared with several other PI controllers to illustrate its performance. The robustness of the proposed controller against plant-model mismatch has also been investigated. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Issues in measure-preserving three dimensional flow integrators: Self-adjointness, reversibility, and non-uniform time stepping

International Nuclear Information System (INIS)

Finn, John M.

2015-01-01

Properties of integration schemes for solenoidal fields in three dimensions are studied, with a focus on integrating magnetic field lines in a plasma using adaptive time stepping. It is shown that implicit midpoint (IM) and a scheme we call three-dimensional leapfrog (LF) can do a good job (in the sense of preserving KAM tori) of integrating fields that are reversible, or (for LF) have a “special divergence-free” (SDF) property. We review the notion of a self-adjoint scheme, showing that such schemes are at least second order accurate and can always be formed by composing an arbitrary scheme with its adjoint. We also review the concept of reversibility, showing that a reversible but not exactly volume-preserving scheme can lead to a fractal invariant measure in a chaotic region, although this property may not often be observable. We also show numerical results indicating that the IM and LF schemes can fail to preserve KAM tori when the reversibility property (and the SDF property for LF) of the field is broken. We discuss extensions to measure preserving flows, the integration of magnetic field lines in a plasma and the integration of rays for several plasma waves. The main new result of this paper relates to non-uniform time stepping for volume-preserving flows. We investigate two potential schemes, both based on the general method of Feng and Shang [Numer. Math. 71, 451 (1995)], in which the flow is integrated in split time steps, each Hamiltonian in two dimensions. The first scheme is an extension of the method of extended phase space, a well-proven method of symplectic integration with non-uniform time steps. This method is found not to work, and an explanation is given. The second method investigated is a method based on transformation to canonical variables for the two split-step Hamiltonian systems. This method, which is related to the method of non-canonical generating functions of Richardson and Finn [Plasma Phys. Controlled Fusion 54, 014004 (2012

Graphical constraints: a graphical user interface for constraint problems

OpenAIRE

Vieira, Nelson Manuel Marques

2015-01-01

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embrace...

Allocating limited resources in a time of fiscal constraints: a priority setting case study from Dalhousie University Faculty of Medicine.

Science.gov (United States)

Mitton, Craig; Levy, Adrian; Gorsky, Diane; MacNeil, Christina; Dionne, Francois; Marrie, Tom

2013-07-01

Facing a projected $1.4M deficit on a $35M operating budget for fiscal year 2011/2012, members of the Dalhousie University Faculty of Medicine developed and implemented an explicit, transparent, criteria-based priority setting process for resource reallocation. A task group that included representatives from across the Faculty of Medicine used a program budgeting and marginal analysis (PBMA) framework, which provided an alternative to the typical public-sector approaches to addressing a budget deficit of across-the-board spending cuts and political negotiation. Key steps to the PBMA process included training staff members and department heads on priority setting and resource reallocation, establishing process guidelines to meet immediate and longer-term fiscal needs, developing a reporting structure and forming key working groups, creating assessment criteria to guide resource reallocation decisions, assessing disinvestment proposals from all departments, and providing proposal implementation recommendations to the dean. All departments were required to submit proposals for consideration. The task group approved 27 service reduction proposals and 28 efficiency gains proposals, totaling approximately $2.7M in savings across two years. During this process, the task group faced a number of challenges, including a tight timeline for development and implementation (January to April 2011), a culture that historically supported decentralized planning, at times competing interests (e.g., research versus teaching objectives), and reductions in overall health care and postsecondary education government funding. Overall, faculty and staff preferred the PBMA approach to previous practices. Other institutions should use this example to set priorities in times of fiscal constraints.

A step-defined sedentary lifestyle index: <5000 steps/day.

Science.gov (United States)

Tudor-Locke, Catrine; Craig, Cora L; Thyfault, John P; Spence, John C

2013-02-01

Step counting (using pedometers or accelerometers) is widely accepted by researchers, practitioners, and the general public. Given the mounting evidence of the link between low steps/day and time spent in sedentary behaviours, how few steps/day some populations actually perform, and the growing interest in the potentially deleterious effects of excessive sedentary behaviours on health, an emerging question is "How many steps/day are too few?" This review examines the utility, appropriateness, and limitations of using a reoccurring candidate for a step-defined sedentary lifestyle index: 10 000) to lower (sedentary lifestyle index for adults is appropriate for researchers and practitioners and for communicating with the general public. There is little evidence to advocate any specific value indicative of a step-defined sedentary lifestyle index in children and adolescents.

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

Directory of Open Access Journals (Sweden)

Hamidreza Haddad

2012-04-01

Full Text Available This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints. The primary objective of this paper is minimization of total weighted tardiness. Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model. The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time. Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters. Computational experiments validate the effectiveness and capability of proposed method.

Starting a new residency program: a step-by-step guide for institutions, hospitals, and program directors

Directory of Open Access Journals (Sweden)

Michelle Barajaz

2016-08-01

Full Text Available Although our country faces a looming shortage of doctors, constraints of space, funding, and patient volume in many existing residency programs limit training opportunities for medical graduates. New residency programs need to be created for the expansion of graduate medical education training positions. Partnerships between existing academic institutions and community hospitals with a need for physicians can be a very successful means toward this end. Baylor College of Medicine and The Children's Hospital of San Antonio were affiliated in 2012, and subsequently, we developed and received accreditation for a new categorical pediatric residency program at that site in 2014. We share below a step-by-step guide through the process that includes building of the infrastructure, educational development, accreditation, marketing, and recruitment. It is our hope that the description of this process will help others to spur growth in graduate medical training positions.

Comparison of step-by-step kinematics in repeated 30m sprints in female soccer players.

Science.gov (United States)

van den Tillaar, Roland

2018-01-04

The aim of this study was to compare kinematics in repeated 30m sprints in female soccer players. Seventeen subjects performed seven 30m sprints every 30s in one session. Kinematics were measured with an infrared contact mat and laser gun, and running times with an electronic timing device. The main findings were that sprint times increased in the repeated sprint ability test. The main changes in kinematics during the repeated sprint ability test were increased contact time and decreased step frequency, while no change in step length was observed. The step velocity increased in almost each step until the 14, which occurred around 22m. After this, the velocity was stable until the last step, when it decreased. This increase in step velocity was mainly caused by the increased step length and decreased contact times. It was concluded that the fatigue induced in repeated 30m sprints in female soccer players resulted in decreased step frequency and increased contact time. Employing this approach in combination with a laser gun and infrared mat for 30m makes it very easy to analyse running kinematics in repeated sprints in training. This extra information gives the athlete, coach and sports scientist the opportunity to give more detailed feedback and help to target these changes in kinematics better to enhance repeated sprint performance.

Traffic safety and step-by-step driving licence for young people

DEFF Research Database (Denmark)

Tønning, Charlotte; Agerholm, Niels

2017-01-01

presents a review of safety effects from step-by-step driving licence schemes. Most of the investigated schemes consist of a step-by-step driving licence with Step 1) various tests and education, Step 2) a period where driving is only allowed together with an experienced driver and Step 3) driving without...... companion is allowed but with various restrictions and, in some cases, additional driving education and tests. In general, a step-by-step driving licence improves traffic safety even though the young people are permitted to drive a car earlier on. The effects from driving with an experienced driver vary......Young novice car drivers are much more accident-prone than other drivers - up to 10 times that of their parents' generation. A central solution to improve the traffic safety for this group is implementation of a step-by-step driving licence. A number of countries have introduced a step...

Rigid Body Time Integration by Convected Base Vectors with Implicit Constraints

DEFF Research Database (Denmark)

Krenk, Steen; Nielsen, Martin Bjerre

2013-01-01

of the kinetic energy used in the present formulation is deliberately chosen to correspond to a rigid body rotation, and the orthonormality constraints are introduced via the equivalent Green strain components of the base vectors. The particular form of the extended inertia tensor used here implies a set...

Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.

Directory of Open Access Journals (Sweden)

Botond Molnár

Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.

Time step rescaling recovers continuous-time dynamical properties for discrete-time Langevin integration of nonequilibrium systems.

Science.gov (United States)

Sivak, David A; Chodera, John D; Crooks, Gavin E

2014-06-19

When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon desirable properties. However, for stochastic equations of motion (e.g., Langevin dynamics), there is still broad disagreement over which integration algorithms are most appropriate. While multiple desiderata have been proposed throughout the literature, consensus on which criteria are important is absent, and no published integration scheme satisfies all desiderata simultaneously. Additional nontrivial complications stem from simulating systems driven out of equilibrium using existing stochastic integration schemes in conjunction with recently developed nonequilibrium fluctuation theorems. Here, we examine a family of discrete time integration schemes for Langevin dynamics, assessing how each member satisfies a variety of desiderata that have been enumerated in prior efforts to construct suitable Langevin integrators. We show that the incorporation of a novel time step rescaling in the deterministic updates of position and velocity can correct a number of dynamical defects in these integrators. Finally, we identify a particular splitting (related to the velocity Verlet discretization) that has essentially universally appropriate properties for the simulation of Langevin dynamics for molecular systems in equilibrium, nonequilibrium, and path sampling contexts.

Modelling of Sub-daily Hydrological Processes Using Daily Time-Step Models: A Distribution Function Approach to Temporal Scaling

Science.gov (United States)

Kandel, D. D.; Western, A. W.; Grayson, R. B.

2004-12-01

Mismatches in scale between the fundamental processes, the model and supporting data are a major limitation in hydrologic modelling. Surface runoff generation via infiltration excess and the process of soil erosion are fundamentally short time-scale phenomena and their average behaviour is mostly determined by the short time-scale peak intensities of rainfall. Ideally, these processes should be simulated using time-steps of the order of minutes to appropriately resolve the effect of rainfall intensity variations. However, sub-daily data support is often inadequate and the processes are usually simulated by calibrating daily (or even coarser) time-step models. Generally process descriptions are not modified but rather effective parameter values are used to account for the effect of temporal lumping, assuming that the effect of the scale mismatch can be counterbalanced by tuning the parameter values at the model time-step of interest. Often this results in parameter values that are difficult to interpret physically. A similar approach is often taken spatially. This is problematic as these processes generally operate or interact non-linearly. This indicates a need for better techniques to simulate sub-daily processes using daily time-step models while still using widely available daily information. A new method applicable to many rainfall-runoff-erosion models is presented. The method is based on temporal scaling using statistical distributions of rainfall intensity to represent sub-daily intensity variations in a daily time-step model. This allows the effect of short time-scale nonlinear processes to be captured while modelling at a daily time-step, which is often attractive due to the wide availability of daily forcing data. The approach relies on characterising the rainfall intensity variation within a day using a cumulative distribution function (cdf). This cdf is then modified by various linear and nonlinear processes typically represented in hydrological and

Einstein constraints in the Yang-Mills form

International Nuclear Information System (INIS)

Ashtekar, A.

1987-01-01

It is pointed out that constraints of Einstein's theory play a powerful role in both classical and quantum theory because they generate motions in spacetime, rather than in an internal space. New variables are then introduced on the Einstein phase space in terms of which constraints simplify considerably. In particular, the use of these variables enables one to imbed the constraint surface of Einstein's theory into that of Yang-Mills. The imbedding suggests new lines of attack to a number of problems in classical and quantum gravity and provides new concepts and tools to investigate the microscopic structure of space-time geometry

A positive and multi-element conserving time stepping scheme for biogeochemical processes in marine ecosystem models

Science.gov (United States)

Radtke, H.; Burchard, H.

2015-01-01

In this paper, an unconditionally positive and multi-element conserving time stepping scheme for systems of non-linearly coupled ODE's is presented. These systems of ODE's are used to describe biogeochemical transformation processes in marine ecosystem models. The numerical scheme is a positive-definite modification of the Runge-Kutta method, it can have arbitrarily high order of accuracy and does not require time step adaption. If the scheme is combined with a modified Patankar-Runge-Kutta method from Burchard et al. (2003), it also gets the ability to solve a certain class of stiff numerical problems, but the accuracy is restricted to second-order then. The performance of the new scheme on two test case problems is shown.

Time to pause before the next step

International Nuclear Information System (INIS)

Siemon, R.E.

1998-01-01

Many scientists, who have staunchly supported ITER for years, are coming to realize it is time to further rethink fusion energy's development strategy. Specifically, as was suggested by Grant Logan and Dale Meade, and in keeping with the restructuring of 1996, a theme of better, cheaper, faster fusion would serve the program more effectively than ''demonstrating controlled ignition...and integrated testing of the high-heat-flux and nuclear components required to utilize fusion energy...'' which are the important ingredients of ITER's objectives. The author has personally shifted his view for a mixture of technical and political reasons. On the technical side, he senses that through advanced tokamak research, spherical tokamak research, and advanced stellarator work, scientists are coming to a new understanding that might make a burning-plasma device significantly smaller and less expensive. Thus waiting for a few years, even ten years, seems prudent. Scientifically, there is fascinating physics to be learned through studies of burning plasma on a tokamak. And clearly if one wishes to study burning plasma physics in a sustained plasma, there is no other configuration with an adequate database on which to proceed. But what is the urgency of moving towards an ITER-like step focused on burning plasma? Some of the arguments put forward and the counter arguments are discussed here

Constraint theory multidimensional mathematical model management

CERN Document Server

Friedman, George J

2017-01-01

Packed with new material and research, this second edition of George Friedman’s bestselling Constraint Theory remains an invaluable reference for all engineers, mathematicians, and managers concerned with modeling. As in the first edition, this text analyzes the way Constraint Theory employs bipartite graphs and presents the process of locating the “kernel of constraint” trillions of times faster than brute-force approaches, determining model consistency and computational allowability. Unique in its abundance of topological pictures of the material, this book balances left- and right-brain perceptions to provide a thorough explanation of multidimensional mathematical models. Much of the extended material in this new edition also comes from Phan Phan’s PhD dissertation in 2011, titled “Expanding Constraint Theory to Determine Well-Posedness of Large Mathematical Models.” Praise for the first edition: "Dr. George Friedman is indisputably the father of the very powerful methods of constraint theory...

Stepping out: dare to step forward, step back, or just stand still and breathe.

Science.gov (United States)

Waisman, Mary Sue

2012-01-01

It is important to step out and make a difference. We have one of the most unique and diverse professions that allows for diversity in thought and practice, permitting each of us to grow in our unique niches and make significant contributions. I was frightened to 'step out' to go to culinary school at the age of 46, but it changed forever the way I look at my profession and I have since experienced the most enjoyable and innovative career. There are also times when it is important to 'step back' to relish the roots of our profession; to help bring food back into nutrition; to translate all of our wonderful science into a language of food that Canadians understand. We all need to take time to 'just stand still and breathe': to celebrate our accomplishments, reflect on our actions, ensure we are heading toward our vision, keep the profession vibrant and relevant, and cherish one another.

Formal Constraints on Memory Management for Composite Overloaded Operations

Directory of Open Access Journals (Sweden)

Damian W.I. Rouson

2006-01-01

Full Text Available The memory management rules for abstract data type calculus presented by Rouson, Morris & Xu [15] are recast as formal statements in the Object Constraint Language (OCL and applied to the design of a thermal energy equation solver. One set of constraints eliminates memory leaks observed in composite overloaded expressions with three current Fortran 95/2003 compilers. A second set of constraints ensures economical memory recycling. The constraints are preconditions, postconditions and invariants on overloaded operators and the objects they receive and return. It is demonstrated that systematic run-time assertion checking inspired by the formal constraints facilitated the pinpointing of an exceptionally hard-to-reproduce compiler bug. It is further demonstrated that the interplay between OCL's modeling capabilities and Fortran's programming capabilities led to a conceptual breakthrough that greatly improved the readability of our code by facilitating operator overloading. The advantages and disadvantages of our memory management rules are discussed in light of other published solutions [11,19]. Finally, it is demonstrated that the run-time assertion checking has a negligible impact on performance.

Latin hypercube sampling with inequality constraints

International Nuclear Information System (INIS)

Iooss, B.; Petelet, M.; Asserin, O.; Loredo, A.

2010-01-01

In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical welding simulation, where the inequality constraints are caused by the physical decreasing of some material properties in function of the temperature. (authors)

New formulation of Horava-Lifshitz quantum gravity as a master constraint theory

Energy Technology Data Exchange (ETDEWEB)

Soo, Chopin, E-mail: cpsoo@mail.ncku.edu.tw [Department of Physics, National Cheng Kung University, Tainan 70101, Taiwan (China); Yang Jinsong, E-mail: Yangksong@gmail.com [Department of Physics, National Cheng Kung University, Tainan 70101, Taiwan (China); Yu, Hoi-Lai, E-mail: hlyu@phys.sinica.edu.tw [Institute of Physics, Academia Sinica, Nankang, Taipei 11529, Taiwan (China)

2011-07-04

Both projectable and non-projectable versions of Horava-Lifshitz gravity face serious challenges. In the non-projectable version, the constraint algebra is seemingly inconsistent. The projectable version lacks a local Hamiltonian constraint, thus allowing for an extra scalar mode which can be problematic. A new formulation of non-projectable Horava-Lifshitz gravity, naturally realized as a representation of the master constraint algebra studied by loop quantum gravity researchers, is presented. This yields a consistent canonical theory with first class constraints. It captures the essence of Horava-Lifshitz gravity in retaining only spatial diffeomorphisms (instead of full space-time covariance) as the physically relevant non-trivial gauge symmetry; at the same time the local Hamiltonian constraint needed to eliminate the extra mode is equivalently enforced by the master constraint.

Variance-Constrained Robust Estimation for Discrete-Time Systems with Communication Constraints

Directory of Open Access Journals (Sweden)

Baofeng Wang

2014-01-01

Full Text Available This paper is concerned with a new filtering problem in networked control systems (NCSs subject to limited communication capacity, which includes measurement quantization, random transmission delay, and packets loss. The measurements are first quantized via a logarithmic quantizer and then transmitted through a digital communication network with random delay and packet loss. The three communication constraints phenomena which can be seen as a class of uncertainties are formulated by a stochastic parameter uncertainty system. The purpose of the paper is to design a linear filter such that, for all the communication constraints, the error state of the filtering process is mean square bounded and the steady-state variance of the estimation error for each state is not more than the individual prescribed upper bound. It is shown that the desired filtering can effectively be solved if there are positive definite solutions to a couple of algebraic Riccati-like inequalities or linear matrix inequalities. Finally, an illustrative numerical example is presented to demonstrate the effectiveness and flexibility of the proposed design approach.

Reinforcement-Learning-Based Robust Controller Design for Continuous-Time Uncertain Nonlinear Systems Subject to Input Constraints.

Science.gov (United States)

Liu, Derong; Yang, Xiong; Wang, Ding; Wei, Qinglai

2015-07-01

The design of stabilizing controller for uncertain nonlinear systems with control constraints is a challenging problem. The constrained-input coupled with the inability to identify accurately the uncertainties motivates the design of stabilizing controller based on reinforcement-learning (RL) methods. In this paper, a novel RL-based robust adaptive control algorithm is developed for a class of continuous-time uncertain nonlinear systems subject to input constraints. The robust control problem is converted to the constrained optimal control problem with appropriately selecting value functions for the nominal system. Distinct from typical action-critic dual networks employed in RL, only one critic neural network (NN) is constructed to derive the approximate optimal control. Meanwhile, unlike initial stabilizing control often indispensable in RL, there is no special requirement imposed on the initial control. By utilizing Lyapunov's direct method, the closed-loop optimal control system and the estimated weights of the critic NN are proved to be uniformly ultimately bounded. In addition, the derived approximate optimal control is verified to guarantee the uncertain nonlinear system to be stable in the sense of uniform ultimate boundedness. Two simulation examples are provided to illustrate the effectiveness and applicability of the present approach.

Making a good group decision (low risk) in Singapore under an environment that has time and cost constraints

OpenAIRE

Loo, Sok Hiang Candy

2014-01-01

Approved for public release; distribution is unlimited Organizations in Singapore operate in a highly competitive and fast-paced work environment that presents decision-making challenges at the individual, group, and organization levels. A key problem is achieving good decision fitness within time and cost constraints. While many decision-making theories and processes address the fundamental decision-making process, there is limited research on improving the group decision-making framework...

From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning

International Nuclear Information System (INIS)

Thieke, Christian; Bortfeld, Thomas; Niemierko, Andrzej; Nill, Simeon

2003-01-01

Optimization algorithms in inverse radiotherapy planning need information about the desired dose distribution. Usually the planner defines physical dose constraints for each structure of the treatment plan, either in form of minimum and maximum doses or as dose-volume constraints. The concept of equivalent uniform dose (EUD) was designed to describe dose distributions with a higher clinical relevance. In this paper, we present a method to consider the EUD as an optimization constraint by using the method of projections onto convex sets (POCS). In each iteration of the optimization loop, for the actual dose distribution of an organ that violates an EUD constraint a new dose distribution is calculated that satisfies the EUD constraint, leading to voxel-based physical dose constraints. The new dose distribution is found by projecting the current one onto the convex set of all dose distributions fulfilling the EUD constraint. The algorithm is easy to integrate into existing inverse planning systems, and it allows the planner to choose between physical and EUD constraints separately for each structure. A clinical case of a head and neck tumor is optimized using three different sets of constraints: physical constraints for all structures, physical constraints for the target and EUD constraints for the organs at risk, and EUD constraints for all structures. The results show that the POCS method converges stable and given EUD constraints are reached closely

Step training improves reaction time, gait and balance and reduces falls in older people: a systematic review and meta-analysis.

Science.gov (United States)

Okubo, Yoshiro; Schoene, Daniel; Lord, Stephen R

2017-04-01

To examine the effects of stepping interventions on fall risk factors and fall incidence in older people. Electronic databases (PubMed, EMBASE, CINAHL, Cochrane, CENTRAL) and reference lists of included articles from inception to March 2015. Randomised (RCT) or clinical controlled trials (CCT) of volitional and reactive stepping interventions that included older (minimum age 60) people providing data on falls or fall risk factors. Meta-analyses of seven RCTs (n=660) showed that the stepping interventions significantly reduced the rate of falls (rate ratio=0.48, 95% CI 0.36 to 0.65, prisk ratio=0.51, 95% CI 0.38 to 0.68, pfalls and proportion of fallers. A meta-analysis of two RCTs (n=62) showed that stepping interventions significantly reduced laboratory-induced falls, and meta-analysis findings of up to five RCTs and CCTs (n=36-416) revealed that stepping interventions significantly improved simple and choice stepping reaction time, single leg stance, timed up and go performance (pfalls among older adults by approximately 50%. This clinically significant reduction may be due to improvements in reaction time, gait, balance and balance recovery but not in strength. Further high-quality studies aimed at maximising the effectiveness and feasibility of stepping interventions are required. CRD42015017357. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

Time ordering of two-step processes in energetic ion-atom collisions: Basic formalism

International Nuclear Information System (INIS)

Stolterfoht, N.

1993-01-01

The semiclassical approximation is applied in second order to describe time ordering of two-step processes in energetic ion-atom collisions. Emphasis is given to the conditions for interferences between first- and second-order terms. In systems with two active electrons, time ordering gives rise to a pair of associated paths involving a second-order process and its time-inverted process. Combining these paths within the independent-particle frozen orbital model, time ordering is lost. It is shown that the loss of time ordering modifies the second-order amplitude so that its ability to interfere with the first-order amplitude is essentially reduced. Time ordering and the capability for interference is regained, as one path is blocked by means of the Pauli exclusion principle. The time-ordering formalism is prepared for papers dealing with collision experiments of single excitation [Stolterfoht et al., following paper, Phys. Rev. A 48, 2986 (1993)] and double excitation [Stolterfoht et al. (unpublished)

Providing reliable energy in a time of constraints : a North American concern

International Nuclear Information System (INIS)

Egan, T.; Turk, E.

2008-04-01

The reliability of the North American electricity grid was discussed. Government initiatives designed to control carbon dioxide (CO 2 ) and other emissions in some regions of Canada may lead to electricity supply constraints in other regions. A lack of investment in transmission infrastructure has resulted in constraints within the North American transmission grid, and the growth of smaller projects is now raising concerns about transmission capacity. Labour supply shortages in the electricity industry are also creating concerns about the long-term security of the electricity market. Measures to address constraints must be considered in the current context of the North American electricity system. The extensive transmission interconnects and integration between the United States and Canada will provide a framework for greater trade and market opportunities between the 2 countries. Coordinated actions and increased integration will enable Canada and the United States to increase the reliability of electricity supply. However, both countries must work cooperatively to increase generation supply using both mature and emerging technologies. The cross-border transmission grid must be enhanced by increasing transmission capacity as well as by implementing new reliability rules, building new infrastructure, and ensuring infrastructure protection. Barriers to cross-border electricity trade must be identified and avoided. Demand-side and energy efficiency measures must also be implemented. It was concluded that both countries must focus on developing strategies for addressing the environmental concerns related to electricity production. 6 figs

The Impact of Resource Constraints on the Psychological Well-Being of Survivors of Intimate Partner Violence over Time

Science.gov (United States)

Beeble, Marisa L.; Bybee, Deborah; Sullivan, Cris M.

2010-01-01

This study examined the impact of resource constraints on the psychological well-being of survivors of intimate partner violence (IPV), testing whether resource constraints is one mechanism that partially mediates the relationship between IPV and women's well-being. Although within-woman changes in resource constraints did not mediate the…

Impact of optimal load response to real-time electricity price on power system constraints in Denmark

DEFF Research Database (Denmark)

Hu, Weihao; Chen, Zhe; Bak-Jensen, Birgitte

2010-01-01

Since the hourly spot market price is available one day ahead in Denmark, the price could be transferred to the consumers and they may shift their loads from high price periods to the low price periods in order to save their energy costs. The optimal load response to a real-time electricity price...... and may represent the future of electricity markets in some ways, is chosen as the studied power system in this paper. A distribution system where wind power capacity is 126% of maximum loads is chosen as the study case. This paper presents a nonlinear load optimization method to real-time power price...... for demand side management in order to save the energy costs as much as possible. Simulation results show that the optimal load response to a real-time electricity price has some good impacts on power system constraints in a distribution system with high wind power penetrations....

Constraint-based reachability

Directory of Open Access Journals (Sweden)

Arnaud Gotlieb

2013-02-01

Full Text Available Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.

Faddeev-Jackiw quantization and constraints

International Nuclear Information System (INIS)

Barcelos-Neto, J.; Wotzasek, C.

1992-01-01

In a recent Letter, Faddeev and Jackiw have shown that the reduction of constrained systems into its canonical, first-order form, can bring some new insight into the research of this field. For sympletic manifolds the geometrical structure, called Dirac or generalized bracket, is obtained directly from the inverse of the nonsingular sympletic two-form matrix. In the cases of nonsympletic manifolds, this two-form is degenerated and cannot be inverted to provide the generalized brackets. This singular behavior of the sympletic matrix is indicative of the presence of constraints that have to be carefully considered to yield to consistent results. One has two possible routes to treat this problem: Dirac has taught us how to implement the constraints into the potential part (Hamiltonian) of the canonical Lagrangian, leading to the well-known Dirac brackets, which are consistent with the constraints and can be mapped into quantum commutators (modulo ordering terms). The second route, suggested by Faddeev and Jackiw, and followed in this paper, is to implement the constraints directly into the canonical part of the first order Lagrangian, using the fact that the consistence condition for the stability of the constrained manifold is linear in the time derivative. This algorithm may lead to an invertible two-form sympletic matrix from where the Dirac brackets are readily obtained. This algorithm is used in this paper to investigate some aspects of the quantization of constrained systems with first- and second-class constraints in the sympletic approach

Constraint-Muse: A Soft-Constraint Based System for Music Therapy

Science.gov (United States)

Hölzl, Matthias; Denker, Grit; Meier, Max; Wirsing, Martin

Monoidal soft constraints are a versatile formalism for specifying and solving multi-criteria optimization problems with dynamically changing user preferences. We have developed a prototype tool for interactive music creation, called Constraint Muse, that uses monoidal soft constraints to ensure that a dynamically generated melody harmonizes with input from other sources. Constraint Muse provides an easy to use interface based on Nintendo Wii controllers and is intended to be used in music therapy for people with Parkinson’s disease and for children with high-functioning autism or Asperger’s syndrome.

Accuracy Constraint Determination in Fixed-Point System Design

Directory of Open Access Journals (Sweden)

Serizel R

2008-01-01

Full Text Available Most of digital signal processing applications are specified and designed with floatingpoint arithmetic but are finally implemented using fixed-point architectures. Thus, the design flow requires a floating-point to fixed-point conversion stage which optimizes the implementation cost under execution time and accuracy constraints. This accuracy constraint is linked to the application performances and the determination of this constraint is one of the key issues of the conversion process. In this paper, a method is proposed to determine the accuracy constraint from the application performance. The fixed-point system is modeled with an infinite precision version of the system and a single noise source located at the system output. Then, an iterative approach for optimizing the fixed-point specification under the application performance constraint is defined and detailed. Finally the efficiency of our approach is demonstrated by experiments on an MP3 encoder.

On the Convexity of Step out - Step in Sequencing Games

NARCIS (Netherlands)

Musegaas, Marieke; Borm, Peter; Quant, Marieke

2016-01-01

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an

Features in the primordial spectrum: New constraints from WMAP7 and ACT data and prospects for the Planck mission

International Nuclear Information System (INIS)

Benetti, Micol; Lattanzi, Massimiliano; Calabrese, Erminia; Melchiorri, Alessandro

2011-01-01

We update the constraints on possible features in the primordial inflationary density perturbation spectrum by using the latest data from the WMAP7 and ACT (Atacama Cosmology Telescope) cosmic microwave background experiments. The inclusion of new data significantly improves the constraints with respect to older work, especially to smaller angular scales. While we found no clear statistical evidence in the data for extensions to the simplest, featureless, inflationary model, models with a step provide a significantly better fit than standard featureless power-law spectra. We show that the possibility of a step in the inflationary potential like the one preferred by current data will soon be tested by the forthcoming temperature and polarization data from the Planck satellite mission.

Timing of the steps in transformation of C3H 10T1/2 cells by X-irradiation

International Nuclear Information System (INIS)

Kennedy, A.R.; Cairns, J.; Little, J.B.

1984-01-01

Transformation of cells in culture by chemical carcinogens or X-rays seems to require at least two steps. The initial step is a frequent event; for example, after transient exposure to either methylcholanthrene or X-rays. It has been hypothesized that the second step behaves like a spontaneous mutation in having a constant but small probability of occurring each time an initiated cell divides. We show here that the clone size distribution of transformed cells in growing cultures initiated by X-rays, is, indeed, exactly what would be expected on that hypothesis. (author)

An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-robin Tournaments

Energy Technology Data Exchange (ETDEWEB)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

2014-01-01

Previous approaches for scheduling a league with round-robin and divisional tournaments involved decomposing the problem into easier subproblems. This approach, used to schedule the top Swedish handball league Elitserien, reduces the problem complexity but can result in suboptimal schedules. This paper presents an integrated constraint programming model that allows to perform the scheduling in a single step. Particular attention is given to identifying implied and symmetry-breaking constraints that reduce the computational complexity significantly. The experimental evaluation of the integrated approach takes considerably less computational effort than the previous approach.

A discrete classical space-time could require 6 extra-dimensions

Science.gov (United States)

Guillemant, Philippe; Medale, Marc; Abid, Cherifa

2018-01-01

We consider a discrete space-time in which conservation laws are computed in such a way that the density of information is kept bounded. We use a 2D billiard as a toy model to compute the uncertainty propagation in ball positions after every shock and the corresponding loss of phase information. Our main result is the computation of a critical time step above which billiard calculations are no longer deterministic, meaning that a multiverse of distinct billiard histories begins to appear, caused by the lack of information. Then, we highlight unexpected properties of this critical time step and the subsequent exponential evolution of the number of histories with time, to observe that after certain duration all billiard states could become possible final states, independent of initial conditions. We conclude that if our space-time is really a discrete one, one would need to introduce extra-dimensions in order to provide supplementary constraints that specify which history should be played.

Imaginary Time Step Method to Solve the Dirac Equation with Nonlocal Potential

International Nuclear Information System (INIS)

Zhang Ying; Liang Haozhao; Meng Jie

2009-01-01

The imaginary time step (ITS) method is applied to solve the Dirac equation with nonlocal potentials in coordinate space. Taking the nucleus 12 C as an example, even with nonlocal potentials, the direct ITS evolution for the Dirac equation still meets the disaster of the Dirac sea. However, following the recipe in our former investigation, the disaster can be avoided by the ITS evolution for the corresponding Schroedinger-like equation without localization, which gives the convergent results exactly the same with those obtained iteratively by the shooting method with localized effective potentials.

Microsoft® Visual Basic® 2010 Step by Step

CERN Document Server

Halvorson, Michael

2010-01-01

Your hands-on, step-by-step guide to learning Visual Basic® 2010. Teach yourself the essential tools and techniques for Visual Basic® 2010-one step at a time. No matter what your skill level, you'll find the practical guidance and examples you need to start building professional applications for Windows® and the Web. Discover how to: Work in the Microsoft® Visual Studio® 2010 Integrated Development Environment (IDE)Master essential techniques-from managing data and variables to using inheritance and dialog boxesCreate professional-looking UIs; add visual effects and print supportBuild com

Canadian children's and youth's pedometer-determined steps/day, parent-reported TV watching time, and overweight/obesity: The CANPLAY Surveillance Study

Directory of Open Access Journals (Sweden)

Craig Cora L

2011-06-01

Full Text Available Abstract Background This study examines associations between pedometer-determined steps/day and parent-reported child's Body Mass Index (BMI and time typically spent watching television between school and dinner. Methods Young people (aged 5-19 years were recruited through their parents by random digit dialling and mailed a data collection package. Information on height and weight and time spent watching television between school and dinner on a typical school day was collected from parents. In total, 5949 boys and 5709 girls reported daily steps. BMI was categorized as overweight or obese using Cole's cut points. Participants wore pedometers for 7 days and logged daily steps. The odds of being overweight and obese by steps/day and parent-reported time spent television watching were estimated using logistic regression for complex samples. Results Girls had a lower median steps/day (10682 versus 11059 for boys and also a narrower variation in steps/day (interquartile range, 4410 versus 5309 for boys. 11% of children aged 5-19 years were classified as obese; 17% of boys and girls were overweight. Both boys and girls watched, on average, Discussion Television viewing is the more prominent factor in terms of predicting overweight, and it contributes to obesity, but steps/day attenuates the association between television viewing and obesity, and therefore can be considered protective against obesity. In addition to replacing opportunities for active alternative behaviours, exposure to television might also impact body weight by promoting excess energy intake. Conclusions In this large nationally representative sample, pedometer-determined steps/day was associated with reduced odds of being obese (but not overweight whereas each parent-reported hour spent watching television between school and dinner increased the odds of both overweight and obesity.

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Directory of Open Access Journals (Sweden)

Ling-Huey Su

2015-09-01

Full Text Available Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and constraint programming, a heuristic and a network based linear programming are proposed to solve the problem. Findings: Computational experiments show that the heuristic generates a good quality schedule with a deviation of 0.25% on average from the optimum and the network based linear programming model can solve problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a time. In order to satisfy this constraint, a time consuming Constraint Programming is proposed. For n = 80 and m = 10, the average execution time for the combined models (linear programming model combined with Constraint programming exceeds two hours. Therefore, the heuristic algorithm we developed is very efficient and is in need. Practical implications: Its practical implication occurs in TFT-LCD and E-paper manufacturing wherein units go through a series of diagnostic tests that do not have to be performed in any specified order. Originality/value: The main contribution of the article is to split the time horizon into many time intervals and use the dispatching rule for each time interval in the heuristic algorithm, and also to combine the minimum cost flow network with the Constraint Programming to solve the problem optimally. 

Development of the Modified Four Square Step Test and its reliability and validity in people with stroke.

Science.gov (United States)

Roos, Margaret A; Reisman, Darcy S; Hicks, Gregory; Rose, William; Rudolph, Katherine S

2016-01-01

Adults with stroke have difficulty avoiding obstacles when walking, especially when a time constraint is imposed. The Four Square Step Test (FSST) evaluates dynamic balance by requiring individuals to step over canes in multiple directions while being timed, but many people with stroke are unable to complete it. The purposes of this study were to (1) modify the FSST by replacing the canes with tape so that more persons with stroke could successfully complete the test and (2) examine the reliability and validity of the modified version. Fifty-five subjects completed the Modified FSST (mFSST) by stepping over tape in all four directions while being timed. The mFSST resulted in significantly greater numbers of subjects completing the test than the FSST (39/55 [71%] and 33/55 [60%], respectively) (p < 0.04). The test-retest, intrarater, and interrater reliability of the mFSST were excellent (intraclass correlation coefficient ranges: 0.81-0.99). Construct and concurrent validity of the mFSST were also established. The minimal detectable change was 6.73 s. The mFSST, an ideal measure of dynamic balance, can identify progress in people with stroke in varied settings and can be completed by a wide range of people with stroke in approximately 5 min with the use of minimal equipment (tape, stop watch).

Step by step parallel programming method for molecular dynamics code

International Nuclear Information System (INIS)

Orii, Shigeo; Ohta, Toshio

1996-07-01

Parallel programming for a numerical simulation program of molecular dynamics is carried out with a step-by-step programming technique using the two phase method. As a result, within the range of a certain computing parameters, it is found to obtain parallel performance by using the level of parallel programming which decomposes the calculation according to indices of do-loops into each processor on the vector parallel computer VPP500 and the scalar parallel computer Paragon. It is also found that VPP500 shows parallel performance in wider range computing parameters. The reason is that the time cost of the program parts, which can not be reduced by the do-loop level of the parallel programming, can be reduced to the negligible level by the vectorization. After that, the time consuming parts of the program are concentrated on less parts that can be accelerated by the do-loop level of the parallel programming. This report shows the step-by-step parallel programming method and the parallel performance of the molecular dynamics code on VPP500 and Paragon. (author)

PHISICS/RELAP5-3D Adaptive Time-Step Method Demonstrated for the HTTR LOFC#1 Simulation

Energy Technology Data Exchange (ETDEWEB)

Baker, Robin Ivey [Idaho National Lab. (INL), Idaho Falls, ID (United States); Balestra, Paolo [Univ. of Rome (Italy); Strydom, Gerhard [Idaho National Lab. (INL), Idaho Falls, ID (United States)

2017-05-01

A collaborative effort between Japan Atomic Energy Agency (JAEA) and Idaho National Laboratory (INL) as part of the Civil Nuclear Energy Working Group is underway to model the high temperature engineering test reactor (HTTR) loss of forced cooling (LOFC) transient that was performed in December 2010. The coupled version of RELAP5-3D, a thermal fluids code, and PHISICS, a neutronics code, were used to model the transient. The focus of this report is to summarize the changes made to the PHISICS-RELAP5-3D code for implementing an adaptive time step methodology into the code for the first time, and to test it using the full HTTR PHISICS/RELAP5-3D model developed by JAEA and INL and the LOFC simulation. Various adaptive schemes are available based on flux or power convergence criteria that allow significantly larger time steps to be taken by the neutronics module. The report includes a description of the HTTR and the associated PHISICS/RELAP5-3D model test results as well as the University of Rome sub-contractor report documenting the adaptive time step theory and methodology implemented in PHISICS/RELAP5-3D. Two versions of the HTTR model were tested using 8 and 26 energy groups. It was found that most of the new adaptive methods lead to significant improvements in the LOFC simulation time required without significant accuracy penalties in the prediction of the fission power and the fuel temperature. In the best performing 8 group model scenarios, a LOFC simulation of 20 hours could be completed in real-time, or even less than real-time, compared with the previous version of the code that completed the same transient 3-8 times slower than real-time. A few of the user choice combinations between the methodologies available and the tolerance settings did however result in unacceptably high errors or insignificant gains in simulation time. The study is concluded with recommendations on which methods to use for this HTTR model. An important caveat is that these findings

A multi-time-step noise reduction method for measuring velocity statistics from particle tracking velocimetry

Science.gov (United States)

Machicoane, Nathanaël; López-Caballero, Miguel; Bourgoin, Mickael; Aliseda, Alberto; Volk, Romain

2017-10-01

We present a method to improve the accuracy of velocity measurements for fluid flow or particles immersed in it, based on a multi-time-step approach that allows for cancellation of noise in the velocity measurements. Improved velocity statistics, a critical element in turbulent flow measurements, can be computed from the combination of the velocity moments computed using standard particle tracking velocimetry (PTV) or particle image velocimetry (PIV) techniques for data sets that have been collected over different values of time intervals between images. This method produces Eulerian velocity fields and Lagrangian velocity statistics with much lower noise levels compared to standard PIV or PTV measurements, without the need of filtering and/or windowing. Particle displacement between two frames is computed for multiple different time-step values between frames in a canonical experiment of homogeneous isotropic turbulence. The second order velocity structure function of the flow is computed with the new method and compared to results from traditional measurement techniques in the literature. Increased accuracy is also demonstrated by comparing the dissipation rate of turbulent kinetic energy measured from this function against previously validated measurements.

Reduction of Constraints: Applicability of the Homogeneity Constraint for Macrobatch 3

International Nuclear Information System (INIS)

Peeler, D.K.

2001-01-01

The Product Composition Control System (PCCS) is used to determine the acceptability of each batch of Defense Waste Processing Facility (DWPF) melter feed in the Slurry Mix Evaporator (SME). This control system imposes several constraints on the composition of the contents of the SME to define acceptability. These constraints relate process or product properties to composition via prediction models. A SME batch is deemed acceptable if its sample composition measurements lead to acceptable property predictions after accounting for modeling, measurement and analytic uncertainties. The baseline document guiding the use of these data and models is ''SME Acceptability Determination for DWPF Process Control (U)'' by Brown and Postles [1996]. A minimum of three PCCS constraints support the prediction of the glass durability from a given SME batch. The Savannah River Technology Center (SRTC) is reviewing all of the PCCS constraints associated with durability. The purpose of this review is to revisit these constraints in light of the additional knowledge gained since the beginning of radioactive operations at DWPF and to identify any supplemental studies needed to amplify this knowledge so that redundant or overly conservative constraints can be eliminated or replaced by more appropriate constraints

Distance Constraint Satisfaction Problems

Science.gov (United States)

Bodirsky, Manuel; Dalmau, Victor; Martin, Barnaby; Pinsker, Michael

We study the complexity of constraint satisfaction problems for templates Γ that are first-order definable in ({ Z}; {suc}), the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of transitive finite templates), we provide a full classification for the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree). We show that one of the following is true: The structure Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and CSP(Γ) can be solved in polynomial time, or Γ is homomorphically equivalent to a finite transitive structure, or CSP(Γ) is NP-complete.

Technology for planning and scheduling under complex constraints

Science.gov (United States)

Alguire, Karen M.; Pedro Gomes, Carla O.

1997-02-01

Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

Diffusion Processes Satisfying a Conservation Law Constraint

Directory of Open Access Journals (Sweden)

J. Bakosi

2014-01-01

Full Text Available We investigate coupled stochastic differential equations governing N nonnegative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires a set of fluctuating variables to be nonnegative and (if appropriately normalized sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of the allowed sample space. We develop a set of constraints on the drift and diffusion terms of such stochastic models to ensure that both the nonnegativity and the unit-sum conservation law constraints are satisfied as the variables evolve in time. We investigate the consequences of the developed constraints on the Fokker-Planck equation, the associated system of stochastic differential equations, and the evolution equations of the first four moments of the probability density function. We show that random variables, satisfying a conservation law constraint, represented by stochastic diffusion processes, must have diffusion terms that are coupled and nonlinear. The set of constraints developed enables the development of statistical representations of fluctuating variables satisfying a conservation law. We exemplify the results with the bivariate beta process and the multivariate Wright-Fisher, Dirichlet, and Lochner’s generalized Dirichlet processes.

Stereoscopic filming for investigating evasive side-stepping and anterior cruciate ligament injury risk

Science.gov (United States)

Lee, Marcus J. C.; Bourke, Paul; Alderson, Jacqueline A.; Lloyd, David G.; Lay, Brendan

2010-02-01

Non-contact anterior cruciate ligament (ACL) injuries are serious and debilitating, often resulting from the performance of evasive sides-stepping (Ssg) by team sport athletes. Previous laboratory based investigations of evasive Ssg have used generic visual stimuli to simulate realistic time and space constraints that athletes experience in the preparation and execution of the manoeuvre. However, the use of unrealistic visual stimuli to impose these constraints may not be accurately identifying the relationship between the perceptual demands and ACL loading during Ssg in actual game environments. We propose that stereoscopically filmed footage featuring sport specific opposing defender/s simulating a tackle on the viewer, when used as visual stimuli, could improve the ecological validity of laboratory based investigations of evasive Ssg. Due to the need for precision and not just the experience of viewing depth in these scenarios, a rigorous filming process built on key geometric considerations and equipment development to enable a separation of 6.5 cm between two commodity cameras had to be undertaken. Within safety limits, this could be an invaluable tool in enabling more accurate investigations of the associations between evasive Ssg and ACL injury risk.

Reduction Of Constraints For Coupled Operations

International Nuclear Information System (INIS)

Raszewski, F.; Edwards, T.

2009-01-01

The homogeneity constraint was implemented in the Defense Waste Processing Facility (DWPF) Product Composition Control System (PCCS) to help ensure that the current durability models would be applicable to the glass compositions being processed during DWPF operations. While the homogeneity constraint is typically an issue at lower waste loadings (WLs), it may impact the operating windows for DWPF operations, where the glass forming systems may be limited to lower waste loadings based on fissile or heat load limits. In the sludge batch 1b (SB1b) variability study, application of the homogeneity constraint at the measurement acceptability region (MAR) limit eliminated much of the potential operating window for DWPF. As a result, Edwards and Brown developed criteria that allowed DWPF to relax the homogeneity constraint from the MAR to the property acceptance region (PAR) criterion, which opened up the operating window for DWPF operations. These criteria are defined as: (1) use the alumina constraint as currently implemented in PCCS (Al 2 O 3 (ge) 3 wt%) and add a sum of alkali constraint with an upper limit of 19.3 wt% (ΣM 2 O 2 O 3 constraint to 4 wt% (Al 2 O 3 (ge) 4 wt%). Herman et al. previously demonstrated that these criteria could be used to replace the homogeneity constraint for future sludge-only batches. The compositional region encompassing coupled operations flowsheets could not be bounded as these flowsheets were unknown at the time. With the initiation of coupled operations at DWPF in 2008, the need to revisit the homogeneity constraint was realized. This constraint was specifically addressed through the variability study for SB5 where it was shown that the homogeneity constraint could be ignored if the alumina and alkali constraints were imposed. Additional benefit could be gained if the homogeneity constraint could be replaced by the Al 2 O 3 and sum of alkali constraint for future coupled operations processing based on projections from Revision 14 of

Momentum constraint relaxation

International Nuclear Information System (INIS)

Marronetti, Pedro

2006-01-01

Full relativistic simulations in three dimensions invariably develop runaway modes that grow exponentially and are accompanied by violations of the Hamiltonian and momentum constraints. Recently, we introduced a numerical method (Hamiltonian relaxation) that greatly reduces the Hamiltonian constraint violation and helps improve the quality of the numerical model. We present here a method that controls the violation of the momentum constraint. The method is based on the addition of a longitudinal component to the traceless extrinsic curvature A ij -tilde, generated by a vector potential w i , as outlined by York. The components of w i are relaxed to solve approximately the momentum constraint equations, slowly pushing the evolution towards the space of solutions of the constraint equations. We test this method with simulations of binary neutron stars in circular orbits and show that it effectively controls the growth of the aforementioned violations. We also show that a full numerical enforcement of the constraints, as opposed to the gentle correction of the momentum relaxation scheme, results in the development of instabilities that stop the runs shortly

Serious Leisure and People with Orthopedic Impairment: Benefits and Constraints

OpenAIRE

Manolya AKSATAN; Zehra Gökçe SEL

2017-01-01

There are many people around the world who have different types of disabilities. Understanding their needs is the first step of developing policies to increase their quality of life and satisfaction. Leisure is an essential need of disabled people and it plays an important role in disabled people’s lives. The purpose of this study is to gain a deep understanding on the serious leisure activities of people with orthopedic impairment, and also both benefits and constraints ...

Finding the optimal Bayesian network given a constraint graph

Directory of Open Access Journals (Sweden)

Jacob M. Schreiber

2017-07-01

Full Text Available Despite recent algorithmic improvements, learning the optimal structure of a Bayesian network from data is typically infeasible past a few dozen variables. Fortunately, domain knowledge can frequently be exploited to achieve dramatic computational savings, and in many cases domain knowledge can even make structure learning tractable. Several methods have previously been described for representing this type of structural prior knowledge, including global orderings, super-structures, and constraint rules. While super-structures and constraint rules are flexible in terms of what prior knowledge they can encode, they achieve savings in memory and computational time simply by avoiding considering invalid graphs. We introduce the concept of a “constraint graph” as an intuitive method for incorporating rich prior knowledge into the structure learning task. We describe how this graph can be used to reduce the memory cost and computational time required to find the optimal graph subject to the encoded constraints, beyond merely eliminating invalid graphs. In particular, we show that a constraint graph can break the structure learning task into independent subproblems even in the presence of cyclic prior knowledge. These subproblems are well suited to being solved in parallel on a single machine or distributed across many machines without excessive communication cost.

Smart Wireless Power Transfer Operated by Time-Modulated Arrays via a Two-Step Procedure

Directory of Open Access Journals (Sweden)

Diego Masotti

2015-01-01

Full Text Available The paper introduces a novel method for agile and precise wireless power transmission operated by a time-modulated array. The unique, almost real-time reconfiguration capability of these arrays is fully exploited by a two-step procedure: first, a two-element time-modulated subarray is used for localization of tagged sensors to be energized; the entire 16-element TMA then provides the power to the detected tags, by exploiting the fundamental and first-sideband harmonic radiation. An investigation on the best array architecture is carried out, showing the importance of the adopted nonlinear/full-wave computer-aided-design platform. Very promising simulated energy transfer performance of the entire nonlinear radiating system is demonstrated.

Non-iterative distance constraints enforcement for cloth drapes simulation

Science.gov (United States)

Hidajat, R. L. L. G.; Wibowo, Arifin, Z.; Suyitno

2016-03-01

A cloth simulation represents the behavior of cloth objects such as flag, tablecloth, or even garments has application in clothing animation for games and virtual shops. Elastically deformable models have widely used to provide realistic and efficient simulation, however problem of overstretching is encountered. We introduce a new cloth simulation algorithm that replaces iterative distance constraint enforcement steps with non-iterative ones for preventing over stretching in a spring-mass system for cloth modeling. Our method is based on a simple position correction procedure applied at one end of a spring. In our experiments, we developed a rectangle cloth model which is initially at a horizontal position with one point is fixed, and it is allowed to drape by its own weight. Our simulation is able to achieve a plausible cloth drapes as in reality. This paper aims to demonstrate the reliability of our approach to overcome overstretches while decreasing the computational cost of the constraint enforcement process due to an iterative procedure that is eliminated.

Software-Enabled Project Management Techniques and Their Relationship to the Triple Constraints

Science.gov (United States)

Elleh, Festus U.

2013-01-01

This study investigated the relationship between software-enabled project management techniques and the triple constraints (time, cost, and scope). There was the dearth of academic literature that focused on the relationship between software-enabled project management techniques and the triple constraints (time, cost, and scope). Based on the gap…

Current constraints on the cosmic growth history

International Nuclear Information System (INIS)

Bean, Rachel; Tangmatitham, Matipon

2010-01-01

We present constraints on the cosmic growth history with recent cosmological data, allowing for deviations from ΛCDM as might arise if cosmic acceleration is due to modifications to general relativity or inhomogeneous dark energy. We combine measures of the cosmic expansion history, from Type 1a supernovae, baryon acoustic oscillations, and the cosmic microwave background (CMB), with constraints on the growth of structure from recent galaxy, CMB, and weak lensing surveys along with integated Sachs Wolfe-galaxy cross correlations. Deviations from ΛCDM are parameterized by phenomenological modifications to the Poisson equation and the relationship between the two Newtonian potentials. We find modifications that are present at the time the CMB is formed are tightly constrained through their impact on the well-measured CMB acoustic peaks. By contrast, constraints on late-time modifications to the growth history, as might arise if modifications are related to the onset of cosmic acceleration, are far weaker, but remain consistent with ΛCDM at the 95% confidence level. For these late-time modifications we find that differences in the evolution on large and small scales could provide an interesting signature by which to search for modified growth histories with future wide angular coverage, large scale structure surveys.

A Brownian dynamics study on ferrofluid colloidal dispersions using an iterative constraint method to satisfy Maxwell’s equations

Energy Technology Data Exchange (ETDEWEB)

Dubina, Sean Hyun, E-mail: sdubin2@uic.edu; Wedgewood, Lewis Edward, E-mail: wedge@uic.edu [Department of Chemical Engineering, University of Illinois at Chicago, 810 S. Clinton St. (MC 110), Chicago, Illinois 60607-4408 (United States)

2016-07-15

Ferrofluids are often favored for their ability to be remotely positioned via external magnetic fields. The behavior of particles in ferromagnetic clusters under uniformly applied magnetic fields has been computationally simulated using the Brownian dynamics, Stokesian dynamics, and Monte Carlo methods. However, few methods have been established that effectively handle the basic principles of magnetic materials, namely, Maxwell’s equations. An iterative constraint method was developed to satisfy Maxwell’s equations when a uniform magnetic field is imposed on ferrofluids in a heterogeneous Brownian dynamics simulation that examines the impact of ferromagnetic clusters in a mesoscale particle collection. This was accomplished by allowing a particulate system in a simple shear flow to advance by a time step under a uniformly applied magnetic field, then adjusting the ferroparticles via an iterative constraint method applied over sub-volume length scales until Maxwell’s equations were satisfied. The resultant ferrofluid model with constraints demonstrates that the magnetoviscosity contribution is not as substantial when compared to homogeneous simulations that assume the material’s magnetism is a direct response to the external magnetic field. This was detected across varying intensities of particle-particle interaction, Brownian motion, and shear flow. Ferroparticle aggregation was still extensively present but less so than typically observed.

A Brownian dynamics study on ferrofluid colloidal dispersions using an iterative constraint method to satisfy Maxwell’s equations

International Nuclear Information System (INIS)

Dubina, Sean Hyun; Wedgewood, Lewis Edward

2016-01-01

Ferrofluids are often favored for their ability to be remotely positioned via external magnetic fields. The behavior of particles in ferromagnetic clusters under uniformly applied magnetic fields has been computationally simulated using the Brownian dynamics, Stokesian dynamics, and Monte Carlo methods. However, few methods have been established that effectively handle the basic principles of magnetic materials, namely, Maxwell’s equations. An iterative constraint method was developed to satisfy Maxwell’s equations when a uniform magnetic field is imposed on ferrofluids in a heterogeneous Brownian dynamics simulation that examines the impact of ferromagnetic clusters in a mesoscale particle collection. This was accomplished by allowing a particulate system in a simple shear flow to advance by a time step under a uniformly applied magnetic field, then adjusting the ferroparticles via an iterative constraint method applied over sub-volume length scales until Maxwell’s equations were satisfied. The resultant ferrofluid model with constraints demonstrates that the magnetoviscosity contribution is not as substantial when compared to homogeneous simulations that assume the material’s magnetism is a direct response to the external magnetic field. This was detected across varying intensities of particle-particle interaction, Brownian motion, and shear flow. Ferroparticle aggregation was still extensively present but less so than typically observed.

Giant Panda Maternal Care: A Test of the Experience Constraint Hypothesis

Science.gov (United States)

Snyder, Rebecca J.; Perdue, Bonnie M.; Zhang, Zhihe; Maple, Terry L.; Charlton, Benjamin D.

2016-01-01

The body condition constraint and the experience condition constraint hypotheses have both been proposed to account for differences in reproductive success between multiparous (experienced) and primiparous (first-time) mothers. However, because primiparous mothers are typically characterized by both inferior body condition and lack of experience when compared to multiparous mothers, interpreting experience related differences in maternal care as support for either the body condition constraint hypothesis or the experience constraint hypothesis is extremely difficult. Here, we examined maternal behaviour in captive giant pandas, allowing us to simultaneously control for body condition and provide a rigorous test of the experience constraint hypothesis in this endangered animal. We found that multiparous mothers spent more time engaged in key maternal behaviours (nursing, grooming, and holding cubs) and had significantly less vocal cubs than primiparous mothers. This study provides the first evidence supporting the experience constraint hypothesis in the order Carnivora, and may have utility for captive breeding programs in which it is important to monitor the welfare of this species’ highly altricial cubs, whose survival is almost entirely dependent on receiving adequate maternal care during the first few weeks of life. PMID:27272352

Effective constraint algebras with structure functions

International Nuclear Information System (INIS)

Bojowald, Martin; Brahma, Suddhasattwa

2016-01-01

This article presents the result that fluctuations and higher moments of a state, by themselves, do not imply quantum corrections in structure functions of constrained systems. Moment corrections are isolated from other types of quantum effects, such as factor-ordering choices and regularization, by introducing a new condition with two parts: (i) having a direct (or faithful) quantization of the classical structure functions, (ii) free of factor-ordering ambiguities. In particular, it is assumed that the classical constraints can be quantized in an anomaly free way, so that properties of the resulting constraint algebras can be derived. If the two-part condition is not satisfied, effective constraints can still be evaluated, but quantum effects may be stronger. Consequences for canonical quantum gravity, whose structure functions encode space–time structure, are discussed. In particular, deformed algebras found in models of loop quantum gravity provide reliable information even in the Planck regime. (paper)

A comparison of step-and-shoot leaf sequencing algorithms that eliminate tongue-and-groove effects

Energy Technology Data Exchange (ETDEWEB)

Kamath, Srijit [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Sahni, Sartaj [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Ranka, Sanjay [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Li, Jonathan [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States); Palta, Jatinder [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States)

2004-07-21

The performances of three recently published leaf sequencing algorithms for step-and-shoot intensity-modulated radiation therapy delivery that eliminates tongue-and-groove underdosage are evaluated. Proofs are given to show that the algorithm of Que et al (2004 Phys. Med. Biol. 49 399-405) generates leaf sequences free of tongue-and-groove underdosage and interdigitation. However, the total beam-on times could be up to n times those of the sequences generated by the algorithms of Kamath et al (2004 Phys. Med. Biol. 49 N7-N19), which are optimal in beam-on time for unidirectional leaf movement under the same constraints, where n is the total number of involved leaf pairs. Using 19 clinical fluence matrices and 100 000 randomly generated 15 x 15 matrices, the average monitor units and number of segments of the leaf sequences generated using the algorithm of Que et al are about two to four times those generated by the algorithm of Kamath et al.

A comparison of step-and-shoot leaf sequencing algorithms that eliminate tongue-and-groove effects

International Nuclear Information System (INIS)

Kamath, Srijit; Sahni, Sartaj; Ranka, Sanjay; Li, Jonathan; Palta, Jatinder

2004-01-01

The performances of three recently published leaf sequencing algorithms for step-and-shoot intensity-modulated radiation therapy delivery that eliminates tongue-and-groove underdosage are evaluated. Proofs are given to show that the algorithm of Que et al (2004 Phys. Med. Biol. 49 399-405) generates leaf sequences free of tongue-and-groove underdosage and interdigitation. However, the total beam-on times could be up to n times those of the sequences generated by the algorithms of Kamath et al (2004 Phys. Med. Biol. 49 N7-N19), which are optimal in beam-on time for unidirectional leaf movement under the same constraints, where n is the total number of involved leaf pairs. Using 19 clinical fluence matrices and 100 000 randomly generated 15 x 15 matrices, the average monitor units and number of segments of the leaf sequences generated using the algorithm of Que et al are about two to four times those generated by the algorithm of Kamath et al

The association between choice stepping reaction time and falls in older adults--a path analysis model

NARCIS (Netherlands)

Pijnappels, M.A.G.M.; Delbaere, K.; Sturnieks, D.L.; Lord, S.R.

2010-01-01

Background: choice stepping reaction time (CSRT) is a functional measure that has been shown to significantly discriminate older fallers from non-fallers. Objective: to investigate how physiological and cognitive factors mediate the association between CSRT performance and multiple falls by use of

Control of Petri nets subject to strict temporal constraints using Max-Plus algebra

Science.gov (United States)

Tebani, K.; Amari, S.; Kara, R.

2018-04-01

In this paper, we treat the control problem of timed discrete event systems under temporal constraints. This type of constraint is very frequent in production systems, transportation network and in networked automation systems. Precisely, we are interested in the validation of strict temporal constraints imposed on the paths in a timed event graph (TEG) by using Max-Plus algebra. Not all the transitions of the considered TEG model are controllable, i.e. only the input transitions are controllable. An analytical approach for computing state feedback controllers is developed. Sufficient condition is given for the existence of causal control laws satisfying the temporal constraints. In the first, a TEG with observable transitions is considered. Then, the proposed approach is extended to the partially observable TEG. The synthesised feedback can be interpreted by places of control connected to the TEG to guarantee the respect of the time constraints. The proposed method is illustrated in the assembly system example.

Intake flow and time step analysis in the modeling of a direct injection Diesel engine

Energy Technology Data Exchange (ETDEWEB)

Zancanaro Junior, Flavio V.; Vielmo, Horacio A. [Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Mechanical Engineering Dept.], E-mails: zancanaro@mecanica.ufrgs.br, vielmoh@mecanica.ufrgs.br

2010-07-01

This paper discusses the effects of the time step on turbulence flow structure in the intake and in-cylinder systems of a Diesel engine during the intake process, under the motored condition. The three-dimensional modeling of a reciprocating engine geometry comprising a bowl-in-piston combustion chamber, intake port of shallow ramp helical type and exhaust port of conventional type. The equations are numerically solved, including a transient analysis, valves and piston movements, for engine speed of 1500 rpm, using a commercial Finite Volumes CFD code. A parallel computation is employed. For the purpose of examining the in-cylinder turbulence characteristics two parameters are observed: the discharge coefficient and swirl ratio. This two parameters quantify the fluid flow characteristics inside cylinder in the intake stroke, therefore, it is very important their study and understanding. Additionally, the evolution of the discharge coefficient and swirl ratio, along crank angle, are correlated and compared, with the objective of clarifying the physical mechanisms. Regarding the turbulence, computations are performed with the Eddy Viscosity Model k-u SST, in its Low-Reynolds approaches, with standard near wall treatment. The system of partial differential equations to be solved consists of the Reynolds-averaged compressible Navier-Stokes equations with the constitutive relations for an ideal gas, and using a segregated solution algorithm. The enthalpy equation is also solved. A moving hexahedral trimmed mesh independence study is presented. In the same way many convergence tests are performed, and a secure criterion established. The results of the pressure fields are shown in relation to vertical plane that passes through the valves. Areas of low pressure can be seen in the valve curtain region, due to strong jet flows. Also, it is possible to note divergences between the time steps, mainly for the smaller time step. (author)

Impact of leaf motion constraints on IMAT plan quality, deliver accuracy, and efficiency

International Nuclear Information System (INIS)

Chen Fan; Rao Min; Ye Jinsong; Shepard, David M.; Cao Daliang

2011-01-01

Purpose: Intensity modulated arc therapy (IMAT) is a radiation therapy delivery technique that combines the efficiency of arc based delivery with the dose painting capabilities of intensity modulated radiation therapy (IMRT). A key challenge in developing robust inverse planning solutions for IMAT is the need to account for the connectivity of the beam shapes as the gantry rotates from one beam angle to the next. To overcome this challenge, inverse planning solutions typically impose a leaf motion constraint that defines the maximum distance a multileaf collimator (MLC) leaf can travel between adjacent control points. The leaf motion constraint ensures the deliverability of the optimized plan, but it also impacts the plan quality, the delivery accuracy, and the delivery efficiency. In this work, the authors have studied leaf motion constraints in detail and have developed recommendations for optimizing the balance between plan quality and delivery efficiency. Methods: Two steps were used to generate optimized IMAT treatment plans. The first was the direct machine parameter optimization (DMPO) inverse planning module in the Pinnacle 3 planning system. Then, a home-grown arc sequencer was applied to convert the optimized intensity maps into deliverable IMAT arcs. IMAT leaf motion constraints were imposed using limits of between 1 and 30 mm/deg. Dose distributions were calculated using the convolution/superposition algorithm in the Pinnacle 3 planning system. The IMAT plan dose calculation accuracy was examined using a finer sampling calculation and the quality assurance verification. All plans were delivered on an Elekta Synergy with an 80-leaf MLC and were verified using an IBA MatriXX 2D ion chamber array inserted in a MultiCube solid water phantom. Results: The use of a more restrictive leaf motion constraint (less than 1-2 mm/deg) results in inferior plan quality. A less restrictive leaf motion constraint (greater than 5 mm/deg) results in improved plan quality

Transportation Energy Futures Series: Vehicle Technology Deployment Pathways: An Examination of Timing and Investment Constraints

Energy Technology Data Exchange (ETDEWEB)

Plotkin, S.; Stephens, T.; McManus, W.

2013-03-01

Scenarios of new vehicle technology deployment serve various purposes; some will seek to establish plausibility. This report proposes two reality checks for scenarios: (1) implications of manufacturing constraints on timing of vehicle deployment and (2) investment decisions required to bring new vehicle technologies to market. An estimated timeline of 12 to more than 22 years from initial market introduction to saturation is supported by historical examples and based on the product development process. Researchers also consider the series of investment decisions to develop and build the vehicles and their associated fueling infrastructure. A proposed decision tree analysis structure could be used to systematically examine investors' decisions and the potential outcomes, including consideration of cash flow and return on investment. This method requires data or assumptions about capital cost, variable cost, revenue, timing, and probability of success/failure, and would result in a detailed consideration of the value proposition of large investments and long lead times. This is one of a series of reports produced as a result of the Transportation Energy Futures (TEF) project, a Department of Energy-sponsored multi-agency effort to pinpoint underexplored strategies for abating GHGs and reducing petroleum dependence related to transportation.

Transportation Energy Futures Series. Vehicle Technology Deployment Pathways. An Examination of Timing and Investment Constraints

Energy Technology Data Exchange (ETDEWEB)

Plotkin, Steve [Argonne National Lab. (ANL), Argonne, IL (United States); Stephens, Thomas [Argonne National Lab. (ANL), Argonne, IL (United States); McManus, Walter [Oakland Univ., Rochester, MI (United States)

2013-03-01

Scenarios of new vehicle technology deployment serve various purposes; some will seek to establish plausibility. This report proposes two reality checks for scenarios: (1) implications of manufacturing constraints on timing of vehicle deployment and (2) investment decisions required to bring new vehicle technologies to market. An estimated timeline of 12 to more than 22 years from initial market introduction to saturation is supported by historical examples and based on the product development process. Researchers also consider the series of investment decisions to develop and build the vehicles and their associated fueling infrastructure. A proposed decision tree analysis structure could be used to systematically examine investors' decisions and the potential outcomes, including consideration of cash flow and return on investment. This method requires data or assumptions about capital cost, variable cost, revenue, timing, and probability of success/failure, and would result in a detailed consideration of the value proposition of large investments and long lead times. This is one of a series of reports produced as a result of the Transportation Energy Futures (TEF) project, a Department of Energy-sponsored multi-agency effort to pinpoint underexplored strategies for abating GHGs and reducing petroleum dependence related to transportation.

Real-Time Incompressible Fluid Simulation on the GPU

Directory of Open Access Journals (Sweden)

Xiao Nie

2015-01-01

Full Text Available We present a parallel framework for simulating incompressible fluids with predictive-corrective incompressible smoothed particle hydrodynamics (PCISPH on the GPU in real time. To this end, we propose an efficient GPU streaming pipeline to map the entire computational task onto the GPU, fully exploiting the massive computational power of state-of-the-art GPUs. In PCISPH-based simulations, neighbor search is the major performance obstacle because this process is performed several times at each time step. To eliminate this bottleneck, an efficient parallel sorting method for this time-consuming step is introduced. Moreover, we discuss several optimization techniques including using fast on-chip shared memory to avoid global memory bandwidth limitations and thus further improve performance on modern GPU hardware. With our framework, the realism of real-time fluid simulation is significantly improved since our method enforces incompressibility constraint which is typically ignored due to efficiency reason in previous GPU-based SPH methods. The performance results illustrate that our approach can efficiently simulate realistic incompressible fluid in real time and results in a speed-up factor of up to 23 on a high-end NVIDIA GPU in comparison to single-threaded CPU-based implementation.

Influence of step complexity and presentation style on step performance of computerized emergency operating procedures

Energy Technology Data Exchange (ETDEWEB)

Xu Song [Department of Industrial Engineering, Tsinghua University, Beijing 100084 (China); Li Zhizhong [Department of Industrial Engineering, Tsinghua University, Beijing 100084 (China)], E-mail: zzli@tsinghua.edu.cn; Song Fei; Luo Wei; Zhao Qianyi; Salvendy, Gavriel [Department of Industrial Engineering, Tsinghua University, Beijing 100084 (China)

2009-02-15

With the development of information technology, computerized emergency operating procedures (EOPs) are taking the place of paper-based ones. However, ergonomics issues of computerized EOPs have not been studied adequately since the industrial practice is quite limited yet. This study examined the influence of step complexity and presentation style of EOPs on step performance. A simulated computerized EOP system was developed in two presentation styles: Style A: one- and two-dimensional flowcharts combination; Style B: two-dimensional flowchart and success logic tree combination. Step complexity was quantified by a complexity measure model based on an entropy concept. Forty subjects participated in the experiment of EOP execution using the simulated system. The results of data analysis on the experiment data indicate that step complexity and presentation style could significantly influence step performance (both step error rate and operation time). Regression models were also developed. The regression analysis results imply that operation time of a step could be well predicted by step complexity while step error rate could only partly predicted by it. The result of a questionnaire investigation implies that step error rate was influenced not only by the operation task itself but also by other human factors. These findings may be useful for the design and assessment of computerized EOPs.

The Time-Course of Morphological Constraints: Evidence from Eye-Movements during Reading

Science.gov (United States)

Cunnings, Ian; Clahsen, Harald

2007-01-01

Lexical compounds in English are constrained in that the non-head noun can be an irregular but not a regular plural (e.g. mice eater vs. *rats eater), a contrast that has been argued to derive from a morphological constraint on modifiers inside compounds. In addition, bare nouns are preferred over plural forms inside compounds (e.g. mouse eater…

The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

2009-01-01

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems

Directory of Open Access Journals (Sweden)

Roberto Amadini

2016-06-01

Full Text Available In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.

Towards optimized suppression of dephasing in systems subject to pulse timing constraints

International Nuclear Information System (INIS)

Hodgson, Thomas E.; D'Amico, Irene; Viola, Lorenza

2010-01-01

We investigate the effectiveness of different dynamical decoupling protocols for storage of a single qubit in the presence of a purely dephasing bosonic bath, with emphasis on comparing quantum coherence preservation under uniform versus nonuniform delay times between pulses. In the limit of instantaneous bit-flip pulses, this is accomplished by establishing a different representation of the controlled qubit evolution, where the decoherence behavior after an arbitrary number of pulses is directly expressed in terms of the uncontrolled decoherence function. In particular, analytical expressions are obtained for approximation of the long- and short-term coherence behavior for both Ohmic and supra-Ohmic environments. By focusing on the realistic case of pure dephasing in an excitonic qubit, we quantitatively assess the impact of physical constraints on achievable pulse separations, and show that little advantage of high-level decoupling schemes based on concatenated or optimal design may be expected if pulses cannot be applied sufficiently fast. In such constrained scenarios, we demonstrate how simple modifications of repeated periodic-echo protocols can offer significantly improved coherence preservation in realistic parameter regimes. We expect similar conclusions to be relevant to other constrained qubit devices exposed to quantum or classical phase noise.

Multiple time step molecular dynamics in the optimized isokinetic ensemble steered with the molecular theory of solvation: Accelerating with advanced extrapolation of effective solvation forces

International Nuclear Information System (INIS)

Omelyan, Igor; Kovalenko, Andriy

2013-01-01

We develop efficient handling of solvation forces in the multiscale method of multiple time step molecular dynamics (MTS-MD) of a biomolecule steered by the solvation free energy (effective solvation forces) obtained from the 3D-RISM-KH molecular theory of solvation (three-dimensional reference interaction site model complemented with the Kovalenko-Hirata closure approximation). To reduce the computational expenses, we calculate the effective solvation forces acting on the biomolecule by using advanced solvation force extrapolation (ASFE) at inner time steps while converging the 3D-RISM-KH integral equations only at large outer time steps. The idea of ASFE consists in developing a discrete non-Eckart rotational transformation of atomic coordinates that minimizes the distances between the atomic positions of the biomolecule at different time moments. The effective solvation forces for the biomolecule in a current conformation at an inner time step are then extrapolated in the transformed subspace of those at outer time steps by using a modified least square fit approach applied to a relatively small number of the best force-coordinate pairs. The latter are selected from an extended set collecting the effective solvation forces obtained from 3D-RISM-KH at outer time steps over a broad time interval. The MTS-MD integration with effective solvation forces obtained by converging 3D-RISM-KH at outer time steps and applying ASFE at inner time steps is stabilized by employing the optimized isokinetic Nosé-Hoover chain (OIN) ensemble. Compared to the previous extrapolation schemes used in combination with the Langevin thermostat, the ASFE approach substantially improves the accuracy of evaluation of effective solvation forces and in combination with the OIN thermostat enables a dramatic increase of outer time steps. We demonstrate on a fully flexible model of alanine dipeptide in aqueous solution that the MTS-MD/OIN/ASFE/3D-RISM-KH multiscale method of molecular dynamics

Real-Time Optimization of a maturing North Sea gas asset with production constraints

NARCIS (Netherlands)

Linden, R.J.P. van der; Busking, T.E.

2013-01-01

As gas and oil fields mature their operation becomes increasingly more complex, due to complex process dynamics, like slugging, gas coning, water breakthrough, salt or hydrate deposition. Moreover these phenomena also lead to production constraints in the upstream facilities. This complexity asks

BIOMAP A Daily Time Step, Mechanistic Model for the Study of Ecosystem Dynamics

Science.gov (United States)

Wells, J. R.; Neilson, R. P.; Drapek, R. J.; Pitts, B. S.

2010-12-01

BIOMAP simulates competition between two Plant Functional Types (PFT) at any given point in the conterminous U.S. using a time series of daily temperature (mean, minimum, maximum), precipitation, humidity, light and nutrients, with PFT-specific rooting within a multi-layer soil. The model employs a 2-layer canopy biophysics, Farquhar photosynthesis, the Beer-Lambert Law for light attenuation and a mechanistic soil hydrology. In essence, BIOMAP is a re-built version of the biogeochemistry model, BIOME-BGC, into the form of the MAPSS biogeography model. Specific enhancements are: 1) the 2-layer canopy biophysics of Dolman (1993); 2) the unique MAPSS-based hydrology, which incorporates canopy evaporation, snow dynamics, infiltration and saturated and unsaturated percolation with ‘fast’ flow and base flow and a ‘tunable aquifer’ capacity, a metaphor of D’Arcy’s Law; and, 3) a unique MAPSS-based stomatal conductance algorithm, which simultaneously incorporates vapor pressure and soil water potential constraints, based on physiological information and many other improvements. Over small domains the PFTs can be parameterized as individual species to investigate fundamental vs. potential niche theory; while, at more coarse scales the PFTs can be rendered as more general functional groups. Since all of the model processes are intrinsically leaf to plot scale (physiology to PFT competition), it essentially has no ‘intrinsic’ scale and can be implemented on a grid of any size, taking on the characteristics defined by the homogeneous climate of each grid cell. Currently, the model is implemented on the VEMAP 1/2 degree, daily grid over the conterminous U.S. Although both the thermal and water-limited ecotones are dynamic, following climate variability, the PFT distributions remain fixed. Thus, the model is currently being fitted with a ‘reproduction niche’ to allow full dynamic operation as a Dynamic General Vegetation Model (DGVM). While global simulations

A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

Science.gov (United States)

Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

Equations of motion as constraints: superselection rules, Ward identities

Energy Technology Data Exchange (ETDEWEB)

Asorey, M. [Departamento de Física Teórica, Universidad de Zaragoza,C/Pedro Cerbuna 12, E-50009 Zaragoza (Spain); Balachandran, A.P. [Physics Department, Syracuse University,Physics Building Syracuse, NY 13244 (United States); Institute of Mathematical Sciences, C.I.T Campus,Taramani Chennai 600113 (India); Lizzi, F. [Dipartimento di Fisica “E. Pancini” Università di Napoli Federico II,Via Cintia, 80126 Napoli (Italy); INFN - Sezione di Napoli,Via Cintia, 80126 Napoli (Italy); Departament de Estructura i Constituents de la Matèria, Institut de Ciéncies del Cosmos,Universitat de Barcelona, Diagonal 647, 08028 Barcelona, Catalonia (Spain); Marmo, G. [Dipartimento di Fisica “E. Pancini” Università di Napoli Federico II,Via Cintia, 80126 Napoli (Italy); INFN - Sezione di Napoli,Via Cintia, 80126 Napoli (Italy)

2017-03-27

The meaning of local observables is poorly understood in gauge theories, not to speak of quantum gravity. As a step towards a better understanding we study asymptotic (infrared) transformations in local quantum physics. Our observables are smeared by test functions, at first vanishing at infinity. In this context we show that the equations of motion can be seen as constraints, which generate a group, the group of space and time dependent gauge transformations. This is one of the main points of the paper. Infrared nontrivial effects are captured allowing test functions which do not vanish at infinity. These extended operators generate a larger group. The quotient of the two groups generate superselection sectors, which differentiate different infrared sectors. The BMS group changes the superselection sector, a result long known for its Lorentz subgroup. It is hence spontaneously broken. Ward identities implied by the gauge invariance of the S-matrix generalize the standard results and lead to charge conservation and low energy theorems. Their validity does not require Lorentz invariance.

An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage

Directory of Open Access Journals (Sweden)

German Gramajo

2017-01-01

Full Text Available A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of flight. Comparisons of this formulation to a path planning algorithm based on those with time constraint show equivalent coverage performance but improvement in prediction of overall mission duration and accuracy of the terminal position of the vehicle.

Consumption estimation in system design for real time embedded applications; Estimation de la consommation dans la conception systeme des applications embarquees temps reel

Energy Technology Data Exchange (ETDEWEB)

Laurent, J.

2002-12-15

Today, power and energy consumption have become, as time and area, an important constraint when you design a system. Indeed modern applications use more and more processing and memory resources so these lead a significant increase of consumption. Furthermore, embedded software impact is preponderant in real time system so the code optimisation has a great impact onto the consumption constraint. Several research teams have already developed estimation methodologies for processor but almost are at instruction level (ILPA). With this kind of method you have to measure the consumption of each instruction of the instruction set and also the inter-instruction consumption overhead. For complex architecture, this kind of methodology is not adapted due to the prohibitive number of consumption measures. So the characterisation time of this kind of architecture is too important furthermore with this method is very difficult to take into account the external environment. For actual architecture another method is needed to reduce the characterisation time while preserving the accuracy. The reduction of the characterisation time have to be realized by increasing the abstraction level. So, we propose here a new approach based on a functional and architectural analysis of the target in consumption point of view (FLPA). Our methodology has two steps: the first one is a modeling step and the second is estimation step. (author)

Distributed Task Rescheduling With Time Constraints for the Optimization of Total Task Allocations in a Multirobot System.

Science.gov (United States)

Turner, Joanna; Meng, Qinggang; Schaefer, Gerald; Whitbrook, Amanda; Soltoggio, Andrea

2017-09-28

This paper considers the problem of maximizing the number of task allocations in a distributed multirobot system under strict time constraints, where other optimization objectives need also be considered. It builds upon existing distributed task allocation algorithms, extending them with a novel method for maximizing the number of task assignments. The fundamental idea is that a task assignment to a robot has a high cost if its reassignment to another robot creates a feasible time slot for unallocated tasks. Multiple reassignments among networked robots may be required to create a feasible time slot and an upper limit to this number of reassignments can be adjusted according to performance requirements. A simulated rescue scenario with task deadlines and fuel limits is used to demonstrate the performance of the proposed method compared with existing methods, the consensus-based bundle algorithm and the performance impact (PI) algorithm. Starting from existing (PI-generated) solutions, results show up to a 20% increase in task allocations using the proposed method.

Influence of step-height and body mass on gastrocnemius muscle fascicle behavior during stair ascent.

NARCIS (Netherlands)

Spanjaard, M.; Reeves, N.D.; van Dieen, J.H.; Baltzopoulos, V.; Maganaris, C.N.

2008-01-01

To better understand the role of the ankle plantar flexor muscles in stair negotiation, we examined the effects of manipulation of kinematic and kinetic constraints on the behavior of the gastrocnemius medialis (GM) muscle during stair ascent. Ten subjects ascended a four-step staircase at four

Data Driven Constraints for the SVM

DEFF Research Database (Denmark)

Darkner, Sune; Clemmensen, Line Katrine Harder

2012-01-01

We propose a generalized data driven constraint for support vector machines exemplified by classification of paired observations in general and specifically on the human ear canal. This is particularly interesting in dynamic cases such as tissue movement or pathologies developing over time. Assum...

General constraints on the age and chemical evolution of the Galaxy

International Nuclear Information System (INIS)

Meyer, B.S.; Schramm, D.N.

1986-05-01

The formalism of Schramm and Wasserburg (1970) for determining the mean age of the elements is extended. Model-independent constraints (constraints that are independent of a specific form for the effective nucleosynthesis rate and Galactic chemical evolution over time) are derived on the first four terms in the expansion giving the mean age of the elements, and from these constraints limits are derived on the total duration of nucleosynthesis. These limits require only input of the Schramm-Wasserburg parameter Δ/sup max/ and of the ratio of the mean time for formation of the elements to the total duration of nucleosynthesis, t/sub nu//T. The former quantity is a function of nuclear input parameters. Limits on the latter are obtained from constraints on the relative rate of nucleosynthesis derived from the 232 Th/ 238 U, 235 U/ 238 U, and shorter-lived chronometric pairs. 65 refs

Time-step selection considerations in the analysis of reactor transients with DIF3D-K

International Nuclear Information System (INIS)

Taiwo, T.A.; Khalil, H.S.; Cahalan, J.E.; Morris, E.E.

1993-01-01

The DIF3D-K code solves the three-dimensional, time-dependent multigroup neutron diffusion equations by using a nodal approach for spatial discretization and either the theta method or one of three space-time factorization approaches for temporal integration of the nodal equations. The three space-time factorization options (namely, improved quasistatic, adiabatic and conventional point kinetics) were implemented because of their potential efficiency advantage for the analysis of transients in which the flux shape changes more slowly than its amplitude. Here we describe the implementation of DIF3D-K as the neutronics module within the SAS-HWR accident analysis code. We also describe the neutronics-related time step selection algorithms and their influence on the accuracy and efficiency of the various solution options

Serious Leisure and People with Orthopedic Impairment: Benefits and Constraints

Directory of Open Access Journals (Sweden)

Manolya AKSATAN

2017-12-01

Full Text Available There are many people around the world who have different types of disabilities. Understanding their needs is the first step of developing policies to increase their quality of life and satisfaction. Leisure is an essential need of disabled people and it plays an important role in disabled people’s lives. The purpose of this study is to gain a deep understanding on the serious leisure activities of people with orthopedic impairment, and also both benefits and constraints involved with serious leisure. Therefore, semi-structured in-depth interviews were conducted with 17 people who have orthopedic impairment. The data collected through interviews was analyzed by using a coding process. Findings of the study indicate that people with orthopedic impairment pursue many leisure activities. The research revealed that the participants were aware of significant individual and community benefits of serious leisure activities. Although the benefits of leisure for private and community life are obvious for people with orthopedic impairment, it is not always easy for them to pursue serious leisure activities. Disabled people recognize that there are many constraints involved with serious leisure. Based on the findings, these constraints are explained as psychological factors, family support, level of orthopedic impairment, community awareness and environmental factors, work and income.

Associations of office workers' objectively assessed occupational sitting, standing and stepping time with musculoskeletal symptoms.

Science.gov (United States)

Coenen, Pieter; Healy, Genevieve N; Winkler, Elisabeth A H; Dunstan, David W; Owen, Neville; Moodie, Marj; LaMontagne, Anthony D; Eakin, Elizabeth A; O'Sullivan, Peter B; Straker, Leon M

2018-04-22

We examined the association of musculoskeletal symptoms (MSS) with workplace sitting, standing and stepping time, as well as sitting and standing time accumulation (i.e. usual bout duration of these activities), measured objectively with the activPAL3 monitor. Using baseline data from the Stand Up Victoria trial (216 office workers, 14 workplaces), cross-sectional associations of occupational activities with self-reported MSS (low-back, upper and lower extremity symptoms in the last three months) were examined using probit regression, correcting for clustering and adjusting for confounders. Sitting bout duration was significantly (p < 0.05) associated, non-linearly, with MSS, such that those in the middle tertile displayed the highest prevalence of upper extremity symptoms. Other associations were non-significant but sometimes involved large differences in symptom prevalence (e.g. 38%) by activity. Though causation is unclear, these non-linear associations suggest that sitting and its alternatives (i.e. standing and stepping) interact with MSS and this should be considered when designing safe work systems. Practitioner summary: We studied associations of objectively assessed occupational activities with musculoskeletal symptoms in office workers. Workers who accumulated longer sitting bouts reported fewer upper extremity symptoms. Total activity duration was not significantly associated with musculoskeletal symptoms. We underline the importance of considering total volumes and patterns of activity time in musculoskeletal research.

Effect of time step size and turbulence model on the open water hydrodynamic performance prediction of contra-rotating propellers

Science.gov (United States)

Wang, Zhan-zhi; Xiong, Ying

2013-04-01

A growing interest has been devoted to the contra-rotating propellers (CRPs) due to their high propulsive efficiency, torque balance, low fuel consumption, low cavitations, low noise performance and low hull vibration. Compared with the single-screw system, it is more difficult for the open water performance prediction because forward and aft propellers interact with each other and generate a more complicated flow field around the CRPs system. The current work focuses on the open water performance prediction of contra-rotating propellers by RANS and sliding mesh method considering the effect of computational time step size and turbulence model. The validation study has been performed on two sets of contra-rotating propellers developed by David W Taylor Naval Ship R & D center. Compared with the experimental data, it shows that RANS with sliding mesh method and SST k-ω turbulence model has a good precision in the open water performance prediction of contra-rotating propellers, and small time step size can improve the level of accuracy for CRPs with the same blade number of forward and aft propellers, while a relatively large time step size is a better choice for CRPs with different blade numbers.

Robust and Energy-Efficient Ultra-Low-Voltage Circuit Design under Timing Constraints in 65/45 nm CMOS

Directory of Open Access Journals (Sweden)

David Bol

2011-01-01

Full Text Available Ultra-low-voltage operation improves energy efficiency of logic circuits by a factor of 10×, at the expense of speed, which is acceptable for applications with low-to-medium performance requirements such as RFID, biomedical devices and wireless sensors. However, in 65/45 nm CMOS, variability and short-channel effects significantly harm robustness and timing closure of ultra-low-voltage circuits by reducing noise margins and jeopardizing gate delays. The consequent guardband on the supply voltage to meet a reasonable manufacturing yield potentially ruins energy efficiency. Moreover, high leakage currents in these technologies degrade energy efficiency in case of long stand-by periods. In this paper, we review recently published techniques to design robust and energy-efficient ultra-low-voltage circuits in 65/45 nm CMOS under relaxed yet strict timing constraints.

The effects of perceived leisure constraints among Korean university students

Science.gov (United States)

Sae-Sook Oh; Sei-Yi Oh; Linda L. Caldwell

2002-01-01

This study is based on Crawford, Jackson, and Godbey's model of leisure constraints (1991), and examines the relationships between the influences of perceived constraints, frequency of participation, and health status in the context of leisure-time outdoor activities. The study was based on a sample of 234 Korean university students. This study provides further...

Intraindividual Stepping Reaction Time Variability Predicts Falls in Older Adults With Mild Cognitive Impairment.

Science.gov (United States)

Bunce, David; Haynes, Becky I; Lord, Stephen R; Gschwind, Yves J; Kochan, Nicole A; Reppermund, Simone; Brodaty, Henry; Sachdev, Perminder S; Delbaere, Kim

2017-06-01

Reaction time measures have considerable potential to aid neuropsychological assessment in a variety of health care settings. One such measure, the intraindividual reaction time variability (IIV), is of particular interest as it is thought to reflect neurobiological disturbance. IIV is associated with a variety of age-related neurological disorders, as well as gait impairment and future falls in older adults. However, although persons diagnosed with Mild Cognitive Impairment (MCI) are at high risk of falling, the association between IIV and prospective falls is unknown. We conducted a longitudinal cohort study in cognitively intact (n = 271) and MCI (n = 154) community-dwelling adults aged 70-90 years. IIV was assessed through a variety of measures including simple and choice hand reaction time and choice stepping reaction time tasks (CSRT), the latter administered as a single task and also with a secondary working memory task. Logistic regression did not show an association between IIV on the hand-held tasks and falls. Greater IIV in both CSRT tasks, however, did significantly increase the risk of future falls. This effect was specific to the MCI group, with a stronger effect in persons exhibiting gait, posture, or physiological impairment. The findings suggest that increased stepping IIV may indicate compromised neural circuitry involved in executive function, gait, and posture in persons with MCI increasing their risk of falling. IIV measures have potential to assess neurobiological disturbance underlying physical and cognitive dysfunction in old age, and aid fall risk assessment and routine care in community and health care settings. © The Author 2016. Published by Oxford University Press on behalf of The Gerontological Society of America. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Combining experimental and cosmological constraints on heavy neutrinos

Directory of Open Access Journals (Sweden)

Marco Drewes

2017-08-01

Full Text Available We study experimental and cosmological constraints on the extension of the Standard Model by three right handed neutrinos with masses between those of the pion and W boson. We combine for the first time direct, indirect and cosmological constraints in this mass range. This includes experimental constraints from neutrino oscillation data, neutrinoless double β decay, electroweak precision data, lepton universality, searches for rare lepton decays, tests of CKM unitarity and past direct searches at colliders or fixed target experiments. On the cosmological side, big bang nucleosynthesis has the most pronounced impact. Our results can be used to evaluate the discovery potential of searches for heavy neutrinos at LHCb, BELLE II, SHiP, ATLAS, CMS or a future lepton collider.

Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming

KAUST Repository

Kouramas, K.I.

2011-08-01

This work presents a new algorithm for solving the explicit/multi- parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques. The algorithm features two key steps: (i) a dynamic programming step, in which the mp-MPC problem is decomposed into a set of smaller subproblems in which only the current control, state variables, and constraints are considered, and (ii) a multi-parametric programming step, in which each subproblem is solved as a convex multi-parametric programming problem, to derive the control variables as an explicit function of the states. The key feature of the proposed method is that it overcomes potential limitations of previous methods for solving multi-parametric programming problems with dynamic programming, such as the need for global optimization for each subproblem of the dynamic programming step. © 2011 Elsevier Ltd. All rights reserved.

Chance-Constrained Guidance With Non-Convex Constraints

Science.gov (United States)

Ono, Masahiro

2011-01-01

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of

On squaring the primary constraints in a generalized Hamiltonian dynamics

International Nuclear Information System (INIS)

Nesterenko, V.V.

1993-01-01

Consideration of the model of the relativistic particle with curvature and torsion in the three-dimensional space-time shows that the squaring of the primary constraints entails a wrong result. The complete set of the Hamiltonian constraints arising here corresponds to another model with an action similar but not identical with the initial action. 16 refs

Crack-tip constraint analyses and constraint-dependent LBB curves for circumferential through-wall cracked pipes

Energy Technology Data Exchange (ETDEWEB)

Chen, Y.L.; Wang, G.Z., E-mail: gzwang@ecust.edu.cn; Xuan, F.Z.; Tu, S.T.

2015-04-15

Highlights: • Solution of constraint parameter τ* for through-wall cracked pipes has been obtained. • Constraint increases with increasing crack length and radius–thickness ratio of pipes. • Constraint-dependent LBB curve for through-wall cracked pipes has been constructed. • For increasing accuracy of LBB assessments, constraint effect should be considered. - Abstract: The leak-before-break (LBB) concept has been widely applied in the structural integrity assessments of pressured pipes in nuclear power plants. However, the crack-tip constraint effects in LBB analyses and designs cannot be incorporated. In this paper, by using three-dimensional finite element calculations, the modified load-independent T-stress constraint parameter τ* for circumferential through-wall cracked pipes with different geometries and crack sizes has been analyzed under different loading conditions, and the solutions of the crack-tip constraint parameter τ* have been obtained. Based on the τ* solutions and constraint-dependent J–R curves of a steel, the constraint-dependent LBB (leak-before-break) curves have been constructed. The results show that the constraint τ* increases with increasing crack length θ, mean radius R{sub m} and radius–thickness ratio R{sub m}/t of the pipes. In LBB analyses, the critical crack length calculated by the J–R curve of the standard high constraint specimen for pipes with shorter cracks is over-conservative, and the degree of conservatism increases with decreasing crack length θ, R{sub m} and R{sub m}/t. Therefore, the constraint-dependent LBB curves should be constructed to modify the over-conservatism and increase accuracy of LBB assessments.

Step-to-step spatiotemporal variables and ground reaction forces of intra-individual fastest sprinting in a single session.

Science.gov (United States)

Nagahara, Ryu; Mizutani, Mirai; Matsuo, Akifumi; Kanehisa, Hiroaki; Fukunaga, Tetsuo

2018-06-01

We aimed to investigate the step-to-step spatiotemporal variables and ground reaction forces during the acceleration phase for characterising intra-individual fastest sprinting within a single session. Step-to-step spatiotemporal variables and ground reaction forces produced by 15 male athletes were measured over a 50-m distance during repeated (three to five) 60-m sprints using a long force platform system. Differences in measured variables between the fastest and slowest trials were examined at each step until the 22nd step using a magnitude-based inferences approach. There were possibly-most likely higher running speed and step frequency (2nd to 22nd steps) and shorter support time (all steps) in the fastest trial than in the slowest trial. Moreover, for the fastest trial there were likely-very likely greater mean propulsive force during the initial four steps and possibly-very likely larger mean net anterior-posterior force until the 17th step. The current results demonstrate that better sprinting performance within a single session is probably achieved by 1) a high step frequency (except the initial step) with short support time at all steps, 2) exerting a greater mean propulsive force during initial acceleration, and 3) producing a greater mean net anterior-posterior force during initial and middle acceleration.

Time-step selection considerations in the analysis of reactor transients with DIF3D-K

International Nuclear Information System (INIS)

Taiwo, T.A.; Khalil, H.S.; Cahalan, J.E.; Morris, E.E.

1993-01-01

The DIF3D-K code solves the three-dimensional, time-dependent multigroup neutron diffusion equations by using a nodal approach for spatial discretization and either the theta method or one of three space-time factorization approaches for temporal integration of the nodal equations. The three space-time factorization options (namely, improved quasistatic, adiabatic, and conventional point kinetics) were implemented because of their potential efficiency advantage for the analysis of transients in which the flux shape changes more slowly than its amplitude. In this paper, we describe the implementation of DIF3D-K as the neutronics module within the SAS-HWR accident analysis code. We also describe the neuronic-related time-step selection algorithms and their influence on the accuracy and efficiency of the various solution options

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

Directory of Open Access Journals (Sweden)

Liang Xu

2016-01-01

Full Text Available A new problem arises when an automated guided vehicle (AGV is dispatched to visit a set of customers, which are usually located along a fixed wire transmitting signal to navigate the AGV. An optimal visiting sequence is desired with the objective of minimizing the total travelling distance (or time. When precedence constraints are restricted on customers, the problem is referred to as traveling salesman problem on path with precedence constraints (TSPP-PC. Whether or not it is NP-complete has no answer in the literature. In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant. For the problem with number of precedence constraints, part of the input can be arbitrarily large, so we provide an efficient heuristic based on the exact algorithm.

Misconceptions and constraints

International Nuclear Information System (INIS)

Whitten, M.; Mahon, R.

2005-01-01

In theory, the sterile insect technique (SIT) is applicable to a wide variety of invertebrate pests. However, in practice, the approach has been successfully applied to only a few major pests. Chapters in this volume address possible reasons for this discrepancy, e.g. Klassen, Lance and McInnis, and Robinson and Hendrichs. The shortfall between theory and practice is partly due to the persistence of some common misconceptions, but it is mainly due to one constraint, or a combination of constraints, that are biological, financial, social or political in nature. This chapter's goal is to dispel some major misconceptions, and view the constraints as challenges to overcome, seeing them as opportunities to exploit. Some of the common misconceptions include: (1) released insects retain residual radiation, (2) females must be monogamous, (3) released males must be fully sterile, (4) eradication is the only goal, (5) the SIT is too sophisticated for developing countries, and (6) the SIT is not a component of an area-wide integrated pest management (AW-IPM) strategy. The more obvious constraints are the perceived high costs of the SIT, and the low competitiveness of released sterile males. The perceived high up-front costs of the SIT, their visibility, and the lack of private investment (compared with alternative suppression measures) emerge as serious constraints. Failure to appreciate the true nature of genetic approaches, such as the SIT, may pose a significant constraint to the wider adoption of the SIT and other genetically-based tactics, e.g. transgenic genetically modified organisms (GMOs). Lack of support for the necessary underpinning strategic research also appears to be an important constraint. Hence the case for extensive strategic research in ecology, population dynamics, genetics, and insect behaviour and nutrition is a compelling one. Raising the competitiveness of released sterile males remains the major research objective of the SIT. (author)

Linguistic embodiment and verbal constraints: human cognition and the scales of time

DEFF Research Database (Denmark)

Cowley, Stephen

2014-01-01

Using radical embodied cognitive science, the paper offers the hypothesis that language is symbiotic: its agent-environment dynamics arise as linguistic embodiment is managed under verbal constraints. As a result, co-action grants human agents the ability to use a unique form of phenomenal......, linguistic symbiosis grants access to diachronic resources. On this distributed-ecological view, language can thus be redefined as: “activity in which wordings play a part.”...

Sampled-data-based vibration control for structural systems with finite-time state constraint and sensor outage.

Science.gov (United States)

Weng, Falu; Liu, Mingxin; Mao, Weijie; Ding, Yuanchun; Liu, Feifei

2018-05-10

The problem of sampled-data-based vibration control for structural systems with finite-time state constraint and sensor outage is investigated in this paper. The objective of designing controllers is to guarantee the stability and anti-disturbance performance of the closed-loop systems while some sensor outages happen. Firstly, based on matrix transformation, the state-space model of structural systems with sensor outages and uncertainties appearing in the mass, damping and stiffness matrices is established. Secondly, by considering most of those earthquakes or strong winds happen in a very short time, and it is often the peak values make the structures damaged, the finite-time stability analysis method is introduced to constrain the state responses in a given time interval, and the H-infinity stability is adopted in the controller design to make sure that the closed-loop system has a prescribed level of disturbance attenuation performance during the whole control process. Furthermore, all stabilization conditions are expressed in the forms of linear matrix inequalities (LMIs), whose feasibility can be easily checked by using the LMI Toolbox. Finally, numerical examples are given to demonstrate the effectiveness of the proposed theorems. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Kinematic Constraints Associated with the Acquisition of Overarm Throwing Part I: Step and Trunk Actions

Science.gov (United States)

Stodden, David F.; Langendorfer, Stephen J.; Fleisig, Glenn S.; Andrews, James R.

2006-01-01

The purposes of this study were to: (a) examine differences within specific kinematic variables and ball velocity associated with developmental component levels of step and trunk action (Roberton & Halverson, 1984), and (b) if the differences in kinematic variables were significantly associated with the differences in component levels, determine…

New constraints on oscillations in the primordial spectrum of inflationary perturbations

Energy Technology Data Exchange (ETDEWEB)

Hamann, J.; Covi, L. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Melchiorri, A. [Univ. di Roma La Sapienza (Italy). Dipt. di Fisica and Sezione INFN; Slosar, A. [Oxford Univ. (United Kingdom). Dept. of Astrophysics]|[Ljubljana Univ. (Slovenia). Faculty of Mathematics and Physics

2007-01-15

We revisit the problem of constraining steps in the inflationary potential with cosmological data. We argue that a step in the inflationary potential produces qualitatively similar oscillations in the primordial power spectrum, independently of the details of the inflationary model. We propose a phenomenological description of these oscillations and constrain these features using a selection of cosmological data including the baryonic peak data from the correlation function of luminous red galaxies in the Sloan Digital Sky Survey. Our results show that degeneracies of the oscillation with standard cosmological parameters are virtually non-existent. The inclusion of new data severely tightens the constraints on the parameter space of oscillation parameters with respect to older work. This confirms that extensions to the simplest inflationary models can be successfully constrained using cosmological data. (orig.)

New constraints on oscillations in the primordial spectrum of inflationary perturbations

International Nuclear Information System (INIS)

Hamann, J.; Covi, L.; Melchiorri, A.; Slosar, A.; Ljubljana Univ.

2007-01-01

We revisit the problem of constraining steps in the inflationary potential with cosmological data. We argue that a step in the inflationary potential produces qualitatively similar oscillations in the primordial power spectrum, independently of the details of the inflationary model. We propose a phenomenological description of these oscillations and constrain these features using a selection of cosmological data including the baryonic peak data from the correlation function of luminous red galaxies in the Sloan Digital Sky Survey. Our results show that degeneracies of the oscillation with standard cosmological parameters are virtually non-existent. The inclusion of new data severely tightens the constraints on the parameter space of oscillation parameters with respect to older work. This confirms that extensions to the simplest inflationary models can be successfully constrained using cosmological data. (orig.)

Impact of first-step potential and time on the vertical growth of ZnO nanorods on ITO substrate by two-step electrochemical deposition

International Nuclear Information System (INIS)

Kim, Tae Gyoum; Jang, Jin-Tak; Ryu, Hyukhyun; Lee, Won-Jae

2013-01-01

Highlights: •We grew vertical ZnO nanorods on ITO substrate using a two-step continuous potential process. •The nucleation for the ZnO nanorods growth was changed by first-step potential and duration. •The vertical ZnO nanorods were well grown when first-step potential was −1.2 V and 10 s. -- Abstract: In this study, we analyzed the growth of ZnO nanorods on an ITO (indium doped tin oxide) substrate by electrochemical deposition using a two-step, continuous potential process. We examined the effect of changing the first-step potential as well as the first-step duration on the morphological, structural and optical properties of ZnO nanorods, measured via using field emission scanning electron microscopy (FE-SEM), X-ray diffraction (XRD) and photoluminescence (PL), respectively. As a result, vertical ZnO nanorods were grown on ITO substrate without the need for a template when the first-step potential was set to −1.2 V for a duration of 10 s, and the second-step potential was set to −0.7 V for a duration of 1190 s. The ZnO nanorods on this sample showed the highest XRD (0 0 2)/(1 0 0) peak intensity ratio and the highest PL near band edge emission to deep level emission peak intensity ratio (NBE/DLE). In this study, the nucleation for vertical ZnO nanorod growth on an ITO substrate was found to be affected by changes in the first-step potential and first-step duration

Imposing motion constraints to a force reflecting tele-robot through real-time simulation of a virtual mechanism

Energy Technology Data Exchange (ETDEWEB)

Joly, L.; Andriot, C.

1995-12-31

In a tele-operation system, assistance can be given to the operator by constraining the tele-robot position to remain within a restricted subspace of its workspace. A new approach to motion constraint is presented in this paper. The control law is established simulating a virtual ideal mechanism acting as a jig, and connected to the master and slave arms via springs and dampers. Using this approach, it is possible to impose any (sufficiently smooth) motion constraint to the system, including non linear constraints (complex surfaces) involving coupling between translations and rotations and physical equivalence ensures that the controller is passive. Experimental results obtained with a 6-DOF tele-operation system are given. Other applications of the virtual mechanism concept include hybrid position-force control and haptic interfaces. (authors). 11 refs., 7 figs.

Imposing motion constraints to a force reflecting tele-robot through real-time simulation of a virtual mechanism

International Nuclear Information System (INIS)

Joly, L.; Andriot, C.

1995-01-01

In a tele-operation system, assistance can be given to the operator by constraining the tele-robot position to remain within a restricted subspace of its workspace. A new approach to motion constraint is presented in this paper. The control law is established simulating a virtual ideal mechanism acting as a jig, and connected to the master and slave arms via springs and dampers. Using this approach, it is possible to impose any (sufficiently smooth) motion constraint to the system, including non linear constraints (complex surfaces) involving coupling between translations and rotations and physical equivalence ensures that the controller is passive. Experimental results obtained with a 6-DOF tele-operation system are given. Other applications of the virtual mechanism concept include hybrid position-force control and haptic interfaces. (authors). 11 refs., 7 figs

An L1-norm phase constraint for half-Fourier compressed sensing in 3D MR imaging.

Science.gov (United States)

Li, Guobin; Hennig, Jürgen; Raithel, Esther; Büchert, Martin; Paul, Dominik; Korvink, Jan G; Zaitsev, Maxim

2015-10-01

In most half-Fourier imaging methods, explicit phase replacement is used. In combination with parallel imaging, or compressed sensing, half-Fourier reconstruction is usually performed in a separate step. The purpose of this paper is to report that integration of half-Fourier reconstruction into iterative reconstruction minimizes reconstruction errors. The L1-norm phase constraint for half-Fourier imaging proposed in this work is compared with the L2-norm variant of the same algorithm, with several typical half-Fourier reconstruction methods. Half-Fourier imaging with the proposed phase constraint can be seamlessly combined with parallel imaging and compressed sensing to achieve high acceleration factors. In simulations and in in-vivo experiments half-Fourier imaging with the proposed L1-norm phase constraint enables superior performance both reconstruction of image details and with regard to robustness against phase estimation errors. The performance and feasibility of half-Fourier imaging with the proposed L1-norm phase constraint is reported. Its seamless combination with parallel imaging and compressed sensing enables use of greater acceleration in 3D MR imaging.

Estimation of DSGE Models under Diffuse Priors and Data-Driven Identification Constraints

DEFF Research Database (Denmark)

Lanne, Markku; Luoto, Jani

We propose a sequential Monte Carlo (SMC) method augmented with an importance sampling step for estimation of DSGE models. In addition to being theoretically well motivated, the new method facilitates the assessment of estimation accuracy. Furthermore, in order to alleviate the problem of multimo......We propose a sequential Monte Carlo (SMC) method augmented with an importance sampling step for estimation of DSGE models. In addition to being theoretically well motivated, the new method facilitates the assessment of estimation accuracy. Furthermore, in order to alleviate the problem...... the properties of the estimation method, and shows how the problem of multimodal posterior distributions caused by parameter redundancy is eliminated by identification constraints. Out-of-sample forecast comparisons as well as Bayes factors lend support to the constrained model....

On the Use of Time-Limited Information for Maintenance Decision Support: A Predictive Approach under Maintenance Constraints

Directory of Open Access Journals (Sweden)

E. Khoury

2013-01-01

Full Text Available This paper deals with a gradually deteriorating system operating under an uncertain environment whose state is only known on a finite rolling horizon. As such, the system is subject to constraints. Maintenance actions can only be planned at imposed times called maintenance opportunities that are available on a limited visibility horizon. This system can, for example, be a commercial vehicle with a monitored critical component that can be maintained only in some specific workshops. Based on the considered system, we aim to use the monitoring data and the time-limited information for maintenance decision support in order to reduce its costs. We propose two predictive maintenance policies based, respectively, on cost and reliability criteria. Classical age-based and condition-based policies are considered as benchmarks. The performance assessment shows the value of the different types of information and the best way to use them in maintenance decision making.

Multi-faceted tourist travel decisions : a constraint-based conceptual framework to describe tourists' sequential choices of travel components

NARCIS (Netherlands)

Dellaert, Benedict; Ettema, D.F.; Lindh, Christer

This paper introduces a first step towards analyzing tourist travel choice in situations where tourists may: (i) temporally separate their choice of different components of the travel package, e.g. tourists may choose travel destination before accommodation, and (ii) face a structure of constraints

Effect of increased exposure times on amount of residual monomer released from single-step self-etch adhesives.

Science.gov (United States)

Altunsoy, Mustafa; Botsali, Murat Selim; Tosun, Gonca; Yasar, Ahmet

2015-10-16

The aim of this study was to evaluate the effect of increased exposure times on the amount of residual Bis-GMA, TEGDMA, HEMA and UDMA released from single-step self-etch adhesive systems. Two adhesive systems were used. The adhesives were applied to bovine dentin surface according to the manufacturer's instructions and were polymerized using an LED curing unit for 10, 20 and 40 seconds (n = 5). After polymerization, the specimens were stored in 75% ethanol-water solution (6 mL). Residual monomers (Bis-GMA, TEGDMA, UDMA and HEMA) that were eluted from the adhesives (after 10 minutes, 1 hour, 1 day, 7 days and 30 days) were analyzed by high-performance liquid chromatography (HPLC). The data were analyzed using 1-way analysis of variance and Tukey HSD tests. Among the time periods, the highest amount of released residual monomers from adhesives was observed in the 10th minute. There were statistically significant differences regarding released Bis-GMA, UDMA, HEMA and TEGDMA between the adhesive systems (p<0.05). There were no significant differences among the 10, 20 and 40 second polymerization times according to their effect on residual monomer release from adhesives (p>0.05). Increasing the polymerization time did not have an effect on residual monomer release from single-step self-etch adhesives.

Quasivariational Solutions for First Order Quasilinear Equations with Gradient Constraint

Science.gov (United States)

Rodrigues, José Francisco; Santos, Lisa

2012-08-01

We prove the existence of solutions for a quasi-variational inequality of evolution with a first order quasilinear operator and a variable convex set which is characterized by a constraint on the absolute value of the gradient that depends on the solution itself. The only required assumption on the nonlinearity of this constraint is its continuity and positivity. The method relies on an appropriate parabolic regularization and suitable a priori estimates. We also obtain the existence of stationary solutions by studying the asymptotic behaviour in time. In the variational case, corresponding to a constraint independent of the solution, we also give uniqueness results.

Constraints on communication in classrooms for the deaf.

Science.gov (United States)

Matthews, T J; Reich, C F

1993-03-01

One explanation for the relatively low scholastic achievement of deaf students is the character of communication in the classroom. Unlike aural communication methods, line-of-sight methods share the limitation that the receiver of the message must look at the sender. To assess the magnitude of this constraint, we measured the amount of time signers were looked at by potential receivers in typical secondary school classes for the deaf. Videotaped segments indicated that on average the messages sent by teachers and students were seen less than half the time. Students frequently engaged in collateral conversations. The constraints of line-of-sight communication are profound and should be addressed by teaching techniques, classroom layout, and possibly, the use of computer-communication technology.

Preimages for Step-Reduced SHA-2

DEFF Research Database (Denmark)

Aoki, Kazumaro; Guo, Jian; Matusiewicz, Krystian

2009-01-01

In this paper, we present preimage attacks on up to 43-step SHA-256 (around 67% of the total 64 steps) and 46-step SHA-512 (around 57.5% of the total 80 steps), which significantly increases the number of attacked steps compared to the best previously published preimage attack working for 24 steps....... The time complexities are 2^251.9, 2^509 for finding pseudo-preimages and 2^254.9, 2^511.5 compression function operations for full preimages. The memory requirements are modest, around 2^6 words for 43-step SHA-256 and 46-step SHA-512. The pseudo-preimage attack also applies to 43-step SHA-224 and SHA-384...

The Observing Time Distribution in Major Groundbased Observatories - a Complex Task

Science.gov (United States)

Breysacher, J.

The aim of the present paper is to give, first, a brief description of the different steps related to the general procedure of telescope time allocation at the European Southern Observatory, and then, a detailed review of the various constraints one has to take into account when preparing the final observing schedule on the various telescopes installed at La Silla. A succinct discussion will be given of how, in the future, remote control observing may facilitate the coordination of multiwavelength investigations.

Microsoft Office SharePoint Designer 2007 Step by Step

CERN Document Server

Coventry, Penelope

2008-01-01

The smart way to learn Office SharePoint Designer 2007-one step at a time! Work at your own pace through the easy numbered steps, practice files on CD, helpful hints, and troubleshooting tips to master the fundamentals of building customized SharePoint sites and applications. You'll learn how to work with Windows® SharePoint Services 3.0 and Office SharePoint Server 2007 to create Web pages complete with Cascading Style Sheets, Lists, Libraries, and customized Web parts. Then, make your site really work for you by adding data sources, including databases, XML data and Web services, and RSS fe

Multi-Objective Trajectory Optimization of a Hypersonic Reconnaissance Vehicle with Temperature Constraints

Science.gov (United States)

Masternak, Tadeusz J.

This research determines temperature-constrained optimal trajectories for a scramjet-based hypersonic reconnaissance vehicle by developing an optimal control formulation and solving it using a variable order Gauss-Radau quadrature collocation method with a Non-Linear Programming (NLP) solver. The vehicle is assumed to be an air-breathing reconnaissance aircraft that has specified takeoff/landing locations, airborne refueling constraints, specified no-fly zones, and specified targets for sensor data collections. A three degree of freedom scramjet aircraft model is adapted from previous work and includes flight dynamics, aerodynamics, and thermal constraints. Vehicle control is accomplished by controlling angle of attack, roll angle, and propellant mass flow rate. This model is incorporated into an optimal control formulation that includes constraints on both the vehicle and mission parameters, such as avoidance of no-fly zones and coverage of high-value targets. To solve the optimal control formulation, a MATLAB-based package called General Pseudospectral Optimal Control Software (GPOPS-II) is used, which transcribes continuous time optimal control problems into an NLP problem. In addition, since a mission profile can have varying vehicle dynamics and en-route imposed constraints, the optimal control problem formulation can be broken up into several "phases" with differing dynamics and/or varying initial/final constraints. Optimal trajectories are developed using several different performance costs in the optimal control formulation: minimum time, minimum time with control penalties, and maximum range. The resulting analysis demonstrates that optimal trajectories that meet specified mission parameters and constraints can be quickly determined and used for larger-scale operational and campaign planning and execution.

Effect of One-Step and Multi-Steps Polishing System on Enamel Roughness

Directory of Open Access Journals (Sweden)

Cynthia Sumali

2013-07-01

Full Text Available Normal 0 false false false MicrosoftInternetExplorer4 The final procedures of orthodontic treatment are bracket debonding and cleaning the remaining adhesive. Multi-step polishing system is the most common method used. The disadvantage of that system is long working time, because of the stages that should be done. Therefore, dental material manufacturer make an improvement to the system, to reduce several stages into one stage only. This new system is known as one-step polishing system. Objective: To compare the effect of one-step and multi-step polishing system on enamel roughness after orthodontic bracket debonding. Methods: Randomized control trial was conducted included twenty-eight maxillary premolar randomized into two polishing system; one-step OptraPol (Ivoclar, Vivadent and multi-step AstroPol (Ivoclar, Vivadent. After bracket debonding, the remaining adhesive on each group was cleaned by subjective polishing system for ninety seconds using low speed handpiece. The enamel roughness was subjected to profilometer, registering two roughness parameters (Ra, Rz. Independent t-test was used to analyze the mean score of enamel roughness in each group. Results: There was no significant difference of enamel roughness between one-step and multi-step polishing system (p>0.005. Conclusion: One-step polishing system can produce a similar enamel roughness to multi-step polishing system after bracket debonding and adhesive cleaning.DOI: 10.14693/jdi.v19i3.136

A receding horizon scheme for discrete-time polytopic linear parameter varying systems in networked architectures

International Nuclear Information System (INIS)

Franzè, Giuseppe; Lucia, Walter; Tedesco, Francesco

2014-01-01

This paper proposes a Model Predictive Control (MPC) strategy to address regulation problems for constrained polytopic Linear Parameter Varying (LPV) systems subject to input and state constraints in which both plant measurements and command signals in the loop are sent through communication channels subject to time-varying delays (Networked Control System (NCS)). The results here proposed represent a significant extension to the LPV framework of a recent Receding Horizon Control (RHC) scheme developed for the so-called robust case. By exploiting the parameter availability, the pre-computed sequences of one- step controllable sets inner approximations are less conservative than the robust counterpart. The resulting framework guarantees asymptotic stability and constraints fulfilment regardless of plant uncertainties and time-delay occurrences. Finally, experimental results on a laboratory two-tank test-bed show the effectiveness of the proposed approach

SPAR-H Step-by-Step Guidance

Energy Technology Data Exchange (ETDEWEB)

W. J. Galyean; A. M. Whaley; D. L. Kelly; R. L. Boring

2011-05-01

This guide provides step-by-step guidance on the use of the SPAR-H method for quantifying Human Failure Events (HFEs). This guide is intended to be used with the worksheets provided in: 'The SPAR-H Human Reliability Analysis Method,' NUREG/CR-6883, dated August 2005. Each step in the process of producing a Human Error Probability (HEP) is discussed. These steps are: Step-1, Categorizing the HFE as Diagnosis and/or Action; Step-2, Rate the Performance Shaping Factors; Step-3, Calculate PSF-Modified HEP; Step-4, Accounting for Dependence, and; Step-5, Minimum Value Cutoff. The discussions on dependence are extensive and include an appendix that describes insights obtained from the psychology literature.

SPAR-H Step-by-Step Guidance

International Nuclear Information System (INIS)

Galyean, W.J.; Whaley, A.M.; Kelly, D.L.; Boring, R.L.

2011-01-01

This guide provides step-by-step guidance on the use of the SPAR-H method for quantifying Human Failure Events (HFEs). This guide is intended to be used with the worksheets provided in: 'The SPAR-H Human Reliability Analysis Method,' NUREG/CR-6883, dated August 2005. Each step in the process of producing a Human Error Probability (HEP) is discussed. These steps are: Step-1, Categorizing the HFE as Diagnosis and/or Action; Step-2, Rate the Performance Shaping Factors; Step-3, Calculate PSF-Modified HEP; Step-4, Accounting for Dependence, and; Step-5, Minimum Value Cutoff. The discussions on dependence are extensive and include an appendix that describes insights obtained from the psychology literature.

SPAR-H Step-by-Step Guidance

Energy Technology Data Exchange (ETDEWEB)

April M. Whaley; Dana L. Kelly; Ronald L. Boring; William J. Galyean

2012-06-01

Step-by-step guidance was developed recently at Idaho National Laboratory for the US Nuclear Regulatory Commission on the use of the Standardized Plant Analysis Risk-Human Reliability Analysis (SPAR-H) method for quantifying Human Failure Events (HFEs). This work was done to address SPAR-H user needs, specifically requests for additional guidance on the proper application of various aspects of the methodology. This paper overviews the steps of the SPAR-H analysis process and highlights some of the most important insights gained during the development of the step-by-step directions. This supplemental guidance for analysts is applicable when plant-specific information is available, and goes beyond the general guidance provided in existing SPAR-H documentation. The steps highlighted in this paper are: Step-1, Categorizing the HFE as Diagnosis and/or Action; Step-2, Rate the Performance Shaping Factors; Step-3, Calculate PSF-Modified HEP; Step-4, Accounting for Dependence, and; Step-5, Minimum Value Cutoff.

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea

2013-01-01

Arbitrary Lagrangian Eulerian (ALE) formulations deal with PDEs on deformable domains upon extending the domain velocity from the boundary into the bulk with the purpose of keeping mesh regularity. This arbitrary extension has no effect on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time-dependent advection-diffusion-model problem in moving domains, and study their stability properties. The analysis hinges on the validity of the Reynold\\'s identity for dG. Exploiting the variational structure and assuming exact integration, we prove that our conservative and nonconservative dG schemes are equivalent and unconditionally stable. The same results remain true for piecewise polynomial ALE maps of any degree and suitable quadrature that guarantees the validity of the Reynold\\'s identity. This approach generalizes the so-called geometric conservation law to higher-order methods. We also prove that simpler Runge-Kutta-Radau methods of any order are conditionally stable, that is, subject to a mild ALE constraint on the time steps. Numerical experiments corroborate and complement our theoretical results. © 2013 Society for Industrial and Applied Mathematics.

Effect of the processing steps on compositions of table olive since harvesting time to pasteurization.

Science.gov (United States)

Nikzad, Nasim; Sahari, Mohammad A; Vanak, Zahra Piravi; Safafar, Hamed; Boland-nazar, Seyed A

2013-08-01

Weight, oil, fatty acids, tocopherol, polyphenol, and sterol properties of 5 olive cultivars (Zard, Fishomi, Ascolana, Amigdalolia, and Conservalia) during crude, lye treatment, washing, fermentation, and pasteurization steps were studied. Results showed: oil percent was higher and lower in Ascolana (crude step) and in Fishomi (pasteurization step), respectively; during processing steps, in all cultivars, oleic, palmitic, linoleic, and stearic acids were higher; the highest changes in saturated and unsaturated fatty acids were in fermentation step; the highest and the lowest ratios of ω3 / ω6 were in Ascolana (washing step) and in Zard (pasteurization step), respectively; the highest and the lowest tocopherol were in Amigdalolia and Fishomi, respectively, and major damage occurred in lye step; the highest and the lowest polyphenols were in Ascolana (crude step) and in Zard and Ascolana (pasteurization step), respectively; the major damage among cultivars occurred during lye step, in which the polyphenol reduced to 1/10 of first content; sterol did not undergo changes during steps. Reviewing of olive patents shows that many compositions of fruits such as oil quality, fatty acids, quantity and its fraction can be changed by alteration in cultivar and process.

Dynamic ADMM for Real-time Optimal Power Flow: Preprint

Energy Technology Data Exchange (ETDEWEB)

Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2018-02-23

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearizations of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation of the AC power flows, and it avoids ubiquitous metering to gather the state of non-controllable resources. Optimality and convergence of the propose algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.

3D elastic wave modeling using modified high‐order time stepping schemes with improved stability conditions

KAUST Repository

Chu, Chunlei; Stoffa, Paul L.; Seif, Roustam

2009-01-01

We present two Lax‐Wendroff type high‐order time stepping schemes and apply them to solving the 3D elastic wave equation. The proposed schemes have the same format as the Taylor series expansion based schemes, only with modified temporal extrapolation coefficients. We demonstrate by both theoretical analysis and numerical examples that the modified schemes significantly improve the stability conditions.

Multiple-step fault estimation for interval type-II T-S fuzzy system of hypersonic vehicle with time-varying elevator faults

Directory of Open Access Journals (Sweden)

Jin Wang

2017-03-01

Full Text Available This article proposes a multiple-step fault estimation algorithm for hypersonic flight vehicles that uses an interval type-II Takagi–Sugeno fuzzy model. An interval type-II Takagi–Sugeno fuzzy model is developed to approximate the nonlinear dynamic system and handle the parameter uncertainties of hypersonic firstly. Then, a multiple-step time-varying additive fault estimation algorithm is designed to estimate time-varying additive elevator fault of hypersonic flight vehicles. Finally, the simulation is conducted in both aspects of modeling and fault estimation; the validity and availability of such method are verified by a series of the comparison of numerical simulation results.

Reasoning about Strategies under Partial Observability and Fairness Constraints

Directory of Open Access Journals (Sweden)

Simon Busard

2013-03-01

Full Text Available A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unified framework for strategies, partial observability and fairness constraints. In this paper we propose ATLK^F_po, a logic mixing strategies under partial observability and epistemic properties of agents in a system with fairness constraints on states, and we provide a model checking algorithm for it.

Benefits and constraints in the use of solar cooker

International Nuclear Information System (INIS)

Ilyas, S.Z.

2008-01-01

Women in Pakistan have been overlooked during and after the planning anti implementation of household energy projects for decades. The immediate impact of domestic household energy projects falls on the women first. Since women are the ones who deal mostly with energy at the domestic level A sample of 100 women users of solar cookers was selected randomly. Majority of the respondents were in the age group 30-55 years (80%) and possessed solar cooker for more than one year (74%). Nutritional aspects (preserving nutritive value and food flavors) environmental aspects (keeping environment clean) and economical aspects (saving fuel and money) were perceived at most beneficial. Personal benefits (saving of time me and convenience) ranked low under benefit. Situational constraints like no cooking after evening find seasonal use of the cooker were perceived as severe constraints followed by technical constraints (device not being durable) and personal constraints (shifting of device). The paper also highlights the modification desired in the design of the solar cooker. (author)

Trade-off between multiple constraints enables simultaneous formation of modules and hubs in neural systems.

Directory of Open Access Journals (Sweden)

Yuhan Chen

Full Text Available The formation of the complex network architecture of neural systems is subject to multiple structural and functional constraints. Two obvious but apparently contradictory constraints are low wiring cost and high processing efficiency, characterized by short overall wiring length and a small average number of processing steps, respectively. Growing evidence shows that neural networks are results from a trade-off between physical cost and functional value of the topology. However, the relationship between these competing constraints and complex topology is not well understood quantitatively. We explored this relationship systematically by reconstructing two known neural networks, Macaque cortical connectivity and C. elegans neuronal connections, from combinatory optimization of wiring cost and processing efficiency constraints, using a control parameter α, and comparing the reconstructed networks to the real networks. We found that in both neural systems, the reconstructed networks derived from the two constraints can reveal some important relations between the spatial layout of nodes and the topological connectivity, and match several properties of the real networks. The reconstructed and real networks had a similar modular organization in a broad range of α, resulting from spatial clustering of network nodes. Hubs emerged due to the competition of the two constraints, and their positions were close to, and partly coincided, with the real hubs in a range of α values. The degree of nodes was correlated with the density of nodes in their spatial neighborhood in both reconstructed and real networks. Generally, the rebuilt network matched a significant portion of real links, especially short-distant ones. These findings provide clear evidence to support the hypothesis of trade-off between multiple constraints on brain networks. The two constraints of wiring cost and processing efficiency, however, cannot explain all salient features in the real

An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage

OpenAIRE

Gramajo, German; Shankar, Praveen

2017-01-01

A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of ...

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Directory of Open Access Journals (Sweden)

Wei Tu

2015-10-01

Full Text Available Vehicle routing optimization (VRO designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW. Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

Financing Constraints and Entrepreneurship

OpenAIRE

William R. Kerr; Ramana Nanda

2009-01-01

Financing constraints are one of the biggest concerns impacting potential entrepreneurs around the world. Given the important role that entrepreneurship is believed to play in the process of economic growth, alleviating financing constraints for would-be entrepreneurs is also an important goal for policymakers worldwide. We review two major streams of research examining the relevance of financing constraints for entrepreneurship. We then introduce a framework that provides a unified perspecti...

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

International Nuclear Information System (INIS)

Song, T; Zhou, L; Li, Y

2016-01-01

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Song, T; Zhou, L [Southern Medical University, Guangzhou, Guangdong (China); Li, Y [Beihang University, Beijing, Beijing (China)

2016-06-15

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive

Creativity from Constraints in Engineering Design

DEFF Research Database (Denmark)

Onarheim, Balder

2012-01-01

This paper investigates the role of constraints in limiting and enhancing creativity in engineering design. Based on a review of literature relating constraints to creativity, the paper presents a longitudinal participatory study from Coloplast A/S, a major international producer of disposable...... and ownership of formal constraints played a crucial role in defining their influence on creativity – along with the tacit constraints held by the designers. The designers were found to be highly constraint focused, and four main creative strategies for constraint manipulation were observed: blackboxing...

Neutron star cooling constraints for color superconductivity in hybrid stars

International Nuclear Information System (INIS)

Popov, S.; Grigoryan, Kh.; Blaschke, D.

2005-01-01

We apply the recently developed LogN-LogS test of compact star cooling theories for the first time to hybrid stars with a color superconducting quark matter core. While there is not yet a microscopically founded superconducting quark matter phase which would fulfill constraints from cooling phenomenology, we explore the hypothetical 2SC+X phase and show that the magnitude and density-dependence of the X-gap can be chosen to satisfy a set of tests: temperature-age (T-t), the brightness constraint, LogN-LogS, and the mass spectrum constraint. The latter test appears as a new conjecture from the present investigation

A data acquisition system for real-time magnetic equilibrium reconstruction on ASDEX Upgrade and its application to NTM stabilization experiments

Energy Technology Data Exchange (ETDEWEB)

Giannone, L., E-mail: Louis.Giannone@ipp.mpg.de [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); Reich, M.; Maraschek, M.; Poli, E.; Rapson, C.; Barrera, L.; McDermott, R.; Mlynek, A. [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); Ruan, Q. [National Instruments, Austin, TX 78759-3504 (United States); Treutterer, W. [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); Wenzel, L. [National Instruments, Austin, TX 78759-3504 (United States); Bock, A.; Conway, G.; Fischer, R.; Fuchs, J.C.; Lackner, K. [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); McCarthy, P.J. [Department of Physics, University College Cork, Association EURATOM-DCU, Cork (Ireland); Preuss, R. [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); Rampp, M. [Computing Centre (RZG) of the Max Planck Society and the Max Planck Institute for Plasma Physics, 85748 Garching (Germany); Schuhbeck, K.H. [Max Planck Institute for Plasma Physics, EURATOM Association, 85748 Garching (Germany); and others

2013-12-15

Highlights: • Calculation of real-time tokamak magnetic equilibrium with constraints from magnetic probes. • Parallel equilibrium calculation including the Motional Stark Effect diagnostic as additional constraints. • Feedback control of mirror for pre-emptive ECCD stabilization of neo-classical tearing modes. • Probe calibration by individual poloidal field coil currents. • Optimized parameters for poloidal field coil location, integrator gains and the location and orientation of magnetic probes. -- Abstract: The pre-emptive stabilization of a neoclassical tearing mode, NTM, requires the calculation of the tokamak magnetic equilibrium in real-time. A launcher mirror is positioned to deposit electron cyclotron current drive on the rational surface where the NTM should appear. A real-time Grad–Shafranov solver using constraints from magnetic probe, flux loop and Motional Stark Effect measurements has been developed to locate these rational surfaces and deliver this information to the mirror controller in real-time. A novel algorithm significantly reduces the number of operations required in the first and second step of the solver. Contour integrals are carried out to calculate the q profile as a function of normalized radius and the rational surfaces are found by spline interpolation. A cycle time of 0.6 ms for calculating two tokamak equilibria in parallel using four current basis functions with magnetic constraints only and using six current basis functions with magnetic and MSE constraints has been achieved. Using these tools, pre-emptive stabilization of a m/n = 3/2 NTM mode in ASDEX Upgrade could be demonstrated.

Detection and Correction of Step Discontinuities in Kepler Flux Time Series

Science.gov (United States)

Kolodziejczak, J. J.; Morris, R. L.

2011-01-01

PDC 8.0 includes an implementation of a new algorithm to detect and correct step discontinuities appearing in roughly one of every 20 stellar light curves during a given quarter. The majority of such discontinuities are believed to result from high-energy particles (either cosmic or solar in origin) striking the photometer and causing permanent local changes (typically -0.5%) in quantum efficiency, though a partial exponential recovery is often observed [1]. Since these features, dubbed sudden pixel sensitivity dropouts (SPSDs), are uncorrelated across targets they cannot be properly accounted for by the current detrending algorithm. PDC detrending is based on the assumption that features in flux time series are due either to intrinsic stellar phenomena or to systematic errors and that systematics will exhibit measurable correlations across targets. SPSD events violate these assumptions and their successful removal not only rectifies the flux values of affected targets, but demonstrably improves the overall performance of PDC detrending [1].

On an adaptive time stepping strategy for solving nonlinear diffusion equations

International Nuclear Information System (INIS)

Chen, K.; Baines, M.J.; Sweby, P.K.

1993-01-01

A new time step selection procedure is proposed for solving non- linear diffusion equations. It has been implemented in the ASWR finite element code of Lorenz and Svoboda [10] for 2D semiconductor process modelling diffusion equations. The strategy is based on equi-distributing the local truncation errors of the numerical scheme. The use of B-splines for interpolation (as well as for the trial space) results in a banded and diagonally dominant matrix. The approximate inverse of such a matrix can be provided to a high degree of accuracy by another banded matrix, which in turn can be used to work out the approximate finite difference scheme corresponding to the ASWR finite element method, and further to calculate estimates of the local truncation errors of the numerical scheme. Numerical experiments on six full simulation problems arising in semiconductor process modelling have been carried out. Results show that our proposed strategy is more efficient and better conserves the total mass. 18 refs., 6 figs., 2 tabs

On the canonical treatment of Lagrangian constraints

International Nuclear Information System (INIS)

Barbashov, B.M.

2001-01-01

The canonical treatment of dynamic systems with manifest Lagrangian constraints proposed by Berezin is applied to concrete examples: a special Lagrangian linear in velocities, relativistic particles in proper time gauge, a relativistic string in orthonormal gauge, and the Maxwell field in the Lorentz gauge

On the canonical treatment of Lagrangian constraints

International Nuclear Information System (INIS)

Barbashov, B.M.

2001-01-01

The canonical treatment of dynamic systems with manifest Lagrangian constraints proposed by Berezin is applied to concrete examples: a specific Lagrangian linear in velocities, relativistic particles in proper time gauge, a relativistic string in orthonormal gauge, and the Maxwell field in the Lorentz gauge

Integrable Hamiltonian systems and interactions through quadratic constraints

International Nuclear Information System (INIS)

Pohlmeyer, K.

1975-08-01

Osub(n)-invariant classical relativistic field theories in one time and one space dimension with interactions that are entirely due to quadratic constraints are shown to be closely related to integrable Hamiltonian systems. (orig.) [de

Research and Application of Remote Sensing Monitoring Method for Desertification Land Under Time and Space Constraints

Science.gov (United States)

Zhang, Nannnan; Wang, Rongbao; Zhang, Feng

2018-04-01

Serious land desertification and sandified threaten the urban ecological security and the sustainable economic and social development. In recent years, a large number of mobile sand dunes in Horqin sandy land flow into the northwest of Liaoning Province under the monsoon, make local agriculture suffer serious harm. According to the characteristics of desertification land in northwestern Liaoning, based on the First National Geographical Survey data, the Second National Land Survey data and the 1984-2014 Landsat satellite long time sequence data and other multi-source data, we constructed a remote sensing monitoring index system of desertification land in Northwest Liaoning. Through the analysis of space-time-spectral characteristics of desertification land, a method for multi-spectral remote sensing image recognition of desertification land under time-space constraints is proposed. This method was used to identify and extract the distribution and classification of desertification land of Chaoyang City (a typical citie of desertification in northwestern Liaoning) in 2008 and 2014, and monitored the changes and transfers of desertification land from 2008 to 2014. Sandification information was added to the analysis of traditional landscape changes, improved the analysis model of desertification land landscape index, and the characteristics and laws of landscape dynamics and landscape pattern change of desertification land from 2008 to 2014 were analyzed and revealed.

The Relaxation of Vicinal (001) with ZigZag [110] Steps

Science.gov (United States)

Hawkins, Micah; Hamouda, Ajmi Bh; González-Cabrera, Diego Luis; Einstein, Theodore L.

2012-02-01

This talk presents a kinetic Monte Carlo study of the relaxation dynamics of [110] steps on a vicinal (001) simple cubic surface. This system is interesting because [110] steps have different elementary excitation energetics and favor step diffusion more than close-packed [100] steps. In this talk we show how this leads to relaxation dynamics showing greater fluctuations on a shorter time scale for [110] steps as well as 2-bond breaking processes being rate determining in contrast to 3-bond breaking processes for [100] steps. The existence of a steady state is shown via the convergence of terrace width distributions at times much longer than the relaxation time. In this time regime excellent fits to the modified generalized Wigner distribution (as well as to the Berry-Robnik model when steps can overlap) were obtained. Also, step-position correlation function data show diffusion-limited increase for small distances along the step as well as greater average step displacement for zigzag steps compared to straight steps for somewhat longer distances along the step. Work supported by NSF-MRSEC Grant DMR 05-20471 as well as a DOE-CMCSN Grant.

Deepening Contractions and Collateral Constraints

DEFF Research Database (Denmark)

Jensen, Henrik; Ravn, Søren Hove; Santoro, Emiliano

and occasionally non-binding credit constraints. Easier credit access increases the likelihood that constraints become slack in the face of expansionary shocks, while contractionary shocks are further amplified due to tighter constraints. As a result, busts gradually become deeper than booms. Based...

Temporal Concurrent Constraint Programming

DEFF Research Database (Denmark)

Valencia, Frank Dan

Concurrent constraint programming (ccp) is a formalism for concurrency in which agents interact with one another by telling (adding) and asking (reading) information in a shared medium. Temporal ccp extends ccp by allowing agents to be constrained by time conditions. This dissertation studies...... temporal ccp by developing a process calculus called ntcc. The ntcc calculus generalizes the tcc model, the latter being a temporal ccp model for deterministic and synchronouss timed reactive systems. The calculus is built upon few basic ideas but it captures several aspects of timed systems. As tcc, ntcc...... structures, robotic devises, multi-agent systems and music applications. The calculus is provided with a denotational semantics that captures the reactive computations of processes in the presence of arbitrary environments. The denotation is proven to be fully-abstract for a substantial fragment...

New constraints on time-dependent variations of fundamental constants using Planck data

Science.gov (United States)

Hart, Luke; Chluba, Jens

2018-02-01

Observations of the cosmic microwave background (CMB) today allow us to answer detailed questions about the properties of our Universe, targeting both standard and non-standard physics. In this paper, we study the effects of varying fundamental constants (i.e. the fine-structure constant, αEM, and electron rest mass, me) around last scattering using the recombination codes COSMOREC and RECFAST++. We approach the problem in a pedagogical manner, illustrating the importance of various effects on the free electron fraction, Thomson visibility function and CMB power spectra, highlighting various degeneracies. We demonstrate that the simpler RECFAST++ treatment (based on a three-level atom approach) can be used to accurately represent the full computation of COSMOREC. We also include explicit time-dependent variations using a phenomenological power-law description. We reproduce previous Planck 2013 results in our analysis. Assuming constant variations relative to the standard values, we find the improved constraints αEM/αEM, 0 = 0.9993 ± 0.0025 (CMB only) and me/me, 0 = 1.0039 ± 0.0074 (including BAO) using Planck 2015 data. For a redshift-dependent variation, αEM(z) = αEM(z0) [(1 + z)/1100]p with αEM(z0) ≡ αEM, 0 at z0 = 1100, we obtain p = 0.0008 ± 0.0025. Allowing simultaneous variations of αEM(z0) and p yields αEM(z0)/αEM, 0 = 0.9998 ± 0.0036 and p = 0.0006 ± 0.0036. We also discuss combined limits on αEM and me. Our analysis shows that existing data are not only sensitive to the value of the fundamental constants around recombination but also its first time derivative. This suggests that a wider class of varying fundamental constant models can be probed using the CMB.

Occupational dose constraint

International Nuclear Information System (INIS)

Heilbron Filho, Paulo Fernando Lavalle; Xavier, Ana Maria

2005-01-01

The revision process of the international radiological protection regulations has resulted in the adoption of new concepts, such as practice, intervention, avoidable and restriction of dose (dose constraint). The latter deserving of special mention since it may involve reducing a priori of the dose limits established both for the public and to individuals occupationally exposed, values that can be further reduced, depending on the application of the principle of optimization. This article aims to present, with clarity, from the criteria adopted to define dose constraint values to the public, a methodology to establish the dose constraint values for occupationally exposed individuals, as well as an example of the application of this methodology to the practice of industrial radiography

Optimal consumption—portfolio problem with CVaR constraints

International Nuclear Information System (INIS)

Zhang, Qingye; Gao, Yan

2016-01-01

The optimal portfolio selection is a fundamental issue in finance, and its two most important ingredients are risk and return. Merton's pioneering work in dynamic portfolio selection emphasized only the expected utility of the consumption and the terminal wealth. To make the optimal portfolio strategy be achievable, risk control over bankruptcy during the investment horizon is an indispensable ingredient. So, in this paper, we consider the consumption-portfolio problem coupled with a dynamic risk control. More specifically, different from the existing literature, we impose a dynamic relative CVaR constraint on it. By the stochastic dynamic programming techniques, we derive the corresponding Hamilton–Jacobi–Bellman (HJB) equation. Moreover, by the Lagrange multiplier method, the closed form solution is provided when the utility function is a logarithmic one. At last, an illustrative empirical study is given. The results show the distinct difference of the portfolio strategies with and without the CVaR constraints: the proportion invested in the risky assets is reduced over time with CVaR constraint instead of being constant without CVaR constraints. This can provide a good decision-making reference for the investors.

Exploring the impact of constraints in quantum optimal control through a kinematic formulation

International Nuclear Information System (INIS)

Donovan, Ashley; Beltrani, Vincent; Rabitz, Herschel

2013-01-01

Highlights: • This work lays a foundation for studying constraints in quantum control simulations. • The underlying quantum control landscape in the presence of constraints is explored. • Constrained controls can encounter suboptimal traps in the landscape. • The controls are kinematic stand-ins for dynamic time-dependent controls. • A method is developed to transfer between constrained kinematic and dynamic controls. - Abstract: The control of quantum dynamics with tailored laser fields is finding growing experimental success. In practice, experiments will be subject to constraints on the controls that may prevent full optimization of the objective. A framework is presented for systematically investigating the impact of constraints in quantum optimal control simulations using a two-stage process starting with simple time-independent kinematic controls, which act as stand-ins for the traditional dynamic controls. The objective is a state-to-state transition probability, and constraints are introduced by restricting the kinematic control variables during optimization. As a second stage, the means to map from kinematic to dynamic controls is presented, thus enabling a simplified overall procedure for exploring how limited resources affect the ability to optimize the objective. A demonstration of the impact of imposing several types of kinematic constraints is investigated, thereby offering insight into constrained quantum controls

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

International Nuclear Information System (INIS)

Jian Jinbao; Li Jianling; Mo Xingde

2006-01-01

This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported

Impacts of Base-Case and Post-Contingency Constraint Relaxations on Static and Dynamic Operational Security

Science.gov (United States)

Salloum, Ahmed

Constraint relaxation by definition means that certain security, operational, or financial constraints are allowed to be violated in the energy market model for a predetermined penalty price. System operators utilize this mechanism in an effort to impose a price-cap on shadow prices throughout the market. In addition, constraint relaxations can serve as corrective approximations that help in reducing the occurrence of infeasible or extreme solutions in the day-ahead markets. This work aims to capture the impact constraint relaxations have on system operational security. Moreover, this analysis also provides a better understanding of the correlation between DC market models and AC real-time systems and analyzes how relaxations in market models propagate to real-time systems. This information can be used not only to assess the criticality of constraint relaxations, but also as a basis for determining penalty prices more accurately. Constraint relaxations practice was replicated in this work using a test case and a real-life large-scale system, while capturing both energy market aspects and AC real-time system performance. System performance investigation included static and dynamic security analysis for base-case and post-contingency operating conditions. PJM peak hour loads were dynamically modeled in order to capture delayed voltage recovery and sustained depressed voltage profiles as a result of reactive power deficiency caused by constraint relaxations. Moreover, impacts of constraint relaxations on operational system security were investigated when risk based penalty prices are used. Transmission lines in the PJM system were categorized according to their risk index and each category was as-signed a different penalty price accordingly in order to avoid real-time overloads on high risk lines. This work also extends the investigation of constraint relaxations to post-contingency relaxations, where emergency limits are allowed to be relaxed in energy market models

Two non-parametric methods for derivation of constraints from radiotherapy dose–histogram data

International Nuclear Information System (INIS)

Ebert, M A; Kennedy, A; Joseph, D J; Gulliford, S L; Buettner, F; Foo, K; Haworth, A; Denham, J W

2014-01-01

Dose constraints based on histograms provide a convenient and widely-used method for informing and guiding radiotherapy treatment planning. Methods of derivation of such constraints are often poorly described. Two non-parametric methods for derivation of constraints are described and investigated in the context of determination of dose-specific cut-points—values of the free parameter (e.g., percentage volume of the irradiated organ) which best reflect resulting changes in complication incidence. A method based on receiver operating characteristic (ROC) analysis and one based on a maximally-selected standardized rank sum are described and compared using rectal toxicity data from a prostate radiotherapy trial. Multiple test corrections are applied using a free step-down resampling algorithm, which accounts for the large number of tests undertaken to search for optimal cut-points and the inherent correlation between dose–histogram points. Both methods provide consistent significant cut-point values, with the rank sum method displaying some sensitivity to the underlying data. The ROC method is simple to implement and can utilize a complication atlas, though an advantage of the rank sum method is the ability to incorporate all complication grades without the need for grade dichotomization. (note)

A theory of the stepped leader in lightning

International Nuclear Information System (INIS)

Lowke, J.J.

1999-01-01

There is no generally accepted explanation of the stepped leader behaviour in terms of basic physical processes. Existing theories generally involve significant gas heating within the stepped leader. In the present paper, the stepped nature of the leader is proposed to arise due to a combination of two physical phenomena. Electron transport is dominant over ion transport, during the luminous step stage, because electron mobilities are about 100 times larger than ion mobilities, and the streamer front velocity is determined by electron ionization effects. During the dark time between steps, there are only ions and charge transport is very much slower. The second effect leading to stepped behaviour arises because the electric field required for electric breakdown in air prior to a discharge is ∼30kV/cm, and is very much higher than the electric field of 5kV/cm that is required to sustain a glow discharge in air. During the luminous step stage, electrons tend to produce space charges to make a uniform field in the streamer of ∼5kV/cm. During the dark time between steps, there are no electrons but only ions. Time is required for ion drift to produce a space charge sheath of negative ions at the head of the streamer to produce a field of ∼30kV/cm sufficient for electron ionization to produce a new luminous step

Wave functions constructed from an invariant sum over histories satisfy constraints

International Nuclear Information System (INIS)

Halliwell, J.J.; Hartle, J.B.

1991-01-01

Invariance of classical equations of motion under a group parametrized by functions of time implies constraints between canonical coordinates and momenta. In the Dirac formulation of quantum mechanics, invariance is normally imposed by demanding that physical wave functions are annihilated by the operator versions of these constraints. In the sum-over-histories quantum mechanics, however, wave functions are specified, directly, by appropriate functional integrals. It therefore becomes an interesting question whether the wave functions so specified obey the operator constraints of the Dirac theory. In this paper, we show for a wide class of theories, including gauge theories, general relativity, and first-quantized string theories, that wave functions constructed from a sum over histories are, in fact, annihilated by the constraints provided that the sum over histories is constructed in a manner which respects the invariance generated by the constraints. By this we mean a sum over histories defined with an invariant action, invariant measure, and an invariant class of paths summed over

Navigating contextual constraints in discourse: Design explications in institutional talk

Science.gov (United States)

Herijgers, MLC (Marloes); Maat, HLW (Henk) Pander

2017-01-01

Although institutional discourse is subject to a vast ensemble of constraints, its design is not fixed beforehand. On the contrary, optimizing the satisfaction of these constraints requires considerable discourse design skills from institutional agents. In this article, we analyze how Dutch banks’ mortgage advisors navigate their way through the consultations context. We focus on what we call discourse design explications, that is, stretches of talk in which participants refer to conflicting constraints in the discourse context, at the same time proposing particular discourse designs for dealing with these conflicts. We start by discussing three forms of design explication. Then we will examine the various resolutions they propose for constraint conflicts and show how advisors seek customer consent or cooperation for the proposed designs. Thus our analysis reveals how institutional agents, while providing services, work on demonstrating how the design of these services is optimized and tailored to customers. PMID:28781580

The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach - Technical Report

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

Effect of moisture and drying time on the bond strength of the one-step self-etching adhesive system

Directory of Open Access Journals (Sweden)

Yoon Lee

2012-08-01

Full Text Available Objectives To investigate the effect of dentin moisture degree and air-drying time on dentin-bond strength of two different one-step self-etching adhesive systems. Materials and Methods Twenty-four human third molars were used for microtensile bond strength testing of G-Bond and Clearfil S3 Bond. The dentin surface was either blot-dried or air-dried before applying these adhesive agents. After application of the adhesive agent, three different air drying times were evaluated: 1, 5, and 10 sec. Composite resin was build up to 4 mm thickness and light cured for 40 sec with 2 separate layers. Then the tooth was sectioned and trimmed to measure the microtensile bond strength using a universal testing machine. The measured bond strengths were analyzed with three-way ANOVA and regression analysis was done (p = 0.05. Results All three factors, materials, dentin wetness and air drying time, showed significant effect on the microtensile bond strength. Clearfil S3 Bond, dry dentin surface and 10 sec air drying time showed higher bond strength. Conclusions Within the limitation of this experiment, air drying time after the application of the one-step self-etching adhesive agent was the most significant factor affecting the bond strength, followed by the material difference and dentin moisture before applying the adhesive agent.

Solar constraints

International Nuclear Information System (INIS)

Provost, J.

1984-01-01

Accurate tests of the theory of stellar structure and evolution are available from the Sun's observations. The solar constraints are reviewed, with a special attention to the recent progress in observing global solar oscillations. Each constraint is sensitive to a given region of the Sun. The present solar models (standard, low Z, mixed) are discussed with respect to neutrino flux, low and high degree five-minute oscillations and low degree internal gravity modes. It appears that actually there do not exist solar models able to fully account for all the observed quantities. (Auth.)

Rigid Body Sampling and Individual Time Stepping for Rigid-Fluid Coupling of Fluid Simulation

Directory of Open Access Journals (Sweden)

Xiaokun Wang

2017-01-01

Full Text Available In this paper, we propose an efficient and simple rigid-fluid coupling scheme with scientific programming algorithms for particle-based fluid simulation and three-dimensional visualization. Our approach samples the surface of rigid bodies with boundary particles that interact with fluids. It contains two procedures, that is, surface sampling and sampling relaxation, which insures uniform distribution of particles with less iterations. Furthermore, we present a rigid-fluid coupling scheme integrating individual time stepping to rigid-fluid coupling, which gains an obvious speedup compared to previous method. The experimental results demonstrate the effectiveness of our approach.

One False Step: "Detroit," "Step" and Movies of Rising and Falling

Science.gov (United States)

Beck, Bernard

2018-01-01

"Detroit" and "Step" are two recent movies in the context of urban riots in protest of police brutality. They refer to time periods separated by half a century, but there are common themes in the two that seem appropriate to both times. The movies are not primarily concerned with the riot events, but the riot is a major…

A compendium of chameleon constraints

Energy Technology Data Exchange (ETDEWEB)

Burrage, Clare [School of Physics and Astronomy, University of Nottingham, Nottingham, NG7 2RD (United Kingdom); Sakstein, Jeremy, E-mail: clare.burrage@nottingham.ac.uk, E-mail: jeremy.sakstein@port.ac.uk [Center for Particle Cosmology, Department of Physics and Astronomy, University of Pennsylvania, 209 S. 33rd St., Philadelphia, PA 19104 (United States)

2016-11-01

The chameleon model is a scalar field theory with a screening mechanism that explains how a cosmologically relevant light scalar can avoid the constraints of intra-solar-system searches for fifth-forces. The chameleon is a popular dark energy candidate and also arises in f ( R ) theories of gravity. Whilst the chameleon is designed to avoid historical searches for fifth-forces it is not unobservable and much effort has gone into identifying the best observables and experiments to detect it. These results are not always presented for the same models or in the same language, a particular problem when comparing astrophysical and laboratory searches making it difficult to understand what regions of parameter space remain. Here we present combined constraints on the chameleon model from astrophysical and laboratory searches for the first time and identify the remaining windows of parameter space. We discuss the implications for cosmological chameleon searches and future small-scale probes.

A compendium of chameleon constraints

International Nuclear Information System (INIS)

Burrage, Clare; Sakstein, Jeremy

2016-01-01

The chameleon model is a scalar field theory with a screening mechanism that explains how a cosmologically relevant light scalar can avoid the constraints of intra-solar-system searches for fifth-forces. The chameleon is a popular dark energy candidate and also arises in f ( R ) theories of gravity. Whilst the chameleon is designed to avoid historical searches for fifth-forces it is not unobservable and much effort has gone into identifying the best observables and experiments to detect it. These results are not always presented for the same models or in the same language, a particular problem when comparing astrophysical and laboratory searches making it difficult to understand what regions of parameter space remain. Here we present combined constraints on the chameleon model from astrophysical and laboratory searches for the first time and identify the remaining windows of parameter space. We discuss the implications for cosmological chameleon searches and future small-scale probes.

Efficiency versus speed in quantum heat engines: Rigorous constraint from Lieb-Robinson bound

Science.gov (United States)

Shiraishi, Naoto; Tajima, Hiroyasu

2017-08-01

A long-standing open problem whether a heat engine with finite power achieves the Carnot efficiency is investgated. We rigorously prove a general trade-off inequality on thermodynamic efficiency and time interval of a cyclic process with quantum heat engines. In a first step, employing the Lieb-Robinson bound we establish an inequality on the change in a local observable caused by an operation far from support of the local observable. This inequality provides a rigorous characterization of the following intuitive picture that most of the energy emitted from the engine to the cold bath remains near the engine when the cyclic process is finished. Using this description, we prove an upper bound on efficiency with the aid of quantum information geometry. Our result generally excludes the possibility of a process with finite speed at the Carnot efficiency in quantum heat engines. In particular, the obtained constraint covers engines evolving with non-Markovian dynamics, which almost all previous studies on this topic fail to address.

Theory of Constraints (TOC)

DEFF Research Database (Denmark)

Michelsen, Aage U.

2004-01-01

Tankegangen bag Theory of Constraints samt planlægningsprincippet Drum-Buffer-Rope. Endvidere skitse af The Thinking Process.......Tankegangen bag Theory of Constraints samt planlægningsprincippet Drum-Buffer-Rope. Endvidere skitse af The Thinking Process....

One Step Solution to the Local Tie Vectors of GNSS/SLR in ITRF

Directory of Open Access Journals (Sweden)

MA Xiaping

2018-01-01

Full Text Available This paper proposes a one-step solution of local tie vectors,the solution takes RP (Reference Point and axes offsets of SLR telescope as unknown parameters,GNSS baselines network and conventional terrestrial observation (horizontal,vertical angle and distance are combined in ITRF (International Terrestrial Reference Frame,and multiply constraint conditions are established between RP and observation marks and two axes offsets.Local tie vectors and related covariance matrices of the 3 co-located sites in Beijing,Kunming,Xi'an of CMONOC (Crustal Movement Observation Network of China are solved with the proposed one step solution.The results show that the RMS (root mean square error of local tie vectors is less than 2.0 mm.Besides,the differences are less than 2.0 mm compared with the traditional step by step solution,and the offsets and corresponding RMS between the horizontal axis and vertical axis are 3.8 mm,0.7 mm,3.6 mm and 1.3 mm,1.2 mm,1.3 mm,respectively.

How Do Severe Constraints Affect the Search Ability of Multiobjective Evolutionary Algorithms in Water Resources?

Science.gov (United States)

Clarkin, T. J.; Kasprzyk, J. R.; Raseman, W. J.; Herman, J. D.

2015-12-01

This study contributes a diagnostic assessment of multiobjective evolutionary algorithm (MOEA) search on a set of water resources problem formulations with different configurations of constraints. Unlike constraints in classical optimization modeling, constraints within MOEA simulation-optimization represent limits on acceptable performance that delineate whether solutions within the search problem are feasible. Constraints are relevant because of the emergent pressures on water resources systems: increasing public awareness of their sustainability, coupled with regulatory pressures on water management agencies. In this study, we test several state-of-the-art MOEAs that utilize restricted tournament selection for constraint handling on varying configurations of water resources planning problems. For example, a problem that has no constraints on performance levels will be compared with a problem with several severe constraints, and a problem with constraints that have less severe values on the constraint thresholds. One such problem, Lower Rio Grande Valley (LRGV) portfolio planning, has been solved with a suite of constraints that ensure high reliability, low cost variability, and acceptable performance in a single year severe drought. But to date, it is unclear whether or not the constraints are negatively affecting MOEAs' ability to solve the problem effectively. Two categories of results are explored. The first category uses control maps of algorithm performance to determine if the algorithm's performance is sensitive to user-defined parameters. The second category uses run-time performance metrics to determine the time required for the algorithm to reach sufficient levels of convergence and diversity on the solution sets. Our work exploring the effect of constraints will better enable practitioners to define MOEA problem formulations for real-world systems, especially when stakeholders are concerned with achieving fixed levels of performance according to one or

A Regularization SAA Scheme for a Stochastic Mathematical Program with Complementarity Constraints

Directory of Open Access Journals (Sweden)

Yu-xin Li

2014-01-01

Full Text Available To reflect uncertain data in practical problems, stochastic versions of the mathematical program with complementarity constraints (MPCC have drawn much attention in the recent literature. Our concern is the detailed analysis of convergence properties of a regularization sample average approximation (SAA method for solving a stochastic mathematical program with complementarity constraints (SMPCC. The analysis of this regularization method is carried out in three steps: First, the almost sure convergence of optimal solutions of the regularized SAA problem to that of the true problem is established by the notion of epiconvergence in variational analysis. Second, under MPCC-MFCQ, which is weaker than MPCC-LICQ, we show that any accumulation point of Karash-Kuhn-Tucker points of the regularized SAA problem is almost surely a kind of stationary point of SMPCC as the sample size tends to infinity. Finally, some numerical results are reported to show the efficiency of the method proposed.

Characteristic Model-Based Robust Model Predictive Control for Hypersonic Vehicles with Constraints

Directory of Open Access Journals (Sweden)

Jun Zhang

2017-06-01

Full Text Available Designing robust control for hypersonic vehicles in reentry is difficult, due to the features of the vehicles including strong coupling, non-linearity, and multiple constraints. This paper proposed a characteristic model-based robust model predictive control (MPC for hypersonic vehicles with reentry constraints. First, the hypersonic vehicle is modeled by a characteristic model composed of a linear time-varying system and a lumped disturbance. Then, the identification data are regenerated by the accumulative sum idea in the gray theory, which weakens effects of the random noises and strengthens regularity of the identification data. Based on the regenerated data, the time-varying parameters and the disturbance are online estimated according to the gray identification. At last, the mixed H2/H∞ robust predictive control law is proposed based on linear matrix inequalities (LMIs and receding horizon optimization techniques. Using active tackling system constraints of MPC, the input and state constraints are satisfied in the closed-loop control system. The validity of the proposed control is verified theoretically according to Lyapunov theory and illustrated by simulation results.

Selection of new constraints

International Nuclear Information System (INIS)

Sugier, A.

2003-01-01

The selected new constraints should be consistent with the scale of concern i.e. be expressed roughly as fractions or multiples of the average annual background. They should take into account risk considerations and include the values of the currents limits, constraints and other action levels. The recommendation is to select four leading values for the new constraints: 500 mSv ( single event or in a decade) as a maximum value, 0.01 mSv/year as a minimum value; and two intermediate values: 20 mSv/year and 0.3 mSv/year. This new set of dose constraints, representing basic minimum standards of protection for the individuals taking into account the specificity of the exposure situations are thus coherent with the current values which can be found in ICRP Publications. A few warning need however to be noticed: There is no more multi sources limit set by ICRP. The coherence between the proposed value of dose constraint (20 mSv/year) and the current occupational dose limit of 20 mSv/year is valid only if the workers are exposed to one single source. When there is more than one source, it will be necessary to apportion. The value of 1000 mSv lifetimes used for relocation can be expressed into annual dose, which gives approximately 10 mSv/year and is coherent with the proposed dose constraint. (N.C.)

Subset-row inequalities applied to the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

2008-01-01

constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve......This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...... the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed...

Stepped surfaces and palaeolandforms in the northern Brazilian «Nordeste»: constraints on models of morphotectonic evolution

Science.gov (United States)

Peulvast, Jean-Pierre; de Claudino Sales, Vanda

2004-09-01

From the Parnaiba Basin to the Borborema Plateau (northeastern Brazil), the crystalline and sedimentary highlands and plains of the huge Jaguaribe-Piranhas amphitheatre are intersected seawards by offset elements of a marginal scarp which overlooks coastal lowlands along the Equatorial Atlantic transform margin. Its stepped surfaces are classically related to regional uplift induced by the break-up of the Gondwana supercontinent, supposed to have triggered the formation, until the Plio-Pleistocene, of successively younger planation surfaces below a culminating Cretaceous surface. A reinterpretation of this topography, combined with analyses of palaeolandforms, surface deposits, drainage anomalies, and structural controls on landforms, is used to obtain ages for significant features of the stepped patterns and to propose a morphostratigraphic scheme for the whole area. It is shown that the regional morphology is widely controlled by structures formed during Early Cretaceous continental rifting and later Aptian oceanic opening. Exhumed pre-Cenomanian palaeolandforms—planation surfaces, residual Cretaceous fault scarps—are identified. This study points out the value of the morphostructural approach for revisiting classical problems of geomorphology such as the meaning of stepped landforms (identification of palaeosurfaces of Cretaceous age at various levels), and the age and origin of planation surfaces. Its results are considered as constraining elements for a further tentative reconstruction of the morphotectonic evolution of this margin.

Simplification of integrity constraints with aggregates and arithmetic built-ins

DEFF Research Database (Denmark)

Martinenghi, Davide

2004-01-01

Both aggregates and arithmetic built-ins are widely used in current database query languages: Aggregates are second-order constructs such as CNT and SUM of SQL; arithmetic built-ins include relational and other mathematical operators that apply to numbers, such as < and +. These features are also...... time, simplified versions of such integrity constraints that can be tested before the execution of any update. In this way, virtually no time is spent for optimization or rollbacks at run time. Both set and bag semantics are considered....... of interest in the context of database integrity constraints: correct and efficient integrity checking is crucial, as, without any guarantee of data consistency, the answers to queries cannot be trusted. In this paper we propose a method of practical relevance that can be used to derive, at database design...

Step out - Step in Sequencing Games

NARCIS (Netherlands)

Musegaas, M.; Borm, P.E.M.; Quant, M.

2014-01-01

In this paper a new class of relaxed sequencing games is introduced: the class of Step out - Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order.

Management practices and production constraints of central ...

African Journals Online (AJOL)

management practices of central highland goats and their major constraints. ... tance to improve the goat production potential and livelihood of the farmers in the study ... ing the productivity and income from keeping goats, there is a study gap in ..... and day time, possibly increasing the chance of getting contagious diseases.

Beyond mechanistic interaction: Value-based constraints on meaning in language

Directory of Open Access Journals (Sweden)

Joanna eRączaszek-Leonardi

2015-10-01

Full Text Available According to situated, embodied, distributed approaches to cognition, language is a crucial means for structuring social interactions. Recent approaches that emphasize the coordinative function of language treat language as a system of replicable constraints that work both on individuals and on interactions. In this paper we argue that the integration of replicable constraints approach to language with the ecological view on values allows for a deeper insight into processes of meaning creation in interaction. Such synthesis of these frameworks draws attention to important sources of structuring interactions beyond the sheer efficiency of a collective system in its current task situation. Most importantly the workings of linguistic constraints will be shown as embedded in more general fields of values, which are realized on multiple time-scales. Since the ontogenetic timescale offers a convenient window into a process of the emergence of linguistic constraints, we present illustrations of concrete mechanisms through which values may become embodied in language use in development.

Step-to-step variability in treadmill walking: influence of rhythmic auditory cueing.

Directory of Open Access Journals (Sweden)

Philippe Terrier

Full Text Available While walking, human beings continuously adjust step length (SpL, step time (SpT, step speed (SpS = SpL/SpT and step width (SpW by integrating both feedforward and feedback mechanisms. These motor control processes result in correlations of gait parameters between consecutive strides (statistical persistence. Constraining gait with a speed cue (treadmill and/or a rhythmic auditory cue (metronome, modifies the statistical persistence to anti-persistence. The objective was to analyze whether the combined effect of treadmill and rhythmic auditory cueing (RAC modified not only statistical persistence, but also fluctuation magnitude (standard deviation, SD, and stationarity of SpL, SpT, SpS and SpW. Twenty healthy subjects performed 6 × 5 min. walking tests at various imposed speeds on a treadmill instrumented with foot-pressure sensors. Freely-chosen walking cadences were assessed during the first three trials, and then imposed accordingly in the last trials with a metronome. Fluctuation magnitude (SD of SpT, SpL, SpS and SpW was assessed, as well as NonStationarity Index (NSI, which estimates the dispersion of local means in the times series (SD of 20 local means over 10 steps. No effect of RAC on fluctuation magnitude (SD was observed. SpW was not modified by RAC, what is likely the evidence that lateral foot placement is separately regulated. Stationarity (NSI was modified by RAC in the same manner as persistent pattern: Treadmill induced low NSI in the time series of SpS, and high NSI in SpT and SpL. On the contrary, SpT, SpL and SpS exhibited low NSI under RAC condition. We used relatively short sample of consecutive strides (100 as compared to the usual number of strides required to analyze fluctuation dynamics (200 to 1000 strides. Therefore, the responsiveness of stationarity measure (NSI to cued walking opens the perspective to perform short walking tests that would be adapted to patients with a reduced gait perimeter.

Calibration and Evaluation of Different Estimation Models of Daily Solar Radiation in Seasonally and Annual Time Steps in Shiraz Region

Directory of Open Access Journals (Sweden)

Hamid Reza Fooladmand

2017-06-01

2006 to 2008 were used for calibrating fourteen estimated models of solar radiation in seasonally and annual time steps and the measured data of years 2009 and 2010 were used for evaluating the obtained results. The equations were used in this study divided into three groups contains: 1 The equations based on only sunshine hours. 2 The equations based on only air temperature. 3 The equations based on sunshine hours and air temperature together. On the other hand, statistical comparison must be done to select the best equation for estimating solar radiation in seasonally and annual time steps. For this purpose, in validation stage the combination of statistical equations and linear correlation was used, and then the value of mean square deviation (MSD was calculated to evaluate the different models for estimating solar radiation in mentioned time steps. Results and Discussion: The mean values of mean square deviation (MSD of fourteen models for estimating solar radiation were equal to 24.16, 20.42, 4.08 and 16.19 for spring to winter respectively, and 15.40 in annual time step. Therefore, the results showed that using the equations for autumn enjoyed high accuracy, however for other seasons had low accuracy. So, using the equations for annual time step were appropriate more than the equations for seasonally time steps. Also, the mean values of mean square deviation (MSD of the equations based on only sunshine hours, the equations based on only air temperature, and the equations based on the combination of sunshine hours and air temperature for estimating solar radiation were equal to 14.82, 17.40 and 14.88, respectively. Therefore, the results indicated that the models based on only air temperature were the worst conditions for estimating solar radiation in Shiraz region, and therefore, using the sunshine hours for estimating solar radiation is necessary. Conclusions: In this study for estimating solar radiation in seasonally and annual time steps in Shiraz region

Orthology and paralogy constraints: satisfiability and consistency.

Science.gov (United States)

Lafond, Manuel; El-Mabrouk, Nadia

2014-01-01

A variety of methods based on sequence similarity, reconciliation, synteny or functional characteristics, can be used to infer orthology and paralogy relations between genes of a given gene family  G. But is a given set  C of orthology/paralogy constraints possible, i.e., can they simultaneously co-exist in an evolutionary history for  G? While previous studies have focused on full sets of constraints, here we consider the general case where  C does not necessarily involve a constraint for each pair of genes. The problem is subdivided in two parts: (1) Is  C satisfiable, i.e. can we find an event-labeled gene tree G inducing  C? (2) Is there such a G which is consistent, i.e., such that all displayed triplet phylogenies are included in a species tree? Previous results on the Graph sandwich problem can be used to answer to (1), and we provide polynomial-time algorithms for satisfiability and consistency with a given species tree. We also describe a new polynomial-time algorithm for the case of consistency with an unknown species tree and full knowledge of pairwise orthology/paralogy relationships, as well as a branch-and-bound algorithm in the case when unknown relations are present. We show that our algorithms can be used in combination with ProteinOrtho, a sequence similarity-based orthology detection tool, to extract a set of robust orthology/paralogy relationships.

Constraint-preserving boundary treatment for a harmonic formulation of the Einstein equations

Energy Technology Data Exchange (ETDEWEB)

Seiler, Jennifer; Szilagyi, Bela; Pollney, Denis; Rezzolla, Luciano [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany)

2008-09-07

We present a set of well-posed constraint-preserving boundary conditions for a first-order in time, second-order in space, harmonic formulation of the Einstein equations. The boundary conditions are tested using robust stability, linear and nonlinear waves, and are found to be both less reflective and constraint preserving than standard Sommerfeld-type boundary conditions.

Constraint-preserving boundary treatment for a harmonic formulation of the Einstein equations

International Nuclear Information System (INIS)

Seiler, Jennifer; Szilagyi, Bela; Pollney, Denis; Rezzolla, Luciano

2008-01-01

We present a set of well-posed constraint-preserving boundary conditions for a first-order in time, second-order in space, harmonic formulation of the Einstein equations. The boundary conditions are tested using robust stability, linear and nonlinear waves, and are found to be both less reflective and constraint preserving than standard Sommerfeld-type boundary conditions

Minimal Flavor Constraints for Technicolor

DEFF Research Database (Denmark)

Sakuma, Hidenori; Sannino, Francesco

2010-01-01

We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self-coupling and mas......We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self...

Step out-step in sequencing games

NARCIS (Netherlands)

Musegaas, Marieke; Borm, Peter; Quant, Marieke

2015-01-01

In this paper a new class of relaxed sequencing games is introduced: the class of Step out–Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order. First,

Assessment of radiopacity of restorative composite resins with various target distances and exposure times and a modified aluminum step wedge

Energy Technology Data Exchange (ETDEWEB)

Bejeh Mir, Arash Poorsattar [Dentistry Student Research Committee (DSRC), Dental Materials Research Center, Dentistry School, Babol University of Medical Sciences, Babol (Iran, Islamic Republic of); Bejeh Mir, Morvarid Poorsattar [Private Practice of Orthodontics, Montreal, Quebec (Canada)

2012-09-15

ANSI/ADA has established standards for adequate radiopacity. This study was aimed to assess the changes in radiopacity of composite resins according to various tube-target distances and exposure times. Five 1-mm thick samples of Filtek P60 and Clearfil composite resins were prepared and exposed with six tube-target distance/exposure time setups (i.e., 40 cm, 0.2 seconds; 30 cm, 0.2 seconds; 30 cm, 0.16 seconds, 30 cm, 0.12 seconds; 15 cm, 0.2 seconds; 15 cm, 0.12 seconds) performing at 70 kVp and 7 mA along with a 12-step aluminum stepwedge (1 mm incremental steps) using a PSP digital sensor. Thereafter, the radiopacities measured with Digora for Windows software 2.5 were converted to absorbencies (i.e., A=-log (1-G/255)), where A is the absorbency and G is the measured gray scale). Furthermore, the linear regression model of aluminum thickness and absorbency was developed and used to convert the radiopacity of dental materials to the equivalent aluminum thickness. In addition, all calculations were compared with those obtained from a modified 3-step stepwedge (i.e., using data for the 2nd, 5th, and 8th steps). The radiopacities of the composite resins differed significantly with various setups (p<0.001) and between the materials (p<0.001). The best predicted model was obtained for the 30 cm 0.2 seconds setup (R2=0.999). Data from the reduced modified stepwedge was remarkable and comparable with the 12-step stepwedge. Within the limits of the present study, our findings support that various setups might influence the radiopacity of dental materials on digital radiographs.

Evolution of robot-assisted orthotopic ileal neobladder formation: a step-by-step update to the University of Southern California (USC) technique.

Science.gov (United States)

Chopra, Sameer; de Castro Abreu, Andre Luis; Berger, Andre K; Sehgal, Shuchi; Gill, Inderbir; Aron, Monish; Desai, Mihir M

2017-01-01

To describe our, step-by-step, technique for robotic intracorporeal neobladder formation. The main surgical steps to forming the intracorporeal orthotopic ileal neobladder are: isolation of 65 cm of small bowel; small bowel anastomosis; bowel detubularisation; suture of the posterior wall of the neobladder; neobladder-urethral anastomosis and cross folding of the pouch; and uretero-enteral anastomosis. Improvements have been made to these steps to enhance time efficiency without compromising neobladder configuration. Our technical improvements have resulted in an improvement in operative time from 450 to 360 min. We describe an updated step-by-step technique of robot-assisted intracorporeal orthotopic ileal neobladder formation. © 2016 The Authors BJU International © 2016 BJU International Published by John Wiley & Sons Ltd.

Exploring the time course of face matching: temporal constraints impair unfamiliar face identification under temporally unconstrained viewing.

Science.gov (United States)

Ozbek, Müge; Bindemann, Markus

2011-10-01

The identification of unfamiliar faces has been studied extensively with matching tasks, in which observers decide if pairs of photographs depict the same person (identity matches) or different people (mismatches). In experimental studies in this field, performance is usually self-paced under the assumption that this will encourage best-possible accuracy. Here, we examined the temporal characteristics of this task by limiting display times and tracking observers' eye movements. Observers were required to make match/mismatch decisions to pairs of faces shown for 200, 500, 1000, or 2000ms, or for an unlimited duration. Peak accuracy was reached within 2000ms and two fixations to each face. However, intermixing exposure conditions produced a context effect that generally reduced accuracy on identity mismatch trials, even when unlimited viewing of faces was possible. These findings indicate that less than 2s are required for face matching when exposure times are variable, but temporal constraints should be avoided altogether if accuracy is truly paramount. The implications of these findings are discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Step Detection Robust against the Dynamics of Smartphones

Science.gov (United States)

Lee, Hwan-hee; Choi, Suji; Lee, Myeong-jin

2015-01-01

A novel algorithm is proposed for robust step detection irrespective of step mode and device pose in smartphone usage environments. The dynamics of smartphones are decoupled into a peak-valley relationship with adaptive magnitude and temporal thresholds. For extracted peaks and valleys in the magnitude of acceleration, a step is defined as consisting of a peak and its adjacent valley. Adaptive magnitude thresholds consisting of step average and step deviation are applied to suppress pseudo peaks or valleys that mostly occur during the transition among step modes or device poses. Adaptive temporal thresholds are applied to time intervals between peaks or valleys to consider the time-varying pace of human walking or running for the correct selection of peaks or valleys. From the experimental results, it can be seen that the proposed step detection algorithm shows more than 98.6% average accuracy for any combination of step mode and device pose and outperforms state-of-the-art algorithms. PMID:26516857

Convergence Guaranteed Nonlinear Constraint Model Predictive Control via I/O Linearization

Directory of Open Access Journals (Sweden)

Xiaobing Kong

2013-01-01

Full Text Available Constituting reliable optimal solution is a key issue for the nonlinear constrained model predictive control. Input-output feedback linearization is a popular method in nonlinear control. By using an input-output feedback linearizing controller, the original linear input constraints will change to nonlinear constraints and sometimes the constraints are state dependent. This paper presents an iterative quadratic program (IQP routine on the continuous-time system. To guarantee its convergence, another iterative approach is incorporated. The proposed algorithm can reach a feasible solution over the entire prediction horizon. Simulation results on both a numerical example and the continuous stirred tank reactors (CSTR demonstrate the effectiveness of the proposed method.

Generalized Runge-Kutta method for two- and three-dimensional space-time diffusion equations with a variable time step

International Nuclear Information System (INIS)

Aboanber, A.E.; Hamada, Y.M.

2008-01-01

An extensive knowledge of the spatial power distribution is required for the design and analysis of different types of current-generation reactors, and that requires the development of more sophisticated theoretical methods. Therefore, the need to develop new methods for multidimensional transient reactor analysis still exists. The objective of this paper is to develop a computationally efficient numerical method for solving the multigroup, multidimensional, static and transient neutron diffusion kinetics equations. A generalized Runge-Kutta method has been developed for the numerical integration of the stiff space-time diffusion equations. The method is fourth-order accurate, using an embedded third-order solution to arrive at an estimate of the truncation error for automatic time step control. In addition, the A(α)-stability properties of the method are investigated. The analyses of two- and three-dimensional benchmark problems as well as static and transient problems, demonstrate that very accurate solutions can be obtained with assembly-sized spatial meshes. Preliminary numerical evaluations using two- and three-dimensional finite difference codes showed that the presented generalized Runge-Kutta method is highly accurate and efficient when compared with other optimized iterative numerical and conventional finite difference methods

Efficient Searching with Linear Constraints

DEFF Research Database (Denmark)

Agarwal, Pankaj K.; Arge, Lars Allan; Erickson, Jeff

2000-01-01

We show how to preprocess a set S of points in d into an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear constraint xd a0+∑d−1i=1 aixi; the data structure must report all the points of S that satisfy the constraint. This pr...

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints