Unit-time scheduling problems with time dependent resources
Tautenhahn, T.; Woeginger, G.
1997-01-01
We investigate the computational complexity of scheduling problems, where the operations consume certain amounts of renewable resources which are available in time-dependent quantities. In particular, we consider unit-time open shop problems and unit-time scheduling problems with identical parallel
Time and timing in vehicle routing problems
Jabali, O.
2010-01-01
The distribution of goods to a set of geographically dispersed customers is a common problem faced by carrier companies, well-known as the Vehicle Routing Problem (VRP). The VRP consists of finding an optimal set of routes that minimizes total travel times for a given number of vehicles with a fixed
Time-dependent shock acceleration of energetic electrons including synchrotron losses
International Nuclear Information System (INIS)
Fritz, K.; Webb, G.M.
1990-01-01
The present investigation of the time-dependent particle acceleration problem in strong shocks, including synchrotron radiation losses, solves the transport equation analytically by means of Laplace transforms. The particle distribution thus obtained is then transformed numerically into real space for the cases of continuous and impulsive injections of particles at the shock. While in the continuous case the steady-state spectrum undergoes evolution, impulsive injection is noted to yield such unpredicted features as a pile-up of high-energy particles or a steep power-law with time-dependent spectral index. The time-dependent calculations reveal varying spectral shapes and more complex features for the higher energies which may be useful in the interpretation of outburst spectra. 33 refs
Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem
Azis, Zainal; Mawengkang, Herman
2017-09-01
The heterogeneous vehicle routing problem (HVRP) is a variant of vehicle routing problem (VRP) which describes various types of vehicles with different capacity to serve a set of customers with known geographical locations. This paper considers the optimal service deliveries of meals of a catering company located in Medan City, Indonesia. Due to the road condition as well as traffic, it is necessary for the company to use different type of vehicle to fulfill customers demand in time. The HVRP incorporates time dependency of travel times on the particular time of the day. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. The problem can be modeled as a linear mixed integer program and we address a feasible neighbourhood search approach to solve the problem.
Simulated annealing (SA to vehicle routing problems with soft time windows
Directory of Open Access Journals (Sweden)
Suphan Sodsoon
2014-12-01
Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.
On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems
Directory of Open Access Journals (Sweden)
El-Sayed M. E. Mostafa
2017-01-01
Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.
Direct and inverse problems in dispersive time-of-flight photocurrent revisited
Sagues, Francesc; Sokolov, Igor M.
2017-10-01
Using the fact that the continuous time random walk (CTRW) scheme is a random process subordinated to a simple random walk under the operational time given by the number of steps taken by the walker up to a given time, we revisit the problem of strongly dispersive transport in disordered media, which first lead Scher and Montroll to introducing the power law waiting time distributions. Using a subordination approach permits to disentangle the complexity of the problem, separating the solution of the boundary value problem (which is solved on the level of normal diffusive transport) from the influence of the waiting times, which allows for the solution of the direct problem in the whole time domain (including short times, out of reach of the initial approach), and simplifying strongly the analysis of the inverse problem. This analysis shows that the current traces do not contain information sufficient for unique restoration of the waiting time probability densities, but define a single-parametric family of functions that can be restored, all leading to the same photocurrent forms. The members of the family have the power-law tails which differ only by a prefactor, but may look astonishingly different at their body. The same applies to the multiple trapping model, mathematically equivalent to a special limiting case of CTRW. Contribution to the Topical Issue "Continuous Time Random Walk Still Trendy: Fifty-year History, Current State and Outlook", edited by Ryszard Kutner and Jaume Masoliver.
Including Critical Thinking and Problem Solving in Physical Education
Pill, Shane; SueSee, Brendan
2017-01-01
Many physical education curriculum frameworks include statements about the inclusion of critical inquiry processes and the development of creativity and problem-solving skills. The learning environment created by physical education can encourage or limit the application and development of the learners' cognitive resources for critical and creative…
Multigrid Reduction in Time for Nonlinear Parabolic Problems
Energy Technology Data Exchange (ETDEWEB)
Falgout, R. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Manteuffel, T. A. [Univ. of Colorado, Boulder, CO (United States); O' Neill, B. [Univ. of Colorado, Boulder, CO (United States); Schroder, J. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-04
The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.
Clinical Reasoning Terms Included in Clinical Problem Solving Exercises?
Musgrove, John L; Morris, Jason; Estrada, Carlos A; Kraemer, Ryan R
2016-05-01
Background Published clinical problem solving exercises have emerged as a common tool to illustrate aspects of the clinical reasoning process. The specific clinical reasoning terms mentioned in such exercises is unknown. Objective We identified which clinical reasoning terms are mentioned in published clinical problem solving exercises and compared them to clinical reasoning terms given high priority by clinician educators. Methods A convenience sample of clinician educators prioritized a list of clinical reasoning terms (whether to include, weight percentage of top 20 terms). The authors then electronically searched the terms in the text of published reports of 4 internal medicine journals between January 2010 and May 2013. Results The top 5 clinical reasoning terms ranked by educators were dual-process thinking (weight percentage = 24%), problem representation (12%), illness scripts (9%), hypothesis generation (7%), and problem categorization (7%). The top clinical reasoning terms mentioned in the text of 79 published reports were context specificity (n = 20, 25%), bias (n = 13, 17%), dual-process thinking (n = 11, 14%), illness scripts (n = 11, 14%), and problem representation (n = 10, 13%). Context specificity and bias were not ranked highly by educators. Conclusions Some core concepts of modern clinical reasoning theory ranked highly by educators are mentioned explicitly in published clinical problem solving exercises. However, some highly ranked terms were not used, and some terms used were not ranked by the clinician educators. Effort to teach clinical reasoning to trainees may benefit from a common nomenclature of clinical reasoning terms.
The problem with time in mixed continuous/discrete time modelling
Rovers, K.C.; Kuper, Jan; Smit, Gerardus Johannes Maria
The design of cyber-physical systems requires the use of mixed continuous time and discrete time models. Current modelling tools have problems with time transformations (such as a time delay) or multi-rate systems. We will present a novel approach that implements signals as functions of time,
Bi-criteria travelling salesman subtour problem with time threshold
Kumar Thenepalle, Jayanth; Singamsetty, Purusotham
2018-03-01
This paper deals with the bi-criteria travelling salesman subtour problem with time threshold (BTSSP-T), which comes from the family of the travelling salesman problem (TSP) and is NP-hard in the strong sense. The problem arises in several application domains, mainly in routing and scheduling contexts. Here, the model focuses on two criteria: total travel distance and gains attained. The BTSSP-T aims to determine a subtour that starts and ends at the same city and visits a subset of cities at a minimum travel distance with maximum gains, such that the time spent on the tour does not exceed the predefined time threshold. A zero-one integer-programming problem is adopted to formulate this model with all practical constraints, and it includes a finite set of feasible solutions (one for each tour). Two algorithms, namely, the Lexi-Search Algorithm (LSA) and the Tabu Search (TS) algorithm have been developed to solve the BTSSP-T problem. The proposed LSA implicitly enumerates the feasible patterns and provides an efficient solution with backtracking, whereas the TS, which is metaheuristic, will give the better approximate solution. A numerical example is demonstrated in order to understand the search mechanism of the LSA. Numerical experiments are carried out in the MATLAB environment, on the different benchmark instances available in the TSPLIB domain as well as on randomly generated test instances. The experimental results show that the proposed LSA works better than the TS algorithm in terms of solution quality and, computationally, both LSA and TS are competitive.
Location-routing Problem with Fuzzy time windows and Traffic time
Directory of Open Access Journals (Sweden)
Shima Teimoori
2014-05-01
Full Text Available The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.
On the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Kallehauge, Brian
2006-01-01
. The fourth and final paper ‘Vehicle routing problem with time windows’ (Kallehauge, Larsen, Madsen, and Solomon. In Desaulniers, Desrosiers, and Solomon, editors, Column generation, pages 67-98, Springer, New York, 2005) is a contribution to a book on column generation edited by G. Desaulniers, J. Desrosiers......The vehicle routing problem with time windows is concerned with the optimal routing of a fleet of vehicles between a depot and a number of customers that must be visited within a specified time interval, called a time window. The purpose of this thesis is to develop new and efficient solution...... techniques for solving the vehicle routing problem with time windows (VRPTW). The thesis consists of a section of introductory remarks and four independent papers. The first paper ‘Formulations and exact approaches for the vehicle routing problem with time windows’ (Kallehauge, 2005, unpublished) is a review...
Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows
Directory of Open Access Journals (Sweden)
Damianos Gavalas
2016-01-01
Full Text Available Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within their respective time window and the overall duration of each walk should be below a certain threshold. In this paper we introduce the MTOPTW, which can be used for modeling a realistic variant of the Tourist Trip Design Problem where the objective is the derivation of near-optimal multiple-day itineraries for tourists visiting a destination which features several points of interest (POIs and scenic routes. Since the MTOPTW is a NP-hard problem, we propose the first metaheuristic approaches to tackle it. The effectiveness of our algorithms is validated through a number of experiments on POI and scenic route sets compiled from the city of Athens (Greece.
The time-dependent prize-collecting arc routing problem
DEFF Research Database (Denmark)
Black, Dan; Eglese, Richard; Wøhlk, Sanne
2013-01-01
with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though......A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change...
Time-dependent problems in quantum-mechanical state reconstruction
International Nuclear Information System (INIS)
Leonhardt, U.; Bardroff, P. J.
1997-01-01
We study the state reconstruction of wave packets that travel in time-dependent potentials. We solve the problem for explicitly time-dependent potentials. We solve the problem for explicitly time-dependent harmonic oscillators and sketch a general adaptive technique for finding the wave function that matches and observed evolution. (authors)
Directory of Open Access Journals (Sweden)
Gusti Eka Yuliastuti
2017-03-01
Full Text Available The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP. The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitness value of 1.3291, a population size of 100, the number of generations of 1000, a combination of CR=0,4 and MR=0.6.
Solutions to time variant problems of real-time expert systems
Yeh, Show-Way; Wu, Chuan-Lin; Hung, Chaw-Kwei
1988-01-01
Real-time expert systems for monitoring and control are driven by input data which changes with time. One of the subtle problems of this field is the propagation of time variant problems from rule to rule. This propagation problem is even complicated under a multiprogramming environment where the expert system may issue test commands to the system to get data and to access time consuming devices to retrieve data for concurrent reasoning. Two approaches are used to handle the flood of input data. Snapshots can be taken to freeze the system from time to time. The expert system treats the system as a stationary one and traces changes by comparing consecutive snapshots. In the other approach, when an input is available, the rules associated with it are evaluated. For both approaches, if the premise condition of a fired rule is changed to being false, the downstream rules should be deactivated. If the status change is due to disappearance of a transient problem, actions taken by the fired downstream rules which are no longer true may need to be undone. If a downstream rule is being evaluated, it should not be fired. Three mechanisms for solving this problem are discussed: tracing, backward checking, and censor setting. In the forward tracing mechanism, when the premise conditions of a fired rule become false, the premise conditions of downstream rules which have been fired or are being evaluated due to the firing of that rule are reevaluated. A tree with its root at the rule being deactivated is traversed. In the backward checking mechanism, when a rule is being fired, the expert system checks back on the premise conditions of the upstream rules that result in evaluation of the rule to see whether it should be fired. The root of the tree being traversed is the rule being fired. In the censor setting mechanism, when a rule is to be evaluated, a censor is constructed based on the premise conditions of the upstream rules and the censor is evaluated just before the rule is
Branch and price for the time-dependent vehicle routing problem with time windows
DEFF Research Database (Denmark)
Dabia, Said; Dabia, Said; Van Woensel, Tom
2013-01-01
of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances...... solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a setpartitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means...... with 25 customers, 38% of the instances with 50 customers, and 15% of the instances with 100 customers. © 2013 INFORMS....
An inverse problem for a one-dimensional time-fractional diffusion problem
Jin, Bangti; Rundell, William
2012-01-01
We study an inverse problem of recovering a spatially varying potential term in a one-dimensional time-fractional diffusion equation from the flux measurements taken at a single fixed time corresponding to a given set of input sources. The unique
Time-evolution problem in Regge calculus
International Nuclear Information System (INIS)
Sorkin, R.
1975-01-01
The simplectic approximation to Einstein's equations (''Regge calculus'') is derived by considering the net to be actually a (singular) Riemannian manifold. Specific nets for open and closed spaces are introduced in terms of which one can formulate the general time-evolution problem, which thereby reduces to the repeated solution of finite sets of coupled nonlinear (algebraic) equations. The initial-value problem is also formulated in simplectic terms
Positive solution of a time and energy dependent neutron transport problem
International Nuclear Information System (INIS)
Pao, C.V.
1975-01-01
A constructive method is given for the determination of a solution and an existence--uniqueness theorem for some nonlinear time and energy dependent neutron transport problems, including the linear transport system. The geometry of the medium under consideration is allowed to be either bounded or unbounded which includes the geometry of a finite or infinite cylinder, a half-space and the whole space R/subm/ (m=1,2,center-dotcenter-dotcenter-dot). Our approach to the problem is by successive approximation which leads to various recursion formulas for the approximations in terms of explicit integrations. It is shown under some Lipschitz conditions on the nonlinear functions, which describe the process of neutrons absorption, fission, and scattering, that the sequence of approximations converges to a unique positive solution. Since these conditions are satisfied by the linear transport equation, all the results for the nonlinear system are valid for the linear transport problem. In the general nonlinear problem, the existence of both local and global solutions are discussed, and an iterative process for the construction of the solution is given
The Electric Traveling Salesman Problem with Time Windows
DEFF Research Database (Denmark)
Roberti, Roberto; Wen, Min
2016-01-01
To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of electric vehicles. The resulting distribution planning problems present new computational challenges.We address a problem, called Electric Traveling Salesman Problem with Time Windows. We propose a mixed...
Hartree--Fock time-dependent problem
Energy Technology Data Exchange (ETDEWEB)
Bove, A; Fano, G [Bologna Univ. (Italy). Istituto di Fisica; Istituto Nazionale di Fisica Nucleare, Bologna (Italy)); Da Prato, G [Rome Univ. (Italy). Istituto di Matematica
1976-06-01
A previous result is generalized. An existence and uniqueness theorem is proved for the Hartree--Fock time-dependent problem in the case of a finite Fermi system interacting via a two body potential which is supposed to be dominated by the kinetic energy part of the one-particle Hamiltonian.
A General Theory of Markovian Time Inconsistent Stochastic Control Problems
DEFF Research Database (Denmark)
Björk, Tomas; Murgochi, Agatha
We develop a theory for stochastic control problems which, in various ways, are time inconsistent in the sense that they do not admit a Bellman optimality principle. We attach these problems by viewing them within a game theoretic framework, and we look for Nash subgame perfect equilibrium points...... examples of time inconsistency in the literature are easily seen to be special cases of the present theory. We also prove that for every time inconsistent problem, there exists an associated time consistent problem such that the optimal control and the optimal value function for the consistent problem...
Blind source separation problem in GPS time series
Gualandi, A.; Serpelloni, E.; Belardinelli, M. E.
2016-04-01
A critical point in the analysis of ground displacement time series, as those recorded by space geodetic techniques, is the development of data-driven methods that allow the different sources of deformation to be discerned and characterized in the space and time domains. Multivariate statistic includes several approaches that can be considered as a part of data-driven methods. A widely used technique is the principal component analysis (PCA), which allows us to reduce the dimensionality of the data space while maintaining most of the variance of the dataset explained. However, PCA does not perform well in finding the solution to the so-called blind source separation (BSS) problem, i.e., in recovering and separating the original sources that generate the observed data. This is mainly due to the fact that PCA minimizes the misfit calculated using an L2 norm (χ 2), looking for a new Euclidean space where the projected data are uncorrelated. The independent component analysis (ICA) is a popular technique adopted to approach the BSS problem. However, the independence condition is not easy to impose, and it is often necessary to introduce some approximations. To work around this problem, we test the use of a modified variational Bayesian ICA (vbICA) method to recover the multiple sources of ground deformation even in the presence of missing data. The vbICA method models the probability density function (pdf) of each source signal using a mix of Gaussian distributions, allowing for more flexibility in the description of the pdf of the sources with respect to standard ICA, and giving a more reliable estimate of them. Here we present its application to synthetic global positioning system (GPS) position time series, generated by simulating deformation near an active fault, including inter-seismic, co-seismic, and post-seismic signals, plus seasonal signals and noise, and an additional time-dependent volcanic source. We evaluate the ability of the PCA and ICA decomposition
Directory of Open Access Journals (Sweden)
Qi Xu
2016-01-01
Full Text Available This paper proposes an economic production quantity problem with the maximal production run time and minimal preventive maintenance time over a finite planning horizon. The objective is to find the efficient production and maintenance policy to minimize the total cost composed of production, maintenance, shortages, and holding costs under the restriction on the production run time and the preventive maintenance time. The production and maintenance decisions include the production and maintenance frequencies and the production run and the maintenance time. The variability and the boundedness of the production run and maintenance time make the problem difficult to solve. Two heuristic algorithms are developed using different techniques based on the optimal properties of the relaxed problem. The performance comparison between the two algorithms is illustrated by numerical examples. The numerical results show that, for the most part, there exists a heuristic algorithm which is more effective than the other.
Directory of Open Access Journals (Sweden)
C Hauman
2014-06-01
Full Text Available The vehicle routing problem with time windows is a widely studied problem with many real-world applications. The problem considered here entails the construction of routes that a number of identical vehicles travel to service different nodes within a certain time window. New benchmark problems with multi-objective features were recently suggested in the literature and the multi-objective optimisation cross-entropy method is applied to these problems to investigate the feasibility of the method and to determine and propose reference solutions for the benchmark problems. The application of the cross-entropy method to the multi-objective vehicle routing problem with soft time windows is investigated. The objectives that are evaluated include the minimisation of the total distance travelled, the number of vehicles and/or routes, the total waiting time and delay time of the vehicles and the makespan of a route.
Jackson, C. E., Jr.
1977-01-01
A sample problem library containing 20 problems covering most facets of Nastran Thermal Analyzer modeling is presented. Areas discussed include radiative interchange, arbitrary nonlinear loads, transient temperature and steady-state structural plots, temperature-dependent conductivities, simulated multi-layer insulation, and constraint techniques. The use of the major control options and important DMAP alters is demonstrated.
What is Time in Some Modern Physics Theories: Interpretation Problems
Directory of Open Access Journals (Sweden)
Karpenko Ivan A.
2016-03-01
Full Text Available The article deals with the problem of time in the context of several theories of modem physics. This fundamental concept inevitably arises in physical theories, but so far there is no adequate description of it in the philosophy of science. In the theory of relativity, quantum field theory. Standard Model of particle physics, theory of loop quantum gravity, superstring theory and other most recent theories the idea of time is shown explicitly or not. Sometimes, such as in the special theory of relativity, it plays a significant role and sometimes it does not. But anyway it exists and is implied by the content of the theory, which in some cases directly includes its mathematical tools. Fundamental difference of space-time processes in microcosm and macrocosm is of particular importance for solving the problem. In this regard, a need to understand the time in the way it appears in modem physics, to describe it in the language of philosophy arises (satisfactory for time description mathematical tools also do not exist. This will give an opportunity to get closer to the answer on question of time characteristics. And even if we do not obtain the exact answer, we will still be able to formulate the right question about its nature. For this purpose, the present research carries out analysis of the key theories of modern physics with regard to historical and scientific, historical and philosophical perspectives, hi some cases, this gives an opportunity to detect the succession of the associated with time perception ideas, their development, as well as the origination of fundamentally new ones. During the analysis, the conect characteristics of time are formulated from the point of view of physical theory and the attempt to state the nature of time is made. On the ground of conducted research, the conclusions about current state of the problem and its future solution perspectives are drawn.
DEFF Research Database (Denmark)
Karsten, Christian Vad; Pisinger, David; Røpke, Stefan
2015-01-01
-commodity network flow problem with transit time constraints which puts limits on the duration of the transit of the commodities through the network. It is shown that for the particular application it does not increase the solution time to include the transit time constraints and that including the transit time...... is essential to offer customers a competitive product. © 2015 Elsevier Ltd. All rights reserved....
Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle
Directory of Open Access Journals (Sweden)
Wang Li-ying
2015-11-01
Full Text Available This paper presents the electric vehicle (EV multiple charging station location-routing problem with time window to optimize the routing plan of capacitated EVs and the strategy of charging stations. In particular, the strategy of charging stations includes both infrastructure-type selection and station location decisions. The problem accounts for two critical constraints in logistic practice: the vehicle loading capacity and the customer time windows. A hybrid heuristic that incorporates an adaptive variable neighborhood search (AVNS with the tabu search algorithm for intensification was developed to address the problem. The specialized neighborhood structures and the selection methods of charging station used in the shaking step of AVNS were proposed. In contrast to the commercial solver CPLEX, experimental results on small-scale test instances demonstrate that the algorithm can find nearly optimal solutions on small-scale instances. The results on large-scale instances also show the effectiveness of the algorithm.
First passage time problems in time-dependent fields
International Nuclear Information System (INIS)
Fletcher, J.E.; Havlin, S.; Weiss, G.H.
1988-01-01
This paper discusses the simplest first passage time problems for random walks and diffusion processes on a line segment. When a diffusing particle moves in a time-varying field, use of the adjoint equation does not lead to any simplification in the calculation of moments of the first passage time as is the case for diffusion in a time-invariant field. We show that for a discrete random walk in the presence of a sinusoidally varying field there is a resonant frequency omega* for which the mean residence time on the line segment in a minimum. It is shown that for a random walk on a line segment of length L the mean residence time goes like L 2 for large L when omega omega*, but when omega = omega* the dependence is proportional to L. The results of our simulation are numerical, but can be regarded as exact. Qualitatively similar results are shown to hold for diffusion processes by a perturbation expansion in powers of a dimensionless velocity. These results are extended to higher values of this parameter by a numerical solution of the forward equation
One-dimensional central-force problem, including radiation reaction
International Nuclear Information System (INIS)
Kasher, J.C.
1976-01-01
Two equal masses of equal charge magnitude (either attractive or repulsive) are held a certain distance apart for their entire past history. AT t = 0 one of them is either started from rest or given an initial velocity toward or away from the other charge. When the Dirac radiation-reaction force is included in the force equation, our Taylor-series numerical calculations lead to two types of nonphysical results for both the attractive and repulsive cases. In the attractive case, the moving charge either stops and moves back out to infinity, or violates energy conservation as it nears collision with the fixed charge. For the repulsive charges, the moving particle either eventually approaches and collides with the fixed one, or violates energy conservation as it goes out to infinity. These results lead us to conclude that the Lorentz-Dirac equation is not valid for the one-dimensional central-force problem
Minimal Time Problem with Impulsive Controls
Energy Technology Data Exchange (ETDEWEB)
Kunisch, Karl, E-mail: karl.kunisch@uni-graz.at [University of Graz, Institute for Mathematics and Scientific Computing (Austria); Rao, Zhiping, E-mail: zhiping.rao@ricam.oeaw.ac.at [Austrian Academy of Sciences, Radon Institute of Computational and Applied Mathematics (Austria)
2017-02-15
Time optimal control problems for systems with impulsive controls are investigated. Sufficient conditions for the existence of time optimal controls are given. A dynamical programming principle is derived and Lipschitz continuity of an appropriately defined value functional is established. The value functional satisfies a Hamilton–Jacobi–Bellman equation in the viscosity sense. A numerical example for a rider-swing system is presented and it is shown that the reachable set is enlargered by allowing for impulsive controls, when compared to nonimpulsive controls.
Time-dependent problems and difference methods
Gustafsson, Bertil; Oliger, Joseph
2013-01-01
Praise for the First Edition "". . . fills a considerable gap in the numerical analysis literature by providing a self-contained treatment . . . this is an important work written in a clear style . . . warmly recommended to any graduate student or researcher in the field of the numerical solution of partial differential equations."" -SIAM Review Time-Dependent Problems and Difference Methods, Second Edition continues to provide guidance for the analysis of difference methods for computing approximate solutions to partial differential equations for time-de
Robust Optimization for Time-Cost Tradeoff Problem in Construction Projects
Li, Ming; Wu, Guangdong
2014-01-01
Construction projects are generally subject to uncertainty, which influences the realization of time-cost tradeoff in project management. This paper addresses a time-cost tradeoff problem under uncertainty, in which activities in projects can be executed in different construction modes corresponding to specified time and cost with interval uncertainty. Based on multiobjective robust optimization method, a robust optimization model for time-cost tradeoff problem is developed. In order to illus...
Continuous-time quantum algorithms for unstructured problems
International Nuclear Information System (INIS)
Hen, Itay
2014-01-01
We consider a family of unstructured optimization problems, for which we propose a method for constructing analogue, continuous-time (not necessarily adiabatic) quantum algorithms that are faster than their classical counterparts. In this family of problems, which we refer to as ‘scrambled input’ problems, one has to find a minimum-cost configuration of a given integer-valued n-bit black-box function whose input values have been scrambled in some unknown way. Special cases within this set of problems are Grover’s search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of the Deutsch–Josza problem. We consider a couple of examples in detail. In the first, we provide an O(1) deterministic analogue quantum algorithm to solve the seminal problem of Deutsch and Josza, in which one has to determine whether an n-bit boolean function is constant (gives 0 on all inputs or 1 on all inputs) or balanced (returns 0 on half the input states and 1 on the other half). We also study one variant of the random energy model, and show that, as one might expect, its minimum energy configuration can be found quadratically faster with a quantum adiabatic algorithm than with classical algorithms. (paper)
Exact methods for time constrained routing and related scheduling problems
DEFF Research Database (Denmark)
Kohl, Niklas
1995-01-01
of customers. In the VRPTW customers must be serviced within a given time period - a so called time window. The objective can be to minimize operating costs (e.g. distance travelled), fixed costs (e.g. the number of vehicles needed) or a combination of these component costs. During the last decade optimization......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...... of J?rnsten, Madsen and S?rensen (1986), which has been tested computationally by Halse (1992). Both methods decompose the problem into a series of time and capacity constrained shotest path problems. This yields a tight lower bound on the optimal objective, and the dual gap can often be closed...
[Measuring nursing care times--methodologic and documentation problems].
Bartholomeyczik, S; Hunstein, D
2001-08-01
The time for needed nursing care is one important measurement as a basic for financing care. In Germany the Long Term Care Insurance (LTCI) reimburses nursing care depending on the time family care givers need to complete selected activities. The LTCI recommends certain time ranges for these activities, which are wholly compensatory, as a basic for assessment. The purpose is to enhance assessment justice and comparability. With the example of a German research project, which had to investigate the duration of these activities and the reasons for differences, questions are raised about some definition and interpretation problems. There are definition problems, since caring activities especially in private households are nearly never performed as clearly defined modules. Moreover, often different activities are performed simultaneously. However, the most important question is what exactly time numbers can say about the essentials of nursing care.
Reachability cuts for the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Lysgaard, Jens
2004-01-01
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to k-path cuts...
Directory of Open Access Journals (Sweden)
Behrouz Afshar-Nadjafi
2017-01-01
Full Text Available In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on maximum number of the vehicles in depots must be satisfied. The problem is formulated as a mixed integer programming model. A constructive heuristic procedure is proposed for the problem. Also, the efficiency of the proposed algorithm is evaluated on 180 test problems. The obtained computational results indicate that the procedure is capable to obtain a satisfying solution.
Time-Space Trade-Offs for the Longest Common Substring Problem
DEFF Research Database (Denmark)
Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel
2013-01-01
The Longest Common Substring problem is to compute the longest substring which occurs in at least d ≥ 2 of m strings of total length n. In this paper we ask the question whether this problem allows a deterministic time-space trade-off using O(n1+ε) time and O(n1-ε) space for 0 ≤ ε ≤ 1. We give a ...... a positive answer in the case of two strings (d = m = 2) and 0 can be solved in O(n1-ε) space and O(n1+ε log2n (d log2n + d2)) time for any 0 ≤ ε ...The Longest Common Substring problem is to compute the longest substring which occurs in at least d ≥ 2 of m strings of total length n. In this paper we ask the question whether this problem allows a deterministic time-space trade-off using O(n1+ε) time and O(n1-ε) space for 0 ≤ ε ≤ 1. We give...
Recognition of Action as a Bayesian Parameter Estimation Problem over Time
DEFF Research Database (Denmark)
Krüger, Volker
2007-01-01
In this paper we will discuss two problems related to action recognition: The first problem is the one of identifying in a surveillance scenario whether a person is walking or running and in what rough direction. The second problem is concerned with the recovery of action primitives from observed...... complex actions. Both problems will be discussed within a statistical framework. Bayesian propagation over time offers a framework to treat likelihood observations at each time step and the dynamics between the time steps in a unified manner. The first problem will be approached as a patter recognition...... of the Bayesian framework for action recognition and round up our discussion....
Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags
ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu
2017-05-01
Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.
Path inequalities for the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Kallehauge, Brian; Boland, Natashia; Madsen, Oli B.G.
2007-01-01
In this paper we introduce a new formulation of the vehicle routing problem with time windows (VRPTW) involving only binary variables. The new formulation is based on the formulation of the asymmetric traveling salesman problem with time windows by Ascheuer et al. (Networks 36 (2000) 69-79) and has...
A queueing framework for routing problems with time-dependent travel times
Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.
2007-01-01
Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle
An effective approach to the problem of time
Bojowald, M.; Höhn, P.A.|info:eu-repo/dai/nl/330827952; Tsobanjan, A.
2010-01-01
A practical way to deal with the problem of time in quantum cosmology and quantum gravity is proposed. The main tool is effective equations, which mainly restrict explicit considerations to semiclassical regimes but have the crucial advantage of allowing the consistent use of local internal times in
Well-posedness of inverse problems for systems with time dependent parameters
DEFF Research Database (Denmark)
Banks, H. T.; Pedersen, Michael
2009-01-01
on the data of the problem. We also consider well-posedness as well as finite element type approximations in associated inverse problems. The problem above is a weak formulation that includes models in abstract differential operator form that include plate, beam and shell equations with several important...
Using Video to Bridge the Gap Between Problem Behavior and a Delayed Time-out Procedure.
Coppage, Sara; Meindl, James N
2017-09-01
Treatment plans focused on problem behavior often include punishment contingencies to decrease problem behavior. Immediate punishers are typically more effective than delayed punishers, but immediate delivery of a punisher is not always possible. Strategies need to be developed to increase the suppressive effects of delayed punishers. This study demonstrated the effectiveness of a treatment package involving replaying a video recording of problem behavior immediately before delivering a 15 min delayed time-out. This treatment package may prove to be an accessible and inexpensive strategy when using delayed punishers.
Solution of large nonlinear time-dependent problems using reduced coordinates
International Nuclear Information System (INIS)
Mish, K.D.
1987-01-01
This research is concerned with the idea of reducing a large time-dependent problem, such as one obtained from a finite-element discretization, down to a more manageable size while preserving the most-important physical behavior of the solution. This reduction process is motivated by the concept of a projection operator on a Hilbert Space, and leads to the Lanczos Algorithm for generation of approximate eigenvectors of a large symmetric matrix. The Lanczos Algorithm is then used to develop a reduced form of the spatial component of a time-dependent problem. The solution of the remaining temporal part of the problem is considered from the standpoint of numerical-integration schemes in the time domain. All of these theoretical results are combined to motivate the proposed reduced coordinate algorithm. This algorithm is then developed, discussed, and compared to related methods from the mechanics literature. The proposed reduced coordinate method is then applied to the solution of some representative problems in mechanics. The results of these problems are discussed, conclusions are drawn, and suggestions are made for related future research
Efficient Fourier-based algorithms for time-periodic unsteady problems
Gopinath, Arathi Kamath
2007-12-01
This dissertation work proposes two algorithms for the simulation of time-periodic unsteady problems via the solution of Unsteady Reynolds-Averaged Navier-Stokes (URANS) equations. These algorithms use a Fourier representation in time and hence solve for the periodic state directly without resolving transients (which consume most of the resources in a time-accurate scheme). In contrast to conventional Fourier-based techniques which solve the governing equations in frequency space, the new algorithms perform all the calculations in the time domain, and hence require minimal modifications to an existing solver. The complete space-time solution is obtained by iterating in a fifth pseudo-time dimension. Various time-periodic problems such as helicopter rotors, wind turbines, turbomachinery and flapping-wings can be simulated using the Time Spectral method. The algorithm is first validated using pitching airfoil/wing test cases. The method is further extended to turbomachinery problems, and computational results verified by comparison with a time-accurate calculation. The technique can be very memory intensive for large problems, since the solution is computed (and hence stored) simultaneously at all time levels. Often, the blade counts of a turbomachine are rescaled such that a periodic fraction of the annulus can be solved. This approximation enables the solution to be obtained at a fraction of the cost of a full-scale time-accurate solution. For a viscous computation over a three-dimensional single-stage rescaled compressor, an order of magnitude savings is achieved. The second algorithm, the reduced-order Harmonic Balance method is applicable only to turbomachinery flows, and offers even larger computational savings than the Time Spectral method. It simulates the true geometry of the turbomachine using only one blade passage per blade row as the computational domain. In each blade row of the turbomachine, only the dominant frequencies are resolved, namely
A point implicit time integration technique for slow transient flow problems
Energy Technology Data Exchange (ETDEWEB)
Kadioglu, Samet Y., E-mail: kadioglu@yildiz.edu.tr [Department of Mathematical Engineering, Yildiz Technical University, 34210 Davutpasa-Esenler, Istanbul (Turkey); Berry, Ray A., E-mail: ray.berry@inl.gov [Idaho National Laboratory, P.O. Box 1625, MS 3840, Idaho Falls, ID 83415 (United States); Martineau, Richard C. [Idaho National Laboratory, P.O. Box 1625, MS 3840, Idaho Falls, ID 83415 (United States)
2015-05-15
Highlights: • This new method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods. • It is unconditionally stable, as a fully implicit method would be. • It exhibits the simplicity of implementation of an explicit method. • It is specifically designed for slow transient flow problems of long duration such as can occur inside nuclear reactor coolant systems. • Our findings indicate the new method can integrate slow transient problems very efficiently; and its implementation is very robust. - Abstract: We introduce a point implicit time integration technique for slow transient flow problems. The method treats the solution variables of interest (that can be located at cell centers, cell edges, or cell nodes) implicitly and the rest of the information related to same or other variables are handled explicitly. The method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods, except it involves a few additional function(s) evaluation steps. Moreover, the method is unconditionally stable, as a fully implicit method would be. This new approach exhibits the simplicity of implementation of explicit methods and the stability of implicit methods. It is specifically designed for slow transient flow problems of long duration wherein one would like to perform time integrations with very large time steps. Because the method can be time inaccurate for fast transient problems, particularly with larger time steps, an appropriate solution strategy for a problem that evolves from a fast to a slow transient would be to integrate the fast transient with an explicit or semi-implicit technique and then switch to this point implicit method as soon as the time variation slows sufficiently. We have solved several test problems that result from scalar or systems of flow equations. Our findings indicate the new method can integrate slow transient problems very
A point implicit time integration technique for slow transient flow problems
International Nuclear Information System (INIS)
Kadioglu, Samet Y.; Berry, Ray A.; Martineau, Richard C.
2015-01-01
Highlights: • This new method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods. • It is unconditionally stable, as a fully implicit method would be. • It exhibits the simplicity of implementation of an explicit method. • It is specifically designed for slow transient flow problems of long duration such as can occur inside nuclear reactor coolant systems. • Our findings indicate the new method can integrate slow transient problems very efficiently; and its implementation is very robust. - Abstract: We introduce a point implicit time integration technique for slow transient flow problems. The method treats the solution variables of interest (that can be located at cell centers, cell edges, or cell nodes) implicitly and the rest of the information related to same or other variables are handled explicitly. The method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods, except it involves a few additional function(s) evaluation steps. Moreover, the method is unconditionally stable, as a fully implicit method would be. This new approach exhibits the simplicity of implementation of explicit methods and the stability of implicit methods. It is specifically designed for slow transient flow problems of long duration wherein one would like to perform time integrations with very large time steps. Because the method can be time inaccurate for fast transient problems, particularly with larger time steps, an appropriate solution strategy for a problem that evolves from a fast to a slow transient would be to integrate the fast transient with an explicit or semi-implicit technique and then switch to this point implicit method as soon as the time variation slows sufficiently. We have solved several test problems that result from scalar or systems of flow equations. Our findings indicate the new method can integrate slow transient problems very
Approximation algorithms for replenishment problems with fixed turnover times
T. Bosman (Thomas); M. van Ee (Martijn); Y. Jiao (Yang); A. Marchetti Spaccamela (Alberto); R. Ravi; L. Stougie (Leen)
2018-01-01
textabstractWe introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity are located at various places; at each node the
Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm
Directory of Open Access Journals (Sweden)
Zhengyu Duan
2015-11-01
Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.
The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem
DEFF Research Database (Denmark)
Black, Daniel; Eglese, Richard; Wøhlk, Sanne
2015-01-01
-life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time......In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real...
Numerical Solution of Time-Dependent Problems with a Fractional-Power Elliptic Operator
Vabishchevich, P. N.
2018-03-01
A time-dependent problem in a bounded domain for a fractional diffusion equation is considered. The first-order evolution equation involves a fractional-power second-order elliptic operator with Robin boundary conditions. A finite-element spatial approximation with an additive approximation of the operator of the problem is used. The time approximation is based on a vector scheme. The transition to a new time level is ensured by solving a sequence of standard elliptic boundary value problems. Numerical results obtained for a two-dimensional model problem are presented.
Integrals of Motion for Discrete-Time Optimal Control Problems
Torres, Delfim F. M.
2003-01-01
We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
DEFF Research Database (Denmark)
Hiermann, Gerhard; Puchinger, Jakob; Røpke, Stefan
2016-01-01
Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes...... detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to sustain the competitiveness of electric vehicles compared to conventional vehicles. We introduce the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (E......-FSMFTW) to model decisions to be made with regards to fleet composition and the actual vehicle routes including the choice of recharging times and locations. The available vehicle types differ in their transport capacity, battery size and acquisition cost. Furthermore, we consider time windows at customer...
The problem of time quantum mechanics versus general relativity
Anderson, Edward
2017-01-01
This book is a treatise on time and on background independence in physics. It first considers how time is conceived of in each accepted paradigm of physics: Newtonian, special relativity, quantum mechanics (QM) and general relativity (GR). Substantial differences are moreover uncovered between what is meant by time in QM and in GR. These differences jointly source the Problem of Time: Nine interlinked facets which arise upon attempting concurrent treatment of the QM and GR paradigms, as is required in particular for a background independent theory of quantum gravity. A sizeable proportion of current quantum gravity programs - e.g. geometrodynamical and loop quantum gravity approaches to quantum GR, quantum cosmology, supergravity and M-theory - are background independent in this sense. This book's foundational topic is thus furthermore of practical relevance in the ongoing development of quantum gravity programs. This book shows moreover that eight of the nine facets of the Problem of Time already occur upon ...
Nonlinear triple-point problems on time scales
Directory of Open Access Journals (Sweden)
Douglas R. Anderson
2004-04-01
Full Text Available We establish the existence of multiple positive solutions to the nonlinear second-order triple-point boundary-value problem on time scales, $$displaylines{ u^{Delta abla}(t+h(tf(t,u(t=0, cr u(a=alpha u(b+delta u^Delta(a,quad eta u(c+gamma u^Delta(c=0 }$$ for $tin[a,c]subsetmathbb{T}$, where $mathbb{T}$ is a time scale, $eta, gamma, deltage 0$ with $Beta+gamma>0$, $0
Robust Optimization for Time-Cost Tradeoff Problem in Construction Projects
Directory of Open Access Journals (Sweden)
Ming Li
2014-01-01
Full Text Available Construction projects are generally subject to uncertainty, which influences the realization of time-cost tradeoff in project management. This paper addresses a time-cost tradeoff problem under uncertainty, in which activities in projects can be executed in different construction modes corresponding to specified time and cost with interval uncertainty. Based on multiobjective robust optimization method, a robust optimization model for time-cost tradeoff problem is developed. In order to illustrate the robust model, nondominated sorting genetic algorithm-II (NSGA-II is modified to solve the project example. The results show that, by means of adjusting the time and cost robust coefficients, the robust Pareto sets for time-cost tradeoff can be obtained according to different acceptable risk level, from which the decision maker could choose the preferred construction alternative.
Time Consistent Strategies for Mean-Variance Asset-Liability Management Problems
Directory of Open Access Journals (Sweden)
Hui-qiang Ma
2013-01-01
Full Text Available This paper studies the optimal time consistent investment strategies in multiperiod asset-liability management problems under mean-variance criterion. By applying time consistent model of Chen et al. (2013 and employing dynamic programming technique, we derive two-time consistent policies for asset-liability management problems in a market with and without a riskless asset, respectively. We show that the presence of liability does affect the optimal strategy. More specifically, liability leads a parallel shift of optimal time-consistent investment policy. Moreover, for an arbitrarily risk averse investor (under the variance criterion with liability, the time-diversification effects could be ignored in a market with a riskless asset; however, it should be considered in a market without any riskless asset.
A Linear Time Algorithm for the k Maximal Sums Problem
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Jørgensen, Allan Grønlund
2007-01-01
k maximal sums problem. We use this algorithm to obtain algorithms solving the two-dimensional k maximal sums problem in O(m 2·n + k) time, where the input is an m ×n matrix with m ≤ n. We generalize this algorithm to solve the d-dimensional problem in O(n 2d − 1 + k) time. The space usage of all......Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we design an optimal O(n + k) time algorithm for the...... the algorithms can be reduced to O(n d − 1 + k). This leads to the first algorithm for the k maximal sums problem in one dimension using O(n + k) time and O(k) space....
A game theoretic approach to a finite-time disturbance attenuation problem
Rhee, Ihnseok; Speyer, Jason L.
1991-01-01
A disturbance attenuation problem over a finite-time interval is considered by a game theoretic approach where the control, restricted to a function of the measurement history, plays against adversaries composed of the process and measurement disturbances, and the initial state. A zero-sum game, formulated as a quadratic cost criterion subject to linear time-varying dynamics and measurements, is solved by a calculus of variation technique. By first maximizing the quadratic cost criterion with respect to the process disturbance and initial state, a full information game between the control and the measurement residual subject to the estimator dynamics results. The resulting solution produces an n-dimensional compensator which expresses the controller as a linear combination of the measurement history. A disturbance attenuation problem is solved based on the results of the game problem. For time-invariant systems it is shown that under certain conditions the time-varying controller becomes time-invariant on the infinite-time interval. The resulting controller satisfies an H(infinity) norm bound.
The A-priori Traveling Salesman Problem with Time Windows
DEFF Research Database (Denmark)
Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.
2004-01-01
seek to minimize lateness and examine the impact of this criterion choice on the distance traveled. Our focus on lateness is motivated by the problem faced by overnight mail service providers. We propose a real-time solution method that requires the vehicle, when idle, to wait at the current customer......In this paper we examine the traveling saleman problem with time windows for various degrees of dynamism. In contrast to the static problem, where the dispatcher can plan ahead, in the dynamic version, part or all of the necessary information becomes available only during the day of operation. We...... randomly generated data and on a real-world case study indicate that all policies proved capable of significantly reducing lateness. Our results also show that this can be accomplished with only small distance increases. The basic policy outperformed the other methods primarily when lateness and distance...
Bidirectional Associations Between Newlyweds' Marital Satisfaction and Marital Problems over Time.
Lavner, Justin A; Karney, Benjamin R; Williamson, Hannah C; Bradbury, Thomas N
2017-12-01
Prevailing views of marital functioning generally adopt the view that marital problems predict decreases in marital satisfaction, but alternative theoretical perspectives raise the possibility that lowered satisfaction can also predict increases in problems. The current study sought to integrate and compare these perspectives by examining the bidirectional cross-lagged associations between newlyweds' reports of their marital satisfaction and marital problems over the first 4 years of marriage. Using annual assessments from 483 heterosexual newlywed couples, we find evidence for problem-to-satisfaction linkages as well as satisfaction-to-problem linkages. Satisfaction was a stronger predictor of marital problems early in marriage but not as time passed; by Year 4 only problem-to-satisfaction linkages remained significant. These findings are consistent with the idea that couples with more problems go on to report lower levels of satisfaction and couples with lower levels of satisfaction go on to report more marital problems. This dynamic interplay between global judgments about relationship satisfaction and ongoing specific relationship difficulties highlights the value of examining bidirectional effects to better understand marital functioning over time. © 2016 Family Process Institute.
Learning and Teaching Problems in Part-Time Higher Education.
Trotman-Dickenson, D. I.
1988-01-01
Results of a British survey of the administrations of six universities and six public colleges, employers, and employees who were part-time students are reported and discussed. The survey assessed the perceptions of those groups concerning problems in the instruction and learning of part-time students. (MSE)
Problems of space-time behaviour of nuclear reactors
International Nuclear Information System (INIS)
Obradovic, D.
1966-01-01
This paper covers a review of literature and mathematical methods applied for space-time behaviour of nuclear reactors. The review of literature is limited to unresolved problems and trends of actual research in the field of reactor physics [sr
Optimal Design and Real Time Implementation of Autonomous Microgrid Including Active Load
Directory of Open Access Journals (Sweden)
Mohamed A. Hassan
2018-05-01
Full Text Available Controller gains and power-sharing parameters are the main parameters affect the dynamic performance of the microgrid. Considering an active load to the autonomous microgrid, the stability problem will be more involved. In this paper, the active load effect on microgrid dynamic stability is explored. An autonomous microgrid including three inverter-based distributed generations (DGs with an active load is modeled and the associated controllers are designed. Controller gains of the inverters and active load as well as Phase Locked Loop (PLL parameters are optimally tuned to guarantee overall system stability. A weighted objective function is proposed to minimize the error in both measured active power and DC voltage based on time-domain simulations. Different AC and DC disturbances are applied to verify and assess the effectiveness of the proposed control strategy. The results demonstrate the potential of the proposed controller to enhance the microgrid stability and to provide efficient damping characteristics. Additionally, the proposed controller is compared with the literature to demonstrate its superiority. Finally, the microgrid considered has been established and implemented on real time digital simulator (RTDS. The experimental results validate the simulation results and approve the effectiveness of the proposed controllers to enrich the stability of the considered microgrid.
An inverse problem for a one-dimensional time-fractional diffusion problem
Jin, Bangti
2012-06-26
We study an inverse problem of recovering a spatially varying potential term in a one-dimensional time-fractional diffusion equation from the flux measurements taken at a single fixed time corresponding to a given set of input sources. The unique identifiability of the potential is shown for two cases, i.e. the flux at one end and the net flux, provided that the set of input sources forms a complete basis in L 2(0, 1). An algorithm of the quasi-Newton type is proposed for the efficient and accurate reconstruction of the coefficient from finite data, and the injectivity of the Jacobian is discussed. Numerical results for both exact and noisy data are presented. © 2012 IOP Publishing Ltd.
Knowledge Management and Problem Solving in Real Time: The Role of Swarm Intelligence
Directory of Open Access Journals (Sweden)
Chris W Callaghan
2016-06-01
Full Text Available Knowledge management research applied to the development of real-time research capability, or capability to solve societal problems in hours and days instead of years and decades, is perhaps increasingly important, given persistent global problems such as the Zika virus and rapidly developing antibiotic resistance. Drawing on swarm intelligence theory, this paper presents an approach to real-time research problem-solving in the form of a framework for understanding the complexity of real-time research and the challenges associated with maximizing collaboration. The objective of this research is to make explicit certain theoretical, methodological, and practical implications deriving from new literature on emerging technologies and new forms of problem solving and to offer a model of real-time problem solving based on a synthesis of the literature. Drawing from ant colony, bee colony, and particle swarm optimization, as well as other population-based metaheuristics, swarm intelligence principles are derived in support of improved effectiveness and efficiency for multidisciplinary human swarm problem-solving. This synthesis seeks to offer useful insights into the research process, by offering a perspective of what maximized collaboration, as a system, implies for real-time problem solving.
Time reversal imaging, Inverse problems and Adjoint Tomography}
Montagner, J.; Larmat, C. S.; Capdeville, Y.; Kawakatsu, H.; Fink, M.
2010-12-01
With the increasing power of computers and numerical techniques (such as spectral element methods), it is possible to address a new class of seismological problems. The propagation of seismic waves in heterogeneous media is simulated more and more accurately and new applications developed, in particular time reversal methods and adjoint tomography in the three-dimensional Earth. Since the pioneering work of J. Claerbout, theorized by A. Tarantola, many similarities were found between time-reversal methods, cross-correlations techniques, inverse problems and adjoint tomography. By using normal mode theory, we generalize the scalar approach of Draeger and Fink (1999) and Lobkis and Weaver (2001) to the 3D- elastic Earth, for theoretically understanding time-reversal method on global scale. It is shown how to relate time-reversal methods on one hand, with auto-correlations of seismograms for source imaging and on the other hand, with cross-correlations between receivers for structural imaging and retrieving Green function. Time-reversal methods were successfully applied in the past to acoustic waves in many fields such as medical imaging, underwater acoustics, non destructive testing and to seismic waves in seismology for earthquake imaging. In the case of source imaging, time reversal techniques make it possible an automatic location in time and space as well as the retrieval of focal mechanism of earthquakes or unknown environmental sources . We present here some applications at the global scale of these techniques on synthetic tests and on real data, such as Sumatra-Andaman (Dec. 2004), Haiti (Jan. 2010), as well as glacial earthquakes and seismic hum.
Free time minimizers for the three-body problem
Moeckel, Richard; Montgomery, Richard; Sánchez Morgado, Héctor
2018-03-01
Free time minimizers of the action (called "semi-static" solutions by Mañe in International congress on dynamical systems in Montevideo (a tribute to Ricardo Mañé), vol 362, pp 120-131, 1996) play a central role in the theory of weak KAM solutions to the Hamilton-Jacobi equation (Fathi in Weak KAM Theorem in Lagrangian Dynamics Preliminary Version Number 10, 2017). We prove that any solution to Newton's three-body problem which is asymptotic to Lagrange's parabolic homothetic solution is eventually a free time minimizer. Conversely, we prove that every free time minimizer tends to Lagrange's solution, provided the mass ratios lie in a certain large open set of mass ratios. We were inspired by the work of Da Luz and Maderna (Math Proc Camb Philos Soc 156:209-227, 1980) which showed that every free time minimizer for the N-body problem is parabolic and therefore must be asymptotic to the set of central configurations. We exclude being asymptotic to Euler's central configurations by a second variation argument. Central configurations correspond to rest points for the McGehee blown-up dynamics. The large open set of mass ratios are those for which the linearized dynamics at each Euler rest point has a complex eigenvalue.
Branch-and-cut-and-price for the traveling salesman problem with time windows
DEFF Research Database (Denmark)
Røpke, Stefan; Madsen, Oli B.G.
In the traveling salesman problem with time windows (TSPTW) one is given a depot and a set of nodes to be visited by a salesman. The salesman starts his trip at the depot and must visit all nodes while respecting time windows at the nodes. The objective of the problem is to minimize the total...... distance traveled by the salesman. The TSPTW is formulated as a set-partitioning problem which is solved by using combined cut and column generation. The pricing sub problem in the column generation procedure is a shortest path problem with time window constraints and 2-cycle elimination. A standard column...
Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach
Energy Technology Data Exchange (ETDEWEB)
Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France)
2016-12-15
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.
Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach
International Nuclear Information System (INIS)
Pham, Huyên; Wei, Xiaoli
2016-01-01
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.
Problems of Software Detection of Periodic Features in a Time ...
African Journals Online (AJOL)
Problems arise when attempts are made to extract automatically, visually obvious periodic features indicative of defects in a vibration time series for diagnosis using computers. Such problems may be interpretational in nature arising either from insufficient knowledge of the mechanism, or the convolution of the source signal ...
The Vehicle Routing Problem with Time Windows and Temporal Dependencies
DEFF Research Database (Denmark)
Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper
to be scheduled with a certain slack between them. They refer to the vehicle problem as having interdependent time windows. Temporal dependencies have been modeled for a home care routing problem in a mixed integer programming model (MIP) which was solved with a standard MIP solver. An application with general...
Evolutionary algorithms for the Vehicle Routing Problem with Time Windows
Bräysy, Olli; Dullaert, Wout; Gendreau, Michel
2004-01-01
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way
The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
Directory of Open Access Journals (Sweden)
Huey-Kuo Chen
2011-01-01
Full Text Available This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW. Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.
Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time
Directory of Open Access Journals (Sweden)
Hongtao Hu
2016-01-01
Full Text Available A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min–max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.
International Nuclear Information System (INIS)
Rougé, Charles; Mathias, Jean-Denis; Deffuant, Guillaume
2014-01-01
The goal of this paper is twofold: (1) to show that time-variant reliability and a branch of control theory called stochastic viability address similar problems with different points of view, and (2) to demonstrate the relevance of concepts and methods from stochastic viability in reliability problems. On the one hand, reliability aims at evaluating the probability of failure of a system subjected to uncertainty and stochasticity. On the other hand, viability aims at maintaining a controlled dynamical system within a survival set. When the dynamical system is stochastic, this work shows that a viability problem belongs to a specific class of design and maintenance problems in time-variant reliability. Dynamic programming, which is used for solving Markovian stochastic viability problems, then yields the set of design states for which there exists a maintenance strategy which guarantees reliability with a confidence level β for a given period of time T. Besides, it leads to a straightforward computation of the date of the first outcrossing, informing on when the system is most likely to fail. We illustrate this approach with a simple example of population dynamics, including a case where load increases with time. - Highlights: • Time-variant reliability tools cannot devise complex maintenance strategies. • Stochastic viability is a control theory that computes a probability of failure. • Some design and maintenance problems are stochastic viability problems. • Used in viability, dynamic programming can find reliable maintenance actions. • Confronting reliability and control theories such as viability is promising
On the problem of time in quantum mechanics
Bauer, M.
2017-05-01
The problem of time in quantum mechanics (QM) concerns the fact that in the Schrödinger equation time is a parameter, not an operator. Pauli's objection to a time-energy uncertainty relation analogue to the position-momentum one, conjectured by Heisenberg early on, seemed to exclude the existence of such an operator. However Dirac's formulation of an electron's relativistic QM does allow the introduction of a dynamical time operator that is self-adjoint. Consequently, it can be considered as the generator of a unitary transformation of the system, as well as an additional system observable subject to uncertainty. In the present paper these aspects are examined within the standard framework of relativistic QM.
Single-machine common/slack due window assignment problems with linear decreasing processing times
Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia
2017-08-01
This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.
The Problem of Time in Quantum Cosmology: A Decoherent Histories View
International Nuclear Information System (INIS)
Christodoulakis, Theodosios; Wallden, Petros
2011-01-01
The problem of time in quantum gravity arises due to the diffeomorphisms invariance of the theory and appears via the Hamiltonian constraint, in the canonical quantizations. There is a need for a description where one can ask some timeless questions that still encode some sense of temporality. The decoherent histories approach to quantum theory, already at the kinematical level admits an internal time. Several alternative proposals for resolving the problem of time via the decoherent histories, exist, and in this contribution we focus on one particular and examine how it manifests itself at some simple cosmological models.
Time-Consistent Strategies for a Multiperiod Mean-Variance Portfolio Selection Problem
Directory of Open Access Journals (Sweden)
Huiling Wu
2013-01-01
Full Text Available It remained prevalent in the past years to obtain the precommitment strategies for Markowitz's mean-variance portfolio optimization problems, but not much is known about their time-consistent strategies. This paper takes a step to investigate the time-consistent Nash equilibrium strategies for a multiperiod mean-variance portfolio selection problem. Under the assumption that the risk aversion is, respectively, a constant and a function of current wealth level, we obtain the explicit expressions for the time-consistent Nash equilibrium strategy and the equilibrium value function. Many interesting properties of the time-consistent results are identified through numerical sensitivity analysis and by comparing them with the classical pre-commitment solutions.
One Improvement Method of Reducing Duration Directly to Solve Time-Cost Tradeoff Problem
Jian-xun, Qi; Dedong, Sun
Time and cost are two of the most important factors for project plan and schedule management, and specially, time-cost tradeoff problem is one classical problem in project scheduling, which is also a difficult problem. Methods of solving the problem mainly contain method of network flow and method of mending the minimal cost. Thereinto, for the method of mending the minimal cost is intuitionistic, convenient and lesser computation, these advantages make the method being used widely in practice. But disadvantage of the method is that the result of each step is optimal but the terminal result maybe not optimal. In this paper, firstly, method of confirming the maximal effective quantity of reducing duration is designed; secondly, on the basis of above method and the method of mending the minimal cost, the main method of reducing duration directly is designed to solve time-cost tradeoff problem, and by analyzing validity of the method, the method could obtain more optimal result for the problem.
Moving-boundary problems for the time-fractional diffusion equation
Directory of Open Access Journals (Sweden)
Sabrina D. Roscani
2017-02-01
Full Text Available We consider a one-dimensional moving-boundary problem for the time-fractional diffusion equation. The time-fractional derivative of order $\\alpha\\in (0,1$ is taken in the sense of Caputo. We study the asymptotic behaivor, as t tends to infinity, of a general solution by using a fractional weak maximum principle. Also, we give some particular exact solutions in terms of Wright functions.
Total variation regularization for a backward time-fractional diffusion problem
International Nuclear Information System (INIS)
Wang, Liyan; Liu, Jijun
2013-01-01
Consider a two-dimensional backward problem for a time-fractional diffusion process, which can be considered as image de-blurring where the blurring process is assumed to be slow diffusion. In order to avoid the over-smoothing effect for object image with edges and to construct a fast reconstruction scheme, the total variation regularizing term and the data residual error in the frequency domain are coupled to construct the cost functional. The well posedness of this optimization problem is studied. The minimizer is sought approximately using the iteration process for a series of optimization problems with Bregman distance as a penalty term. This iteration reconstruction scheme is essentially a new regularizing scheme with coupling parameter in the cost functional and the iteration stopping times as two regularizing parameters. We give the choice strategy for the regularizing parameters in terms of the noise level of measurement data, which yields the optimal error estimate on the iterative solution. The series optimization problems are solved by alternative iteration with explicit exact solution and therefore the amount of computation is much weakened. Numerical implementations are given to support our theoretical analysis on the convergence rate and to show the significant reconstruction improvements. (paper)
Lagrangian duality applied to the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Kallehauge, Brian; Larsen, Jesper; Madsen, Oli B.G.
2006-01-01
This paper considers the vehicle routing problem with time windows, where the service of each customer must start within a specified time interval. We consider the Lagrangian relaxation of the constraint set requiring that each customer must be served by exactly one vehicle yielding a constrained...... respectively, which to date are the largest problems ever solved to optimality. We have implemented the LBCP algorithm using the ABACUS open-source framework for solving mixed-integer linear-programs by branch, cut, and price....
Congestion Service Facilities Location Problem with Promise of Response Time
Directory of Open Access Journals (Sweden)
Dandan Hu
2013-01-01
Full Text Available In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.
A hybrid algorithm for flexible job-shop scheduling problem with setup times
Directory of Open Access Journals (Sweden)
Ameni Azzouz
2017-01-01
Full Text Available Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA and variable neighbourhood search (VNS to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.
The time-varying shortest path problem with fuzzy transit costs and speedup
Directory of Open Access Journals (Sweden)
Rezapour Hassan
2016-08-01
Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.
Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows
Directory of Open Access Journals (Sweden)
Junhyuk Park
2017-01-01
Full Text Available The capacitated team orienteering problem with time windows (CTOPTW is a problem to determine players’ paths that have the maximum rewards while satisfying the constraints. In this paper, we present the exact solution approach for the CTOPTW which has not been done in previous literature. We show that the branch-and-price (B&P scheme which was originally developed for the team orienteering problem can be applied to the CTOPTW. To solve pricing problems, we used implicit enumeration acceleration techniques, heuristic algorithms, and ng-route relaxations.
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
K. Dalmeijer (Kevin); R. Spliet (Remy)
2016-01-01
textabstractThis paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and
Decoupled Scheme for Time-Dependent Natural Convection Problem II: Time Semidiscreteness
Directory of Open Access Journals (Sweden)
Tong Zhang
2014-01-01
stability and the corresponding optimal error estimates are presented. Furthermore, a decoupled numerical scheme is proposed by decoupling the nonlinear terms via temporal extrapolation; optimal error estimates are established. Finally, some numerical results are provided to verify the performances of the developed algorithms. Compared with the coupled numerical scheme, the decoupled algorithm not only keeps good accuracy but also saves a lot of computational cost. Both theoretical analysis and numerical experiments show the efficiency and effectiveness of the decoupled method for time-dependent natural convection problem.
SEMIGROUPS N TIMES INTEGRATED AND AN APPLICATION TO A PROBLEM OF CAUCHY TYPE
Directory of Open Access Journals (Sweden)
Danessa Chirinos Fernández
2016-06-01
Full Text Available The theory of semigroups n times integrated is a generalization of strongly continuous semigroups, which was developed from 1984, and is widely used for the study of the existence and uniqueness of problems such Cauchy in which the operator domain is not necessarily dense. This paper presents an application of semigroups n times integrated into a problem of viscoelasticity, which is formulated as a Cauchy problem on a Banach space presents .
Time-Dependent Heat Conduction Problems Solved by an Integral-Equation Approach
International Nuclear Information System (INIS)
Oberaigner, E.R.; Leindl, M.; Antretter, T.
2010-01-01
Full text: A classical task of mathematical physics is the formulation and solution of a time dependent thermoelastic problem. In this work we develop an algorithm for solving the time-dependent heat conduction equation c p ρ∂ t T-kT, ii =0 in an analytical, exact fashion for a two-component domain. By the Green's function approach the formal solution of the problem is obtained. As an intermediate result an integral-equation for the temperature history at the domain interface is formulated which can be solved analytically. This method is applied to a classical engineering problem, i.e. to a special case of a Stefan-Problem. The Green's function approach in conjunction with the integral-equation method is very useful in cases were strong discontinuities or jumps occur. The initial conditions and the system parameters of the investigated problem give rise to two jumps in the temperature field. Purely numerical solutions are obtained by using the FEM (finite element method) and the FDM (finite difference method) and compared with the analytical approach. At the domain boundary the analytical solution and the FEM-solution are in good agreement, but the FDM results show a signicant smearing effect. (author)
Serbin, Lisa A; Kingdon, Danielle; Ruttle, Paula L; Stack, Dale M
2015-11-01
Most theoretical models of developmental psychopathology involve a transactional, bidirectional relation between parenting and children's behavior problems. The present study utilized a cross-lagged panel, multiple interval design to model change in bidirectional relations between child and parent behavior across successive developmental periods. Two major categories of child behavior problems, internalizing and externalizing, and two aspects of parenting, positive (use of support and structure) and harsh discipline (use of physical punishment), were modeled across three time points spaced 3 years apart. Two successive developmental intervals, from approximately age 7.5 to 10.5 and from 10.5 to 13.5, were included. Mother-child dyads (N = 138; 65 boys) from a lower income longitudinal sample of families participated, with standardized measures of mothers rating their own parenting behavior and teachers reporting on child's behavior. Results revealed different types of reciprocal relations between specific aspects of child and parent behavior, with internalizing problems predicting an increase in positive parenting over time, which subsequently led to a reduction in internalizing problems across the successive 3-year interval. In contrast, externalizing predicted reduced levels of positive parenting in a reciprocal sequence that extended across two successive intervals and predicted increased levels of externalizing over time. Implications for prevention and early intervention are discussed.
Time and multiple objectives in scheduling and routing problems
Dabia, S.
2012-01-01
Many optimization problems encountered in practice are multi-objective by nature, i.e., different objectives are conflicting and equally important. Many times, it is not desirable to drop some of them or to optimize them in a composite single objective or hierarchical manner. Furthermore, cost
The Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times
DEFF Research Database (Denmark)
Fonseca, Joao Filipe Paiva; Larsen, Allan; van der Hurk, Evelien
In this talk, we deal with a generalization of the well-known Vehicle Scheduling Problem(VSP) that we call Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times (SVSPSP-FDT). The SVSPSP-FDT generalizes the VSP because the original timetables of the trips can...... be changed (i.e., shifted and stretched) in order to minimize a new objective function that aims at minimizing the operational costs plus the waiting times of the passengers at transfer points. Contrary to most generalizations of the VSP, the SVSPSP-FDT establishes the possibility of changing trips' dwell...... times at important transfer points based on expected passenger ows. We introduce a compact mixed integer linear formulation of the SVSPSP-FDT able to address small instances. We also present a meta-heuristic approach to solve medium/large instances of the problem. The e ectiveness of the proposed...
Directory of Open Access Journals (Sweden)
Mohammad Mirabi
2016-11-01
Full Text Available This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.
DEFF Research Database (Denmark)
Fetene, Gebeyehu Manie
The problem of peak load arises when demand fluctuates over time while the pro- duction technology is not flexible (or making it flexible is economically inefficient) and/or when a product is non-storable (or storage cost is huge). Peak load is a com- mon problem in consumption of public utilities......, on the one hand, observed cost saving benefit of postponing the time of charging to off-peak lower fee of charging and, on the other hand, the cost of delay in departure time for planned trips and uncertain cost of late charging associated with likelihood occur- rence of unanticipated trip before the car...... of electricity. The electric vehicle (EV) users choice of time of charging problem under PLP is different from that of general households using energy for house appliances since there is uncertain cost to the former as- sociated with likelihood occurrence of unanticipated trips such as visiting hospital...
Iterated local search algorithm for solving the orienteering problem with soft time windows.
Aghezzaf, Brahim; Fahim, Hassan El
2016-01-01
In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.
Time-reversed absorbing condition: application to inverse problems
International Nuclear Information System (INIS)
Assous, F; Kray, M; Nataf, F; Turkel, E
2011-01-01
The aim of this paper is to introduce time-reversed absorbing conditions in time-reversal methods. They enable one to 'recreate the past' without knowing the source which has emitted the signals that are back-propagated. We present two applications in inverse problems: the reduction of the size of the computational domain and the determination, from boundary measurements, of the location and volume of an unknown inclusion. The method does not rely on any a priori knowledge of the physical properties of the inclusion. Numerical tests with the wave and Helmholtz equations illustrate the efficiency of the method. This technique is fairly insensitive to noise in the data
The delivery dispatching problem with time windows for urban consolidation centers
van Heeswijk, W.J.A.; Mes, Martijn R.K.; Schutten, Johannes M.J.
2015-01-01
This paper addresses the dispatch decision problem faced by an urban consolidation center. The center receives orders according to a stochastic arrival process, and dispatches them for the last-mile distribution in batches. The operator of the center aims to fi nd the cost-minimizing consolidation policy, depending on the orders at hand, pre-announced orders, and stochastic arrivals. We present this problem as a variant of the Delivery Dispatching Problem that includes dispatch windows, and m...
International Nuclear Information System (INIS)
Minesaki, Yukitaka
2013-01-01
For the restricted three-body problem, we propose an accurate orbital integration scheme that retains all conserved quantities of the two-body problem with two primaries and approximately preserves the Jacobi integral. The scheme is obtained by taking the limit as mass approaches zero in the discrete-time general three-body problem. For a long time interval, the proposed scheme precisely reproduces various periodic orbits that cannot be accurately computed by other generic integrators
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
Directory of Open Access Journals (Sweden)
N. Rincon-Garcia
2017-01-01
Full Text Available This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%, travel distance (10.88% and travel time (12.00% compared to previous implementations in reasonable time.
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
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.
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...
Applying Particle Swarm Optimization for Solving Team Orienteering Problem with Time Windows
Directory of Open Access Journals (Sweden)
The Jin Ai
2014-01-01
Full Text Available The Team Orienteering Problem With Time Windows (TOPTW is a transportation problem case that have a set of vertices with a score, service time, and the time windows, start and final at a depot location. A number of paths are constructed to maximize the total collected score by the vertices which is visited. Each vertice can be visited only once and the visit can only start during the time window of vertices. This paper proposes a Particle Swarm Optimization algorithm for solving the TOPTW, by defining a specific particle for representing the solution of TOPTW within the PSO algorithm and two alternatives, called PSO_TOPTW1 and PSO_TOPTW2, for translating the particle position to form the routes of the path. The performance of the proposed PSO algorithm is evaluated through some benchmark data problem available in the literature. The computational results show that the proposed PSO is able to produce sufficiently good TOPTW solutions that are comparable with corresponding solutions from other existing methods for solving the TOPTW.
An analytical nodal method for time-dependent one-dimensional discrete ordinates problems
International Nuclear Information System (INIS)
Barros, R.C. de
1992-01-01
In recent years, relatively little work has been done in developing time-dependent discrete ordinates (S N ) computer codes. Therefore, the topic of time integration methods certainly deserves further attention. In this paper, we describe a new coarse-mesh method for time-dependent monoenergetic S N transport problesm in slab geometry. This numerical method preserves the analytic solution of the transverse-integrated S N nodal equations by constants, so we call our method the analytical constant nodal (ACN) method. For time-independent S N problems in finite slab geometry and for time-dependent infinite-medium S N problems, the ACN method generates numerical solutions that are completely free of truncation errors. Bsed on this positive feature, we expect the ACN method to be more accurate than conventional numerical methods for S N transport calculations on coarse space-time grids
A polynomial time algorithm for solving the maximum flow problem in directed networks
International Nuclear Information System (INIS)
Tlas, M.
2015-01-01
An efficient polynomial time algorithm for solving maximum flow problems has been proposed in this paper. The algorithm is basically based on the binary representation of capacities; it solves the maximum flow problem as a sequence of O(m) shortest path problems on residual networks with nodes and m arcs. It runs in O(m"2r) time, where is the smallest integer greater than or equal to log B , and B is the largest arc capacity of the network. A numerical example has been illustrated using this proposed algorithm.(author)
Beyond the sticker price: including and excluding time in comparing food prices.
Yang, Yanliang; Davis, George C; Muth, Mary K
2015-07-01
An ongoing debate in the literature is how to measure the price of food. Most analyses have not considered the value of time in measuring the price of food. Whether or not the value of time is included in measuring the price of a food may have important implications for classifying foods based on their relative cost. The purpose of this article is to compare prices that exclude time (time-exclusive price) with prices that include time (time-inclusive price) for 2 types of home foods: home foods using basic ingredients (home recipes) vs. home foods using more processed ingredients (processed recipes). The time-inclusive and time-exclusive prices are compared to determine whether the time-exclusive prices in isolation may mislead in drawing inferences regarding the relative prices of foods. We calculated the time-exclusive price and time-inclusive price of 100 home recipes and 143 processed recipes and then categorized them into 5 standard food groups: grains, proteins, vegetables, fruit, and dairy. We then examined the relation between the time-exclusive prices and the time-inclusive prices and dietary recommendations. For any food group, the processed food time-inclusive price was always less than the home recipe time-inclusive price, even if the processed food's time-exclusive price was more expensive. Time-inclusive prices for home recipes were especially higher for the more time-intensive food groups, such as grains, vegetables, and fruit, which are generally underconsumed relative to the guidelines. Focusing only on the sticker price of a food and ignoring the time cost may lead to different conclusions about relative prices and policy recommendations than when the time cost is included. © 2015 American Society for Nutrition.
Time-frequency analysis of the restricted three-body problem: transport and resonance transitions
International Nuclear Information System (INIS)
Vela-Arevalo, Luz V; Marsden, Jerrold E
2004-01-01
A method of time-frequency analysis based on wavelets is applied to the problem of transport between different regions of the solar system, using the model of the circular restricted three-body problem in both the planar and the spatial versions of the problem. The method is based on the extraction of instantaneous frequencies from the wavelet transform of numerical solutions. Time-varying frequencies provide a good diagnostic tool to discern chaotic trajectories from regular ones, and we can identify resonance islands that greatly affect the dynamics. Good accuracy in the calculation of time-varying frequencies allows us to determine resonance trappings of chaotic trajectories and resonance transitions. We show the relation between resonance transitions and transport in different regions of the phase space
Screening for Vision Problems, Including Usher's Syndrome, among Hearing Impaired Students.
Fillman, Robyn D.; And Others
1987-01-01
A screening program for vision problems and Usher's Syndrome (a common cause of deaf-blindness) among 210 hearing-impaired students found 44 percent had significant vision problems and 1 percent had Usher's Syndrome. The program involved an interagency network of school, health care, and support personnel and utilized a dilated ophathalmological…
Gunnarsdottir, Hrafnhildur; Bjereld, Ylva; Hensing, Gunnel; Petzold, Max; Povlsen, Lene
2015-04-10
The home, the family and the parents represent a context of everyday life that is important for child health and development, with parent-child relationships highlighted as crucial for children's mental health. Time pressure is an emerging feature of modern societies and previous studies indicates that parents with children living at home experience time pressure to a greater extent than people with no children living at home. Previous studies of children's mental health in relation to parents' time pressure are lacking. Hence, the purpose of this study was to examine the association between parents' subjective time pressure and mental health problems among children in the Nordic countries as well as potential disparities between boys and girls in different age groups. 4592 children, aged 4-16 from Denmark, Finland, Norway and Sweden, participating in the 2011 version of the NordChild study, were included. The Strength and Difficulties Questionnaire was used to measure children's mental health and associations to parents' time pressure were assessed by multiple logistic regression analysis. Among children of parents experiencing time pressure, 18.6% had mental health problems compared to 10.1% among children of parents experiencing time pressure not or sometimes. The odds of mental health problems were higher among both boys (OR 1.80 95% CI 1.32-2.46) and girls (OR 1.95 95% CI 1.42-2.66) if their parents experienced time pressure when adjusted for financial stress. The highest prevalence of mental health problems in the case of parental time pressure was found among girls 13-16 years old (23.6%) and the lowest prevalence was found among boys 13-16 years old (10.7%). In this study an association between parents' subjective time pressure and increased mental health problems among children was found. Given that time pressure is a growing feature of modern societies, the results might contribute to an explanation as to mental health problems are common among children
Directory of Open Access Journals (Sweden)
Mauricio Iwama Takano
2019-01-01
Full Text Available This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are pre-sented and then adapted to the problem in two different ways; resulting in 28 different heuristics. The heuristics are then compared using the Taillard database. As there is no other work that addresses the problem with blocking and sequence and ma-chine dependent setup times, a database for the setup times was created. The setup time value was uniformly distributed between 1% and 10%, 50%, 100% and 125% of the processing time value. Computational tests are then presented for each of the 28 heuristics, comparing the mean relative deviation of the makespan, the computational time and the percentage of successes of each method. Results show that the heuristics were capable of providing interesting results.
Split delivery vehicle routing problem with time windows: a case study
Latiffianti, E.; Siswanto, N.; Firmandani, R. A.
2018-04-01
This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.
Optimal Design and Real Time Implementation of Autonomous Microgrid Including Active Load
Mohamed A. Hassan; Muhammed Y. Worku; Mohamed A. Abido
2018-01-01
Controller gains and power-sharing parameters are the main parameters affect the dynamic performance of the microgrid. Considering an active load to the autonomous microgrid, the stability problem will be more involved. In this paper, the active load effect on microgrid dynamic stability is explored. An autonomous microgrid including three inverter-based distributed generations (DGs) with an active load is modeled and the associated controllers are designed. Controller gains of the inverters ...
Numerical modeling of time domain 3-D problems in accelerator physics
International Nuclear Information System (INIS)
Harfoush, F.A.; Jurgens, T.G.
1990-06-01
Time domain analysis is relevant in particle accelerators to study the electromagnetic field interaction of a moving source particle on a lagging test particle as the particles pass an accelerating cavity or some other structure. These fields are called wake fields. The travelling beam inside a beam pipe may undergo more complicated interactions with its environment due to the presence of other irregularities like wires, thin slots, joints and other types of obstacles. Analytical solutions of such problems is impossible and one has to resort to a numerical method. In this paper we present results of our first attempt to model these problems in 3-D using our finite difference time domain (FDTD) code. 10 refs., 9 figs
Formulations and exact algorithms for the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Kallehauge, Brian
2008-01-01
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...
Time efficient optimization of instance based problems with application to tone onset detection
Bauer, Nadja; Friedrichs, Klaus; Weihs, Claus
2016-01-01
A time efficient optimization technique for instance based problems is proposed, where for each parameter setting the target function has to be evaluated on a large set of problem instances. Computational time is reduced by beginning with a performance estimation based on the evaluation of a representative subset of instances. Subsequently, only promising settings are evaluated on the whole data set. As application a comprehensive music onset detection algorithm is introduce...
Time scales and the problem of radioactive waste
International Nuclear Information System (INIS)
Goble, R.L.
1984-01-01
The author argues that decisions about future nuclear development can be made essentially independent of waste management considerations for the next 20 years. His arguments are based on five propositions: 1 Risks and costs of storing spent fuel or high-level waste and transuranics are lower than other directly comparable risks and costs of operating a reactor. 2 Storage of mill tailings is the most serious long-term waste problem; it is not serious enough to rule out the use of nuclear power. 3 There are compelling reasons for beginning to implement a waste management program now. 4 It is important to separate the problem of providing temporary storage from that of finding permanent repositories. 5 A prudent waste management strategy, by 2000, will have identified and evaluated more than enough repository space for the waste generated by that time, independent of the decision made about nuclear futures. 13 references, 4 figures, 4 tables
Directory of Open Access Journals (Sweden)
Farahmand-Mehr Mohammad
2014-01-01
Full Text Available In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented. Since few works have been implemented in this field, the necessity of finding better solutions is a motivation to extend heuristic or meta-heuristic algorithms. This type of production system is found in industries such as food processing, chemical, textile, metallurgical, printed circuit board, and automobile manufacturing. A mixed integer linear programming (MILP model is proposed to minimize the makespan. Since this problem is known as NP-Hard class, a meta-heuristic algorithm, named Genetic Algorithm (GA, and three heuristic algorithms (Johnson, SPTCH and Palmer are proposed. Numerical experiments of different sizes are implemented to evaluate the performance of presented mathematical programming model and the designed GA in compare to heuristic algorithms and a benchmark algorithm. Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.
Heuristics methods for the flow shop scheduling problem with separated setup times
Directory of Open Access Journals (Sweden)
Marcelo Seido Nagano
2012-06-01
Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.
Space time problems and applications
DEFF Research Database (Denmark)
Dethlefsen, Claus
models, cubic spline models and structural time series models. The development of state space theory has interacted with the development of other statistical disciplines. In the first part of the Thesis, we present the theory of state space models, including Gaussian state space models, approximative...... analysis of non-Gaussian models, simulation based techniques and model diagnostics. The second part of the Thesis considers Markov random field models. These are spatial models applicable in e.g. disease mapping and in agricultural experiments. Recently, the Gaussian Markov random field models were...... techniques with importance sampling. The third part of the Thesis contains applications of the theory. First, a univariate time series of count data is analysed. Then, a spatial model is used to compare wheat yields. Weed count data in connection with a project in precision farming is analysed using...
Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems
DEFF Research Database (Denmark)
Taslaman, Nina Sofia
of algorithms, as well as investigations into how far such improvements can get under reasonable assumptions. The first part is concerned with detection of cycles in graphs, especially parameterized generalizations of Hamiltonian cycles. A remarkably simple Monte Carlo algorithm is presented......NP-hard problems are deemed highly unlikely to be solvable in polynomial time. Still, one can often find algorithms that are substantially faster than brute force solutions. This thesis concerns such algorithms for problems from graph theory; techniques for constructing and improving this type......, and with high probability any found solution is shortest possible. Moreover, the algorithm can be used to find a cycle of given parity through the specified elements. The second part concerns the hardness of problems encoded as evaluations of the Tutte polynomial at some fixed point in the rational plane...
Energy Technology Data Exchange (ETDEWEB)
Young, Steven; Montakhab, Mohammad; Nouri, Hassan
2011-07-15
Economic dispatch (ED) is one of the most important problems to be solved in power generation as fractional percentage fuel reductions represent significant cost savings. ED wishes to optimise the power generated by each generating unit in a system in order to find the minimum operating cost at a required load demand, whilst ensuring both equality and inequality constraints are met. For the process of optimisation, a model must be created for each generating unit. The particle swarm optimisation technique is an evolutionary computation technique with one of the most powerful methods for solving global optimisation problems. The aim of this paper is to add in a constriction factor to the particle swarm optimisation algorithm (CFBPSO). Results show that the algorithm is very good at solving the ED problem and that CFBPSO must be able to work in a practical environment and so a valve point effect with transmission losses should be included in future work.
Youth Screen Time and Behavioral Health Problems: The Role of Sleep Duration and Disturbances.
Parent, Justin; Sanders, Wesley; Forehand, Rex
2016-05-01
The purpose of this study was to examine the indirect effect of youth screen time (e.g., television, computers, smartphones, video games, and tablets) on behavioral health problems (i.e., internalizing, externalizing, and peer problems) through sleep duration and disturbances. The authors assessed a community sample of parents with a child in one of the following three developmental stages: young childhood (3-7 yrs; N = 209), middle childhood (8-12 yrs; N = 202), and adolescence (13-17 yrs; N = 210). Path analysis was used to test the hypothesized indirect effect model. Findings indicated that, regardless of the developmental stage of the youth, higher levels of youth screen time were associated with more sleep disturbances, which, in turn, were linked to higher levels of youth behavioral health problems. Children who have increased screen time are more likely to have poor sleep quality and problem behaviors.
Vehicle routing problem with time windows using natural inspired algorithms
Pratiwi, A. B.; Pratama, A.; Sa’diyah, I.; Suprajitno, H.
2018-03-01
Process of distribution of goods needs a strategy to make the total cost spent for operational activities minimized. But there are several constrains have to be satisfied which are the capacity of the vehicles and the service time of the customers. This Vehicle Routing Problem with Time Windows (VRPTW) gives complex constrains problem. This paper proposes natural inspired algorithms for dealing with constrains of VRPTW which involves Bat Algorithm and Cat Swarm Optimization. Bat Algorithm is being hybrid with Simulated Annealing, the worst solution of Bat Algorithm is replaced by the solution from Simulated Annealing. Algorithm which is based on behavior of cats, Cat Swarm Optimization, is improved using Crow Search Algorithm to make simplier and faster convergence. From the computational result, these algorithms give good performances in finding the minimized total distance. Higher number of population causes better computational performance. The improved Cat Swarm Optimization with Crow Search gives better performance than the hybridization of Bat Algorithm and Simulated Annealing in dealing with big data.
A capacitated vehicle routing problem with order available time in e-commerce industry
Liu, Ling; Li, Kunpeng; Liu, Zhixue
2017-03-01
In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.
The Time Window Vehicle Routing Problem Considering Closed Route
Irsa Syahputri, Nenna; Mawengkang, Herman
2017-12-01
The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model
A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem
Directory of Open Access Journals (Sweden)
Sivashan Chetty
2015-01-01
Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.
Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows
DEFF Research Database (Denmark)
Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn
2012-01-01
This paper deals with the problem of scheduling feeding tasks of a single mobile robot which has capability of supplying parts to feeders on pro-duction lines. The performance criterion is to minimize the total traveling time of the robot and the total tardiness of the feeding tasks being scheduled...
Keller, Peggy S; Gilbert, Lauren R; Haak, Eric A; Bi, Shuang; Smith, Olivia A
2017-04-01
Early school start times may curtail children's sleep and inadvertently promote sleep restriction. The current study examines the potential implications for early school start times for behavioral problems in public elementary schools (student ages 5-12 years) in Kentucky. School start times were obtained from school Web sites or by calling school offices; behavioral and disciplinary problems, along with demographic information about schools, were obtained from the Kentucky Department of Education. Estimated associations controlled for teacher/student ratio, racial composition, school rank, enrollment, and Appalachian location. Associations between early school start time and greater behavioral problems (harassment, in-school removals, suspensions, and expulsions) were observed, although some of these associations were found only for schools serving the non-Appalachian region. Findings support the growing body of research showing that early school start times may contribute to student problems, and extend this research through a large-scale examination of elementary schools, behavioral outcomes, and potential moderators of risk. Copyright © 2017 National Sleep Foundation. Published by Elsevier Inc. All rights reserved.
Problem based learning: the effect of real time data on the website to student independence
Setyowidodo, I.; Pramesti, Y. S.; Handayani, A. D.
2018-05-01
Learning science developed as an integrative science rather than disciplinary education, the reality of the nation character development has not been able to form a more creative and independent Indonesian man. Problem Based Learning based on real time data in the website is a learning method focuses on developing high-level thinking skills in problem-oriented situations by integrating technology in learning. The essence of this study is the presentation of authentic problems in the real time data situation in the website. The purpose of this research is to develop student independence through Problem Based Learning based on real time data in website. The type of this research is development research with implementation using purposive sampling technique. Based on the study there is an increase in student self-reliance, where the students in very high category is 47% and in the high category is 53%. This learning method can be said to be effective in improving students learning independence in problem-oriented situations.
On Lambda and Time Operators: the Inverse Intertwining Problem Revisited
Gómez-Cubillo, F.; Suchanecki, Z.; Villullas, S.
2011-07-01
An exact theory of irreversibility was proposed by Misra, Prigogine and Courbage, based on non-unitary similarity transformations Λ that intertwine reversible dynamics and irreversible ones. This would advocate the idea that irreversible behavior would originate at the microscopic level. Reversible evolution with an internal time operator have the intertwining property. Recently the inverse intertwining problem has been answered in the negative, that is, not every unitary evolution allowing such Λ-transformation has an internal time. This work contributes new results in this direction.
Partial path column generation for the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Petersen, Bjørn; Jepsen, Mads Kehlet
2009-01-01
This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...
Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly
2014-01-01
We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.
Posing the problem of time in S. N. Bulgakov: in the context of nature and freedom antinomy
Directory of Open Access Journals (Sweden)
Tatiana Rezvykh
2015-06-01
Full Text Available The author discusses a S. N. Bulgakov’s unique approach to the problem of time, consisting of an eﬀort to resolve the problem basing on corollaries from Kant’s antinomy of nature and freedom, as well as on ideas of Schelling. Bulgakov views the time antinomically. It was his reﬂection on the meaning of Kant’s antinomism which led him to posing the problem of time. For the ﬁrst time we ﬁnd him treating this problem in his article Apocalypticism and Socialism, which dealt with antinomy of eschatology and chiliasm. Here also he starts to consider relation of time and eternity through antinomy of nature and freedom. In his Philosophy of Economy the same problem is solved by means of the concept of Sophia as the ontological basis of personality, which unites freedom and nature, the eternal and the temporal. But in his Unfading Light the antinomy of nature and freedom is discussed through diﬀerentiation between negative and positive theology. Bulgakov uses as a synthesizing concept Schelling’s idea of «eternal time» as unity of eternity and time. Thus, despite Bulgakov’s repeated statements about their clear distinction, time and eternity are drawn together. Such an attempt to solve the problem of time raises doubts about the very possibility of freedom.
Some philosophical problems with the space-time metric and alternative theories of gravitation
International Nuclear Information System (INIS)
Bergh, N. van den
1983-01-01
Some problems in Synge's chronometric approach and the geodesic method of EHLERS, PIRANI and SCHILD are discussed. We construct a particular type of standard clock which does not suffer from the usual difficulties with atomic clocks and which enables us to analyse the old problem whether atomic time is identical with proper time. We conclude that a non-constant coupling between our Heisenberg units and the geodesic units leads to conflicts with astronomical observations. Therefore the question whether particle masses are varying can only be stated in the Planck unit system. (author)
Tavakkoli-Moghaddam, Reza; Alinaghian, Mehdi; Salamat-Bakhsh, Alireza; Norouzi, Narges
2012-05-01
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.
Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian
2015-08-27
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.
Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window
Directory of Open Access Journals (Sweden)
Johan Oscar Ong
2011-01-01
Full Text Available Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW along with its problem solving techniques by using Ant Colony Optimization (ACO and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.
Time evolution and use of multiple times in the N-body problem
International Nuclear Information System (INIS)
McGuire, J.H.; Godunov, A.L.
2003-01-01
Under certain conditions it is possible to describe time evolution using different times for different particles. Use of multiple times is optional in the independent particle approximation, where interparticle interactions are removed, and the N-particle evolution operator factors into N single-particle evolution operators. In this limit one may use either a single time, with a single energy-time Fourier transform, or N different times with a different energy-time transform for each particle. The use of different times for different particles is fully justified when coherence between single-particle amplitudes is lost, e.g., if relatively strong randomly fluctuating residual fields influence each particle independently. However, when spatial correlation is present the use of multiple times is not feasible, even when the evolution of the particles is uncorrelated in time. Some calculations in simple atomic systems with and without spatial and temporal correlation between different electrons are included
New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid
2017-09-01
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.
International Nuclear Information System (INIS)
Brooks, B.R.
1979-09-01
The Graphical Unitary Group Approach (GUGA) was cast into an extraordinarily powerful form by restructuring the Hamiltonian in terms of loop types. This restructuring allows the adoption of the loop-driven formulation which illuminates vast numbers of previously unappreciated relationships between otherwise distinct Hamiltonian matrix elements. The theoretical/methodological contributions made here include the development of the loop-driven formula generation algorithm, a solution of the upper walk problem used to develop a loop breakdown algorithm, the restriction of configuration space employed to the multireference interacting space, and the restructuring of the Hamiltonian in terms of loop types. Several other developments are presented and discussed. Among these developments are the use of new segment coefficients, improvements in the loop-driven algorithm, implicit generation of loops wholly within the external space adapted within the framework of the loop-driven methodology, and comparisons of the diagonalization tape method to the direct method. It is also shown how it is possible to implement the GUGA method without the time-consuming full (m 5 ) four-index transformation. A particularly promising new direction presented here involves the use of the GUGA methodology to obtain one-electron and two-electron density matrices. Once these are known, analytical gradients (first derivatives) of the CI potential energy are easily obtained. Several test calculations are examined in detail to illustrate the unique features of the method. Also included is a calculation on the asymmetric 2 1 A' state of SO 2 with 23,613 configurations to demonstrate methods for the diagonalization of very large matrices on a minicomputer. 6 figures, 6 tables
Directory of Open Access Journals (Sweden)
Isnani A. Suryono
2001-12-01
Full Text Available The objective of this study is to assess the problems encountered in the management of Medical Journal of Indonesia and whether any progress has been achieved during the past 7 years. A retrospective descriptive study was done in the MJI. Available data used as parameters were: number of articles submitted and author's home institution, number of articles submitted and rejected, cause/criteria of rejection, qualification of reviewers and editors, duration of manuscript processing, and whether pre-scheduled time is met in the Med J Indones. For this purpose, all manuscripts from January 1995- January 2001 were evaluated. In addition, recent problems encountered were noted. Problems encountered were limited supply of manuscript that might be due to language barrier, decrease in circulation due to limited budget, communication problems due to seniority, and increase in average processing time that might be due to restriction in the time allocated for MJI Number of articles submitted by authors originating from national versus foreign institutions in 1995-1997 was 101 versus 16, and in 1998 - 2000 were 124 versus 84. Articles rejected were ±26.4 % (1999-2001 and the most frequent causes of rejection were insignificancy of substance and improper data analysis. As for the qualification of editors there was an increase in the number of PhDs and professors. Average processing time is approximately 1.5 times the scheduled time. It seems that the 4 main problems encountered were (1 Language barrier, (2 Funding, (3 Communication problems and (4 Time management; and though not impressive, there are definitely positive changes in the number of manuscipts submitted, qualification of editors and peer reviewers. Average processing time is about the same, and the prescheduled time of editing is yet to be met. (Med J Indones 2001; 10: 252-8Keywords: language barrier, funding, communication problems, time management
Analysis of multimedian problems on time dependent networks
Salman, F Sibel
1994-01-01
Ankara : The Department of Industrial Engineering and the Institute of Enginering and Science of Bilkent Univ., 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references leaves 81-85. Time dependency arises in transportation and computer-communication networks due to factors such as time varying demand, traffic intensity, and road conditions. This necessitates a locational decision to be based on an analysis involving a time horizon. In this st...
The liner shipping berth scheduling problem with transit times
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Plum, Christian E.M.; Pisinger, David
2016-01-01
In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port...
A review of the decoherent histories approach to the arrival time problem in quantum theory
International Nuclear Information System (INIS)
Yearsley, James M
2011-01-01
We review recent progress in understanding the arrival time problem in quantum mechanics, from the point of view of the decoherent histories approach to quantum theory. We begin by discussing the arrival time problem, focussing in particular on the role of the probability current in the expected classical solution. After a brief introduction to decoherent histories we review the use of complex potentials in the construction of appropriate class operators. We then discuss the arrival time problem for a particle coupled to an environment, and review how the arrival time probability can be expressed in terms of a POVM in this case. We turn finally to the question of decoherence of the corresponding histories, and we show that this can be achieved for simple states in the case of a free particle, and for general states for a particle coupled to an environment.
Wavelet-sparsity based regularization over time in the inverse problem of electrocardiography.
Cluitmans, Matthijs J M; Karel, Joël M H; Bonizzi, Pietro; Volders, Paul G A; Westra, Ronald L; Peeters, Ralf L M
2013-01-01
Noninvasive, detailed assessment of electrical cardiac activity at the level of the heart surface has the potential to revolutionize diagnostics and therapy of cardiac pathologies. Due to the requirement of noninvasiveness, body-surface potentials are measured and have to be projected back to the heart surface, yielding an ill-posed inverse problem. Ill-posedness ensures that there are non-unique solutions to this problem, resulting in a problem of choice. In the current paper, it is proposed to restrict this choice by requiring that the time series of reconstructed heart-surface potentials is sparse in the wavelet domain. A local search technique is introduced that pursues a sparse solution, using an orthogonal wavelet transform. Epicardial potentials reconstructed from this method are compared to those from existing methods, and validated with actual intracardiac recordings. The new technique improves the reconstructions in terms of smoothness and recovers physiologically meaningful details. Additionally, reconstruction of activation timing seems to be improved when pursuing sparsity of the reconstructed signals in the wavelet domain.
Multidepot UAV Routing Problem with Weapon Configuration and Time Window
Directory of Open Access Journals (Sweden)
Tianren Zhou
2018-01-01
Full Text Available In recent wars, there is an increasing trend that unmanned aerial vehicles (UAVs are utilized to conduct military attacking missions. In this paper, we investigate a novel multidepot UAV routing problem with consideration of weapon configuration in the UAV and the attacking time window of the target. A mixed-integer linear programming model is developed to jointly optimize three kinds of decisions: the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets. An adaptive large neighborhood search (ALNS algorithm is proposed for solving the problem, which is tested by randomly generated instances covering the small, medium, and large sizes. Experimental results confirm the effectiveness and robustness of the proposed ALNS algorithm.
Burton, Catherine L; Strauss, Esther; Hultsch, David F; Hunter, Michael A
2009-09-01
The purpose of the present study was to investigate whether inconsistency in reaction time (RT) is predictive of older adults' ability to solve everyday problems. A sample of 304 community dwelling non-demented older adults, ranging in age from 62 to 92, completed a measure of everyday problem solving, the Everyday Problems Test (EPT). Inconsistency in latencies across trials was assessed on four RT tasks. Performance on the EPT was found to vary according to age and cognitive status. Both mean latencies and inconsistency were significantly associated with EPT performance, such that slower and more inconsistent RTs were associated with poorer everyday problem solving abilities. Even after accounting for age, education, and mean level of performance, inconsistency in reaction time continued to account for a significant proportion of the variance in EPT scores. These findings suggest that indicators of inconsistency in RT may be of functional relevance.
Non-linear time series extreme events and integer value problems
Turkman, Kamil Feridun; Zea Bermudez, Patrícia
2014-01-01
This book offers a useful combination of probabilistic and statistical tools for analyzing nonlinear time series. Key features of the book include a study of the extremal behavior of nonlinear time series and a comprehensive list of nonlinear models that address different aspects of nonlinearity. Several inferential methods, including quasi likelihood methods, sequential Markov Chain Monte Carlo Methods and particle filters, are also included so as to provide an overall view of the available tools for parameter estimation for nonlinear models. A chapter on integer time series models based on several thinning operations, which brings together all recent advances made in this area, is also included. Readers should have attended a prior course on linear time series, and a good grasp of simulation-based inferential methods is recommended. This book offers a valuable resource for second-year graduate students and researchers in statistics and other scientific areas who need a basic understanding of nonlinear time ...
The exit-time problem for a Markov jump process
Burch, N.; D'Elia, M.; Lehoucq, R. B.
2014-12-01
The purpose of this paper is to consider the exit-time problem for a finite-range Markov jump process, i.e, the distance the particle can jump is bounded independent of its location. Such jump diffusions are expedient models for anomalous transport exhibiting super-diffusion or nonstandard normal diffusion. We refer to the associated deterministic equation as a volume-constrained nonlocal diffusion equation. The volume constraint is the nonlocal analogue of a boundary condition necessary to demonstrate that the nonlocal diffusion equation is well-posed and is consistent with the jump process. A critical aspect of the analysis is a variational formulation and a recently developed nonlocal vector calculus. This calculus allows us to pose nonlocal backward and forward Kolmogorov equations, the former equation granting the various moments of the exit-time distribution.
Klahr, Ashlea M.; McGue, Matt; Iacono, William G.; Burt, S. Alexandra
2010-01-01
A handful of prior adoption studies have confirmed that the cross-sectional relationship between child conduct problems and parent/child conflict is at least partially shared environmental in origin. However, as the direction of causation between parenting and delinquency remains unclear, this relationship could be better explained by the adolescent's propensity to elicit conflictive parenting, a phenomenon referred to as an evocative gene-environment correlation. The current study thus examined the prospective relationship between conduct problems and parent-child conflict in a sample of adoptive families. Participants included 672 adolescents in 405 adoptive families assessed at two time points roughly 4 years apart. Results indicated that parent-child conflict predicts the development of conduct problems, whereas conduct problems do not predict increases in parent-child conflict. Such findings suggest that evocative gene-environment correlations are highly unlikely as an explanation of prior shared environmental effects during adolescence. Moreover, because the adolescents in this study do not share genes with their adoptive parents, the association between conduct problems and parent-child conflict is indicative of shared environmental mediation in particular. Implications of our findings are discussed. PMID:21038930
Traversa, Fabio L.; Di Ventra, Massimiliano
2017-02-01
We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept of self-organizing logic gates and circuits (SOLCs). These are logic gates and circuits able to accept input signals from any terminal, without distinction between conventional input and output terminals. They can solve boolean problems by self-organizing into their solution. They can be fabricated either with circuit elements with memory (such as memristors) and/or standard MOS technology. Using tools of functional analysis, we prove mathematically the following constraints for the poly-resource resolvability: (i) SOLCs possess a global attractor; (ii) their only equilibrium points are the solutions of the problems to solve; (iii) the system converges exponentially fast to the solutions; (iv) the equilibrium convergence rate scales at most polynomially with input size. We finally provide arguments that periodic orbits and strange attractors cannot coexist with equilibria. As examples, we show how to solve the prime factorization and the search version of the NP-complete subset-sum problem. Since DMMs map integers into integers, they are robust against noise and hence scalable. We finally discuss the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability.
International Nuclear Information System (INIS)
Garon, Ariane
2014-01-01
Since the foundations of quantum physics have been laid, our knowledge of it never ceased to grow and this field of science naturally split into diverse specialized branches. The first part of this thesis focuses on a problem which concerns all branches of quantum physics, which is the visualization of quantum systems. The non-intuitive aspect of quantum physics justifies a shared desire to visualize quantum systems. In the present work, we develop a method to visualize any operators in these systems, including in particular state operators (density matrices), Hamiltonians and propagators. The method, referred to as DROPS (Discrete Representation of spin OPeratorS), is based on a generalization of Wigner representations, presented in this document. The resulting visualization of an operator A is called its DROPS representation or visualization. We demonstrate its intuitive character by illustrating a series of concepts in nuclear magnetic resonance (NMR) spectroscopy for systems consisting of two spin-1/2 particles. The second part of this thesis is concerned with a problem of optimal control which finds applications in the fields of NMR spectroscopy, medical imagery and quantum computing, to cite a few. The problem of creating a propagator in the shortest amount of time is considered, and the results are extended to solve the closely related problem of creating rotations in the smallest amount of time. The approach used here differs from the previous results on the subject by solving the problem using the Pontryagin's maximum principle and by its detailed consideration of singular controls and trajectories.
2014-01-01
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295
Directory of Open Access Journals (Sweden)
Shih-Wei Lin
2014-01-01
Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.
General Relativity without paradigm of space-time covariance, and resolution of the problem of time
Soo, Chopin; Yu, Hoi-Lai
2014-01-01
The framework of a theory of gravity from the quantum to the classical regime is presented. The paradigm shift from full space-time covariance to spatial diffeomorphism invariance, together with clean decomposition of the canonical structure, yield transparent physical dynamics and a resolution of the problem of time. The deep divide between quantum mechanics and conventional canonical formulations of quantum gravity is overcome with a Schrödinger equation for quantum geometrodynamics that describes evolution in intrinsic time. Unitary time development with gauge-invariant temporal ordering is also viable. All Kuchar observables become physical; and classical space-time, with direct correlation between its proper times and intrinsic time intervals, emerges from constructive interference. The framework not only yields a physical Hamiltonian for Einstein's theory, but also prompts natural extensions and improvements towards a well behaved quantum theory of gravity. It is a consistent canonical scheme to discuss Horava-Lifshitz theories with intrinsic time evolution, and of the many possible alternatives that respect 3-covariance (rather than the more restrictive 4-covariance of Einstein's theory), Horava's "detailed balance" form of the Hamiltonian constraint is essentially pinned down by this framework. Issues in quantum gravity that depend on radiative corrections and the rigorous definition and regularization of the Hamiltonian operator are not addressed in this work.
Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration
Directory of Open Access Journals (Sweden)
M. Huang
2013-01-01
Full Text Available The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed. A branch and bound algorithm and a heuristic algorithm are used in the solution, and two special cases are also examined. The computational experiments show that, for the situation with a rate-modifying activity, the proposed branch and bound algorithm can solve situations with 50 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal solution with an error percentage less than 0.053 in a very short time. In situations with multi-rate-modifying activities, the proposed branch and bound algorithm can solve the case with 15 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal with an error percentage less than 0.070 in a very short time. The branch and bound algorithm and the heuristic algorithm are both shown to be efficient and effective.
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.
Ćwik, Michał; Józefczyk, Jerzy
2018-01-01
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.
Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows
DEFF Research Database (Denmark)
Røpke, Stefan; Cordeau, Jean-Francois
2009-01-01
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch......-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities...
Contraception for the first time users: a problem-orientated guide to ...
African Journals Online (AJOL)
Contraception for the first time users: a problem-orientated guide to product selection and safe prescription. W M Kruger, O S Steyn. Abstract. No Abstract South African Family Practice Vol. 49 (8) 2007: pp.44-50. Full Text: EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL ...
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
Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem
Luo, Yabo; Waden, Yongo P.
2017-06-01
Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.
Just-in-time coding of the problem list in a clinical environment.
Warren, J. J.; Collins, J.; Sorrentino, C.; Campbell, J. R.
1998-01-01
Clinically useful problem lists are essential to the CPR. Providing a terminology that is standardized and understood by all clinicians is a major challenge. UNMC has developed a lexicon to support their problem list. Using a just-in-time coding strategy, the lexicon is maintained and extended prospectively in a dynamic clinical environment. The terms in the lexicon are mapped to ICD-9-CM, NANDA, and SNOMED International classification schemes. Currently, the lexicon contains 12,000 terms. This process of development and maintenance of the lexicon is described. PMID:9929226
One-Dimensional Problem of a Conducting Viscous Fluid with One Relaxation Time
Directory of Open Access Journals (Sweden)
Angail A. Samaan
2011-01-01
Full Text Available We introduce a magnetohydrodynamic model of boundary-layer equations for conducting viscous fluids. This model is applied to study the effects of free convection currents with thermal relaxation time on the flow of a viscous conducting fluid. The method of the matrix exponential formulation for these equations is introduced. The resulting formulation together with the Laplace transform technique is applied to a variety problems. The effects of a plane distribution of heat sources on the whole and semispace are studied. Numerical results are given and illustrated graphically for the problem.
Word Problems: A "Meme" for Our Times.
Leamnson, Robert N.
1996-01-01
Discusses a novel approach to word problems that involves linear relationships between variables. Argues that working stepwise through intermediates is the way our minds actually work and therefore this should be used in solving word problems. (JRH)
Directory of Open Access Journals (Sweden)
Sunxin Wang
2014-01-01
Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.
Kaczmarek, Lukasz D; Drążkowski, Dariusz
2014-05-01
Massively multiplayer online role-playing game (MMORPG) escapists are individuals who indulge in the MMORPG environment to avoid real world problems. Though a relationship between escapism and deteriorated well-being has been established, little is known about particular pathways that mediate this relationship. In the current study, we examined this topic by testing an integrative model of MMORPG escapism, which includes game realism beliefs, gaming time, offline social support, and online social support for offline problems. MMORPG players (N=1,056) completed measures of escapist motivation, game realism beliefs, social support, well-being, and reported gaming time. The tested structural equation model had a good fit to the data. We found that individuals with escapist motivation endorsed stronger game realism beliefs and spent more time playing MMORPGs, which, in turn, increased online support but decreased offline social support. Well-being was favorably affected by both online and offline social support, although offline social support had a stronger effect. The higher availability of online social support for offline problems did not compensate for the lower availability of offline support among MMORPG escapists. Understanding the psychological factors related to depletion of social resources in MMORPG players can help optimize MMORPGs as leisure activities.
Workplace bullying, sleep problems and leisure-time physical activity: a prospective cohort study
DEFF Research Database (Denmark)
Hansen, Åse Marie; Gullander, Maria; Hogh, Annie
2015-01-01
and Harassment (WBH) cohort (N=3278) or the Psychosocial Risk Factors for Stress and Mental Disease (PRISME) cohort (N=4455). We measured workplace bullying using one question that was preceded by a definition of bullying. We used the Karolinska sleep questionnaire to assess sleep problems. The number of hours......OBJECTIVES: Workplace bullying is a potent stressor that may increase sleep problems. Since physical fitness improves resilience to stress, it seems plausible that recreational physical activities may moderate the association between bullying and sleep. The study aimed to examine prospectively...... whether (i) bullying increases the risk of sleep problems, and (ii) the association between bullying and sleep problems is moderated by leisure-time physical activity (LTPA). METHODS: The study sample comprised a cohort of public and private sector employees, who were enrolled into the Work Bullying...
International Nuclear Information System (INIS)
Wilson, G.L.; Rydin, R.A.; Orivuori, S.
1988-01-01
Two highly efficient nonlinear time-dependent heat conduction methodologies, the nonlinear time-dependent nodal integral technique (NTDNT) and IVOHEAT are compared using one- and two-dimensional time-dependent benchmark problems. The NTDNT is completely based on newly developed time-dependent nodal integral methods, whereas IVOHEAT is based on finite elements in space and Crank-Nicholson finite differences in time. IVOHEAT contains the geometric flexibility of the finite element approach, whereas the nodal integral method is constrained at present to Cartesian geometry. For test problems where both methods are equally applicable, the nodal integral method is approximately six times more efficient per dimension than IVOHEAT when a comparable overall accuracy is chosen. This translates to a factor of 200 for a three-dimensional problem having relatively homogeneous regions, and to a smaller advantage as the degree of heterogeneity increases
Zeng, Shengda; Migórski, Stanisław
2018-03-01
In this paper a class of elliptic hemivariational inequalities involving the time-fractional order integral operator is investigated. Exploiting the Rothe method and using the surjectivity of multivalued pseudomonotone operators, a result on existence of solution to the problem is established. Then, this abstract result is applied to provide a theorem on the weak solvability of a fractional viscoelastic contact problem. The process is quasistatic and the constitutive relation is modeled with the fractional Kelvin-Voigt law. The friction and contact conditions are described by the Clarke generalized gradient of nonconvex and nonsmooth functionals. The variational formulation of this problem leads to a fractional hemivariational inequality.
Rich Vehicle Routing Problems and Applications
DEFF Research Database (Denmark)
Wen, Min
very short computational time on real-life data involving up to 200 pairs of suppliers and customers. The second problem we consider is a dynamic vehicle routing problem with multiple objectives over a planning horizon that consists of multiple periods. In this problem, customer orders are revealed...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints....... The method is implemented and tested on real-life data involving up to 2000 orders. It is shown that the method is able to provide solutions of good quality within reasonable running time....
Heinkenschloss, Matthias
2005-01-01
We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.
Directory of Open Access Journals (Sweden)
Masoud Rabbani
2018-09-01
Full Text Available This paper presents a new multi-objective model for a vehicle routing problem under a stochastic uncertainty. It considers traffic point as an inflection point to deal with the arrival time of vehicles. It aims to minimize the total transportation cost, traffic pollution, customer dissatisfaction and maximizes the reliability of vehicles. Moreover, resiliency factors are included in the model to increase the flexibility of the system and decrease the possible losses that may impose on the system. Due to the NP-hardness of the presented model, a meta-heuristic algorithm, namely Simulated Annealing (SA is developed. Furthermore, a number of sensitivity analyses are provided to validate the effectiveness of the proposed model. Lastly, the foregoing meta-heuristic is compared with GAMS, in which the computational results demonstrate an acceptable performance of the proposed SA.
Nelson, Jackie A.
2015-01-01
Constructive parent-child conflict interactions that teach children to problem-solve and negotiate can enhance children's social adjustment. This paper identifies constructive and destructive qualities of mother-child conflict and explores whether child temperament moderated associations with changes in externalizing problems over time. One…
Pfortmueller, Carmen Andrea; Schwetlick, Miriam; Mueller, Thomas; Lehmann, Beat; Exadaktylos, Aristomenis Konstantinos
2016-01-01
Forced displacement related to persecution and violent conflict has reached a new peak in recent years. The primary aim of this study is to provide an initial overview of the acute and chronic health care problems of asylum seekers from the Middle East, with special emphasis on asylum seekers from Syria. Our retrospective data analysis comprised adult patients presenting to our emergency department between 01.11.2011 and 30.06.2014 with the official resident status of an "asylum seeker" or "refugee" from the Middle East. In total, 880 patients were included in the study. Of these, 625 (71.0%) were male and 255 (29.0%) female. The median age was 34 (range 16-84). 222 (25.2%) of our patients were from Syria. The most common reason for presentation was surgical (381, 43.3%), followed by medical (321, 36.5%) and psychiatric (137, 15.6%). In patients with surgical presentations, trauma-related problems were most common (n = 196, 50.6%). Within the group of patients with medical presentation, acute infectious diseases were most common (n = 141, 43.9%), followed by neurological problems (n = 70, 21.8%) and gastrointestinal problems (n = 47, 14.6%). There were no differences between Syrian and non-Syrian refugees concerning surgical or medical admissions. The most common chronic disorder of unclear significance was chronic gastrointestinal problems (n = 132, 15%), followed by chronic musculoskeletal problems (n = 108, 12.3%) and chronic headaches (n = 78, 8.9%). Patients from Syria were significantly younger and more often suffered from a post-traumatic stress disorder than patients of other nationalities (pSyria when compared to other nationalities of asylum seekers from the Middle East.
International Nuclear Information System (INIS)
Di Ventra, Massimiliano; Pantelides, Sokrates T.
2000-01-01
The conventional Hellmann-Feynman theorem for the definition of forces on nuclei is not directly applicable to quantum time-dependent and transport problems. We present a rigorous derivation of a general Hellmann-Feynman-like theorem that applies to all quantum mechanical systems and reduces to well-known results for ground-state problems. It provides a rigorous definition of forces in time-dependent and transport problems. Explicit forms of Pulay-like forces are derived and the conditions for them to be zero are identified. A practical scheme for ab initio calculations of current-induced forces is described and the study of the transfer of a Si atom between two electrodes is presented as an example. (c) 2000 The American Physical Society
Workplace bullying, sleep problems and leisure-time physical activity: a prospective cohort study.
Hansen, Åse Marie; Gullander, Maria; Hogh, Annie; Persson, Roger; Kolstad, Henrik A; Willert, Morten Vejs; Bonde, Jens Peter; Kaerlev, Linda; Rugulies, Reiner; Grynderup, Matias Brødsgaard
2016-01-01
Workplace bullying is a potent stressor that may increase sleep problems. Since physical fitness improves resilience to stress, it seems plausible that recreational physical activities may moderate the association between bullying and sleep. The study aimed to examine prospectively whether (i) bullying increases the risk of sleep problems, and (ii) the association between bullying and sleep problems is moderated by leisure-time physical activity (LTPA). The study sample comprised a cohort of public and private sector employees, who were enrolled into the Work Bullying and Harassment (WBH) cohort (N=3278) or the Psychosocial Risk Factors for Stress and Mental Disease (PRISME) cohort (N=4455). We measured workplace bullying using one question that was preceded by a definition of bullying. We used the Karolinska sleep questionnaire to assess sleep problems. The number of hours per week spent on LTPA estimated the degree of physical activity. Workplace bullying at baseline (T1) was associated with awakening problems and lack of restful sleep at follow-up (T2) but not with overall sleep problems and disturbed sleep. T1-LTPA did not moderate the association between T1-workplace bullying and T2-sleep problems. We found support that workplace bullying is related to development of T2-sleep problems, but this association seems not to be modified by LTPA.
Enhancement of a model for Large-scale Airline Network Planning Problems
Kölker, K.; Lopes dos Santos, Bruno F.; Lütjens, K.
2016-01-01
The main focus of this study is to solve the network planning problem based on passenger decision criteria including the preferred departure time and travel time for a real-sized airline network. For this purpose, a model of the integrated network planning problem is formulated including scheduling
RCM vs. traditional maintenance practice: Some problems when RCM is introduced for the first time
International Nuclear Information System (INIS)
Shishkova, I.V.
2000-01-01
The presentation is focused on some problems which arise when RCM is introduced for first time. These problems were identified from EQE-Bulgaria experience when RCM meters were discussed for first time at number of plants and organizations. Mainly the following problem areas are covered: The first group of problems arise from the nature of RCM. The RCM is referred to as a 'new concept', 'new philosophy', 'new maintenance system', etc. On the other hand, RCM has nothing new - it is a structure of established maintenance techniques. It leads to some difficulties to explain what exactly is the 'new' to a managerial body and to a staff of a plant which has its own established maintenance system running for years. This group of problems covers in particular the following points: RCM definition vs. 'Traditional' Maintenance definition; The understanding about the relationship between inherent reliability and the desired performance of an asset; Difficulties to prove the advantages of RCM and the benefits of its implementation in case RCM is not a country-wide practice. The second problem area is the terminology. The RCM concept is developed and described mainly in reference documents written in English. The direct translation into a certain language introduces some misunderstanding especially if there is no established terminology in the corresponding national language. The first major task is to get clear understanding about relationship between RCM terminology and the terms used in the current maintenance practice defined in the national standards. The next problem area is the availability or unavailability of relevant reliability plant specific data. We found that people tend to trust more the 'numerical' (quantitative) results rather than the qualitative ones. So efforts should be spent to explain and even to prove the advantages and disadvantages of both qualitative and quantitative approaches as well as to show clearly the relation between qualitative and
Benchmarking time-dependent neutron problems with Monte Carlo codes
International Nuclear Information System (INIS)
Couet, B.; Loomis, W.A.
1990-01-01
Many nuclear logging tools measure the time dependence of a neutron flux in a geological formation to infer important properties of the formation. The complex geometry of the tool and the borehole within the formation does not permit an exact deterministic modelling of the neutron flux behaviour. While this exact simulation is possible with Monte Carlo methods the computation time does not facilitate quick turnaround of results useful for design and diagnostic purposes. Nonetheless a simple model based on the diffusion-decay equation for the flux of neutrons of a single energy group can be useful in this situation. A combination approach where a Monte Carlo calculation benchmarks a deterministic model in terms of the diffusion constants of the neutrons propagating in the media and their flux depletion rates thus offers the possibility of quick calculation with assurance as to accuracy. We exemplify this approach with the Monte Carlo benchmarking of a logging tool problem, showing standoff and bedding response. (author)
Energy Technology Data Exchange (ETDEWEB)
Boyarinov, V. F.; Kondrushin, A. E.; Fomichenko, P. A. [National Research Centre Kurchatov Institute, Kurchatov Sq. 1, Moscow (Russian Federation)
2013-07-01
Time-dependent equations of the Surface Harmonics Method (SHM) have been derived from the time-dependent neutron transport equation with explicit representation of delayed neutrons for solving the two-dimensional time-dependent problems. These equations have been realized in the SUHAM-TD code. The TWIGL benchmark problem has been used for verification of the SUHAM-TD code. The results of the study showed that computational costs required to achieve necessary accuracy of the solution can be an order of magnitude less than with the use of the conventional finite difference method (FDM). (authors)
Human-machine analytics for closed-loop sense-making in time-dominant cyber defense problems
Henry, Matthew H.
2017-05-01
Many defense problems are time-dominant: attacks progress at speeds that outpace human-centric systems designed for monitoring and response. Despite this shortcoming, these well-honed and ostensibly reliable systems pervade most domains, including cyberspace. The argument that often prevails when considering the automation of defense is that while technological systems are suitable for simple, well-defined tasks, only humans possess sufficiently nuanced understanding of problems to act appropriately under complicated circumstances. While this perspective is founded in verifiable truths, it does not account for a middle ground in which human-managed technological capabilities extend well into the territory of complex reasoning, thereby automating more nuanced sense-making and dramatically increasing the speed at which it can be applied. Snort1 and platforms like it enable humans to build, refine, and deploy sense-making tools for network defense. Shortcomings of these platforms include a reliance on rule-based logic, which confounds analyst knowledge of how bad actors behave with the means by which bad behaviors can be detected, and a lack of feedback-informed automation of sensor deployment. We propose an approach in which human-specified computational models hypothesize bad behaviors independent of indicators and then allocate sensors to estimate and forecast the state of an intrusion. State estimates and forecasts inform the proactive deployment of additional sensors and detection logic, thereby closing the sense-making loop. All the while, humans are on the loop, rather than in it, permitting nuanced management of fast-acting automated measurement, detection, and inference engines. This paper motivates and conceptualizes analytics to facilitate this human-machine partnership.
Lin, Chung-Ying; Oveisi, Sonia; Burri, Andrea; Pakpour, Amir H
2017-03-01
To apply the Theory of Planned Behavior (TPB) and the two additional concepts self-stigma and perceived barriers to the help-seeking behavior for sexual problems in women with epilepsy. In this 18-month follow-up study, TPB elements, including attitude, subjective norm, perceived behavioral control, and behavioral intention along with self-stigma and perceived barriers in seeking help for sexual problems were assessed in n=818 women with epilepsy (94.0% aged ≤40years). The basic TPB model (model 1) and the TPB model additionally including self-stigma and perceived barriers (Model 2) were analyzed using structural equation modeling (SEM). Both SEM models showed satisfactory model fits. According to model, attitude, subjective norms, perceived behavioral control, and intention explained 63.1% of the variance in help-seeking behavior. Variance was slightly higher (64.5%) when including self-stigma and perceived barriers (model 2). In addition, the fit indices of the models were better highlighting the importance of self-stigma and perceived barriers in help-seeking behavior for sexual problems. Theory of Planned Behavior is useful in explaining help-seeking behavior for sexual problems in women with epilepsy. Self-stigma and perceived barriers are additional factors that should be considered in future interventions aiming to adopt TPB to improve help-seeking behavior for sexual problems. Copyright © 2017 Elsevier Inc. All rights reserved.
Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem
Directory of Open Access Journals (Sweden)
Biao Yuan
2017-11-01
Full Text Available The aggravating trend of the aging population, the miniaturization of the family structure, and the increase of families with empty nesters greatly affect the sustainable development of the national economy and social old-age security system of China. The emergence of home health care or home care (HHC/HC service mode provides an alternative for elderly care. How to develop and apply this new mobile service mode is crucial for the government. Therefore, the pertinent optimization problems regarding HHC/HC have constantly attracted the attention of researchers. Unexpected events, such as new requests of customers, cancellations of customers’ services, and changes of customers’ time windows, may occur during the process of executing an a priori visiting plan. These events may sometimes make the original plan non-optimal or even infeasible. To cope with this situation, we introduce disruption management to the real-time home caregiver scheduling and routing problem. The deviation measurements on customers, caregivers, and companies are first defined. A mathematical model that minimizes the weighted sum of deviation measurements is then constructed. Next, a tabu search (TS heuristic is developed to efficiently solve the problem, and a cost recorded mechanism is used to strengthen the performance. Finally, by performing computational experiments on three real-life instances, the effectiveness of the TS heuristic is tested, and the advantages of disruption management are analyzed.
New heuristics for the fleet size and mix vehicle routing problem with time windows
Dullaert, W.; Janssens, Gerrit K.; Sirensen, K.; Vernimmen, Bert
2002-01-01
In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly
Directory of Open Access Journals (Sweden)
Win-Chin Lin
2018-01-01
Full Text Available Two-stage production process and its applications appear in many production environments. Job processing times are usually assumed to be constant throughout the process. In fact, the learning effect accrued from repetitive work experiences, which leads to the reduction of actual job processing times, indeed exists in many production environments. However, the issue of learning effect is rarely addressed in solving a two-stage assembly scheduling problem. Motivated by this observation, the author studies a two-stage three-machine assembly flow shop problem with a learning effect based on sum of the processing times of already processed jobs to minimize the makespan criterion. Because this problem is proved to be NP-hard, a branch-and-bound method embedded with some developed dominance propositions and a lower bound is employed to search for optimal solutions. A cloud theory-based simulated annealing (CSA algorithm and an iterated greedy (IG algorithm with four different local search methods are used to find near-optimal solutions for small and large number of jobs. The performances of adopted algorithms are subsequently compared through computational experiments and nonparametric statistical analyses, including the Kruskal–Wallis test and a multiple comparison procedure.
Using Video to Bridge the Gap Between Problem Behavior and a Delayed Time-out Procedure
Coppage, Sara; Meindl, James N.
2017-01-01
Treatment plans focused on problem behavior often include punishment contingencies to decrease problem behavior. Immediate punishers are typically more effective than delayed punishers, but immediate delivery of a punisher is not always possible. Strategies need to be developed to increase the suppressive effects of delayed punishers. This study demonstrated the effectiveness of a treatment package involving replaying a video recording of problem behavior immediately before delivering a 15 mi...
The Iterative Solution to Discrete-Time H∞ Control Problems for Periodic Systems
Directory of Open Access Journals (Sweden)
Ivan G. Ivanov
2016-03-01
Full Text Available This paper addresses the problem of solving discrete-time H ∞ control problems for periodic systems. The approach for solving such a type of equations is well known in the literature. However, the focus of our research is set on the numerical computation of the stabilizing solution. In particular, two effective methods for practical realization of the known iterative processes are described. Furthermore, a new iterative approach is investigated and applied. On the basis of numerical experiments, we compare the presented methods. A major conclusion is that the new iterative approach is faster than rest of the methods and it uses less RAM memory than other methods.
The multi-depot electric vehicle location routing problem with time windows
Directory of Open Access Journals (Sweden)
Juan Camilo Paz
2018-01-01
Full Text Available In this paper, the Multi-Depot Electric Vehicle Location Routing Problem with Time Windows (MDVLRP is addressed. This problem is an extension of the MDVLRP, where electric vehicles are used instead of internal combustion engine vehicles. The recent development of this model is explained by the advantages of this technology, such as the diminution of carbon dioxide emissions, and the support that they can provide to the design of the logistic and energy-support structure of electric vehicle fleets. There are many models that extend the classical VRP model to take electric vehicles into consideration, but the multi-depot case for location-routing models has not been worked out yet. Moreover, we consider the availability of two energy supply technologies: the “Plug-in” Conventional Charge technology, and Battery Swapping Stations; options in which the recharging time is a function of the amount of energy to charge and a fixed time, respectively. Three models are proposed: one for each of the technologies mentioned above, and another in which both options are taken in consideration. The models were solved for small scale instances using C++ and Cplex 12.5. The results show that the models can be used to design logistic and energy-support structures, and compare the performance of the different options of energy supply, as well as measure the impact of these decisions on the overall distance traveled or other optimization objectives that could be worked on in the future.
Including patients’ perspectives in patient information leaflets: A polyocular approach
DEFF Research Database (Denmark)
Fage-Butler, Antoinette Mary
2013-01-01
Existing research reveals that patients’ perspectives are missing from mandatory patient information leaflets (PILs). At the same time, there is overwhelming consensus that they should be included in this genre, and a corresponding need for potential approaches to tackle this problem. This paper ...
Hopf bifurcation of a free boundary problem modeling tumor growth with two time delays
International Nuclear Information System (INIS)
Xu Shihe
2009-01-01
In this paper, a free boundary problem modeling tumor growth with two discrete delays is studied. The delays respectively represents the time taken for cells to undergo mitosis and the time taken for the cell to modify the rate of cell loss due to apoptosis. We show the influence of time delays on the Hopf bifurcation when one of delays as a bifurcation parameter.
Energy Technology Data Exchange (ETDEWEB)
Cobb, J.W.
1995-02-01
There is an increasing need for more accurate numerical methods for large-scale nonlinear magneto-fluid turbulence calculations. These methods should not only increase the current state of the art in terms of accuracy, but should also continue to optimize other desired properties such as simplicity, minimized computation, minimized memory requirements, and robust stability. This includes the ability to stably solve stiff problems with long time-steps. This work discusses a general methodology for deriving higher-order numerical methods. It also discusses how the selection of various choices can affect the desired properties. The explicit discussion focuses on third-order Runge-Kutta methods, including general solutions and five examples. The study investigates the linear numerical analysis of these methods, including their accuracy, general stability, and stiff stability. Additional appendices discuss linear multistep methods, discuss directions for further work, and exhibit numerical analysis results for some other commonly used lower-order methods.
The Cauchy problem for space-time monopole equations in Sobolev spaces
Huh, Hyungjin; Yim, Jihyun
2018-04-01
We consider the initial value problem of space-time monopole equations in one space dimension with initial data in Sobolev space Hs. Observing null structures of the system, we prove local well-posedness in almost critical space. Unconditional uniqueness and global existence are proved for s ≥ 0. Moreover, we show that the H1 Sobolev norm grows at a rate of at most c exp(ct2).
A Family of Bipartite |Cardinality Matching Problems Solvable in O(n\\^2) Time
DEFF Research Database (Denmark)
Clausen, Jens; Krarup, J.
1995-01-01
For a given, unweighted bipartite graph G with 2n non isolated vertices, we consider the so called bipartite cardinality matching problem (BCMP) for which the time complexity of the fastest exact algorithm available is O(n/sup 5/2/ ). We devise a greedy algorithm which either finds a perfect...... matching in O(n/sup 2/ ) time or identifies cycle of length 4 in the complement G of G...
On the initial condition problem of the time domain PMCHWT surface integral equation
Uysal, Ismail Enes
2017-05-13
Non-physical, linearly increasing and constant current components are induced in marching on-in-time solution of time domain surface integral equations when initial conditions on time derivatives of (unknown) equivalent currents are not enforced properly. This problem can be remedied by solving the time integral of the surface integral for auxiliary currents that are defined to be the time derivatives of the equivalent currents. Then the equivalent currents are obtained by numerically differentiating the auxiliary ones. In this work, this approach is applied to the marching on-in-time solution of the time domain Poggio-Miller-Chan-Harrington-Wu-Tsai surface integral equation enforced on dispersive/plasmonic scatterers. Accuracy of the proposed method is demonstrated by a numerical example.
van Dijk, Rianne; Dekovic, Maja; Bunte, Tessa L; Schoemaker, Kim; Zondervan-Zwijnenburg, Mariëlle; Espy, Kimberly A; Matthys, Walter
2017-01-01
Previous research has shown links between parenting and externalizing behavior problems in young children over time. Associations between inhibitory control, one of the executive functions, and externalizing behavior problems are widely established as well. Yet, the role of inhibitory control in the
Two-relaxation-time lattice Boltzmann method for the anisotropic dispersive Henry problem
Servan-Camas, Borja; Tsai, Frank T.-C.
2010-02-01
This study develops a lattice Boltzmann method (LBM) with a two-relaxation-time collision operator (TRT) to cope with anisotropic heterogeneous hydraulic conductivity and anisotropic velocity-dependent hydrodynamic dispersion in the saltwater intrusion problem. The directional-speed-of-sound technique is further developed to address anisotropic hydraulic conductivity and dispersion tensors. Forcing terms are introduced in the LBM to correct numerical errors that arise during the recovery procedure and to describe the sink/source terms in the flow and transport equations. In order to facilitate the LBM implementation, the forcing terms are combined with the equilibrium distribution functions (EDFs) to create pseudo-EDFs. This study performs linear stability analysis and derives LBM stability domains to solve the anisotropic advection-dispersion equation. The stability domains are used to select the time step at which the lattice Boltzmann method provides stable solutions to the numerical examples. The LBM was implemented for the anisotropic dispersive Henry problem with high ratios of longitudinal to transverse dispersivities, and the results compared well to the solutions in the work of Abarca et al. (2007).
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...
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
DEFF Research Database (Denmark)
Björklund, Andreas; Dell, Holger; Husfeldt, Thore
2015-01-01
problems. We find three applications of our reductions: 1. An exponential-time algorithm: We show how to decide Hamiltonicity in directed n-vertex graphs with running time 1.9999^n provided that the graph has at most 1.0385^n Hamiltonian cycles. We do so by reducing to the algorithm of Björklund...
Learning Problems among Male and Female First Year ...
African Journals Online (AJOL)
There has been the observation that fresh students in their first year in the university encounter some learning problems. Specific problems investigated in this work include those of concentration ability, memory ability, study time management ability, attention problems, ability to join other students in study group work and ...
Part-time and full-time medical specialists, are there differences in allocation of time?
Jong, J.D. de; Heiligers, P.; Groenewegen, P.P.; Hingstman, L.
2006-01-01
BACKGROUND: An increasing number of medical specialists prefer to work part-time. This development can be found worldwide. Problems to be faced in the realization of part-time work in medicine include the division of night and weekend shifts, as well as communication between physicians and
Part-time and full-time medical specialists, are there differences in allocation of time?
Jong, Judith D. de; Heiligers, Phil; Groenewegen, Peter P.; Hingstman, Lammert
2006-01-01
Background: An increasing number of medical specialists prefer to work part-time. This development can be found worldwide. Problems to be faced in the realization of part-time work in medicine include the division of night and weekend shifts, as well as communication between physicians and
The impact of perceived self-efficacy on mental time travel and social problem solving.
Brown, Adam D; Dorfman, Michelle L; Marmar, Charles R; Bryant, Richard A
2012-03-01
Current models of autobiographical memory suggest that self-identity guides autobiographical memory retrieval. Further, the capacity to recall the past and imagine one's self in the future (mental time travel) can influence social problem solving. We examined whether manipulating self-identity, through an induction task in which students were led to believe they possessed high or low self-efficacy, impacted episodic specificity and content of retrieved and imagined events, as well as social problem solving. Compared to individuals in the low self efficacy group, individuals in the high self efficacy group generated past and future events with greater (a) specificity, (b) positive words, and (c) self-efficacious statements, and also performed better on social problem solving indices. A lack of episodic detail for future events predicted poorer performance on social problem solving tasks. Strategies that increase perceived self-efficacy may help individuals to selectively construct a past and future that aids in negotiating social problems. Copyright © 2011 Elsevier Inc. All rights reserved.
First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems
2014-03-01
accuracy, with rapid convergence over each physical time step, typically less than five Newton iter - ations. 1 Contents 1 Introduction 3 2 Hyperbolic...however, we employ the Gauss - Seidel (GS) relaxation, which is also an O(N) method for the discretization arising from hyperbolic advection-diffusion system...advection-diffusion scheme. The linear dependency of the iterations on Table 1: Boundary layer problem ( Convergence criteria: Residuals < 10−8.) log10Re
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.
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
Directory of Open Access Journals (Sweden)
Mohammed Al-Salem
2016-01-01
Full Text Available The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD for a set of jobs when their weights equal 1 (unweighted problem. This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.
Energy Technology Data Exchange (ETDEWEB)
Obradovic, D [Institut za nuklearne nauke ' Boris Kidric' , Vinca, Belgrade (Yugoslavia)
1966-07-01
This paper covers a review of literature and mathematical methods applied for space-time behaviour of nuclear reactors. The review of literature is limited to unresolved problems and trends of actual research in the field of reactor physics. Dat je pregled literature i matematickih metoda koje se koriste prilikom tretiranja prostorno-vremenskog ponasanja nuklearnih reaktora. Pregled literature ogranicen je na jos neresene probleme i pravce u kojima su danas usmerena istrazivanja u ovoj oblasti fizike nuklearnih reaktora (author)
Time Discretization Techniques
Gottlieb, S.; Ketcheson, David I.
2016-01-01
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
Shahriari, Mohammadreza
2016-06-01
The time-cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate extra resources to short the finishing time of project and the project managers are intended to spend the lowest possible amount of money and achieve the maximum crashing time, as a result, both direct and indirect costs will be influenced in the project, and here, we are facing into the time value of money. It means that when we crash the starting activities in a project, the extra investment will be tied in until the end date of the project; however, when we crash the final activities, the extra investment will be tied in for a much shorter period. This study is presenting a two-objective mathematical model for balancing compressing the project time with activities delay to prepare a suitable tool for decision makers caught in available facilities and due to the time of projects. Also drawing the scheduling problem to real world conditions by considering nonlinear objective function and the time value of money are considered. The presented problem was solved using NSGA-II, and the effect of time compressing reports on the non-dominant set.
EISPACK-J: subprogram package for solving eigenvalue problems
International Nuclear Information System (INIS)
Fujimura, Toichiro; Tsutsui, Tsuneo
1979-05-01
EISPACK-J, a subprogram package for solving eigenvalue problems, has been developed and subprograms with a variety of functions have been prepared. These subprograms can solve standard problems of complex matrices, general problems of real matrices and special problems in which only the required eigenvalues and eigenvectors are calculated. They are compared to existing subprograms, showing their features through benchmark tests. Many test problems, including realistic scale problems, are provided for the benchmark tests. Discussions are made on computer core storage and computing time required for each subprogram, and accuracy of the solution. The results show that the subprograms of EISPACK-J, based on Householder, QR and inverse iteration methods, are the best in computing time and accuracy. (author)
Refinements of the column generation process for the Vehicle Routing Problem with Time Windows
DEFF Research Database (Denmark)
Larsen, Jesper
2004-01-01
interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch......-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for using run-time refinements when speeding up an exact approach without compromising...
An optimal control approach to manpower planning problem
Directory of Open Access Journals (Sweden)
H. W. J. Lee
2001-01-01
Full Text Available A manpower planning problem is studied in this paper. The model includes scheduling different types of workers over different tasks, employing and terminating different types of workers, and assigning different types of workers to various trainning programmes. The aim is to find an optimal way to do all these while keeping the time-varying demand for minimum number of workers working on each different tasks satisfied. The problem is posed as an optimal discrete-valued control problem in discrete time. A novel numerical scheme is proposed to solve the problem, and an illustrative example is provided.
Department of Defense Precise Time and Time Interval program improvement plan
Bowser, J. R.
1981-01-01
The United States Naval Observatory is responsible for ensuring uniformity in precise time and time interval operations including measurements, the establishment of overall DOD requirements for time and time interval, and the accomplishment of objectives requiring precise time and time interval with minimum cost. An overview of the objectives, the approach to the problem, the schedule, and a status report, including significant findings relative to organizational relationships, current directives, principal PTTI users, and future requirements as currently identified by the users are presented.
Taylor Series Trajectory Calculations Including Oblateness Effects and Variable Atmospheric Density
Scott, James R.
2011-01-01
Taylor series integration is implemented in NASA Glenn's Spacecraft N-body Analysis Program, and compared head-to-head with the code's existing 8th- order Runge-Kutta Fehlberg time integration scheme. This paper focuses on trajectory problems that include oblateness and/or variable atmospheric density. Taylor series is shown to be significantly faster and more accurate for oblateness problems up through a 4x4 field, with speedups ranging from a factor of 2 to 13. For problems with variable atmospheric density, speedups average 24 for atmospheric density alone, and average 1.6 to 8.2 when density and oblateness are combined.
Part-Time Employment and Problem Behaviors: Evidence From Adolescents in South Korea.
Lee, Moosung; Oi-Yeung Lam, Beatrice; Ju, Eunsu; Dean, Jenny
2017-03-01
This study explores the impact of adolescent part-time work experience on problem behaviors in the South Korean context. To achieve this, propensity score matching (PSM) analyses were employed based on data from the Korean Education Employment Panel (KEEP). Results indicate that adolescents' part-time employment during their secondary school years had significantly undesirable effects on drinking and smoking, even after preexisting differences between the two groups (i.e., those adolescents who participated in part-time work and those who did not) were controlled by PSM. However, an insignificant difference was detected in the likelihood of running away from home. Implications of the results are discussed in terms of changes in the meanings of adolescence and of participating in part-time work in South Korea. © 2016 The Authors. Journal of Research on Adolescence © 2016 Society for Research on Adolescence.
Directory of Open Access Journals (Sweden)
AREF MALEKI-DARONKOLAEI
2013-10-01
Full Text Available This article considers a three-stage assembly flowshop scheduling problem minimizing the weighted sum of mean completion time and makespan with sequence-dependent setup times at the first stage and blocking times between each stage. To tackle such an NP-hard, two meta-heuristic algorithms are presented. The novelty of our approach is to develop a variable neighborhood search algorithm (VNS and a well-known simulated annealing (SA for the problem. Furthermore, to enhance the performance of the (SA, its parameters are optimized by the use of Taguchi method, but to setting parameters of VNS just one parameter has been used without Taguchi. The computational results show that the proposed VNS is better in mean and standard deviation for all sizes of the problem than SA, but on the contrary about CPU Time SA outperforms VNS.
Testing Under Fire: Chicago's Problem.
Byrd, Manford, Jr.
The history and development of city-wide testing programs in Chicago since 1936 are reviewed and placed in context with the impact on testing of Sputnik and the passage of the National Defense Education Act of 1958. Current testing problems include the time lag between events and curricular changes and new test construction, the time lag between…
Resolución del Response Time Variability Problem mediante tabu search
Corominas Subias, Albert; García Villoria, Alberto; Pastor Moreno, Rafael
2009-01-01
El Response Time Variability Problem (RTVP) es un problema combinatorio de scheduling publicado recientemente en la literatura. Dicho problema de optimización combinatoria es muy fácil de formular pero muy difícil de resolver de forma exacta (es NP-hard). El RTVP se presenta cuando productos, clientes o tareas se han de secuenciar minimizando la variabilidad entre los instantes de tiempo en los que reciben los recursos que ellos necesitan. Este problema tiene una gran cantidad de aplicaciones...
Cook, Steven; Turner, Nigel E; Ballon, Bruce; Paglia-Boak, Angela; Murray, Robert; Adlaf, Edward M; Ilie, Gabriela; den Dunnen, Wendy; Mann, Robert E
2015-12-01
This paper describes gambling problems among Ontario students in 2009 and examines the relationship between gambling problems and substance use problems, mental health problem indicators, and delinquent behaviors. Data were derived from the Ontario Student Drug Use and Health Survey of Ontario students in grades 7-12. Gambling problems were measured as 2 or more of 6 indicators of problem gambling. In total 2.8% of the students surveyed endorsed two or more of the problem gambling items. The odds of problem gamblers reporting mental distress was 4.2 times higher than the rest of the sample and the odds of problem gamblers reporting a suicide attempt were 17.8 times greater than the rest of the sample. In addition compared to the rest of the students, delinquent behaviors were also more common among problem gamblers, including theft (OR = 14.5), selling marijuana (OR = 19.6), gang fights (OR = 11.3) and carrying a handgun (OR = 11.2). In a multivariate analysis, substance-use problems, mental health problems, and the participation in a variety of delinquent behaviors remained significantly associated with youth problem gambling behavior. Students who report problem gambling behaviors show increased substance abuse, mental health, and delinquency/criminal problems that are similar to those seen among adult problem gamblers. The association between these problems suggests that these problems could be addressed in a unified manner.
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies
Directory of Open Access Journals (Sweden)
K. Naboureh
2016-09-01
Full Text Available In most industrial environments, it is usually considered that machines are accessible throughout the planning horizon, but in real situation, machines may be unavailable due to a scheduled preventive maintenance where the periods of unavailability are known in advance. The main idea of this paper is to consider different preventive maintenance policies on machines regarding open shop scheduling problem (OSSP with sequence dependent setup times (SDST using immune algorithm. The preventive maintenance (PM policies are planned for maximizing availability of machines or keeping minimum level of reliability through the production horizon. The objective function of the paper is to minimize makespan. In total, the proposed algorithm extensively is compared with six adaptations of existing heuristic and meta-heuristic methods for the problem through data sets from benchmarks based on Taillard’s instances with some adjustments. The results show that the proposed algorithm outperforms other algorithms for this problem.
Boundary value problems in time for wave equations on RN
Directory of Open Access Journals (Sweden)
M. W. Smiley
1990-01-01
Full Text Available Let Lλ denote the linear operator associated with the radially symmetric form of the wave operator ∂t2−Δ+λ together with the side conditions of decay to zero as r=‖x‖→+∞ and T-periodicity in time. Thus Lλω=ωtt−(ωrr+N−1rωr+λω, when there are N space variables. For δ,R,T>0 let DT,R=(0,T×(R,+∞ and Lδ2(D denote the weighted L2 space with weight function exp(δr. It is shown that Lλ is a Fredholm operator from dom(Lλ⊂L2(D onto Lδ2(D with non-negative index depending on λ. If [2πj/T]2<λ≤[2π(j+1/T]2 then the index is 2j+1. In addition it is shown that Lλ has a bounded partial inverse Kλ:Lδ2(D→Hδ1(D⋂Lδ∞(D, with all spaces weighted by the function exp(δr. This provides a key ingredient for the analysis of nonlinear problems via the method of alternative problems.
Finite-Time and Fixed-Time Cluster Synchronization With or Without Pinning Control.
Liu, Xiwei; Chen, Tianping
2018-01-01
In this paper, the finite-time and fixed-time cluster synchronization problem for complex networks with or without pinning control are discussed. Finite-time (or fixed-time) synchronization has been a hot topic in recent years, which means that the network can achieve synchronization in finite-time, and the settling time depends on the initial values for finite-time synchronization (or the settling time is bounded by a constant for any initial values for fixed-time synchronization). To realize the finite-time and fixed-time cluster synchronization, some simple distributed protocols with or without pinning control are designed and the effectiveness is rigorously proved. Several sufficient criteria are also obtained to clarify the effects of coupling terms for finite-time and fixed-time cluster synchronization. Especially, when the cluster number is one, the cluster synchronization becomes the complete synchronization problem; when the network has only one node, the coupling term between nodes will disappear, and the synchronization problem becomes the simplest master-slave case, which also includes the stability problem for nonlinear systems like neural networks. All these cases are also discussed. Finally, numerical simulations are presented to demonstrate the correctness of obtained theoretical results.
Li, Zhiyuan; Yamamoto, Masahiro
2014-01-01
This article proves the uniqueness for two kinds of inverse problems of identifying fractional orders in diffusion equations with multiple time-fractional derivatives by pointwise observation. By means of eigenfunction expansion and Laplace transform, we reduce the uniqueness for our inverse problems to the uniqueness of expansions of some special function and complete the proof.
International Nuclear Information System (INIS)
Zeng, Huihui
2015-01-01
In this paper we establish the global existence of smooth solutions to vacuum free boundary problems of the one-dimensional compressible isentropic Navier–Stokes equations for which the smoothness extends all the way to the boundaries. The results obtained in this work include the physical vacuum for which the sound speed is C 1/2 -Hölder continuous near the vacuum boundaries when 1 < γ < 3. The novelty of this result is its global-in-time regularity which is in contrast to the previous main results of global weak solutions in the literature. Moreover, in previous studies of the one-dimensional free boundary problems of compressible Navier–Stokes equations, the Lagrangian mass coordinates method has often been used, but in the present work the particle path (flow trajectory) method is adopted, which has the advantage that the particle paths and, in particular, the free boundaries can be traced. (paper)
Schilde, M; Doerner, K F; Hartl, R F
2014-10-01
In urban areas, logistic transportation operations often run into problems because travel speeds change, depending on the current traffic situation. If not accounted for, time-dependent and stochastic travel speeds frequently lead to missed time windows and thus poorer service. Especially in the case of passenger transportation, it often leads to excessive passenger ride times as well. Therefore, time-dependent and stochastic influences on travel speeds are relevant for finding feasible and reliable solutions. This study considers the effect of exploiting statistical information available about historical accidents, using stochastic solution approaches for the dynamic dial-a-ride problem (dynamic DARP). The authors propose two pairs of metaheuristic solution approaches, each consisting of a deterministic method (average time-dependent travel speeds for planning) and its corresponding stochastic version (exploiting stochastic information while planning). The results, using test instances with up to 762 requests based on a real-world road network, show that in certain conditions, exploiting stochastic information about travel speeds leads to significant improvements over deterministic approaches.
Andersson, P. B. U.; Kropp, W.
2008-11-01
Rolling resistance, traction, wear, excitation of vibrations, and noise generation are all attributes to consider in optimisation of the interaction between automotive tyres and wearing courses of roads. The key to understand and describe the interaction is to include a wide range of length scales in the description of the contact geometry. This means including scales on the order of micrometres that have been neglected in previous tyre/road interaction models. A time domain contact model for the tyre/road interaction that includes interfacial details is presented. The contact geometry is discretised into multiple elements forming pairs of matching points. The dynamic response of the tyre is calculated by convolving the contact forces with pre-calculated Green's functions. The smaller-length scales are included by using constitutive interfacial relations, i.e. by using nonlinear contact springs, for each pair of contact elements. The method is presented for normal (out-of-plane) contact and a method for assessing the stiffness of the nonlinear springs based on detailed geometry and elastic data of the tread is suggested. The governing equations of the nonlinear contact problem are solved with the Newton-Raphson iterative scheme. Relations between force, indentation, and contact stiffness are calculated for a single tread block in contact with a road surface. The calculated results have the same character as results from measurements found in literature. Comparison to traditional contact formulations shows that the effect of the small-scale roughness is large; the contact stiffness is only up to half of the stiffness that would result if contact is made over the whole element directly to the bulk of the tread. It is concluded that the suggested contact formulation is a suitable model to include more details of the contact interface. Further, the presented result for the tread block in contact with the road is a suitable input for a global tyre/road interaction model
Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows
Sala Reixach, Joan
2012-01-01
El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".
Divergence identities in curved space-time. A resolution of the stress-energy problem
International Nuclear Information System (INIS)
Yilmaz, H.; Tufts Univ., Medford, MA
1989-01-01
It is noted that the joint use of two basic differential identities in curved space-time, namely. 1) the Einstein-Hilbert identity (1915), and 2) the identity of P. Freud (1939), permits a viable alternative to general relativity and a resolution of the field stress-energy' problem of the gravitational theory. (orig.)
Directory of Open Access Journals (Sweden)
Carmen Andrea Pfortmueller
Full Text Available Forced displacement related to persecution and violent conflict has reached a new peak in recent years. The primary aim of this study is to provide an initial overview of the acute and chronic health care problems of asylum seekers from the Middle East, with special emphasis on asylum seekers from Syria.Our retrospective data analysis comprised adult patients presenting to our emergency department between 01.11.2011 and 30.06.2014 with the official resident status of an "asylum seeker" or "refugee" from the Middle East.In total, 880 patients were included in the study. Of these, 625 (71.0% were male and 255 (29.0% female. The median age was 34 (range 16-84. 222 (25.2% of our patients were from Syria. The most common reason for presentation was surgical (381, 43.3%, followed by medical (321, 36.5% and psychiatric (137, 15.6%. In patients with surgical presentations, trauma-related problems were most common (n = 196, 50.6%. Within the group of patients with medical presentation, acute infectious diseases were most common (n = 141, 43.9%, followed by neurological problems (n = 70, 21.8% and gastrointestinal problems (n = 47, 14.6%. There were no differences between Syrian and non-Syrian refugees concerning surgical or medical admissions. The most common chronic disorder of unclear significance was chronic gastrointestinal problems (n = 132, 15%, followed by chronic musculoskeletal problems (n = 108, 12.3% and chronic headaches (n = 78, 8.9%. Patients from Syria were significantly younger and more often suffered from a post-traumatic stress disorder than patients of other nationalities (p<0.0001, and p = 0.05, respectively.Overall a remarkable number of our very young group of patients suffered from psychiatric disorders and unspecified somatic symptoms. Asylum seekers should be carefully evaluated when presenting to a medical facility and physicians should be aware of the high incidence of unspecified somatic symptoms in this patient population
Directory of Open Access Journals (Sweden)
Bisheng He
2014-01-01
Full Text Available A time-space network based optimization method is designed for high-speed rail train timetabling problem to improve the service level of the high-speed rail. The general time-space path cost is presented which considers both the train travel time and the high-speed rail operation requirements: (1 service frequency requirement; (2 stopping plan adjustment; and (3 priority of train types. Train timetabling problem based on time-space path aims to minimize the total general time-space path cost of all trains. An improved branch-and-price algorithm is applied to solve the large scale integer programming problem. When dealing with the algorithm, a rapid branching and node selection for branch-and-price tree and a heuristic train time-space path generation for column generation are adopted to speed up the algorithm computation time. The computational results of a set of experiments on China’s high-speed rail system are presented with the discussions about the model validation, the effectiveness of the general time-space path cost, and the improved branch-and-price algorithm.
Directory of Open Access Journals (Sweden)
Mohammad Kazemi
2012-04-01
Full Text Available This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT approach. It incorporates Earliness/Tardiness (E/T penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP. Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately–designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.
Slowed ageing, welfare, and population problems.
Wareham, Christopher
2015-10-01
Biological studies have demonstrated that it is possible to slow the ageing process and extend lifespan in a wide variety of organisms, perhaps including humans. Making use of the findings of these studies, this article examines two problems concerning the effect of life extension on population size and welfare. The first--the problem of overpopulation--is that as a result of life extension too many people will co-exist at the same time, resulting in decreases in average welfare. The second--the problem of underpopulation--is that life extension will result in too few people existing across time, resulting in decreases in total welfare. I argue that overpopulation is highly unlikely to result from technologies that slow ageing. Moreover, I claim that the problem of underpopulation relies on claims about life extension that are false in the case of life extension by slowed ageing. The upshot of these arguments is that the population problems discussed provide scant reason to oppose life extension by slowed ageing.
Computational problems in engineering
Mladenov, Valeri
2014-01-01
This book provides readers with modern computational techniques for solving variety of problems from electrical, mechanical, civil and chemical engineering. Mathematical methods are presented in a unified manner, so they can be applied consistently to problems in applied electromagnetics, strength of materials, fluid mechanics, heat and mass transfer, environmental engineering, biomedical engineering, signal processing, automatic control and more. • Features contributions from distinguished researchers on significant aspects of current numerical methods and computational mathematics; • Presents actual results and innovative methods that provide numerical solutions, while minimizing computing times; • Includes new and advanced methods and modern variations of known techniques that can solve difficult scientific problems efficiently.
Some unsolved problems in discrete mathematics and mathematical cybernetics
Korshunov, Aleksei D.
2009-10-01
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Some unsolved problems in discrete mathematics and mathematical cybernetics
International Nuclear Information System (INIS)
Korshunov, Aleksei D
2009-01-01
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Free terminal time optimal control problem of an HIV model based on a conjugate gradient method.
Jang, Taesoo; Kwon, Hee-Dae; Lee, Jeehyun
2011-10-01
The minimum duration of treatment periods and the optimal multidrug therapy for human immunodeficiency virus (HIV) type 1 infection are considered. We formulate an optimal tracking problem, attempting to drive the states of the model to a "healthy" steady state in which the viral load is low and the immune response is strong. We study an optimal time frame as well as HIV therapeutic strategies by analyzing the free terminal time optimal tracking control problem. The minimum duration of treatment periods and the optimal multidrug therapy are found by solving the corresponding optimality systems with the additional transversality condition for the terminal time. We demonstrate by numerical simulations that the optimal dynamic multidrug therapy can lead to the long-term control of HIV by the strong immune response after discontinuation of therapy.
Liu, Ping; Li, Guodong; Liu, Xinggao; Xiao, Long; Wang, Yalin; Yang, Chunhua; Gui, Weihua
2018-02-01
High quality control method is essential for the implementation of aircraft autopilot system. An optimal control problem model considering the safe aerodynamic envelop is therefore established to improve the control quality of aircraft flight level tracking. A novel non-uniform control vector parameterization (CVP) method with time grid refinement is then proposed for solving the optimal control problem. By introducing the Hilbert-Huang transform (HHT) analysis, an efficient time grid refinement approach is presented and an adaptive time grid is automatically obtained. With this refinement, the proposed method needs fewer optimization parameters to achieve better control quality when compared with uniform refinement CVP method, whereas the computational cost is lower. Two well-known flight level altitude tracking problems and one minimum time cost problem are tested as illustrations and the uniform refinement control vector parameterization method is adopted as the comparative base. Numerical results show that the proposed method achieves better performances in terms of optimization accuracy and computation cost; meanwhile, the control quality is efficiently improved. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Cocco, M.
2001-12-01
Earthquake stress changes can promote failures on favorably oriented faults and modify the seismicity pattern over broad regions around the causative faults. Because the induced stress perturbations modify the rate of production of earthquakes, they alter the probability of seismic events in a specified time window. Comparing the Coulomb stress changes with the seismicity rate changes and aftershock patterns can statistically test the role of stress transfer in earthquake occurrence. The interaction probability may represent a further tool to test the stress trigger or shadow model. The probability model, which incorporate stress transfer, has the main advantage to include the contributions of the induced stress perturbation (a static step in its present formulation), the loading rate and the fault constitutive properties. Because the mechanical conditions of the secondary faults at the time of application of the induced load are largely unkown, stress triggering can only be tested on fault populations and not on single earthquake pairs with a specified time delay. The interaction probability can represent the most suitable tool to test the interaction between large magnitude earthquakes. Despite these important implications and the stimulating perspectives, there exist problems in understanding earthquake interaction that should motivate future research but at the same time limit its immediate social applications. One major limitation is that we are unable to predict how and if the induced stress perturbations modify the ratio between small versus large magnitude earthquakes. In other words, we cannot distinguish between a change in this ratio in favor of small events or of large magnitude earthquakes, because the interaction probability is independent of magnitude. Another problem concerns the reconstruction of the stressing history. The interaction probability model is based on the response to a static step; however, we know that other processes contribute to
Turnpike theory of continuous-time linear optimal control problems
Zaslavski, Alexander J
2015-01-01
Individual turnpike results are of great interest due to their numerous applications in engineering and in economic theory; in this book the study is focused on new results of turnpike phenomenon in linear optimal control problems. The book is intended for engineers as well as for mathematicians interested in the calculus of variations, optimal control, and in applied functional analysis. Two large classes of problems are studied in more depth. The first class studied in Chapter 2 consists of linear control problems with periodic nonsmooth convex integrands. Chapters 3-5 consist of linear control problems with autonomous nonconvex and nonsmooth integrands. Chapter 6 discusses a turnpike property for dynamic zero-sum games with linear constraints. Chapter 7 examines genericity results. In Chapter 8, the description of structure of variational problems with extended-valued integrands is obtained. Chapter 9 ends the exposition with a study of turnpike phenomenon for dynamic games with extended value integran...
Understanding Time and Problem Solving Experience: A Case Study of the Invisible Police
Directory of Open Access Journals (Sweden)
Amir Khorasani
Full Text Available In this paper we will explore the relation between the actors’ understanding of time and the problem solving strategies in a complicated situation. Drawing on ethnography and conversation analysis we will focus on the institutional interaction order governing the scenes these movies exhibit. Using phenomenology and Ernest Pople indices, we aim to analyze the understanding made of the time in these conversations. In doing so we will consider the moment in which the violators rationalize the reasons behind their violations. The results show that while the time that law, the police and even the road technologies rely on is homogeneous and linear, the drivers employ the expressions connotating an iterative understanding of time. The paper concludes with showing how the law breaking drivers base their conversations on a nonlinear time to manage the difficult situations they are involved with. This suggests that far from a universal category, time is a category constantly taking different shapes in different everyday encounters.
International Nuclear Information System (INIS)
Mak, C. H.
2009-01-01
A practical method to tackle the sign problem in real-time path integral simulations is proposed based on the multilevel blocking idea. The formulation is made possible by using a cumulant expansion of the action, which in addition to addressing the sign problem, provides an unbiased estimator for the action from a statistically noisy sample of real-time paths. The cumulant formulation also allows the analytical gradients of the action to be computed with little extra computational effort, and it can easily be implemented in a massively parallel environment.
International Nuclear Information System (INIS)
Yun, Sung Hwan
2004-02-01
Radiative transfer is a complex phenomenon in which radiation field interacts with material. This thermal radiative transfer phenomenon is composed of two equations which are the balance equation of photons and the material energy balance equation. The two equations involve non-linearity due to the temperature and that makes the radiative transfer equation more difficult to solve. During the last several years, there have been many efforts to solve the non-linear radiative transfer problems by Monte Carlo method. Among them, it is known that Semi-Analog Monte Carlo (SMC) method developed by Ahrens and Larsen is accurate regard-less of the time step size in low temperature region. But their works are limited to one-dimensional, low temperature problems. In this thesis, we suggest some method to remove their limitations in the SMC method and apply to the more realistic problems. An initially cold problem was solved over entire temperature region by using piecewise linear interpolation of the heat capacity, while heat capacity is still fitted as a cubic curve within the lowest temperature region. If we assume the heat capacity to be linear in each temperature region, the non-linearity still remains in the radiative transfer equations. We then introduce the first-order Taylor expansion to linearize the non-linear radiative transfer equations. During the linearization procedure, absorption-reemission phenomena may be described by a conventional reemission time sampling scheme which is similar to the repetitive sampling scheme in particle transport Monte Carlo method. But this scheme causes significant stochastic errors, which necessitates many histories. Thus, we present a new reemission time sampling scheme which reduces stochastic errors by storing the information of absorption times. The results of the comparison of the two schemes show that the new scheme has less stochastic errors. Therefore, the improved SMC method is able to solve more realistic problems with
Directory of Open Access Journals (Sweden)
Suphan Sodsoon
2014-06-01
Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.
Problem solving of student with visual impairment related to mathematical literacy problem
Pratama, A. R.; Saputro, D. R. S.; Riyadi
2018-04-01
The student with visual impairment, total blind category depends on the sense of touch and hearing in obtaining information. In fact, the two senses can receive information less than 20%. Thus, students with visual impairment of the total blind categories in the learning process must have difficulty, including learning mathematics. This study aims to describe the problem-solving process of the student with visual impairment, total blind category on mathematical literacy issues based on Polya phase. This research using test method similar problems mathematical literacy in PISA and in-depth interviews. The subject of this study was a student with visual impairment, total blind category. Based on the result of the research, problem-solving related to mathematical literacy based on Polya phase is quite good. In the phase of understanding the problem, the student read about twice by brushing the text and assisted with information through hearing three times. The student with visual impairment in problem-solving based on the Polya phase, devising a plan by summoning knowledge and experience gained previously. At the phase of carrying out the plan, students with visual impairment implement the plan in accordance with pre-made. In the looking back phase, students with visual impairment need to check the answers three times but have not been able to find a way.
International Nuclear Information System (INIS)
Oliveira, J.V.P. de; Cardona, A.V.; Vilhena, M.T.M.B. de
2002-01-01
In this work, we present a new approach to solve the one-dimensional time-dependent discrete ordinates problem (S N problem) in a slab. The main idea is based upon the application of the spectral method to the set of S N time-dependent differential equations and solution of the resulting coupling equations by the LTS N method. We report numerical simulations
National Research Council Canada - National Science Library
Balch, James F; Stengler, Mark; Young-Balch, Robin
2011-01-01
.... You'll find easy-to-understand discussions of the symptoms and root causes of each health problem along with a proven, natural, customized prescription that may include supplements, herbal medicine...
Some unsolved problems in discrete mathematics and mathematical cybernetics
Energy Technology Data Exchange (ETDEWEB)
Korshunov, Aleksei D [S.L. Sobolev Institute for Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2009-10-31
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Vuoristo-Myllys, Salla; Lahti, Jari; Alho, Hannu; Julkunen, Juhani
2013-11-01
This study investigated predictors of dropout in an outpatient treatment program for problem drinking that included individual cognitive-behavioral therapy combined with naltrexone. Specifically, we investigated whether sociodemographic factors, severity of alcohol dependence, history of problem drinking, or intensity of alcohol craving assessed at the beginning of the treatment predicted dropout from an outpatient program among a sample of 372 patients (65% male). We also investigated whether the effectiveness of the treatment (the change in alcohol consumption and symptoms of alcohol craving) or adherence to naltrexone was related to dropout. Predictors of dropout were investigated using an analysis of covariance with the number of attended treatment sessions as an independent variable. Our results demonstrated that the treatment entry factors predictive of dropout were younger age, lower severity of alcohol dependence, better ability to resist and control alcohol use, and lower obsession with alcohol. In addition, those who dropped out were more likely to begin the program by abstaining from alcohol and had lower adherence to naltrexone use than those who completed the program. The length of stay for treatment was not related to change in alcohol consumption. Patients with less severe alcohol-related problems may lack motivation for treatment, specifically cognitive-behavioral therapy and naltrexone. These patients may benefit more from less intensive treatments.
Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems
Energy Technology Data Exchange (ETDEWEB)
Day, Martin V., E-mail: day@math.vt.edu [Virginia Tech, Department of Mathematics (United States)
2011-12-15
We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.
Directory of Open Access Journals (Sweden)
Carrie Ka Yuk Lin
2014-01-01
Full Text Available Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units, satisfying the response time requirement, is analysed. The problem is formulated as a stochastic mixed integer program. A simulation-based hybrid heuristic is developed to solve the dynamic problem under different response time service level. An initial solution is obtained from solving static location-allocation models, followed by iterative improvement of the three levels of decisions by ejection, reinsertion procedure with memory of feasible and infeasible service regions. Results indicate that a higher response time service level could be achieved by allocating a given resource under an appropriate decentralized policy. Given a response time requirement, the general trend is that the minimum total capacity initially decreases with more facilities. During this stage, variability in travel time has more impact on capacity than variability in demand arrivals. Thereafter, the total capacity remains stable and then gradually increases. When service level requirement is high, the dynamic dispatch based on first-come-first-serve rule requires smaller capacity than the one by nearest-neighbour rule.
Formal language constrained path problems
Energy Technology Data Exchange (ETDEWEB)
Barrett, C.; Jacob, R.; Marathe, M.
1997-07-08
In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.
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...
Instrumentation problems in the measurement of relaxation time T1 in MRI
International Nuclear Information System (INIS)
Leroy-Willig, A.; Roucayrol, J.C.; Bittoun, J.; Courtieu, J.
1986-01-01
Longitudinal relaxation (T 1 ) of protons is a sensitive though non specific tool of tissue characterization. T 1 measurement from magnetic resonance images is unprecise, due to several phenomena that we review: time intervals shorter than in spectroscopic sequences; flip angle inhomogeneity; slice selection and spin echoes. In vivo the molecular inhomogeneity can prevent to measure a true T 1 ; motion and blood flow are important causes of errors. The relative effects of these factors are examined from in vitro and in vivo images acquired at 1.5 T. From a mono-echo single-slice saturation sequence reliable values of T 1 are obtained in vitro, the measurement time being compatible with clinical imaging. In vivo, problems due to various causes of motions are still unresolved [fr
Yuste, S Bravo; Borrego, R; Abad, E
2010-02-01
We consider various anomalous d -dimensional diffusion problems in the presence of an absorbing boundary with radial symmetry. The motion of particles is described by a fractional diffusion equation. Their mean-square displacement is given by r(2) proportional, variant t(gamma)(0divergent series appear when the concentration or survival probabilities are evaluated via the method of separation of variables. While the solution for normal diffusion problems is, at most, divergent as t-->0 , the emergence of such series in the long-time domain is a specific feature of subdiffusion problems. We present a method to regularize such series, and, in some cases, validate the procedure by using alternative techniques (Laplace transform method and numerical simulations). In the normal diffusion case, we find that the signature of the initial condition on the approach to the steady state rapidly fades away and the solution approaches a single (the main) decay mode in the long-time regime. In remarkable contrast, long-time memory of the initial condition is present in the subdiffusive case as the spatial part Psi1(r) describing the long-time decay of the solution to the steady state is determined by a weighted superposition of all spatial modes characteristic of the normal diffusion problem, the weight being dependent on the initial condition. Interestingly, Psi1(r) turns out to be independent of the anomalous diffusion exponent gamma .
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.
The waste collection vehicle routing problem with time windows in a city logistics context
DEFF Research Database (Denmark)
Buhrkal, Katja Frederik; Larsen, Allan; Røpke, Stefan
2012-01-01
Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with finding cost optimal routes for garbage trucks such that all garbage...
Paalman, Carmen; van Domburgh, Lieke; Stevens, Gonneke; Vermeiren, Robert; van de Ven, Peter; Branje, Susan; Frijns, Tom; Meeus, Wim; Koot, Hans; van Lier, Pol; Jansen, Lucres; Doreleijers, Theo
2015-01-01
This longitudinal study explores differences between native Dutch and immigrant Moroccan adolescents in the relationship between internalizing and externalizing problems across time. By using generalized estimating equations (GEE), the strength and stability of associations between internalizing and externalizing problems in 159 Moroccan and 159…
Achievements and Problems of Conceptual Modelling
Thalheim, Bernhard
Database and information systems technology has substantially changed. Nowadays, content management systems, (information-intensive) web services, collaborating systems, internet databases, OLAP databases etc. have become buzzwords. At the same time, object-relational technology has gained the maturity for being widely applied. Conceptual modelling has not (yet) covered all these novel topics. It has been concentrated for more than two decades around specification of structures. Meanwhile, functionality, interactivity and distribution must be included into conceptual modelling of information systems. Also, some of the open problems that have been already discussed in 1987 [15, 16] still remain to be open. At the same time, novel models such as object-relational models or XML-based models have been developed. They did not overcome all the problems but have been sharpening and extending the variety of open problems. The open problem presented are given for classical areas of database research, i.e., structuring and functionality. The entire are of distribution and interaction is currently an area of very intensive research.
Directory of Open Access Journals (Sweden)
Xiaobing Gan
2012-01-01
Full Text Available This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW. The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA and particle swarm optimization (PSO algorithm, the MCPSO algorithm performs best for solving this problem.
Jiang, Daijun; Li, Zhiyuan; Liu, Yikan; Yamamoto, Masahiro
2017-05-01
In this paper, we first establish a weak unique continuation property for time-fractional diffusion-advection equations. The proof is mainly based on the Laplace transform and the unique continuation properties for elliptic and parabolic equations. The result is weaker than its parabolic counterpart in the sense that we additionally impose the homogeneous boundary condition. As a direct application, we prove the uniqueness for an inverse problem on determining the spatial component in the source term by interior measurements. Numerically, we reformulate our inverse source problem as an optimization problem, and propose an iterative thresholding algorithm. Finally, several numerical experiments are presented to show the accuracy and efficiency of the algorithm.
Cichocki, A; Unbehauen, R
1994-01-01
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.
Integrated network design and scheduling problems :
Energy Technology Data Exchange (ETDEWEB)
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01
We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.
Generalized Artificial Life Structure for Time-dependent Problems
Institute of Scientific and Technical Information of China (English)
TSAU Minhe; KAO Weiwen; CHANG Albert
2009-01-01
In recent years, more attention has been paid on artificial life researches. Artificial life(AL) is a research on regulating gene parameters of digital organisms under complicated problematic environments through natural selections and evolutions to achieve the final emergence of intelligence. Most recent studies focused on solving certain real problems by artificial life methods, yet without much address on the AL life basic mechanism. The real problems are often very complicated, and the proposed methods sometimes seem too simple to handle those problems. This study proposed a new approach in AL research, named "generalized artificial life structure(GALS)", in which the traditional "gene bits" in genetic algorithms is first replaced by "gene parameters", which could appear anywhere in GALS. A modeling procedure is taken to normalize the input data, and AL "tissue" is innovated to make AL more complex. GALS is anticipated to contribute significantly to the fitness of AL evolution. The formation of"tissue" begins with some different AL basic cells, and then tissue is produced by the casual selections of one or several of these cells. As a result, the gene parameters, represented by "tissues", could become highly diversified. This diversification should have obvious effects on improving gene fitness. This study took the innovative method of GALS in a stock forecasting problem under a carefully designed manipulating platform. And the researching results verify that the GALS is successful in improving the gene evolution fitness.
Huyghebaert, Tiphaine; Gillet, Nicolas; Beltou, Nicolas; Tellier, Fanny; Fouquereau, Evelyne
2018-06-14
This study investigated the mediating role of sleeping problems in the relationship between workload and outcomes (emotional exhaustion, presenteeism, job satisfaction, and performance), and overcommitment was examined as a moderator in the relationship between workload and sleeping problems. We conducted an empirical study using a sample of 884 teachers. Consistent with our predictions, results revealed that the positive indirect effects of workload on emotional exhaustion and presenteeism, and the negative indirect effects of workload on job satisfaction and performance, through sleeping problems, were only significant among overcommitted teachers. Workload and overcommitment were also directly related to all four outcomes, precisely, they both positively related to emotional exhaustion and presenteeism and negatively related to job satisfaction and performance. Theoretical contributions and perspectives and implications for practice are discussed. Copyright © 2018 John Wiley & Sons, Ltd.
Directory of Open Access Journals (Sweden)
Antonio Costa
2014-07-01
Full Text Available Production processes in Cellular Manufacturing Systems (CMS often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs and Biased Random Sampling (BRS search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.
Directory of Open Access Journals (Sweden)
Chuan-Li Zhao
2014-01-01
Full Text Available This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d. It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in On4 time. For the model with job-independent position effects, we proved that the problems can be solved in On3 time by providing a dynamic programming algorithm.
DEFF Research Database (Denmark)
Xiao, Zhao xia; Nan, Jiakai; Guerrero, Josep M.
2017-01-01
A multiple time-scale optimization scheduling including day ahead and short time for an islanded microgrid is presented. In this paper, the microgrid under study includes photovoltaics (PV), wind turbine (WT), diesel generator (DG), batteries, and shiftable loads. The study considers the maximum...... efficiency operation area for the diesel engine and the cost of the battery charge/discharge cycle losses. The day-ahead generation scheduling takes into account the minimum operational cost and the maximum load satisfaction as the objective function. Short-term optimal dispatch is based on minimizing...
Finite-correlation-time effects in the kinematic dynamo problem
International Nuclear Information System (INIS)
Schekochihin, Alexander A.; Kulsrud, Russell M.
2001-01-01
Most of the theoretical results on the kinematic amplification of small-scale magnetic fluctuations by turbulence have been confined to the model of white-noise-like (δ-correlated in time) advecting turbulent velocity field. In this work, the statistics of the passive magnetic field in the diffusion-free regime are considered for the case when the advecting flow is finite-time correlated. A new method is developed that allows one to systematically construct the correlation-time expansion for statistical characteristics of the field such as its probability density function or the complete set of its moments. The expansion is valid provided the velocity correlation time is smaller than the characteristic growth time of the magnetic fluctuations. This expansion is carried out up to first order in the general case of a d-dimensional arbitrarily compressible advecting flow. The growth rates for all moments of the magnetic-field strength are derived. The effect of the first-order corrections due to the finite correlation time is to reduce these growth rates. It is shown that introducing a finite correlation time leads to the loss of the small-scale statistical universality, which was present in the limit of the δ-correlated velocity field. Namely, the shape of the velocity time-correlation profile and the large-scale spatial structure of the flow become important. The latter is a new effect, that implies, in particular, that the approximation of a locally-linear shear flow does not fully capture the effect of nonvanishing correlation time. Physical applications of this theory include the small-scale kinematic dynamo in the interstellar medium and protogalactic plasmas
Ghilas, V.; Demir, E.; van Woensel, T.
2016-01-01
The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) concerns scheduling a set of vehicles to serve freight requests such that a part of the journey can be carried out on a scheduled public transportation line. Due to the complexity of the problem, which is NP-hard, we
Directory of Open Access Journals (Sweden)
Amir Salehipour
2012-01-01
Full Text Available This paper presents a novel application of operations research to support decision making in blood distribution management. The rapid and dynamic increasing demand, criticality of the product, storage, handling, and distribution requirements, and the different geographical locations of hospitals and medical centers have made blood distribution a complex and important problem. In this study, a real blood distribution problem containing 24 hospitals was tackled by the authors, and an exact approach was presented. The objective of the problem is to distribute blood and its products among hospitals and medical centers such that the total waiting time of those requiring the product is minimized. Following the exact solution, a hybrid heuristic algorithm is proposed. Computational experiments showed the optimal solutions could be obtained for medium size instances, while for larger instances the proposed hybrid heuristic is very competitive.
Silverlight 2 Recipes A Problem-solution Approach
Ghosh, Cameron
2010-01-01
Microsoft .NET Architect Evangelist, Jit Ghosh, presents a practical companion guide to developing rich, interactive web applications with Silverlight 2. Common problems, issues, and every--day scenarios are tackled with a detailed discussion of the solution and ready--made code recipes that will save you hours of coding time. The recipes included in Silverlight 2 Recipes: A Problem-Solution Approach have been carefully selected and tested with the professional developer in mind. You'll find clearly and succinctly stated problems, well--architected solutions, and ample discussion of the code a
Frutos-Pascual, Maite; García Zapirain, Begoña; Méndez Zorrilla, Amaia
2014-01-01
Attention Deficit with Hyperactivity Disorder (ADHD) is one of the most prevalent disorders within the child population today. Inattention problems can lead to greater difficulties in completing assignments, as well as problems with time management and prioritisation of tasks. This article presents an intelligent tele-therapy tool based on Serious Games for Health, aimed at the improvement of time management skills and the prioritisation of tasks. This tele-system is based on the use of decis...
Robust L2-L∞ Filtering of Time-Delay Jump Systems with Respect to the Finite-Time Interval
Directory of Open Access Journals (Sweden)
Shuping He
2011-01-01
Full Text Available This paper studied the problem of stochastic finite-time boundedness and disturbance attenuation for a class of linear time-delayed systems with Markov jumping parameters. Sufficient conditions are provided to solve this problem. The L2-L∞ filters are, respectively, designed for time-delayed Markov jump linear systems with/without uncertain parameters such that the resulting filtering error dynamic system is stochastically finite-time bounded and has the finite-time interval disturbance attenuation γ for all admissible uncertainties, time delays, and unknown disturbances. By using stochastic Lyapunov-Krasovskii functional approach, it is shown that the filter designing problem is in terms of the solutions of a set of coupled linear matrix inequalities. Simulation examples are included to demonstrate the potential of the proposed results.
Directory of Open Access Journals (Sweden)
Masternak Sebastian
2016-06-01
Full Text Available Alcohol dependence and its treatment is not an exactly resolved problem. Based on the EZOP [Epidemiology of Mental Disorders and Accessibility of Mental Health Care] survey, which included a regular analysis of the incidence of mental disorders in the population of adult Polish citizens, we were able to estimate that the problem of alcohol abuse in any period of life affects even 10.9% of the population aged 18-64 years, and those addicted represent 2.2% of the country’s population. The typical symptoms of alcohol dependence according to ICD-10, include alcohol craving, impaired ability to control alcohol consumption, withdrawal symptoms which appear when a heavy drinker stops drinking, alternating alcohol tolerance, growing neglect of other areas of life, and persistent alcohol intake despite clear evidence of its destructive effect on life. At the moment, the primary method of alcoholism treatment is psychotherapy. It aims to change the patient’s habits, behaviours, relationships, or the way of thinking. It seems that psychotherapy is irreplaceable in the treatment of alcoholism, but for many years now attempts have been made to increase the effectiveness of alcoholism treatment with pharmacological agents. In this article we will try to provide a description of medications which help patients sustain abstinence in alcoholism therapy with particular emphasis on baclofen.
Li, Zhiyuan; Huang, Xinchi; Yamamoto, Masahiro
2018-01-01
In this paper, we discuss an initial-boundary value problem (IBVP) for the multi-term time-fractional diffusion equation with x-dependent coefficients. By means of the Mittag-Leffler functions and the eigenfunction expansion, we reduce the IBVP to an equivalent integral equation to show the unique existence and the analyticity of the solution for the equation. Especially, in the case where all the coefficients of the time-fractional derivatives are non-negative, by the Laplace and inversion L...
Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system
Energy Technology Data Exchange (ETDEWEB)
Shorikov, A. F., E-mail: afshorikov@mail.ru [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
2015-11-30
We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.
Directory of Open Access Journals (Sweden)
Hadi Mokhtari
2015-11-01
Full Text Available In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexible job shop scheduling with controllable processing times (FJCPT, is formulated as an integer non-linear programming (INLP model and then it is converted into an integer linear programming (ILP model. Due to NP-hardness of FJCPT, conventional analytic optimization methods are not efficient. Hence, in order to solve the problem, a Scatter Search (SS, as an efficient metaheuristic method, is developed. To show the effectiveness of the proposed method, numerical experiments are conducted. The efficiency of the proposed algorithm is compared with that of a genetic algorithm (GA available in the literature for solving FJSP problem. The results showed that the proposed SS provide better solutions than the existing GA.
Joint optimization of green vehicle scheduling and routing problem with time-varying speeds
Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo
2018-01-01
Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370
International Nuclear Information System (INIS)
Calzetta, E.; Hu, B.L.
1987-01-01
We discuss the generalization to curved spacetime of a path-integral formalism of quantum field theory based on the sum over paths first going forward in time in the presence of one external source from an in vacuum to a state defined on a hypersurface of constant time in the future, and then backwards in time in the presence of a different source to the same in vacuum. This closed-time-path formalism which generalizes the conventional method based on in-out vacuum persistence amplitudes yields real and causal effective actions, field equations, and expectation values. We apply this method to two problems in semiclassical cosmology. First we study the back reaction of particle production in a radiation-filled Bianchi type-I universe with a conformal scalar field. Unlike the in-out formalism which yields complex geometries the real and causal effective action here yields equations for real effective geometries, with more readily interpretable results. It also provides a clear identification of particle production as a dissipative process in semiclassical theories. In the second problem we calculate the vacuum expectation value of the stress-energy tensor for a nonconformal massive λphi 4 theory in a Robertson-Walker universe. This study serves to illustrate the use of Feynman diagrams and higher-loop calculations in this formalism. It also demonstrates the economy of this method in the calculation of expectation values over the mode-sum Bogolubov transformation methods ordinarily applied to matrix elements calculated in the conventional in-out approach
Directory of Open Access Journals (Sweden)
Wan-Yu Liu
2014-07-01
Full Text Available Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP. This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.
Directory of Open Access Journals (Sweden)
Rinto Yusriski
2015-09-01
Full Text Available This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1, this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.
Global existence of solutions to the Cauchy problem for time-dependent Hartree equations
International Nuclear Information System (INIS)
Chadam, J.M.; Glassey, R.T.
1975-01-01
The existence of global solutions to the Cauchy problem for time-dependent Hartree equations for N electrons is established. The solution is shown to have a uniformly bounded H 1 (R 3 ) norm and to satisfy an estimate of the form two parallel PSI (t) two parallel/sub H 2 ; less than or equal to c exp(kt). It is shown that ''negative energy'' solutions do not converge uniformly to zero as t → infinity. (U.S.)
Time management problems and discounted utility.
König, Cornelius J; Kleinmann, Martin
2007-05-01
The lens of behavioral decision theory offers a new perspective for research on time management. The basic idea of this approach is that people discount future consequences of their time management decisions, meaning that they work on tasks with smaller but sooner outcomes rather than on tasks with larger but later outcomes. The authors performed 2 experimental studies to test whether people are sensitive to differences in the discounted utility of time management decisions. In Experiment 1, they used vignettes of typical time management situations; Experiment 2 was a laboratory simulation (an in-basket task that was part of a training assessment). Participants in both studies were German students. As expected, manipulating the discounted utility of options resulted in different time management decisions. In Experiment 1, reactions to time management situations were judged as less likely if the reactions had lower discounted utilities. In Experiment 2, people spent less time on an interruption.
International Nuclear Information System (INIS)
Lo, C.C.
1977-01-01
The processing of pulses with very fast risetimes for timing purposes involves many problems because of the large equivalent bandwidths involved. For pulses with risetimes in the 150 ps range (and full widths at half maximum (FWHM) of 400 ps) bandwidths in excess of 1GHz are required. Furthermore, these very narrow pulses with current amplitudes as small as 1 mA carry very small charges ( -12 coulomb), therefore, requiring very sensitive trigger circuits. The difficulty increases when timing characteristics in the picosecond range are sought especially when a wide input signal amplitude range causes a time-walk problem. The fast timing discriminator described has a time-walk of approximately +-75 ps over the input signal range from 80 mV to 3V. A schematic of the discriminator is included, and operation and performance are discussed
Hurk, M.M. van den
2006-01-01
In problem-based learning (PBL) students are encouraged to take responsibility for their own self-regulated learning process. The present study focuses on two self-regulated learning strategies, namely time planning and self-monitoring. Time planning involves time management, scheduling and planning
Approximation problems with the divergence criterion for Gaussian variablesand Gaussian processes
A.A. Stoorvogel; J.H. van Schuppen (Jan)
1996-01-01
textabstractSystem identification for stationary Gaussian processes includes an approximation problem. Currently the subspace algorithm for this problem enjoys much attention. This algorithm is based on a transformation of a finite time series to canonical variable form followed by a truncation.
Mushkin, I.; Solomon, S.
2017-10-01
We study the inverse contagion problem (ICP). As opposed to the direct contagion problem, in which the network structure is known and the question is when each node will be contaminated, in the inverse problem the links of the network are unknown but a sequence of contagion histories (the times when each node was contaminated) is observed. We consider two versions of the ICP: The strong problem (SICP), which is the reconstruction of the network and has been studied before, and the weak problem (WICP), which requires "only" the prediction (at each time step) of the nodes that will be contaminated at the next time step (this is often the real life situation in which a contagion is observed and predictions are made in real time). Moreover, our focus is on analyzing the increasing accuracy of the solution, as a function of the number of contagion histories already observed. For simplicity, we discuss the simplest (deterministic and synchronous) contagion dynamics and the simplest solution algorithm, which we have applied to different network types. The main result of this paper is that the complex problem of the convergence of the ICP for a network can be reduced to an individual property of pairs of nodes: the "false link difficulty". By definition, given a pair of unlinked nodes i and j, the difficulty of the false link (i,j) is the probability that in a random contagion history, the nodes i and j are not contaminated at the same time step (or at consecutive time steps). In other words, the "false link difficulty" of a non-existing network link is the probability that the observations during a random contagion history would not rule out that link. This probability is relatively straightforward to calculate, and in most instances relies only on the relative positions of the two nodes (i,j) and not on the entire network structure. We have observed the distribution of false link difficulty for various network types, estimated it theoretically and confronted it
The Edge Set Cost of the Vehicle Routing Problem with Time Windows
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David
2016-01-01
. The certifications and investments impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. This violates the traditional assumption that the path between two destinations is well defined and independent of other choices. Different versions......We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications, and other costly investments...
Wavelet and adaptive methods for time dependent problems and applications in aerosol dynamics
Guo, Qiang
Time dependent partial differential equations (PDEs) are widely used as mathematical models of environmental problems. Aerosols are now clearly identified as an important factor in many environmental aspects of climate and radiative forcing processes, as well as in the health effects of air quality. The mathematical models for the aerosol dynamics with respect to size distribution are nonlinear partial differential and integral equations, which describe processes of condensation, coagulation and deposition. Simulating the general aerosol dynamic equations on time, particle size and space exhibits serious difficulties because the size dimension ranges from a few nanometer to several micrometer while the spatial dimension is usually described with kilometers. Therefore, it is an important and challenging task to develop efficient techniques for solving time dependent dynamic equations. In this thesis, we develop and analyze efficient wavelet and adaptive methods for the time dependent dynamic equations on particle size and further apply them to the spatial aerosol dynamic systems. Wavelet Galerkin method is proposed to solve the aerosol dynamic equations on time and particle size due to the fact that aerosol distribution changes strongly along size direction and the wavelet technique can solve it very efficiently. Daubechies' wavelets are considered in the study due to the fact that they possess useful properties like orthogonality, compact support, exact representation of polynomials to a certain degree. Another problem encountered in the solution of the aerosol dynamic equations results from the hyperbolic form due to the condensation growth term. We propose a new characteristic-based fully adaptive multiresolution numerical scheme for solving the aerosol dynamic equation, which combines the attractive advantages of adaptive multiresolution technique and the characteristics method. On the aspect of theoretical analysis, the global existence and uniqueness of
LAGRANGE SOLUTIONS TO THE DISCRETE-TIME GENERAL THREE-BODY PROBLEM
International Nuclear Information System (INIS)
Minesaki, Yukitaka
2013-01-01
There is no known integrator that yields exact orbits for the general three-body problem (G3BP). It is difficult to verify whether a numerical procedure yields the correct solutions to the G3BP because doing so requires knowledge of all 11 conserved quantities, whereas only six are known. Without tracking all of the conserved quantities, it is possible to show that the discrete general three-body problem (d-G3BP) yields the correct orbits corresponding to Lagrange solutions of the G3BP. We show that the d-G3BP yields the correct solutions to the G3BP for two special cases: the equilateral triangle and collinear configurations. For the triangular solution, we use the fact that the solution to the three-body case is a superposition of the solutions to the three two-body cases, and we show that the three bodies maintain the same relative distances at all times. To obtain the collinear solution, we assume a specific permutation of the three bodies arranged along a straight rotating line, and we show that the d-G3BP maintains the same distance ratio between two bodies as in the G3BP. Proving that the d-G3BP solutions for these cases are equivalent to those of the G3BP makes it likely that the d-G3BP and G3BP solutions are equivalent in other cases. To our knowledge, this is the first work that proves the equivalence of the discrete solutions and the Lagrange orbits.
Workshops and problems for benchmarking eddy current codes
International Nuclear Information System (INIS)
Turner, L.R.; Davey, K.; Ida, N.; Rodger, D.; Kameari, A.; Bossavit, A.; Emson, C.R.I.
1988-02-01
A series of six workshops was held to compare eddy current codes, using six benchmark problems. The problems include transient and steady-state ac magnetic fields, close and far boundary conditions, magnetic and non-magnetic materials. All the problems are based either on experiments or on geometries that can be solved analytically. The workshops and solutions to the problems are described. Results show that many different methods and formulations give satisfactory solutions, and that in many cases reduced dimensionality or coarse discretization can give acceptable results while reducing the computer time required. 13 refs., 1 tab
Yue, Lei; Guan, Zailin; Saif, Ullah; Zhang, Fei; Wang, Hao
2016-01-01
Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling problem with an aim to minimize the makespan in addition to minimize the total weighted tardiness simultaneously. In most of the production scheduling problems, the processing time of jobs is assumed as fixed. However, the actual processing time of jobs may be reduced due to "learning effect". The integration of sequence dependent group scheduling problem with learning effects has been rarely considered in literature. Therefore, current research considers a single machine group scheduling problem with sequence dependent setup times and learning effects simultaneously. A novel hybrid Pareto artificial bee colony algorithm (HPABC) with some steps of genetic algorithm is proposed for current problem to get Pareto solutions. Furthermore, five different sizes of test problems (small, small medium, medium, large medium, large) are tested using proposed HPABC. Taguchi method is used to tune the effective parameters of the proposed HPABC for each problem category. The performance of HPABC is compared with three famous multi objective optimization algorithms, improved strength Pareto evolutionary algorithm (SPEA2), non-dominated sorting genetic algorithm II (NSGAII) and particle swarm optimization algorithm (PSO). Results indicate that HPABC outperforms SPEA2, NSGAII and PSO and gives better Pareto optimal solutions in terms of diversity and quality for almost all the instances of the different sizes of problems.
Prediction problem for target events based on the inter-event waiting time
Shapoval, A.
2010-11-01
In this paper we address the problem of forecasting the target events of a time series given the distribution ξ of time gaps between target events. Strong earthquakes and stock market crashes are the two types of such events that we are focusing on. In the series of earthquakes, as McCann et al. show [W.R. Mc Cann, S.P. Nishenko, L.R. Sykes, J. Krause, Seismic gaps and plate tectonics: seismic potential for major boundaries, Pure and Applied Geophysics 117 (1979) 1082-1147], there are well-defined gaps (called seismic gaps) between strong earthquakes. On the other hand, usually there are no regular gaps in the series of stock market crashes [M. Raberto, E. Scalas, F. Mainardi, Waiting-times and returns in high-frequency financial data: an empirical study, Physica A 314 (2002) 749-755]. For the case of seismic gaps, we analytically derive an upper bound of prediction efficiency given the coefficient of variation of the distribution ξ. For the case of stock market crashes, we develop an algorithm that predicts the next crash within a certain time interval after the previous one. We show that this algorithm outperforms random prediction. The efficiency of our algorithm sets up a lower bound of efficiency for effective prediction of stock market crashes.
Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin
2016-03-01
Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
Taylor, Anne W; Chittleborough, Catherine; Gill, Tiffany K; Winefield, Helen; Baum, Fran; Hiller, Janet E; Goldney, Robert; Tucker, Graeme; Hugo, Graeme
2012-03-01
Psychological distress encompasses anxiety and depression with the previous studies showing that psychological distress is unequally distributed across population groups. This paper explores the mechanisms and processes which may affect the distribution of psychological distress, including a range of individual and community level socioeconomic determinants. Representative cross-sectional data was collected for respondents aged 16+ from July 2008 to June 2009, as a part of the South Australian Monitoring and Surveillance System (SAMSS) using Computer Assisted Telephone Interviews (CATI). Univariate and multivariate analyses (n = 5,763) were conducted to investigate the variables that were associated with psychological distress. The overall prevalence of psychological distress was 8.9%. In the multivariate model, females, those aged 16-49, respondents single with children, unable to work or unemployed, with a poorer family financial situation, earning $20,000 or less, feeling safe in their home some or none of the time, feeling as though they have less then total control over life decisions and sometimes experiencing problems with transport, were significantly more likely to experience psychological distress. This paper has demonstrated the relationship between low-income, financial pressure, less than optimal safety and control, and high-psychological distress. It is important that the groups highlighted as vulnerable be targeted in policy, planning, and health promotion and prevention campaigns.
Yang, Xin; Zeng, Zhenxiang; Wang, Ruidong; Sun, Xueshan
2016-01-01
This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.
The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations
DEFF Research Database (Denmark)
Dithmer, Philip; Reinhardt, Line Blander; Kontovas, Christos
2017-01-01
This paper deals with the Liner Shipping Routing and Scheduling Problem (LSRSP), which consists of designing the time schedule for a vessel to visit a fixed set of ports while minimizing costs. We extend the classical problem to include the external cost of ship air emissions and we present some...
Infinite Horizon Discrete Time Control Problems for Bounded Processes
Directory of Open Access Journals (Sweden)
2009-03-01
Full Text Available We establish Pontryagin Maximum Principles in the strong form for infinite horizon optimal control problems for bounded processes, for systems governed by difference equations. Results due to Ioffe and Tihomirov are among the tools used to prove our theorems. We write necessary conditions with weakened hypotheses of concavity and without invertibility, and we provide new results on the adjoint variable. We show links between bounded problems and nonbounded ones. We also give sufficient conditions of optimality.
Existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time
Directory of Open Access Journals (Sweden)
Nabila Bellal
2014-10-01
Full Text Available Using the penalty method, we prove the existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time. To find a solution, the original inequality is transformed into an equality by adding a positive function on the right-hand side and a complementary condition. This result can be seen as a generalization of the results by Mokrane in [11] where the obstacle is zero.
Directory of Open Access Journals (Sweden)
Fardin Ahmadizar
2011-08-01
Full Text Available This paper deals with the NP-hard single-machine total weighted tardiness problem with sequence dependent setup times. Incorporating fuzzy sets and genetic operators, a novel ant colony optimization algorithm is developed for the problem. In the proposed algorithm, artificial ants construct solutions as orders of jobs based on the heuristic information as well as pheromone trails. To calculate the heuristic information, three well-known priority rules are adopted as fuzzy sets and then aggregated. When all artificial ants have terminated their constructions, genetic operators such as crossover and mutation are applied to generate new regions of the solution space. A local search is then performed to improve the performance quality of some of the solutions found. Moreover, at run-time the pheromone trails are locally as well as globally updated, and limited between lower and upper bounds. The proposed algorithm is experimented on a set of benchmark problems from the literature and compared with other metaheuristics.
The problems inherent in teaching technical writing and report writing to native Americans
Zukowski/faust, J.
1981-01-01
Teaching technical writing to Native Americans contending with a second language and culture is addressed. Learning difficulties arising from differences between native and acquired language and cultural systems are examined. Compartmentalized teaching, which presents the ideals of technical writing in minimal units, and skills development are considered. Rhetorical problems treated include logic of arrangement, selection of support and scope of detail, and time and space. Specific problems selected include the concept of promptness, the contextualization of purpose, interpersonal relationships, wordiness, mixture of registers, and the problem of abstracting. Four inductive procedures for students having writing and perception problems are included. Four sample exercises and a bibliography of 13 references are also included.
W. van den Heuvel (Wilco); J.M. Gutierrez (Jose Miguel); H.C. Hwang (Hark-Chin)
2011-01-01
textabstractIn a recent paper Gutierrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.
Time to address the problems at the neural interface
Durand, Dominique M.; Ghovanloo, Maysam; Krames, Elliot
2014-04-01
Neural engineers have made significant, if not remarkable, progress in interfacing with the nervous system in the last ten years. In particular, neuromodulation of the brain has generated significant therapeutic benefits [1-5]. EEG electrodes can be used to communicate with patients with locked-in syndrome [6]. In the central nervous system (CNS), electrode arrays placed directly over or within the cortex can record neural signals related to the intent of the subject or patient [7, 8]. A similar technology has allowed paralyzed patients to control an otherwise normal skeletal system with brain signals [9, 10]. This technology has significant potential to restore function in these and other patients with neural disorders such as stroke [11]. Although there are several multichannel arrays described in the literature, the workhorse for these cortical interfaces has been the Utah array [12]. This 100-channel electrode array has been used in most studies on animals and humans since the 1990s and is commercially available. This array and other similar microelectrode arrays can record neural signals with high quality (high signal-to-noise ratio), but these signals fade and disappear after a few months and therefore the current technology is not reliable for extended periods of time. Therefore, despite these major advances in communicating with the brain, clinical translation cannot be implemented. The reasons for this failure are not known but clearly involve the interface between the electrode and the neural tissue. The Defense Advanced Research Project Agency (DARPA) as well as other federal funding agencies such as the National Science Foundation (NSF) and the National Institutes of Health have provided significant financial support to investigate this problem without much success. A recent funding program from DARPA was designed to establish the failure modes in order to generate a reliable neural interface technology and again was unsuccessful at producing a robust
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2004-01-01
Full Text Available We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new method for hemivariational inequalities. Since hemiequilibrium problems include hemivariational inequalities and equilibrium problems as special cases, the results proved in this paper still hold for these problems.
Wadsworth, A R
2017-01-01
This is a book of problems in abstract algebra for strong undergraduates or beginning graduate students. It can be used as a supplement to a course or for self-study. The book provides more variety and more challenging problems than are found in most algebra textbooks. It is intended for students wanting to enrich their learning of mathematics by tackling problems that take some thought and effort to solve. The book contains problems on groups (including the Sylow Theorems, solvable groups, presentation of groups by generators and relations, and structure and duality for finite abelian groups); rings (including basic ideal theory and factorization in integral domains and Gauss's Theorem); linear algebra (emphasizing linear transformations, including canonical forms); and fields (including Galois theory). Hints to many problems are also included.
L^p-continuity of solutions to parabolic free boundary problems
Directory of Open Access Journals (Sweden)
Abdeslem Lyaghfouri
2015-07-01
Full Text Available In this article, we consider a class of parabolic free boundary problems. We establish some properties of the solutions, including L^infinity-regularity in time and a monotonicity property, from which we deduce strong L^p-continuity in time.
W.J. van den Heuvel; J.M. Gutierrez (Jose Miguel); H.C. Hwang (Hark-Chin)
2010-01-01
textabstractIn a recent paper Gutiérrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.
Directory of Open Access Journals (Sweden)
E.C. Biscaia Junior
2001-06-01
Full Text Available A dynamic kinetic-diffusive model for the extraction of metallic ions from aqueous liquors using liquid surfactant membranes is proposed. The model incorporates undesirable intrinsic phenomena such as swelling and breakage of the emulsion globules that have to be controlled during process operation. These phenomena change the spatial location of the chemical reaction during the course of extraction, resulting in a transient moving boundary problem. The orthogonal collocation method was used to transform the partial differential equations into an ordinary differential equation set that was solved by an implicit numerical routine. The model was found to be numerically stable and reliable in predicting the behaviour of zinc extraction with acidic extractant for long residence times.
Finegold, M.; Mass, R.
1985-01-01
Good problem solvers and poor problem solvers in advanced physics (N=8) were significantly different in their ability in translating, planning, and physical reasoning, as well as in problem solving time; no differences in reliance on algebraic solutions and checking problems were noted. Implications for physics teaching are discussed. (DH)
Sex Differences and Self-Reported Attention Problems During Baseline Concussion Testing.
Brooks, Brian L; Iverson, Grant L; Atkins, Joseph E; Zafonte, Ross; Berkner, Paul D
2016-01-01
Amateur athletic programs often use computerized cognitive testing as part of their concussion management programs. There is evidence that athletes with preexisting attention problems will have worse cognitive performance and more symptoms at baseline testing. The purpose of this study was to examine whether attention problems affect assessments differently for male and female athletes. Participants were drawn from a database that included 6,840 adolescents from Maine who completed Immediate Postconcussion Assessment and Cognitive Testing (ImPACT) at baseline (primary outcome measure). The final sample included 249 boys and 100 girls with self-reported attention problems. Each participant was individually matched for sex, age, number of past concussions, and sport to a control participant (249 boys, 100 girls). Boys with attention problems had worse reaction time than boys without attention problems. Girls with attention problems had worse visual-motor speed than girls without attention problems. Boys with attention problems reported more total symptoms, including more cognitive-sensory and sleep-arousal symptoms, compared with boys without attention problems. Girls with attention problems reported more cognitive-sensory, sleep-arousal, and affective symptoms than girls without attention problems. When considering the assessment, management, and outcome from concussions in adolescent athletes, it is important to consider both sex and preinjury attention problems regarding cognitive test results and symptom reporting.
Inferring time derivatives including cell growth rates using Gaussian processes
Swain, Peter S.; Stevenson, Keiran; Leary, Allen; Montano-Gutierrez, Luis F.; Clark, Ivan B. N.; Vogel, Jackie; Pilizota, Teuta
2016-12-01
Often the time derivative of a measured variable is of as much interest as the variable itself. For a growing population of biological cells, for example, the population's growth rate is typically more important than its size. Here we introduce a non-parametric method to infer first and second time derivatives as a function of time from time-series data. Our approach is based on Gaussian processes and applies to a wide range of data. In tests, the method is at least as accurate as others, but has several advantages: it estimates errors both in the inference and in any summary statistics, such as lag times, and allows interpolation with the corresponding error estimation. As illustrations, we infer growth rates of microbial cells, the rate of assembly of an amyloid fibril and both the speed and acceleration of two separating spindle pole bodies. Our algorithm should thus be broadly applicable.
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Farouq, S.; Neytcheva, M.
2017-01-01
Roč. 310, January 2017 (2017), s. 5-18 ISSN 0377-0427 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : optimal control * time-harmonic Stokes problem * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www.sciencedirect.com/science/article/pii/S0377042716302631?via%3Dihub
Female Pubertal Timing and Problem Behaviour: The Role of Culture
Skoog, Therese; Stattin, Hakan; Ruiselova, Zdena; Ozdemir, Metin
2013-01-01
We tested the peer-socialization/contextual-amplification explanation for the link between early female puberty and problem behaviour. We propose that in cultures with high tolerance for adolescent heterosexual involvement, early puberty should be linked with problem behaviour--not in other cultures. We compared girls in two cultures (Slovakia and…
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang
2014-09-26
Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.
Workshops and problems for benchmarking eddy current codes
Energy Technology Data Exchange (ETDEWEB)
Turner, L.R.; Davey, K.; Ida, N.; Rodger, D.; Kameari, A.; Bossavit, A.; Emson, C.R.I.
1988-08-01
A series of six workshops was held in 1986 and 1987 to compare eddy current codes, using six benchmark problems. The problems included transient and steady-state ac magnetic fields, close and far boundary conditions, magnetic and non-magnetic materials. All the problems were based either on experiments or on geometries that can be solved analytically. The workshops and solutions to the problems are described. Results show that many different methods and formulations give satisfactory solutions, and that in many cases reduced dimensionality or coarse discretization can give acceptable results while reducing the computer time required. A second two-year series of TEAM (Testing Electromagnetic Analysis Methods) workshops, using six more problems, is underway. 12 refs., 15 figs., 4 tabs.
Workshops and problems for benchmarking eddy current codes
International Nuclear Information System (INIS)
Turner, L.R.; Davey, K.; Ida, N.; Rodger, D.; Kameari, A.; Bossavit, A.; Emson, C.R.I.
1988-08-01
A series of six workshops was held in 1986 and 1987 to compare eddy current codes, using six benchmark problems. The problems included transient and steady-state ac magnetic fields, close and far boundary conditions, magnetic and non-magnetic materials. All the problems were based either on experiments or on geometries that can be solved analytically. The workshops and solutions to the problems are described. Results show that many different methods and formulations give satisfactory solutions, and that in many cases reduced dimensionality or coarse discretization can give acceptable results while reducing the computer time required. A second two-year series of TEAM (Testing Electromagnetic Analysis Methods) workshops, using six more problems, is underway. 12 refs., 15 figs., 4 tabs
Cost and benefit including value of life, health and environmental damage measured in time units
DEFF Research Database (Denmark)
Ditlevsen, Ove Dalager; Friis-Hansen, Peter
2009-01-01
Key elements of the authors' work on money equivalent time allocation to costs and benefits in risk analysis are put together as an entity. This includes the data supported dimensionless analysis of an equilibrium relation between total population work time and gross domestic product leading...... of this societal value over the actual costs, used by the owner for economically optimizing an activity, motivates a simple risk accept criterion suited to be imposed on the owner by the public. An illustration is given concerning allocation of economical means for mitigation of loss of life and health on a ferry...
Modified artificial bee colony for the vehicle routing problems with time windows.
Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana
2016-01-01
The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.
Sleep Habits and Sleep Problems in Healthy Preschoolers.
Murthy, C L Srinivasa; Bharti, Bhavneet; Malhi, Prahbhjot; Khadwal, Alka
2015-07-01
To describe the sleep patterns and problems in children aged between 12 and 36 mo of age. This cross sectional survey was collected over a span of 1 y in Advanced Pediatric Centre, PGIMER, Chandigarh and crèches of Chandigarh. Children in the age group of 12 to 36 mo were included in study. Children with chronic illness, developmental delay, seizure disorder and lack of consent were excluded. A total of 368 children were enrolled. Main outcome measures were sleep duration over 1 to 3 y of life; sleep behavior at onset, during and waking of sleep and parent reported sleep problems and their predictors. The average duration of sleep was 12.5 h (S.D = 1.9). The mean total sleep duration and mean day time sleep duration decreased, while mean night time sleep increased as the age advanced from 12 to 36 mo. Following were the frequency of sleep habits seen in the index study; bed time routine was seen only in 68(18.5 %), a regular bed time ritual was seen in 281(76.4 %), 329(89.4 %) children frequently required 0-20 min time to fall asleep, 11(3 %) parents used sleep inducing drugs. Night waking (1 to 3 times a night) was seen in 297(80.7 %) and its frequency declined with age. Parent reported sleep problems were seen in 12.8 % (47/368). Lack of co-sleeping and night waking were considered as strongest predictors of parent reported sleep problems. Toddlers' sleep duration, night waking behavior, and day time naps decrease as the age progress while night time sleep duration increases with age. Lack of co-sleeping and night waking are considered as strongest predictors of parent reported sleep problems.
Akerman, Eva; Fridlund, Bengt; Ersson, Anders; Granberg-Axéll, Anetth
2009-04-01
Current studies reveal a lack of consensus for the evaluation of physical and psychosocial problems after ICU stay and their changes over time. The aim was to develop and evaluate the validity and reliability of a questionnaire for assessing physical and psychosocial problems over time for patients following ICU recovery. Thirty-nine patients completed the questionnaire, 17 were retested. The questionnaire was constructed in three sets: physical problems, psychosocial problems and follow-up care. Face and content validity were tested by nurses, researchers and patients. The questionnaire showed good construct validity in all three sets and had strong factor loadings (explained variance >70%, factor loadings >0.5) for all three sets. There was good concurrent validity compared with the SF 12 (r(s)>0.5). Internal consistency was shown to be reliable (Cronbach's alpha 0.70-0.85). Stability reliability on retesting was good for the physical and psychosocial sets (r(s)>0.5). The 3-set 4P questionnaire was a first step in developing an instrument for assessment of former ICU patients' problems over time. The sample size was small and thus, further studies are needed to confirm these findings.
Robust synthesis for real-time systems
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Legay, Axel; Traonouez, Luois-Marie
2014-01-01
Specification theories for real-time systems allow reasoning about interfaces and their implementation models, using a set of operators that includes satisfaction, refinement, logical and parallel composition. To make such theories applicable throughout the entire design process from an abstract...... of introducing small perturbations into formal models. We address this problem of robust implementations in timed specification theories. We first consider a fixed perturbation and study the robustness of timed specifications with respect to the operators of the theory. To this end we synthesize robust...... specification to an implementation, we need to reason about the possibility to effectively implement the theoretical specifications on physical systems, despite their limited precision. In the literature, this implementation problem has been linked to the robustness problem that analyzes the consequences...
Implementing Run-Time Evaluation of Distributed Timing Constraints in a Real-Time Environment
DEFF Research Database (Denmark)
Kristensen, C. H.; Drejer, N.
1994-01-01
In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments......In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments...
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Farouq, S.; Neytcheva, M.
2017-01-01
Roč. 310, January 2017 (2017), s. 5-18 ISSN 0377-0427 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : optimal control * time-harmonic Stokes problem * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www. science direct.com/ science /article/pii/S0377042716302631?via%3Dihub
Smirnovsky, Alexander A.; Eliseeva, Viktoria O.
2018-05-01
The study of the film flow occurred under the influence of a gas slug flow is of definite interest in heat and mass transfer during the motion of a coolant in the second circuit of a nuclear water-water reactor. Thermohydraulic codes are usually used for analysis of the such problems in which the motion of the liquid film and the vapor is modeled on the basis of a one-dimensional balance equations. Due to a greater inertia of the liquid film motion, film flow parameters changes with a relaxation compared with gas flow. We consider a model problem of film flow under the influence of friction from gas slug flow neglecting such effects as wave formation, droplet breakage and deposition on the film surface, evaporation and condensation. Such a problem is analogous to the well-known problems of Couette and Stokes flows. An analytical solution has been obtained for laminar flow. Numerical RANS-based simulation of turbulent flow was performed using OpenFOAM. It is established that the relaxation process is almost self-similar. This fact opens a possibility of obtaining valuable correlations for the relaxation time.
A Special Class of Univalent Functions in Hele-Shaw Flow Problems
Directory of Open Access Journals (Sweden)
Paula Curt
2011-01-01
Full Text Available We study the time evolution of the free boundary of a viscous fluid for planar flows in Hele-Shaw cells under injection. Applying methods from the theory of univalent functions, we prove the invariance in time of Φ-likeness property (a geometric property which includes starlikeness and spiral-likeness for two basic cases: the inner problem and the outer problem. We study both zero and nonzero surface tension models. Certain particular cases are also presented.
Dynamic vehicle routing problems: Three decades and counting
DEFF Research Database (Denmark)
Psaraftis, Harilaos N.; Wen, Min; Kontovas, Christos A.
2016-01-01
of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the natureof the dynamic element, (10......Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing areal explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy......) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis-à-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit...
Incremental projection approach of regularization for inverse problems
Energy Technology Data Exchange (ETDEWEB)
Souopgui, Innocent, E-mail: innocent.souopgui@usm.edu [The University of Southern Mississippi, Department of Marine Science (United States); Ngodock, Hans E., E-mail: hans.ngodock@nrlssc.navy.mil [Naval Research Laboratory (United States); Vidard, Arthur, E-mail: arthur.vidard@imag.fr; Le Dimet, François-Xavier, E-mail: ledimet@imag.fr [Laboratoire Jean Kuntzmann (France)
2016-10-15
This paper presents an alternative approach to the regularized least squares solution of ill-posed inverse problems. Instead of solving a minimization problem with an objective function composed of a data term and a regularization term, the regularization information is used to define a projection onto a convex subspace of regularized candidate solutions. The objective function is modified to include the projection of each iterate in the place of the regularization. Numerical experiments based on the problem of motion estimation for geophysical fluid images, show the improvement of the proposed method compared with regularization methods. For the presented test case, the incremental projection method uses 7 times less computation time than the regularization method, to reach the same error target. Moreover, at convergence, the incremental projection is two order of magnitude more accurate than the regularization method.
An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times
Directory of Open Access Journals (Sweden)
Rui Zhang
2011-09-01
Full Text Available Due to the influence of unpredictable random events, the processing time of each operation should be treated as random variables if we aim at a robust production schedule. However, compared with the extensive research on the deterministic model, the stochastic job shop scheduling problem (SJSSP has not received sufficient attention. In this paper, we propose an artificial bee colony (ABC algorithm for SJSSP with the objective of minimizing the maximum lateness (which is an index of service quality. First, we propose a performance estimate for preliminary screening of the candidate solutions. Then, the K-armed bandit model is utilized for reducing the computational burden in the exact evaluation (through Monte Carlo simulation process. Finally, the computational results on different-scale test problems validate the effectiveness and efficiency of the proposed approach.
Directory of Open Access Journals (Sweden)
Vicente Navarro, Eduardo
2006-05-01
Full Text Available The present essay is designed to be a general introduction to the philosophical problem of time from its very different forms and ways of approaching. In this sense, the article covers the problem from different perspectives and gives a brief account of the plurality and diversity of the time found in the different philosophical definitions, in the different layers of knowledge, in different periods and cultures and also in the different instruments used to measure time itself
Solved problems in electrochemistry
International Nuclear Information System (INIS)
Piron, D.L.
2004-01-01
This book presents calculated solutions to problems in fundamental and applied electrochemistry. It uses industrial data to illustrate scientific concepts and scientific knowledge to solve practical problems. It is subdivided into three parts. The first uses modern basic concepts, the second studies the scientific basis for electrode and electrolyte thermodynamics (including E-pH diagrams and the minimum energy involved in transformations) and the kinetics of rate processes (including the energy lost in heat and in parasite reactions). The third part treats larger problems in electrolysis and power generation, as well as in corrosion and its prevention. Each chapter includes three sections: the presentation of useful principles; some twenty problems with their solutions; and, a set of unsolved problems
A chance-constrained stochastic approach to intermodal container routing problems.
Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony
2018-01-01
We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.
Wilson, Robyn S.; Hardisty, David J.; Epanchin-Niell, Rebecca S.; Runge, Michael C.; Cottingham, Kathryn L.; Urban, Dean L.; Maguire, Lynn A.; Hastings, Alan; Mumby, Peter J.; Peters, Debra P.C.
2016-01-01
Ecological systems often operate on time scales significantly longer or shorter than the time scales typical of human decision making, which causes substantial difficulty for conservation and management in socioecological systems. For example, invasive species may move faster than humans can diagnose problems and initiate solutions, and climate systems may exhibit long-term inertia and short-term fluctuations that obscure learning about the efficacy of management efforts in many ecological systems. We adopted a management-decision framework that distinguishes decision makers within public institutions from individual actors within the social system, calls attention to the ways socioecological systems respond to decision makers’ actions, and notes institutional learning that accrues from observing these responses. We used this framework, along with insights from bedeviling conservation problems, to create a typology that identifies problematic time-scale mismatches occurring between individual decision makers in public institutions and between individual actors in the social or ecological system. We also considered solutions that involve modifying human perception and behavior at the individual level as a means of resolving these problematic mismatches. The potential solutions are derived from the behavioral economics and psychology literature on temporal challenges in decision making, such as the human tendency to discount future outcomes at irrationally high rates. These solutions range from framing environmental decisions to enhance the salience of long-term consequences, to using structured decision processes that make time scales of actions and consequences more explicit, to structural solutions aimed at altering the consequences of short-sighted behavior to make it less appealing. Additional application of these tools and long-term evaluation measures that assess not just behavioral changes but also associated changes in ecological systems are needed.
Working part-time: (not) a problem?
Saskia Keuzenkamp; Carlien Hillebrink; Wil Portegijs; Babette Pouwels
2009-01-01
Original title: Deeltijd (g)een probleem. Three-quarters of working women in the Netherlands work part-time. More than half these women are in small part-time jobs (less than 25 hours per week). The government wants to raise the average working hours of women. A key question is then how much
The philosophy of space and time
Reichenbach, Hans
1958-01-01
With unusual depth and clarity, the author covers the problem of the foundations of geometry, the theory of time, the theory and consequences of Einstein's relativity including: relations between theory and observations, coordinate definitions, relations between topological and metrical properties of space, the psychological problem of the possibility of a visual intuition of non-Euclidean structures, and many other important topics in modern science and philosophy. While some of the book utilizes mathematics of a somewhat advanced nature, the exposition is so careful and complete that most people familiar with the philosophy of science or some intermediate mathematics will understand the majority of the ideas and problems discussed. Partial contents: I. The Problem of Physical Geometry. Universal and Differential Forces. Visualization of Geometries. Spaces with non-Euclidean Topological Properties. Geometry as a Theory of Relations. II. The Difference between Space and Time. Simultaneity. Time Order. Unreal ...
International Nuclear Information System (INIS)
Akaoka, Katsuaki; Maruyama, Youichiro; Oba, Masaki; Miyabe, Masabumi; Otobe, Haruyoshi; Wakaida, Ikuo
2010-05-01
For the remote analysis of low DF TRU (Decontamination Factor Transuranic) fuel, Laser Breakdown Spectroscopy (LIBS) was applied to uranium oxide including a small amount of calcium oxide. The characteristics, such as spectrum intensity and plasma excitation temperature, were measured using time-resolved spectroscopy. As a result, in order to obtain the stable intensity of calcium spectrum for the uranium spectrum, it was found out that the optimum observation delay time of spectrum is 4 microseconds or more after laser irradiation. (author)
Directory of Open Access Journals (Sweden)
Rafael Grosso
2018-01-01
Full Text Available The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.
Toward a mathematical theory of environmental monitoring: the infrequent sampling problem
International Nuclear Information System (INIS)
Pimentel, K.D.
1975-06-01
Optimal monitoring of pollutants in diffusive environmental media was studied in the contexts of the subproblems of the optimal design and management of environmental monitors for bounds on maximum allowable errors in the estimate of the monitor state or output variables. Concise problem statements were made. Continuous-time finite-dimensional normal mode models for distributed stochastic diffusive pollutant transport were developed. The resultant set of state equations was discretized in time for implementation in the Kalman Filter in the problem of optimal state estimation. The main results of this thesis concern the special class of optimal monitoring problem called the infrequent sampling problem. Extensions to systems including pollutant scavenging and systems with emission or radiation boundary conditions were made. (U.S.)
International Nuclear Information System (INIS)
Prykarpatsky, A.K.; Bogolubov, J.R.
2016-01-01
The classical Maxwell electromagnetic field and the Lorentz-type force equations are rederived in the framework of the Feynman proper time paradigm and the related vacuum field theory approach. The classical Ampere law origin is rederived, and its relationship with the Feynman proper time paradigm is discussed. The electron inertia problem is analyzed in detail within the Lagrangian and Hamiltonian formalisms and the related pressure-energy compensation principle of stochastic electrodynamics. The modified Abraham-Lorentz damping radiation force is derived and the electromagnetic electron mass origin is argued
DEFF Research Database (Denmark)
Clausen, Jens; Ju, S.
2006-01-01
The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different types to a consumer in batches. The task is to determine the cycle time, i.e., the time between deliveries, which minimizes the total cost per time unit. This includes the d...
Solar discrepancies: Mars exploration and the curious problem of inter-planetary time
Mirmalek, Zara Lenora
The inter-planetary work system for the NASA's Mars Exploration Rovers (MER) mission entailed coordinating work between two corporally diverse workgroups, human beings and solar-powered robots, and between two planets with asynchronous axial rotations. The rotation of Mars takes approximately 24 hours and 40 minutes while for Earth the duration is 24 hours, a differential that was synchronized on Earth by setting a clock forward forty minutes every day. The hours of the day during which the solar-powered rovers were operational constituted the central consideration in the relationship between time and work around which the schedule of MER science operations were organized. And, the operational hours for the rovers were precarious for at least two reasons: on the one hand, the possibility of a sudden and inexplicable malfunction was always present; on the other, the rovers were powered by solar-charged batteries that could simply (and would eventually) fail. Thus, the timetable for the inter-planetary work system was scheduled according to the daily cycle of the sun on Mars and a version of clock time called Mars time was used to keep track of the movement of the sun on Mars. While the MER mission was a success, it does not necessarily follow that all aspects of mission operations were successful. One of the central problems that plagued the organization of mission operations was precisely this construct called "Mars time" even while it appeared that the use of Mars time was unproblematic and central to the success of the mission. In this dissertation, Zara Mirmalek looks at the construction of Mars time as a tool and as a social process. Of particular interest are the consequences of certain (ostensibly foundational) assumptions about the relationship between clock time and the conduct of work that contributed to making the relationship between Mars time and work on Earth appear operational. Drawing on specific examples of breakdowns of Mars time as a support
2010-07-01
... 41 Public Contracts and Property Management 4 2010-07-01 2010-07-01 false Does the 2-year time period in Â§ 302-2.8 include time that I cannot travel and/or transport my household effects due to... time that I cannot travel and/or transport my household effects due to shipping restrictions to or from...
Learning from the problems of problem-based learning
Directory of Open Access Journals (Sweden)
Epstein Richard
2004-01-01
Full Text Available Abstract Background The last decade has witnessed a rapid expansion of biomedical knowledge. Despite this, fashions in medical education over the same period have shifted away from factual (didactic teaching and towards contextual, or problem-based, learning (PBL. This paradigm shift has been justified by studies showing that PBL improves reasoning and communication while being associated with few if any detectable knowledge deficits. Discussion Analysis of the literature indicates that the recent rapid rise of PBL has closely paralleled the timing of the information explosion. The growing dominance of PBL could thus worsen the problems of information management in medical education via several mechanisms: first, by creating the impression that a defined spectrum of core factual knowledge suffices for clinical competence despite ongoing knowledge expansion (quality cost; second, by dissuading teachers from refining the educational utility of didactic modalities (improvement cost; and third, by reducing faculty time for developing reusable resources to impart factual knowledge more efficiently (opportunity cost. Summary These costs of PBL imply a need for strengthening the knowledge base of 21st-century medical graduates. New initiatives towards this end could include the development of more integrated cognitive techniques for facilitating the comprehension of complex data; the design of differentiated medical curricula for producing graduates with defined high-priority skill sets; and the encouragement of more cost-effective faculty teaching activities focused on the prototyping and testing of innovative commercializable educational tools.
The Home Care Crew Scheduling Problem:
DEFF Research Database (Denmark)
Rasmussen, Matias Sevel; Justesen, Tor; Dohn, Anders
In the Home Care Crew Scheduling Problem a staff of caretakers has to be assigned a number of visits to patients' homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time...... preference constraints. The algorithm is tested both on real-life problem instances and on generated test instances inspired by realistic settings. The use of the specialised branching scheme on real-life problems is novel. The visit clustering decreases run times significantly, and only gives a loss...... windows of the visits must be respected. The challenge when assigning visits to caretakers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits. We model the problem as a set partitioning problem with side constraints and develop an exact...
Directory of Open Access Journals (Sweden)
Qi Hu
2013-04-01
Full Text Available State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data’s real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.
Physics students' approaches to learning and cognitive processes in solving physics problems
Bouchard, Josee
This study examined traditional instruction and problem-based learning (PBL) approaches to teaching and the extent to which they foster the development of desirable cognitive processes, including metacognition, critical thinking, physical intuition, and problem solving among undergraduate physics students. The study also examined students' approaches to learning and their perceived role as physics students. The research took place in the context of advanced courses of electromagnetism at a Canadian research university. The cognitive science, expertise, physics and science education, instructional psychology, and discourse processes literature provided the framework and background to conceptualize and structure this study. A within-stage mixed-model design was used and a number of instruments, including a survey, observation grids, and problem sets were developed specifically for this study. A special one-week long problem-based learning (PBL) intervention was also designed. Interviews with the instructors participating in the study provided complementary data. Findings include evidence that students in general engage in metacognitive processes in the organization of their personal study time. However, this potential, including the development of other cognitive processes, might not be stimulated as much as it could in the traditional lecture instructional context. The PBL approach was deemed as more empowering for the students. An unexpected finding came from the realisation that a simple exposure to a structured exercise of problem-solving (pre-test) was sufficient to produce superior planning and solving strategies on a second exposure (post-test) even for the students who had not been exposed to any special treatment. Maturation was ruled out as a potential threat to the validity of this finding. Another promising finding appears to be that the problem-based learning (PBL) intervention tends to foster the development of cognitive competencies, particularly
Directory of Open Access Journals (Sweden)
Huixin Tian
2016-01-01
Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.
Higher-order techniques for some problems of nonlinear control
Directory of Open Access Journals (Sweden)
Sarychev Andrey V.
2002-01-01
Full Text Available A natural first step when dealing with a nonlinear problem is an application of some version of linearization principle. This includes the well known linearization principles for controllability, observability and stability and also first-order optimality conditions such as Lagrange multipliers rule or Pontryagin's maximum principle. In many interesting and important problems of nonlinear control the linearization principle fails to provide a solution. In the present paper we provide some examples of how higher-order methods of differential geometric control theory can be used for the study nonlinear control systems in such cases. The presentation includes: nonlinear systems with impulsive and distribution-like inputs; second-order optimality conditions for bang–bang extremals of optimal control problems; methods of high-order averaging for studying stability and stabilization of time-variant control systems.
Torres-Lapasió, J R; Pous-Torres, S; Ortiz-Bolsico, C; García-Alvarez-Coque, M C
2015-01-16
The optimisation of the resolution in high-performance liquid chromatography is traditionally performed attending only to the time information. However, even in the optimal conditions, some peak pairs may remain unresolved. Such incomplete resolution can be still accomplished by deconvolution, which can be carried out with more guarantees of success by including spectral information. In this work, two-way chromatographic objective functions (COFs) that incorporate both time and spectral information were tested, based on the peak purity (analyte peak fraction free of overlapping) and the multivariate selectivity (figure of merit derived from the net analyte signal) concepts. These COFs are sensitive to situations where the components that coelute in a mixture show some spectral differences. Therefore, they are useful to find out experimental conditions where the spectrochromatograms can be recovered by deconvolution. Two-way multivariate selectivity yielded the best performance and was applied to the separation using diode-array detection of a mixture of 25 phenolic compounds, which remained unresolved in the chromatographic order using linear and multi-linear gradients of acetonitrile-water. Peak deconvolution was carried out using the combination of orthogonal projection approach and alternating least squares. Copyright © 2014 Elsevier B.V. All rights reserved.
Wilson, Robyn S; Hardisty, David J; Epanchin-Niell, Rebecca S; Runge, Michael C; Cottingham, Kathryn L; Urban, Dean L; Maguire, Lynn A; Hastings, Alan; Mumby, Peter J; Peters, Debra P C
2016-02-01
Ecological systems often operate on time scales significantly longer or shorter than the time scales typical of human decision making, which causes substantial difficulty for conservation and management in socioecological systems. For example, invasive species may move faster than humans can diagnose problems and initiate solutions, and climate systems may exhibit long-term inertia and short-term fluctuations that obscure learning about the efficacy of management efforts in many ecological systems. We adopted a management-decision framework that distinguishes decision makers within public institutions from individual actors within the social system, calls attention to the ways socioecological systems respond to decision makers' actions, and notes institutional learning that accrues from observing these responses. We used this framework, along with insights from bedeviling conservation problems, to create a typology that identifies problematic time-scale mismatches occurring between individual decision makers in public institutions and between individual actors in the social or ecological system. We also considered solutions that involve modifying human perception and behavior at the individual level as a means of resolving these problematic mismatches. The potential solutions are derived from the behavioral economics and psychology literature on temporal challenges in decision making, such as the human tendency to discount future outcomes at irrationally high rates. These solutions range from framing environmental decisions to enhance the salience of long-term consequences, to using structured decision processes that make time scales of actions and consequences more explicit, to structural solutions aimed at altering the consequences of short-sighted behavior to make it less appealing. Additional application of these tools and long-term evaluation measures that assess not just behavioral changes but also associated changes in ecological systems are needed. © 2015
Problem solving stages in the five square problem.
Fedor, Anna; Szathmáry, Eörs; Öllinger, Michael
2015-01-01
According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight, and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviorally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. Our participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and some of them also had the possibility of reporting impasse while working on the task. We found that the majority of participants did not follow the classic four-stage model of insight, but had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model is not sufficient to describe variability on the individual level. We revised the classic model and we provide a new model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviorally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behavior to verify insight theory.
Problem solving stages in the five square problem
Directory of Open Access Journals (Sweden)
Anna eFedor
2015-08-01
Full Text Available According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviourally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. 101 participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and 67 of them also had the possibility of reporting impasse while working on the task. We have found that 49% (19 out of 39 of the solvers and 13% (8 out of 62 of the non-solvers followed the classic four-stage model of insight. The rest of the participants had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model must be extended to explain variability on the individual level. We provide a model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviourally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behaviour to verify insight theory.
Energy Technology Data Exchange (ETDEWEB)
Shorikov, A. F. [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia and Institute of Mathematics and Mechanics, Ural Division of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
2014-11-18
We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.
Robust scaling laws for energy confinement time, including radiated fraction, in Tokamaks
Murari, A.; Peluso, E.; Gaudio, P.; Gelfusa, M.
2017-12-01
In recent years, the limitations of scalings in power-law form that are obtained from traditional log regression have become increasingly evident in many fields of research. Given the wide gap in operational space between present-day and next-generation devices, robustness of the obtained models in guaranteeing reasonable extrapolability is a major issue. In this paper, a new technique, called symbolic regression, is reviewed, refined, and applied to the ITPA database for extracting scaling laws of the energy-confinement time at different radiated fraction levels. The main advantage of this new methodology is its ability to determine the most appropriate mathematical form of the scaling laws to model the available databases without the restriction of their having to be power laws. In a completely new development, this technique is combined with the concept of geodesic distance on Gaussian manifolds so as to take into account the error bars in the measurements and provide more reliable models. Robust scaling laws, including radiated fractions as regressor, have been found; they are not in power-law form, and are significantly better than the traditional scalings. These scaling laws, including radiated fractions, extrapolate quite differently to ITER, and therefore they require serious consideration. On the other hand, given the limitations of the existing databases, dedicated experimental investigations will have to be carried out to fully understand the impact of radiated fractions on the confinement in metallic machines and in the next generation of devices.
A multiple ship routing and speed optimization problem under time, cost and environmental objectives
DEFF Research Database (Denmark)
Wen, M.; Pacino, Dario; Kontovas, C.A.
2017-01-01
The purpose of this paper is to investigate a multiple ship routing and speed optimization problem under time, cost and environmental objectives. A branch and price algorithm as well as a constraint programming model are developed that consider (a) fuel consumption as a function of payload, (b......) fuel price as an explicit input, (c) freight rate as an input, and (d) in-transit cargo inventory costs. The alternative objective functions are minimum total trip duration, minimum total cost and minimum emissions. Computational experience with the algorithm is reported on a variety of scenarios....
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.
Fixation Time for Evolutionary Graphs
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.
On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity
Hanum, F.; Hartono, A. P.; Bakhtiar, T.
2018-03-01
This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.
Directory of Open Access Journals (Sweden)
Marco Antonio Cruz-Chávez
2016-01-01
Full Text Available A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modified k-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.
The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms
Yamakami, Tomoyuki
2015-01-01
We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...
The stochastic goodwill problem
Marinelli, Carlo
2003-01-01
Stochastic control problems related to optimal advertising under uncertainty are considered. In particular, we determine the optimal strategies for the problem of maximizing the utility of goodwill at launch time and minimizing the disutility of a stream of advertising costs that extends until the launch time for some classes of stochastic perturbations of the classical Nerlove-Arrow dynamics. We also consider some generalizations such as problems with constrained budget and with discretionar...
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
DEFF Research Database (Denmark)
Wulff-Nilsen, C.
2013-01-01
Let G be an n-vertex planar, undirected, and unweighted graph. It was stated as open problems whether the Wiener index, defined as the sum of all-pairs shortest path distances, and the diameter of G can be computed in o(n(2)) time. We show that both problems can be solved in O(n(2) log log n/log n......) time with O(n) space. The techniques that we apply allow us to build, within the same time bound, an oracle for exact distance queries in G. More generally, for any parameter S is an element of [(log n/log log n)(2), n(2/5)], distance queries can be answered in O (root S log S/log n) time per query...... with O(n(2)/root S) preprocessing time and space requirement. With respect to running time, this is better than previous algorithms when log S = o(log n). All algorithms have linear space requirement. Our results generalize to a larger class of graphs including those with a fixed excluded minor. (C) 2012...
Inverse Ising problem in continuous time: A latent variable approach
Donner, Christian; Opper, Manfred
2017-12-01
We consider the inverse Ising problem: the inference of network couplings from observed spin trajectories for a model with continuous time Glauber dynamics. By introducing two sets of auxiliary latent random variables we render the likelihood into a form which allows for simple iterative inference algorithms with analytical updates. The variables are (1) Poisson variables to linearize an exponential term which is typical for point process likelihoods and (2) Pólya-Gamma variables, which make the likelihood quadratic in the coupling parameters. Using the augmented likelihood, we derive an expectation-maximization (EM) algorithm to obtain the maximum likelihood estimate of network parameters. Using a third set of latent variables we extend the EM algorithm to sparse couplings via L1 regularization. Finally, we develop an efficient approximate Bayesian inference algorithm using a variational approach. We demonstrate the performance of our algorithms on data simulated from an Ising model. For data which are simulated from a more biologically plausible network with spiking neurons, we show that the Ising model captures well the low order statistics of the data and how the Ising couplings are related to the underlying synaptic structure of the simulated network.
Bagherinejad, Jafar; Niknam, Azar
2018-03-01
In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.
Leander, Jacob; Lundh, Torbjörn; Jirstrand, Mats
2014-05-01
In this paper we consider the problem of estimating parameters in ordinary differential equations given discrete time experimental data. The impact of going from an ordinary to a stochastic differential equation setting is investigated as a tool to overcome the problem of local minima in the objective function. Using two different models, it is demonstrated that by allowing noise in the underlying model itself, the objective functions to be minimized in the parameter estimation procedures are regularized in the sense that the number of local minima is reduced and better convergence is achieved. The advantage of using stochastic differential equations is that the actual states in the model are predicted from data and this will allow the prediction to stay close to data even when the parameters in the model is incorrect. The extended Kalman filter is used as a state estimator and sensitivity equations are provided to give an accurate calculation of the gradient of the objective function. The method is illustrated using in silico data from the FitzHugh-Nagumo model for excitable media and the Lotka-Volterra predator-prey system. The proposed method performs well on the models considered, and is able to regularize the objective function in both models. This leads to parameter estimation problems with fewer local minima which can be solved by efficient gradient-based methods. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.
Walker, Sandra; Kennedy, Anne; Vassilev, Ivaylo; Rogers, Anne
2018-02-01
Social network processes impact on the genesis and management of mental health problems. There is currently less understanding of the way people negotiate networked relationships in times of crisis compared to how they manage at other times. This paper explores the patterns and nature of personal network involvement at times of crises and how these may differ from day-to-day networks of recovery and maintenance. Semi-structured interviews with 25 participants with a diagnosis of long-term mental health (MH) problems drawn from recovery settings in the south of England. Interviews centred on personal network mapping of members and resources providing support. The mapping interviews explored the work of network members and changes in times of crisis. Interviews were recorded, transcribed and analysed using a framework analysis. Three key themes were identified: the fluidity of network relationality between crisis and recovery; isolation as a means of crises management; leaning towards peer support. Personal network input retreated at times of crisis often as result of "ejection" from the network by participants who used self-isolation as a personal management strategy in an attempt to deal with crises. Peer support is considered useful during a crisis, whilst the role of services was viewed with some ambiguity. Social networks membership, and type and depth of involvement, is subject to change between times of crisis and everyday support. This has implications for managing mental health in terms of engaging with network support differently in times of crises versus recovery and everyday living. © 2017 The Authors Health Expectations Published by John Wiley & Sons Ltd.
State-dependent impulses boundary value problems on compact interval
Rachůnková, Irena
2015-01-01
This book offers the reader a new approach to the solvability of boundary value problems with state-dependent impulses and provides recently obtained existence results for state dependent impulsive problems with general linear boundary conditions. It covers fixed-time impulsive boundary value problems both regular and singular and deals with higher order differential equations or with systems that are subject to general linear boundary conditions. We treat state-dependent impulsive boundary value problems, including a new approach giving effective conditions for the solvability of the Dirichlet problem with one state-dependent impulse condition and we show that the depicted approach can be extended to problems with a finite number of state-dependent impulses. We investigate the Sturm–Liouville boundary value problem for a more general right-hand side of a differential equation. Finally, we offer generalizations to higher order differential equations or differential systems subject to general linear boundary...
Schmüdgen, Konrad
2017-01-01
This advanced textbook provides a comprehensive and unified account of the moment problem. It covers the classical one-dimensional theory and its multidimensional generalization, including modern methods and recent developments. In both the one-dimensional and multidimensional cases, the full and truncated moment problems are carefully treated separately. Fundamental concepts, results and methods are developed in detail and accompanied by numerous examples and exercises. Particular attention is given to powerful modern techniques such as real algebraic geometry and Hilbert space operators. A wide range of important aspects are covered, including the Nevanlinna parametrization for indeterminate moment problems, canonical and principal measures for truncated moment problems, the interplay between Positivstellensätze and moment problems on semi-algebraic sets, the fibre theorem, multidimensional determinacy theory, operator-theoretic approaches, and the existence theory and important special topics of multidime...
Working part-time: (not) a problem?
Saskia Keuzenkamp; Carlien Hillebrink; Wil Portegijs; Babette Pouwels
2009-01-01
Original title: Deeltijd (g)een probleem. Three-quarters of working women in the Netherlands work part-time. More than half these women are in small part-time jobs (less than 25 hours per week). The government wants to raise the average working hours of women. A key question is then how much scope there is for women to increase their working hours. This report explores this issue from three angles. First it looks at the role played by employers in increasing the working hours of women and at ...
2006-08-01
including approximations of delivery costs. The solution of a sub-problem provides input for another sub-problem. Perl (1983) and Perl and Daskin (1985...developed in this section represents a modification and combination of both the three-layer location routing formulation of Perl and Daskin (1985) and the...1985) LRP formulation to create the LPDPTW. 4.2.1 Generalization of the LRP Perl and Daskin (1985) utilize a fixed charge location problem as the
Directory of Open Access Journals (Sweden)
Zhang Xuemei
2009-01-01
Full Text Available By constructing available upper and lower solutions and combining the Schauder's fixed point theorem with maximum principle, this paper establishes sufficient and necessary conditions to guarantee the existence of as well as positive solutions for a class of singular boundary value problems on time scales. The results significantly extend and improve many known results for both the continuous case and more general time scales. We illustrate our results by one example.
Liu, Yikan
2015-01-01
In this paper, we establish a strong maximum principle for fractional diffusion equations with multiple Caputo derivatives in time, and investigate a related inverse problem of practical importance. Exploiting the solution properties and the involved multinomial Mittag-Leffler functions, we improve the weak maximum principle for the multi-term time-fractional diffusion equation to a stronger one, which is parallel to that for its single-term counterpart as expected. As a direct application, w...
Awi; Ahmar, A. S.; Rahman, A.; Minggi, I.; Mulbar, U.; Asdar; Ruslan; Upu, H.; Alimuddin; Hamda; Rosidah; Sutamrin; Tiro, M. A.; Rusli
2018-01-01
This research aims to reveal the profile about the level of creativity and the ability to propose statistical problem of students at Mathematics Education 2014 Batch in the State University of Makassar in terms of their cognitive style. This research uses explorative qualitative method by giving meta-cognitive scaffolding at the time of research. The hypothesis of research is that students who have field independent (FI) cognitive style in statistics problem posing from the provided information already able to propose the statistical problem that can be solved and create new data and the problem is already been included as a high quality statistical problem, while students who have dependent cognitive field (FD) commonly are still limited in statistics problem posing that can be finished and do not load new data and the problem is included as medium quality statistical problem.
Augmented neural networks and problem structure-based heuristics for the bin-packing problem
Kasap, Nihat; Agarwal, Anurag
2012-08-01
In this article, we report on a research project where we applied augmented-neural-networks (AugNNs) approach for solving the classical bin-packing problem (BPP). AugNN is a metaheuristic that combines a priority rule heuristic with the iterative search approach of neural networks to generate good solutions fast. This is the first time this approach has been applied to the BPP. We also propose a decomposition approach for solving harder BPP, in which subproblems are solved using a combination of AugNN approach and heuristics that exploit the problem structure. We discuss the characteristics of problems on which such problem structure-based heuristics could be applied. We empirically show the effectiveness of the AugNN and the decomposition approach on many benchmark problems in the literature. For the 1210 benchmark problems tested, 917 problems were solved to optimality and the average gap between the obtained solution and the upper bound for all the problems was reduced to under 0.66% and computation time averaged below 33 s per problem. We also discuss the computational complexity of our approach.
Parenting Stress and Child Behavior Problems: A Transactional Relationship across Time
Neece, Cameron L.; Green, Shulamite A.; Baker, Bruce L.
2012-01-01
Parenting stress and child behavior problems have been posited to have a transactional effect on each other across development. However, few studies have tested this model empirically. The authors investigated the relationship between parenting stress and child behavior problems from ages 3 to 9 years old among 237 children, 144 of whom were…
International Nuclear Information System (INIS)
Jonckheere, R.
2003-01-01
The results of apatite fission-track modelling are only as accurate as the method, and depend on the assumption that the processes involved in the annealing of fossil tracks over geological times are the same as those responsible for the annealing of induced fission tracks in laboratory experiments. This has hitherto been assumed rather than demonstrated. The present critical discussion identifies a number of methodical problems from an examination of the available data on age standards, borehole samples and samples studied in the framework of geological investigations. These problems are related to low- ( 60 deg. C) annealing on a geological timescale and to the procedures used for calculating temperature-time paths from the fission-track data. It is concluded that it is not established that the relationship between track length and track density and the appearance of unetchable gaps, observed in laboratory annealing experiments on induced tracks, can be extrapolated to the annealing of fossil tracks on a geological timescale. This in turn casts doubt on the central principle of equivalent time. That such uncertainties still exist is in no small part due to an insufficient understanding of the formation, structure and properties of fission tracks at the atomic scale and to a lack of attention to the details of track revelation. The methodical implications of discrepancies between fission track results and the independent geological evidence are rarely considered. This presents a strong case for the re-involvement of track physicists in fundamental fission track research
Protopopescu, V.; D'Helon, C.; Barhen, J.
2003-06-01
A constant-time solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Brüschweiler's ensemble search algorithm is applied. For adequate sensitivities of the measurement technique, the query complexity of the ensemble search algorithm depends linearly on the size of the function's domain. Advantages and limitations of an eventual NMR implementation are discussed.
Brophy-Herb, Holly E; Bocknek, Erika London; Vallotton, Claire D; Stansbury, Kathy E; Senehi, Neda; Dalimonte-Merckling, Danielle; Lee, Young-Eun
2015-09-01
To test the hypothesis that toddlers at highest risk for behavioral problems from the most economically vulnerable families will benefit most from maternal talk about emotions. This study included 89 toddlers and mothers from low-income families. Behavioral problems were rated at 2 time points by masters-level trained Early Head Start home visiting specialists. Maternal emotion talk was coded from a wordless book-sharing task. Coding focused on mothers' emotion bridging, which included labeling emotions, explaining the context of emotions, noting the behavioral cues of emotions, and linking emotions to toddlers' own experiences. Maternal demographic risk reflected a composite score of 5 risk factors. A significant 3-way interaction between Time 1 toddler behavior problems, maternal emotion talk, and maternal demographic risk (p = .001) and examination of slope difference tests revealed that when maternal demographic risk was greater, more maternal emotion talk buffered associations between earlier and later behavior problems. Greater demographic risk and lower maternal emotion talk intensified Time 1 behavior problems as a predictor of Time 2 behavior problems. The model explained 54% of the variance in toddlers' Time 2 behavior problems. Analyses controlled for maternal warmth to better examine the unique contributions of emotion bridging to toddlers' behaviors. Toddlers at highest risk, those with more early behavioral problems from higher demographic-risk families, benefit the most from mothers' emotion talk. Informing parents about the use of emotion talk may be a cost-effective, simple strategy to support at-risk toddlers' social-emotional development and reduce behavioral problems.
Turnip, Betty; Wahyuni, Ida; Tanjung, Yul Ifda
2016-01-01
One of the factors that can support successful learning activity is the use of learning models according to the objectives to be achieved. This study aimed to analyze the differences in problem-solving ability Physics student learning model Inquiry Training based on Just In Time Teaching [JITT] and conventional learning taught by cooperative model…
Problems in differential equations
Brenner, J L
2013-01-01
More than 900 problems and answers explore applications of differential equations to vibrations, electrical engineering, mechanics, and physics. Problem types include both routine and nonroutine, and stars indicate advanced problems. 1963 edition.
Zero-Error Capacity of a Class of Timing Channels
DEFF Research Database (Denmark)
Kovacevic, M.; Popovski, Petar
2014-01-01
We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) time is slotted; 2) at most N particles are sent in each time slot; 3) every particle is ...
Stress analysis of fuel claddings with axial fins including creep effects
International Nuclear Information System (INIS)
Krieg, R.
1977-01-01
For LMFBR fuel claddings with axial fins the stress and strain fields are calculated which may be caused by internal pressure, differential thermal expansion and irradiation induced differential swelling. To provide an appropriate description of the cladding material it is assumed that the total strain is the sum of a linear elastic and a creep term, where the latter one includes the thermal as well as the irradiation induced creep. First the linear elastic problem is treated by a semi-analytical method leading to a bipotential equation for Airys' stress function. Solving this equation analytically means that the field equations valid within the cladding are satisfied exactly. By applying a combined point matching- least square-method the boundary conditions could be satisfied approximately such that in most cases the remaining error is within the uncertainty range of the loading conditions. Then the nonlinear problem which includes creep is approximated by a sequence of linear elastic solutions with time as parameter. The accumulated creep strain is treated here as an imposed strain field. To study the influence of different effects such as fin shape, temperature region, irradiation induced creep and swelling or internal pressure, a total of eleven cases with various parameter variations are investigated. The results are presented graphically in the following forms: stress and strain distributions over the cladding cross section for end of life conditions and boundary stresses and strains versus time. (Auth.)
POISSON, Analysis Solution of Poisson Problems in Probabilistic Risk Assessment
International Nuclear Information System (INIS)
Froehner, F.H.
1986-01-01
1 - Description of program or function: Purpose of program: Analytic treatment of two-stage Poisson problem in Probabilistic Risk Assessment. Input: estimated a-priori mean failure rate and error factor of system considered (for calculation of stage-1 prior), number of failures and operating times for similar systems (for calculation of stage-2 prior). Output: a-posteriori probability distributions on linear and logarithmic time scale (on specified time grid) and expectation values of failure rate and error factors are calculated for: - stage-1 a-priori distribution, - stage-1 a-posteriori distribution, - stage-2 a-priori distribution, - stage-2 a-posteriori distribution. 2 - Method of solution: Bayesian approach with conjugate stage-1 prior, improved with experience from similar systems to yield stage-2 prior, and likelihood function from experience with system under study (documentation see below under 10.). 3 - Restrictions on the complexity of the problem: Up to 100 similar systems (including the system considered), arbitrary number of problems (failure types) with same grid
Directory of Open Access Journals (Sweden)
Song Huang
2016-01-01
Full Text Available The fuzzy processing time occasionally exists in job shop scheduling problem of flexible manufacturing system. To deal with fuzzy processing time, fuzzy flexible job shop model was established in several papers and has attracted numerous researchers’ attention recently. In our research, an improved version of discrete particle swarm optimization (IDPSO is designed to solve flexible job shop scheduling problem with fuzzy processing time (FJSPF. In IDPSO, heuristic initial methods based on triangular fuzzy number are developed, and a combination of six initial methods is applied to initialize machine assignment and random method is used to initialize operation sequence. Then, some simple and effective discrete operators are employed to update particle’s position and generate new particles. In order to guide the particles effectively, we extend global best position to a set with several global best positions. Finally, experiments are designed to investigate the impact of four parameters in IDPSO by Taguchi method, and IDPSO is tested on five instances and compared with some state-of-the-art algorithms. The experimental results show that the proposed algorithm can obtain better solutions for FJSPF and is more competitive than the compared algorithms.
Pubertal induction in hypogonadism: Current approaches including use of gonadotrophins.
Zacharin, Margaret
2015-06-01
Primary disorders of the gonad or those secondary to abnormalities of the hypothalamic pituitary axis result in hypogonadism. The range of health problems of childhood and adolescence that affect this axis has increased, as most children now survive chronic illness, but many have persisting deficits in gonadal function as a result of their underlying condition or its treatment. An integrated approach to hormone replacement is needed to optimize adult hormonal and bone health, and to offer opportunities for fertility induction and preservation that were not considered possible in the past. Timing of presentation ranges from birth, with disorders of sexual development, through adolescent pubertal failure, to adult fertility problems. This review addresses diagnosis and management of hypogonadism and focuses on new management strategies to address current concerns with fertility preservation. These include Turner syndrome, and fertility presevation prior to childhood cancer treatment. New strategies for male hormone replacement therapy that may impinge upon future fertility are emphasized. Copyright © 2015 Elsevier Ltd. All rights reserved.
Is tool-making knowledge robust over time and across problems?
Beck, Sarah R.; Cutting, Nicola; Apperly, Ian A.; Demery, Zoe; Iliffe, Leila; Rishi, Sonia; Chappell, Jackie
2014-01-01
In three studies, we explored the retention and transfer of tool-making knowledge, learnt from an adult demonstration, to other temporal and task contexts. All studies used a variation of a task in which children had to make a hook tool to retrieve a bucket from a tall transparent tube. Children who failed to innovate the hook tool independently saw a demonstration. In Study 1, we tested children aged 4–6 years (N = 53) who had seen the original demonstration 3 months earlier. Performance was excellent at the second time, indicating that children’s knowledge was retained over the 3 month period. In Studies 2 and 3 we explored transfer of the new knowledge to other tasks. In Study 2, children were given two variants of the apparatus that differed in surface characteristics (e.g., shape and color). Participants generalized their knowledge to these new apparatuses even though the new pipecleaner also differed in size and color. Five- to 6-year-olds (N = 22) almost always transferred their knowledge to problems where the same tool had to be made. Younger, 3- to 5-year-olds’ (N = 46), performance was more variable. In Study 3, 4- to 7-year-olds (N = 146) saw a demonstration of hook making with a pipecleaner, but then had to make a tool by combining pieces of wooden dowel (or vice versa: original training on dowel, transfer to pipecleaner). Children did not transfer their tool-making knowledge to the new material. Children retained tool-making knowledge over time and transferred their knowledge to new situations in which they needed to make a similar tool from similar materials, but not different materials. We concluded that children’s ability to use tool-making knowledge in novel situations is likely to depend on memory and analogical reasoning, with the latter continuing to develop during middle childhood. PMID:25538650
Is tool-making knowledge robust over time and across problems?
Directory of Open Access Journals (Sweden)
Sarah Ruth Beck
2014-12-01
Full Text Available In three studies, we explored the retention and transfer of tool-making knowledge, learnt from an adult demonstration, to other temporal and task contexts. All studies used a variation of a task in which children had to make a hook tool to retrieve a bucket from a tall transparent tube. Children who failed to innovate the hook tool independently saw a demonstration.In Study 1, we tested children aged 4 to 6 years (N = 53 who had seen the original demonstration 3 months earlier. Performance was excellent at the second time, indicating that children’s knowledge was retained over the 3 month period. In Studies 2 and 3 we explored transfer of the new knowledge to other tasks. In Study 2, children were given two variants of the apparatus that differed in surface characteristics (e.g. shape and colour. Participants generalised their knowledge to these new apparatuses even though the new pipecleaner also differed in size and colour. Five- to 6-year-olds (n = 22 almost always transferred their knowledge to problems where the same tool had to be made. Younger, 3- to 5-year-olds’ (n = 46, performance was more variable. In Study 3, 4- to 7-year-olds (N = 146 saw a demonstration of hook making with a pipecleaner, but then had to make a tool by combining pieces of wooden dowel (or vice versa: original training on dowel, transfer to pipecleaner. Children did not transfer their tool-making knowledge to the new material. Children retained tool-making knowledge over time and transferred their knowledge to new situations in which they needed to make a similar tool from similar materials, but not different materials. We concluded that children’s ability to use tool-making knowledge in novel situations is likely to depend on memory and analogical reasoning, with the latter continuing to develop during middle childhood.
International Nuclear Information System (INIS)
Shayeghi, H.; Hashemi, Y.
2014-01-01
Highlights: • Capability of wind farms is contributed in the problem of hybrid TNEM–RPM. • Inclusion of HFC as a novel and versatile device to implement hybrid TNEM–RPM. • INSGA-II optimization and FDM method is applied to specify the best solution. • Simulation study is conducted on the real power system of Iran. - Abstract: This paper addresses a mathematical model for solving transmission network expansion management (TNEM) associated with reactive power management (RPM) in the presence of double-fed induction generator (DFIG) variable speed wind turbine and hybrid flow controller (HFC). According to this plan, the reactive power capability of DFIG wind turbine is gained and the constraints of deliverable power are derived for each operation point. Strong control capability of the HFC with controlling bus voltage and line power flow offers a great potential for solving many of the problems facing electric utilities. For a precise steady-state analysis of HFC, the injection model is considered which it is an adaptive model in steady-state analysis. The main goals of the proposed management strategy are to minimize investment cost, real power loss cost in transmission lines and voltage deviation and maximize voltage stability index and social benefit at the same time. A three-stage scheme has been developed for solving hybrid TNEM–RPM problem. In the beginning of the plan, it is assumed that all the reactive demands are acquired from local sources and an optimal transmission plan is specified. After transmission lines are constructed, in the second step, reactive power sources will be allocated to weak buses. In order to assess reliability of the system, EENS criterion is used. Due to multi-objective nature of the proposed management method, an improved non-dominated sorting genetic algorithm-II (INSGA-II) style is applied for an optimization procedure. Also, a decision making method based on fuzzy decision making (FDM) is used for finding the best
Directory of Open Access Journals (Sweden)
J. Fabian Lopez
2010-01-01
Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.
Capacitated arc routing problem and its extensions in waste collection
International Nuclear Information System (INIS)
Fadzli, Mohammad; Najwa, Nurul; Luis, Martino
2015-01-01
Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time
Capacitated arc routing problem and its extensions in waste collection
Energy Technology Data Exchange (ETDEWEB)
Fadzli, Mohammad; Najwa, Nurul [Institut Matematik Kejuruteraan, Universiti Malaysia Perlis, Kampus Pauh Putra, 02600 Arau, Perlis (Malaysia); Luis, Martino [Othman Yeop Abdullah Graduate School of Business, Universiti Utara Malaysia, 06010 Sintok, Kedah (Malaysia)
2015-05-15
Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.
A Note on the Problem of Proper Time in Weyl Space-Time
Avalos, R.; Dahia, F.; Romero, C.
2018-02-01
We discuss the question of whether or not a general Weyl structure is a suitable mathematical model of space-time. This is an issue that has been in debate since Weyl formulated his unified field theory for the first time. We do not present the discussion from the point of view of a particular unification theory, but instead from a more general standpoint, in which the viability of such a structure as a model of space-time is investigated. Our starting point is the well known axiomatic approach to space-time given by Elhers, Pirani and Schild (EPS). In this framework, we carry out an exhaustive analysis of what is required for a consistent definition for proper time and show that such a definition leads to the prediction of the so-called "second clock effect". We take the view that if, based on experience, we were to reject space-time models predicting this effect, this could be incorporated as the last axiom in the EPS approach. Finally, we provide a proof that, in this case, we are led to a Weyl integrable space-time as the most general structure that would be suitable to model space-time.
Do job demands and job control affect problem-solving?
Bergman, Peter N; Ahlberg, Gunnel; Johansson, Gun; Stoetzer, Ulrich; Aborg, Carl; Hallsten, Lennart; Lundberg, Ingvar
2012-01-01
The Job Demand Control model presents combinations of working conditions that may facilitate learning, the active learning hypothesis, or have detrimental effects on health, the strain hypothesis. To test the active learning hypothesis, this study analysed the effects of job demands and job control on general problem-solving strategies. A population-based sample of 4,636 individuals (55% women, 45% men) with the same job characteristics measured at two times with a three year time lag was used. Main effects of demands, skill discretion, task authority and control, and the combined effects of demands and control were analysed in logistic regressions, on four outcomes representing general problem-solving strategies. Those reporting high on skill discretion, task authority and control, as well as those reporting high demand/high control and low demand/high control job characteristics were more likely to state using problem solving strategies. Results suggest that working conditions including high levels of control may affect how individuals cope with problems and that workplace characteristics may affect behaviour in the non-work domain.
Pet Problems at Home: Pet Problems in the Community.
Soltow, Willow
1984-01-01
Discusses problems of pets in the community, examining the community's role related to disruptive pets and pet overpopulation. Also discusses pet problems at home, offering advice on selecting a pet, meeting a pet's needs, and disciplining pets. Includes a list of books, films/filmstrips, teaching materials, and various instructional strategies.…
Energy Technology Data Exchange (ETDEWEB)
Tavassoli, A.A.
1986-10-01
Dislocation substructures formed in austenitic stainless steel 304L and 316L, fatigued at 673 K, 823 K and 873 K under total imposed strain ranges of 0.7 to 2.25%, and their correlation with mechanical properties have been investigated. In addition substructures formed at lower strain ranges have been examined using foils prepared from parts of the specimens with larger cross-sections. Investigation has also been extended to include the effect of intermittent hold-times up to 1.8 x 10/sup 4/s and sequential creep-fatigue and fatigue-creep. The experimental results obtained are analysed and their implications for current dislocation concepts and mechanical properties are discussed.
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
Directory of Open Access Journals (Sweden)
Étienne André
2010-10-01
Full Text Available We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation satisfying this constraint, the system behaves the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. Imitator II also implements the "behavioral cartography algorithm", allowing us to solve the following good parameters problem: find a set of valuations within a given bounded parametric domain for which the system behaves well. We present new features and optimizations of the tool, and give results of applications to various examples of asynchronous circuits and communication protocols.
Directory of Open Access Journals (Sweden)
Eduyn Ramiro Lopez Santana
2015-03-01
Full Text Available This paper attempts to solve the School Bus Routing Problem with Time Windows that consists of finding the best set of routes to pick up students distributed geographically with constraints as capacity, time windows and maximum travel time. We formulated the problem as a classic Vehicle Routing Problem with Time Windows and solved it using an approach based on a clustering algorithm and column generation method. A real world case from a school in Bogotá, Colombiais presented including 600 students to pick up in near 400 nodes located in urban and rural areas. The obtained results demonstrate a reduction as the problem’s complexity and an improvement on the performance measures of the proposed method.
Bibliography on moving boundary problems with key word index
International Nuclear Information System (INIS)
Wilson, D.G.; Solomon, A.D.; Trent, J.S.
1979-10-01
This bibliography concentrates mainly on time-dependent moving-boundary problems of heat and mass transfer. The bibliography is in two parts, a list of the references ordered by last name of the first author and a key word index to the titles. Few references from before 1965 are included
DEFF Research Database (Denmark)
Christensen, Knud Smed
2000-01-01
Describes fundamentals of parallel programming and a kernel for that. Describes methods for modelling and checking parallel problems. Real time problems.......Describes fundamentals of parallel programming and a kernel for that. Describes methods for modelling and checking parallel problems. Real time problems....
The triangle scheduling problem
Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard
2017-01-01
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to
Thermal shock problems in a plate
International Nuclear Information System (INIS)
Takeuti, Y.; Furukawa, T.
1981-01-01
The problems considered are coupled dynamic thermoelastic analysis in a plate. First we try to examine a problem of the coupled dynamic thermal stress problem with small time approximation for the finite region. Next, we treatise both effects individually by pursuing rigorous anaylsis without small time approximation. Finally we consider thermal shock problems in a plate against different values of heat transfer coefficient (Biot's number) for the time. In conclusion, for usual materials, the inertia effect may be disregarded in the pure thermal problems in contrast to the coupling effect which brings small lags in the temperature and thermal stress distributions. For the consideration of the maximum thermal stress problems, Manson's uncoupled quasi-static results give enough approximation to the thermal shock problems without significant error from our numerical results. The analysis is developed by the use of Laplace transforms and several useful graphical illustrations are given. (orig./HP)
Braß, Peter
2011-04-01
In this paper we study several instances of the aligned k-center problem where the goal is, given a set of points S in the plane and a parameter k ≥ 1, to find k disks with centers on a line ℓ such that their union covers S and the maximum radius of the disks is minimized. This problem is a constrained version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, or a polygon. We first consider the simplest version of the problem where the line ℓ is given in advance; we can solve this problem in time O(n log2 n). In the case where only the direction of ℓ is fixed, we give an O(n2 log 2 n)-time algorithm. When ℓ is an arbitrary line, we give a randomized algorithm with expected running time O(n4 log2 n). Then we present (1+ε)-approximation algorithms for these three problems. When we denote T(k, ε) = (k/ε2+(k/ε) log k) log(1/ε), these algorithms run in O(n log k + T(k, ε)) time, O(n log k + T(k, ε)/ε) time, and O(n log k + T(k, ε)/ε2) time, respectively. For k = O(n1/3/log n), we also give randomized algorithms with expected running times O(n + (k/ε2) log(1/ε)), O(n+(k/ε3) log(1/ε)), and O(n + (k/ε4) log(1/ε)), respectively. © 2011 World Scientific Publishing Company.
The problem of criticality and initial-value problem in neutron transport theory
International Nuclear Information System (INIS)
Kyncl, J.
1984-10-01
The problem of criticality and the initial value problem are studied in the case of a linear Boltzmann equation and of both finite and infinite media. The space of functions where the problems are solved is chosen in such a way as to cover a wide range of physical situations. The asymptotic time behavior of the solution to the initial-value problem is also discussed, and main results are summarized in three basic theorems. (author)
Directory of Open Access Journals (Sweden)
Jose Bernal
2017-10-01
Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.
Problems of the orthogonalized plane wave method. 1
International Nuclear Information System (INIS)
Farberovich, O.V.; Kurganskii, S.I.; Domashevskaya, E.P.
1979-01-01
The main problems of the orthogonalized plane wave method are discussed including (a) consideration of core states; (b) effect of overlap of wave functions of external core states upon the band structure; (c) calculation of d-type states. The modified orthogonal plane wave method (MOPW method) of Deegan and Twose is applied in a general form to solve the problems of the usual OPW method. For the first time the influence on the spectrum of the main parameters of the MOPW method is studied systematically by calculating the electronic energy spectrum in the transition metals Nb and V. (author)
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
Directory of Open Access Journals (Sweden)
Basar Ogun
2018-05-01
Full Text Available Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of customer orders in the environment of lean manufacturing. The problem is to optimize partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components. Design/methodology/approach: Three different mathematical models for minimization of total earliness and tardiness of customer orders are developed to provide on-time completion of customer orders and also, to avoid from inventory of final products. The first model is a non-linear integer programming model while the second is a linearized version of the first. Finally, to solve larger sized instances of the problem, an alternative linear integer model is presented. Findings: Computational study using a suit set of test instances showed that the alternative linear integer model is able to solve all test instances in varying sizes within quite shorter computer times comparing to the other two models. It was also showed that the alternative model can solve moderate sized real-world problems. Originality/value: The problem under study differentiates from existing batch scheduling problems in the literature since it includes new circumstances which may arise in real-world applications. This research, also, contributes the literature of batch scheduling problem by presenting new optimization models.
Negriff, Sonya; Hillman, Jennifer, B.; Dorn, Lorah D.
2011-01-01
Purpose To examine separate mediational models linking a) menarcheal status or b) pubertal timing to internalizing and externalizing problems through competence. Method Cross-sectional analyses of 262 adolescent girls (11–17 years; M=14.93, SD=2.17) enrolled in a longitudinal study examining the association of psychological functioning and smoking with reproductive and bone health. Measures of menarcheal status (pre/post), pubertal timing (early, on-time, or late), internalizing and externalizing behavior, and perceived competence (parent and adolescent report) were obtained. Structural Equation Modeling was used for analyses. Results Perceived competence was found to fully mediate the association between menarcheal status and parent report of internalizing and externalizing problems. For adolescent report, there was a full mediation effect for internalizing problems but a partial mediation effect for externalizing problems. Being menarcheal was related to lower competence which was related to higher internalizing and externalizing problems. Models including pubertal timing were not significant. Conclusions Perceived competence is important in understanding the associations between menarcheal status and internalizing and externalizing problems. Interventions targeting competence, particularly in post-menarcheal girls, may reduce or prevent problem behaviors. PMID:21939864
The pickup and delivery problem with cross-docking opportunity
DEFF Research Database (Denmark)
Petersen, Hanne Løhmann; Røpke, Stefan
2011-01-01
delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using...
Bibliography on moving boundary problems with key word index
Energy Technology Data Exchange (ETDEWEB)
Wilson, D.G.; Solomon, A.D.; Trent, J.S.
1979-10-01
This bibliography concentrates mainly on time-dependent moving-boundary problems of heat and mass transfer. The bibliography is in two parts, a list of the references ordered by last name of the first author and a key word index to the titles. Few references from before 1965 are included. (RWR)
DEFF Research Database (Denmark)
Ju, Suquan; Clausen, Jens
2004-01-01
The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different component types to a consumer in batches. The task is to determine the cycle time, i.e. that time between deliveries, which minimizes the total cost per time unit. This incl......The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different component types to a consumer in batches. The task is to determine the cycle time, i.e. that time between deliveries, which minimizes the total cost per time unit....... This includes the determination of the production sequence of the component types within each cycle. We investigate the computational behavior of two published algorithms, a heuristic and an optimal algorithm. With large number of component types, the optimal algorithm has long running times. We devise a hybrid...
Finite-Time Stability and Controller Design of Continuous-Time Polynomial Fuzzy Systems
Directory of Open Access Journals (Sweden)
Xiaoxing Chen
2017-01-01
Full Text Available Finite-time stability and stabilization problem is first investigated for continuous-time polynomial fuzzy systems. The concept of finite-time stability and stabilization is given for polynomial fuzzy systems based on the idea of classical references. A sum-of-squares- (SOS- based approach is used to obtain the finite-time stability and stabilization conditions, which include some classical results as special cases. The proposed conditions can be solved with the help of powerful Matlab toolbox SOSTOOLS and a semidefinite-program (SDP solver. Finally, two numerical examples and one practical example are employed to illustrate the validity and effectiveness of the provided conditions.
Psychosocial work factors and sleep problems: findings from the French national SIP survey.
Chazelle, Emilie; Chastang, Jean-François; Niedhammer, Isabelle
2016-04-01
This study aimed at exploring the cross-sectional and prospective associations between psychosocial work factors and sleep problems. The study population consisted of a national representative sample of the French working population (SIP survey). The sample sizes were 7506 and 3555 for the cross-sectional and prospective analyses. Sleep problems were defined by either sleep disturbances or insufficient sleep duration at least several times a week. Psychosocial work factors included classical (job strain model factors) and emergent factors (recognition, insecurity, role/ethical conflict, emotional demands, work-life imbalance, etc.). Occupational factors related to working time/hours and physical work environment were also included as well as covariates related to factors outside work. Statistical analyses were performed using weighted Poisson regression analysis. In the cross-sectional analyses, psychological demands, low social support, low recognition, emotional demands, perception of danger, work-life imbalance and night work were found to be associated with sleep problems. In the prospective analyses, psychological demands and night work were predictive of sleep problems. Using a less conservative method, more factors were found to be associated with sleep problems. Dose-response associations were observed, showing that the more frequent the exposure to these factors, the higher the risk of sleep problems. No effect of repeated exposure was found on sleep problems. Classical and emergent psychosocial work factors were associated with sleep problems. More prospective studies and prevention policies may be needed.
Strategic Management in Times of Crisis
Groh, Maximilian
2014-01-01
This aim of this article is to identify unusual strategic-management matters in times of crisis. The research scope is strategic management processes, the characteristics of the processes and methods of strategic crisis management. The study reports research on the contemporary state of strategic crisis-management problems and provides an analysis of some theoretical and methodological principles. The analysis includes a classification of the main problems which must be solved for efficient, ...
Feder, Tomá s; Motwani, Rajeev
2009-01-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Pathgroups, a dynamic data structure for genome reconstruction problems.
Zheng, Chunfang
2010-07-01
Ancestral gene order reconstruction problems, including the median problem, quartet construction, small phylogeny, guided genome halving and genome aliquoting, are NP hard. Available heuristics dedicated to each of these problems are computationally costly for even small instances. We present a data structure enabling rapid heuristic solution to all these ancestral genome reconstruction problems. A generic greedy algorithm with look-ahead based on an automatically generated priority system suffices for all the problems using this data structure. The efficiency of the algorithm is due to fast updating of the structure during run time and to the simplicity of the priority scheme. We illustrate with the first rapid algorithm for quartet construction and apply this to a set of yeast genomes to corroborate a recent gene sequence-based phylogeny. http://albuquerque.bioinformatics.uottawa.ca/pathgroup/Quartet.html chunfang313@gmail.com Supplementary data are available at Bioinformatics online.
Alcohol use and policy formation: an evolving social problem.
Levine, Amir
2012-01-01
This article explores the evolutionary course that the social problem of alcohol use has taken in the United States since the Colonial Era. This article utilizes a range of theoretical models to analyze the evolving nature of alcohol use from an unrecognized to a perceived social problem. The models used include critical constructionism (Heiner, 2002), top-down policy model (Dye, 2001) and Mauss'(1975) understanding of social problems and movements. These theoretical constructs exhibit the relative nature of alcohol use as a social problem in regards to a specific time, place, and social context as well as the powerful and influential role that social elites have in defining alcohol asa social problem. Studies regarding the development of alcohol policy formation are discussed to illuminate the different powers, constituents, and factors that play a role in alcohol policy formation.Finally, implications for future study are discussed [corrected].
Cassidy, Jack
1991-01-01
Presents suggestions for teaching math word problems to elementary students. The strategies take into consideration differences between reading in math and reading in other areas. A problem-prediction game and four self-checking activities are included along with a magic password challenge. (SM)
Boundary element methods applied to two-dimensional neutron diffusion problems
International Nuclear Information System (INIS)
Itagaki, Masafumi
1985-01-01
The Boundary element method (BEM) has been applied to two-dimensional neutron diffusion problems. The boundary integral equation and its discretized form have been derived. Some numerical techniques have been developed, which can be applied to critical and fixed-source problems including multi-region ones. Two types of test programs have been developed according to whether the 'zero-determinant search' or the 'source iteration' technique is adopted for criticality search. Both programs require only the fluxes and currents on boundaries as the unknown variables. The former allows a reduction in computing time and memory in comparison with the finite element method (FEM). The latter is not always efficient in terms of computing time due to the domain integral related to the inhomogeneous source term; however, this domain integral can be replaced by the equivalent boundary integral for a region with a non-multiplying medium or with a uniform source, resulting in a significant reduction in computing time. The BEM, as well as the FEM, is well suited for solving irregular geometrical problems for which the finite difference method (FDM) is unsuited. The BEM also solves problems with infinite domains, which cannot be solved by the ordinary FEM and FDM. Some simple test calculations are made to compare the BEM with the FEM and FDM, and discussions are made concerning the relative merits of the BEM and problems requiring future solution. (author)
Orthopaedic Timing in Polytrauma in a Second Level Emergency Hospital. An Overrated Problem?
V, Dei Giudici; N, Giampaolini; A, Panfighi; M, Marinelli; R, Procaccini; A, Gigante
2015-01-01
The main concern for orthopaedic treatment in polytrauma has always been the same for almost forty years, which also regards “where” and “when” to proceed; correct surgical timing and correct interpretation of the DCO concept are still being debated. In the last few years, several attempts have been made to classify patients based on their clinical presentation and by trying to figure out which vital parameters are able to predict the patient’s outcome. This study evaluated all patients who presented with code red at the Emergency Department of our Hospital, a level II trauma center. For every patient, the following characteristics were noted: sex, age, day of hospitalization, orthopaedic trauma, time to surgery, presence of an associated surgical condition in the fields of general surgery, thoracic surgery, neurosurgery and vascular surgery, cardiac frequency, blood pressure, oxygen saturation, Glasgow Coma Scale and laboratory data. All patients included were divided into subgroups based on orthopaedic surgical timing. Two other subgroups were also identified and analyzed in detail: deceased and weekend traumas. A total of 208 patients were included. Our primary goal was to identify a correlation between the mortality and surgical timing of the orthopaedic procedures; our secondary goal was to recognize, if present, a statistically relevant association between historical, clinical and laboratory data, and mortality rate, defining any possible risk factor. A correlation between mortality and orthopaedic surgical timing was not found. Analyzing laboratory data revealed an interesting correlation between mortality and: blood pressure, platelet count, cardiac frequency, hematocrit, hemoglobin and age. PMID:26312113
Efstratiadis, Andreas; Tsoukalas, Ioannis; Kossieris, Panayiotis; Karavokiros, George; Christofides, Antonis; Siskos, Alexandros; Mamassis, Nikos; Koutsoyiannis, Demetris
2015-04-01
Modelling of large-scale hybrid renewable energy systems (HRES) is a challenging task, for which several open computational issues exist. HRES comprise typical components of hydrosystems (reservoirs, boreholes, conveyance networks, hydropower stations, pumps, water demand nodes, etc.), which are dynamically linked with renewables (e.g., wind turbines, solar parks) and energy demand nodes. In such systems, apart from the well-known shortcomings of water resources modelling (nonlinear dynamics, unknown future inflows, large number of variables and constraints, conflicting criteria, etc.), additional complexities and uncertainties arise due to the introduction of energy components and associated fluxes. A major difficulty is the need for coupling two different temporal scales, given that in hydrosystem modeling, monthly simulation steps are typically adopted, yet for a faithful representation of the energy balance (i.e. energy production vs. demand) a much finer resolution (e.g. hourly) is required. Another drawback is the increase of control variables, constraints and objectives, due to the simultaneous modelling of the two parallel fluxes (i.e. water and energy) and their interactions. Finally, since the driving hydrometeorological processes of the integrated system are inherently uncertain, it is often essential to use synthetically generated input time series of large length, in order to assess the system performance in terms of reliability and risk, with satisfactory accuracy. To address these issues, we propose an effective and efficient modeling framework, key objectives of which are: (a) the substantial reduction of control variables, through parsimonious yet consistent parameterizations; (b) the substantial decrease of computational burden of simulation, by linearizing the combined water and energy allocation problem of each individual time step, and solve each local sub-problem through very fast linear network programming algorithms, and (c) the substantial
Finite element methods for incompressible flow problems
John, Volker
2016-01-01
This book explores finite element methods for incompressible flow problems: Stokes equations, stationary Navier-Stokes equations, and time-dependent Navier-Stokes equations. It focuses on numerical analysis, but also discusses the practical use of these methods and includes numerical illustrations. It also provides a comprehensive overview of analytical results for turbulence models. The proofs are presented step by step, allowing readers to more easily understand the analytical techniques.
Directory of Open Access Journals (Sweden)
Meiqiang Feng
2009-01-01
Full Text Available By constructing available upper and lower solutions and combining the Schauder's fixed point theorem with maximum principle, this paper establishes sufficient and necessary conditions to guarantee the existence of Cld[0,1]𝕋 as well as CldΔ[0,1]𝕋 positive solutions for a class of singular boundary value problems on time scales. The results significantly extend and improve many known results for both the continuous case and more general time scales. We illustrate our results by one example.
How to solve mathematical problems
Wickelgren, Wayne A
1995-01-01
Seven problem-solving techniques include inference, classification of action sequences, subgoals, contradiction, working backward, relations between problems, and mathematical representation. Also, problems from mathematics, science, and engineering with complete solutions.
Problem behaviors of children adopted from the former Soviet Union.
McGuinness, Teena M; Pallansch, Leona
2007-01-01
Although current meta-analyses of problem behavior of internationally adopted children exist, few children adopted from the former Soviet Union have been included in these reports. A significant concern is that 13 children adopted from the former Soviet Union have died at the hands of their American adoptive parents since 1996. A cohort of 105 children adopted from the former Soviet Union has been assessed at two points in time by telephone and postal surveys to measure the impact of risk and protective factors on problem behavior. Pre-adoptive risk factors have declined in importance (except for birth weight) and protective factors (operationalized as aspects of family environment) have increased in influence over time. Problem behavior scores declined slightly at Time 2, despite the children having entered adolescence. Families play a significant role in the behavior of children adopted from the former Soviet Union. Nurses should counsel families to shape the child's environment during the transition from orphanage to homes in the United States, especially for children who are low birth weight.
Marriage work in older couples: Disclosure of marital problems to spouses and friends over time.
Jensen, Jakob F; Rauer, Amy J
2015-10-01
This study examined the frequency and impact of "marriage work" (MW), or the act of discussing marital problems with spouses and friends, among a sample of older married couples (N = 64). Using actor-partner interdependence models, we examined how turning to one's spouse and one's friend was linked to changes in both spouses' marital satisfaction and conflict 1 year later. We also investigated whether satisfaction and conflict predicted change in MW for older spouses. Both wives and husbands engaged in more MW with spouses than with friends, and only husbands' MW with spouses decreased over time. Wives' MW with spouses was associated with decreased marital satisfaction for husbands, whereas husbands' MW with spouses was linked with increased satisfaction for husbands. Furthermore, wives' MW with spouses predicted increases in wives' marital conflict over time. When examining effects in the opposite direction, wives' marital satisfaction predicted decreases in wives' MW with spouse. Husbands' satisfaction was linked with increases in wives' MW with spouses, increases in wives' MW with friends, and decreases in husbands' MW with friends. Finally, husbands' conflict predicted increases in husbands' MW with friends. Findings suggest that openly engaging in discussions of marital problems may not be as uniformly helpful for aging couples as it is for their younger counterparts. Given that many older adults tend to actively avoid conflictual interactions in an attempt to maximize emotional rewards, researchers and clinicians should note that traditional approaches to working through romantic conflict may not be ideal for aging couples. (c) 2015 APA, all rights reserved).
Effects of computing time delay on real-time control systems
Shin, Kang G.; Cui, Xianzhong
1988-01-01
The reliability of a real-time digital control system depends not only on the reliability of the hardware and software used, but also on the speed in executing control algorithms. The latter is due to the negative effects of computing time delay on control system performance. For a given sampling interval, the effects of computing time delay are classified into the delay problem and the loss problem. Analysis of these two problems is presented as a means of evaluating real-time control systems. As an example, both the self-tuning predicted (STP) control and Proportional-Integral-Derivative (PID) control are applied to the problem of tracking robot trajectories, and their respective effects of computing time delay on control performance are comparatively evaluated. For this example, the STP (PID) controller is shown to outperform the PID (STP) controller in coping with the delay (loss) problem.
RKC time-stepping for advection-diffusion-reaction problems
International Nuclear Information System (INIS)
Verwer, J.G.; Sommeijer, B.P.; Hundsdorfer, W.
2004-01-01
The original explicit Runge-Kutta-Chebyshev (RKC) method is a stabilized second-order integration method for pure diffusion problems. Recently, it has been extended in an implicit-explicit manner to also incorporate highly stiff reaction terms. This implicit-explicit RKC method thus treats diffusion terms explicitly and the highly stiff reaction terms implicitly. The current paper deals with the incorporation of advection terms for the explicit method, thus aiming at the implicit-explicit RKC integration of advection-diffusion-reaction equations in a manner that advection and diffusion terms are treated simultaneously and explicitly and the highly stiff reaction terms implicitly
Directory of Open Access Journals (Sweden)
Gökçen Uysal
2018-03-01
Full Text Available Optimal control of reservoirs is a challenging task due to conflicting objectives, complex system structure, and uncertainties in the system. Real time control decisions suffer from streamflow forecast uncertainty. This study aims to use Probabilistic Streamflow Forecasts (PSFs having a lead-time up to 48 h as input for the recurrent reservoir operation problem. A related technique for decision making is multi-stage stochastic optimization using scenario trees, referred to as Tree-based Model Predictive Control (TB-MPC. Deterministic Streamflow Forecasts (DSFs are provided by applying random perturbations on perfect data. PSFs are synthetically generated from DSFs by a new approach which explicitly presents dynamic uncertainty evolution. We assessed different variables in the generation of stochasticity and compared the results using different scenarios. The developed real-time hourly flood control was applied to a test case which had limited reservoir storage and restricted downstream condition. According to hindcasting closed-loop experiment results, TB-MPC outperforms the deterministic counterpart in terms of decreased downstream flood risk according to different independent forecast scenarios. TB-MPC was also tested considering different number of tree branches, forecast horizons, and different inflow conditions. We conclude that using synthetic PSFs in TB-MPC can provide more robust solutions against forecast uncertainty by resolution of uncertainty in trees.
The co phylogeny reconstruction problem is NP-complete.
Ovadia, Y; Fielder, D; Conow, C; Libeskind-Hadas, R
2011-01-01
The co phylogeny reconstruction problem is that of finding minimum cost explanations of differences between historical associations. The problem arises in parasitology, molecular systematics, and biogeography. Existing software tools for this problem either have worst-case exponential time or use heuristics that do not guarantee optimal solutions. To date, no polynomial time optimal algorithms have been found for this problem. In this article, we prove that the problem is NP-complete, suggesting that future research on algorithms for this problem should seek better polynomial-time approximation algorithms and heuristics rather than optimal solutions.
Design and Optimization of Capacitated Supply Chain Networks Including Quality Measures
Directory of Open Access Journals (Sweden)
Krystel K. Castillo-Villar
2014-01-01
Full Text Available This paper presents (1 a novel capacitated model for supply chain network design which considers manufacturing, distribution, and quality costs (named SCND-COQ model and (2 five combinatorial optimization methods, based on nonlinear optimization, heuristic, and metaheuristic approaches, which are used to solve realistic instances of practical size. The SCND-COQ model is a mixed-integer nonlinear problem which can be used at a strategic planning level to design a supply chain network that maximizes the total profit subject to meeting an overall quality level of the final product at minimum costs. The SCND-COQ model computes the quality-related costs for the whole supply chain network considering the interdependencies among business entities. The effectiveness of the proposed solution approaches is shown using numerical experiments. These methods allow solving more realistic (capacitated supply chain network design problems including quality-related costs (inspections, rework, opportunity costs, and others within a reasonable computational time.
Obesity as political and theoretical problem
Directory of Open Access Journals (Sweden)
Đurković Miša
2012-01-01
Full Text Available Spread of obesity and diseases that it causes brought to justified warnings of an epidemic. Author starts from classical liberal differentiation between self regarding and others regarding acts, and then raises the issue of the possible liberal approach to obesity problem. He presents real causes of the obesity, and proceeds with two different visions of contemporary liberalism: one, abstract, which doesn't pay attention to context in which we have to draw the line between self and others regarding acts, and second, advanced, responsible liberalism of contemporary liberal democratic state which cares a lot about the context, including international one. From the first perspective state would be obliged not to interfere in overweight problems of its citizens. From the second it would be forced to do so for many substantial reasons. Although author justifies right and even duty of the state to deal with obesity problem, he insists that for the time being it is mostly reacting in wrong way: since idea of individual autonomy is not perceived in adequate way, state reacts to the consequences and not to the causes of the problem.
Problems Experienced by Ovarian Cancer Survivors During Treatment.
Keim-Malpass, Jessica; Mihalko, Shannon L; Russell, Greg; Case, Doug; Miller, Brigitte; Avis, Nancy E
To identify problems at different treatment points (early treatment, mid-treatment, early posttreatment, and late posttreatment) among women with ovarian cancer. Longitudinal and cross-sectional study design. An academic and community clinical cancer center in the Southeastern United States. Sixty-eight women with Stage I to IV ovarian cancer. Variables assessed included reported problems (physical, psychosocial, pain, marital, medical interaction), social support, optimism, and responses to open-ended questions. Analysis involved mixed models for longitudinal repeated measures and unpaired t tests and content analysis to describe responses to open-ended questions. Physical and psychosocial problems were greatest during early treatment and decreased throughout the treatment trajectory. Women with greater levels of social support and optimism at baseline had fewer problems over time. Women who did not have trouble paying for basics had fewer problems related to pain and psychological problems. Problems across all domains must be addressed throughout the treatment trajectory, even after chemotherapy has ended. Nurses are well positioned to refer women appropriately to social workers and clinical navigators across all domains of care and should consider systematic assessment of patient-reported problems as a routine form of practice. Copyright © 2017 AWHONN, the Association of Women's Health, Obstetric and Neonatal Nurses. Published by Elsevier Inc. All rights reserved.
Neumann, Rebecca B; Cardon, Zoe G; Teshera-Levye, Jennifer; Rockwell, Fulton E; Zwieniecki, Maciej A; Holbrook, N Michele
2014-04-01
The movement of water from moist to dry soil layers through the root systems of plants, referred to as hydraulic redistribution (HR), occurs throughout the world and is thought to influence carbon and water budgets and ecosystem functioning. The realized hydrologic, biogeochemical and ecological consequences of HR depend on the amount of redistributed water, whereas the ability to assess these impacts requires models that correctly capture HR magnitude and timing. Using several soil types and two ecotypes of sunflower (Helianthus annuus L.) in split-pot experiments, we examined how well the widely used HR modelling formulation developed by Ryel et al. matched experimental determination of HR across a range of water potential driving gradients. H. annuus carries out extensive night-time transpiration, and although over the last decade it has become more widely recognized that night-time transpiration occurs in multiple species and many ecosystems, the original Ryel et al. formulation does not include the effect of night-time transpiration on HR. We developed and added a representation of night-time transpiration into the formulation, and only then was the model able to capture the dynamics and magnitude of HR we observed as soils dried and night-time stomatal behaviour changed, both influencing HR. © 2013 John Wiley & Sons Ltd.
Hajipour, Mojtaba; Jajarmi, Amin
2018-02-01
Using the Pontryagin's maximum principle for a time-delayed optimal control problem results in a system of coupled two-point boundary-value problems (BVPs) involving both time-advance and time-delay arguments. The analytical solution of this advance-delay two-point BVP is extremely difficult, if not impossible. This paper provides a discrete general form of the numerical solution for the derived advance-delay system by applying a finite difference θ-method. This method is also implemented for the infinite-time horizon time-delayed optimal control problems by using a piecewise version of the θ-method. A matrix formulation and the error analysis of the suggested technique are provided. The new scheme is accurate, fast and very effective for the optimal control of linear and nonlinear time-delay systems. Various types of finite- and infinite-time horizon problems are included to demonstrate the accuracy, validity and applicability of the new technique.
Financial Times Global Pharmaceutical & Biotechnology Conference 2009.
Scattereggia, Jennifer
2010-01-01
The Financial Times Global Pharmaceutical & Biotechnology conference, held in London, included topics covering the current and future challenges confronting the pharma and biotech industry, and presented possible solutions to those challenges. This conference report highlights selected presentations on the industry challenges for big pharma companies, diversification as a solution to industry problems, overcoming challenges with collaborations and M&As, and the role of emerging markets in the pharma industry. Other subjects discussed included the expected impact of personalized medicine on the industry, the entry of big pharma into the generics market and the problems that are confronting the small pharma and biotech industry.
Time-dependent deterministic transport on parallel architectures using PARTISN
International Nuclear Information System (INIS)
Alcouffe, R.E.; Baker, R.S.
1998-01-01
In addition to the ability to solve the static transport equation, the authors have also incorporated time dependence into the parallel S N code PARTISN. Using a semi-implicit scheme, PARTISN is capable of performing time-dependent calculations for both fissioning and pure source driven problems. They have applied this to various types of problems such as shielding and prompt fission experiments. This paper describes the form of the time-dependent equations implemented, their solution strategies in PARTISN including iteration acceleration, and the strategies used for time-step control. Results are presented for a iron-water shielding calculation and a criticality excursion in a uranium solution configuration
Long, James D.
Schools need to meet unique problems through the development of special classroom management techniques. Factors which contribute to classroom problems include lack of supervision at home, broken homes, economic deprivation, and a desire for peer attention. The educational atmosphere should encourage creativity for both the student and the…
Population Problem In Egypt As One of The Priority Health Problems ...
African Journals Online (AJOL)
In last decades, Egypt had suffered major socioeconomic consequences of population problem. This had resulted from the high levels of birth rates and the steady decline in death rates and so, a widened demographic gap. Management of population problem of Egypt included: Economic development, developing new ...
Unsolved problems in biology--The state of current thinking.
Dev, Sukhendu B
2015-03-01
Many outstanding problems have been solved in biology and medicine for which scientists have been awarded prestigious prizes including the Nobel Prize, Lasker Award and Breakthrough Prizes in life sciences. These have been the fruits of years of basic research. From time to time, publications have appeared listing "unsolved" problems in biology. In this article, I ask the question whether it is possible to have such a list, if not a unique one, at least one that is analogous to the Millennium Prize in mathematics. My approach to finding an answer to this question was to gather views of leading biologists. I have also included my own views. Analysis of all the responses received over several years has convinced me that it is difficult, but not impossible, to have such a prize. Biology is complex and very interdisciplinary these days at times involving large numbers of teams, unlike mathematics, where Andrew Wiles spent seven years in complete isolation and secrecy solving Fermat's last theorem. Such an approach is simply not possible in biology. Still I would like to suggest that a similar prize can be established by a panel of distinguished scientists. It would be awarded to those who solved one of the listed problems in biology that warrant a verifiable solution. Despite many different opinions, I found that there is some commonality in the responses I received - I go on to discuss what these are and how they may impact future thinking. Copyright © 2015 Elsevier Ltd. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo
2017-07-01
We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.
International Nuclear Information System (INIS)
Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo
2017-01-01
We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.
Ghezavati, V. R.; Beigi, M.
2016-12-01
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among established facilities and existing demand points. In this paper, the location-routing problem with time window (LRPTW) and homogeneous fleet type and designing a multi-echelon, and capacitated reverse logistics network, are considered which may arise in many real-life situations in logistics management. Our proposed RL network consists of hybrid collection/inspection centers, recovery centers and disposal centers. Here, we present a new bi-objective mathematical programming (BOMP) for LRPTW in reverse logistic. Since this type of problem is NP-hard, the non-dominated sorting genetic algorithm II (NSGA-II) is proposed to obtain the Pareto frontier for the given problem. Several numerical examples are presented to illustrate the effectiveness of the proposed model and algorithm. Also, the present work is an effort to effectively implement the ɛ-constraint method in GAMS software for producing the Pareto-optimal solutions in a BOMP. The results of the proposed algorithm have been compared with the ɛ-constraint method. The computational results show that the ɛ-constraint method is able to solve small-size instances to optimality within reasonable computing times, and for medium-to-large-sized problems, the proposed NSGA-II works better than the ɛ-constraint.
Directory of Open Access Journals (Sweden)
T. S. Kasatkina
2015-01-01
Full Text Available Terminal control problem with fixed finite time for the second order affine systems with state constraints is considered. A solution of such terminal problem is suggested for the systems with scalar control of regular canonical form.In this article it is shown that the initial terminal problem is equivalent to the problem of auxiliary function search. This function should satisfy some conditions. Such function design consists of two stages. The first stage includes search of function which corresponds the solution of the terminal control problem without state constraints. This function is designed as polynom of the fifth power which depends on time variable. Coefficients of the polynom are defined by boundary conditions. The second stage includes modification of designed function if corresponding to that function trajectory is not satisfied constraints. Modification process is realized by adding to the current function supplementary polynom. Influence of that polynom handles by variation of a parameter value. Modification process can include a few iterations. After process termination continuous control is found. This control is the solution of the initial terminal prUsing presented scheme the terminal control problem for system, which describes oscillations of the mathematical pendulum, is solved. This approach can be used for the solution of terminal control problems with state constraints for affine systems with multi-dimensional control.
Directory of Open Access Journals (Sweden)
Gh. Assadipour
2012-01-01
Full Text Available
ENGLISH ABSTRACT:The trade-off between time, cost, and quality is one of the important problems of project management. This problem assumes that all project activities can be executed in different modes of cost, time, and quality. Thus a manager should select each activity’s mode such that the project can meet the deadline with the minimum possible cost and the maximum achievable quality. As the problem is NP-hard and the objectives are in conflict with each other, a multi-objective meta-heuristic called CellDE, which is a hybrid cellular genetic algorithm, is implemented as the optimisation method. The proposed algorithm provides project managers with a set of non-dominated or Pareto-optimal solutions, and enables them to choose the best one according to their preferences. A set of problems of different sizes is generated and solved using the proposed algorithm. Three metrics are employed for evaluating the performance of the algorithm, appraising the diversity and convergence of the achieved Pareto fronts. Finally a comparison is made between CellDE and another meta-heuristic available in the literature. The results show the superiority of CellDE.
AFRIKAANSE OPSOMMING: ‘n Balans tussen tyd, koste en gehalte is een van die belangrike probleme van projekbestuur. Die vraagstuk maak gewoonlik die aanname dat alle projekaktiwiteite uitgevoer kan word op uiteenlopende wyses wat verband hou met koste, tyd en gehalte. ‘n Projekbestuurder selekteer gewoonlik die uitvoeringsmetodes sodanig per aktiwiteit dat gehoor gegegee word aan minimum koste en maksimum gehalte teen die voorwaarde van voltooiingsdatum wat bereik moet word.
Aangesien die beskrewe problem NP-hard is, word dit behandel ten opsigte van konflikterende doelwitte met ‘n multidoelwit metaheuristiese metode (CellDE. Die metode is ‘n hibride-sellulêre genetiese algoritme. Die algoritme lewer aan die besluitvormer ‘n versameling van ongedomineerde of Pareto
Solving the dial-a-ride problem using agent-based simulation
Directory of Open Access Journals (Sweden)
Campbell, Ian
2016-11-01
Full Text Available The ‘dial-a-ride problem’ (DARP requires a set of customers to be transported by a limited fleet of vehicles between unique origins and destinations under several service constraints, including within defined time windows. The problem is considered NP-hard, and has typically been solved using metaheuristic methods. An agent-based simulation (ABS model was developed, where each vehicle bids to service customers based on a weighted objective function that considers the cost to service the customer and the time quality of the service that would be achieved. The approach applied a pre- processing technique to reduce the search space, given the service time window constraints. Tests of the model showed significantly better customer transit and waiting times than the benchmark datasets. The ABS was able to obtain solutions for much larger problem sizes than the benchmark solutions, with this work being the first known application of ABS to the DARP.
International Nuclear Information System (INIS)
Magae, J.; Furukawa, C.; Kawakami, Y.; Hoshi, Y.; Ogata, H.
2003-01-01
Full text: Because biological responses to radiation are complex processes dependent on irradiation time as well as total dose, it is necessary to include dose, dose-rate and irradiation time simultaneously to predict the risk of low dose-rate irradiation. In this study, we analyzed quantitative relationship among dose, irradiation time and dose-rate, using chromosomal breakage and proliferation inhibition of human cells. For evaluation of chromosome breakage we assessed micronuclei induced by radiation. U2OS cells, a human osteosarcoma cell line, were exposed to gamma-ray in irradiation room bearing 50,000 Ci 60 Co. After the irradiation, they were cultured for 24 h in the presence of cytochalasin B to block cytokinesis, cytoplasm and nucleus were stained with DAPI and propidium iodide, and the number of binuclear cells bearing micronuclei was determined by fluorescent microscopy. For proliferation inhibition, cells were cultured for 48 h after the irradiation and [3H] thymidine was pulsed for 4 h before harvesting. Dose-rate in the irradiation room was measured with photoluminescence dosimeter. While irradiation time less than 24 h did not affect dose-response curves for both biological responses, they were remarkably attenuated as exposure time increased to more than 7 days. These biological responses were dependent on dose-rate rather than dose when cells were irradiated for 30 days. Moreover, percentage of micronucleus-forming cells cultured continuously for more than 60 days at the constant dose-rate, was gradually decreased in spite of the total dose accumulation. These results suggest that biological responses at low dose-rate, are remarkably affected by exposure time, that they are dependent on dose-rate rather than total dose in the case of long-term irradiation, and that cells are getting resistant to radiation after the continuous irradiation for 2 months. It is necessary to include effect of irradiation time and dose-rate sufficiently to evaluate risk
Real-time systems scheduling fundamentals
Chetto, Maryline
2014-01-01
Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc. Scheduling is a central problem for these computing/communication systems since responsible of software execution in a timely manner. This book provides state of knowledge in this domain with special emphasis on the key results obtained within the last decade. This book addresses foundations as well as the latest advances and findings in Real-Time Scheduling, giving all references to important papers. But nevertheless the chapters will be short and not overloaded with confusing details.
Directory of Open Access Journals (Sweden)
Wen-Xiang Wu
2014-01-01
Full Text Available The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.
Florida State Legislature, Tallahassee. Office of Program Policy Analysis and Government Accountability.
The Florida legislature has passed several reforms designed to shorten the time it takes students to obtain their degrees. Although the reforms have produced benefits, some articulation problems continue. The problems include the following: (1) One in five (20%) AA transfer students take a semester or more of lower division courses at a…
DEFF Research Database (Denmark)
Skovhus, Randi Boelskifte; Thomsen, Rie
2017-01-01
This article introduces a method to critical reviews and explores the ways in which problems have been formulated in knowledge production on career guidance in Denmark over a 10-year period from 2004 to 2014. The method draws upon the work of Bacchi focussing on the ‘What's the problem represented...... to be’ (WPR) approach. Forty-nine empirical studies on Danish youth career guidance were included in the study. An analysis of the issues in focus resulted in nine problem categories. One of these, ‘targeting’, is analysed using the WPR approach. Finally, the article concludes that the WPR approach...... provides a constructive basis for a critical analysis and discussion of the collective empirical knowledge production on career guidance, stimulating awareness of problems and potential solutions among the career guidance community....
Lectures on nonlinear evolution equations initial value problems
Racke, Reinhard
2015-01-01
This book mainly serves as an elementary, self-contained introduction to several important aspects of the theory of global solutions to initial value problems for nonlinear evolution equations. The book employs the classical method of continuation of local solutions with the help of a priori estimates obtained for small data. The existence and uniqueness of small, smooth solutions that are defined for all values of the time parameter are investigated. Moreover, the asymptotic behavior of the solutions is described as time tends to infinity. The methods for nonlinear wave equations are discussed in detail. Other examples include the equations of elasticity, heat equations, the equations of thermoelasticity, Schrödinger equations, Klein-Gordon equations, Maxwell equations and plate equations. To emphasize the importance of studying the conditions under which small data problems offer global solutions, some blow-up results are briefly described. Moreover, the prospects for corresponding initial-boundary value p...
Clique inequalities applied to the vehicle routing problem with time windows
DEFF Research Database (Denmark)
Spoorendonk, Simon; Desaulniers, Guy
2010-01-01
criterion applied in the pricing algorithm, which is a labeling algorithm for solving resource-constrained elementary shortest path problems. The idea of using cutting planes defined on the master problem variables for the VRPTW has been recently developed: Chva´tal-Gomory rank-1 cuts were applied. However......, to our knowledge, this is a first attempt at incorporating for the VRPTW a set of valid inequalities specialized for the set partitioning polytope. Computational results show that the use of clique inequalities improves the lower bound at the root node of the search tree and reduces the number of nodes...
An optimization based method for line planning to minimize travel time
DEFF Research Database (Denmark)
Bull, Simon Henry; Lusby, Richard Martin; Larsen, Jesper
2015-01-01
The line planning problem is to select a number of lines from a potential pool which provides sufficient passenger capacity and meets operational requirements, with some objective measure of solution line quality. We model the problem of minimizing the average passenger system time, including...
Directory of Open Access Journals (Sweden)
Paul van den Akker
2010-12-01
Full Text Available Paul van den Akker, Looking for Lines: Theories of the Essence of Art and the Problem of Mannerism, Amsterdam: Amsterdam University Press 2010 including preface, contents and introduction.
Combined Approach of PNN and Time-Frequency as the Classifier for Power System Transient Problems
Directory of Open Access Journals (Sweden)
Aslam Pervez Memon
2013-04-01
Full Text Available The transients in power system cause serious disturbances in the reliability, safety and economy of the system. The transient signals possess the nonstationary characteristics in which the frequency as well as varying time information is compulsory for the analysis. Hence, it is vital, first to detect and classify the type of transient fault and then to mitigate them. This article proposes time-frequency and FFNN (Feedforward Neural Network approach for the classification of power system transients problems. In this work it is suggested that all the major categories of transients are simulated, de-noised, and decomposed with DWT (Discrete Wavelet and MRA (Multiresolution Analysis algorithm and then distinctive features are extracted to get optimal vector as input for training of PNN (Probabilistic Neural Network classifier. The simulation results of proposed approach prove their simplicity, accurateness and effectiveness for the automatic detection and classification of PST (Power System Transient types
Yost, Gail
1995-01-01
Adolescence has in recent decades gained attention as being salient for study of social trends. Increases in youth social problems are seen nationally, statewide, and locally. They include substance abuse, precocious sexual activity, related consequences of pregnancy and STDs, suicide and depression, truancy, running away, crime against property, and violent crime against persons. This study integrates three major explanatory theories of adolescent behavior into a macro-synthesis. R. Jesser's...
Benchmark problems for repository siting models
International Nuclear Information System (INIS)
Ross, B.; Mercer, J.W.; Thomas, S.D.; Lester, B.H.
1982-12-01
This report describes benchmark problems to test computer codes used in siting nuclear waste repositories. Analytical solutions, field problems, and hypothetical problems are included. Problems are included for the following types of codes: ground-water flow in saturated porous media, heat transport in saturated media, ground-water flow in saturated fractured media, heat and solute transport in saturated porous media, solute transport in saturated porous media, solute transport in saturated fractured media, and solute transport in unsaturated porous media
Exponential time paradigms through the polynomial time lens
Drucker, A.; Nederlof, J.; Santhanam, R.; Sankowski, P.; Zaroliagis, C.
2016-01-01
We propose a general approach to modelling algorithmic paradigms for the exact solution of NP-hard problems. Our approach is based on polynomial time reductions to succinct versions of problems solvable in polynomial time. We use this viewpoint to explore and compare the power of paradigms such as
El-Amin, Mohamed
2017-11-23
In this article, we consider a two-phase immiscible incompressible flow including nanoparticles transport in fractured heterogeneous porous media. The system of the governing equations consists of water saturation, Darcy’s law, nanoparticles concentration in water, deposited nanoparticles concentration on the pore-wall, and entrapped nanoparticles concentration in the pore-throat, as well as, porosity and permeability variation due to the nanoparticles deposition/entrapment on/in the pores. The discrete-fracture model (DFM) is used to describe the flow and transport in fractured porous media. Moreover, multiscale time-splitting strategy has been employed to manage different time-step sizes for different physics, such as saturation, concentration, etc. Numerical examples are provided to demonstrate the efficiency of the proposed multi-scale time splitting approach.
El-Amin, Mohamed; Kou, Jisheng; Sun, Shuyu
2017-01-01
In this article, we consider a two-phase immiscible incompressible flow including nanoparticles transport in fractured heterogeneous porous media. The system of the governing equations consists of water saturation, Darcy’s law, nanoparticles concentration in water, deposited nanoparticles concentration on the pore-wall, and entrapped nanoparticles concentration in the pore-throat, as well as, porosity and permeability variation due to the nanoparticles deposition/entrapment on/in the pores. The discrete-fracture model (DFM) is used to describe the flow and transport in fractured porous media. Moreover, multiscale time-splitting strategy has been employed to manage different time-step sizes for different physics, such as saturation, concentration, etc. Numerical examples are provided to demonstrate the efficiency of the proposed multi-scale time splitting approach.
Friedman, Robert S.; Deek, Fadi P.
2002-01-01
Discusses how the design and implementation of problem-solving tools used in programming instruction are complementary with both the theories of problem-based learning (PBL), including constructivism, and the practices of distributed education environments. Examines how combining PBL, Web-based distributed education, and a problem-solving…
Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution
Kurnia, Hari; Gustri Wahyuni, Elyza; Cergas Pembrani, Elang; Gardini, Syifa Tri; Kurnia Aditya, Silfa
2018-03-01
The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Salesman Problem). These problems can be modeled using the Vehicle Routing Problem (VRP) algorithm with rating ranking, a cross order based crossing, and also order based mutation mutations on selected chromosomes. This study uses limitations using only 20 market points, 2 point warehouse (multi compartment) and 5 vehicles. It is determined that for one distribution, one vehicle can only distribute to 4 market points only from 1 particular warehouse, and also one such vehicle can only accommodate 100 kg capacity.
Adams, Wendy Kristine
The purpose of my research was to produce a problem solving evaluation tool for physics. To do this it was necessary to gain a thorough understanding of how students solve problems. Although physics educators highly value problem solving and have put extensive effort into understanding successful problem solving, there is currently no efficient way to evaluate problem solving skill. Attempts have been made in the past; however, knowledge of the principles required to solve the subject problem are so absolutely critical that they completely overshadow any other skills students may use when solving a problem. The work presented here is unique because the evaluation tool removes the requirement that the student already have a grasp of physics concepts. It is also unique because I picked a wide range of people and picked a wide range of tasks for evaluation. This is an important design feature that helps make things emerge more clearly. This dissertation includes an extensive literature review of problem solving in physics, math, education and cognitive science as well as descriptions of studies involving student use of interactive computer simulations, the design and validation of a beliefs about physics survey and finally the design of the problem solving evaluation tool. I have successfully developed and validated a problem solving evaluation tool that identifies 44 separate assets (skills) necessary for solving problems. Rigorous validation studies, including work with an independent interviewer, show these assets identified by this content-free evaluation tool are the same assets that students use to solve problems in mechanics and quantum mechanics. Understanding this set of component assets will help teachers and researchers address problem solving within the classroom.
Teaching problem solving: Don't forget the problem solver(s)
Ranade, Saidas M.; Corrales, Angela
2013-05-01
The importance of intrapersonal and interpersonal intelligences has long been known but educators have debated whether to and how to incorporate those topics in an already crowded engineering curriculum. In 2010, the authors used the classroom as a laboratory to observe the usefulness of including selected case studies and exercises from the fields of neurology, artificial intelligence, cognitive sciences and social psychology in a new problem-solving course. To further validate their initial findings, in 2012, the authors conducted an online survey of engineering students and engineers. The main conclusion is that engineering students will benefit from learning more about the impact of emotions, culture, diversity and cognitive biases when solving problems. Specifically, the work shows that an augmented problem-solving curriculum needs to include lessons on labelling emotions and cognitive biases, 'evidence-based' data on the importance of culture and diversity and additional practice on estimating conditional probability.
Parallel Simulation of Three-Dimensional Free Surface Fluid Flow Problems
International Nuclear Information System (INIS)
BAER, THOMAS A.; SACKINGER, PHILIP A.; SUBIA, SAMUEL R.
1999-01-01
Simulation of viscous three-dimensional fluid flow typically involves a large number of unknowns. When free surfaces are included, the number of unknowns increases dramatically. Consequently, this class of problem is an obvious application of parallel high performance computing. We describe parallel computation of viscous, incompressible, free surface, Newtonian fluid flow problems that include dynamic contact fines. The Galerkin finite element method was used to discretize the fully-coupled governing conservation equations and a ''pseudo-solid'' mesh mapping approach was used to determine the shape of the free surface. In this approach, the finite element mesh is allowed to deform to satisfy quasi-static solid mechanics equations subject to geometric or kinematic constraints on the boundaries. As a result, nodal displacements must be included in the set of unknowns. Other issues discussed are the proper constraints appearing along the dynamic contact line in three dimensions. Issues affecting efficient parallel simulations include problem decomposition to equally distribute computational work among a SPMD computer and determination of robust, scalable preconditioners for the distributed matrix systems that must be solved. Solution continuation strategies important for serial simulations have an enhanced relevance in a parallel coquting environment due to the difficulty of solving large scale systems. Parallel computations will be demonstrated on an example taken from the coating flow industry: flow in the vicinity of a slot coater edge. This is a three dimensional free surface problem possessing a contact line that advances at the web speed in one region but transitions to static behavior in another region. As such, a significant fraction of the computational time is devoted to processing boundary data. Discussion focuses on parallel speed ups for fixed problem size, a class of problems of immediate practical importance
Implementering Run-time Evaluation of Distributed Timing Constraints in a Micro Kernel
DEFF Research Database (Denmark)
Kristensen, C.H.; Drejer, N.; Nielsen, Jens Frederik Dalsgaard
In the present paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems......In the present paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems...
Inverse problems for the Boussinesq system
International Nuclear Information System (INIS)
Fan, Jishan; Jiang, Yu; Nakamura, Gen
2009-01-01
We obtain two results on inverse problems for a 2D Boussinesq system. One is that we prove the Lipschitz stability for the inverse source problem of identifying a time-independent external force in the system with observation data in an arbitrary sub-domain over a time interval of the velocity and the data of velocity and temperature at a fixed positive time t 0 > 0 over the whole spatial domain. The other one is that we prove a conditional stability estimate for an inverse problem of identifying the two initial conditions with a single observation on a sub-domain
Time Series Modelling using Proc Varmax
DEFF Research Database (Denmark)
Milhøj, Anders
2007-01-01
In this paper it will be demonstrated how various time series problems could be met using Proc Varmax. The procedure is rather new and hence new features like cointegration, testing for Granger causality are included, but it also means that more traditional ARIMA modelling as outlined by Box...
Iterative methods for tomography problems: implementation to a cross-well tomography problem
Karadeniz, M. F.; Weber, G. W.
2018-01-01
The velocity distribution between two boreholes is reconstructed by cross-well tomography, which is commonly used in geology. In this paper, iterative methods, Kaczmarz’s algorithm, algebraic reconstruction technique (ART), and simultaneous iterative reconstruction technique (SIRT), are implemented to a specific cross-well tomography problem. Convergence to the solution of these methods and their CPU time for the cross-well tomography problem are compared. Furthermore, these three methods for this problem are compared for different tolerance values.
Efficient numerical methods for the large-scale, parallel solution of elastoplastic contact problems
Frohne, Jö rg; Heister, Timo; Bangerth, Wolfgang
2015-01-01
© 2016 John Wiley & Sons, Ltd. Quasi-static elastoplastic contact problems are ubiquitous in many industrial processes and other contexts, and their numerical simulation is consequently of great interest in accurately describing and optimizing production processes. The key component in these simulations is the solution of a single load step of a time iteration. From a mathematical perspective, the problems to be solved in each time step are characterized by the difficulties of variational inequalities for both the plastic behavior and the contact problem. Computationally, they also often lead to very large problems. In this paper, we present and evaluate a complete set of methods that are (1) designed to work well together and (2) allow for the efficient solution of such problems. In particular, we use adaptive finite element meshes with linear and quadratic elements, a Newton linearization of the plasticity, active set methods for the contact problem, and multigrid-preconditioned linear solvers. Through a sequence of numerical experiments, we show the performance of these methods. This includes highly accurate solutions of a three-dimensional benchmark problem and scaling our methods in parallel to 1024 cores and more than a billion unknowns.
Efficient numerical methods for the large-scale, parallel solution of elastoplastic contact problems
Frohne, Jörg
2015-08-06
© 2016 John Wiley & Sons, Ltd. Quasi-static elastoplastic contact problems are ubiquitous in many industrial processes and other contexts, and their numerical simulation is consequently of great interest in accurately describing and optimizing production processes. The key component in these simulations is the solution of a single load step of a time iteration. From a mathematical perspective, the problems to be solved in each time step are characterized by the difficulties of variational inequalities for both the plastic behavior and the contact problem. Computationally, they also often lead to very large problems. In this paper, we present and evaluate a complete set of methods that are (1) designed to work well together and (2) allow for the efficient solution of such problems. In particular, we use adaptive finite element meshes with linear and quadratic elements, a Newton linearization of the plasticity, active set methods for the contact problem, and multigrid-preconditioned linear solvers. Through a sequence of numerical experiments, we show the performance of these methods. This includes highly accurate solutions of a three-dimensional benchmark problem and scaling our methods in parallel to 1024 cores and more than a billion unknowns.
Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times
Directory of Open Access Journals (Sweden)
Jan-Yee Kung
2013-01-01
Full Text Available Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.
Stepanov, F. I.
2018-04-01
The mechanical properties of a material which is modeled by an exponential creep kernel characterized by a spectrum of relaxation and retardation times are studied. The research is carried out considering a contact problem for a solid indenter sliding over a viscoelastic half-space. The contact pressure, indentation depth of the indenter, and the deformation component of the friction coefficient are analyzed with respect to the case of half-space material modeled by single relaxation and retardation times.
MARTONFFY, ANDREA PONTECORVO; AND OTHERS
A CURRICULUM GUIDE IS PRESENTED FOR A 10-WEEK STUDY OF ANCIENT GREEK CIVILIZATION AT THE 10TH-GRADE LEVEL. TEACHING MATERIALS FOR THE UNIT INCLUDE (1) PRIMARY AND SECONDARY SOURCES DEALING WITH THE PERIOD FROM THE BRONZE AGE THROUGH THE HELLENISTIC PERIOD, (2) GEOGRAPHY PROBLEMS, AND (3) CULTURAL MODEL PROBLEM EXERCISES. THOSE CONCEPTS WITH WHICH…
DEFF Research Database (Denmark)
Olsen, Poul Bitsch; Pedersen, Nils Kaare
This book is meant to support problem-oriented learning activities. Problem-orientation concerns the reasoning about lack of knowledge, while project work includes the ethnomethods that are practiced when collectives produce scientific knowledge. This book reflects particular methods related...
Directory of Open Access Journals (Sweden)
Maite Frutos-Pascual
2014-01-01
Full Text Available Attention Deficit with Hyperactivity Disorder (ADHD is one of the most prevalent disorders within the child population today. Inattention problems can lead to greater difficulties in completing assignments, as well as problems with time management and prioritisation of tasks. This article presents an intelligent tele-therapy tool based on Serious Games for Health, aimed at the improvement of time management skills and the prioritisation of tasks. This tele-system is based on the use of decision trees within Django, a high-level Python Web framework. The technologies and techniques used were selected so as to boost user involvement and to enable the system to be easily customised. This article shows the preliminary results of the pilot-phase in an experiment performed to evaluate the use of adaptive tele-therapies within a group of typically developing children and adolescents aged between 12 and 19 years old without ADHD. To do so, we relied on the collection of parameters and the conduct of surveys for assessing time management skills, as well as measuring system usability and availability. The results of a time management survey highlighted that the users involved in the trial did not use any specific or effective time management techniques, scoring 1.98 and 2.30 out of 5 points in this area for ages under 15 and over 16 years old, respectively. The final calculations based on the usability questionnaire resulted in an average score of 78.75 out of 100. The creation of a customisable tool capable of working with different skills, in conjunction with the replication of the current study, may help to understand these users’ needs, as well as boosting time management skills among teenagers with and without ADHD.
Frutos-Pascual, Maite; Zapirain, Begoña García; Zorrilla, Amaia Méndez
2014-01-07
Attention Deficit with Hyperactivity Disorder (ADHD) is one of the most prevalent disorders within the child population today. Inattention problems can lead to greater difficulties in completing assignments, as well as problems with time management and prioritisation of tasks. This article presents an intelligent tele-therapy tool based on Serious Games for Health, aimed at the improvement of time management skills and the prioritisation of tasks. This tele-system is based on the use of decision trees within Django, a high-level Python Web framework. The technologies and techniques used were selected so as to boost user involvement and to enable the system to be easily customised. This article shows the preliminary results of the pilot-phase in an experiment performed to evaluate the use of adaptive tele-therapies within a group of typically developing children and adolescents aged between 12 and 19 years old without ADHD. To do so, we relied on the collection of parameters and the conduct of surveys for assessing time management skills, as well as measuring system usability and availability. The results of a time management survey highlighted that the users involved in the trial did not use any specific or effective time management techniques, scoring 1.98 and 2.30 out of 5 points in this area for ages under 15 and over 16 years old, respectively. The final calculations based on the usability questionnaire resulted in an average score of 78.75 out of 100. The creation of a customisable tool capable of working with different skills, in conjunction with the replication of the current study, may help to understand these users' needs, as well as boosting time management skills among teenagers with and without ADHD.
Frutos-Pascual, Maite; García Zapirain, Begoña; Méndez Zorrilla, Amaia
2014-01-01
Attention Deficit with Hyperactivity Disorder (ADHD) is one of the most prevalent disorders within the child population today. Inattention problems can lead to greater difficulties in completing assignments, as well as problems with time management and prioritisation of tasks. This article presents an intelligent tele-therapy tool based on Serious Games for Health, aimed at the improvement of time management skills and the prioritisation of tasks. This tele-system is based on the use of decision trees within Django, a high-level Python Web framework. The technologies and techniques used were selected so as to boost user involvement and to enable the system to be easily customised. This article shows the preliminary results of the pilot-phase in an experiment performed to evaluate the use of adaptive tele-therapies within a group of typically developing children and adolescents aged between 12 and 19 years old without ADHD. To do so, we relied on the collection of parameters and the conduct of surveys for assessing time management skills, as well as measuring system usability and availability. The results of a time management survey highlighted that the users involved in the trial did not use any specific or effective time management techniques, scoring 1.98 and 2.30 out of 5 points in this area for ages under 15 and over 16 years old, respectively. The final calculations based on the usability questionnaire resulted in an average score of 78.75 out of 100. The creation of a customisable tool capable of working with different skills, in conjunction with the replication of the current study, may help to understand these users’ needs, as well as boosting time management skills among teenagers with and without ADHD. PMID:24402063
Time Discretization Techniques
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.
Social balance as a satisfiability problem of computer science.
Radicchi, Filippo; Vilone, Daniele; Yoon, Sooeyon; Meyer-Ortmanns, Hildegard
2007-02-01
Reduction of frustration was the driving force in an approach to social balance as it was recently considered by Antal [T. Antal, P. L. Krapivsky, and S. Redner, Phys. Rev. E 72, 036121 (2005)]. We generalize their triad dynamics to k-cycle dynamics for arbitrary integer k. We derive the phase structure, determine the stationary solutions, and calculate the time it takes to reach a frozen state. The main difference in the phase structure as a function of k is related to k being even or odd. As a second generalization we dilute the all-to-all coupling as considered by Antal to a random network with connection probability wcomputer science. The phase of social balance in our original interpretation then becomes the phase of satisfaction of all logical clauses in the satisfiability problem. In common to the cases we study, the ideal solution without any frustration always exists, but the question actually is as to whether this solution can be found by means of a local stochastic algorithm within a finite time. The answer depends on the choice of parameters. After establishing the mapping between the two classes of models, we generalize the social-balance problem to a diluted network topology for which the satisfiability problem is usually studied. On the other hand, in connection with the satisfiability problem we generalize the random local algorithm to a p-random local algorithm, including a parameter p that corresponds to the propensity parameter in the social balance problem. The qualitative effect of the inclusion of this parameter is a bias towards the optimal solution and a reduction of the needed simulation time.
Evaluating Distributed Timing Constraints
DEFF Research Database (Denmark)
Kristensen, C.H.; Drejer, N.
1994-01-01
In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems.......In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems....
Directory of Open Access Journals (Sweden)
Shihuang Hong
2009-01-01
Full Text Available We present sufficient conditions for the existence of at least twin or triple positive solutions of a nonlinear four-point singular boundary value problem with a p-Laplacian dynamic equation on a time scale. Our results are obtained via some new multiple fixed point theorems.
International Nuclear Information System (INIS)
Derafshian, Mehdi; Amjady, Nima
2015-01-01
This paper presents an evolutionary algorithm-based approach for optimal design of power system stabilizer (PSS) for multi-machine power systems that include doubly fed induction generator wind turbines. The proposed evolutionary algorithm is an improved particle swarm optimization named chaotic particle swarm optimization with passive congregation (CPSO-PC) applied for finding the optimal settings of PSS parameters. Two different eigenvalue-based objectives are combined as the objective function for the optimization problem of tuning PSS parameters. The first objective function comprises the damping factor of lightly damped electro-mechanical modes and the second one includes the damping ratio of these modes. The effectiveness of the proposed method to design PSS for the power systems including DFIG (Doubly Fed Induction Generator) is extensively demonstrated through eigenvalue analysis and time-domain simulations and also by comparing its simulation results with the results of other heuristic optimization approaches. - Highlights: • A new optimization model for design of PSS in power systems including DFIG is proposed. • A detailed and realistic modeling of DFIG is presented. • A new evolutionary algorithm is suggested for solving the optimization problem of designing PSS
Real-time laser holographic interferometry for aerodynamics
International Nuclear Information System (INIS)
Lee, G.
1987-01-01
Recent developments in thermoplastic recording holograms and advancements in automated image digitalization and analysis make real-time laser holographic interferometry feasible for two-dimensional flows such as airfoil flows. Typical airfoil measurements would include airfoil pressure distributions, wake and boundary layer profiles, and flow field density contours. This paper addresses some of the problems and requirements of a real-time laser holographic interferometer. 13 references
Mechanics problems in undergraduate physics
Strelkov, S P
2013-01-01
Problems in Undergraduate Physics, Volume I: Mechanics focuses on solutions to problems in physics. The book first discusses the fundamental problems in physics. Topics include laws of conservation of momentum and energy; dynamics of a point particle in circular motion; dynamics of a rotating rigid body; hydrostatics and aerostatics; and acoustics. The text also offers information on solutions to problems in physics. Answers to problems in kinematics, statics, gravity, elastic deformations, vibrations, and hydrostatics and aerostatics are discussed. Solutions to problems related to the laws of
Global Optimization of Nonlinear Blend-Scheduling Problems
Directory of Open Access Journals (Sweden)
Pedro A. Castillo Castillo
2017-04-01
Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.
Wang, Jing-Jy; Lo, Chi-Hui Kao; Ku, Ya-Lie
2004-11-01
A set of problem solving strategies integrated into nursing process in nursing core courses (PSNP) was developed for students enrolled in a post-RN baccalaureate nursing program (RN-BSN) in a university in Taiwan. The purpose of this study, therefore, was to evaluate the effectiveness of PSNP on students' clinical problem solving abilities. The one-group post-test design with repeated measures was used. In total 114 nursing students with 47 full-time students and 67 part-time students participated in this study. The nursing core courses were undertaken separately in three semesters. After each semester's learning, students would start their clinical practice, and were asked to submit three written nursing process recordings during each clinic. Assignments from the three practices were named post-test I, II, and III sequentially, and provided the data for this study. The overall score of problem solving indicated that score on the post-test III was significantly better than that on post-test I and II, meaning both full-time and part-time students' clinical problem solving abilities improved at the last semester. In conclusion, problem-solving strategies integrated into nursing process designed for future RN-BSN students are recommendable.
International Nuclear Information System (INIS)
Scaramuzzino, F.
2009-01-01
This paper considers a qualitative analysis of the solution of a pure exchange general economic equilibrium problem according to two independent parameters. Some recently results obtained by the author in the static and the dynamic case have been collected. Such results have been applied in a particular parametric case: it has been focused the attention on a numerical application for which the existence of the solution of time-depending parametric variational inequality that describes the equilibrium conditions has been proved by means of the direct method. By using MatLab computation after a linear interpolation, the curves of equilibrium have been visualized.
The Solution of Large Time-Dependent Problems Using Reduced Coordinates.
1987-06-01
numerical intergration schemes for dynamic problems, the algorithm known as Newmark’s Method. The behavior of the Newmark scheme, as well as the basic...T’he horizontal displacements at the mid-height and the bottom of the buildin- are shown in f igure 4. 13. The solution history illustrated is for a