WorldWideScience

Sample records for optimal time window

  1. Optimizing Time Windows For Managing Export Container Arrivals At Chinese Container Terminals

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen

    2010-01-01

    window management programme that is widely used in Chinese terminals to facilitate terminal and truck delivery operations. Firstly, the arrangement of time windows is assumed to follow the principle of minimizing transport costs. A cost function is defined that includes the costs of truck and driver...... waiting time, fuel consumption associated with truck idling, storage time of the containerized cargos and yard fee. Secondly, to minimize the total cost, a heuristic is developed based on a genetic algorithm to find a near optimal time window arrangement. The optimized solution involves the position...

  2. Optimizing Time Windows For Managing Export Container Arrivals At Chinese Container Terminals

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen

    2010-01-01

    waiting time, fuel consumption associated with truck idling, storage time of the containerized cargos and yard fee. Secondly, to minimize the total cost, a heuristic is developed based on a genetic algorithm to find a near optimal time window arrangement. The optimized solution involves the position......Management of truck transport in a port area is important for Chinese container ports as heavy traffic congestion not only limits the terminal capacity but also generates serious air pollution. This paper explores an effective way to manage the truck traffic of export containers based on a time...... and the length of each time window. Finally, the model and the heuristic are tested using real data from a Chinese container terminal, and the result indicates that optimization of the time window can effectively flatten the peak traffic of export container trucks - one of the primary causes of road traffic...

  3. Optimization of ramp area aircraft push back time windows in the presence of uncertainty

    Science.gov (United States)

    Coupe, William Jeremy

    It is well known that airport surface traffic congestion at major airports is responsible for increased taxi-out times, fuel burn and excess emissions and there is potential to mitigate these negative consequences through optimizing airport surface traffic operations. Due to a highly congested voice communication channel between pilots and air traffic controllers and a data communication channel that is used only for limited functions, one of the most viable near-term strategies for improvement of the surface traffic is issuing a push back advisory to each departing aircraft. This dissertation focuses on the optimization of a push back time window for each departing aircraft. The optimization takes into account both spatial and temporal uncertainties of ramp area aircraft trajectories. The uncertainties are described by a stochastic kinematic model of aircraft trajectories, which is used to infer distributions of combinations of push back times that lead to conflict among trajectories from different gates. The model is validated and the distributions are included in the push back time window optimization. Under the assumption of a fixed taxiway spot schedule, the computed push back time windows can be integrated with a higher level taxiway scheduler to optimize the flow of traffic from the gate to the departure runway queue. To enable real-time decision making the computational time of the push back time window optimization is critical and is analyzed throughout.

  4. Optimizing Ship Speed to Minimize Total Fuel Consumption with Multiple Time Windows

    Directory of Open Access Journals (Sweden)

    Jae-Gon Kim

    2016-01-01

    Full Text Available We study the ship speed optimization problem with the objective of minimizing the total fuel consumption. We consider multiple time windows for each port call as constraints and formulate the problem as a nonlinear mixed integer program. We derive intrinsic properties of the problem and develop an exact algorithm based on the properties. Computational experiments show that the suggested algorithm is very efficient in finding an optimal solution.

  5. Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    H. Nazif

    2010-01-01

    Full Text Available Problem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. The objective is to find routes for the vehicles to service all the customers at a minimal cost without violating the capacity and travel time constraints of the vehicles and the time window constraints set by the customers. Approach: We proposed a genetic algorithm using an optimized crossover operator designed by a complete undirected bipartite graph that finds an optimal set of delivery routes satisfying the requirements and giving minimal total cost. Various techniques have also been introduced into the proposed algorithm to further enhance the solutions quality. Results: We tested our algorithm with benchmark instances and compared it with some other heuristics in the literature. The results showed that the proposed algorithm is competitive in terms of the quality of the solutions found. Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. From the results, it can be concluded that the proposed algorithm is competitive when compared with other heuristics in the literature.

  6. Genetic Algorithm for Mulicriteria Optimization of a Multi-Pickup and Delivery Problem with Time Windows

    CERN Document Server

    Dridi, Imen Harbaoui; Ksouri, Mekki; Borne, Pierre

    2010-01-01

    In This paper we present a genetic algorithm for mulicriteria optimization of a multipickup and delivery problem with time windows (m-PDPTW). The m-PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. This paper purposes a brief literature review of the PDPTW, present an approach based on genetic algorithms and Pareto dominance method to give a set of satisfying solutions to the m-PDPTW minimizing total travel cost, total tardiness time and the vehicles number.

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

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

    Directory of Open Access Journals (Sweden)

    Qingyou Yan

    2015-01-01

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

  9. Multirunway Optimization Schedule of Airport Based on Improved Genetic Algorithm by Dynamical Time Window

    Directory of Open Access Journals (Sweden)

    Hang Zhou

    2015-01-01

    Full Text Available Reasonable airport runway scheduling is an effective measure to alleviate air traffic congestion. This paper proposes a new model and algorithm for flight scheduling. Considering the factors such as operating conditions and flight safety interval, the runway throughput, flight delays cost, and controller workload composes a multiobjective optimization model. The genetic algorithm combined with sliding time window algorithm is used to solve the model proposed in this paper. Simulation results show that the algorithm presented in this paper gets the optimal results, the runway throughput is increased by 12.87%, the delay cost is reduced by 61.46%, and the controller workload is also significantly reduced compared with FCFS (first come first served. Meanwhile, compared with the general genetic algorithm, it also reduces the time complexity and improves real-time and work efficiency significantly. The analysis results can provide guidance for air traffic controllers to make better air traffic control.

  10. Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows

    CERN Document Server

    Dridi, Imen Harbaoui; Borne, Pierre; Ksouri, Mekki

    2011-01-01

    The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.

  11. Manufacturing Supply Chain Optimization Problem with Time Windows Based on Improved Orthogonal Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xinhua

    2006-01-01

    Aim to the manufacturing supply chain optimization problem with time windows, presents an improved orthogonal genetic algorithm to solve it. At first, we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion, with the distribution algorithm driving the routing algorithm. At second, we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally, the examples suggest that this proposed approach is feasible, correct and valid.

  12. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

    Science.gov (United States)

    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.

  13. An optimization algorithm for a capacitated vehicle routing problem with time windows

    Indian Academy of Sciences (India)

    PINAR KIRCI

    2016-05-01

    In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity andworking hours. Recently, cost and on-time delivery are the most important actors in logistics. Thus, the logistic applications attract attention of companies. In logistic management, determining the locations of delivery points and deciding the path are the vital components that should be considered. Deciding the paths of vehicles provides companies to use their vehicles efficiently. And with utilizing optimized paths, big amounts of cost and time savings will be gained. The main aim of the work is providing the best path according to the needs of the customers, minimizing the costs with utilizing the VRP and presenting an application for companies that need logistic management. To compare the results, simulated annealing is used on special scenarios. And t-test is performed in the study for the visited path in km with p-value of 0.05.

  14. A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

    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.

  15. OPTIMIZING TIME WINDOWS FOR MANAGING ARRIVALS OF EXPORT CONTAINERS AT CHINESE CONTAINER TERMINALS

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen

    2009-01-01

    window management programme that is widely used in Chinese terminals to facilitate the terminal operations and the truck delivery operations. Firstly, the arrangement of time windows is assumed to follow the principle of minimizing the transport costs. A cost function is defined that includes the cost...

  16. Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows

    Directory of Open Access Journals (Sweden)

    Gang Du

    2017-02-01

    Full Text Available As a new service model, home health care can provide effective health care by adopting door-to-door service. The reasonable arrangements for nurses and their routes not only can reduce medical expenses, but also can enhance patient satisfaction. This research focuses on the home health care scheduling optimization problem with known demands and service capabilities. Aimed at minimizing the total cost, an integer programming model was built in this study, which took both the priorities of patients and constraints of time windows into consideration. The genetic algorithm with local search was used to solve the proposed model. Finally, a case study of Shanghai, China, was conducted for the empirical analysis. The comparison results verify the effectiveness of the proposed model and methodology, which can provide the decision support for medical administrators of home health care.

  17. Online Vision as a Function of Real-Time Limb Velocity: Another Case for Optimal Windows.

    Science.gov (United States)

    Kennedy, Andrew; Bhattacharjee, Arindam; Hansen, Steve; Reid, Connor; Tremblay, Luc

    2015-01-01

    The efficiency of online visuomotor processes was investigated by manipulating vision based on real-time upper limb velocity. Participants completed rapid reaches under two control (full vision, no vision) and three experimental visual window conditions. The experimental visual windows were early: 0.8-1.4 m/s, middle: above 1.4 m/s, and late: 1.4 to 0.8 m/s. The results indicated that endpoint consistency comparable to that of full-vision trials was observed when using vision from the early (43 ms) and middle (89 ms) windows, but vision from the middle window entailed a longer deceleration phase (i.e., a temporal cost). The late window was not useful to implement online trajectory amendments. This study provides further support for the idea of early visuomotor control, which may involve multiple online control processes during voluntary movement.

  18. A cloud theory-based particle swarm optimization for multiple decision maker vehicle routing problems with fuzzy random time windows

    Science.gov (United States)

    Ma, Yanfang; Xu, Jiuping

    2015-06-01

    This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.

  19. Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations

    OpenAIRE

    2015-01-01

    Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). This paper first proposes a new time-discretized multi-commodity network flow model for the VRPPDTW based on the integration of vehicles carrying states within space-time transportation networks, so as to allow a joint optimization of passenger-to-vehicle assignment and turn-by-turn routing in congested tr...

  20. Optimization of Ramp Area Aircraft Push Back Time Windows in the Presence of Uncertainty

    OpenAIRE

    Coupe, William Jeremy

    2017-01-01

    It is well known that airport surface traffic congestion at major airports is responsible for increased taxi-out times, fuel burn and excess emissions and there is potential to mitigate these negative consequences through optimizing airport surface traffic operations. Due to a highly congested voice communication channel between pilots and air traffic controllers and a data communication channel that is used only for limited functions, one of the most viable near-term strategies for improveme...

  1. Managing customer arrivals with time windows

    DEFF Research Database (Denmark)

    Chen, Gang; Jiang, Liping

    2016-01-01

    Due to increasing container traffic and mega-ships, many seaports face challenges of huge amounts of truck arrivals and congestion problem at terminal gates, which affect port efficiency and generate serious air pollution. To solve this congestion problem, we propose a solution of managing truck...... arrivals with time windows based on the truck-vessel service relationship, specifically trucks delivering containers for the same vessel share one common time window. Time windows can be optimized with different strategies. In this paper, we first propose a framework for installing this solution...

  2. Computing an optimal time window of audiovisual integration in focused attention tasks: illustrated by studies on effect of age and prior knowledge.

    Science.gov (United States)

    Colonius, Hans; Diederich, Adele

    2011-07-01

    The concept of a "time window of integration" holds that information from different sensory modalities must not be perceived too far apart in time in order to be integrated into a multisensory perceptual event. Empirical estimates of window width differ widely, however, ranging from 40 to 600 ms depending on context and experimental paradigm. Searching for theoretical derivation of window width, Colonius and Diederich (Front Integr Neurosci 2010) developed a decision-theoretic framework using a decision rule that is based on the prior probability of a common source, the likelihood of temporal disparities between the unimodal signals, and the payoff for making right or wrong decisions. Here, this framework is extended to the focused attention task where subjects are asked to respond to signals from a target modality only. Evoking the framework of the time-window-of-integration (TWIN) model, an explicit expression for optimal window width is obtained. The approach is probed on two published focused attention studies. The first is a saccadic reaction time study assessing the efficiency with which multisensory integration varies as a function of aging. Although the window widths for young and older adults differ by nearly 200 ms, presumably due to their different peripheral processing speeds, neither of them deviates significantly from the optimal values. In the second study, head saccadic reactions times to a perfectly aligned audiovisual stimulus pair had been shown to depend on the prior probability of spatial alignment. Intriguingly, they reflected the magnitude of the time-window widths predicted by our decision-theoretic framework, i.e., a larger time window is associated with a higher prior probability.

  3. Evaluation of optimized magnetic resonance perfusion imaging scanning time window after contrast agent injection for differentiating benign and malignant breast lesions.

    Science.gov (United States)

    Dong, Jie; Wang, Dawei; Ma, Zhenshen; Deng, Guodong; Wang, Lanhua; Zhang, Jiandong

    2017-03-01

    The aim of the study was evaluate the 3.0 T magnetic resonance (MR) perfusion imaging scanning time window following contrast injection for differentiating benign and malignant breast lesions and to determine the optimum scanning time window for increased scanner usage efficiency and reduced diagnostic adverse risk factors. A total of 52 women with breast abnormalities were selected for conventional MR imaging and T1 dynamic-enhanced imaging. Quantitative parameters [volume transfer constant (Ktrans), rate constant (Kep) and extravascular extracellular volume fraction (Ve)] were calculated at phases 10, 20, 30, 40 and 50, which represented time windows at 5, 10, 15, 20 and 25 min, respectively, following injection of contrast agent. The association of the parameters at different phases with benign and malignant tumor diagnosis was analyzed. MR perfusion imaging was verified as an effective modality in the diagnosis of breast malignancies and the best scanning time window was identified: i) Values of Ktrans and Kep at all phases were statistically significant in differentiating benign and malignant tumors (P0.05); ii) values of Ve in benign tumors increased with phase number, but achieved no obvious changes at different phases in malignant tumors; iii) the optimum scanning time window of breast perfusion imaging with 3.0 T MR was between phases 10 and 30 (i.e., between 5 and 15 min after contrast agent injection). The variation trend of Ve values at different phases may serve as a diagnostic reference for differentiating benign and malignant breast abnormalities. The most efficient scanning time window was indicated to be 5 min after contrast injection, based on the observation that the Ve value only had statistical significance in diagnosis at stage 10. However, the optimal scanning time window is from 5 to 15 min following the injection of contrast agent, since that the variation trend of Ve is able to serve as a diagnostic reference.

  4. Due-window assignment scheduling with variable job processing times.

    Science.gov (United States)

    Wu, Yu-Bin; Ji, Ping

    2015-01-01

    We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.

  5. Due-Window Assignment Scheduling with Variable Job Processing Times

    Directory of Open Access Journals (Sweden)

    Yu-Bin Wu

    2015-01-01

    Full Text Available We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect or its starting time (i.e., deteriorating effect. The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.

  6. Stochastic inventory-transportation integrated optimization with time windows%带时间窗的随机库存—运输整合优化研究

    Institute of Scientific and Technical Information of China (English)

    段凤华; 何小年

    2012-01-01

    针对单配送中心—多客户配送系统,建立带时间窗约束的单周期随机需求库存—运输整合优化( ITIO)问题模型.运用禁忌搜索算法,求解无时间窗约束的算例,结果表明库存—运输整合优化策略在总成本和车辆数上都优于全选最佳和全选次优策略,证明ITIO问题的研究具有理论意义和实际价值.同时,与遗传算法求解结果的比较表明,禁忌搜索算法求解此类问题具有优势.求解引入时间窗约束的算例,结果显示既满足时限要求,又比其他两种策略节省了库存—运输总成本,使得本模型及其求解算法更贴近实际应用要求.%The model of single-cycle inventory-transportation integrated optimization(ITIO) with time windows was constructed for one-center & multi-client distribution system. The results of the example without time windows by tabu search algorithm show that TTTO is superior to best-select and suboptimal-select strategy on total cost and total number of vehicles used, and therefore prove the theoretical and practical values of ITIO. Meanwhile, a comparison with results by genetic algorithm shows that the tabu search algorithm has an advantage while solving this kind problem. Furthermore, the time windows was added into the ITIO and the problem was solved. The results obtained not only meet clients' time limits, but save the total cost of inventory-transportation compared with best -select and suboptimal-select strategy, which promotes the ITIO model and its algorithm to be more closely applicable.

  7. Optimal pickup time windows allocation at container terminal%集装箱码头堆场取箱时间窗优化研究

    Institute of Scientific and Technical Information of China (English)

    魏航

    2011-01-01

    Container terminal is not only the area for storing inbound and outbound containers, but also the place for pickup. Because of the uncertainty of pickup time, terminal operators have to rehandle the containers frequently which incur significant cost to the operators. In order to reduce the cost in rehandling, a time win dow mechanism for container pickup was introduced. A function of the subsidies to the terminal operators and a function of rehandling costs to the consignees were constructed. Based on these functions, the distribution of pickup times and the formulation of rehandling times were derived. Then, the problem of optimal pickup time windows allocation was proposed and the model was constructed. Because of the high computational complexi ty , a genetic algorithm was developed. Finally, a numerical example was given in two different modes, and the sensitivity analysis was conducted. By applying the time windows allocation mechanism, the rehandling op erations were greatly reduced, and both of the operational efficiency and the expected profits of the terminal operators were improved significantly.%码头堆场是供装卸船舶存放集装箱的场所,同时也是向货主交接集装箱的地方.由于取箱车辆到达时间的不确定性,码头运营方需要在堆场进行大量的翻箱作业,消耗大量的劳动成本.首先对码头取箱时间窗优化机制进行了说明,构建了码头方补助金函数与车辆方的成本函数,获得了车辆方取箱的到达率函数,进而得到了码头方的翻箱次数公式.然后,描述了集装箱码头堆场取箱时间窗优化问题,建立了取箱时间窗优化模型,并设计了求解的遗传算法.最后给出算例,分别对两种不同的取箱模式进行对比,并进行了灵敏度分析.通过对进口集装箱的提取时间进行取箱时间窗的优化分配,从而减少了码头方的翻箱操作,提高了码头的期望收益与运作效率.

  8. Dynamic vehicle routing with time windows in theory and practice

    NARCIS (Netherlands)

    Yang, Z.; Osta, van J.P.; Veen, van B.; Krevelen, van R.; Stam, A.; Kok, J.N.; Bäck, T.H.W.; Michael, Emmerich T. M.

    2016-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are

  9. Dynamic vehicle routing with time windows in theory and practice

    NARCIS (Netherlands)

    Yang, Z.; Osta, van J.P.; Veen, van B.; Krevelen, van R.; Stam, A.; Kok, J.N.; Bäck, T.H.W.; Michael, Emmerich T. M.

    2016-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are can

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

  11. Time characteristics of PROFIBUS on Windows XP

    NARCIS (Netherlands)

    Huang, Yang

    2005-01-01

    This project is aiming to investigate the use of the PROFIBUS as a fieldbus for control purposes, and to determine the time characteristics of PROFIBUS data transmission between two PCs. The actual experiments are performed with PC¿s running Windows XP, which is a non-realtime OS. The experiments ar

  12. Two Multivehicle Routing Problems with Unit-Time Windows

    CERN Document Server

    Frederickson, Greg N

    2011-01-01

    Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to visit as many locations as possible using a fixed number of vehicles. In the second, the goal is to visit all locations using the smallest number of vehicles possible. For the first problem, we present an approximation algorithm whose output path collects a reward within a constant factor of optimal for any fixed number of vehicles. For the second problem, our algorithm finds a 6-approximation to the problem on a tree metric, whenever a single vehicle could visit all locations during their time windows.

  13. The Electric Traveling Salesman Problem with Time Windows

    DEFF Research Database (Denmark)

    Roberti, Roberto; Wen, Min

    2016-01-01

    integer linear formulation that can solve 20-customer instances in short computing times and a Three-Phase Heuristic algorithm based on General Variable Neighborhood Search and Dynamic Programming.Computational results show that the heuristic algorithm can find the optimal solution in most small......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...

  14. The optimal window for the 2MASS dipole

    CERN Document Server

    Chodorowski, Michal; Ciecielag, Pawel; Colombi, Stephane

    2007-01-01

    A comparison of the 2MASS flux dipole to the CMB dipole can serve as a method to constrain a combination of the cosmological parameter Omega_m and the luminosity bias of the 2MASS survey. For this constraint to be as tight as possible, it is necessary to maximize the correlation between the two dipoles. This can be achieved by optimizing the survey window through which the flux dipole is measured. Here we explicitly construct such a window for the 2MASS survey. The optimization essentially reduces to excluding from the calculation of the flux dipole galaxies brighter than the limiting magnitude K_min = 5 of the near-infrared K_s band. The misalignment angle between the two dipoles is a sensitive measure of their correlation: the higher the correlation, the smaller the expectation value of the angle. When our window is employed, the observed misalignment angle is expected to decrease with almost 90% confidence.

  15. 带时间窗的多车场车辆路径优化的粒子群算法%Study on multi-depot vehicle routing problem with time windows based on Particle Swarm Optimization

    Institute of Scientific and Technical Information of China (English)

    王铁君; 邬开俊

    2012-01-01

    带时间窗的多车场车辆路径问题在基本车辆路径问题的基础上增加了“多车场”与“时间窗”两个约束条件,是一个典型的NP难解问题.将粒子群算法应用于带时间窗的多车场车辆路径优化问题,构造了一种适用于求解车辆路径问题的粒子编码方法,建立了相应的数学模型,在此基础上设计了相应的算法.算例通过和遗传算法、蚁群算法进行比较,证明了其搜索速度和寻优能力的优越性.%Multi-depot vehicle routing problem with time windows is a variation of the vehicle routing problem constrained by multi-depot and time windows, which is a typical NP-hard problem. Particle swarm optimization with a particle coding method is designed to solve the problem. The mathematic mode is established and the solution algorithm is developed. The simulation results of example indicate that the algorithm has faster search speed and stronger optimization ability than the GA and ACO.

  16. Route Optimization of Hazardous Chemicals Transportation with Mixed Time Windows%带混合时间窗的多目标危险化学品运输路径优化

    Institute of Scientific and Technical Information of China (English)

    邹宗峰; 张保全

    2012-01-01

    For the sake of reducing the risk of dangerous chemicals transportation, and making path selection more scientific and in line with the reality, different relevant stakeholders involved in the transportation were considered from different aspects (the main body of responsibility, social impact and so on), and five indicator systems were proposed on the basis of the re-identification and segmentation of indexes that affect the transport routes chosen seriously. The weights of these indexes were calculated by using the entropy weight method. The multi-objective models for hazardous chemicals transport were built on the basis of the mentioned five indicators under the condition of mixed time windows. The Pareto optimal solutions were obtained by using the improved multi-objective genetic algorithm. Analysis shows that different starting time point of departure will produce different Pareto optimal solutions, which including departure time window of each optimal path, and each optimal solution represents a path with an indicator having reached relatively optimal. It is concluded that the conditions of mixed time windows are more in line with the actual situation. On the basis of the departure time window and the generated multiple optimal paths, decision-makers can choose the most appropriate optimal path with higher efficiency according to their decision-making preferences and their focus of attention.%为降低危险化学品运输风险,使路径选择更加科学、切合实际,从责任主体、社会影响等方面综合考虑危险化学品运输相关主体,根据各主体目标对影响运输路径选择的指标进行重新识别和细分,提出5大指标体系.应用熵权法计算出各指标权重,建立混合时间窗条件下的多目标危化品运输路径优化模型,通过改进的多目标遗传算法求出Pareto最优解.结果表明,不同时间点出发会产生不同的Pareto最优解,并且可得到每条最优路径的出发时间窗,每个

  17. Dynamic vehicle routing with time windows in theory and practice.

    Science.gov (United States)

    Yang, Zhiwei; van Osta, Jan-Paul; van Veen, Barry; van Krevelen, Rick; van Klaveren, Richard; Stam, Andries; Kok, Joost; Bäck, Thomas; Emmerich, Michael

    2017-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are canceled. In this case new schedules need to be generated on-the-fly. Online optimization algorithms for dynamical vehicle routing address this problem but so far they do not consider time windows. Moreover, to match the scenarios found in real-world problems adaptations of benchmarks are required. In this paper, a practical problem is modeled based on the procedure of daily routing of a delivery company. New orders by customers are introduced dynamically during the working day and need to be integrated into the schedule. A multiple ant colony algorithm combined with powerful local search procedures is proposed to solve the dynamic vehicle routing problem with time windows. The performance is tested on a new benchmark based on simulations of a working day. The problems are taken from Solomon's benchmarks but a certain percentage of the orders are only revealed to the algorithm during operation time. Different versions of the MACS algorithm are tested and a high performing variant is identified. Finally, the algorithm is tested in situ: In a field study, the algorithm schedules a fleet of cars for a surveillance company. We compare the performance of the algorithm to that of the procedure used by the company and we summarize insights gained from the implementation of the real-world study. The results show that the multiple ant colony algorithm can get a much better solution on the academic benchmark problem and also can be integrated in a real-world environment.

  18. The discount window : time for reform?

    OpenAIRE

    Craig S. Hakkio; Gordon H. Sellon

    2000-01-01

    For many years, the Federal Reserve's discount window has played an important role in monetary policy. Discount window borrowing helps individual depository institutions manage their reserve accounts in the presence of unexpected deposit and payments flows. Improved reserve management, in turn, helps stabilize the overnight federal funds market by reducing the volatility of short-term interest rates. Moreover, announced changes in the Federal Reserve's discount rate have often signaled import...

  19. Optimal concentration and time window for proliferation and differentiation of neural stem cells from embryonic cerebral cortex:5% oxygen preconditioning for 72 hours

    Institute of Scientific and Technical Information of China (English)

    Li-li Yuan; Ying-jun Guan; Deng-dian Ma; Hong-mei Du

    2015-01-01

    Hypoxia promotes proliferation and differentiation of neural stem cells from embryonic day 12 rat brain tissue, but the concentration and time of hypoxic preconditioning are controversial. To address this, we cultured neural stem cells isolated from embryonic day 14 rat cerebral cortex in 5% and 10% oxygenin vitro. MTT assay, neurosphere number, and immunolfuorescent staining found that 5% or 10% oxygen preconditioning for 72 hours improved neural stem cell viability and proliferation. With prolonged hypoxic duration (120 hours), the proportion of apoptotic cells increased. Thus, 5% oxygen preconditioning for 72 hours promotes neural stem cell prolif-eration and neuronal differentiation. Our ifndings indicate that the optimal concentration and duration of hypoxic preconditioning for promoting proliferation and differentiation of neural stem cells from the cerebral cortex are 5% oxygen for 72 hours.

  20. Market volatility modeling for short time window

    Science.gov (United States)

    de Mattos Neto, Paulo S. G.; Silva, David A.; Ferreira, Tiago A. E.; Cavalcanti, George D. C.

    2011-10-01

    The gain or loss of an investment can be defined by the movement of the market. This movement can be estimated by the difference between the magnitudes of two stock prices in distinct periods and this difference can be used to calculate the volatility of the markets. The volatility characterizes the sensitivity of a market change in the world economy. Traditionally, the probability density function (pdf) of the movement of the markets is analyzed by using power laws. The contributions of this work is two-fold: (i) an analysis of the volatility dynamic of the world market indexes is performed by using a two-year window time data. In this case, the experiments show that the pdf of the volatility is better fitted by exponential function than power laws, in all range of pdf; (ii) after that, we investigate a relationship between the volatility of the markets and the coefficient of the exponential function based on the Maxwell-Boltzmann ideal gas theory. The results show an inverse relationship between the volatility and the coefficient of the exponential function. This information can be used, for example, to predict the future behavior of the markets or to cluster the markets in order to analyze economic patterns.

  1. A multimodal logistics service network design with time windows and environmental concerns

    Science.gov (United States)

    Zhang, Dezhi; He, Runzhong; Wang, Zhongwei

    2017-01-01

    The design of a multimodal logistics service network with customer service time windows and environmental costs is an important and challenging issue. Accordingly, this work established a model to minimize the total cost of multimodal logistics service network design with time windows and environmental concerns. The proposed model incorporates CO2 emission costs to determine the optimal transportation mode combinations and investment selections for transfer nodes, which consider transport cost, transport time, carbon emission, and logistics service time window constraints. Furthermore, genetic and heuristic algorithms are proposed to set up the abovementioned optimal model. A numerical example is provided to validate the model and the abovementioned two algorithms. Then, comparisons of the performance of the two algorithms are provided. Finally, this work investigates the effects of the logistics service time windows and CO2 emission taxes on the optimal solution. Several important management insights are obtained. PMID:28934272

  2. A multimodal logistics service network design with time windows and environmental concerns.

    Science.gov (United States)

    Zhang, Dezhi; He, Runzhong; Li, Shuangyan; Wang, Zhongwei

    2017-01-01

    The design of a multimodal logistics service network with customer service time windows and environmental costs is an important and challenging issue. Accordingly, this work established a model to minimize the total cost of multimodal logistics service network design with time windows and environmental concerns. The proposed model incorporates CO2 emission costs to determine the optimal transportation mode combinations and investment selections for transfer nodes, which consider transport cost, transport time, carbon emission, and logistics service time window constraints. Furthermore, genetic and heuristic algorithms are proposed to set up the abovementioned optimal model. A numerical example is provided to validate the model and the abovementioned two algorithms. Then, comparisons of the performance of the two algorithms are provided. Finally, this work investigates the effects of the logistics service time windows and CO2 emission taxes on the optimal solution. Several important management insights are obtained.

  3. The vehicle routing problem with time windows and temporal dependencies

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg; Rasmussen, Matias Sevel; Larsen, Jesper

    2011-01-01

    In this article, we formulate the vehicle routing problem with time windows and temporal dependencies. The problem is an extension of the well studied vehicle routing problem with time windows. In addition to the usual constraints, a scheduled time of one visit may restrain the scheduling options...

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

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

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

  7. Windows

    DEFF Research Database (Denmark)

    Heiselberg, Per; Svidt, Kjeld; Nielsen, Peter V.

    In natural ventilation systems fresh air is often provided through opening of windows. However, the knowledge of the performance of windows is rather limited. Computation of natural ventilation air flow through windows is most commonly made using discharge coefficients, that are regarded as being...... constant. The reported results show that the discharge coefficient for a window opening cannot be regarded as a constant and that it varies considerably with the size of the opening area, the window type and the temperature difference. Therefore, the use of a constant value can lead to serious errors...

  8. On the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2006-01-01

    generation. We have solved two test problems introduced in 2001 by Gehring and Homberger with 400 and 1000 customers 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...... inequalities are facet defining under certain assumptions. We also introduce precedence constraints in the context of the VRPTW. Computational experiments are performed with a branch-and-cut algorithm on the Solomon test problems with wide time windows. Based on results on 25-node problems the outcome...... is that the algorithmshows promising results compared to leading algorithms in the literature. In particularwe report a solution to a previously unsolved 50-node Solomon test problem R208. The conclusion is therefore that the path formulation of the VRPTW is no longer the unchallenged winning strategy for solving the VRPTW...

  9. Optimization of the window function for digital hologram apodization in reconstructing the holographic image

    Science.gov (United States)

    Zhang, Yancao; Fan, Qi; Li, Xinchao; Shi, Jianjun; Yang, Baiyu

    2013-10-01

    In this paper, an optimal window function used for digital hologram apodization in reconstructing the holographic image is presented, which is generated by a cosine window convolving with a rectangle window and has a flat top because of the rectangle shape of the hologram. The window’s parameters are optimized using a genetic algorithm to make sure that the sidelobes of the window are minimum. Numerical simulation results show that the new window has a sidelobe lower than that of the Tukey window, and experimental results show that apodization using this window can suppress the diffraction effectively in reconstructing the holographic image.

  10. Rolling optimization algorithm based on collision window for single machine scheduling problem

    Institute of Scientific and Technical Information of China (English)

    Wang Changjun; Xi Yugeng

    2005-01-01

    Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.

  11. Parallelization of the Vehicle Routing Problem with Time Windows

    OpenAIRE

    1999-01-01

    This dissertation presents a number of algorithms for solving the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP). In the VRP a fleet of vehicles based at a central depot must service a set of customers. In the VRPTW each customer has a time window. Service of a customer must begin within the interval given by the time window. The objective is to minimize some aspect of operating costs (e.g. ...

  12. Research on A Simplex Ant Colony Optimization Algorithm for VRP with Time Windows%单纯形蚁群算法对带时间窗车辆路径优化问题的研究

    Institute of Scientific and Technical Information of China (English)

    李永亮; 王玉富; 向长城

    2014-01-01

    This paper studied a complex vehicle routing problem with time window constraints by simplex ant colony algorithm.This article aims to research not only the shortest distance,but also the application of time as small as possible in the vehicle of transportation.We established function that time and distance influence on searching path,then,we used simplex ACO to solve this problem and get the optimal solu-tion.By describing the status of transportation,we proposed a mathematical model of a two-way transport and logistics simplex ant colony algorithm,and obtained the most economical transport routes.%研究了单纯形蚁群算法解决带时间窗约束条件的车辆路径问题,旨在突出研讨在运输中不仅距离最短,而且使应用的时间尽可能的少。首先建立时间、距离对搜索路径的影响函数,然后用单纯形蚁群算法解出最优路径。简单介绍了运输的现状,提出了物流双向运输的数学模型及单纯形蚁群算法,得出了物流运输最经济的合理路线结论。

  13. 需求带时间窗的环保多车型组合配送路径优化%Environmental multi-model combination distribution routing optimization for demand with time windows

    Institute of Scientific and Technical Information of China (English)

    李淑琴; 杨斌; 赵磊; 易宣齐

    2013-01-01

    Based on the concept of low carbon logistics, with the goal of reducing cost, improving customer satisfaction and reducing the environmental pollution, a new research direction, environmental multi-model combination distribution routing optimization was proposed. An environmental multi-model vehicle routing problem model with the soft time windows was established, and multi-constraint processing method about the vehicle load capacity, time window of demand, and multi-model were discussed. A simulated annealing algorithm was designed and realized through simulation experiment. A sensitivity analysis was conducted in order to identify the influence of vehicle with different environmental performance. The results show that the maximum speed of the vehicle has strong correlation with the operation cost and environmental pollution, while the load capacity has great influence on the operation cost, customer satisfaction and environmental pollution level. Meanwhile , the test proses the effectiveness of simulated annealing algorithm in this optimization problem.%以降低成本、提高客户满意度、减少环境污染为目标,提出环保多车型组合配送的低碳路径优化问题.建立带软时间窗约束的多车型车辆路径优化模型,研究多车型车辆调度中载重量、需求的时间窗和多车型等多种约束的处理方法,并且设计模拟退火算法,进行仿真试验.通过对参数进行敏感性分析,研究不同环保性能车辆的影响,结果表明,车辆最大行驶速度与运行成本和客户满意度有着较强的相关性,而载重量则对运营成本和环境污染程度均有较大影响,同时试验结果表明模拟退火算法在该问题求解上的有效性.

  14. 基于萤火虫算法带时间窗的双向配送调度%Study on Bidirectional Distribution Scheduling with Time Window Based on Glowworm Swarm Optimization

    Institute of Scientific and Technical Information of China (English)

    王俊峰; 李玉华; 张凯丽

    2016-01-01

    In this paper, we developed a new multi-objective mathematical model for the bidirectional distribution scheduling problem with time window, proposed a discrete glowworm swarm optimization and the relevant coding strategy, and further redefined the formula of the crossover, mutation and movement of the individuals. Meanwhile, according to the logical distance between the individual glowworm swarm optimization, we established the neighborhood set to improve the local search ability of the algorithm. Next we introduced the optimal historical memory function of the individuals to accelerate convergence. At the end, we used the random number and the remainder function to protect the individual codes from interference and prevent local convergence and demonstrated the validity of the algorithm through a simulated case study.%针对带时间窗的双向配送调度问题,重新建立新的带多目标的数学模型,提出一种离散型萤火虫算法和编码策略,并重新定义了个体交叉变异移动公式.同时,根据萤火虫编码个体之间的逻辑距离,构建邻域集合,提高局部搜索能力.并引进个体历史最优记忆功能,加快收敛速度.最后利用随机数和求余函数对编码个体进行扰动,防止过早陷入局部极值.通过仿真案例实验验证了算法的有效性.

  15. Distribution Network Optimization of Supply Chain under Constraints of Matching Transportation and Soft Time Windows%软时间窗和匹配运输下的供应链配送网络优化

    Institute of Scientific and Technical Information of China (English)

    张霞; 张岐山

    2012-01-01

    A new distribution network optimization problem in the supply chain background was studied. In the design of transportation network we adopted the matching mode in which a supplier and a customer are merged. The model was built with soft time windows constraint, vehicle maximum driving distance constraint and capacity constraints. Discrete particle swarm optimization algorithm based on integer number coding and random swap sequence was applied to solve the problem. Finally the validity of the model and the algorithm was tested through operating and comparing three different algorithms on numerical examples. Results show that DPSO can reduce the iteration number,and get the optimal solution of the problem.%针对客户和供应商匹配运输下的供应链配送网络优化问题,在模型中加入客户软时间窗约束、车辆最大行驶距离约束以及设施容量约束,建立了全新的0-1整数规划模型,采用基于整数编码和交换序的离散粒子群优化算法来求解.通过算例将标准粒子群算法( PSO)、局部版粒子群算法(LPSO)和离散粒子群算法(DPSO)的运行结果进行比较,结果表明,DPSO算法可以减少迭代次数,并获得问题的最优解.

  16. Evaluation of the optimal lengths and number of multiple windows for spectrogram estimation of SSVEP.

    Science.gov (United States)

    Hansson-Sandsten, Maria

    2010-05-01

    The purpose of this paper is to present the optimal number of windows and window lengths using multiple window spectrogram for estimation of non-stationary processes with shorter or longer duration. Such processes could start in the EEG as a result of a stimuli, e.g., steady-state visual evoked potentials (SSVEP). In many applications, the Welch method is used with standard set-ups for window lengths and number of averaged spectra/spectrograms. This paper optimizes the window lengths and number of windows of the Welch method and other more recent, so called, multiple window or multitaper methods and compares the mean squared errors of these methods. Approximative formulas for the choice of optimal number of windows and window lengths are also given. Examples of spectrogram estimation of SSVEP are shown.

  17. REFINEMENTS OF THE COLUMN GENERATION PROCESS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Institute of Scientific and Technical Information of China (English)

    Jesper LARSEN

    2004-01-01

    The Vehicle Routing Problem with Time Windows is a generalization of the well known capacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of customers. The service of the customers can only start within a well-defined time interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance). 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 run-time refinements when speeding up an exact approach without compromising optimality.

  18. Optimization of a Water Window Capillary Discharge Radiation Source

    Directory of Open Access Journals (Sweden)

    M. Stefanovič

    2011-01-01

    Full Text Available Computer modeling of a fast electrical discharge in a nitrogen-filled alumina capillary was performed in order to discover discharge system parameters that lead to high radiation intensity in the so-called water window range of wavelengths (2–4 nm. The modeling was performed by means of the two-dimensional RMHD code Z*. The time and spatial distribution of plasma quantities were used for calculating the ion level populations and for estimating the absorption of the 2.88 nm radiation line in the capillary plasma, using the FLYCHK code. Optimum discharge parameters for the capillary discharge water window source are suggested. The heating of the electrodes and the role of capillary channel shielding were analyzed according to the Z* code.

  19. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2011-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

  20. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2008-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW sol

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

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

  3. An Intelligent Window for Optimal Ventilation and Minimum Thermal Loss

    DEFF Research Database (Denmark)

    Mortensen, Lone Hedegaard; Rose, Jørgen; Liu, Mingzhe;

    This report compares the simulation results of 12 window typologies for four countries on four selected days. The simulation results are used to select the window frame construction including glazing type and pane configuration....

  4. Parallelization of the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Larsen, Jesper

    1999-01-01

    of customers. In the VRPTW each customer has a time window. Service of a customer must begin within the interval given by the time window. The objective is to minimize some aspect of operating costs (e.g. total distance traveled, number of vehicles needed or a combination of parameters). Since the late 80's......This dissertation presents a number of algorithms for solving the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP). In the VRP a fleet of vehicles based at a central depot must service a set...... obtained using Lagrange relaxation. This dissertation is divided into three parts. First the theoretical framework is described. Thereafter a number of techniques to improve the performance of the column-generation framework are proposed and analyzed. Finally a parallel algorithm based on the sequential...

  5. The Vehicle Routing Problem with Time Windows and Temporal Dependencies

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper

    The vehicle routing problem with time windows and temporal dependencies (VRPTWTD) is an extension of the vehicle routing problem with time windows (VRPTW). Given is a fixed set of customers with individual demands and with time windows specifying when each customer accepts service. The objective...... is to find routes for a number of vehicles, all starting and ending at a central depot in such a way that the total distance is minimized. The extension that we present here is concerned with temporal dependencies between customers. A temporal dependency which is often encountered in practical instances...... assignment and routing problem with synchronization constraints. The problem has been solved by column generation. The synchronized vehicle dispatching problem (SVDP), which is a dynamic vehicle routing problem with synchronization between vehicles. Constraint programming and local search are applied...

  6. Refinements of the column generation process for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Larsen, Jesper

    2004-01-01

    The Vehicle Routing Problem with Time Windows is a generalization of the well known capacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of the customers and fulfill their demands. The service of the customers can only start within a well-defined time...... 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...

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

  8. Optimal time discrimination

    OpenAIRE

    Coşkun, Filiz; Sayalı, Zeynep Ceyda; Gürbüz, Emine; Balcı, Fuat

    2015-01-01

    Optimal Time Discrimination Journal: Quarterly Journal of Experimental Psychology Manuscript ID: QJE-STD 14-039.R1 Manuscript Type: Standard Article Date Submitted by the Author: n/a Complete List of Authors: Çoskun, Filiz; Koç University, Psychology Sayalı Ungerer, Zeynep; Koç University, Psychology Gürbüz, Emine; Koç University, Psychology Balcı, Fuat; Koç University, Psychology Keywords: Decision making, Interval Timing, Optimality, Response Times, Temporal ...

  9. Lagrangean Duality Applied on Vehicle Routing with Time Windows - Experimental Results

    DEFF Research Database (Denmark)

    Kallehauge, Brian; Larsen, Jesper; Madsen, Oli B.G.

    2001-01-01

    This report presents the results of the application of a non-differentiable optimization method in connection with the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is an extension of the Vehicle Routing Problem. In the VRPTW the service at each customer must start within...... an associated time window. The Shortest Path decomposition of the VRPTW by Lagrangian relaxation require the finding of the optimal Lagrangian multipliers. This problem is a convex non-differentiable optimization problem. The optimal multipliers are found using the non-differentiable method denoted the proximal...... bundle- and Dantzig-Wolfe algorithm has been tested on the well-known Solomon VRPTW benchmark problems and a range of extended Solomon problems. Since we have succeded in solving 14 previously unsolved problems and an extended Solomon problem with 1000 customers, which is the largest problem ever solved...

  10. Estimation of structural modal parameters by fourier transform with an optimal window

    Institute of Scientific and Technical Information of China (English)

    ZHU Hong-ping; WAN Xin-hua

    2005-01-01

    An adaptive Fourier Transform (FT) with an optimal window has been proposed for the time-frequency analysis of nonstationary time series. The method allows for a good estimation of both frequency and amplitude of the spectrum and can be easily applied to the general case of time-varying signals. The evaluation of the proposed approach has been performed on measured time-varying signals from a suspension bridge model and a steel frame model whose data have the typical non-stationary characteristics. The numerical results show that the proposed approach can overcome some of the difficulties encountered in the classic Fourier transform technique and can achieve higher computation accuracy.

  11. A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results are presented for different classes of vehicle routing problems, varying in their coverage with time windows, time window size, distribution and number of customers. The results are compared with a simple, but effective local search approach for multi-objective combinatorial optimization problems.

  12.  Reducing Marine Container Terminal Gate Congestion with Vessel-Dependent Time Windows For Truck Entries

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen; Jiang, Liping

    and the heuristic of genetic algorithm is improved to be more efficient. Then two optimization strategies are proposed namely fixed end-point time window (FEP) and variable end-point time window (VEP). To compare the effectiveness of two strategies, the optimization model and the heuristic are applied to some tests......, including a real data test and a scenarios test. The result indicates that good coordination is necessary for assigning time windows, where FEP strategy performs better than VEP strategy because it can achieve almost the same effect with only half of the calculation effort. During the tests, some practical...

  13. Fast ejection chain algorithms for vehicle routing with time windows

    NARCIS (Netherlands)

    Sontrop, Herman; Blesa, M.J.; Blum, C.; van der Horn, Pieter; Uetz, Marc Jochen; Roli, A.; Sampels, M.

    This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejection chains create powerful compound moves within Local Search algorithms. Their potential to yield state of the art algorithms has

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

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

  15. Reducing Marine Container Terminal Gate Congestion with Vessel-Dependent Time Windows For Truck Entries

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen; Jiang, Liping

    In recent years, marine container terminal gate congestion has become a serious issue, because it not only limits the efficiency of the logistics system but also generates serious air pollution. The direct reason has been recognized to be the unmanaged container truck arrivals. One of the possible...... solutions is that the terminal operator provides vessel-dependent time windows for the truck entries, which has already been used in many Chinese seaports. Previously, the authors proposed the idea of time window optimization and analyzed its economic feasibility in the context of the export direction gate...... problems are also discussed, such as vessel delays and yard capacity....

  16. Development of fully Bayesian multiple-time-window source inversion

    Science.gov (United States)

    Kubo, Hisahiko; Asano, Kimiyuki; Iwata, Tomotaka; Aoi, Shin

    2016-03-01

    In the estimation of spatiotemporal slip models, kinematic source inversions using Akaike's Bayesian Information Criterion (ABIC) and the multiple-time-window method have often been used. However, there are cases in which conventional ABIC-based source inversions do not work well in the determination of hyperparameters when a non-negative slip constraint is used. In order to overcome this problem, a new source inversion method was developed in this study. The new method introduces a fully Bayesian method into the kinematic multiple-time-window source inversion. The multiple-time-window method is one common way of parametrizing a source time function and is highly flexible in terms of the shape of the source time function. The probability distributions of model parameters and hyperparameters can be directly obtained by using the Markov chain Monte Carlo method. These probability distributions are useful for simply evaluating the uniqueness and reliability of the derived model, which is another advantage of a fully Bayesian method. This newly developed source inversion method was applied to the 2011 Ibaraki-oki, Japan, earthquake (Mw 7.9) to demonstrate its usefulness. It was demonstrated that the problem with using the conventional ABIC-based source inversion method for hyperparameter determination appeared in the spatiotemporal source inversion of this event and that the newly developed source inversion could overcome this problem.

  17. Efficient constraint handling in electromagnetism-like algorithm for traveling salesman problem with time windows.

    Science.gov (United States)

    Yurtkuran, Alkın; Emel, Erdal

    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.

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

    Directory of Open Access Journals (Sweden)

    Alkın Yurtkuran

    2014-01-01

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

  19. Documentation of Calculation Program and Guideline for Optimal Window Design

    DEFF Research Database (Denmark)

    Vanhoutteghem, Lies; Svendsen, Svend

    . A user-friendly calculation program based on simple input data has recently been developed to assist engineers and architects during the process of selecting suitable windows for residential building design. The program is organised in four steps, which together represent an analysis of how windows......Windows affect energy consumption for heating and cooling of buildings and their thermal indoor environment. Standard energy calculation programs do not enable an easy comparison of different window designs, even though this is very important in the early stages of the building design process...... in a specific building design perform with regard to energy consumption, thermal indoor environment, and cost. The analyses in the steps gradually increase in level of detail and support the design decisions throughout the design process. This document presents work done to validate the program and demonstrates...

  20. Dynamic Aberration Correction for Conformal Window of High-Speed Aircraft Using Optimized Model-Based Wavefront Sensorless Adaptive Optics

    Science.gov (United States)

    Dong, Bing; Li, Yan; Han, Xin-li; Hu, Bin

    2016-01-01

    For high-speed aircraft, a conformal window is used to optimize the aerodynamic performance. However, the local shape of the conformal window leads to large amounts of dynamic aberrations varying with look angle. In this paper, deformable mirror (DM) and model-based wavefront sensorless adaptive optics (WSLAO) are used for dynamic aberration correction of an infrared remote sensor equipped with a conformal window and scanning mirror. In model-based WSLAO, aberration is captured using Lukosz mode, and we use the low spatial frequency content of the image spectral density as the metric function. Simulations show that aberrations induced by the conformal window are dominated by some low-order Lukosz modes. To optimize the dynamic correction, we can only correct dominant Lukosz modes and the image size can be minimized to reduce the time required to compute the metric function. In our experiment, a 37-channel DM is used to mimic the dynamic aberration of conformal window with scanning rate of 10 degrees per second. A 52-channel DM is used for correction. For a 128 × 128 image, the mean value of image sharpness during dynamic correction is 1.436 × 10−5 in optimized correction and is 1.427 × 10−5 in un-optimized correction. We also demonstrated that model-based WSLAO can achieve convergence two times faster than traditional stochastic parallel gradient descent (SPGD) method. PMID:27598161

  1. Dynamic Aberration Correction for Conformal Window of High-Speed Aircraft Using Optimized Model-Based Wavefront Sensorless Adaptive Optics.

    Science.gov (United States)

    Dong, Bing; Li, Yan; Han, Xin-Li; Hu, Bin

    2016-09-02

    For high-speed aircraft, a conformal window is used to optimize the aerodynamic performance. However, the local shape of the conformal window leads to large amounts of dynamic aberrations varying with look angle. In this paper, deformable mirror (DM) and model-based wavefront sensorless adaptive optics (WSLAO) are used for dynamic aberration correction of an infrared remote sensor equipped with a conformal window and scanning mirror. In model-based WSLAO, aberration is captured using Lukosz mode, and we use the low spatial frequency content of the image spectral density as the metric function. Simulations show that aberrations induced by the conformal window are dominated by some low-order Lukosz modes. To optimize the dynamic correction, we can only correct dominant Lukosz modes and the image size can be minimized to reduce the time required to compute the metric function. In our experiment, a 37-channel DM is used to mimic the dynamic aberration of conformal window with scanning rate of 10 degrees per second. A 52-channel DM is used for correction. For a 128 × 128 image, the mean value of image sharpness during dynamic correction is 1.436 × 10(-5) in optimized correction and is 1.427 × 10(-5) in un-optimized correction. We also demonstrated that model-based WSLAO can achieve convergence two times faster than traditional stochastic parallel gradient descent (SPGD) method.

  2. Optimization of Weighting Factors for Multiple Window Spectrogram of Event-Related Potentials

    Directory of Open Access Journals (Sweden)

    Maria Hansson-Sandsten

    2010-01-01

    Full Text Available This paper concerns the mean square error optimal weighting factors for multiple window spectrogram of different stationary and nonstationary processes. It is well known that the choice of multiple windows is important, but here we show that the weighting of the different multiple window spectrograms in the final average is as important to consider and that the equally averaged spectrogram is not mean square error optimal for non-stationary processes. The cost function for optimization is the normalized mean square error where the normalization factor is the multiple window spectrogram. This means that the unknown weighting factors will be present in the numerator as well as in the denominator. A quasi-Newton algorithm is used for the optimization. The optimization is compared for a number of well-known sets of multiple windows and common weighting factors and the results show that the number and the shape of the windows are important for a small mean square error. Multiple window spectrograms using these optimal weighting factors, from ElectroEncephaloGram data including steady-state visual evoked potentials, are shown as examples.

  3. Optimal energy window selection of a CZT-based small-animal SPECT for quantitative accuracy

    Energy Technology Data Exchange (ETDEWEB)

    Park, Su-Jin [Department of Radiological Science and Research Institute of Health Science, Yonsei University, Wonju 220-710 (Korea, Republic of); Yu, A. Ram [Laboratory animal center, OSONG Medical Innovation Foundation, Chunguk 363-951 (Korea, Republic of); Department of Nuclear Medicine, College of Medicine, Hanyang University Hospital, Seoul 133-792 (Korea, Republic of); Choi, Yun Young [Department of Nuclear Medicine, College of Medicine, Hanyang University Hospital, Seoul 133-792 (Korea, Republic of); Kim, Kyeong Min [Molecular Imaging Research Center, Korea Institute of Radiological and Medical Sciences, Seoul 139-706 (Korea, Republic of); Kim, Hee-Joung, E-mail: hjk1@yonsei.ac.kr [Department of Radiological Science and Research Institute of Health Science, Yonsei University, Wonju 220-710 (Korea, Republic of)

    2015-05-11

    Cadmium zinc telluride (CZT)-based small-animal single-photon emission computed tomography (SPECT) has desirable characteristics such as superior energy resolution, but data acquisition for SPECT imaging has been widely performed with a conventional energy window. The aim of this study was to determine the optimal energy window settings for technetium-99 m ({sup 99m}Tc) and thallium-201 ({sup 201}Tl), the most commonly used isotopes in SPECT imaging, using CZT-based small-animal SPECT for quantitative accuracy. We experimentally investigated quantitative measurements with respect to primary count rate, contrast-to-noise ratio (CNR), and scatter fraction (SF) within various energy window settings using Triumph X-SPECT. The two ways of energy window settings were considered: an on-peak window and an off-peak window. In the on-peak window setting, energy centers were set on the photopeaks. In the off-peak window setting, the ratios of energy differences between the photopeak from the lower- and higher-threshold varied from 4:6 to 3:7. In addition, the energy-window width for {sup 99m}Tc varied from 5% to 20%, and that for {sup 201}Tl varied from 10% to 30%. The results of this study enabled us to determine the optimal energy windows for each isotope in terms of primary count rate, CNR, and SF. We selected the optimal energy window that increases the primary count rate and CNR while decreasing SF. For {sup 99m}Tc SPECT imaging, the energy window of 138–145 keV with a 5% width and off-peak ratio of 3:7 was determined to be the optimal energy window. For {sup 201}Tl SPECT imaging, the energy window of 64–85 keV with a 30% width and off-peak ratio of 3:7 was selected as the optimal energy window. Our results demonstrated that the proper energy window should be carefully chosen based on quantitative measurements in order to take advantage of desirable characteristics of CZT-based small-animal SPECT. These results provided valuable reference information for the

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

    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...... 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...... the least extra distance to be traveled among the relocation policies....

  5. Planning in time - Windows and durations for activities and goals

    Science.gov (United States)

    Vere, S. A.

    1983-01-01

    The present general purpose automated planner/scheduler generates parallel plans aimed at the achievement of goals having imposed time constraints, with both durations and start time windows being specifiable for sets of goal conditions. Deterministic durations of such parallel plan activities as actions, events triggered by circumstances, inferences, and scheduled events entirely outside the actor's control, are explicitly modeled and may be any computable function of the activity variables. The final plan network resembles a PERT chart. Examples are given from the traditional 'blocksworld', and from a realistic 'Spaceworld' in which an autonomous spacecraft photographs objects in deep space and transmits the information to earth.

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

  7. Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows

    Science.gov (United States)

    Jittamai, Phongchai

    This dissertation defines the operational problems of, and develops solution methodologies for, a distribution of multiple products into oil pipeline subject to delivery time-windows constraints. A multiple-product oil pipeline is a pipeline system composing of pipes, pumps, valves and storage facilities used to transport different types of liquids. Typically, products delivered by pipelines are petroleum of different grades moving either from production facilities to refineries or from refineries to distributors. Time-windows, which are generally used in logistics and scheduling areas, are incorporated in this study. The distribution of multiple products into oil pipeline subject to delivery time-windows is modeled as multicommodity network flow structure and mathematically formulated. The main focus of this dissertation is the investigation of operating issues and problem complexity of single-source pipeline problems and also providing solution methodology to compute input schedule that yields minimum total time violation from due delivery time-windows. The problem is proved to be NP-complete. The heuristic approach, a reversed-flow algorithm, is developed based on pipeline flow reversibility to compute input schedule for the pipeline problem. This algorithm is implemented in no longer than O(T·E) time. This dissertation also extends the study to examine some operating attributes and problem complexity of multiple-source pipelines. The multiple-source pipeline problem is also NP-complete. A heuristic algorithm modified from the one used in single-source pipeline problems is introduced. This algorithm can also be implemented in no longer than O(T·E) time. Computational results are presented for both methodologies on randomly generated problem sets. The computational experience indicates that reversed-flow algorithms provide good solutions in comparison with the optimal solutions. Only 25% of the problems tested were more than 30% greater than optimal values and

  8. The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon

    OpenAIRE

    1996-01-01

    This paper considers the multiple vehicle traveling salesman problem cast over a multiple day routing scenario, with time windows and equity constraints. It develops an optimal column generation procedure and heuristic variations which solve test problems derived from the overnight delivery business. Extensive empirical testing indicates the judicious chose of a few routes for each day can incorporate equity at little or no additional cost. Federal Express Naval Postgraduate School Re...

  9. Real time production optimization

    Energy Technology Data Exchange (ETDEWEB)

    Saputelli, Luigi; Otavio, Joao; Araujo, Turiassu; Escorcia, Alvaro [Halliburton, Houston, TX (United States). Landmark Division

    2004-07-01

    Production optimization encompasses various activities of measuring, analyzing, modeling, prioritizing and implementing actions to enhance productivity of a field. We present a state-of-the-art framework for optimizing production on a continuous basis as new sensor data is acquired in real time. Permanently acquired data is modeled and analyzed in order to create predictive models. A model based control strategy is used to regulate well and field instrumentation. The optimum field operating point, which changes with time, satisfies the maximum economic return. This work is a starting point for further development in automatic, intelligent reservoir technologies which get the most out of the abilities of permanent, instrumented wells and remotely activated downhole completions. The strategy, tested with history-matched data from a compartmentalised giant field, proved to reduce operating costs while increasing oil recovery by 27% in this field. (author)

  10. Real time production optimization

    Energy Technology Data Exchange (ETDEWEB)

    Saputelli, Luigi; Otavio, Joao; Araujo, Turiassu; Escorcia, Alvaro [Halliburton, Houston, TX (United States). Landmark Division

    2004-07-01

    Production optimization encompasses various activities of measuring, analyzing, modeling, prioritizing and implementing actions to enhance productivity of a field. We present a state-of-the-art framework for optimizing production on a continuous basis as new sensor data is acquired in real time. Permanently acquired data is modeled and analyzed in order to create predictive models. A model based control strategy is used to regulate well and field instrumentation. The optimum field operating point, which changes with time, satisfies the maximum economic return. This work is a starting point for further development in automatic, intelligent reservoir technologies which get the most out of the abilities of permanent, instrumented wells and remotely activated downhole completions. The strategy, tested with history-matched data from a compartmentalised giant field, proved to reduce operating costs while increasing oil recovery by 27% in this field. (author)

  11. Distribution location routing optimization problem of food cold chain with time window in time varying network%时变网络条件下带时间窗的食品冷链配送定位—运输路径优化问题

    Institute of Scientific and Technical Information of China (English)

    石兆; 符卓

    2013-01-01

    In order to solve the problem of food cold chain logistics distribution system optimization problem, for perishable goods characteristics, combined with the distribution network time-varying characteristics to analyse travel time, this paper designed satisfaction degree function according to service time windows and established the simulation model under time-dependent. It designed the two-phase solution of preoptimization phase and real-time optimization phase, by using the decomposition method, it decomposed the problem, designed the minimum envelope clustering analysis method and tabu search algorithm to solve the problem. Simulation results show the effectiveness of the model and algorithm of practical value.%为解决食品冷链配送系统优化问题,针对易腐品特性,结合配送网络时变特征进行行程时间分析,根据服务时间窗设计满意度函数,建立时变条件下的仿真模型;采用“预优化阶段+实时优化阶段”两阶段求解策略,利用分解法进行问题分解,设计最小包络聚类分析方法与混合遗传算法求解.仿真计算验证了模型和算法的有效性与研究的实用价值.

  12. The Optimal Approach of Vehicle Route with Time Window Based on Genetic Algorithm: Dynamic Partition of Demand%基于需求划分的带软时间窗的路径优化方法

    Institute of Scientific and Technical Information of China (English)

    魏俊华; 王安麟; 童毅

    2005-01-01

    针对带有时间窗约束的车辆路径问题(Vehicle Routing Problem With Time Windows,VRPTW)的NP特征,以非完全连通配送网络为研究对象,用带有软时间窗约束的整体配送费用最小为目标,提出了一种基于需求的城市动态划分方法,有效的减少了路径的组合规模,并且用遗传算法将其实现,通过改进的Dijkstra算法求取其基于动态划分的最优配送路径集,最后计算示例验证了本文方法的有效性.

  13. Dynamic Probe Window Based Optimization for Surveillance in Home Security System

    Directory of Open Access Journals (Sweden)

    Bhaskar Kapoor

    2010-02-01

    Full Text Available Tracking of a moving object is very important for video surveillance in a real time scenario. The proposedalgorithm uses dynamic probe window based approach & combines the conventional edge based and framedifferencing approach to achieve better algorithmic time complexity as well as improved results. First itcomputes the edge map of two consecutive frames with the help of first order differential sobel operator dueto its noise resistant attributes and applies the frame differencing method between the two consecutive edgemaps. Apart from the above optimization, our method doesn’t differentiate between the scenario when motionoccurs and when it doesn’t, that is, almost same computation overhead is required even if motion is not thereso it reduces the time complexity of the algorithm when no motion is detected. The effectiveness of theproposed motion detection algorithm is demonstrated in a real time environment and the evaluation resultsare reported.

  14. Opening the 100-Year Window for Time Domain Astronomy

    CERN Document Server

    Grindlay, Jonathan; Los, Edward; Servillat, Mathieu

    2012-01-01

    The large-scale surveys such as PTF, CRTS and Pan-STARRS-1 that have emerged within the past 5 years or so employ digital databases and modern analysis tools to accentuate research into Time Domain Astronomy (TDA). Preparations are underway for LSST which, in another 6 years, will usher in the second decade of modern TDA. By that time the Digital Access to a Sky Century @ Harvard (DASCH) project will have made available to the community the full sky Historical TDA database and digitized images for a century (1890--1990) of coverage. We describe the current DASCH development and some initial results, and outline plans for the "production scanning" phase and data distribution which is to begin in 2012. That will open a 100-year window into temporal astrophysics, revealing rare transients and (especially) astrophysical phenomena that vary on time-scales of a decade. It will also provide context and archival comparisons for the deeper modern surveys

  15. Resource on-demand reservation based on time-window in optical grid network

    Science.gov (United States)

    Wu, Runze; Ji, Yuefeng

    2007-11-01

    On-demand reservation strategy is proposed for optical network resource scheduling. The proposed approach introduces time window reservation on grid integrated with wavelength-routed optical network, according to the application request with anticipant time range and rate. The time window deploys variable size, when time-window is not suitable for current application requirement, the resource scheduler can negotiate the next time window allocation with the switch. Time-window resource reservation approach loans dividing time multiplexing mechanism. Considering with multiple parallel lightpaths' monopolization, the proposed reservation approach improves network resource request service rate and makes the application having the QoS-aware ability.

  16. Transthoracic Doppler echocardiography to predict optimal tube pulsing window for coronary artery CT angiography

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Gang, E-mail: cjr.sungang@vip.163.com [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China); Li, Min, E-mail: limin22000@yahoo.com.cn [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China); Jiang, Xiang-sen, E-mail: jiangxiangsen123@126.com [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China); Li, Li, E-mail: leely1976@yahoo.com.cn [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China); Peng, Zhao-hui, E-mail: zhaohuipeng_R@163.com [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China); Mu, Nan-nan, E-mail: munannan22000@sohu.com [Department of Medical Imaging, Jinan Military General Hospital, No. 25, Shifan Road, Jinan, Shandong Province 250031 (China)

    2012-09-15

    Rationale and objective: To evaluate the feasibility of transthoracic Doppler echocardiography to determine the optimal pulsing windows for CT coronary angiography to narrow the pulsing windows further, especially in higher heart rate. Materials and methods: Doppler was performed on 135 patients before CT scanning. For Doppler, the intervals with minimal motion were evaluated during both systole and diastole integrating electrocardiogram (ECG) intervals. For CT scanning, the retrospective ECG-gating was applied and the optimal reconstruction intervals were determined. The accuracy of Doppler analysis to predict the optimal reconstruction intervals was tested. The predicted length of pulsing windows was compared between Doppler analysis and traditional prospective ECG-gating protocol (heart rate ≦ 65 bpm, 60–76%; 66–79 bpm, 30–77%; ≧80 bpm, 31–47%). Results: According to Doppler analysis, the mean length of intervals with minimal motion in systole was 106.4 ± 39.2 ms and 125.2 ± 92.0 ms in diastole. When the intervals with minimal motion during diastole > 90 ms, the optimal reconstruction intervals were located at diastole; otherwise, at systole (P < 0.001). The optimal reconstruction intervals in 93.8% (132/135) patients could be predicted accurately by Doppler analysis. If the optimal reconstruction intervals predicted by Doppler were applied as the exposure windows, the mean length of pulsing windows should has been 105.2 ± 69.4 ms (range: 26.9–510.3 ms), which was significantly shorter than that of traditional prospective ECG-gating protocol (232.0 ± 120.2 ms, range: 93.2–427.3 ms, P < 0.001). Conclusion: Doppler can help detecting the optimal pulsing windows accurately. Prospective ECG-gating incorporating Doppler analysis may narrow pulsing windows significantly while maintaining image quality.

  17. Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

    Directory of Open Access Journals (Sweden)

    Filip Taner

    2012-07-01

    Full Text Available This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.

  18. Managing truck arrivals with time windows to alleviate gate congestion at container terminals

    DEFF Research Database (Denmark)

    Chen, G.; Govindan, Kannan; Yang, Z.

    2013-01-01

    Long truck queues at gates often limit the efficiency of a container terminal and generate serious air pollution. To reduce the gate congestion, this paper proposes a method called'vessel dependent time windows (VDTWs)' to control truck arrivals, which involves partitioning truck entries into gro......Long truck queues at gates often limit the efficiency of a container terminal and generate serious air pollution. To reduce the gate congestion, this paper proposes a method called'vessel dependent time windows (VDTWs)' to control truck arrivals, which involves partitioning truck entries...... in the system. A conventional Genetic Algorithm (GA), a multi-society GA, and a hybrid algorithm using GA and Simulated Annealing are used to solve the optimization problem. A case study based on a real container terminal in China is performed, which shows the VDTWs method can flatten the truck arrivals...

  19. Optimization of Energy Performance of Windows by Applying Self-Adjustable Shadings

    Directory of Open Access Journals (Sweden)

    Starkov Vadim

    2016-01-01

    Full Text Available The paper studied the thermo-physical properties of the windows with self-adjustable jalousie and consequent cooling load reduction for the buildings in 60-degree North latitude throughout the year. We focused on using different types of innovative materials and window structures and specified possible ways of improvement for modern and conservative windows. The paper discussed main factors that induce choosing specific window type. First, we investigated quantity of solar radiation energy that is taken into account while calculating the cooling load. Then this dependence was analyzed with different scenarios for specific window structures facing to corresponding cardinal direction. The results provide useful information for optimizing the thermal response of an enclosure to periodic solar heat gains.

  20. Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2005-11-01

    Full Text Available The paper deals with the design of a route elimination (RE algorithm for thevehicle routing problem with time windows (VRPTW. The problem has two objectives, oneof them is the minimal number of routes the other is the minimal cost. To cope with theseobjectives effectively two-phase solutions are often suggested in the relevant literature. Inthe first phase the main focus is the route elimination, in the second one it is the costreduction. The algorithm described here is a part of a complete VRPWT study. The methodwas developed by studying the graph behaviour during the route elimination. For thispurpose a model -called “Magic Bricks” was developed. The computation results on theSolomon problem set show that the developed algorithm is competitive with the best ones.

  1. STUDI TENTANG TRAVELLING SALESMAN DAN VEHICLE ROUTING PROBLEM DENGAN TIME WINDOWS

    Directory of Open Access Journals (Sweden)

    I Nyoman Sutapa

    2003-01-01

    Full Text Available The article shows the study of model development of travelling salesman problem. Three models are studied, i.e. travelling salesman problem with time windows, vehicle routing problem, and vehicle routing problem with time windows. Abstract in Bahasa Indonesia : Dalam artikel ini dipaparkan kajian mengenai pengembangan model travelling salesman problem. Ada tiga model yang dikaji yaitu travelling salesman problem dengan time windows, vehicle routing problem, serta vehicle routing problem dengan time windows. Kata-kunci: travelling salesman problem, vehicle routing problem, time windows.

  2. 求解带硬时间窗车辆路径问题的自适应蚁群算法%ADAPTIVE ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING VEHICLE ROUTING PROBLEM WITH HARD TIME WINDOWS

    Institute of Scientific and Technical Information of China (English)

    修桂华; 王俊鸿

    2008-01-01

    蚁群算法具有较强的鲁棒性和优良的分布式计算机制.研究重点是对现有的求解带硬时间窗的车辆路径问题VRP-H(Vehicle Routing Problem with Hard Time Windows)的蚁群算法作出更好的改进,使得算法的计算效率更高且得到的解更优,提出了蚁群算法的改进算法-改进的自适应蚁群算法.该算法先用自适应蚁群算法对VRP-H求得一个可行解,再利用多种改善方法对初始解进一步优化,从而得到最优解.测试时选用Solomon提出的题库,结果表明该算法能够有效地求解VRP-H.

  3. Real-time windowing in imaging radar using FPGA technique

    Science.gov (United States)

    Ponomaryov, Volodymyr I.; Escamilla-Hernandez, Enrique

    2005-02-01

    The imaging radar uses the high frequency electromagnetic waves reflected from different objects for estimating of its parameters. Pulse compression is a standard signal processing technique used to minimize the peak transmission power and to maximize SNR, and to get a better resolution. Usually the pulse compression can be achieved using a matched filter. The level of the side-lobes in the imaging radar can be reduced using the special weighting function processing. There are very known different weighting functions: Hamming, Hanning, Blackman, Chebyshev, Blackman-Harris, Kaiser-Bessel, etc., widely used in the signal processing applications. Field Programmable Gate Arrays (FPGAs) offers great benefits like instantaneous implementation, dynamic reconfiguration, design, and field programmability. This reconfiguration makes FPGAs a better solution over custom-made integrated circuits. This work aims at demonstrating a reasonably flexible implementation of FM-linear signal and pulse compression using Matlab, Simulink, and System Generator. Employing FPGA and mentioned software we have proposed the pulse compression design on FPGA using classical and novel windows technique to reduce the side-lobes level. This permits increasing the detection ability of the small or nearly placed targets in imaging radar. The advantage of FPGA that can do parallelism in real time processing permits to realize the proposed algorithms. The paper also presents the experimental results of proposed windowing procedure in the marine radar with such the parameters: signal is linear FM (Chirp); frequency deviation DF is 9.375MHz; the pulse width T is 3.2μs taps number in the matched filter is 800 taps; sampling frequency 253.125*106 MHz. It has been realized the reducing of side-lobes levels in real time permitting better resolution of the small targets.

  4. A window-based time series feature extraction method.

    Science.gov (United States)

    Katircioglu-Öztürk, Deniz; Güvenir, H Altay; Ravens, Ursula; Baykal, Nazife

    2017-08-09

    This study proposes a robust similarity score-based time series feature extraction method that is termed as Window-based Time series Feature ExtraCtion (WTC). Specifically, WTC generates domain-interpretable results and involves significantly low computational complexity thereby rendering itself useful for densely sampled and populated time series datasets. In this study, WTC is applied to a proprietary action potential (AP) time series dataset on human cardiomyocytes and three precordial leads from a publicly available electrocardiogram (ECG) dataset. This is followed by comparing WTC in terms of predictive accuracy and computational complexity with shapelet transform and fast shapelet transform (which constitutes an accelerated variant of the shapelet transform). The results indicate that WTC achieves a slightly higher classification performance with significantly lower execution time when compared to its shapelet-based alternatives. With respect to its interpretable features, WTC has a potential to enable medical experts to explore definitive common trends in novel datasets. Copyright © 2017 Elsevier Ltd. All rights reserved.

  5. A Genetic Algorithm for the Multi-Pickup and Delivery Problem with time windows

    CERN Document Server

    Dridi, Imen Harbaoui; Ksouri, Mekki; Borne, Pierre

    2010-01-01

    In This paper we present a genetic algorithm for the multi-pickup and delivery problem with time windows (m-PDPTW). The m-PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. This paper purposes a brief literature review of the PDPTW, present our approach based on genetic algorithms to minimizing the total travel distance and thereafter the total travel cost, by showing that an encoding represents the parameters of each individual.

  6. Time-Space Topology Optimization

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard

    2008-01-01

    A method for space-time topology optimization is outlined. The space-time optimization strategy produces structures with optimized material distributions that vary in space and in time. The method is demonstrated for one-dimensional wave propagation in an elastic bar that has a time-dependent Young......’s modulus and is subjected to a transient load. In the example an optimized dynamic structure is demonstrated that compresses a propagating Gauss pulse....

  7. A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

    Directory of Open Access Journals (Sweden)

    Chenghua Shi

    2016-01-01

    Full Text Available We present the vehicle routing problem with potential demands and time windows (VRP-PDTW, which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA and heuristics-based genetic algorithm (HGA from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.

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

  9. Study of optimal exposure windows using 320-Detector rows dynamic volume CT

    Directory of Open Access Journals (Sweden)

    Gang Sun

    2010-12-01

    Full Text Available Gang Sun1, Min Li1, Li Li1, Guo-ying Li1, Zhi-wei Jing21Departments of Medical Imaging, 2Medical Statistics, Jinan Military General Hospital, Shandong Province, ChinaAbstract: The purpose of this study was to determine the optimal electrocardiographic (ECG pulsing windows and evaluate the effect on reduced dose and accuracy using 320-detector rows dynamic volume computed tomography (DVCT. A total of 170 patients were prospectively studied. The optimal reconstruction windows were analyzed in 76 patients scanned using retrospective ECG gating. Forty-seven patients were scanned by the predicted triggering windows. The optimal positions of exposure intervals according to different heart rates were evaluated. Optimal image quality, radiation dose, and diagnostic accuracy were then investigated by applying optimal triggering windows. The optimal ECG pulsing windows were determined as follows: when heart rate was <70 beats per minute, the exposure windows should be preset at 60%–80%; for a heart rate 70–90 beats per minute at 70%–90%; and for a heart rate ≥90 beats per minute at 30%–50%. The radiation dose for patients scanned with prospective ECG gating was significantly lower (5.9 versus 12.9 mSv, P < 0.001. However, because two or three heart beats were needed when heart rate was >70 beats per minute, the radiation dose increased with increasing heart rate for both retrospective and prospective ECG gating (r = 0.64, P < 0.001 and r = 0.59, P < 0.001, respectively. On the basis of a per segment analysis, overall sensitivity was 98.0% (49/50, specificity was 99.2% (602/607, the positive predictive value was 90.7% (49/54, and the negative predictive value was 99.8% (602/603. In conclusion, DVCT has the potential to provide high image quality across a wide range of heart rates using an optimized ECG pulsing window. However, it is recommended to control heart rate below 70 beats per minute, if possible, to decrease the radiation dose

  10. Improved hybrid information filtering based on limited time window

    Science.gov (United States)

    Song, Wen-Jun; Guo, Qiang; Liu, Jian-Guo

    2014-12-01

    Adopting the entire collecting information of users, the hybrid information filtering of heat conduction and mass diffusion (HHM) (Zhou et al., 2010) was successfully proposed to solve the apparent diversity-accuracy dilemma. Since the recent behaviors are more effective to capture the users' potential interests, we present an improved hybrid information filtering of adopting the partial recent information. We expand the time window to generate a series of training sets, each of which is treated as known information to predict the future links proven by the testing set. The experimental results on one benchmark dataset Netflix indicate that by only using approximately 31% recent rating records, the accuracy could be improved by an average of 4.22% and the diversity could be improved by 13.74%. In addition, the performance on the dataset MovieLens could be preserved by considering approximately 60% recent records. Furthermore, we find that the improved algorithm is effective to solve the cold-start problem. This work could improve the information filtering performance and shorten the computational time.

  11. Influence Diffusion in Social Networks under Time Window Constraints

    CERN Document Server

    Gargano, Luisa; Peters, Joseph G; Vaccaro, Ugo

    2013-01-01

    We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/opinions on the basis of information collected from their neighbors in a time interval of bounded size whereas agents are assumed to have unbounded memory in previously studied scenarios. In our mathematical framework, one is given a network $G=(V,E)$, an integer value $t(v)$ for each node $v\\in V$, and a time window size $\\lambda$. The goal is to determine a small set of nodes (target set) that influences the whole graph. The spread of influence proceeds in rounds as follows: initially all nodes in the target set are influenced; subsequently, in each round, any uninfluenced node $v$ becomes influenced if the number of its neighbors that have been influenced in the previous $\\lambda$ rounds is greater than or equal to $t(v)$. We prove that the problem of finding a minimum cardinality target set that influences the whole network $G$ ...

  12. Hybrid Approach for the Public Transportation Time Dependent Orienteering Problem with Time Windows

    Science.gov (United States)

    Garcia, Ander; Arbelaitz, Olatz; Vansteenwegen, Pieter; Souffriau, Wouter; Linaza, Maria Teresa

    The Time Dependent Orienteering Problem with Time Windows (TDOPTW) consists of a set of locations with associated time windows and scores. Visiting a location allows to collect its score as a reward. Traveling time between locations varies depending on the leave time. The objective is to obtain a route that maximizes the obtained score within a limited amount of time. In this paper we target the use of public transportation in a city, where users may move on foot or by public transportation. The approach can also be applied to the logistic sector, for example to the multimodal freight transportation. We apply an hybrid approach to tackle the problem. Experimental results for the city of San Sebastian show we are able to obtain valid routes in real-time.

  13. Two mathematical formulations for the containers drayage problem with time windows

    Directory of Open Access Journals (Sweden)

    Popović, D.

    2012-01-01

    Full Text Available The containers drayage problem studied here arise in ISO container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but mostly 20ft, and 40ft empty and/or loaded should be delivered to, or collected from the customers. Therefore, the problem studied here is closely related to the vehicle routing problem with the time windows that finds an optimal set of or routes visiting deliveries and pickups customers. The specificity of the container drayage problem analyzed here lies in the fact that a truck may simultaneously carry one 40ft, or two 20ft containers, using an appropriate trailer type. This means that in one route two, three or four nodes can be visited, which is equivalent to the problem of matching nodes in single routes which provide a total travel distance shorter than in the case when nodes are visited separately. The paper presents two optimal MIP mathematical formulations for the case when pickup and delivery nodes could be visited only in specific time interals - time windows. Proposed approaches are tested on numerical examples.

  14. Optimal lead time for dengue forecast.

    Directory of Open Access Journals (Sweden)

    Yien Ling Hii

    Full Text Available BACKGROUND: A dengue early warning system aims to prevent a dengue outbreak by providing an accurate prediction of a rise in dengue cases and sufficient time to allow timely decisions and preventive measures to be taken by local authorities. This study seeks to identify the optimal lead time for warning of dengue cases in Singapore given the duration required by a local authority to curb an outbreak. METHODOLOGY AND FINDINGS: We developed a Poisson regression model to analyze relative risks of dengue cases as functions of weekly mean temperature and cumulative rainfall with lag times of 1-5 months using spline functions. We examined the duration of vector control and cluster management in dengue clusters > = 10 cases from 2000 to 2010 and used the information as an indicative window of the time required to mitigate an outbreak. Finally, we assessed the gap between forecast and successful control to determine the optimal timing for issuing an early warning in the study area. Our findings show that increasing weekly mean temperature and cumulative rainfall precede risks of increasing dengue cases by 4-20 and 8-20 weeks, respectively. These lag times provided a forecast window of 1-5 months based on the observed weather data. Based on previous vector control operations, the time needed to curb dengue outbreaks ranged from 1-3 months with a median duration of 2 months. Thus, a dengue early warning forecast given 3 months ahead of the onset of a probable epidemic would give local authorities sufficient time to mitigate an outbreak. CONCLUSIONS: Optimal timing of a dengue forecast increases the functional value of an early warning system and enhances cost-effectiveness of vector control operations in response to forecasted risks. We emphasize the importance of considering the forecast-mitigation gaps in respective study areas when developing a dengue forecasting model.

  15. STUDI TENTANG TRAVELLING SALESMAN DAN VEHICLE ROUTING PROBLEM DENGAN TIME WINDOWS

    OpenAIRE

    I Nyoman Sutapa; I Gede Agus Widyadana; Christine Christine

    2003-01-01

    The article shows the study of model development of travelling salesman problem. Three models are studied, i.e. travelling salesman problem with time windows, vehicle routing problem, and vehicle routing problem with time windows. Abstract in Bahasa Indonesia : Dalam artikel ini dipaparkan kajian mengenai pengembangan model travelling salesman problem. Ada tiga model yang dikaji yaitu travelling salesman problem dengan time windows, vehicle routing problem, serta vehicle routing problem denga...

  16. Optimization of finite difference forward modeling for elastic waves based on optimum combined window functions

    Science.gov (United States)

    Jian, Wang; Xiaohong, Meng; Hong, Liu; Wanqiu, Zheng; Yaning, Liu; Sheng, Gui; Zhiyang, Wang

    2017-03-01

    Full waveform inversion and reverse time migration are active research areas for seismic exploration. Forward modeling in the time domain determines the precision of the results, and numerical solutions of finite difference have been widely adopted as an important mathematical tool for forward modeling. In this article, the optimum combined of window functions was designed based on the finite difference operator using a truncated approximation of the spatial convolution series in pseudo-spectrum space, to normalize the outcomes of existing window functions for different orders. The proposed combined window functions not only inherit the characteristics of the various window functions, to provide better truncation results, but also control the truncation error of the finite difference operator manually and visually by adjusting the combinations and analyzing the characteristics of the main and side lobes of the amplitude response. Error level and elastic forward modeling under the proposed combined system were compared with outcomes from conventional window functions and modified binomial windows. Numerical dispersion is significantly suppressed, which is compared with modified binomial window function finite-difference and conventional finite-difference. Numerical simulation verifies the reliability of the proposed method.

  17. Optimized Paraunitary Filter Banks for Time-Frequency Channel Diagonalization

    Directory of Open Access Journals (Sweden)

    Ju Ziyang

    2010-01-01

    Full Text Available We adopt the concept of channel diagonalization to time-frequency signal expansions obtained by DFT filter banks. As a generalization of the frequency domain channel representation used by conventional orthogonal frequency-division multiplexing receivers, the time-frequency domain channel diagonalization can be applied to time-variant channels and aperiodic signals. An inherent error in the case of doubly dispersive channels can be limited by choosing adequate windows underlying the filter banks. We derive a formula for the mean-squared sample error in the case of wide-sense stationary uncorrelated scattering (WSSUS channels, which serves as objective function in the window optimization. Furthermore, an enhanced scheme for the parameterization of tight Gabor frames enables us to constrain the window in order to define paraunitary filter banks. We show that the design of windows optimized for WSSUS channels with known statistical properties can be formulated as a convex optimization problem. The performance of the resulting windows is investigated under different channel conditions, for different oversampling factors, and compared against the performance of alternative windows. Finally, a generic matched filter receiver incorporating the proposed channel diagonalization is discussed which may be essential for future reconfigurable radio systems.

  18. Optimized Paraunitary Filter Banks for Time-Frequency Channel Diagonalization

    Science.gov (United States)

    Ju, Ziyang; Hunziker, Thomas; Dahlhaus, Dirk

    2010-12-01

    We adopt the concept of channel diagonalization to time-frequency signal expansions obtained by DFT filter banks. As a generalization of the frequency domain channel representation used by conventional orthogonal frequency-division multiplexing receivers, the time-frequency domain channel diagonalization can be applied to time-variant channels and aperiodic signals. An inherent error in the case of doubly dispersive channels can be limited by choosing adequate windows underlying the filter banks. We derive a formula for the mean-squared sample error in the case of wide-sense stationary uncorrelated scattering (WSSUS) channels, which serves as objective function in the window optimization. Furthermore, an enhanced scheme for the parameterization of tight Gabor frames enables us to constrain the window in order to define paraunitary filter banks. We show that the design of windows optimized for WSSUS channels with known statistical properties can be formulated as a convex optimization problem. The performance of the resulting windows is investigated under different channel conditions, for different oversampling factors, and compared against the performance of alternative windows. Finally, a generic matched filter receiver incorporating the proposed channel diagonalization is discussed which may be essential for future reconfigurable radio systems.

  19. Solving Optimal Timing Problems Elegantly

    OpenAIRE

    Todorova, Tamara

    2013-01-01

    Few textbooks in mathematical economics cover optimal timing problems. Those which cover them do it scantly or in a rather clumsy way, making it hard for students to understand and apply the concept of optimal time in new contexts. Discussing the plentiful illustrations of optimal timing problems, we present an elegant and simple method of solving them. Whether the present value function is exponential or logarithmic, a convenient way to solve it is to convert the base to the exponential numb...

  20. Analysis of Energy Saving Potential and Optimization of Thermally Broken Fiberglass Window Frames

    DEFF Research Database (Denmark)

    Zajas, Jan Jakub; Heiselberg, Per

    2011-01-01

    are considered, as a simple benchmark for various investigations. Further on, the complexity is gradually increased. Various means of diminishing the heat flow are evaluated. Results show that large improvement can be obtained, when cavities are subdivided by vertical walls or filled with insulation. U value......This paper elaborates on the energy saving potential and development process of fiberglass window frames, with intention for application in cold climates. A method is presented, where different means of improving thermal performance of a window frame are evaluated. Firstly, very simple geometries...... of a window frame can be significantly reduced by these means. Performance of an actual fiberglass frame optimized in this work is significantly improved, but still not competitive against state of the art frames. This indicates that more drastic improvements need to be done in order to achieve satisfying...

  1. A genetic algorithm for dynamic inbound ordering and outbound dispatching problem with delivery time windows

    Science.gov (United States)

    Kim, Byung Soo; Lee, Woon-Seek; Koh, Shiegheun

    2012-07-01

    This article considers an inbound ordering and outbound dispatching problem for a single product in a third-party warehouse, where the demands are dynamic over a discrete and finite time horizon, and moreover, each demand has a time window in which it must be satisfied. Replenishing orders are shipped in containers and the freight cost is proportional to the number of containers used. The problem is classified into two cases, i.e. non-split demand case and split demand case, and a mathematical model for each case is presented. An in-depth analysis of the models shows that they are very complicated and difficult to find optimal solutions as the problem size becomes large. Therefore, genetic algorithm (GA) based heuristic approaches are designed to solve the problems in a reasonable time. To validate and evaluate the algorithms, finally, some computational experiments are conducted.

  2. Traversing Time and Space from the Blessing Window

    Science.gov (United States)

    Huang, Ya-Ling

    2013-02-01

    The visual graphics for the holographic artwork "Blessing Window" were created from observations of Tainan city, with a focus on the beauty of Chinese characters, their typographic. The concept of movement in the artwork is from a traditional Chinese philosophy, "When the mountain does not move, the road extends, when the road does not extend to the destination, the heart will extend". One multiplex-hologram and an interactive installation were used to combine the visual concepts of typography and the philosophy.

  3. The Value of Inaccurate Advance Time Window Information in a Pick-up and Delivery Problem

    NARCIS (Netherlands)

    F.J. Srour (Jordan); N.A.H. Agatz (Niels); J. Oppen (Johan)

    2014-01-01

    textabstractWe examine different routing strategies to cope with inaccurate time window in- formation in the context of a dynamic pick-up and delivery problem with time windows. Our experiments show that advance information, even if inaccurate, can provide benefits from a planning perspective. We

  4. The vehicle routing problem with time windows: State-of-the-art exact solution methods

    DEFF Research Database (Denmark)

    Desaulniers, Guy; Desrosiers, Jacques; Spoorendonk, Simon

    2011-01-01

    The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to service given customers exactly once each while satisfying the vehicle capacity and customer time windows. The VRPTW has been widely studied. We present here a short survey on the successful exact...

  5. Restricting the h-index to a citation time window: A case study of a timed Hirsch index

    CERN Document Server

    Schreiber, Michael

    2014-01-01

    The h-index has been shown to increase in many cases mostly because of citations to rather old publications. This inertia can be circumvented by restricting the evaluation to a citation time window. Here I report results of an empirical study analyzing the evolution of the thus defined timed h-index in dependence on the length of the citation time window.

  6. Optimization of the inhibition of atmospheric window emission using photonic crystals

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    Transfer matrix method is used to discuss the effect inhibition of photonic crystals on atmospheric window emission(ε-14 μm).According to the optical characteristics of the materials,germanium and zinc sulfide are used as the composing materials.The structure of the photonic crystals is optimized,and the optimal thickness values of the germanium and zinc sulfide are 0.63 and 1.11μm respectively while the ratio of optical thickness is 1:1 and the period is 8.The photonic crystals are prepared by evaporation coating method,and the optical properties of the photonic crystals are measured,the inhibition of the photonic crystals to atmospheric window emission is verified.

  7. Focused attention vs. crossmodal signals paradigm: Deriving predictions from the time-window-of-integration model

    Directory of Open Access Journals (Sweden)

    Hans eColonius

    2012-08-01

    Full Text Available In the crossmodal signals paradigm (CSP participants are instructed to respond to a set of stimuli from different modalities, presented more or less simultaneously, as soon as a stimulus from any modality has been detected. In the focused attention paradigm (FAP, on the other hand, responses should only be made to a stimulus from a pre-defined target modality and stimuli from non-target modalities should be ignored. Whichever paradigm is being applied, a typical result is that responses tend to be faster to crossmodal stimuli than to unimodal stimuli, a phenomenon often referred to as 'crossmodal interaction'. Here we investigate predictions of the time-window-of-integration (TWIN modeling framework previously proposed by the authors. It is shown that TWIN makes specific qualitative and quantitative predictions on how the two paradigms differ with respect to the probability of multisensory integration and the amount of response enhancement, including the effect of stimulus intensity ('inverse effectiveness'. Introducing a decision-theoretic framework for TWIN further allows comparing the two paradigms with respect to the predicted optimal time window size and its dependence on the prior probability that the crossmodal stimulus information refers to the same event. In order to test these predictions, experimental studies that systematically compare crossmodal effects under stimulus conditions that are identical except for the CSP-FAP instruction should be performed in the future.

  8. Relative Performance of Certain Meta Heuristics on Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sandhya

    2015-11-01

    Full Text Available —Solving Vehicle Routing Problem (VRP and its variants arise in many real life distribution systems. Classical VRP can be described as the problem of finding minimum cost routes with identical vehicles having fixed capacity which starts from a depot and reaches a number of customers with known demands with the proviso that each route starts and ends at the depot and the demand of each customer does not exceed the vehicle capacity is met. One of the generalizations of standard VRP is Vehicle Routing Problem with Time Windows (VRPTW with added complexity of serving every customer within a specified time window. Since VRPTW is a NP hard meta heuristics have often been designed for solving it. In this paper we compare the performance of Simulated Annealing (SA, genetic Algorithm (GA and Ant Colony Optimization (ACO for solving VRPTW based on their performance using different parameters taking total travel distance as the objective to be minimized. The results indicate that ACO is in general slightly more efficient then SA and GA.

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

  10. Optimization of Multiple Active Ion Doped Fiber Amplifiers for Three Communication Windows

    Directory of Open Access Journals (Sweden)

    Chun Jiang

    2009-01-01

    Full Text Available We present for the first time a theoretical model of Er3+-Tm3+-Pr3+ codoped fiber pumped with both 800 nm and 980 nm lasers to explore possibility of this co-doped system as all-wave fiber amplifier. The rate and power propagation equations of the model are solved numerically and the dependence of the gains at 1310, 1470, 1530, 1600, 1650 nm windows on fiber length is calculated. The results show that with pump power of 200 mW/200 mW, when the concentrations of Pr3+, Tm3+, Er3+ are around 1.7×1024, 3.9×1024, 1.2×1024 (ions/m3, respectively, the signals at 1310, 1470, 1530, 1600, 1650 nm may be nearly equally amplified with gain of 13–16.0 dB in the active fiber with length of 23.5 m; the co-doping concentrations and fiber length and pump powers may be further optimized to reduce the ripple.

  11. Simple Design Tool for Development of Well Insulated Window Frames and Optimization of the Frame Geometry

    DEFF Research Database (Denmark)

    Zajas, Jan Jakub; Heiselberg, Per

    2012-01-01

    is generated by the program and is used by the finite element simulator to calculate the thermal performance of the frame (the U value). After the initial design is evaluated, the user can quickly modify chosen parameters and generate a new design. This process can then be repeated in multiple iterations...... in order to approach an optimal solution. The program was also used to conduct an optimization process of the frame geometry. A large number of various window frame designs were created and evaluated, based on their insulation properties. The paper presents the investigation process and some of the best...

  12. Branch and price for the time-dependent vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Dabia, Said; Van Woensel, Tom; De Kok, Ton

    2013-01-01

    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...... 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......This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider...

  13. Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms.

    Science.gov (United States)

    Wang, Jiahai; Zhou, Ying; Wang, Yong; Zhang, Jun; Chen, C L Philip; Zheng, Zibin

    2016-03-01

    This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.

  14. Vehicle Routing with Time Windows and Customer Selection for Perishable Goods

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2015-08-01

    Full Text Available Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several products to be delivered to customers with respect to their demands and with consideration of different soft time windows for each customer, heterogeneous distribution fleet and customer selection option for the distributer. The proposed model is solved with TH method. The two genetic algorithm and simulated annealing algorithm are used to solve large-sized problems. Finally, their results are compared to each other when the optimization software becomes unable of solution representation.

  15. Rational time-frequency multi-window subspace Gabor frames and their Gabor duals

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yan; LI YunZhang

    2014-01-01

    This paper addresses the theory of multi-window subspace Gabor frame with rational time-frequency parameter products.With the help of a suitable Zak transform matrix,we characterize multi-window subspace Gabor frames,Riesz bases,orthonormal bases and the uniqueness of Gabor duals of type I and type II.Using these characterizations we obtain a class of multi-window subspace Gabor frames,Riesz bases,orthonormal bases,and at the same time we derive an explicit expression of their Gabor duals of type I and type II.As an application of the above results,we obtain characterizations of multi-window Gabor frames,Riesz bases and orthonormal bases for L2(R),and derive a parametric expression of Gabor duals for multi-window Gabor frames in L2(R).

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

  17. Determination of the optimal tolerance for MLC positioning in sliding window and VMAT techniques

    Energy Technology Data Exchange (ETDEWEB)

    Hernandez, V., E-mail: vhernandezmasgrau@gmail.com; Abella, R. [Department of Medical Physics, Hospital Sant Joan de Reus, IISPV, Tarragona 43204 (Spain); Calvo, J. F. [Department of Radiation Oncology, Hospital Quirón, Barcelona 08023 (Spain); Jurado-Bruggemann, D. [Department of Medical Physics, Institut Català d’Oncologia, Girona 17007 (Spain); Sancho, I. [Department of Medical Physics, Institut Català d’Oncologia, L’Hospitalet de Llobregat 08908 (Spain); Carrasco, P. [Department of Medical Physics, Hospital de la Santa Creu i Sant Pau, Barcelona 08041 (Spain)

    2015-04-15

    Purpose: Several authors have recommended a 2 mm tolerance for multileaf collimator (MLC) positioning in sliding window treatments. In volumetric modulated arc therapy (VMAT) treatments, however, the optimal tolerance for MLC positioning remains unknown. In this paper, the authors present the results of a multicenter study to determine the optimal tolerance for both techniques. Methods: The procedure used is based on dynalog file analysis. The study was carried out using seven Varian linear accelerators from five different centers. Dynalogs were collected from over 100 000 clinical treatments and in-house software was used to compute the number of tolerance faults as a function of the user-defined tolerance. Thus, the optimal value for this tolerance, defined as the lowest achievable value, was investigated. Results: Dynalog files accurately predict the number of tolerance faults as a function of the tolerance value, especially for low fault incidences. All MLCs behaved similarly and the Millennium120 and the HD120 models yielded comparable results. In sliding window techniques, the number of beams with an incidence of hold-offs >1% rapidly decreases for a tolerance of 1.5 mm. In VMAT techniques, the number of tolerance faults sharply drops for tolerances around 2 mm. For a tolerance of 2.5 mm, less than 0.1% of the VMAT arcs presented tolerance faults. Conclusions: Dynalog analysis provides a feasible method for investigating the optimal tolerance for MLC positioning in dynamic fields. In sliding window treatments, the tolerance of 2 mm was found to be adequate, although it can be reduced to 1.5 mm. In VMAT treatments, the typically used 5 mm tolerance is excessively high. Instead, a tolerance of 2.5 mm is recommended.

  18. Iterated local search algorithm for solving the orienteering problem with soft time windows.

    Science.gov (United States)

    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.

  19. Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO

    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.

  20. A HYBRID GENETIC ALGORITHM IMPLEMENTATION FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Directory of Open Access Journals (Sweden)

    Muhammad Faisal Ibrahim

    2016-01-01

    Full Text Available This article is related to approach development in order to determine the most appropriate route for bottled water delivery from warehouse to retail from particular boundaries such as a limit on number of vehicle, vehicle capacity, and time windows to each retail. A mathematical model of VRPTW is adopted to solve the problem. Malang is one of the drinking water production centers in Indonesia, definitely it will be difficult for the company to determine the optimal delivery route with the existing restrictions. In this research hybrid genetic algorithm is use to determine the route shipping companies with the Java programming language. After analyzing the results obtained show that the results of the implementation of hybrid genetic algorithm is better than the company actual route. Moreover, authors also analyze the effect the number of iterations for the computation time, and the influence the number of iterations for the fitness value or violation. This algorithm can be applied for the routing and the result obtained is an optimal solution

  1. Scatter correction in myocardial thallium SPECT. Needs for optimization of energy window settings in the energy window-based scatter correction techniques

    Energy Technology Data Exchange (ETDEWEB)

    Narita, Yuichiro [Akita Research Institute of Brain and Blood Vessels (Japan); Iida, Hidehiro

    1999-02-01

    Accuracy and limitation of energy-window based scatter correction techniques have been evaluated for myocardial {sup 201}Tl SPECT by means of Monte Carlo simulation. In particular, projection view-dependency of energy distribution of the scattered photons was evaluated. Two geometrical configurations were simulated; namely a homogeneous cylindrical radioactivity located asymmetrically in a homogeneous cylindrical phantom, and a homogeneous ring radioactivity positioned at the myocardial region of a human thorax phantom. Energy spectra were recorded for each projection, and accuracy of the triple-energy window (TEW) method was then evaluation for both phantoms. The energy distribution of the scattered photons was apparently dependent on the projection view. TEW also demonstrated systematic overcorrection for the scatter because of multiple photo peaks around 80 keV, and more importantly, the error was highly dependent on the projection view. The error reached to 35-38% for the view that is the closest to the {sup 201}Tl radioactivity (anterior view in case of the myocardial ring phantom), and was approximately 20% in the opposite view. This view-dependency of the error remained for other energy window settings, and was found to cause significant artifact in the reconstructed myocardial images, typically causing a defect in the anterior myocardial wall. Thus, this study demonstrated the need for optimizing the window settings for each projection view in all energy window-based scatter correction methods. (author)

  2. Solving Vehicle Routing with Full Container Load and Time Windows

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Spoorendonk, Simon; Pisinger, David

    2012-01-01

    A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import...... and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small...

  3. "Visual"时代Windows API函数的使用%Application of Windows API Function in Visual Times

    Institute of Scientific and Technical Information of China (English)

    杨平; 李建武; 李茗

    2004-01-01

    在"Visual"时代,Windows API函数是进入操作系统核心进行高级编程的重要工具.本文介绍了Windows API函数概念,通过示例分析如何在Visual Basic、Delphi、Visual C++等语言中使用Windows API函数对操作系统核心进行编程.

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

    DEFF Research Database (Denmark)

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

    . 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......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...... instances. The main contribution of this article is the addition of synchronization between teams in an exact optimization context....

  5. Phase Retrieval From Multiple-Window Short-Time Fourier Measurements

    Science.gov (United States)

    Li, Lan; Cheng, Cheng; Han, Deguang; Sun, Qiyu; Shi, Guangming

    2017-04-01

    In this paper, we introduce two symmetric directed graphs depending on supports of signals and windows, and we show that the connectivity of those graphs provides either necessary and sufficient conditions to phase retrieval of a signal from magnitude measurements of its multiple-window short-time Fourier transform. Also we propose an algebraic reconstruction algorithm, and provide an error estimate to our algorithm when magnitude measurements are corrupted by deterministic/random noises.

  6. Automatic selection of an optimal systolic and diastolic reconstruction windows for dual-source CT coronary angiography

    Science.gov (United States)

    Seifarth, H.; Puesken, M.; Wienbeck, S.; Maintz, D.; Heindel, W.; Juergens, K.-U.

    2008-03-01

    Purpose: To assess the performance of a motion map algorithm to automatically determine the optimal systolic and diastolic reconstruction window for coronary CT Angiography using Dual Source CT. Materials and Methods: Dual Source coronary CT angiography data sets (Somatom Definition, Siemens Medical Solutions) from 50 consecutive patients were included in the analysis. Optimal systolic and diastolic reconstruction windows were determined using a motion map algorithm (BestPhase, Siemens Medical Solutions). Additionally data sets were reconstructed in 5% steps throughout the RR-interval. For each major vessel (RCA, LAD and LCX) an optimal systolic and diastolic reconstruction window was manually determined by two independent readers using volume rendering displays. Image quality was rated using a five-point scale (1 = no motion artifacts, 5 = severe motion artifacts over entire length of the vessel). Results: The mean heart rate during the scan was 72.4bpm (+/-15.8bpm). Median systolic and diastolic reconstruction windows using the BestPhase algorithm were at 37% and 73% RR. The median manually selected systolic reconstruction window was 35 %, 30% and 35% for RCA, LAD, and LCX. For all vessels the median observer selected diastolic reconstruction window was 75%. Mean image quality using the BestPhase algorithm was 2.4 +/-0.9 for systolic reconstructions and 1.9 +/-1.1 for diastolic reconstructions. Using the manual approach, the mean image quality was 1.9 +/-0.5 and 1.7 +/-0.8 respectively. There was a significant difference in image quality between automatically and manually determined systolic reconstructions (p<0.01) but there was no significant difference in image quality in diastolic reconstructions. Conclusion: Automatic determination of the optimal reconstruction interval using the BestPhase algorithm is feasible and yields reconstruction windows similar to observer selected reconstruction windows. In diastolic reconstructions overall image quality is similar

  7. The optimal dosage and window of opportunity to maintain mitochondrial homeostasis following traumatic brain injury using the uncoupler FCCP.

    Science.gov (United States)

    Pandya, Jignesh D; Pauly, James R; Sullivan, Patrick G

    2009-08-01

    Experimental traumatic brain injury (TBI) leads to a rapid and extensive necrosis at the primary site of injury that appears to be driven in part by significant mitochondrial dysfunction. The present study is based on the hypothesis that TBI-induced, aberrant glutamate release increases mitochondrial Ca(2+) cycling/overload ultimately leading to mitochondrial damage. Previous work from our laboratory demonstrates that mitochondrial uncoupling during the acute phases of TBI-induced excitotoxicity can reduce mitochondrial Ca(2+) uptake (cycling), ROS production and mitochondrial damage resulting in neuroprotection and improved behavioral outcome. The current study was designed to determine the optimal dosage and therapeutic window of opportunity for the potent mitochondrial uncoupler FCCP following moderate TBI. For this study, we used young adult male Sprague-Dawley rats (300-350 g); either sham-operated or moderately (1.5 mm) injured using the controlled cortical impactor (CCI) model of TBI. In the first set of studies animals were injected with either vehicle (100% DMSO) or different concentrations of FCCP (0.5, 1, 2.5 and 5 mg/kg in 100% DMSO) intraperitoneally at 5 min post-injury; tested behaviorally at 10 days and cortical sparing assessed at 18 days post-injury. The results demonstrate that of all the dosages tested, 2.5 mg/kg rendered the maximum improvement in behavioral outcomes and tissue spared. Using this optimal dose (2.5 mg/kg) and time point for intervention (5 min post-injury), we assessed mitochondrial bioenergetics and mitochondrial structural integrity 24 h post-injury. Furthermore, using this dosage we assessed mitochondrial bioenergetics and Ca(2+) loading at 3 and 6 h post-injury to further verify our target mechanism and establish these assessments as a valid endpoint to use as a means to determine the therapeutic window of FCCP. To begin to address the window of opportunity for maintaining mitochondrial homeostasis, the optimal dose of FCCP

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

  9. An Efficient MIP Model for Locomotive Scheduling with Time Windows

    OpenAIRE

    Aronsson, Martin; Kreuger, Per; Gjerdrum, Jonatan

    2006-01-01

    This paper presents an IP model for a vehicle routing and scheduling problem from the domain of freight railways. The problem is non-capacitated but allows non-binary integer flows of vehicles between transports with departure times variable within fixed intervals. The model has been developed with and has found practical use at Green Cargo, the largest freight rail operator in Sweden.

  10. Time Series Outlier Detection Based on Sliding Window Prediction

    Directory of Open Access Journals (Sweden)

    Yufeng Yu

    2014-01-01

    Full Text Available In order to detect outliers in hydrological time series data for improving data quality and decision-making quality related to design, operation, and management of water resources, this research develops a time series outlier detection method for hydrologic data that can be used to identify data that deviate from historical patterns. The method first built a forecasting model on the history data and then used it to predict future values. Anomalies are assumed to take place if the observed values fall outside a given prediction confidence interval (PCI, which can be calculated by the predicted value and confidence coefficient. The use of PCI as threshold is mainly on the fact that it considers the uncertainty in the data series parameters in the forecasting model to address the suitable threshold selection problem. The method performs fast, incremental evaluation of data as it becomes available, scales to large quantities of data, and requires no preclassification of anomalies. Experiments with different hydrologic real-world time series showed that the proposed methods are fast and correctly identify abnormal data and can be used for hydrologic time series analysis.

  11. Electrical analysis of wideband and distributed windows using time-dependent field codes

    Science.gov (United States)

    Shang, C. C.; Caplan, M.; Nickel, H. U.; Thumm, M.

    1993-09-01

    Windows, which provide the barrier to maintain the vacuum envelope in a microwave tube, are critical components in high-average-power microwave sources, especially at millimeter wavelengths. As RF power levels approach the 100's of kWs to 1 MW range (CW), the window assembly experiences severe thermal and mechanical stresses. Depending on the source, the bandwidth of the window may be less than 1 GHz for gyrotron oscillators or up to approximately 20 GHz for the FOM Institute's fast-tunable, free-electron-maser. The bandwidth requirements give rise to a number of window configurations where the common goal is locally distributed heat dissipation. In order to better understand the transmission and RF properties of these microwave structures, the authors use detailed time-dependent field solvers.

  12. Soil residence time: A window into landscape morphologic steady state

    Science.gov (United States)

    Almond, P. C.; Roering, J. J.

    2005-12-01

    For a landscape in true morphologic steady state the erosion rate and the average residence time of the debris mantle regolith (including the soils) are everywhere equal. Where other factors influencing soil properties such as climate, organisms and parent material are relatively invariant the degree of weathering and extent of pedological development in the debris mantle regolith should be spatially invariant. The corollary to this argument, commonly exploited in soil-geomorphic analysis, is that variation in debris mantle regolith development in a landscape reflects inheritance of older geomorphic surfaces and hence departure from steady state, at least over some time and space scale. The Oregon Coast Range (OCR) experiences a constant rate of rock uplift and has escaped the effects of Pleistocene glacial and periglacial processes. Furthermore, rock uplift and denudation rates have been shown to be approximately in balance, and consequently the OCR is promoted as being a good candidate for a (flux) steady state landscape. This is, however, not a sufficient condition for morphologic steady state, which is often assumed in numerical landscape simulations. The rock underlying the OCR is relatively homogeneous turbidites of the Tyee formation, and climatic and vegetation factors are relatively uniform over large areas. The degree of weathering and pedological development of the regolith on hillslopes should therefore dominantly reflect variation in regolith residence time, such that significant variation implies non-morphologic-steady state conditions. Indeed, spatial variation in soil/regolith age indicates the extent of departure from morphologic steady state. We have observed ubiquitous but localised deep, highly weathered regoliths and soils on ridge tops in the OCR. The extent, depth, geometry and elevational distribution of these deep regolith patches combined with relative measures of their age derived from total element and meteoric 10Be inventory will enable

  13. Multi-rate optimized contention window backoff algorithm in WLAN%多速率最优竞争窗口的WLAN退避算法

    Institute of Scientific and Technical Information of China (English)

    胡国柱; 王吉军; 杨凯

    2009-01-01

    This paper brings up a multi-rate optimized contention window algorithm after studying fore researches on multi-rate backoff algorithms in IEEE 802.11 DCF.The core of this algorithm is using the optimized contention window as nodes' initial contention window value based on time equity,in order to reduce the probability of data collision.The results of emulational experiments show that under saturated environment,the performance on time equity and system throughput is better than fore algorithms.%在对原有的IEEE 802.11 DCF多速率退避算法研究的基础上,提出了基于多速率的最优竞争窗口退避算法(Multi-rateOptimized Contention Window algorithm,MOCW).该算法的核心思想是在多速率时间公平性的基础上,利用理论上的最优窗口值作为节点的初始窗口值,以此来减小多节点同时发送数据时的碰撞概率.仿真实验表明,该算法在饱和状态下,无论在时间公平性还是系统吞吐量的性能上都有所提高.

  14. Effect of the time window on the heat-conduction information filtering model

    Science.gov (United States)

    Guo, Qiang; Song, Wen-Jun; Hou, Lei; Zhang, Yi-Lu; Liu, Jian-Guo

    2014-05-01

    Recommendation systems have been proposed to filter out the potential tastes and preferences of the normal users online, however, the physics of the time window effect on the performance is missing, which is critical for saving the memory and decreasing the computation complexity. In this paper, by gradually expanding the time window, we investigate the impact of the time window on the heat-conduction information filtering model with ten similarity measures. The experimental results on the benchmark dataset Netflix indicate that by only using approximately 11.11% recent rating records, the accuracy could be improved by an average of 33.16% and the diversity could be improved by 30.62%. In addition, the recommendation performance on the dataset MovieLens could be preserved by only considering approximately 10.91% recent records. Under the circumstance of improving the recommendation performance, our discoveries possess significant practical value by largely reducing the computational time and shortening the data storage space.

  15. Nutrient timing revisited: is there a post-exercise anabolic window?

    Directory of Open Access Journals (Sweden)

    Aragon Alan Albert

    2013-01-01

    Full Text Available Abstract Nutrient timing is a popular nutritional strategy that involves the consumption of combinations of nutrients--primarily protein and carbohydrate--in and around an exercise session. Some have claimed that this approach can produce dramatic improvements in body composition. It has even been postulated that the timing of nutritional consumption may be more important than the absolute daily intake of nutrients. The post-exercise period is widely considered the most critical part of nutrient timing. Theoretically, consuming the proper ratio of nutrients during this time not only initiates the rebuilding of damaged muscle tissue and restoration of energy reserves, but it does so in a supercompensated fashion that enhances both body composition and exercise performance. Several researchers have made reference to an anabolic “window of opportunity” whereby a limited time exists after training to optimize training-related muscular adaptations. However, the importance - and even the existence - of a post-exercise ‘window’ can vary according to a number of factors. Not only is nutrient timing research open to question in terms of applicability, but recent evidence has directly challenged the classical view of the relevance of post-exercise nutritional intake with respect to anabolism. Therefore, the purpose of this paper will be twofold: 1 to review the existing literature on the effects of nutrient timing with respect to post-exercise muscular adaptations, and; 2 to draw relevant conclusions that allow practical, evidence-based nutritional recommendations to be made for maximizing the anabolic response to exercise.

  16. The Vehicle Routing Problem with Time Windows and Temporal Dependencies

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper

    assignment and routing problem with synchronization constraints. The problem has been solved by column generation. The synchronized vehicle dispatching problem (SVDP), which is a dynamic vehicle routing problem with synchronization between vehicles. Constraint programming and local search are applied...... to arrive at high-quality feasible solutions. A problem from the Port of Singapore, where technicians are allocated to service jobs has previously been studied. For each job, a certain combination of technicians with individual skills is needed. The technicians must be present at the same time, and hence...... the schedule for each technician must respect a number of synchronization constraints with other schedules. The problem is solved using metaheuristics. Another application with synchronization between visits is in ground handling at airports. Teams drive around at the airport and are assigned tasks...

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

  18. 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...... generation process converges slowly for the problem and therefore a stabilization procedure is implemented. Valid inequalities expressed in the original, arc-based variables are added to the LP relaxation to strengthen the lower bound. The proposed algorithm is compared to exact algorithms based on other...

  19. Therapeutic time window for the neuroprotective effects of NGF when administered after focal cerebral ischemia.

    Science.gov (United States)

    Yang, Ji-Ping; Liu, Huai-Jun; Yang, Hua; Feng, Ping-Yong

    2011-06-01

    In the present study, we evaluated the neuroprotection time window for nerve growth factor (NGF) after ischemia/reperfusion brain injury in rabbits as related to this anti-apoptosis mechanism. Male New Zealand rabbits were subjected to 2 h of middle cerebral artery occlusion (MCAO), followed by 70 h of reperfusion. NGF was administered after injury to evaluate the time window. Neurological deficits, infarct volume, neural cell apoptosis and expressions of caspase-3 and Bcl-2 were measured. Compared to saline-treated control, NGF treatment at 2, 3 and 5 h after MCAO significantly reduced infarct volume, neural cell apoptosis and expression of caspase-3 (P NGF provides an extended time window of up to 5 h after ischemia/reperfusion brain injury, in part by attenuating the apoptosis.

  20. Urban Distribution: The Impacts of Different Governmental Time-Window Schemes

    NARCIS (Netherlands)

    H.J. Quak (Hans); M.B.M. de Koster (René)

    2006-01-01

    textabstractLocal authorities increasingly use time-access regulations to improve social sustainability issues, such as the attractiveness of a city centre, the shopping climate, or to reduce the nuisance caused by urban freight transport. However, these time-windows increase delivery costs and the

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

  2. Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows

    NARCIS (Netherlands)

    F. Jordan Srour (F.); N.A.H. Agatz (Niels); J. Oppen (Johan)

    2014-01-01

    textabstractIn many real-life routing problems there is more uncertainty with respect to the required timing of the service than with respect to the service locations. We focus on a pickup and delivery problem with time windows in which the pickup and drop-off locations of the service requests are

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

    , simul-taneously. In operation, the feeders have to be replenished a number of times so as to maintain the manufacture of products during a planning horizon. A meth-od based on predefined characteristics of the feeders is presented to generate dynamic time windows of the feeding tasks which are dependent...

  4. Urban Distribution: The Impacts of Different Governmental Time-Window Schemes

    NARCIS (Netherlands)

    H.J. Quak (Hans); M.B.M. de Koster (René)

    2006-01-01

    textabstractLocal authorities increasingly use time-access regulations to improve social sustainability issues, such as the attractiveness of a city centre, the shopping climate, or to reduce the nuisance caused by urban freight transport. However, these time-windows increase delivery costs and the

  5. Improved Detection of Time Windows of Brain Responses in Fmri Using Modified Temporal Clustering Analysis

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    @@ Temporal clustering analysis (TCA) has been proposed recently as a method to detect time windows of brain responses in functional MRI (fMRI) studies when the timing and location of the activation are completely unknown. Modifications to the TCA technique are introduced in this report to further improve the sensitivity in detecting brain activation.

  6. 基于软时间窗的产品配送与安装相分离的车辆调度优化%Optimization for vehicle routeing with separated delivery and installation of products based on soft time windows

    Institute of Scientific and Technical Information of China (English)

    庞海军; 丁以中

    2012-01-01

    In order to satisfy the unique need of logistics in electronics industry, a variant of the Vehicle Routeing Problem (VRP) is studied based on the unique characteristics of electronics industry. The synchronism of the delivery and installation of products is separated, and a Mixed-Integer Nonlinear Programming (MINP) model is presented to minimize the traveling time of delivery and installation, which is the optimization model of VRP for delivery and installation based on soft time windows. Comparative analysis of the results illustrates the feasibility and effectiveness of the hierarchical approach and Genetic Algorithm (GA). The method can improve the efficiency of logistics distribution, reduce the enterprises' logistics cost, and improve the service level.%为满足电子行业独特的物流配送需求,依据电子行业的特点,研究一种变形的车辆调度问题(Vehicle Routeing Problem,VRP).将产品的配送与安装的同步性进行分离,建立以最小配送和安装旅行时间为目标的混合整数非线性规划(Mixed-Integer Nonlinear Programming,MINP)模型,即基于软时间窗的配送和安装车辆调度优化模型.对算例计算结果的比较分析表明采用分层方法和遗传算法(Genetic Algorithm,GA)的可行性和有效性.该模型可以提高电子行业的物流配送效率,降低物流成本,提高服务水平.

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

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

  8. Improving the Performance of PbS Quantum Dot Solar Cells by Optimizing ZnO Window Layer

    Science.gov (United States)

    Yang, Xiaokun; Hu, Long; Deng, Hui; Qiao, Keke; Hu, Chao; Liu, Zhiyong; Yuan, Shengjie; Khan, Jahangeer; Li, Dengbing; Tang, Jiang; Song, Haisheng; Cheng, Chun

    2017-04-01

    Comparing with hot researches in absorber layer, window layer has attracted less attention in PbS quantum dot solar cells (QD SCs). Actually, the window layer plays a key role in exciton separation, charge drifting, and so on. Herein, ZnO window layer was systematically investigated for its roles in QD SCs performance. The physical mechanism of improved performance was also explored. It was found that the optimized ZnO films with appropriate thickness and doping concentration can balance the optical and electrical properties, and its energy band align well with the absorber layer for efficient charge extraction. Further characterizations demonstrated that the window layer optimization can help to reduce the surface defects, improve the heterojunction quality, as well as extend the depletion width. Compared with the control devices, the optimized devices have obtained an efficiency of 6.7% with an enhanced V oc of 18%, J sc of 21%, FF of 10%, and power conversion efficiency of 58%. The present work suggests a useful strategy to improve the device performance by optimizing the window layer besides the absorber layer.

  9. Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory

    2010-01-01

    This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositions which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.

  10. Speeding up the solution process for the Vehicle Routing Problem with Time Windows using structural information

    DEFF Research Database (Denmark)

    Larsen, Jesper

    2002-01-01

    Two ideas for using structural information for solving the Vehicle Routing Problem with Time Windows (VRPTW) is presented. The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP). Both techniques are based on solving the VRPTW using a Branch...

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

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

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

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

  13. Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

    OpenAIRE

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

  14. Moving-window dynamic optimization: design of stimulation profiles for walking.

    Science.gov (United States)

    Dosen, Strahinja; Popović, Dejan B

    2009-05-01

    The overall goal of the research is to improve control for electrical stimulation-based assistance of walking in hemiplegic individuals. We present the simulation for generating offline input (sensors)-output (intensity of muscle stimulation) representation of walking that serves in synthesizing a rule-base for control of electrical stimulation for restoration of walking. The simulation uses new algorithm termed moving-window dynamic optimization (MWDO). The optimization criterion was to minimize the sum of the squares of tracking errors from desired trajectories with the penalty function on the total muscle efforts. The MWDO was developed in the MATLAB environment and tested using target trajectories characteristic for slow-to-normal walking recorded in healthy individual and a model with the parameters characterizing the potential hemiplegic user. The outputs of the simulation are piecewise constant intensities of electrical stimulation and trajectories generated when the calculated stimulation is applied to the model. We demonstrated the importance of this simulation by showing the outputs for healthy and hemiplegic individuals, using the same target trajectories. Results of the simulation show that the MWDO is an efficient tool for analyzing achievable trajectories and for determining the stimulation profiles that need to be delivered for good tracking.

  15. On the practical convergence of coda-based correlations: a window optimization approach

    Science.gov (United States)

    Chaput, J.; Clerc, V.; Campillo, M.; Roux, P.; Knox, H.

    2016-02-01

    We present a novel optimization approach to improve the convergence of interstation coda correlation functions towards the medium's empirical Green's function. For two stations recording a series of impulsive events in a multiply scattering medium, we explore the impact of coda window selection through a Markov Chain Monte Carlo scheme, with the aim of generating a gather of correlation functions that is the most coherent and symmetric over events, thus recovering intuitive elements of the interstation Green's function without any nonlinear post-processing techniques. This approach is tested here for a 2-D acoustic finite difference model, where a much improved correlation function is obtained, as well as for a database of small impulsive icequakes recorded on Erebus Volcano, Antarctica, where similar robust results are shown. The average coda solutions, as deduced from the posterior probability distributions of the optimization, are further representative of the scattering strength of the medium, with stronger scattering resulting in a slightly delayed overall coda sampling. The recovery of singly scattered arrivals in the coda of correlation functions are also shown to be possible through this approach, and surface wave reflections from outer craters on Erebus volcano were mapped in this fashion. We also note that, due to the improvement of correlation functions over subsequent events, this approach can further be used to improve the resolution of passive temporal monitoring.

  16. Layered Formulation for the Robust Vehicle Routing Problem with Time Windows

    OpenAIRE

    2012-01-01

    International audience; This paper studies the vehicle routing problem with time windows where travel times are uncertain and belong to a predetermined polytope. The objective of the problem is to find a set of routes that services all nodes of the graph and that are feasible for all values of the travel times in the uncertainty polytope. The problem is motivated by maritime transportation where delays are frequent and must be taken into account. We present an extended formulation for the veh...

  17. Effects of time window size and placement on the structure of aggregated networks

    CERN Document Server

    Krings, Gautier; Bernharsson, Sebastian; Blondel, Vincent D; Saramäki, Jari

    2012-01-01

    Complex networks are often constructed by aggregating empirical data over time, such that a link represents the existence of interactions between the endpoint nodes and the link weight represents the intensity of such interactions within the aggregation time window. The resulting networks are then often considered static. More often than not, the aggregation time window is dictated by the availability of data, and the effects of its length on the resulting networks are rarely considered. Here, we address this question by studying the structural features of networks emerging from aggregating empirical data over different time intervals, focussing on networks derived from time-stamped, anonymized mobile telephone call records. Our results show that short aggregation intervals yield networks where strong links associated with dense clusters dominate; the seeds of such clusters or communities become already visible for intervals of around one week. The degree and weight distributions are seen to become stationary...

  18. DPOAEs in infants developmentally exposed to PCBs show two differently time spaced exposure sensitive windows.

    Science.gov (United States)

    Koštiaková, Vladimíra; Moleti, Arturo; Wimmerová, Soňa; Jusko, Todd A; Palkovičová Murínová, Ľubica; Sisto, Renata; Richterová, Denisa; Kováč, Ján; Čonka, Kamil; Patayová, Henrieta; Tihányi, Juraj; Trnovec, Tomáš

    2016-10-01

    The study aim was to identify the timing of sensitive windows for ototoxicity related to perinatal exposure to PCBs. A total of 351 and 214 children from a birth cohort in eastern Slovakia underwent otoacoustic testing at 45 and 72 months, respectively, and distortion product otoacoustic emissions (DPOAEs) at 11 frequencies were recorded. Cord and child 6-, 16-, 45-, and 72- month blood samples were analyzed for PCB 153 concentration. The PCB 153 concentration-time profiles were approximated with a system model to calculate area under the PCB*time curves (AUCs) for specific time intervals (3 and 6 months for 45 and 72 months data, respectively). DPOAE amplitudes were correlated (Spearman) with cord serum PCB and AUCs, markers of prenatal and postnatal exposure, respectively. Two exposure critical windows were identified in infants, the first related to prenatal and early postnatal and the second to postnatal exposure to PCBs. Our data have shown tonotopicity, sexual dimorphism, and asymmetry in ototoxicity of PCBs.

  19. Windowing of THz time-domain spectroscopy signals: A study based on lactose

    Science.gov (United States)

    Vázquez-Cabo, José; Chamorro-Posada, Pedro; Fraile-Peláez, Francisco Javier; Rubiños-López, Óscar; López-Santos, José María; Martín-Ramos, Pablo

    2016-05-01

    Time-domain spectroscopy has established itself as a reference method for determining material parameters in the terahertz spectral range. This procedure requires the processing of the measured time-domain signals in order to estimate the spectral data. In this work, we present a thorough study of the properties of the signal windowing, a step previous to the parameter extraction algorithm, that permits to improve the accuracy of the results. Lactose has been used as sample material in the study.

  20. Vehicle Minimization for the Multimodal Pickup and Delivery Problem with Time Windows

    Science.gov (United States)

    2013-03-01

    problems for parallel machines. The VRP solved is subject to time windows and capacity constraints on vehicles and offloading. The VRP is multimodal. The...addresses a special case of the VRP . The VRP considered is multimodal with time constraints. It is also subject to capacity constraints, both on...Consequently, the problem can also be considered to be a special case of the Fleet Size and Mix Problem. The primary issue in solving any VRP is

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

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

  2. Exponential Stability of Cohen-Grossberg Neural Networks with Impulse Time Window

    Directory of Open Access Journals (Sweden)

    Mei Liu

    2016-01-01

    Full Text Available This paper concerns the problem of exponential stability for a class of Cohen-Grossberg neural networks with impulse time window and time-varying delays. In our letter, the impulsive effects we considered can stochastically occur at a definitive time window and the impulsive controllers we considered can be nonlinear and even rely on the states of all the neurons. Hence, the impulses here can be more applicable and more general. By utilizing Lyapunov functional theory, inequality technique, and the analysis method, we obtain some novel and effective exponential stability criteria for the Cohen-Grossberg neural networks. These results generalize a few previous known results and numerical simulations are given to show the effectiveness of the derived results.

  3. Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

    CERN Document Server

    Papp, Dávid

    2013-01-01

    We propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. In this model, a 360-degree arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multi-leaf collimator (MLC) constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. We demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. For that purpose, we first obtain a reference plan for intensity modulated...

  4. Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal

    Directory of Open Access Journals (Sweden)

    Ary Arvianto

    2014-01-01

    Full Text Available In this paper we developed a VRP model for multiple routes, multiple time windows for multiple products and heterogeneous vehicles. The solution were constructed using a heuristic approach, i.e, a sequential insertion algorithm. Additionally, this model is applied to solve fuel distributions for eight customers in East Nusa Tenggara. It needs two tankers with capacity of 4700 kilo liters, so that those distributions can be accomplished with a minimum number of vehicles, total completion time, and range of completion time. The result of this study shows that for a heterogeneous vehicles problem, a vehicle with the largest capacity may not necessarily be the vehicle that provides an optimal solution. Moreover, advance trials should be conducted by providing a limited number of tankers for each tanker capacity, so the description of heterogeneous vehicles becomes more visible. In the future research, the solution will be improved by utilizing relocation techniques.

  5. Comparison of Imaging Characteristics of 124I PET for Determination of Optimal Energy Window on the Siemens Inveon PET

    Directory of Open Access Journals (Sweden)

    A Ram Yu

    2016-01-01

    Full Text Available Purpose.124I has a half-life of 4.2 days, which makes it suitable for imaging over several days over its uptake and washout phases. However, it has a low positron branching ratio (23%, because of prompt gamma coincidence due to high-energy γ-photons (602 to 1,691 keV, which are emitted in cascade with positrons. Methods. In this study, we investigated the optimal PET energy window for 124I PET based on image characteristics of reconstructed PET. Image characteristics such as nonuniformities, recovery coefficients (RCs, and the spillover ratios (SORs of 124I were measured as described in NEMA NU 4-2008 standards. Results. The maximum and minimum prompt gamma coincidence fraction (PGF were 33% and 2% in 350~800 and 400~590 keV, respectively. The difference between best and worst uniformity in the various energy windows was less than 1%. The lowest SORs of 124I were obtained at 350~750 keV in nonradioactive water compartment. Conclusion. Optimal energy window should be determined based on image characteristics. Our developed correction method would be useful for the correction of high-energy prompt gamma photon in 124I PET. In terms of the image quality of 124I PET, our findings indicate that an energy window of 350~750 keV would be optimal.

  6. Research of Vehicle Routing Problem Based on Fuzzy Time Windows%基于模糊时间窗的车辆调度问题研究

    Institute of Scientific and Technical Information of China (English)

    王旭坪; 张凯; 胡祥培

    2011-01-01

    An increasing number of enterprises are focusing on the vehicle routing problems (VRP) because of expanded logistics support. VRP belongs to typical NP-Hard problems. An enterprise typically spends 25% to 30% of total expenses on vehicle routing problems because they can affect economic efficiency and customer benefits. Therefore, it is important to research VRP and optimize logistics activities.Exiting literature has focused on the vehicle routing problem with hard time and soft time windows. In the VRP with hard time window, the service time must fall within each customer' s time window. Due to the limitation of hard time window and the number of available vehicles, it is often unable to find feasible schedules. To deal with issues pertaining to the violation of time window, researchers have proposed the concept of "soft time window". In the VRP with soft time window, a penalty cost is added once a time window is violated, and the penalty cost is often assumed to be linear with the degree of violation. In some cases, violation of time window does not directly incur any penalty cost, although the satisfaction levels of customers may drop and lead to benefit loss in the long term. In many realistic applications, the hard time window or soft time window does represent customer requirements very well. Under these circumstances, the fuzzy processing of time window can reflect customers' requirements well and truly. Until now, few studies have addressed VRP-with fuzzy time window when the number of vehicle is limited. There are many real-life situations where the number of vehicle is limited, such as logistics distribution, post express and so on. Thus, this paper proposes and solves vehicle routing problems based on the fuzzy time window and a definite number of vehicles. In this paper, a fuzzy membership function is used to characterize customers' satisfaction levels by analyzing customers' practical requirements of the service time window.A multi-objective model

  7. Collimator and energy window optimization for ⁹⁰Y bremsstrahlung SPECT imaging: A SIMIND Monte Carlo study.

    Science.gov (United States)

    Roshan, Hoda Rezaei; Mahmoudian, Babak; Gharepapagh, Esmaeil; Azarm, Ahmadreza; Islamian, Jalil Pirayesh

    2016-02-01

    Treatment efficacy of radioembolization using Yttrium-90 ((90)Y) microspheres is assessed by the (90)Y bremsstrahlung single photon emission computed tomography (SPECT) imaging following radioembolization. The radioisotopic image has the potential of providing reliable activity map of (90)Y microspheres distribution. One of the main reasons of the poor image quality in (90)Y bremsstrahlung SPECT imaging is the continuous and broad energy spectrum of the related bremsstrahlung photons. Furthermore, collimator geometry plays an impressive role in the spatial resolution, sensitivity and image contrast. Due to the relatively poor quality of the (90)Y bremsstrahlung SPECT images, we intend to optimize the medium-energy (ME) parallel-hole collimator and energy window. The Siemens e.cam gamma camera equipped with a ME collimator and a voxelized phantom was simulated by the SImulating Medical Imaging Nuclear Detectors (SIMIND) program. We used the SIMIND Monte Carlo program to generate the (90)Y bremsstrahlung SPECT projection of the digital Jaszczak phantom. The phantom consist of the six hot spheres ranging from 9.5 to 31.8mm in diameter, which are used to evaluate the image contrast. In order to assess the effect of the energy window on the image contrast, three energy windows ranging from 60 to 160 KeV, 160 to 400 KeV, and 60 to 400 KeV were set on a (90)Y bremsstrahlung spectrum. As well, the effect of the hole diameter of a ME collimator on the image contrast and bremsstrahlung spectrum were investigated. For the fixed collimator and septa thickness values (3.28 cm and 1.14 mm, respectively), a hole diameter range (2.35-3.3mm) was chosen based on the appropriate balance between the spatial resolution and sensitivity. The optimal energy window for (90)Y bremsstrahlung SPECT imaging was extended energy window from 60 to 400 KeV. Besides, The optimal value of the hole diameter of ME collimator was obtained 3.3mm. Geometry of the ME parallel-hole collimator and energy

  8. Further Exploration of the Dendritic Cell Algorithm: Antigen Multiplier and Time Windows

    CERN Document Server

    Gu, Feng; Aickelin, Uwe

    2010-01-01

    As an immune-inspired algorithm, the Dendritic Cell Algorithm (DCA), produces promising performances in the field of anomaly detection. This paper presents the application of the DCA to a standard data set, the KDD 99 data set. The results of different implementation versions of the DXA, including the antigen multiplier and moving time windows are reported. The real-valued Negative Selection Algorithm (NSA) using constant-sized detectors and the C4.5 decision tree algorithm are used, to conduct a baseline comparison. The results suggest that the DCA is applicable to KDD 99 data set, and the antigen multiplier and moving time windows have the same effect on the DCA for this particular data set. The real-valued NSA with constant-sized detectors is not applicable to the data set, and the C4.5 decision tree algorithm provides a benchmark of the classification performance for this data set.

  9. A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network

    Science.gov (United States)

    Ryu, Minsoo

    Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.

  10. Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows

    OpenAIRE

    2016-01-01

    The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only t...

  11. TWO-PHASE ALGORITHM FOR SOLVING HETEROGENEOUS TRAVELLING REPAIRMEN PROBLEM WITH TIME WINDOWS

    Directory of Open Access Journals (Sweden)

    Nenad Bjelić

    2015-03-01

    Full Text Available Heterogeneous travelling repairmen problem with time windows (hetTRPTW is customer oriented problem with large possibilities for practical applications in logistics area. Models and algorithms developed for solving one problem with a cumulative objective function may be, with a little effort, transformed for solving similar problem with a cumulative function. In that sense, aim of this paper is to present results obtained by implementing an algorithm developed for solving cumulative capacitated vehicle routing problem in solving hetTRPTW.

  12. 缺血后处理对脑缺血再灌注损伤大鼠的脑保护作用及其最佳时间窗的探讨%Neuroprotection and optimal time window of ischemic postconditioning against cerebral ischemia reperfusion injury in rats

    Institute of Scientific and Technical Information of China (English)

    刘佳丽; 王晔; 张迎

    2011-01-01

    Objective To investigate the optimal time window of ischemic postconditioning (IP) against focal cerebral ischemia-reper-fusion (I/R) injury. Methods Eighty male SD rats were randomly assigned into five groups: a sham-operated, a control and three IP (different time intervals: 15 s, 30 s and 1 min). Focal cerebral ischemia model was established via middle cerebral artery occlusion (MCAO) with the intraluminal filament technique. The neurological deficit scores (NDS) were evaluated 24 hours after reperfusion.The apoptosis of brain cells and the levels of TNF-α in the hippocampal CAl area were evaluated by TUNEL and immune stained method respectively. Results The behavioral tests showed IP attenuated neurological deficits after I/R. The NDS in the IP groups decreased significantly compared with the control group (P<0.05), and the NDS in the IP 15s and IP 30s groups were lower than in the IP 1 min group ( P< 0.05 ). The number of surviving neurons increased significantly in the IP groups as compared with the control group (P<0.05). IP significantly decreased the level of TNF-α in the hippocampal CA1 area compared with the control group (P <O.05 ). The level of TNF-α was significantly higher in the IPl min group than in the IP 15s and IP 30s groups (P< 0.05). Conclusions IP could improve functional outcomes, decrease the expression of TNF-α and reduce the nerve cell apoptosis. The optimal time window of IP against cerebral I/R injury may be 15 s and 30 s.%目的 探讨缺血后处理(IP)对大鼠局灶性脑缺血再灌注(I/R)神经保护作用的最佳时间窗.方法 80只雄性SD大鼠,随机分为5组(假手术组、对照组、IP 15s组、IP 30s组和IP 1mim组).假手术组和对照组行单纯I/R;IP 15s 组、IP 30s组和IP 1min组,反复3次缺血再灌注.除假手术组外的大鼠均采用线栓法闭塞大鼠大脑中动脉(MACO)建立脑缺血SD大鼠模型.所有大鼠行神经功能障碍评分(NDS),并应用组织原位标记凋亡细胞

  13. Optimal temporal windows and dose-reducing strategy for coronary artery bypass graft imaging with 256-slice CT

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Kun-Mu [Department of Radiology, Shin Kong Wu Ho-Su Memorial Hospital, 95 Wen Chang Road, Shih Lin District, Taipei 111, Taiwan. (China); Lee, Yi-Wei [Department of Radiology, Kaohsiung Chang Gung Memorial Hospital and Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); Department of Biomedical Imaging and Radiological Sciences, National Yang Ming University, Taipei, Taiwan (China); Guan, Yu-Xiang [Department of Biomedical Imaging and Radiological Sciences, National Yang Ming University, Taipei, Taiwan (China); Chen, Liang-Kuang [Department of Radiology, Shin Kong Wu Ho-Su Memorial Hospital, 95 Wen Chang Road, Shih Lin District, Taipei 111, Taiwan. (China); School of Medicine, Fu Jen Catholic University, Taipei, Taiwan (China); Law, Wei-Yip, E-mail: m002325@ms.skh.org.tw [Department of Radiology, Shin Kong Wu Ho-Su Memorial Hospital, 95 Wen Chang Road, Shih Lin District, Taipei 111, Taiwan. (China); Su, Chen-Tau, E-mail: m005531@ms.skh.org.tw [Department of Radiology, Shin Kong Wu Ho-Su Memorial Hospital, 95 Wen Chang Road, Shih Lin District, Taipei 111, Taiwan. (China); School of Medicine, Fu Jen Catholic University, Taipei, Taiwan (China)

    2013-12-11

    Objective: To determine the optimal image reconstruction windows in the assessment of coronary artery bypass grafts (CABGs) with 256-slice computed tomography (CT), and to assess their associated optimal pulsing windows for electrocardiogram-triggered tube current modulation (ETCM). Methods: We recruited 18 patients (three female; mean age 68.9 years) having mean heart rate (HR) of 66.3 beats per minute (bpm) and a heart rate variability of 1.3 bpm for this study. A total of 36 CABGs with 168 segments were evaluated, including 12 internal mammary artery (33.3%) and 24 saphenous vein grafts (66.7%). We reconstructed 20 data sets in 5%-step through 0–95% of the R–R interval. The image quality of CABGs was assessed by a 5-point scale (1=excellent to 5=non-diagnostic) for each segment (proximal anastomosis, proximal, middle, distal course of graft body, and distal anastomosis). Two reviewers discriminated optimal reconstruction intervals for each CABG segment in each temporal window. Optimal windows for ETCM were also evaluated. Results: The determined optimal systolic and diastolic reconstruction intervals could be divided into 2 groups with threshold HR=68. The determined best reconstruction intervals for low heart rate (HR<68) and high heart rate (HR>68) were 76.0±2.5% and 45.0±0% respectively. Average image quality scores were 1.7±0.6 with good inter-observer agreement (Kappa=0.79). Image quality was significantly better for saphenous vein grafts versus arterial grafts (P<0.001). The recommended windows of ETCM for low HR, high HR and all HR groups were 40–50%, 71–81% and 40–96% of R-R interval, respectively. The corresponding dose savings were about 60.8%, 58.7% and 22.7% in that order. Conclusions: We determined optimal reconstruction intervals and ETCM windows representing a good compromise between radiation and image quality for following bypass surgery using a 256-slice CT.

  14. Optimal Design for the Diffusion Plate with Nanoparticles in a Diffusive Solar Cell Window by Mie Scattering Simulation

    Directory of Open Access Journals (Sweden)

    Ruei-Tang Chen

    2013-01-01

    Full Text Available A diffusive solar cell window comprises a diffusion plate with TiO2 nanoparticles sandwiched between two glass layers. It is a simple, inexpensive, easy-to-made, and highly reliable transparent solar energy module. To improve its power generation efficiency as well as maintain indoor natural lighting, we examined the scattering mechanism in the diffusion plate with TiO2 nanoparticles within a diffusive solar cell window by Mie scattering simulations. In this work, a multiwavelength ASAP ray tracing model for a diffusive solar cell window with acceptable accuracy was developed to investigate the influence of the diffusion plate design parameter, mainly concentration of a diffusion plate with determined particle size distribution, on power generation efficiency and color shift of transmitted sun light. A concept of “effective average radius” was proposed to account for the equivalent scattering effect of a size distribution of quasispherical particles. Simulation results demonstrated that both the transmitted light and its correlated color temperature decreased as the concentration increased for a large-size diffusive solar cell window. However, there existed a maximum power generation efficiency at around 160 ppm concentration. The optimal design for a large-size diffusion plate inside a diffusive solar cell window by taking indoor lighting into account was suggested based on the simulation results.

  15. Study on Reverse Logistics Considered Cold-chain Logistics Vehicle Routing Optimization with Time Window Constraint%时间窗约束下带逆向物流的冷链物流车辆路径优化研究

    Institute of Scientific and Technical Information of China (English)

    宋志兰; 黄欢; 张壮

    2016-01-01

    In this paper, in view of the characteristics of the cold chain logistics distribution routes, we introduced the reverse logistics vehicle routing process with time window constraint into the cold chain logistics vehicle routing problem, taking into consideration cargo delivery and pick-up, the fixed vehicle cost and the transportation, the loss cost, energy cost, penalty cost and reputation cost in the event of breaking the time window of the customers in the cargo delivery process, built the reverse logistics considered cold chain logistics distribution cost model aiming at satisfying the time window constraint of the customers, and at the end, demonstrated the feasibility of the model through an empirical case study.%针对冷链物流配送路径的特性,将时间窗约束下的逆向物流车辆配送路径方法引入冷链物流配送路径优化问题中,在冷链物流配送路径问题中同时考虑送货和取货,不仅考虑车辆固定成本和运输成本,还考虑了在配送过程中货物的损耗成本、能源消耗成本以及违反客户时间窗带来的惩罚成本、信用损失等成本,建立了使得服务时间满足顾客时间窗约束的带逆向物流的冷链物流配送成本模型。最后以某生鲜食品连锁店为例,运用建立的模型进行路径规划,验证了模型的可行性。

  16. A new supply chain management method with one-way time window: A hybrid PSO-SA approach

    Directory of Open Access Journals (Sweden)

    Reza Tavakkoli-Moghaddam

    2012-01-01

    Full Text Available In this paper, we study a supply chain problem where a whole seller/producer distributes goods among different retailers. The proposed model of this paper is formulated as a more general and realistic form of traditional vehicle routing problem (VRP. The main advantages of the new proposed model are twofold. First, the time window does not consider any lower bound and second, it treats setup time as separate cost components. The resulted problem is solved using a hybrid of particle swarm optimization and simulated annealing (PSO-SA. The results are compared with other hybrid method, which is a combination of Ant colony and Tabu search. We use some well-known benchmark problems to compare the results of our proposed model with other method. The preliminary results indicate that the proposed model of this paper performs reasonably well.

  17. Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Rong-Hwa Huang

    2013-01-01

    Full Text Available The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both small and large problems, EACO is more effective and robust than both the particle swarm optimization (PSO algorithm and the ACO algorithm. Importantly, this work demonstrates that EACO can solve complex scheduling problems in an acceptable period of time.

  18. Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window

    CERN Document Server

    Chan, Ho-Leung; Lee, Lap-Kei; Ting, Hing-Fung

    2009-01-01

    The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distributed data streams over a time-based sliding window (which contains a variable number of items and possibly out-of-order items). The concern is how to minimize the communication between individual streams and the root, while allowing the root, at any time, to be able to report the global statistics of all streams within a given error bound. This paper presents communication-efficient algorithms for three classical statistics, namely, basic counting, frequent items and quantiles. The worst-case communication cost over a window is $O(\\frac{k} {\\epsilon} \\log \\frac{\\epsilon N}{k})$ bits for basic counting and $O(\\frac{k}{\\epsilon} \\log \\frac{N}{k})$ words for the remainings, where $k$ is the number of distributed data streams, $N$ is the total number of items in the streams that arrive or expire in the window, and $\\epsilon < 1$ is...

  19. Impact maturity times and citation time windows: The 2-year maximum journal impact factor

    CERN Document Server

    Dorta-Gonzalez, Pablo

    2013-01-01

    Journal metrics are employed for the assessment of scientific scholar journals from a general bibliometric perspective. In this context, the Thomson Reuters journal impact factors (JIF) are the citation-based indicators most used. The 2-year journal impact factor (2-JIF) counts citations to one and two year old articles, while the 5-year journal impact factor (5-JIF) counts citations from one to five year old articles. Nevertheless, these indicators are not comparable among fields of science for two reasons: (i) each field has a different impact maturity time, and (ii) because of systematic differences in publication and citation behaviour across disciplines. In fact, the 5-JIF firstly appeared in the Journal Citation Reports (JCR) in 2007 with the purpose of making more comparable impacts in fields in which impact matures slowly. However, there is not an optimal fixed impact maturity time valid for all the fields. In some of them two years provides a good performance whereas in others three or more years are...

  20. Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

    Directory of Open Access Journals (Sweden)

    Peiqing Li

    2015-01-01

    Full Text Available Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with time windows but also the effect of road irregularities on the bruising of fresh fruits and vegetables. The main objective of this work was to obtain the optimal distribution routes for fresh fruits and vegetables considering different road classes with the least amount of logistics costs. An improved genetic algorithm was used to solve the problem. A fruit delivery route among the 13 cities in Jiangsu Province was used as a real analysis case. The simulation results showed that the vehicle routing problem with time windows, considering road irregularities and different classes of toll roads, can significantly influence total delivery costs compared with traditional VRP models. The comparison between four models to predict the total cost and actual total cost in distribution showed that the improved genetic algorithm is superior to the Group-based pattern, CW pattern, and O-X type cross pattern.

  1. Time window characteristics of cultured rat hippocampal neurons subjected to ischemia and reperfusion

    Institute of Scientific and Technical Information of China (English)

    XU Zhong; XU Ru-xiang; LIU Bao-song; JIANG Xiao-dan; HUANG Tao; DING Lian-shu; YUAN Jun

    2005-01-01

    Objective: To explore cell death and apoptosis in rat hippocampal neurons at different time points after ischemia, hypoxia and reperfusion injury and to elucidate time window characteristics in ischemia neuronal injury.Methods: Hippocampal neurons were obtained from rat embryo and were cultured in vitro. The ischemia and reperfusion of cultured rat hippocampal neurons were simulated by oxygen-glucose deprivation (OGD) and recovery. OGD at different time points (0.25 h to 3.0 h) and then the same recovery (24 h) were prepared. Annexin V-PI staining and flow cytometry examined neuron death and apoptosis at different time after injury. Results: After OGD and recovery, both necrosis and apoptosis were observed. At different times after OGD, there were statistically significant differences in neuron necrosis rate (P0.05). At recovery, survival rate of hippocampal neurons further decreased while apoptosis rate increased. Furthermore, apoptosis rates of different time differed greatly (P<0.05). Apoptosis rate gradually increased with significant difference among those of different time points (P<0.05). However, 2 h after ischemia, apoptosis rate decreased markedly.Conclusions: Apoptosis is an important pathway of delayed neuron death. The therapeutic time window should be within 2 h after cerebral ischemia and hypoxia.

  2. A Quasi Time Optimal Receding Horizon Control

    OpenAIRE

    Bania, Piotr

    2007-01-01

    This paper presents a quasi time optimal receding horizon control algorithm. The proposed algorithm generates near time optimal control when the state of the system is far from the target. When the state attains a certain neighbourhood of the aim, it begins the adaptation of the cost function. The purpose of this adaptation is to move from the time optimal control to the stabilizing control. Sufficient conditions for the stability of the closed loop system and the manner of the adaptation of ...

  3. Optimized tuning of contention window for IEEE 802.11 WLAN

    African Journals Online (AJOL)

    In wireless networks, the size of Contention Window (CW) plays a vital role as it ... 2003), one of the most fundamental methods, all stations compete for the ..... almost 90% of the nodes are involved in active communication at any instant.

  4. A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet

    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.

  5. Optimized Temporal Window for Detection and Characterization of Renal Cell Carcinomas with Dynamic CT Scanning

    Institute of Scientific and Technical Information of China (English)

    Jinhong Wang; Peijun Wang; Xiaohu Zhao; Xinqin Mao; Xiaolong Gao; Jun Liu

    2005-01-01

    OBJECTIVE To investigate the optimized time period for detection and characterization of renal cell carcinomas (RCC) when the specific CT features appear during spiral dynamic CT scanning, and to optimize an effective scanning protocol of spiral CT for evaluating RCC.METHODS Twenty-four patients with RCC verified by pathology had undergone a dynamic CT (D-CT) scan. A plain scan was employed to select the target slice. Single-level dynamic scanning started at 14-17 s after the intravenous contrast media had been administered, with a scan interval of 4.9 s acquiring a total number of 17~24 frames. A regular CT scan of the whole kidney followed by a delayed single slice acquisition through the target slice in the excretory phase was performed. Images were assessed in two ways: (1) A group of experienced radiologists reviewed the CT images to find when the specific signs appeared and when the CT features of RCC were optimally displayed; (2) Data measurement of the time-density curves (T-DC) of RCC. The exact time was obtained when the densities of the tumor, renal parenchyma, medulla and aorta reached their peak enhancement, thus also the time when the density difference between tumor and parenchyma was at maximum (Max T-M). Based on the slope of the contrast media uptake curve, T-DC types were ranked from the smallest to the biggest of slope as type A, B and C.RESULTS 1. The review of the CT images by the radiologists showed that the CT features of RCC were optimally demonstrated at 70.2 s. The earliest time at which RCC CT features were examined was at 23.9 s. 2. Image data analysis: the time that the density (or CT value) of the tumor mass reached peak enhancement was at 54 s and peak value was at 80.4 Hu for RCC. The time of the maximal difference of densities between tumor and renal parenchyma was at 102 s.CONCLUSION The following proposal is the scanning protocol for detecting RCC recommended by our research: After a plain scan to determine the target level, a

  6. Time optimal paths for high speed maneuvering

    Energy Technology Data Exchange (ETDEWEB)

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

    1993-01-01

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

  7. Gearbox fault diagnosis of rolling mills using multiwavelet sliding window neighboring coefficient denoising and optimal blind deconvolution

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Fault diagnosis of rolling mills, especially the main drive gearbox, is of great importance to the high quality products and long-term safe operation. However, the useful fault information is usually submerged in heavy background noise under the severe condition. Thereby, a novel method based on multiwavelet sliding window neighboring coefficient denoising and optimal blind deconvolution is proposed for gearbox fault diagnosis in rolling mills. The emerging multiwavelets can seize the important signal processing properties simultaneously. Owing to the multiple scaling and wavelet basis functions, they have the supreme possibility of matching various features. Due to the periodicity of gearbox signals, sliding window is recommended to conduct local threshold denoising, so as to avoid the "overkill" of conventional universal thresholding techniques. Meanwhile, neighboring coefficient denoising, considering the correlation of the coefficients, is introduced to effectively process the noisy signals in every sliding window. Thus, multiwavelet sliding window neighboring coefficient denoising not only can perform excellent fault extraction, but also accords with the essence of gearbox fault features. On the other hand, optimal blind deconvolution is carried out to highlight the denoised features for operators’ easy identification. The filter length is vital for the effective and meaningful results. Hence, the foremost filter length selection based on the kurtosis is discussed in order to full benefits of this technique. The new method is applied to two gearbox fault diagnostic cases of hot strip finishing mills, compared with multiwavelet and scalar wavelet methods with/without optimal blind deconvolution. The results show that it could enhance the ability of fault detection for the main drive gearboxes.

  8. A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times

    Directory of Open Access Journals (Sweden)

    Zheng Wang

    2016-01-01

    Full Text Available This paper presents a saving-based heuristic for the vehicle routing problem with time windows and stochastic travel times (VRPTWSTT. One of the basic ideas of the heuristic is to advance the latest service start time of each customer by a certain period of time. In this way, the reserved time can be used to cope with unexpected travel time delay when necessary. Another important idea is to transform the VRPTWSTT to a set of vehicle routing problems with time windows (VRPTW, each of which is defined by a given percentage used to calculate the reserved time for customers. Based on the above two key ideas, a three-stage heuristic that includes the “problem transformation” stage, the “solution construction” stage, and the “solution improvement” stage is developed. After the problem transformation in the first stage, the work of the next two stages is to first construct an initial solution for each transformed VRPTW by improving the idea of the classical Clarke-Wright heuristic and then further improve the solution. Finally, a number of numerical experiments are conducted to evaluate the efficiency of the described methodology under different uncertainty levels.

  9. VLSI Architectures for Sliding-Window-Based Space-Time Turbo Trellis Code Decoders

    Directory of Open Access Journals (Sweden)

    Georgios Passas

    2012-01-01

    Full Text Available The VLSI implementation of SISO-MAP decoders used for traditional iterative turbo coding has been investigated in the literature. In this paper, a complete architectural model of a space-time turbo code receiver that includes elementary decoders is presented. These architectures are based on newly proposed building blocks such as a recursive add-compare-select-offset (ACSO unit, A-, B-, Γ-, and LLR output calculation modules. Measurements of complexity and decoding delay of several sliding-window-technique-based MAP decoder architectures and a proposed parameter set lead to defining equations and comparison between those architectures.

  10. Clique inequalities applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Spoorendonk, Simon; Desaulniers, Guy

    2010-01-01

    This work presents an exact branch-cut-and-price algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It shows how these cutting planes affect the dominance......, 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...

  11. Two-Phase Heuristic for the Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2007-08-01

    Full Text Available The subject of the paper is a complete solution for the vehicle routing problemwith time windows, an industrial realization of an NP hard combinatorial optimizationproblem. The primary objective –the minimization of the number of routes- is aimed in thefirst phase, the secondary objective –the travel distance minimization- is going to berealized in the second phase by tabu search. The initial route construction applies aprobability density function for seed selection. Guided Route Elimination procedure wasalso developed. The solution was tested on the Solomon Problem Set and seems to be verycompeitive with the best heuristics published in the latest years (2003-2005.

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

  13. On Time Delay Margin Estimation for Adaptive Control and Optimal Control Modification

    Science.gov (United States)

    Nguyen, Nhan T.

    2011-01-01

    This paper presents methods for estimating time delay margin for adaptive control of input delay systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent an adaptive law by a locally bounded linear approximation within a small time window. The time delay margin of this input delay system represents a local stability measure and is computed analytically by three methods: Pade approximation, Lyapunov-Krasovskii method, and the matrix measure method. These methods are applied to the standard model-reference adaptive control, s-modification adaptive law, and optimal control modification adaptive law. The windowing analysis results in non-unique estimates of the time delay margin since it is dependent on the length of a time window and parameters which vary from one time window to the next. The optimal control modification adaptive law overcomes this limitation in that, as the adaptive gain tends to infinity and if the matched uncertainty is linear, then the closed-loop input delay system tends to a LTI system. A lower bound of the time delay margin of this system can then be estimated uniquely without the need for the windowing analysis. Simulation results demonstrates the feasibility of the bounded linear stability method for time delay margin estimation.

  14. Efficient Data Collection in Widely Distributed Wireless Sensor Networks with Time Window and Precedence Constraints

    Science.gov (United States)

    Liu, Peng; Fu, Tingting; Xu, Jia; Ding, Yue

    2017-01-01

    In addition to the traditional densely deployed cases, widely distributed wireless sensor networks (WDWSNs) have begun to emerge. In these networks, sensors are far away from each other and have no network connections. In this paper, a special application of data collection for WDWSNs is considered where each sensor (Unmanned Ground Vehicle, UGV) moves in a hazardous and complex terrain with many obstacles. They have their own work cycles and can be accessed only at a few locations. A mobile sink cruises on the ground to collect data gathered from these UGVs. Considerable delay is inevitable if the UGV and the mobile sink miss the meeting window or wait idly at the meeting spot. The unique challenge here is that, for each cycle of an UGV, there is only a limited time window for it to appear in front of the mobile sink. Therefore, we propose scheduling the path of a single mobile sink, targeted at visiting a maximum number of UGVs in a timely manner with the shortest path, according to the timing constraints bound by the cycles of UGVs. We then propose a bipartite matching based algorithm to reduce the number of mobile sinks. Simulation results show that the proposed algorithm can achieve performance close to the theoretical maximum determined by the duty cycle instance. PMID:28241415

  15. Improved Multi-Agent System for the Vehicle Routing Problem with Time Windows

    Institute of Scientific and Technical Information of China (English)

    DAN Zhenggang; CAI Linning; ZHENG Li

    2009-01-01

    The vehicle routing problem with time windows (VRPTW) involves assigning a fleet of limited ca-pacity vehicles to serve a set of customers without violating the capacity and time constraints. This paper presents a multi-agent model system for the VRPTW based on the internal behavior of agents and coordina-tion among the agents. The system presents a formal view of coordination using the traditional contract-net protocol (CNP) that relies on the basic loop of agent behavior for order receiving, order announcement, bid calculation, and order scheduling followed by order execution. An improved CNP method based on a vehicle selection strategy is used to reduce the number of negotiations and the negotiation time. The model is vali-dated using Solomon's benchmarks, with the results showing that the improved CNP uses only 30% as many negotiations and only 70% of the negotiation time of the traditional CNP.

  16. The Luminaire Window

    DEFF Research Database (Denmark)

    Hansen, Ellen Kathrine

    2017-01-01

    The importance of dynamic daylight to support health and well-being has been more and more recognized. People in hospitals and health care environments have a specific need for optimized daylight conditions. Daylight penetration through window openings is crucial to stimulate circadian rhythm...... and maintain a healthy sleep-awake pattern. At the same time, the window can provide a pleasant view and connection to the surroundings and enhance the perception of the interior space and materials. All three factors are recognized as important for human well-being and health, but never the less...

  17. No specific time window distinguishes between community-, healthcare-, and hospital-acquired bacteremia, but they are prognostically robust

    DEFF Research Database (Denmark)

    Nielsen, Stig Lønberg; Pedersen, Court; Ostergaard, Christian;

    2014-01-01

    Objective. We examined whether specific time windows after hospital admission reflected a sharp transition between community and hospital acquisition of bacteremia. We further examined whether different time windows to distinguish between community acquisition, healthcare association (HCA...... mortality pertaining to bacteremia 0, 1, 2, …, 30, and 31 days and later after admission. Next, we assessed whether different admission (0-1, 0-2, 0-3, 0-7 days) and HCA (30, 90 days) time windows were associated with changes in odds ratio (OR) and area under the receiver operating characteristic (ROC......) curve for 30-day mortality, adjusting for sex, age, comorbidity, and microorganisms. Results. For 56,606 bacteremic episodes, no sharp transitions were detected on a specific day after admission. Among the 8 combined time windows, ORs for 30-day mortality varied from 1.30 (95% confidence interval [CI...

  18. Distributed Algorithms for Time Optimal Reachability Analysis

    DEFF Research Database (Denmark)

    Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

    2016-01-01

    Time optimal reachability analysis is a novel model based technique for solving scheduling and planning problems. After modeling them as reachability problems using timed automata, a real-time model checker can compute the fastest trace to the goal states which constitutes a time optimal schedule....... We propose distributed computing to accelerate time optimal reachability analysis. We develop five distributed state exploration algorithms, implement them in \\uppaal enabling it to exploit the compute resources of a dedicated model-checking cluster. We experimentally evaluate the implemented...... algorithms with four models in terms of their ability to compute near- or proven-optimal solutions, their scalability, time and memory consumption and communication overhead. Our results show that distributed algorithms work much faster than sequential algorithms and have good speedup in general....

  19. Investigation of Different Configurations of a Ventilated Window to Optimize Both Energy Efficiency and Thermal Comfort

    DEFF Research Database (Denmark)

    Liu, Mingzhe; Heiselberg, Per; Larsen, Olena Kalyanova

    2017-01-01

    on thermal comfort. Hourly simulations of the heat balances of the windows are conducted on four days representing different typical weather conditions according to the method described in EN ISO 13790. U and g values used in the calculation method are calculated in European software tool (WIS...

  20. The window of opportunity: decision theory and the timing of prognostic tests for newborn infants.

    Science.gov (United States)

    Wilkinson, Dominic

    2009-11-01

    In many forms of severe acute brain injury there is an early phase when prognosis is uncertain, followed later by physiological recovery and the possibility of more certain predictions of future impairment. There may be a window of opportunity for withdrawal of life support early, but if decisions are delayed there is the risk that the patient will survive with severe impairment. In this paper I focus on the example of neonatal encephalopathy and the question of the timing of prognostic tests and decisions to continue or to withdraw life-sustaining treatment. Should testing be performed early or later; and how should parents decide what to do given the conflicting values at stake? I apply decision theory to the problem, using sensitivity analysis to assess how different features of the tests or different values would affect a decision to perform early or late prognostic testing. I draw some general conclusions from this model for decisions about the timing of testing in neonatal encephalopathy. Finally I consider possible solutions to the problem posed by the window of opportunity. Decision theory highlights the costs of uncertainty. This may prompt further research into improving prognostic tests. But it may also prompt us to reconsider our current attitudes towards the palliative care of newborn infants predicted to be severely impaired.

  1. Time Windows of Interneuron Development: Implications to Our Understanding of the Aetiology and Treatment of Schizophrenia

    Directory of Open Access Journals (Sweden)

    Zarina Greenberg

    2015-11-01

    Full Text Available Schizophrenia is a devastating neuropsychiatric disorder widely believed to arise from defects during brain development. Indeed, dysfunction in the formation and function of GABAergic cortical interneurons has been implicated as a central pathogenic mechanism in this, and other, neurodevelopmental disorders. Understanding the coordination and timing of interneuron development including the complex processes of specification, proliferation, migration and their incorporation into finely tuned cortical networks is therefore essential in determining their role in neurodevelopmental disease. Studies using mouse models have highlighted the functional relevance of transcription factor networks and common signalling pathways in interneuron development but have faced challenges in identifying clear time windows where these factors are essential. Here we discuss recent developments highlighting critical time frames in the specification and migration of cortical interneurons and the impact of aberrant development to aetiology and treatments of schizophrenia.

  2. Optimal transformations for categorical autoregressive time series

    NARCIS (Netherlands)

    Buuren, S. van

    1996-01-01

    This paper describes a method for finding optimal transformations for analyzing time series by autoregressive models. 'Optimal' implies that the agreement between the autoregressive model and the transformed data is maximal. Such transformations help 1) to increase the model fit, and 2) to analyze c

  3. Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time

    Directory of Open Access Journals (Sweden)

    Tao Jia

    2014-01-01

    Full Text Available We investigate an integrated inventory routing problem (IRP in which one supplier with limited production capacity distributes a single item to a set of retailers using homogeneous vehicles. In the objective function we consider a loading cost which is often neglected in previous research. Considering the deterioration in the products, we set a soft time window during the transportation stage and a hard time window during the sales stage, and to prevent jams and waiting cost, the time interval of two successive vehicles returning to the supplier’s facilities is required not to be overly short. Combining all of these factors, a two-echelon supply chain mixed integer programming model under discrete time is proposed, and a two-phase algorithm is developed. The first phase uses tabu search to obtain the retailers’ ordering matrix. The second phase is to generate production scheduling and distribution routing, adopting a saving algorithm and a neighbourhood search, respectively. Computational experiments are conducted to illustrate the effectiveness of the proposed model and algorithm.

  4. Multi-trip vehicle routing and scheduling problem with time window in real life

    Science.gov (United States)

    Sze, San-Nah; Chiew, Kang-Leng; Sze, Jeeu-Fong

    2012-09-01

    This paper studies a manpower scheduling problem with multiple maintenance operations and vehicle routing considerations. Service teams located at a common service centre are required to travel to different customer sites. All customers must be served within given time window, which are known in advance. The scheduling process must take into consideration complex constraints such as a meal break during the team's shift, multiple travelling trips, synchronisation of service teams and working shifts. The main objective of this study is to develop a heuristic that can generate high quality solution in short time for large problem instances. A Two-stage Scheduling Heuristic is developed for different variants of the problem. Empirical results show that the proposed solution performs effectively and efficiently. In addition, our proposed approximation algorithm is very flexible and can be easily adapted to different scheduling environments and operational requirements.

  5. Identification of deleted plosives: The effect of adding noise or applying a time window (a reply of Ohde and sharf).

    Science.gov (United States)

    Pols, L C; Schouten, M E

    1981-01-01

    A Letter in this Journal [Ohde, R. N. and Sharf, D. J., J. Acoust. Soc. Am. 69, 297-300 (1981)] deals with the identification of voiced and voiceless stops from vocalic transition + vowel stimuli edited from CV and VC syllables. The segmentation points were smoothed by applying a time window. With respect to an earlier study, in which straightforward segmentation without time window was applied, final plosives were still identified better than initial plosives. The present Letter shows that there is, however, one major difference between the with-window and the no-window condition, namely a substantial improvement in identification for initial voiced plosives. This improvement is similar to that found by the present authors in identification experiments with a noise burst adjacent to the segmentation point versus no-noise listening conditions. Instead of a controversy reported by Ohde and Sharf, this Letter suggests a unifying interpretation.

  6. The Construction and Optimization of Moodle Platform on Windows Server 2012 R2 and Wamp Server%基于Windows Server 2012 R2、WampServer环境的Moodle平台搭建及优化扩展

    Institute of Scientific and Technical Information of China (English)

    马东宇

    2014-01-01

    研究了以WampServer集成环境为Web服务器,在Windows Server 2012 R2系统下搭建Moodle平台的过程,经比较试验得出了基于 Windows 8界面操作系统的平台架设环境,并从功能扩展和性能优化等方面给出了解决方案。%A process of Moodle platform construction is researched,using WampServer integrating environment as Web server under a system of Windows Server 2012 R2.After comparable experiments,a platform construction environment on Windows 8 surface operating system is got.And a solution is given from functional expansion,performance optimization and other aspects.

  7. Optimal time lags in panel studies.

    Science.gov (United States)

    Dormann, Christian; Griffin, Mark A

    2015-12-01

    Cross-lagged regression coefficients are frequently used to test hypotheses in panel designs. However, these coefficients have particular properties making them difficult to interpret. In particular, cross-lagged regression coefficients may vary, depending on the respective time lags between different sets of measurement occasions. This article introduces the concept of an optimal time lag. Further, it is demonstrated that optimal time lags in panel studies are related to the stabilities of the variables investigated, and that in unidirectional systems, they may be unrelated to the size of possible true effects. The results presented also suggest that optimal time lags for panel designs are usually quite short. Implications are (a) that interpreting cross-lagged regression coefficients requires taking the time lag between measurement occasions into account, and (b) that in much research, far shorter time lags than those frequently found in the literature are justifiable, and we call for more "shortitudinal" studies in the future. (c) 2015 APA, all rights reserved).

  8. A new fast friendly window-based congestion control for real-time streaming media transmission

    Institute of Scientific and Technical Information of China (English)

    LI Yongli; LIU Guizhong; ZHANG Zhongwei; WU Chenggui

    2005-01-01

    Real-time streaming media over the Internet is an important component of multimedia applications. For the sake of quality of service (QoS), they make rigid demands on bandwidth, delay and packet loss. However, the current Internet does not offer any QoS guarantees to real-time streaming media over it. How to maximize the transmission quality of real-time streaming applications in a best-effort network while friendly sharing bandwidth with non-real time applications like TCP has become an important issue. But now, many real-time streaming applications based on UDP rarely perform congestion control in a TCP-friendly manner, and they do not share the available bandwidth fairly with applications built on TCP. The Internet communication strongly fears that the current evolution could lead to congestion collapse and starvation of TCP traffic. For this reason, TCP-friendly protocols are being developed to behave fairly with respect to coexistent TCP flows. In this paper we present a new window-based congestion control method-fast fair binomial congestion control (FFBCC) for real-time applications. It provides a good performance of bandwidth distribution and TCP-friendliness for real-time streaming transmission while competing bandwidth with TCP flows.

  9. An Iterative Time Windowed Signature Algorithm for Time Dependent Transcription Module Discovery.

    Science.gov (United States)

    Meng, Jia; Gao, Shou-Jiang; Huang, Yufei

    2008-01-01

    An algorithm for the discovery of time varying modules using genome-wide expression data is present here. When applied to large-scale time serious data, our method is designed to discover not only the transcription modules but also their timing information, which is rarely annotated by the existing approaches. Rather than assuming commonly defined time constant transcription modules, a module is depicted as a set of genes that are co-regulated during a specific period of time, i.e., a time dependent transcription module (TDTM). A rigorous mathematical definition of TDTM is provided, which is serve as an objective function for retrieving modules. Based on the definition, an effective signature algorithm is proposed that iteratively searches the transcription modules from the time series data. The proposed method was tested on the simulated systems and applied to the human time series microarray data during Kaposi's sarcoma-associated herpesvirus (KSHV) infection. The result has been verified by Expression Analysis Systematic Explorer.

  10. An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Mladenović Nenad

    2013-01-01

    Full Text Available General Variable Neighborhood Search (GVNS is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems. However, its efficient implementation may play a significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving Travelling salesman problem with time windows. It uses different set of neighborhoods, new feasibility checking procedure and a more efficient data structure than the recent GVNS method that can be considered as a state-of-the-art heuristic. As a result, our GVNS is much faster and more effective than the previous GVNS. It is able to improve 14 out of 25 best known solutions for large test instances from the literature.

  11. 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...... this paper is structured relative to four seminal papers concerning the formulation and exact solution of the TSP, i.e. the arc formulation, the arc-node formulation, the spanning tree formulation, and the path formulation. We give a detailed analysis of the formulations of the VRPTW and a review...... with the analysis of the polyhedral structure of the VRPTW. We conclude by examining possible future lines of research in the area of the VRPTW....

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

    for defining the edge sets are discussed and formulated. Both the multigraph case and the direct path case are described, and mixed-integer-programming formulations of the problem are presented for both cases. A solution method based on branch-price-and-cut is applied to the direct path case. The computational......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....... 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...

  13. Dynamic scheduling with due dates and time windows: an application to chemotherapy patient appointment booking.

    Science.gov (United States)

    Gocgun, Yasin; Puterman, Martin L

    2014-03-01

    We study a scheduling problem in which arriving patients require appointments at specific future days within a treatment specific time window. This research is motivated by a study of chemotherapy scheduling practices at the British Columbia Cancer Agency (Canada). We formulate this problem as a Markov Decision Process (MDP). Since the resulting MDPs are intractable to exact methods, we employ linear-programming-based Approximate Dynamic Programming (ADP) to obtain approximate solutions. Using simulation, we compare the performance of the resulting ADP policies to practical and easy-to-use heuristic decision rules under diverse scenarios. The results indicate that ADP is promising in several scenarios, and that a specific easy-to-use heuristic performs well in the idealized chemotherapy scheduling setting we study.

  14. Self-organization model on receptive field of neuron with asymmetric time window of synaptic modification

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The spatial-temporal response properties of some simple neurons in visual pathway arise basically prior to birth. In the absence of visual experience, how do these neurons develop in visual system? Based on Wimbauer network with delay, a four-layer feed-forward network model is proposed, which is characterized by modifying the Hebb learning rule through introducing the asymmetric time window of synaptic modification found recently in neurobiology. The model can not only generate by self-organization more diversified spatial-temporal response characteristics of neuronal receptive field than earlier models but also provide some explanations for the possible mechanism underlying the development of receptive fields of contrast polarity sensitive neurons found in visual system of vertebrate. Thus the proposed model may be more widely applicable than Linsker model and Wimbauer model.

  15. Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows

    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.

  16. Online stochastic UAV mission planning with time windows and time-sensitive targets

    NARCIS (Netherlands)

    Evers, L.; Barros, A.I.; Monsuur, H.; Wagelmans, A.

    2014-01-01

    In this paper we simultaneously consider three extensions to the standard Orienteering Problem (OP) to model characteristics that are of practical relevance in planning reconnaissance missions of Unmanned Aerial Vehicles (UAVs). First, travel and recording times are uncertain. Secondly, the informat

  17. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  18. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  19. Window Regression: A Spatial-Temporal Analysis to Estimate Pixels Classified as Low-Quality in MODIS NDVI Time Series

    Directory of Open Access Journals (Sweden)

    Julio Cesar de Oliveira

    2014-04-01

    Full Text Available MODerate resolution Imaging Spectroradiometer (MODIS data are largely used in multitemporal analysis of various Earth-related phenomena, such as vegetation phenology, land use/land cover change, deforestation monitoring, and time series analysis. In general, the MODIS products used to undertake multitemporal analysis are composite mosaics of the best pixels over a certain period of time. However, it is common to find bad pixels in the composition that affect the time series analysis. We present a filtering methodology that considers the pixel position (location in space and time (position in the temporal data series to define a new value for the bad pixel. This methodology, called Window Regression (WR, estimates the value of the point of interest, based on the regression analysis of the data selected by a spatial-temporal window. The spatial window is represented by eight pixels neighboring the pixel under evaluation, and the temporal window selects a set of dates close to the date of interest (either earlier or later. Intensities of noises were simulated over time and space, using the MOD13Q1 product. The method presented and other techniques (4253H twice, Mean Value Iteration (MVI and Savitzky–Golay were evaluated using the Mean Absolute Percentage Error (MAPE and Akaike Information Criteria (AIC. The tests revealed the consistently superior performance of the Window Regression approach to estimate new Normalized Difference Vegetation Index (NDVI values irrespective of the intensity of the noise simulated.

  20. Determination of Equine Cytochrome c Backbone Amide Hydrogen/Deuterium Exchange Rates by Mass Spectrometry Using a Wider Time Window and Isotope Envelope

    Science.gov (United States)

    Hamuro, Yoshitomo

    2017-03-01

    A new strategy to analyze amide hydrogen/deuterium exchange mass spectrometry (HDX-MS) data is proposed, utilizing a wider time window and isotope envelope analysis of each peptide. While most current scientific reports present HDX-MS data as a set of time-dependent deuteration levels of peptides, the ideal HDX-MS data presentation is a complete set of backbone amide hydrogen exchange rates. The ideal data set can provide single amide resolution, coverage of all exchange events, and the open/close ratio of each amide hydrogen in EX2 mechanism. Toward this goal, a typical HDX-MS protocol was modified in two aspects: measurement of a wider time window in HDX-MS experiments and deconvolution of isotope envelope of each peptide. Measurement of a wider time window enabled the observation of deuterium incorporation of most backbone amide hydrogens. Analysis of the isotope envelope instead of centroid value provides the deuterium distribution instead of the sum of deuteration levels in each peptide. A one-step, global-fitting algorithm optimized exchange rate and deuterium retention during the analysis of each amide hydrogen by fitting the deuterated isotope envelopes at all time points of all peptides in a region. Application of this strategy to cytochrome c yielded 97 out of 100 amide hydrogen exchange rates. A set of exchange rates determined by this approach is more appropriate for a patent or regulatory filing of a biopharmaceutical than a set of peptide deuteration levels obtained by a typical protocol. A wider time window of this method also eliminates false negatives in protein-ligand binding site identification.

  1. Optimizing window settings for improved presentation of virtual monoenergetic images in dual-energy computed tomography.

    Science.gov (United States)

    Fu, Wanyi; Marin, Daniele; Ramirez-Giraldo, Juan Carlos; Choudhury, Kingshuk Roy; Solomon, Justin; Schabel, Christoph; Patel, Bhavik N; Samei, Ehsan

    2017-08-04

    Dual-energy computed tomography virtual monoenergetic imaging (VMI) at 40 keV exhibits superior contrast-to-noise ratio (CNR), although practicing radiologists do not consistently prefer it over VMI at 70 keV due to high perceivable noise. We hypothesize that the presentation of 40 keV VMI may be compromised using window settings (i.e., window-and-level values [W-L values]) designed for conventional single-energy CT. This study aimed to devise optimum window settings that reduce the apparent noise and utilize the high CNR of 40 keV VMI, in order to improve the conspicuity of hypervascular liver lesions. Three W-L value adjustment methods were investigated to alter the presentation of 40 keV VMI. To harness the high CNR of 40 keV VMI, the methods were designed to achieve (a) liver histogram distribution, (b) lesion-to-liver contrast, or (c) liver background noise comparable to those perceived in 70 keV VMI. This IRB-approved study included 18 patient abdominal datasets reconstructed at 40 and 70 keV. For each patient, the W-L values were determined using the three methods. For each of the images with default or adjusted W-L values, the noise, contrast, and CNR were calculated in terms of both display space and native CT number (referred to as HU) space. An observer study was performed to compare the 40 keV images with the three adjusted W-L values, and 40 and 70 keV images with default W-L values in terms of noise, contrast, and diagnostic preference. A comparison was also made in terms of the applicability of using patient-specific or patient-averaged W-L values. Using the default W-L values, 40 keV VMI exhibited higher HU CNR than 70 keV VMI by 24.6 ± 14.9% (P VMI dataset image quality by improving the actual display CNR. © 2017 American Association of Physicists in Medicine.

  2. Optimal Investment Strategy to Minimize Occupation Time

    CERN Document Server

    Bayraktar, Erhan

    2008-01-01

    We find the optimal investment strategy to minimize the expected time that an individual's wealth stays below zero, the so-called {\\it occupation time}. The individual consumes at a constant rate and invests in a Black-Scholes financial market consisting of one riskless and one risky asset, with the risky asset's price process following a geometric Brownian motion. We also consider an extension of this problem by penalizing the occupation time for the degree to which wealth is negative.

  3. Distributed Algorithms for Time Optimal Reachability Analysis

    DEFF Research Database (Denmark)

    Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

    2016-01-01

    . We propose distributed computing to accelerate time optimal reachability analysis. We develop five distributed state exploration algorithms, implement them in \\uppaal enabling it to exploit the compute resources of a dedicated model-checking cluster. We experimentally evaluate the implemented...... algorithms with four models in terms of their ability to compute near- or proven-optimal solutions, their scalability, time and memory consumption and communication overhead. Our results show that distributed algorithms work much faster than sequential algorithms and have good speedup in general....

  4. Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times

    Science.gov (United States)

    Kaplan, Sezgin; Rabadi, Ghaith

    2013-01-01

    This article addresses the aerial refuelling scheduling problem (ARSP), where a set of fighter jets (jobs) with certain ready times must be refuelled from tankers (machines) by their due dates; otherwise, they reach a low fuel level (deadline) incurring a high cost. ARSP is an identical parallel machine scheduling problem with release times and due date-to-deadline windows to minimize the total weighted tardiness. A simulated annealing (SA) and metaheuristic for randomized priority search (Meta-RaPS) with the newly introduced composite dispatching rule, apparent piecewise tardiness cost with ready times (APTCR), are applied to the problem. Computational experiments compared the algorithms' solutions to optimal solutions for small problems and to each other for larger problems. To obtain optimal solutions, a mixed integer program with a piecewise weighted tardiness objective function was solved for up to 12 jobs. The results show that Meta-RaPS performs better in terms of average relative error but SA is more efficient.

  5. Comparison of the Time Domain Windows Specified in the ISO 18431 Standards Used to Estimate Modal Parameters in Steel Plates

    Directory of Open Access Journals (Sweden)

    Jhonatan Camacho-Navarro

    2016-01-01

    Full Text Available The procedures used to estimate structural modal parameters as natural frequency, damping ratios, and mode shapes are generally based on frequency methods. However, methods of time-frequency analysis are highly sensible to the parameters used to calculate the discrete Fourier transform: windowing, resolution, and preprocessing. Thus, the uncertainty of the modal parameters is increased if a proper parameter selection is not considered. In this work, the influence of three different time domain windows functions (Hanning, flat-top, and rectangular used to estimate modal parameters are discussed in the framework of ISO 18431 standard. Experimental results are conducted over an AISI 1020 steel plate, which is excited by means of a hammer element. Vibration response is acquired by using acceleration records according to the ISO 7626-5 reference guides. The results are compared with a theoretical method and it is obtained that the flat-top window is the best function for experimental modal analysis.

  6. On the long time behavior of the TCP window size process

    National Research Council Canada - National Science Library

    Chafaï, Djalil; Malrieu, Florent; Paroux, Katy

    2010-01-01

    ... TCP window size process. This process has [ 0 , ∞ ) as state space and its infinitesimal generator is given, for any smooth function f : [ 0 , ∞ ) → R , by (1) L ( f ) ( x ) = f ′ ( x ) + x ∫ 0 1 ( f ( h x ) − f ( x ) ) H ( d h ) for some probability measure H supported in [ 0 , 1 ) . This window size ( X t ) t increases linearl...

  7. pknotsRG: RNA pseudoknot folding including near-optimal structures and sliding windows.

    Science.gov (United States)

    Reeder, Jens; Steffen, Peter; Giegerich, Robert

    2007-07-01

    RNA pseudoknots are an important structural feature of RNAs, but often neglected in computer predictions for reasons of efficiency. Here, we present the pknotsRG Web Server for single sequence RNA secondary structure prediction including pseudoknots. pknotsRG employs the newest Turner energy rules for finding the structure of minimal free energy. The algorithm has been improved in several ways recently. First, it has been reimplemented in the C programming language, resulting in a 60-fold increase in speed. Second, all suboptimal foldings up to a user-defined threshold can be enumerated. For large scale analysis, a fast sliding window mode is available. Further improvements of the Web Server are a new output visualization using the PseudoViewer Web Service or RNAmovies for a movie like animation of several suboptimal foldings. The tool is available as source code, binary executable, online tool or as Web Service. The latter alternative allows for an easy integration into bio-informatics pipelines. pknotsRG is available at the Bielefeld Bioinformatics Server (http://bibiserv.techfak.uni-bielefeld.de/pknotsrg).

  8. Stress within a restricted time window selectively affects the persistence of long-term memory.

    Directory of Open Access Journals (Sweden)

    Chang Yang

    Full Text Available The effects of stress on emotional memory are distinct and depend on the stages of memory. Memory undergoes consolidation and reconsolidation after acquisition and retrieval, respectively. Stress facilitates the consolidation but disrupts the reconsolidation of emotional memory. Previous research on the effects of stress on memory have focused on long-term memory (LTM formation (tested 24 h later, but the effects of stress on the persistence of LTM (tested at least 1 week later are unclear. Recent findings indicated that the persistence of LTM requires late-phase protein synthesis in the dorsal hippocampus. The present study investigated the effect of stress (i.e., cold water stress during the late phase after the acquisition and retrieval of contextual fear memory in rats. We found that stress and corticosterone administration during the late phase (12 h after acquisition, referred to as late consolidation, selectively enhanced the persistence of LTM, whereas stress during the late phase (12 h after retrieval, referred to as late reconsolidation, selectively disrupted the restabilized persistence of LTM. Moreover, the effects of stress on the persistence of LTM were blocked by the corticosterone synthesis inhibitor metyrapone, which was administered before stress, suggesting that the glucocorticoid system is involved in the effects of stress on the persistence of LTM. We conclude that stress within a restricted time window after acquisition or retrieval selectively affects the persistence of LTM and depends on the glucocorticoid system.

  9. Rhythm sequence through the olfactory bulb layers during the time window of a respiratory cycle.

    Science.gov (United States)

    Buonviso, Nathalie; Amat, Corine; Litaudon, Philippe; Roux, Stephane; Royet, Jean-Pierre; Farget, Vincent; Sicard, Gilles

    2003-05-01

    The mammalian olfactory bulb is characterized by prominent oscillatory activity of its local field potentials. Breathing imposes the most important rhythm. Other rhythms have been described in the beta- and gamma-frequency ranges. We recorded unitary activities in different bulbar layers simultaneously with local field potentials in order to examine the different relationships existing between (i) breathing and field potential oscillations, and (ii) breathing and spiking activity of different cell types. We show that, whatever the layer, odour-induced gamma oscillations always occur around the transition point between inhalation and exhalation while beta oscillations appear during early exhalation and may extend up to the end of inhalation. By contrast, unitary activities exhibit different characteristics according to the layer. They vary in (i) their temporal relationship with respect to the respiratory cycle; (ii) their spike rates; (iii) their temporal patterns defined according to the respiratory cycle. The time window of a respiratory cycle might thus be split into three main epochs based on the deceleration of field potential rhythms (from gamma to beta oscillations) and a simultaneous gradient of spike discharge frequencies ranging from 180 to 30 Hz. We discuss the possibility that each rhythm could serve different functions as priming, gating or tuning for the bulbar network.

  10. Stress within a Restricted Time Window Selectively Affects the Persistence of Long-Term Memory

    Science.gov (United States)

    Fang, Qin; Chai, Ning; Zhao, Li-Yan; Xue, Yan-Xue; Luo, Yi-Xiao; Jian, Min; Han, Ying; Shi, Hai-Shui; Lu, Lin; Wu, Ping; Wang, Ji-Shi

    2013-01-01

    The effects of stress on emotional memory are distinct and depend on the stages of memory. Memory undergoes consolidation and reconsolidation after acquisition and retrieval, respectively. Stress facilitates the consolidation but disrupts the reconsolidation of emotional memory. Previous research on the effects of stress on memory have focused on long-term memory (LTM) formation (tested 24 h later), but the effects of stress on the persistence of LTM (tested at least 1 week later) are unclear. Recent findings indicated that the persistence of LTM requires late-phase protein synthesis in the dorsal hippocampus. The present study investigated the effect of stress (i.e., cold water stress) during the late phase after the acquisition and retrieval of contextual fear memory in rats. We found that stress and corticosterone administration during the late phase (12 h) after acquisition, referred to as late consolidation, selectively enhanced the persistence of LTM, whereas stress during the late phase (12 h) after retrieval, referred to as late reconsolidation, selectively disrupted the restabilized persistence of LTM. Moreover, the effects of stress on the persistence of LTM were blocked by the corticosterone synthesis inhibitor metyrapone, which was administered before stress, suggesting that the glucocorticoid system is involved in the effects of stress on the persistence of LTM. We conclude that stress within a restricted time window after acquisition or retrieval selectively affects the persistence of LTM and depends on the glucocorticoid system. PMID:23544051

  11. Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows.

    Science.gov (United States)

    Jawarneh, Sana; Abdullah, Salwani

    2015-01-01

    This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

  12. Modified artificial bee colony for the vehicle routing problems with time windows.

    Science.gov (United States)

    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.

  13. Accuracy of rate coding: When shorter time window and higher spontaneous activity help

    Science.gov (United States)

    Levakova, Marie; Tamborrino, Massimiliano; Kostal, Lubomir; Lansky, Petr

    2017-02-01

    It is widely accepted that neuronal firing rates contain a significant amount of information about the stimulus intensity. Nevertheless, theoretical studies on the coding accuracy inferred from the exact spike counting distributions are rare. We present an analysis based on the number of observed spikes assuming the stochastic perfect integrate-and-fire model with a change point, representing the stimulus onset, for which we calculate the corresponding Fisher information to investigate the accuracy of rate coding. We analyze the effect of changing the duration of the time window and the influence of several parameters of the model, in particular the level of the presynaptic spontaneous activity and the level of random fluctuation of the membrane potential, which can be interpreted as noise of the system. The results show that the Fisher information is nonmonotonic with respect to the length of the observation period. This counterintuitive result is caused by the discrete nature of the count of spikes. We observe also that the signal can be enhanced by noise, since the Fisher information is nonmonotonic with respect to the level of spontaneous activity and, in some cases, also with respect to the level of fluctuation of the membrane potential.

  14. Thompson Sampling: An Optimal Finite Time Analysis

    CERN Document Server

    Kaufmann, Emilie; Munos, Rémi

    2012-01-01

    The question of the optimality of Thompson Sampling for solving the stochastic multi-armed bandit problem had been open since 1933. In this paper we answer it positively for the case of Bernoulli rewards by providing the first finite-time analysis that matches the asymptotic rate given in the Lai and Robbins lower bound for the cumulative regret. The proof is accompanied by a numerical comparison with other optimal policies, experiments that have been lacking in the literature until now for the Bernoulli case.

  15. MMSE Optimal Algebraic Space-Time Codes

    CERN Document Server

    Rajan, G Susinder

    2007-01-01

    Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and receive antennas increase. Hence it is natural to resort to a suboptimal reception technique like linear Minimum Mean Squared Error (MMSE) receiver. Barbarossa et al and Liu et al have independently derived necessary and sufficient conditions for a full rate linear STBC to be MMSE optimal, i.e achieve least Symbol Error Rate (SER). Motivated by this problem, certain existing high rate STBC constructions from crossed product algebras are identified to be MMSE optimal. Also, it is shown that a certain class of codes from cyclic division algebras which are special cases of crossed product algebras are MMSE optimal. Hence, these STBCs achieve least SER when MMSE reception is employed and are fully diverse when ML reception is employed.

  16. A Feedback Optimal Control Algorithm with Optimal Measurement Time Points

    Directory of Open Access Journals (Sweden)

    Felix Jost

    2017-02-01

    Full Text Available Nonlinear model predictive control has been established as a powerful methodology to provide feedback for dynamic processes over the last decades. In practice it is usually combined with parameter and state estimation techniques, which allows to cope with uncertainty on many levels. To reduce the uncertainty it has also been suggested to include optimal experimental design into the sequential process of estimation and control calculation. Most of the focus so far was on dual control approaches, i.e., on using the controls to simultaneously excite the system dynamics (learning as well as minimizing a given objective (performing. We propose a new algorithm, which sequentially solves robust optimal control, optimal experimental design, state and parameter estimation problems. Thus, we decouple the control and the experimental design problems. This has the advantages that we can analyze the impact of measurement timing (sampling independently, and is practically relevant for applications with either an ethical limitation on system excitation (e.g., chemotherapy treatment or the need for fast feedback. The algorithm shows promising results with a 36% reduction of parameter uncertainties for the Lotka-Volterra fishing benchmark example.

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

    DEFF Research Database (Denmark)

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

    2009-01-01

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned task...

  18. An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    The Vehicle Routing Problem with Time Windows (VRPTW) consist of determining a set of feasible vehicle routes to deliver goods to a set of customers using a hierarchical objective; first minimising the number of vehicles used and, second, the total driving distance. A three-stage method is proposed...

  19. Cerebellar potentiation and learning a whisker-based object localization task with a time response window.

    Science.gov (United States)

    Rahmati, Negah; Owens, Cullen B; Bosman, Laurens W J; Spanke, Jochen K; Lindeman, Sander; Gong, Wei; Potters, Jan-Willem; Romano, Vincenzo; Voges, Kai; Moscato, Letizia; Koekkoek, Sebastiaan K E; Negrello, Mario; De Zeeuw, Chris I

    2014-01-29

    Whisker-based object localization requires activation and plasticity of somatosensory and motor cortex. These parts of the cerebral cortex receive strong projections from the cerebellum via the thalamus, but it is unclear whether and to what extent cerebellar processing may contribute to such a sensorimotor task. Here, we subjected knock-out mice, which suffer from impaired intrinsic plasticity in their Purkinje cells and long-term potentiation at their parallel fiber-to-Purkinje cell synapses (L7-PP2B), to an object localization task with a time response window (RW). Water-deprived animals had to learn to localize an object with their whiskers, and based upon this location they were trained to lick within a particular period ("go" trial) or refrain from licking ("no-go" trial). L7-PP2B mice were not ataxic and showed proper basic motor performance during whisking and licking, but were severely impaired in learning this task compared with wild-type littermates. Significantly fewer L7-PP2B mice were able to learn the task at long RWs. Those L7-PP2B mice that eventually learned the task made unstable progress, were significantly slower in learning, and showed deficiencies in temporal tuning. These differences became greater as the RW became narrower. Trained wild-type mice, but not L7-PP2B mice, showed a net increase in simple spikes and complex spikes of their Purkinje cells during the task. We conclude that cerebellar processing, and potentiation in particular, can contribute to learning a whisker-based object localization task when timing is relevant. This study points toward a relevant role of cerebellum-cerebrum interaction in a sophisticated cognitive task requiring strict temporal processing.

  20. Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

    Science.gov (United States)

    Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

    2017-04-01

    Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

  1. The impact of skin decontamination on the time window for effective treatment of percutaneous VX exposure.

    Science.gov (United States)

    Joosen, M J A; van den Berg, R M; de Jong, A L; van der Schans, M J; Noort, D; Langenberg, J P

    2017-04-01

    The main goal of the present study was to obtain insight into depot formation and penetration following percutaneous VX poisoning, in order to identify an appropriate decontamination window that can enhance or support medical countermeasures. The study was executed in two phases, using the hairless guinea pig as an animal model. In the first phase the effect of various decontamination regimens on levels of free VX in skin and plasma were studied as well as on blood cholinesterase levels. Animals were exposed to 0.5 mg/kg VX and were not decontaminated (control), decontaminated with RSDL once at 15 or 90 min after exposure or three times at 15, 25 and 35 (10-min interval) or 15, 45 and 75 min after exposure (30-min interval). There was no significant effect of any of the decontamination regimens on the 6-h survival rate of the animals. However, all animals that had been decontaminated 15 min after exposure, showed a survival rate of more than 90%, compared to 50-60% in animals that were not decontaminated or decontaminated at 90 min after exposure. In the second phase of the study, hairless guinea pigs were exposed to 1 mg/kg VX on the shoulder, followed either by decontamination with RSDL (10 min interval), conventional treatment on indication of clinical signs or a combination thereof. It appeared that a thorough, repeated decontamination alone could not save the majority of the animals. A 100% survival rate was observed in the group that received a combination of decontamination and treatment. In conclusion, the effects of VX exposure could be influenced by various RSDL decontamination regimens. The results in freely moving animals showed that skin decontamination, although not fully effective in removing all VX from the skin and skin depot is crucial to support pharmacological intervention.

  2. Effects of Thermal Mass, Window Size, and Night-Time Ventilation on Peak Indoor Air Temperature in the Warm-Humid Climate of Ghana

    Directory of Open Access Journals (Sweden)

    S. Amos-Abanyie

    2013-01-01

    Full Text Available Most office buildings in the warm-humid sub-Saharan countries experience high cooling load because of the predominant use of sandcrete blocks which are of low thermal mass in construction and extensive use of glazing. Relatively, low night-time temperatures are not harnessed in cooling buildings because office openings remain closed after work hours. An optimization was performed through a sensitivity analysis-based simulation, using the Energy Plus (E+ simulation software to assess the effects of thermal mass, window size, and night ventilation on peak indoor air temperature (PIAT. An experimental system was designed based on the features of the most promising simulation model, constructed and monitored, and the experimental data used to validate the simulation model. The results show that an optimization of thermal mass and window size coupled with activation of night-time ventilation provides a synergistic effect to obtain reduced peak indoor air temperature. An expression that predicts, indoor maximum temperature has been derived for models of various thermal masses.

  3. Dead time optimization method for power converter

    Science.gov (United States)

    Deselaers, C.; Bergmann, U.; Gronwald, F.

    2013-07-01

    This paper introduces a method for dead time optimization in variable speed motor drive systems. The aim of this method is to reduce the conduction time of the freewheeling diode to a minimum without generation of cross conduction. This results in lower losses, improved EMC, and less overshooting of the phase voltage. The principle of the method is to detect beginning cross currents without adding additional components in the half bridge like resistors or inductances. Only the wave shape of the phase voltage needs to be monitored during switching. This is illustrated by an application of the method to a real power converter.

  4. Neuroprotective efficacy and therapeutic time window of peroxynitrite decomposition catalysts in focal cerebral ischemia in rats#

    Science.gov (United States)

    Thiyagarajan, Meenakshisundaram; Kaul, Chaman Lal; Sharma, Shyam Sundar

    2004-01-01

    Free radicals have been implicated in cerebral ischemia reperfusion (IR) injury. Massive production of nitric oxide and superoxide results in continuous formation of peroxynitrite even several hours after IR insult. This can produce DNA strand nicks, hydroxylation and/or nitration of cytosolic components of neuron, leading to neuronal death. Peroxynitrite decomposition catalysts 5,10,15,20-tetrakis(N-methyl-4′-pyridyl)porphyrinato iron (III) (FeTMPyP) and 5,10,15,20-tetrakis(4-sulfonatophenyl)porphyrinato iron (III) (FeTPPS) have been demonstrated to protect neurons in in vitro cultures; however, their neuroprotective efficacy in cerebral IR injury has not been explored. In the present study, we investigated the efficacy and the therapeutic time window of FeTMPyP and FeTPPS in focal cerebral ischemia (FCI). FCI was induced according to the middle cerebral artery occlusion (MCAO) method. After 2 h of MCAO and 70 h of reperfusion, the extent of neurological deficits, infarct and edema volume were measured in Sprague–Dawley rats. FeTMPyP and FeTPPS were administered at different time points 2, 6, 9 and 12 h post MCAO. FeTMPyP and FeTPPS (3 mg kg−1, i.v.) treatment at 2 and 6 h post MCAO produced significant reduction in infarct volume, edema volume and neurological deficits. However, treatment at latter time points did not produce significant neuroprotection. Significant reduction of peroxynitrite in blood and nitrotyrosine in brain sections was observed on FeTMPyP and FeTPPS treatment. As delayed treatment of FeTMPyP and FeTPPS produced neuroprotection, we tested whether treatment had any influence over the apoptotic neuronal death. DNA fragmentation and in situ nick end-labeling assays showed that FeTMPyP and FeTPPS treatment reduced IR injury-induced DNA fragmentation. In conclusion, peroxynitrite decomposition catalysts (FeTMPyP and FeTPPS) produced prominent neuroprotection even if administered 6 h post MCAO and the neuroprotective effect is at least in

  5. Toward Plastic Smart Windows: Optimization of Indium Tin Oxide Electrodes for the Synthesis of Electrochromic Devices on Polycarbonate Substrates.

    Science.gov (United States)

    Laurenti, Marco; Bianco, Stefano; Castellino, Micaela; Garino, Nadia; Virga, Alessandro; Pirri, Candido F; Mandracci, Pietro

    2016-03-01

    Plastic smart windows are becoming one of the key elements in view of the fabrication of inexpensive, lightweight electrochromic (EC) devices to be integrated in the new generation of high-energy-efficiency buildings and automotive applications. However, fabricating electrochromic devices on polymer substrates requires a reduction of process temperature, so in this work we focus on the development of a completely room-temperature deposition process aimed at the preparation of ITO-coated polycarbonate (PC) structures acting as transparent and conductive plastic supports. Without providing any substrate heating or surface activation pretreatments of the polymer, different deposition conditions are used for growing indium tin oxide (ITO) thin films by the radiofrequency magnetron sputtering technique. According to the characterization results, the set of optimal deposition parameters is selected to deposit ITO electrodes having high optical transmittance in the visible range (∼90%) together with low sheet resistance (∼8 ohm/sq). The as-prepared ITO/PC structures are then successfully tested as conductive supports for the fabrication of plastic smart windows. To this purpose, tungsten trioxide thin films are deposited by the reactive sputtering technique on the ITO/PC structures, and the resulting single electrode EC devices are characterized by chronoamperometric experiments and cyclic voltammetry. The fast switching response between colored and bleached states, together with the stability and reversibility of their electrochromic behavior after several cycling tests, are considered to be representative of the high quality of the EC film but especially of the ITO electrode. Indeed, even if no adhesion promoters, additional surface activation pretreatments, or substrate heating were used to promote the mechanical adhesion among the electrode and the PC surface, the observed EC response confirmed that the developed materials can be successfully employed for the

  6. A time performance comparison of particle swarm optimization in mobile devices

    Directory of Open Access Journals (Sweden)

    Prieto Luis Antonio Beltrán

    2016-01-01

    Full Text Available This paper deals with the comparison of three implementations of Particle Swarm Optimization (PSO, which is a powerful algorithm utilized for optimization purposes. Xamarin, a cross-platform development software, was used to build a single C# application capable of being executed on three different mobile operating systems (OS devices, namely Android, iOS, and Windows Mobile 10, with native level performance. Seven thousand tests comprising PSO evaluations of seven benchmark functions were carried out per mobile OS. A statistical evaluation of time performance of the test set running on three similar devices –each running a different mobile OS– is presented and discussed. Our findings show that PSO running on Windows Mobile 10 and iOS devices have a better performance in computation time than in Android.

  7. Argos: An Optimized Time-Series Photometer

    Indian Academy of Sciences (India)

    Anjum S. Mukadam; R. E. Nather

    2005-06-01

    We designed a prime focus CCD photometer, Argos, optimized for high speed time-series measurements of blue variables (Nather & Mukadam 2004) for the 2.1 m telescope at McDonald Observatory. Lack of any intervening optics between the primary mirror and the CCD makes the instrument highly efficient.We measure an improvement in sensitivity by a factor of nine over the 3-channel PMT photometers used on the same telescope and for the same exposure time. The CCD frame transfer operation triggered by GPS synchronized pulses serves as an electronic shutter for the photometer. This minimizes the dead time between exposures, but more importantly, allows a precise control of the start and duration of the exposure. We expect the uncertainty in our timing to be less than 100 s.

  8. The impact of skin decontamination on the time window for effective treatment of percutaneous VX exposure

    NARCIS (Netherlands)

    Joosen, M.J.A.; Berg, R.M. van den; Jong, A.L. de; Schans, M.J. van der; Noort, D.; Langenberg, J.P.

    2017-01-01

    The main goal of the present study was to obtain insight into depot formation and penetration following percutaneous VX poisoning, in order to identify an appropriate decontamination window that can enhance or support medical countermeasures. The study was executed in two phases, using the hairless

  9. Continuous monitoring of distributed data streams over a time-based sliding window

    DEFF Research Database (Denmark)

    Chan, Ho-Leung; Lam, Tak-Wah; Lee, Lap Kei;

    2012-01-01

    for frequent items and O(k ε 2 logN k ) words for quantiles, where k is the number of distributed data streams, N is the total number of items in the streams that arrive or expire in the window, and ε

  10. Windows 10 for dummies

    CERN Document Server

    Rathbone, Andy

    2015-01-01

    The fast and easy way to get up and running with Windows 10 Windows 10 For Dummies covers the latest version of Windows and gets you up and running with the changes and new features you'll find in this updated operating system. Packed with time-saving tips to help you get the most out of the software, this helpful Windows 10 guide shows you how to manage Windows tasks like navigating the interface with a mouse or touchscreen, connecting to the web, and troubleshooting problems and making quick fixes. Assuming no prior knowledge of the software, Windows 10 For Dummies addresses the updates to

  11. Optimization of energy window for {sup 90}Y bremsstrahlung SPECT imaging for detection tasks using the ideal observer with model-mismatch

    Energy Technology Data Exchange (ETDEWEB)

    Rong Xing; Ghaly, Michael; Frey, Eric C. [Department of Radiology, Johns Hopkins University, Baltimore, Maryland 21287-0859 (United States)

    2013-06-15

    Purpose: In yttrium-90 ({sup 90}Y) microsphere brachytherapy (radioembolization) of unresectable liver cancer, posttherapy {sup 90}Y bremsstrahlung single photon emission computed tomography (SPECT) has been used to document the distribution of microspheres in the patient and to help predict potential side effects. The energy window used during projection acquisition can have a significant effect on image quality. Thus, using an optimal energy window is desirable. However, there has been great variability in the choice of energy window due to the continuous and broad energy distribution of {sup 90}Y bremsstrahlung photons. The area under the receiver operating characteristic curve (AUC) for the ideal observer (IO) is a widely used figure of merit (FOM) for optimizing the imaging system for detection tasks. The IO implicitly assumes a perfect model of the image formation process. However, for {sup 90}Y bremsstrahlung SPECT there can be substantial model-mismatch (i.e., difference between the actual image formation process and the model of it assumed in reconstruction), and the amount of the model-mismatch depends on the energy window. It is thus important to account for the degradation of the observer performance due to model-mismatch in the optimization of the energy window. The purpose of this paper is to optimize the energy window for {sup 90}Y bremsstrahlung SPECT for a detection task while taking into account the effects of the model-mismatch. Methods: An observer, termed the ideal observer with model-mismatch (IO-MM), has been proposed previously to account for the effects of the model-mismatch on IO performance. In this work, the AUC for the IO-MM was used as the FOM for the optimization. To provide a clinically realistic object model and imaging simulation, the authors used a background-known-statistically and signal-known-statistically task. The background was modeled as multiple compartments in the liver with activity parameters independently following a

  12. Time Optimal Reachability Analysis Using Swarm Verification

    DEFF Research Database (Denmark)

    Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

    2016-01-01

    Time optimal reachability analysis employs model-checking to compute goal states that can be reached from an initial state with a minimal accumulated time duration. The model-checker may produce a corresponding diagnostic trace which can be interpreted as a feasible schedule for many scheduling a...... algorithms work much faster than sequential algorithms, and especially two using combinations of random-depth-first and breadth-first show very promising performance....... search strategies. We develop four swarm algorithms and evaluate them with four models in terms scalability, and time- and memory consumption. Three of these cooperate by exchanging costs of intermediate solutions to prune the search using a branch-and-bound approach. Our results show that swarm...

  13. Support Vector Data Description Model to Map Specific Land Cover with Optimal Parameters Determined from a Window-Based Validation Set

    Directory of Open Access Journals (Sweden)

    Jinshui Zhang

    2017-04-01

    Full Text Available This paper developed an approach, the window-based validation set for support vector data description (WVS-SVDD, to determine optimal parameters for support vector data description (SVDD model to map specific land cover by integrating training and window-based validation sets. Compared to the conventional approach where the validation set included target and outlier pixels selected visually and randomly, the validation set derived from WVS-SVDD constructed a tightened hypersphere because of the compact constraint by the outlier pixels which were located neighboring to the target class in the spectral feature space. The overall accuracies for wheat and bare land achieved were as high as 89.25% and 83.65%, respectively. However, target class was underestimated because the validation set covers only a small fraction of the heterogeneous spectra of the target class. The different window sizes were then tested to acquire more wheat pixels for validation set. The results showed that classification accuracy increased with the increasing window size and the overall accuracies were higher than 88% at all window size scales. Moreover, WVS-SVDD showed much less sensitivity to the untrained classes than the multi-class support vector machine (SVM method. Therefore, the developed method showed its merits using the optimal parameters, tradeoff coefficient (C and kernel width (s, in mapping homogeneous specific land cover.

  14. Support Vector Data Description Model to Map Specific Land Cover with Optimal Parameters Determined from a Window-Based Validation Set.

    Science.gov (United States)

    Zhang, Jinshui; Yuan, Zhoumiqi; Shuai, Guanyuan; Pan, Yaozhong; Zhu, Xiufang

    2017-04-26

    This paper developed an approach, the window-based validation set for support vector data description (WVS-SVDD), to determine optimal parameters for support vector data description (SVDD) model to map specific land cover by integrating training and window-based validation sets. Compared to the conventional approach where the validation set included target and outlier pixels selected visually and randomly, the validation set derived from WVS-SVDD constructed a tightened hypersphere because of the compact constraint by the outlier pixels which were located neighboring to the target class in the spectral feature space. The overall accuracies for wheat and bare land achieved were as high as 89.25% and 83.65%, respectively. However, target class was underestimated because the validation set covers only a small fraction of the heterogeneous spectra of the target class. The different window sizes were then tested to acquire more wheat pixels for validation set. The results showed that classification accuracy increased with the increasing window size and the overall accuracies were higher than 88% at all window size scales. Moreover, WVS-SVDD showed much less sensitivity to the untrained classes than the multi-class support vector machine (SVM) method. Therefore, the developed method showed its merits using the optimal parameters, tradeoff coefficient (C) and kernel width (s), in mapping homogeneous specific land cover.

  15. Optimizing technical precision of measurement in computerized psychological assessment on Windows platforms

    Directory of Open Access Journals (Sweden)

    JOACHIM HÄUSLER

    2007-06-01

    Full Text Available Reaction times and response latencies are required to measure a variety of ability and personality traits. If reaction times are used to measure rather elementary cognitive tasks, the inter-individual variance in the measured reaction times are usually small in the sense that the central 50 percent of a norm population range within less than 100ms. Technical measurement errors therefore have the potential to seriously affect the validity of diagnostic judgments based on such measures. Thus the target of this paper is to investigate the magnitude of possible errors of measurement due to technical reasons and to suggest ways to prevent or at least consider those in the diagnostic process.In Study I a highly precise 'artificial respondent' was applied to simulate reactions corresponding to a given percentile rank on 3 different tests (DG-Lokation CORPORAL, Alertness TAP-M, RT/S9 Vienna Test System on 11 different computer systems. The result output of the tests was compared to the reaction times, actually provided by the artificial respondent. Results show, that there are detectable errors of measurement - depending on the hardware and software specifications of the computer system used. In the test DG-Lokation these bias caused an offset in the tests main variable of up to 20 percentile ranks.In Study II a self-calibration unit which is part of the Vienna Test System (Version 6.40 was investigated, using the same experimental setup. After calibration, the bias detected can be reduced to the magnitude of about 1 percentile rank on all computer systems tested.It thus can be concluded, that time critical computer based tests typically bear the risk of technical errors of measurement. Depending on how the test is programmed, the errors arising on some computer configurations can cause even severe changes in diagnostic judgment formation. In contrast, self-calibration proved to be an effective tool to permitting the user not only to control but also to

  16. Super-resolution discrete-Fourier-transform spectroscopy using precisely periodic radiation beyond time window size limitation

    CERN Document Server

    Yasui, Takeshi; Hsieh, Yi-Da; Sakaguchi, Yoshiyuki; Hindle, Francis; Yokoyama, Shuko; Araki, Tsutomu; Hashimoto, Mamoru

    2014-01-01

    Fourier transform spectroscopy (FTS) has been widely used in a variety of fields in research, industry, and medicine due to its high signal-to-noise ratio, simultaneous acquisition of signals in a broad spectrum, and versatility for different radiation sources. Further improvement of the spectroscopic performance will widen its scope of applications. Here, we demonstrate improved spectral resolution by overcoming the time window limitation using discrete Fourier transform spectroscopy (dFTS) with precisely periodic pulsed terahertz (THz) radiation. Since infinitesimal resolution can be achieved at periodically discrete frequencies when the time window size is exactly matched to the repetition period T, a combination of THz-dFTS with a spectral interleaving technique achieves a spectral resolution only limited by the spectral interleaving interval. Linewidths narrower than 1/(50T) are fully resolved allowing the attribution of rotational-transition absorption lines of low-pressure molecular gases within a 1.25...

  17. Strategic Windows

    DEFF Research Database (Denmark)

    Risberg, Annette; King, David R.; Meglio, Olimpia

    We examine the importance of speed and timing in acquisitions with a framework that identifies management considerations for three interrelated acquisition phases (selection, deal closure and integration) from an acquiring firm’s perspective. Using a process perspective, we pinpoint items within...... acquisition phases that relate to speed. In particular, we present the idea of time-bounded strategic windows in acquisitions consistent with the notion of kairòs, where opportunities appear and must be pursued at the right time for success to occur....

  18. Combinatorial optimization tolerances calculated in linear time

    NARCIS (Netherlands)

    Goldengorin, Boris; Sierksma, Gerard

    2003-01-01

    For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal

  19. Combinatorial optimization tolerances calculated in linear time

    NARCIS (Netherlands)

    Goldengorin, Boris; Sierksma, Gerard

    2003-01-01

    For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal soluti

  20. DETERMINATION METHOD OF OPTIMAL SUPPORTING TIME IN HEADING FACE

    Institute of Scientific and Technical Information of China (English)

    杜长龙; 曹红波; 王燕宁; 张艳

    1997-01-01

    This paper has put forward a concept of optimal supporting time through analysing the influence of the supporting time in the heading face on the supporting result of surrounding rock. The method of the optimal supporting time determined by graphical method is discussed, and the calculating formula for determining the optimal supporting time through the analysis method is derived.

  1. Computational and Experimental Investigation for an Optimal Design of Industrial Windows to Allow Natural Ventilation during Wind-Driven Rain

    Directory of Open Access Journals (Sweden)

    Kritana Prueksakorn

    2015-08-01

    Full Text Available With an increased awareness of sustainability issues, natural ventilation has become an elegant method for reducing the costs and environmental effects of the energy that is used to maintain comfortable indoor air quality rather than using mechanical ventilation. The windows in many industrial buildings are continuously open to exhaust pollutants and intake fresh air. Though windows are functional and efficient for natural ventilation, rainwater is able to penetrate through the windows during wind-driven rain. For industries in which the moisture content affects the quality of the product, the intrusion of a large amount of rainwater through windows must be prevented without compromising the effective ventilation. The aim of this research is to determine an innovative design for windows to accomplish the optimum of high ventilation and low rain penetration. For this purpose, windows are variously innovated and tested in full-scale measurements, reduced-scale wind-tunnel measurements and computational fluid dynamics (CFD. An artificial rain and wind velocity to mimic the average of the maximum values in Korea are created. The maximum reduction in rain penetration of over 98% compared to basic 90° open windows is attained with only a 4%–9% decrement of ventilation efficiency in the two recommended designs.

  2. Windows Azure

    CERN Document Server

    Johnson, Bruce; Chambers, James; Garber, Danny; Malik, Jamal; Fazio, Adam

    2013-01-01

    A collection of five must-have Azure titles, from some of the biggest names in the field Available individually, but at a discounted rate for the collection, this bundle of five e-books covers key developer and IT topics of Windows Azure, including ASP.NET, mobile services, web sites, data storage, and the hybrid cloud. A host of Microsoft employees and MPVs come together to cover the biggest challenges that professionals face when working with Windows Azure. The e-books included are as follows: Windows Azure and ASP.NET MVC MigrationWindows Azure Mobile ServicesWindows Azure Web SitesWindows

  3. Semi-Active Pulse-Switching Vibration Suppression Using Sliding Time Window

    Directory of Open Access Journals (Sweden)

    S. Mohammadi

    2013-01-01

    Full Text Available The performance of pulse-switching vibration control technique is investigated using a new method for switching sequence, in order to enhance the vibration damping. The control law in this method which was developed in the field of piezoelectric damping is based on triggering the inverting switch on each extremum of the produced voltage (or displacement; however, its efficiency in the case of random excitation is arguable because of the local extremum detection process. The new proposed method for switching sequence is only based on the fact that the triggering voltage level was determined using windowed statistical examination of the deflection signal. Results for a cantilever beam excited by different excitation forces, such as stationary and nonstationary random samples, and pulse forces are presented. A significant decrease in vibration energy and also the robustness of this method are demonstrated.

  4. Multi-Sliding Time Windows Based Changing Trend of Mean Temperature and Its Association with the Global-Warming Hiatus

    Institute of Scientific and Technical Information of China (English)

    石岩; 翟盘茂; 江志红

    2016-01-01

    Based on three global annual mean surface temperature time series and three Chinese annual mean surface air temperature time series, climate change trends on multiple timescales are analyzed by using the trend estimation method of multi-sliding time windows. The results are used to discuss the so-called global-warming hiatus during 1998–2012. It is demonstrated that different beginning and end times have an obvious effect on the results of the trend estimation, and the implications are particularly large when using a short window. The global-warming hiatus during 1998–2012 is the result of viewing temperature series on short timescales;and the events similar to it, or the events with even cold tendencies, have actually occurred many times in history. Therefore, the global-warming hiatus is likely to be a periodical feature of the long-term temperature change. It mainly reflects the decadal variability of temperature, and such a phenomenon in the short term does not alter the overall warming trend in the long term.

  5. A SOLUTION FOR THE BI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING LOCAL SEARCH AND GENETIC ALGORITHMS

    Directory of Open Access Journals (Sweden)

    Anan Mungwattana

    2016-06-01

    Full Text Available This paper deals with the vehicle routing problem with time windows (VRPTW. The VRPTW routes a set of vehicles to service customers having two-sided time windows, i.e. earliest and latest start of service times. The demand requests are served by capacitated vehicles with limited travel times to return to the depot. The purpose of this paper is to develop a hybrid algorithm that uses the modified push forward insertion heuristic (MPFIH, a λ-interchange local search descent method (λ-LSD and a genetic algorithm to solve the VRPTW with two objectives. The first objective aims to determine the minimum number of vehicles required and the second is to find the solution that minimizes the total travel time. A set of well-known benchmark problems are used to compare the quality of solutions. The results show that the proposed algorithm provides effective solutions compared with best found solutions and better than another heuristic used for comparison.

  6. Multi-sliding time windows based changing trend of mean temperature and its association with the global-warming hiatus

    Science.gov (United States)

    Shi, Yan; Zhai, Panmao; Jiang, Zhihong

    2016-04-01

    Based on three global annual mean surface temperature time series and three Chinese annual mean surface air temperature time series, climate change trends on multiple timescales are analyzed by using the trend estimation method of multi-sliding time windows. The results are used to discuss the so-called global-warming hiatus during 1998-2012. It is demonstrated that different beginning and end times have an obvious effect on the results of the trend estimation, and the implications are particularly large when using a short window. The global-warming hiatus during 1998-2012 is the result of viewing temperature series on short timescales; and the events similar to it, or the events with even cold tendencies, have actually occurred many times in history. Therefore, the global-warming hiatus is likely to be a periodical feature of the long-term temperature change. It mainly reflects the decadal variability of temperature, and such a phenomenon in the short term does not alter the overall warming trend in the long term.

  7. Time optimal paths for a constant speed unicycle

    Energy Technology Data Exchange (ETDEWEB)

    Reister, D.B.

    1991-01-01

    This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed unicycle. The time optimal paths consist of sequences of arcs of circles and straight lines. The maximum principle introduced concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. 10 refs., 6 figs.

  8. Advanced energy efficient windows

    DEFF Research Database (Denmark)

    Thomsen, Kirsten Engelund

    2007-01-01

    energy savings. In terms of energy, windows occupy a special position compared with other thermal envelope structures due to their many functions: 1) windows let daylight into the building and provide occupants with visual contact with their surroundings 2) windows protect against the outdoor climate 3......Windows should be paid special attention as they contribute a significant part of the total heat-loss coefficient of the building. Contrary to other parts of the thermal envelope the windows are not only heat loosers, but may gain heat in the day-time. Therefore there are possibilities for large......) windows transmit solar energy that may contribute to a reduction of energy consumption, but which may also lead to unpleasant overheating. In the following paragraphs the current use of windows is reviewed with an emphasis on energy, while special products like solar protection glazing and security...

  9. ROX: Run-time optimization of XQueries

    NARCIS (Netherlands)

    Abdel Kader, R.; Boncz, P.A.; Manegold, S.; Keulen, M. van

    2009-01-01

    Optimization of complex XQueries combining many XPath steps and joins is currently hindered by the absence of good cardinality estimation and cost models for XQuery. Additionally, the state-of-the-art of even relational query optimization still struggles to cope with cost model estimation errors tha

  10. An Analysis of Peer-Reviewed Scores and Impact Factors with Different Citation Time Windows: A Case Study of 28 Ophthalmologic Journals.

    Science.gov (United States)

    Liu, Xue-Li; Gai, Shuang-Shuang; Zhang, Shi-Le; Wang, Pu

    2015-01-01

    An important attribute of the traditional impact factor was the controversial 2-year citation window. So far, several scholars have proposed using different citation time windows for evaluating journals. However, there is no confirmation whether a longer citation time window would be better. How did the journal evaluation effects of 3IF, 4IF, and 6IF comparing with 2IF and 5IF? In order to understand these questions, we made a comparative study of impact factors with different citation time windows with the peer-reviewed scores of ophthalmologic journals indexed by Science Citation Index Expanded (SCIE) database. The peer-reviewed scores of 28 ophthalmologic journals were obtained through a self-designed survey questionnaire. Impact factors with different citation time windows (including 2IF, 3IF, 4IF, 5IF, and 6IF) of 28 ophthalmologic journals were computed and compared in accordance with each impact factor's definition and formula, using the citation analysis function of the Web of Science (WoS) database. An analysis of the correlation between impact factors with different citation time windows and peer-reviewed scores was carried out. Although impact factor values with different citation time windows were different, there was a high level of correlation between them when it came to evaluating journals. In the current study, for ophthalmologic journals' impact factors with different time windows in 2013, 3IF and 4IF seemed the ideal ranges for comparison, when assessed in relation to peer-reviewed scores. In addition, the 3-year and 4-year windows were quite consistent with the cited peak age of documents published by ophthalmologic journals. Our study is based on ophthalmology journals and we only analyze the impact factors with different citation time window in 2013, so it has yet to be ascertained whether other disciplines (especially those with a later cited peak) or other years would follow the same or similar patterns. We designed the survey questionnaire

  11. Window Stories

    DEFF Research Database (Denmark)

    Hauge, Bettina

    This research project has investigated 17 households in Germany (cities and rural areas). The main aim was to learn about the significance of the window to these people: What they think of their windows, how, when and why they use them in their everyday life, if they have a favorite window and why...

  12. Modeling municipal solid waste collection: A generalized vehicle routing model with multiple transfer stations, gather sites and inhomogeneous vehicles in time windows.

    Science.gov (United States)

    Son, Le Hoang; Louati, Amal

    2016-06-01

    Municipal Solid Waste (MSW) collection is a necessary process in any municipality resulting in the quality-of-life, economic aspects and urban structuralization. The intrinsic nature of MSW collection relates to the development of effective vehicle routing models that optimize the total traveling distances of vehicles, the environmental emission and the investment costs. In this article, we propose a generalized vehicle routing model including multiple transfer stations, gather sites and inhomogeneous vehicles in time windows for MSW collection. It takes into account traveling in one-way routes, the number of vehicles per m(2) and waiting time at traffic stops for reduction of operational time. The proposed model could be used for scenarios having similar node structures and vehicles' characteristics. A case study at Danang city, Vietnam is given to illustrate the applicability of this model. The experimental results have clearly shown that the new model reduces both total traveling distances and operational hours of vehicles in comparison with those of practical scenarios. Optimal routes of vehicles on streets and markets at Danang are given. Those results are significant to practitioners and local policy makers.

  13. The optimal time for early excision in major burn injury.

    Science.gov (United States)

    Muangman, Pornprom; Sullivan, Stephen R; Honari, Shari; Engrav, Lorenz H; Heimbach, David M; Gibran, Nicole S

    2006-01-01

    Early excision and grafting (E&G) drastically changed burn care in America by reducing morbidity, mortality and hospital length of stay (LOS). The present study was intended to determine whether an optimal time window exists between resuscitation and wound sepsis for the first E&G in a patient with a large burn. The authors conducted a retrospective study of patients admitted between January 1994 and December 2000 with > or = 40% TBSA burns and at least 1 E&G procedure. Patients were grouped according to the day of their first operation. Patients allowed to heal indeterminate burns prior to excision and grafting of deep partial or full thickness burns were grouped as > or = d7 and were excluded from the present study. The authors correlated the time of first excision with infection, mortality and LOS. Seventy-five patients were identified and 12 patients allowed to heal indeterminate burn prior to excision and grafting of deep partial or full thickness burns were excluded. Sixty-three remaining patients included 51 males and 12 females. Mean burn size was 49% of total body surface area (TBSA) (44% deep partial or full thickness) and the mean age was 36 years. There were 61 flame (2 combined with electrical injuries), 1 scald and 1 chemical burn. Twelve died (19%) and 52 patients developed 121 infections. Whereas there was no statistical difference in mortality for patients operated on different days (p > 0.2), 60% of patients operated within the first 48 hours after injury died; this was not significant due to a small patient number The present data suggest that patients who undergo early excision and grafting within seven days following a major burn > or = 40% TBSA have equivalent infection or mortality rates regardless of when the first operation occurs between post burn day(PBD) 2 and PBD 7 (p > 0.2).

  14. The backtracking search optimization algorithm for frequency band and time segment selection in motor imagery-based brain-computer interfaces.

    Science.gov (United States)

    Wei, Zhonghai; Wei, Qingguo

    2016-09-01

    Common spatial pattern (CSP) is a powerful algorithm for extracting discriminative brain patterns in motor imagery-based brain-computer interfaces (BCIs). However, its performance depends largely on the subject-specific frequency band and time segment. Accurate selection of most responsive frequency band and time segment remains a crucial problem. A novel evolutionary algorithm, the backtracking search optimization algorithm is used to find the optimal frequency band and the optimal combination of frequency band and time segment. The former is searched by a frequency window with changing width of which starting and ending points are selected by the backtracking optimization algorithm; the latter is searched by the same frequency window and an additional time window with fixed width. The three parameters, the starting and ending points of frequency window and the starting point of time window, are jointly optimized by the backtracking search optimization algorithm. Based on the chosen frequency band and fixed or chosen time segment, the same feature extraction is conducted by CSP and subsequent classification is carried out by Fisher discriminant analysis. The classification error rate is used as the objective function of the backtracking search optimization algorithm. The two methods, named BSA-F CSP and BSA-FT CSP, were evaluated on data set of BCI competition and compared with traditional wideband (8-30[Formula: see text]Hz) CSP. The classification results showed that backtracking search optimization algorithm can find much effective frequency band for EEG preprocessing compared to traditional broadband, substantially enhancing CSP performance in terms of classification accuracy. On the other hand, the backtracking search optimization algorithm for joint selection of frequency band and time segment can find their optimal combination, and thus can further improve classification rates.

  15. Defining the optimal window for cranial transplantation of human induced pluripotent stem cell-derived cells to ameliorate radiation-induced cognitive impairment.

    Science.gov (United States)

    Acharya, Munjal M; Martirosian, Vahan; Christie, Lori-Ann; Riparip, Lara; Strnadel, Jan; Parihar, Vipan K; Limoli, Charles L

    2015-01-01

    Past preclinical studies have demonstrated the capability of using human stem cell transplantation in the irradiated brain to ameliorate radiation-induced cognitive dysfunction. Intrahippocampal transplantation of human embryonic stem cells and human neural stem cells (hNSCs) was found to functionally restore cognition in rats 1 and 4 months after cranial irradiation. To optimize the potential therapeutic benefits of human stem cell transplantation, we have further defined optimal transplantation windows for maximizing cognitive benefits after irradiation and used induced pluripotent stem cell-derived hNSCs (iPSC-hNSCs) that may eventually help minimize graft rejection in the host brain. For these studies, animals given an acute head-only dose of 10 Gy were grafted with iPSC-hNSCs at 2 days, 2 weeks, or 4 weeks following irradiation. Animals receiving stem cell grafts showed improved hippocampal spatial memory and contextual fear-conditioning performance compared with irradiated sham-surgery controls when analyzed 1 month after transplantation surgery. Importantly, superior performance was evident when stem cell grafting was delayed by 4 weeks following irradiation compared with animals grafted at earlier times. Analysis of the 4-week cohort showed that the surviving grafted cells migrated throughout the CA1 and CA3 subfields of the host hippocampus and differentiated into neuronal (∼39%) and astroglial (∼14%) subtypes. Furthermore, radiation-induced inflammation was significantly attenuated across multiple hippocampal subfields in animals receiving iPSC-hNSCs at 4 weeks after irradiation. These studies expand our prior findings to demonstrate that protracted stem cell grafting provides improved cognitive benefits following irradiation that are associated with reduced neuroinflammation.

  16. Neural basis of the time window for subjective motor-auditory integration

    Directory of Open Access Journals (Sweden)

    Koichi eToida

    2016-01-01

    Full Text Available Temporal contiguity between an action and corresponding auditory feedback is crucial to the perception of self-generated sound. However, the neural mechanisms underlying motor–auditory temporal integration are unclear. Here, we conducted four experiments with an oddball paradigm to examine the specific event-related potentials (ERPs elicited by delayed auditory feedback for a self-generated action. The first experiment confirmed that a pitch-deviant auditory stimulus elicits mismatch negativity (MMN and P300, both when it is generated passively and by the participant’s action. In our second and third experiments, we investigated the ERP components elicited by delayed auditory feedback of for a self-generated action. We found that delayed auditory feedback elicited an enhancement of P2 (enhanced-P2 and a N300 component, which were apparently different from the MMN and P300 components observed in the first experiment. We further investigated the sensitivity of the enhanced-P2 and N300 to delay length in our fourth experiment. Strikingly, the amplitude of the N300 increased as a function of the delay length. Additionally, the N300 amplitude was significantly correlated with the conscious detection of the delay (the 50% detection point was around 200 ms, and hence reduction in the feeling of authorship of the sound (the sense of agency. In contrast, the enhanced-P2 was most prominent in short-delay (≤ 200 ms conditions and diminished in long-delay conditions. Our results suggest that different neural mechanisms are employed for the processing of temporally-deviant and pitch-deviant auditory feedback. Additionally, the temporal window for subjective motor–auditory integration is likely about 200 ms, as indicated by these auditory ERP components.

  17. Endovascular treatment of acute ischemic stroke may be safely performed with no time window limit in appropriately selected patients.

    Science.gov (United States)

    Abou-Chebl, Alex

    2010-09-01

    The traditional time window for acute ischemic stroke intra-arterial therapy (IAT) is stroke duration. Thrombolytics were minimized after 6 hours in favor of mechanical embolectomy or angioplasty+/-stenting. Outcomes (National Institutes of Health Stroke Scale, modified Rankin Scale) were assessed by independent examiners. A multivariate analysis was performed to compare those treated 6 hours (late). Fifty-five patients (mean National Institutes of Health Stroke Scale=19.7+/-5.7) were treated, 34 early and 21 late, with mean time-to-intervention of 3.4+/-1.6 hours and 18.6+/-16.0 hours, respectively. Thrombolysis In Myocardial Ischemia 2 or 3 recanalization was achieved in 82.8% early and 85.7% late patients (P=1.0). Intracerebral hemorrhage occurred in 25.5% overall, but symptomatic intracerebral hemorrhage occurred in 8.8% of the early and 9.5% of the late patients (P=1.0). Thirty-day mortality was similar (29.4% versus 23.8%, P=0.650). At 3 months, 41.2% and 42.9%, respectively, achieved a modified Rankin Scale Stroke Scale was a predictor of modified Rankin Scale acute ischemic stroke can be performed safely regardless of stroke duration. The concept of an acute ischemic stroke treatment window for IAT should be re-evaluated with a clinical trial selecting patients with perfusion mismatch.

  18. Interaction between workers during a short time window is required for bacterial symbiont transmission in Acromyrmex leaf-cutting ants

    DEFF Research Database (Denmark)

    Marsh, Sarah E.; Thomas-Poulsen, Michael; Pinto-Tomás, Adrián;

    2014-01-01

    Stable associations between partners over time are critical for the evolution of mutualism. Hosts employ a variety of mechanisms to maintain specificity with bacterial associates. Acromyrmex leaf-cutting ants farm a fungal cultivar as their primary nutrient source. These ants also carry a Pseudon......Stable associations between partners over time are critical for the evolution of mutualism. Hosts employ a variety of mechanisms to maintain specificity with bacterial associates. Acromyrmex leaf-cutting ants farm a fungal cultivar as their primary nutrient source. These ants also carry...... occurred later than 2 hours post-eclosion (0% acquiring, n = 18). Our findings show that transmission of exosymbionts to newly eclosed major workers occurs through interactions with exosymbiont-covered workers within a narrow time window after eclosion. This mode of transmission likely helps ensure...

  19. Mechanical diagnosis of human erythrocytes by ultra-high speed manipulation unraveled critical time window for global cytoskeletal remodeling

    Science.gov (United States)

    Ito, Hiroaki; Murakami, Ryo; Sakuma, Shinya; Tsai, Chia-Hung Dylan; Gutsmann, Thomas; Brandenburg, Klaus; Pöschl, Johannes M. B.; Arai, Fumihito; Kaneko, Makoto; Tanaka, Motomu

    2017-02-01

    Large deformability of erythrocytes in microvasculature is a prerequisite to realize smooth circulation. We develop a novel tool for the three-step “Catch-Load-Launch” manipulation of a human erythrocyte based on an ultra-high speed position control by a microfluidic “robotic pump”. Quantification of the erythrocyte shape recovery as a function of loading time uncovered the critical time window for the transition between fast and slow recoveries. The comparison with erythrocytes under depletion of adenosine triphosphate revealed that the cytoskeletal remodeling over a whole cell occurs in 3 orders of magnitude longer timescale than the local dissociation-reassociation of a single spectrin node. Finally, we modeled septic conditions by incubating erythrocytes with endotoxin, and found that the exposure to endotoxin results in a significant delay in the characteristic transition time for cytoskeletal remodeling. The high speed manipulation of erythrocytes with a robotic pump technique allows for high throughput mechanical diagnosis of blood-related diseases.

  20. Optimization of Heat Gain by Air Exchange through the Window of Cold Storage Using S/N Ratio and ANOVA Analysis”

    Directory of Open Access Journals (Sweden)

    Dr. Nimai Mukhopadhyay

    2017-04-01

    Full Text Available Energy is at scarcity, crisis of energy is leading towards a world where growth might come to an absolute hold and optimizing the processes might give a way out to save energy for future generations and give some positive way out. In this situation if the maximum heat energy (Q is absorbed by the evaporator inside the cold room through convective heat transfer process in terms of –heat transfer due to convection and heat transfer due to condensation and also heat enter in the cold store due to air exchange through the windows more energy has to be wasted to maintain the evaporator space at the desired temperature range of 2-6 degree centigrade. In this paper we have tried to optimize the heat gain by the air exchange through the windows of cold storage in the evaporator space using regression analysis. Temperature difference (dT, Height of cold store Window (H and Relative Humidity (RH are the basic variable and three ranges are taken each of them in the model development. Graphical interpretations from the model justify the reality through S/N ratio calculation and ANOVA analysis

  1. On the detection of neutrinos from solar flares using pion-decay photons to provide a time window template

    CERN Document Server

    de Wasseige, G; van Eijndhoven, N; Evenson, P; Klein, K -L

    2015-01-01

    Since the end of the eighties and in response to a reported increase in the total neutrino flux in the Homestake experiment in coincidence with solar flares, solar neutrino detectors have searched for solar flare signals. Even though these detectors have used different solar flare samples and analyses, none of them has been able to confirm the possible signal seen by Homestake. Neutrinos from the decay of mesons, which are themselves produced in collisions of accelerated ions with the solar atmosphere would provide a novel window on the underlying physics of the hadronic acceleration and interaction processes during solar flares. Solar flare neutrino flux measurements would indeed help to constrain current parameters such as the composition of the accelerated flux, the proton/ion spectral index and the high energy cutoff or the magnetic configuration in the interaction region. We describe here a new way to search for these neutrinos by considering a specific solar flare sample and a data driven time window te...

  2. Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet

    Directory of Open Access Journals (Sweden)

    Michel Povlovitsch Seixas

    2013-01-01

    Full Text Available This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can perform multiple routes per day, all starting and ending at a single depot, and it is assigned to a single driver whose total work hours are limited. A column generation algorithm is proposed. The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performing multiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

  3. A method for detecting crack wave arrival time and crack localization in a tunnel by using moving window technique

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Young Chul; Park, Tae Jin [KAERI, Daejeon (Korea, Republic of)

    2016-05-15

    Source localization in a dispersive medium has been carried out based on the time-of-arrival-differences (TOADs) method: a triangulation method and a circle intersection technique. Recent signal processing advances have led to calculation TOAD using a joint time-frequency analysis of the signal, where a short-time Fourier transform(STFT) and wavelet transform can be included as popular algorithms. The time-frequency analysis method is able to provide various information and more reliable results such as seismic-attenuation estimation, dispersive characteristics, a wave mode analysis, and temporal energy distribution of signals compared with previous methods. These algorithms, however, have their own limitations for signal processing. In this paper, the effective use of proposed algorithm in detecting crack wave arrival time and source localization in rock masses suggest that the evaluation and real-time monitoring on the intensity of damages related to the tunnels or other underground facilities is possible. Calculation of variances resulted from moving windows as a function of their size differentiates the signature from noise and from crack signal, which lead us to determine the crack wave arrival time. Then, the source localization is determined to be where the variance of crack wave velocities from real and virtual crack localization becomes a minimum. To validate our algorithm, we have performed experiments at the tunnel, which resulted in successful determination of the wave arrival time and crack localization.

  4. Time-dependent optimal heater control using finite difference method

    Energy Technology Data Exchange (ETDEWEB)

    Li, Zhen Zhe; Heo, Kwang Su; Choi, Jun Hoo; Seol, Seoung Yun [Chonnam National Univ., Gwangju (Korea, Republic of)

    2008-07-01

    Thermoforming is one of the most versatile and economical process to produce polymer products. The drawback of thermoforming is difficult to control thickness of final products. Temperature distribution affects the thickness distribution of final products, but temperature difference between surface and center of sheet is difficult to decrease because of low thermal conductivity of ABS material. In order to decrease temperature difference between surface and center, heating profile must be expressed as exponential function form. In this study, Finite Difference Method was used to find out the coefficients of optimal heating profiles. Through investigation, the optimal results using Finite Difference Method show that temperature difference between surface and center of sheet can be remarkably minimized with satisfying temperature of forming window.

  5. Surgery for subacromial impingement syndrome in relation to intensities of occupational mechanical exposures across 10-year exposure time windows.

    Science.gov (United States)

    Dalbøge, Annett; Frost, Poul; Andersen, Johan Hviid; Svendsen, Susanne Wulff

    2017-08-20

    We aimed to identify intensities of occupational mechanical exposures (force, arm elevation and repetition) that do not entail an increased risk of surgery for subacromial impingement syndrome (SIS) even after prolonged durations of exposure. Additionally, we wanted to evaluate if exposure to hand-arm vibration (HAV) is an independent risk factor. We used data from a register-based cohort study of the entire Danish working population (n=2 374 403). During follow-up (2003-2008), 14 118 first-time events of surgery for SIS occurred. For each person, we linked register-based occupational codes (1993-2007) to a general population job exposure matrix to obtain year-by-year exposure intensities on measurement scales for force, upper arm elevation >90° and repetition and expert rated intensities of exposure to HAV. For 10-year exposure time windows, we calculated the duration of exposure at specific intensities above minimal (low, medium and high). We used a logistic regression technique equivalent to discrete survival analysis adjusting for cumulative effects of other mechanical exposures. We found indications of safe exposure intensities for repetition (median angular velocity 90° >2 min/day implied an increased risk reaching ORs of 1.7 and 1.5 after 10 years at low intensities. No associations were found for HAV. We found indications of safe exposure intensities for repetition. Any intensities of force and upper arm elevation >90° above minimal implied an increased risk across 10-year exposure time windows. No independent associations were found for HAV. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2017. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

  6. Optimization of PERT Network and Compression of Time

    Institute of Scientific and Technical Information of China (English)

    Li Ping; Hu Jianbing; Gu Xinyi

    2005-01-01

    In the traditional methods of program evaluation and review technique (PERT) network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The anthors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn: (1) compression of time is restricted by cost ratio and completion probability of project; (2) activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; (3) there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker's preference.

  7. Dispensability of the SAC Depends on the Time Window Required by Aurora B to Ensure Chromosome Biorientation.

    Directory of Open Access Journals (Sweden)

    Marta Muñoz-Barrera

    Full Text Available Aurora B and the spindle assembly checkpoint (SAC collaborate to ensure the proper biorientation of chromosomes during mitosis. However, lack of Aurora B activity and inactivation of the SAC have a very different impact on chromosome segregation. This is most evident in Saccharomyces cerevisiae, since in this organism the lack of Aurora B is lethal and leads to severe aneuploidy problems, while the SAC is dispensable under normal growth conditions and mutants in this checkpoint do not show evident chromosome segregation defects. We demonstrate that the efficient repair of incorrect chromosome attachments by Aurora B during the initial stages of spindle assembly in budding yeast determines the lack of chromosome segregation defects in SAC mutants, and propose that the differential time window that Aurora B kinase requires to establish chromosome biorientation is the key factor that determines why some cells are more dependent on a functional SAC than others.

  8. Dispensability of the SAC Depends on the Time Window Required by Aurora B to Ensure Chromosome Biorientation

    Science.gov (United States)

    Monje-Casas, Fernando

    2015-01-01

    Aurora B and the spindle assembly checkpoint (SAC) collaborate to ensure the proper biorientation of chromosomes during mitosis. However, lack of Aurora B activity and inactivation of the SAC have a very different impact on chromosome segregation. This is most evident in Saccharomyces cerevisiae, since in this organism the lack of Aurora B is lethal and leads to severe aneuploidy problems, while the SAC is dispensable under normal growth conditions and mutants in this checkpoint do not show evident chromosome segregation defects. We demonstrate that the efficient repair of incorrect chromosome attachments by Aurora B during the initial stages of spindle assembly in budding yeast determines the lack of chromosome segregation defects in SAC mutants, and propose that the differential time window that Aurora B kinase requires to establish chromosome biorientation is the key factor that determines why some cells are more dependent on a functional SAC than others. PMID:26661752

  9. Development of windows based software to analyze fluorescence decay with time-correlated single photon counting (TCSPC) setup

    CERN Document Server

    Mallick, M B; Ravindranath, S V G

    2002-01-01

    A VUV spectroscopic facility for studies in photophysics and photochemistry is being set up at INDUS-I synchrotron source, CAT, Indore. For this purpose, a data acquisition system based on time-correlated single photon counting method is being developed for fluorescence lifetime measurement. To estimate fluorescence lifetime from the data collected with this sytem, a Windows based program has been developed using Visual Basic 5.0. It uses instrument response function (IRF) and observed decay curve and estimates parameters of single exponential decay by least square analysis and Marquardt method as convergence mechanism. Estimation of parameters was performed using data collected with a commercial setup. Goodness of fit was judged by evaluating chi R sup 2 , weighted residuals and autocorrelation function. Performance is compared with two commercial software packages and found to be satisfactory.

  10. A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Michael Polacek

    2008-12-01

    Full Text Available In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS. On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best found solutions and a self-adapting mechanism for the most important search parameters. This makes an a priori parameter tuning obsolete. On the other hand, a fine-grained scheme was designed to reproduce the successful properties of the sequential VNS. In combination with the use of parallel exploration threads all of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.

  11. Comparison between Windowed FFT and Hilbert-Huang Transform for Analyzing Time Series with Poissonian Fluctuations: A Case Study

    Institute of Scientific and Technical Information of China (English)

    Dong Han; Shuang-Nan Zhang

    2006-01-01

    Hilbert-Huang Transform (HHT) is a novel data analysis technique for nonlinear and non-stationary data. We present a time-frequency analysis of both simulated light curves and an X-ray burst from the X-ray burster 4U 1702-429 with both the HHT and the Windowed Fast Fourier Transform (WFFT) methods. Our results show that the HHT method has failed in all cases for light curves with Poissonian fluctuations which are typical for all photon counting instruments used in astronomy, whereas the WFFT method can sensitively detect the periodic signals in the presence of Poissonian fluctuations; the only drawback of the WFFT method is that it cannot detect sharp frequency variations accurately.

  12. Pulsar timing can constrain primordial black holes in the LIGO mass window

    Science.gov (United States)

    Schutz, Katelin; Liu, Adrian

    2017-01-01

    The recent discovery of gravitational waves from merging black holes has generated interest in primordial black holes as a possible component of dark matter. In this paper, we show that pulsar timing may soon have sufficient data to constrain 1 - 1000 M⊙ primordial black holes (PBHs) via the nondetection of a third-order Shapiro time delay as the black holes move around the Galactic halo. We present the results of a Monte Carlo simulation which suggests that future data from known pulsars may be capable of constraining the PBH density more stringently than other existing methods in the mass range ˜1 - 30 M⊙ . We find that timing new pulsars discovered using the proposed Square Kilometre Array may constrain primordial black holes in this mass range to comprise less than ˜1 %- 10 % of the dark matter.

  13. Pulsar timing can constrain primordial black holes in the LIGO mass window

    CERN Document Server

    Schutz, Katelin

    2016-01-01

    The recent discovery of gravitational waves from merging black holes has generated interest in primordial black holes as a possible component of the dark matter. In this paper, we show that pulsar timing may soon have sufficient data to constrain $1$-$1000\\,M_{\\odot}$ primordial black holes via the non-detection of a third-order Shapiro time delay as the black holes move around the Galactic halo. We present the results of a Monte Carlo simulation which suggests that future data from known pulsars may be capable of constraining the PBH density more stringently than other existing methods in the mass range ~1-30$\\,M_{\\odot}$. We find that timing new pulsars discovered using the proposed Square Kilometre Array may constrain primordial black holes in this mass range to comprise less than ~1-10% of the dark matter.

  14. Scattering and anelastic attenuation of seismic energy in Northeast India using the multiple lapse time window analysis

    Science.gov (United States)

    Padhy, S.

    2010-12-01

    We investigated the intrinsic dissipation and scattering properties of the lithosphere beneath the northeast India by using the seismic waves recorded by a network of ten broadband stations in the region with hypocentral distances ranging from 31 to 200 km. First, we determined coda Q from the amplitude decay rate of the S-wave coda envelopes in five frequency bands from 1.5 to 24 Hz based on single scattering theory and QS by means of the coda normalization method. Assuming a frequency dependent power-law of the form , we found a low Q0 (Q0 India is seismically active and heterogeneous. Then we applied the multiple lapse time window (MLTW) analysis in the hypothesis of velocity and scattering coefficients constant with depth. We calculated the variation of integrated spectral energy with hypocentral distance for three consecutive lapse time windows (0-15, 15-30, 30-45 sec), starting from the onset of the S-wave arrival. The spectral energies over an octave bandwidth with central frequencies at 1.5, 3, 6, 12 and 24 Hz were calculated to obtain the frequency dependence of attenuation parameters. The results show that intrinsic absorption dominates over scattering in the attenuation process at high frequencies. However, in the hypothesis of uniform medium, the estimates of scattering attenuations obtained by MLTW analysis are overestimated. So the present results are correct to a first order approximation. To obtain more reliable and unbiased estimates of the attenuation parameters and their frequency dependences by considering the probable influence of crustal-mantel heterogeneities, we analyze the events by using the depth dependent MLTW method.

  15. Bryostatin extends tPA time window to 6 hours following middle cerebral artery occlusion in aged female rats

    Science.gov (United States)

    Tan, Zhenjun; Lucke-Wold, Brandon P.; Logsdon, Aric F.; Turner, Ryan C.; Tan, Cong; Li, Xinlan; Hongpaison, Jarin; Alkon, Daniel L.; Simpkins, James W.; Rosen, Charles L.; Huber, Jason D.

    2015-01-01

    Background and Purpose Blood-brain barrier (BBB) disruption and hemorrhagic transformation (HT) following ischemic/reperfusion injury contributes to post-stroke morbidity and mortality. Bryostatin, a potent protein kinase C (PKC) modulator, has shown promise in treating neurological injury. In the present study, we tested the hypothesis that administration of bryostatin would reduce BBB disruption and HT following acute ischemic stroke; thus, prolonging the time window for administering recombinant tissue plasminogen activator (r-tPA). Methods Acute cerebral ischemia was produced by reversible occlusion of the right middle cerebral artery (MCAO) in 18–20-month-old female rats using an autologous blood clot with delayed r-tPA reperfusion. Bryostatin (or vehicle) was administered at 2 hours post-MCAO and r-tPA was administered at 6 hours post-MCAO. Functional assessment, lesion volume, and hemispheric swelling measurements were performed at 24 hours post-MCAO. Assessment of BBB permeability, measurement of hemoglobin, assessment of matrix metalloproteinase (MMP) levels by gel zymography, and measurement of PKCε, PKCα, PKCδ expression by western blot were conducted at 24 hours post-MCAO. Results Rats treated with bryostatin prior to r-tPA administration had decreased mortality and hemispheric swelling when compared with rats treated with r-tPA alone. Administration of bryostatin also limited BBB disruption and HT and down-regulated MMP-9 expression while up-regulating PKCε expression at 24 hours post-MCAO. Conclusions Bryostatin administration ameliorates BBB disruption and reduces the risk of HT by down-regulating MMP-9 activation and up-regulating PKCε. In this proof-of-concept study, bryostatin treatment lengthened the time-to-treatment window and enhanced the efficacy and safety of thrombolytic therapy. PMID:26189021

  16. Bryostatin extends tPA time window to 6 h following middle cerebral artery occlusion in aged female rats.

    Science.gov (United States)

    Tan, Zhenjun; Lucke-Wold, Brandon P; Logsdon, Aric F; Turner, Ryan C; Tan, Cong; Li, Xinlan; Hongpaison, Jarin; Alkon, Daniel L; Simpkins, James W; Rosen, Charles L; Huber, Jason D

    2015-10-05

    Blood-brain barrier (BBB) disruption and hemorrhagic transformation (HT) following ischemic/reperfusion injury contributes to post-stroke morbidity and mortality. Bryostatin, a potent protein kinase C (PKC) modulator, has shown promise in treating neurological injury. In the present study, we tested the hypothesis that administration of bryostatin would reduce BBB disruption and HT following acute ischemic stroke; thus, prolonging the time window for administering recombinant tissue plasminogen activator (r-tPA). Acute cerebral ischemia was produced by reversible occlusion of the right middle cerebral artery (MCAO) in 18-20-month-old female rats using an autologous blood clot with delayed r-tPA reperfusion. Bryostatin (or vehicle) was administered at 2 h post-MCAO and r-tPA was administered at 6 h post-MCAO. Functional assessment, lesion volume, and hemispheric swelling measurements were performed at 24 h post-MCAO. Assessment of BBB permeability, measurement of hemoglobin, assessment of matrix metalloproteinase (MMP) levels by gel zymography, and measurement of PKCε, PKCα, PKCδ expression by western blot were conducted at 24 h post-MCAO. Rats treated with bryostatin prior to r-tPA administration had decreased mortality and hemispheric swelling when compared with rats treated with r-tPA alone. Administration of bryostatin also limited BBB disruption and HT and down-regulated MMP-9 expression while up-regulating PKCε expression at 24 h post-MCAO. Bryostatin administration ameliorates BBB disruption and reduces the risk of HT by down-regulating MMP-9 activation and up-regulating PKCε. In this proof-of-concept study, bryostatin treatment lengthened the time-to-treatment window and enhanced the efficacy and safety of thrombolytic therapy. Copyright © 2015 Elsevier B.V. All rights reserved.

  17. Therapeutic time window of flurbiprofen axetil's neuroprotective effect in a rat model of transient focal cerebral ischemia

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Background The neuroprotective effect of the cyclooxygenase (COX) inhibitor has been demonstrated in acute and chronic neurodegenerative processes. But its function under cerebral ischemic conditions is unclear. This study was designed to evaluate the neuroprotective efficacy of emulsified flurbiprofen axetil (FA, COX inhibitor) and its therapeutic time window in a model of transient middle cerebral artery occlusion (MCAO) in rats. Methods Forty-eight male SD rats were randomly assigned into six groups (n=8 in each group); three FA groups, vehicle, sham and ischemia/reperfusion (I/R) groups. Three doses of FA (5, 10 or 20 mg/kg, intravenous infusion) were administered just after cerebral ischemia/reperfusion (I/R). The degree of neurological outcome was measured by the neurologic deficit score (NDS) at 24, 48 and 72 hours after I/R. Mean brain infarct volume percentage (MBIVP) was determined with 2,3,5-triphenyltetrazolium chloride (TTC) staining at 72 hours after I/R. In three other groups (n=8 in each group), the selected dosage of 10 mg/kg was administrated intravenously at 6, 12 and 24 hours after I/R. Results The three different doses of FA improved NDS at 24, 48 and 72 hours after I/R and significantly reduced MBIVP. However, the degree of MBIVP in the FA 20 mg/kg group differed from that in FA 10 mg/kg group. Of interest is the finding that the neuroprotective effect conferred by 10 mg/kg of FA was also observed when treatment was delayed until 12-24 hours after ischemia reperfusion. Conclusion COX inhibitor FA is a promising therapeutic strategy for cerebral ischemia and its therapeutic time window could last for 12--24 hours after cerebral ischemia reperfusion, which would help in lessening the initial ischemic brain damage.

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

  19. Exploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows

    Science.gov (United States)

    2014-09-18

    nomenclature given by Stutzle [63], our MMAS implementation includes α = 1 and β = 2, meaning the heuristic information is considered twice as important as the...later time period, or lost sales , in which case the shortage is not filled. Alternatively, the inventory may be restricted to be non-negative. In... nomenclature offered by Coelho et al. does not adequately describe the MILIRP. The MILIRP models the customer demand deterministically but Coelho

  20. XRTD: An X-Windows based, real-time radiometric display and analysis system

    Science.gov (United States)

    Pollmeier, Vincent M.

    1993-01-01

    XRTD is a graphical user interface (GUI) based tool for monitoring real time radiometric spacecraft data. The tool is designed to allow the navigation analyst to both view and analyze the characteristics of Doppler and ranging data. This capability is critical if ground personnel wish to verify the correct performance of ongoing maneuvers. The raw tracking data is transferred from Deep Space Network (DSN) computers to a local workstation, where the predicted value for the observable is subtracted from the actual observed value to create a residual. The tool then allows the navigation analyst to rescale and replot the data using simple GUI techniques. The navigator may then perform a number of data analysis and modeling techniques on the resulting residuals to allow for the real time characterization of spacecraft events. These techniques include the modeling of maneuvers, the compression and differencing of data, and Fast Fourier transforms of the data. This tool has shortened the amount of time required for initial characterization of spacecraft maneuvers from several hours to a few minutes.

  1. Robustified time-optimal control of uncertain structural dynamic systems

    Science.gov (United States)

    Liu, Qiang; Wie, Bong

    1991-01-01

    A new approach for computing open-loop time-optimal control inputs for uncertain linear dynamical systems is developed. In particular, the single-axis, rest-to-rest maneuvering problem of flexible spacecraft in the presence of uncertainty in model parameters is considered. Robustified time-optimal control inputs are obtained by solving a parameter optimization problem subject to robustness constraints. A simple dynamical system with a rigid-body mode and one flexible mode is used to illustrate the concept.

  2. Optimal Control with Time Delays via the Penalty Method

    Directory of Open Access Journals (Sweden)

    Mohammed Benharrat

    2014-01-01

    Full Text Available We prove necessary optimality conditions of Euler-Lagrange type for a problem of the calculus of variations with time delays, where the delay in the unknown function is different from the delay in its derivative. Then, a more general optimal control problem with time delays is considered. Main result gives a convergence theorem, allowing us to obtain a solution to the delayed optimal control problem by considering a sequence of delayed problems of the calculus of variations.

  3. Design of Real-Time and Multitask Scheduling of Open CNC Based on Windows + RTX%基于Windows+RTX的CNC实时多任务调度设计

    Institute of Scientific and Technical Information of China (English)

    刘寰; 秦现生; 蒋明桔; 田青山

    2012-01-01

    A basic prototype of soft CNC system is built based on Windows. NET development platform and real-time extension kernel RTX, and system functions are devided by modules based on non-real-time and realtime component technologies. Also, the multitask scheduling model is analyzed and designed in depth, and realtime and multithready execute techniques are introduced to accomplish communication task.%基于Windows.NET开发平台及实时扩展内核RTX构建了全软件数控系统基本原型,结合非实时任务组件和实时任务组件技术对系统功能进行了模块划分,深入讨论了多任务调度策略,并引入多线程技术和实时技术完成系统的通信任务.

  4. Optimal distribution of measurement time in single channel measurements

    CERN Document Server

    Kaspar, J

    2008-01-01

    Single channel measurements play a minor role in today physics, but they are sometimes unavoidable. Comparing to multichannel measurements, there is distribution of measurement time to be chosen in an experiment design. A method to optimize distribution of measurement time is given, where optimal distribution minimizes standard deviation of a selected fit parameter. As an example, the method is applied to electron spectroscopy experiments.

  5. Time is on my side: optimism in intertemporal choice

    NARCIS (Netherlands)

    Berndsen, M.; van der Pligt, J.

    2001-01-01

    The present research, using data from 163 undergraduates, examines the role of optimism on time preferences for both losses and gains. It is argued that optimism has asymmetric effects on time preferences for gains versus losses: one reason why decision makers prefer immediate gains is because they

  6. Time is on my side: optimism in intertemporal choice

    NARCIS (Netherlands)

    Berndsen, M.; van der Pligt, J.

    2001-01-01

    The present research, using data from 163 undergraduates, examines the role of optimism on time preferences for both losses and gains. It is argued that optimism has asymmetric effects on time preferences for gains versus losses: one reason why decision makers prefer immediate gains is because they

  7. Discrete-time optimal control and games on large intervals

    CERN Document Server

    Zaslavski, Alexander J

    2017-01-01

    Devoted to the structure of approximate solutions of discrete-time optimal control problems and approximate solutions of dynamic discrete-time two-player zero-sum games, this book presents results on properties of approximate solutions in an interval that is independent lengthwise, for all sufficiently large intervals. Results concerning the so-called turnpike property of optimal control problems and zero-sum games in the regions close to the endpoints of the time intervals are the main focus of this book. The description of the structure of approximate solutions on sufficiently large intervals and its stability will interest graduate students and mathematicians in optimal control and game theory, engineering, and economics. This book begins with a brief overview and moves on to analyze the structure of approximate solutions of autonomous nonconcave discrete-time optimal control Lagrange problems.Next the structures of approximate solutions of autonomous discrete-time optimal control problems that are discret...

  8. Early-Time UV Spectroscopy of Stripped-Envelope Supernovae: A New Window

    Science.gov (United States)

    Filippenko, Alex

    2014-10-01

    We propose to continue our Cycle 19 and 20 Target-of-Opportunity (ToO) programs to obtain three early-time UV spectra of a stripped-envelope core-collapse supernova (SN Ib or SN Ic), starting well before maximum brightness. The underlying nature of these objects, from the mass-loss process stripping the envelope to the details of the explosion mechanism, remain mysterious. Connections to gamma-ray bursts and X-ray flashes further motivate this study. Many high-redshift SNe are being found in deep transient surveys, but the ability to distinguish between thermonuclear Type Ia SNe and stripped-envelope core-collapse SNe requires thorough knowledge of the latter at UV wavelengths. By comparing the evolution of the spectra as the photosphere recedes to deeper layers of the ejecta with our time series of spectral models, we will gain a better understanding of the explosion, and possibly of the progenitor star. Specifically, we may be able to determine the metal content of the progenitor through comparisons with our spectral models, and we should be able to probe the degree of mixing during the explosion. The heterogeneity seen in stripped-envelope SNe will allow us to choose objects with different characteristics than the ones observed in Cycles 19-20, gaining further insights into this unique class of cosmic explosion. We need to seize this opportunity now, while we still have access to the space UV, and indeed the UV is the Cycle 22 priority of HST.

  9. Gas flushing through hyper-acidic crater lakes: the next steps within a reframed monitoring time window

    Science.gov (United States)

    Rouwet, Dmitri

    2016-04-01

    Tracking variations in the chemical composition, water temperature and pH of brines from peak-activity crater lakes is the most obvious way to forecast phreatic activity. Volcano monitoring intrinsically implies a time window of observation that should be synchronised with the kinetics of magmatic processes, such as degassing and magma intrusion. To decipher "how much time ago" a variation in degassing regime actually occurred before eventually being detected in a crater lake is key, and depends on the lake water residence time. The above reasoning assumes that gas is preserved as anions in the lake water (SO4, Cl, F anions), in other words, that scrubbing of acid gases is complete and irreversible. Less is true. Recent work has confirmed, by direct MultiGas measurement from evaporative plumes, that even the strongest acid in liquid medium (i.e. SO2) degasses from hyper-acidic crater lakes. The less strong acid HCl has long been recognised as being more volatile than hydrophyle in extremely acidic solutions (pH near 0), through a long-term steady increase in SO4/Cl ratios in the vigorously evaporating crater lake of Poás volcano. We now know that acidic gases flush through hyper-acidic crater lake brines, but we don't know to which extend (completely or partially?), and with which speed. The chemical composition hence only reflects a transient phase of the gas flushing through the lake. In terms of volcanic surveillance this brings the advantage that the monitoring time window is definitely shorter than defined by the water chemistry, but yet, we do not know how much shorter. Empirical experiments by Capaccioni et al. (in press) have tried to tackle this kinetic problem for HCl degassing from a "lab-lake" on the short-term (2 days). With this state of the art in mind, two new monitoring strategies can be proposed to seek for precursory signals of phreatic eruptions from crater lakes: (1) Tracking variations in gas compositions, fluxes and ratios between species in

  10. Optimal Robust Fault Detection for Linear Discrete Time Systems

    Directory of Open Access Journals (Sweden)

    Nike Liu

    2008-01-01

    Full Text Available This paper considers robust fault-detection problems for linear discrete time systems. It is shown that the optimal robust detection filters for several well-recognized robust fault-detection problems, such as ℋ−/ℋ∞, ℋ2/ℋ∞, and ℋ∞/ℋ∞ problems, are the same and can be obtained by solving a standard algebraic Riccati equation. Optimal filters are also derived for many other optimization criteria and it is shown that some well-studied and seeming-sensible optimization criteria for fault-detection filter design could lead to (optimal but useless fault-detection filters.

  11. OPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT ...

    African Journals Online (AJOL)

    eobe

    , OWERRI, NIGERIA. E-mails addresses: 1 ... time performance guarantees to multimedia applications and hard and soft real ..... In principle, OGSTT operates like a heavily loaded ..... Controlled Token Passing Protocols”, International.

  12. Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study

    Directory of Open Access Journals (Sweden)

    Alireza Rashidi Komijan

    2017-07-01

    Full Text Available The well-known Vehicle Routing Problem (VRP is to find proper sequence of routes in order to minimize transportation costs. In this paper, a mixed-integer programming model is presented for a food distributer company and the model outputs are to determine the optimal routes and amount of pickup and delivery. In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. The proposed model with respect to real conditions is multi-period and has two different time periods: one for dispatching vehicles to customers and suppliers and the other for receiving  customers’ orders. Time window and split pickup and delivery are considered for perishable products. The proposed model is  nonlinear and will be linearized using exact techniques. At the end, model is solved using GAMS and the sensitivity analysis  is performed. The results indicate that the trend of changes in holding and transportation costs in compared to tardiness and  earliness costs are closed together and are not so sensitive to demand changes.

  13. Early Time UV Spectroscopy of a Stripped-Envelope Supernova: A New Window

    Science.gov (United States)

    Filippenko, Alex

    2012-10-01

    We propose to continue our Cycle 19 program and obtain 4 epochs of UV spectroscopy of a Target of Opportunity stripped-envelope core-collapse supernova during 2 weeks roughly centered on maximum brightness. The underlying nature of these objects, from the mass-loss process stripping the envelope to the details of the explosion mechanism, remain mysterious. Connections to gamma-ray bursts and X-ray flashes further motivate this study. Many supernovae {SNe} of all types will be found in future high-redshift transient surveys, but the ability to distinguish between thermonuclear Type Ia SNe and stripped-envelope core-collapse SNe will require thorough knowledge of the latter, especially at UV wavelengths. The spectra will lead to several new insights. By comparing the evolution of the spectra as the photosphere recedes to deeper layers of the ejecta with our time series of spectral models, we will gain a better understanding of the explosion, and possibly of the progenitor star. Specifically, we may be able to determine the metal content of the progenitor through comparisons with our spectral models, and we should be able to probe the degree of mixing during the explosion. With coordinated observations of the SN in the optical and near-IR using our ground-based programs, we will be able to comprehensively characterize the nature of the emission radiated by these SNe. The heterogeneity seen in stripped-envelope SNe will allow us to choose a transient with different characteristics than the one to be observed in Cycle 19, gaining further insights into this unique class of cosmic explosion.

  14. Mechanical diagnosis of human erythrocytes by ultra-high speed manipulation unraveled critical time window for global cytoskeletal remodeling

    Science.gov (United States)

    Ito, Hiroaki; Murakami, Ryo; Sakuma, Shinya; Tsai, Chia-Hung Dylan; Gutsmann, Thomas; Brandenburg, Klaus; Pöschl, Johannes M. B.; Arai, Fumihito; Kaneko, Makoto; Tanaka, Motomu

    2017-01-01

    Large deformability of erythrocytes in microvasculature is a prerequisite to realize smooth circulation. We develop a novel tool for the three-step “Catch-Load-Launch” manipulation of a human erythrocyte based on an ultra-high speed position control by a microfluidic “robotic pump”. Quantification of the erythrocyte shape recovery as a function of loading time uncovered the critical time window for the transition between fast and slow recoveries. The comparison with erythrocytes under depletion of adenosine triphosphate revealed that the cytoskeletal remodeling over a whole cell occurs in 3 orders of magnitude longer timescale than the local dissociation-reassociation of a single spectrin node. Finally, we modeled septic conditions by incubating erythrocytes with endotoxin, and found that the exposure to endotoxin results in a significant delay in the characteristic transition time for cytoskeletal remodeling. The high speed manipulation of erythrocytes with a robotic pump technique allows for high throughput mechanical diagnosis of blood-related diseases. PMID:28233788

  15. Time-of-flight ERD with a 200 mm2 Si3N4 window gas ionization chamber energy detector

    Science.gov (United States)

    Julin, Jaakko; Laitinen, Mikko; Sajavaara, Timo

    2014-08-01

    Low energy heavy ion elastic recoil detection work has been carried out in Jyväskylä since 2009 using home made timing detectors, a silicon energy detector and a timestamping data acquisition setup forming a time-of-flight-energy telescope. In order to improve the mass resolution of the setup a new energy detector was designed to replace the silicon solid state detector, which suffered from radiation damage and had poor resolution for heavy recoils. In this paper the construction and operation of an isobutane filled gas ionization chamber with a 14 × 14 mm2 100 nm thick silicon nitride window are described. In addition to greatly improved energy resolution for heavy ions, the detector is also able to detect hydrogen recoils simultaneously in the energy range of 100-1000 keV. Additionally the detector has position sensitivity by means of timing measurement, which can be performed without compromising the performance of the detector in any other way. The achieved position sensitivity improves the depth resolution near the surface.

  16. Application of xCELLigence RTCA Biosensor Technology for Revealing the Profile and Window of Drug Responsiveness in Real Time

    Directory of Open Access Journals (Sweden)

    Dan Kho

    2015-04-01

    Full Text Available The xCELLigence technology is a real-time cellular biosensor, which measures the net adhesion of cells to high-density gold electrode arrays printed on custom-designed E-plates. The strength of cellular adhesion is influenced by a myriad of factors that include cell type, cell viability, growth, migration, spreading and proliferation. We therefore hypothesised that xCELLigence biosensor technology would provide a valuable platform for the measurement of drug responses in a multitude of different experimental, clinical or pharmacological contexts. In this manuscript, we demonstrate how xCELLigence technology has been invaluable in the identification of (1 not only if cells respond to a particular drug, but (2 the window of drug responsiveness. The latter aspect is often left to educated guess work in classical end-point assays, whereas biosensor technology reveals the temporal profile of the response in real time, which enables both acute responses and longer term responses to be profiled within the same assay. In our experience, the xCELLigence biosensor technology is suitable for highly targeted drug assessment and also low to medium throughput drug screening, which produces high content temporal data in real time.

  17. Engineering applications of discrete-time optimal control

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui; Ravn, Hans V.

    1990-01-01

    of some well-known and new results in discrete time optimal control methods applicable to practical problem solving within engineering. Emphasis is placed on dynamic programming, the classical maximum principle and generalized versions of the maximum principle for optimal control of discrete time systems......Many problems of design and operation of engineering systems can be formulated as optimal control problems where time has been discretisized. This is also true even if 'time' is not involved in the formulation of the problem, but rather another one-dimensional parameter. This paper gives a review...

  18. Engineering applications of discrete-time optimal control

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui; Ravn, Hans V.

    1990-01-01

    Many problems of design and operation of engineering systems can be formulated as optimal control problems where time has been discretisized. This is also true even if 'time' is not involved in the formulation of the problem, but rather another one-dimensional parameter. This paper gives a review...... of some well-known and new results in discrete time optimal control methods applicable to practical problem solving within engineering. Emphasis is placed on dynamic programming, the classical maximum principle and generalized versions of the maximum principle for optimal control of discrete time systems...

  19. Vehicle Optimal Velocity Curves for Minimum-Time Maneuver

    Directory of Open Access Journals (Sweden)

    Li-xia Zhang

    2014-02-01

    Full Text Available A problem in vehicle minimum-time maneuver is the assumption that a vehicle passes through a given path in a minimal amount of time without deviating from the boundary of the given path. Vehicle handling inverse dynamics provides a new perspective to solve such problem. Based on inverse dynamics, this paper transformed the problem of optimal vehicle velocity for minimum-time maneuver into that of optimal control with the objective function of minimum time. The path for minimum vehicle travel time and the optimal control model were established. The optimal velocity curves for three types of paths, namely, monotonically increasing path, monotonically decreasing path, and constant radius path, were analyzed. On this basis, the optimal velocity curves were solved for two kinds of concrete paths: a path of decreasing curvature radius followed by a path of increasing curvature radius and another path of increasing curvature radius followed by a path of decreasing curvature radius. Nine cases of possible optimal velocity curves were acquired. The optimal velocity curve of the given path, that is, a parabola followed by a semicircle, was obtained. Optimal velocity curves can be used as reference for vehicle minimum-time maneuver, which is an important issue for driver safety in fast-moving vehicles.

  20. Predicting the optimal process window for the coating of single-crystalline organic films with mobilities exceeding 7 cm2/Vs.

    Science.gov (United States)

    Janneck, Robby; Vercesi, Federico; Heremans, Paul; Genoe, Jan; Rolin, Cedric

    2016-09-01

    Organic thin film transistors (OTFTs) based on single crystalline thin films of organic semiconductors have seen considerable development in the recent years. The most successful method for the fabrication of single crystalline films are solution-based meniscus guided coating techniques such as dip-coating, solution shearing or zone casting. These upscalable methods enable rapid and efficient film formation without additional processing steps. The single-crystalline film quality is strongly dependent on solvent choice, substrate temperature and coating speed. So far, however, process optimization has been conducted by trial and error methods, involving, for example, the variation of coating speeds over several orders of magnitude. Through a systematic study of solvent phase change dynamics in the meniscus region, we develop a theoretical framework that links the optimal coating speed to the solvent choice and the substrate temperature. In this way, we can accurately predict an optimal processing window, enabling fast process optimization. Our approach is verified through systematic OTFT fabrication based on films grown with different semiconductors, solvents and substrate temperatures. The use of best predicted coating speeds delivers state of the art devices. In the case of C8BTBT, OTFTs show well-behaved characteristics with mobilities up to 7 cm2/Vs and onset voltages close to 0 V. Our approach also explains well optimal recipes published in the literature. This route considerably accelerates parameter screening for all meniscus guided coating techniques and unveils the physics of single crystalline film formation.

  1. Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

    Science.gov (United States)

    Ghezavati, V. R.; Beigi, M.

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

  2. Air transparent soundproof window

    Directory of Open Access Journals (Sweden)

    Sang-Hoon Kim

    2014-11-01

    Full Text Available A soundproof window or wall which is transparent to airflow is presented. The design is based on two wave theories: the theory of diffraction and the theory of acoustic metamaterials. It consists of a three-dimensional array of strong diffraction-type resonators with many holes centered on each individual resonator. The negative effective bulk modulus of the resonators produces evanescent wave, and at the same time the air holes with subwavelength diameter existed on the surfaces of the window for macroscopic air ventilation. The acoustic performance levels of two soundproof windows with air holes of 20mm and 50mm diameters were measured. The sound level was reduced by about 30 - 35dB in the frequency range of 400 - 5,000Hz with the 20mm window, and by about 20 - 35dB in the frequency range of 700 - 2,200Hz with the 50mm window. Multi stop-band was created by the multi-layers of the window. The attenuation length or the thickness of the window was limited by background noise. The effectiveness of the soundproof window with airflow was demonstrated by a real installation.

  3. Timing of Fatherhood: Is "On-Time" Optimal?

    Science.gov (United States)

    Cooney, Teresa M.; And Others

    1993-01-01

    Analyzed fathers (n=307) from nationally representative sample to explore relationship between timing of fatherhood and men's parenting behavior and paternal affect. Differences were found on multidimensional typology of paternal behavior and affect. Compared to "on-time" fathers, "late" fathers were more likely to be…

  4. Interaction between workers during a short time window is required for bacterial symbiont transmission in Acromyrmex leaf-cutting ants.

    Science.gov (United States)

    Marsh, Sarah E; Poulsen, Michael; Pinto-Tomás, Adrián; Currie, Cameron R

    2014-01-01

    Stable associations between partners over time are critical for the evolution of mutualism. Hosts employ a variety of mechanisms to maintain specificity with bacterial associates. Acromyrmex leaf-cutting ants farm a fungal cultivar as their primary nutrient source. These ants also carry a Pseudonocardia Actinobacteria exosymbiont on their bodies that produces antifungal compounds that help inhibit specialized parasites of the ants' fungal garden. Major workers emerge from their pupal cases (eclose) symbiont-free, but exhibit visible Actinobacterial coverage within 14 days post-eclosion. Using subcolony experiments, we investigate exosymbiont transmission within Acromyrmex colonies. We found successful transmission to newly eclosed major workers fostered by major workers with visible Actinobacteria in all cases (100% acquiring, n = 19). In contrast, newly eclosed major workers reared without exosymbiont-carrying major workers did not acquire visible Actinobacteria (0% acquiring, n = 73). We further show that the majority of ants exposed to major workers with exosymbionts within 2 hours of eclosion acquired bacteria (60.7% acquiring, n = 28), while normal acquisition did not occur when exposure occurred later than 2 hours post-eclosion (0% acquiring, n = 18). Our findings show that transmission of exosymbionts to newly eclosed major workers occurs through interactions with exosymbiont-covered workers within a narrow time window after eclosion. This mode of transmission likely helps ensure the defensive function within colonies, as well as specificity and partner fidelity in the ant-bacterium association.

  5. Optimal Time of Tracheotomy in Infants

    Directory of Open Access Journals (Sweden)

    Sevim Unal MD

    2015-01-01

    Full Text Available Objective. Infants with respiratory failure may require prolonged intubation. There is no consensus on the time of tracheotomy in neonates. Methods. We evaluated infants applied tracheotomy, time of procedure, and early complications in our neonatal intensive care unit (NICU retrospectively from January 2012 to December 2013. Results. We identified 9 infants applied tracheotomy with gestational ages 34 to 41 weeks. Their diagnoses were hypotonic infant, subglottic stenosis, laryngeal cleft, neck mass, and chronic lung disease. Age on tracheotomy ranged from 4 to 10 weeks. Early complication ratio was 33.3% with minimal bleeding (1, air leak (1, and canal revision requirement (1. We discharged 7 infants, and 2 infants died in the NICU. Conclusion. Tracheotomy makes infant nursing easy for staff and families even at home. If carried out by a trained team, the procedure is safe and has low complication. When to apply tracheotomy should be individualized, and airway damage due to prolonged intubation versus risks of tracheotomy should be taken into consideration.

  6. A buffer insertion and simultaneous sizing timing optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    Yin Guoli; Lin Zhenghui

    2006-01-01

    A path-based timing optimization algorithm for buffer insertion and simultaneous sizing is proposed.Firstly, candidate buffer insertion location and buffer size for each branch in a given routing path were obtained via localized timing optimization. Then, through evaluating each potential insertion against design objectives, potential optimal buffer insertion locations and sizes for the whole routing tree were determined. At last, by removing redundant buffer insertion operations which do not maximize S ( so ), given timing requirements are finally fulfilled through minimum number of buffers.

  7. Optimization of group delay response of (apodized) tapered fiber Bragg grating by shaping taper transition and apodization window

    Science.gov (United States)

    Markowski, Konrad; Jedrzejewski, Kazimierz; Osuch, Tomasz

    2016-09-01

    This article presents implementation of the Simulated Annealing (SA) algorithm for tapered fiber Bragg gratings (TFBGs) design. Particularly, together with well-known Coupled Mode Theory (CMT) and Transfer Matrix Method (TMM) the algorithm optimizes the group delay response of TFBG, by simultaneous shaping of both apodization function and tapered fiber transition profile. Prior to the optimization process, numerical model for TFBG design has been validated. Preliminary results reveal great potential of the SA-based approach and with proper definition of the design criteria may be even applied for optimization of the spectral properties of TFBGs.

  8. Biased random key genetic algorithm with insertion and gender selection for capacitated vehicle routing problem with time windows

    Science.gov (United States)

    Rochman, Auliya Noor; Prasetyo, Hari; Nugroho, Munajat Tri

    2017-06-01

    Vehicle Routing Problem (VRP) often occurs when the manufacturers need to distribute their product to some customers/outlets. The distribution process is typically restricted by the capacity of the vehicle and the working hours at the distributor. This type of VRP is also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A Biased Random Key Genetic Algorithm (BRKGA) was designed and coded in MATLAB to solve the CVRPTW case of soft drink distribution. The standard BRKGA was then modified by applying chromosome insertion into the initial population and defining chromosome gender for parent undergoing crossover operation. The performance of the established algorithms was then compared to a heuristic procedure for solving a soft drink distribution. Some findings are revealed (1) the total distribution cost of BRKGA with insertion (BRKGA-I) results in a cost saving of 39% compared to the total cost of heuristic method, (2) BRKGA with the gender selection (BRKGA-GS) could further improve the performance of the heuristic method. However, the BRKGA-GS tends to yield worse results compared to that obtained from the standard BRKGA.

  9. Time-windows-based filtering method for near-surface detection of leakage from geologic carbon sequestration sites

    Energy Technology Data Exchange (ETDEWEB)

    Pan, L.; Lewicki, J.L.; Oldenburg, C.M.; Fischer, M.L.

    2010-02-28

    We use process-based modeling techniques to characterize the temporal features of natural biologically controlled surface CO{sub 2} fluxes and the relationships between the assimilation and respiration fluxes. Based on these analyses, we develop a signal-enhancing technique that combines a novel time-window splitting scheme, a simple median filtering, and an appropriate scaling method to detect potential signals of leakage of CO{sub 2} from geologic carbon sequestration sites from within datasets of net near-surface CO{sub 2} flux measurements. The technique can be directly applied to measured data and does not require subjective gap filling or data-smoothing preprocessing. Preliminary application of the new method to flux measurements from a CO{sub 2} shallow-release experiment appears promising for detecting a leakage signal relative to background variability. The leakage index of ?2 was found to span the range of biological variability for various ecosystems as determined by observing CO{sub 2} flux data at various control sites for a number of years.

  10. Optimal Guaranteed Service Time and Service Level Decision with Time and Service Level Sensitive Demand

    Directory of Open Access Journals (Sweden)

    Sangjun Park

    2014-01-01

    Full Text Available We consider a two-stage supply chain with one supplier and one retailer. The retailer sells a product to customer and the supplier provides a product in a make-to-order mode. In this case, the supplier’s decisions on service time and service level and the retailer’s decision on retail price have effects on customer demand. We develop optimization models to determine the optimal retail price, the optimal guaranteed service time, the optimal service level, and the optimal capacity to maximize the expected profit of the whole supply chain. The results of numerical experiments show that it is more profitable to determine the optimal price, the optimal guaranteed service time, and the optimal service level simultaneously and the proposed model is more profitable in service level sensitive market.

  11. Variational data assimilation for the optimized ozone initial state and the short-time forecasting

    Science.gov (United States)

    Park, Soon-Young; Kim, Dong-Hyeok; Lee, Soon-Hwan; Lee, Hwa Woon

    2016-04-01

    In this study, we apply the four-dimensional variational (4D-Var) data assimilation to optimize initial ozone state and to improve the predictability of air quality. The numerical modeling systems used for simulations of atmospheric condition and chemical formation are the Weather Research and Forecasting (WRF) model and the Community Multiscale Air Quality (CMAQ) model . The study area covers the capital region of South Korea, where the surface measurement sites are relatively evenly distributed. The 4D-Var code previously developed for the CMAQ model is modified to consider background error in matrix form, and various numerical tests are conducted. The results are evaluated with an idealized covariance function for the appropriateness of the modified codes. The background error is then constructed using the NMC method with long-term modeling results, and the characteristics of the spatial correlation scale related to local circulation is analyzed. The background error is applied in the 4D-Var research, and a surface observational assimilation is conducted to optimize the initial concentration of ozone. The statistical results for the 12-hour assimilation periods and the 120 observatory sites show a 49.4% decrease in the root mean squred error (RMSE), and a 59.9% increase in the index of agreement (IOA). The temporal variation of spatial distribution of the analysis increments indicates that the optimized initial state of ozone concentration is transported to inland areas by the clockwise-rotating local circulation during the assimilation windows. To investigate the predictability of ozone concentration after the assimilation window, a short-time forecasting is carried out. The ratios of the RMSE with assimilation versus that without assimilation are 8% and 13% for the +24 and +12 hours, respectively. Such a significant improvement in the forecast accuracy is obtained solely by using the optimized initial state. The potential improvement in ozone prediction for

  12. Timing optimization utilizing order statistics and multichannel digital silicon photomultipliers

    NARCIS (Netherlands)

    Mandai, S.; Venialgo, E.; Charbon, E.

    2014-01-01

    We present an optimization technique utilizing order statistics with a multichannel digital silicon photomultiplier (MD-SiPM) for timing measurements. Accurate timing measurements are required by 3D rangefinding and time-of-flight positron emission tomography, to name a few applications. We have

  13. Timing optimization utilizing order statistics and multichannel digital silicon photomultipliers

    NARCIS (Netherlands)

    Mandai, S.; Venialgo, E.; Charbon, E.

    2014-01-01

    We present an optimization technique utilizing order statistics with a multichannel digital silicon photomultiplier (MD-SiPM) for timing measurements. Accurate timing measurements are required by 3D rangefinding and time-of-flight positron emission tomography, to name a few applications. We have dem

  14. Timing optimization utilizing order statistics and multichannel digital silicon photomultipliers

    NARCIS (Netherlands)

    Mandai, S.; Venialgo, E.; Charbon, E.

    2014-01-01

    We present an optimization technique utilizing order statistics with a multichannel digital silicon photomultiplier (MD-SiPM) for timing measurements. Accurate timing measurements are required by 3D rangefinding and time-of-flight positron emission tomography, to name a few applications. We have dem

  15. Window shopping

    Energy Technology Data Exchange (ETDEWEB)

    Best, D.

    1990-03-01

    The author addresses the energy efficiency of windows and describes changes and new products available in this consumer information article. Experiments currently being done by Lawrence Berkeley Laboratory (LBL), Bonneville Power Authority and the Washington State Energy Office show that some of these superwindows collect more energy from the sun than they let escape from inside the home. One type of window in current production is the low-E (low-emissivity) and the IGUs (insulated glass units). Low-E techniques include glazing of the glass with various materials including polyester and metallic coatings. Other measures include filling the airspace in double pane windows with argon, aerogel or by creating a vacuum in the airspace. Another factor the author considers is ultraviolet light protection.

  16. POL Allotment and Transportation Model Based on Support Time Window%基于保障时间窗的油料调拨运输模型

    Institute of Scientific and Technical Information of China (English)

    闫华; 何晓静; 周庆忠; 马致文

    2015-01-01

    通过引入保障时间窗,同时考虑油料保障的时间约束和运力约束,建立了基于保障开始时间最早,并尽可能满足保障需求量的调度模型。针对问题的多目标性,基于理想点法将初始模型转化为单目标优化模型。采用粒子群算法对模型进行求解,并设计了算法编码和求解步骤。通过算例验证了模型和算法的可行性及有效性。%The military petroleum oil&lubricants (POL) allotment and transportation problem is studied by introducing the concept of support time window. On the basis of traditional POL supporting model, support time and transportation capability con⁃straints are added to the proposed model. The objectives of the model is to make the start supporting time earliest and meeting the POL supporting requirement most. Considering multi⁃objective of the model, it is transformed into single⁃objective optimization one by using perfect point method. Particle swarm algorithm is used to solve the given model,and its coding technique and solving proce⁃dure are designed. Example with numerical results shows the effectiveness of the proposed model and algorithm.

  17. Parenthetical Windows

    DEFF Research Database (Denmark)

    Lemi, Esther; Triantafyllidis, Georgios

    2016-01-01

    Parenthetical Window is a project that engages scientific research in human perception providing a platform for users to experience their own limits and needs in their individual circadian rhythm. The presentation focuses on a case study in a community of dancers where the individual needs in light...... these for the construction of a final installation that focuses on the construction of a dark room that provides artificial stimuli through a window with only artificial information. The abstract translation of sound to image through artificial light is a common endeavour in the history of arts and its aesthetics, since...

  18. Solar sail time-optimal interplanetary transfer trajectory design

    Institute of Scientific and Technical Information of China (English)

    Sheng-Ping Gong; Yun-Feng Gao; Jun-Feng Li

    2011-01-01

    The fuel consumption associated with some interplanetary transfer trajectories using chemical propulsion is not affordable.A solar sail is a method of propulsion that does not consume fuel.Transfer time is one of the most pressing problems of solar sail transfer trajectory design.This paper investigates the time-optimal interplanetary transfer trajectories to a circular orbit of given inclination and radius.The optimal control law is derived from the principle of maximization.An indirect method is used to solve the optimal control problem by selecting values for the initial adjoint variables,which are normalized within a unit sphere.The conditions for the existence of the time-optimal transfer are dependent on the lightness number of the sail and the inclination and radius of the target orbit.A numerical method is used to obtain the boundary values for the time-optimal transfer trajectories.For the cases where no time-optimal transfer trajectories exist,first-order necessary conditions of the optimal control are proposed to obtain feasible solutions.The results show that the transfer time decreases as the minimum distance from the Sun decreases during the transfer duration.For a solar sail with a small lightness number,the transfer time may be evaluated analytically for a three-phase transfer trajectory.The analytical results are compared with previous results and the associated numerical results.The transfer time of the numerical result here is smaller than the transfer time from previous results and is larger than the analytical result.

  19. Time-optimal control of the magnetically levitated photolithography platen

    Energy Technology Data Exchange (ETDEWEB)

    Redmond, J.; Tucker, S.

    1995-01-01

    This report summarizes two approaches to time-optimal control of a nonlinear magnetically levitated platen. The system of interest is a candidate technology for next-generation photolithography machines used in the manufacture of integrated circuits. The dynamics and the variable peak control force of the electro-magnetic actuators preclude the direct application of classical time-optimal control methodologies for determining optimal rest-to-rest maneuver strategies. Therefore, this study explores alternate approaches using a previously developed computer simulation. In the first approach, conservative estimates of the available control forces are used to generate suboptimal switching curves. In the second approach, exact solutions are determined iteratively and used as a training set for an artificial neural network. The trained network provides optimal actuator switching times that incorporate the full nonlinearities of the magnetic levitation actuators. Sample problems illustrate the effectiveness of these techniques as compared to traditional proportional-derivative control.

  20. Optimal scan time of dual-phase spiral CT in normal rabbit liver : effect of contrast injection rate

    Energy Technology Data Exchange (ETDEWEB)

    Kwak, Byung Kook; Kim, Sang Ho; Liu, Wei Chiang [Sungae General Hospital, Seoul (Korea, Republic of)] (and others)

    1999-06-01

    To determine the effect of contrast injection rate on rabbit liver enhancement and the optimal temporal window for dual-phase spiral CT of rabbit liver at each injection rate Using spiral CT, seven New Zealand White rabbits underwent dynamic scanning at one level of liver. Three protocols of contrast injection rates were employed, namely 0.3ml/sec(group 1), 1 ml/sec(group 2) and 2 ml/sec(group 3). During 120 seconds of total scan time, the scan interval was 3 seconds. Densities of the aorta, liver and portal vein were averaged in equivalent time. The different injection rate protocols were compared for peak enhancement/time on a time density curve. Mean peak enhancement (HU) in equivalent time(secs) was 310/18(group 1), 383/9(group 2) and 357/6(group 3) in the aorta ; 34/36, 40/36 and 41/30 in the liver ; and 135/36, 153/24 and 170/21 in the portal vein. The temporal window during the arterial phase was 12-21 sec(group 1), 6-12 sec(group 2), and 6-12 sec(group 3). The temporal window during the portal phase was from 30 sec(0.3ml/sec), 21 sec(1ml/sec) and 21sec(2ml/sec). During dual-phase spiral CT, the temporal window for liver scanning should be determined according to each contrast injection rate. A slow contrast injection rate prolongs the temporal window during the arterial phase.

  1. Assessment of Mono- and Split-Window Approaches for Time Series Processing of LST from AVHRR—A TIMELINE Round Robin

    Directory of Open Access Journals (Sweden)

    Corinne Myrtha Frey

    2017-01-01

    Full Text Available Processing of land surface temperature from long time series of AVHRR (Advanced Very High Resolution Radiometer requires stable algorithms, which are well characterized in terms of accuracy, precision and sensitivity. This assessment presents a comparison of four mono-window (Price 1983, Qin et al., 2001, Jiménez-Muñoz and Sobrino 2003, linear approach and six split-window algorithms (Price 1984, Becker and Li 1990, Ulivieri et al., 1994, Wan and Dozier 1996, Yu 2008, Jiménez-Muñoz and Sobrino 2008 to estimate LST from top of atmosphere brightness temperatures, emissivity and columnar water vapour. Where possible, new coefficients were estimated matching the spectral response curves of the different AVHRR sensors of the past and present. The consideration of unique spectral response curves is necessary to avoid artificial anomalies and wrong trends when processing time series data. Using simulated data on the base of a large atmospheric profile database covering many different states of the atmosphere, biomes and geographical regions, it was assessed (a to what accuracy and precision LST can be estimated using before mentioned algorithms and (b how sensitive the algorithms are to errors in their input variables. It was found, that the split-window algorithms performed almost equally well, differences were found mainly in their sensitivity to input bands, resulting in the Becker and Li 1990 and Price 1984 split-window algorithm to perform best. Amongst the mono-window algorithms, larger deviations occurred in terms of accuracy, precision and sensitivity. The Qin et al., 2001 algorithm was found to be the best performing mono-window algorithm. A short comparison of the application of the Becker and Li 1990 coefficients to AVHRR with the MODIS LST product confirmed the approach to be physically sound.

  2. Optimal periodic orbits of continuous time chaotic systems

    Science.gov (United States)

    Yang; Hunt; Ott

    2000-08-01

    In previous work [B. R. Hunt and E. Ott, Phys. Rev. Lett. 76, 2254 (1996); Phys. Rev. E 54, 328, (1996)], based on numerical experiments and analysis, it was conjectured that the optimal orbit selected from all possible orbits on a chaotic attractor is "typically" a periodic orbit of low period. By an optimal orbit we mean the orbit that yields the largest value of a time average of a given smooth "performance" function of the system state. Thus optimality is defined with respect to the given performance function. (The study of optimal orbits is of interest in at least three contexts: controlling chaos, embedding of low-dimensional attractors of high-dimensional dynamical systems in low-dimensional measurement spaces, and bubbling bifurcations of synchronized chaotic systems.) Here we extend this previous work. In particular, the previous work was for discrete time dynamical systems, and here we shall consider continuous time systems (flows). An essential difference for flows is that chaotic attractors can have embedded within them, not only unstable periodic orbits, but also unstable steady states, and we find that optimality can often occur on steady states. We also shed further light on the sense in which optimality is "typically" achieved at low period. In particular, we find that, as a system parameter is tuned to be closer to a crisis of the chaotic attractor, optimality may occur at higher period.

  3. Windows 7 the definitive guide

    CERN Document Server

    Stanek, William R

    2010-01-01

    This book provides everything you need to manage and maintain Windows 7. You'll learn all of the features and enhancements in complete detail, along with specifics for configuring the operating system to put you in full control. Bestselling author and Windows expert William Stanek doesn't just show you the steps you need to follow, he also tells you how features work, why they work, and how you can customize them to meet your needs. Learn how to squeeze every bit of power out of Windows 7 to take full advantage of its features and programs. Set up, customize, and tune Windows 7-Optimize its

  4. The time window for therapy with peptide nanofibers combined with autologous bone marrow cells in pigs after acute myocardial infarction.

    Directory of Open Access Journals (Sweden)

    Ming-Yao Chang

    Full Text Available We previously showed that injection of peptide nanofibers (NF combined with autologous bone marrow mononuclear cells (MNC immediately after coronary artery ligation improves cardiac performance in pigs. To evaluate the clinical feasibility, this study was performed to determine the therapeutic time window for NF/MNC therapy in acute myocardial infarction (MI.A total of 45 adult minipigs were randomly grouped into 7 groups: sham or MI plus treatment with NS (normal saline, or NF or MNC alone at 1 day (1D post-MI, or NF/MNC at 1, 4, or 7 days post-MI (N≥6. Cardiac function was assessed by echocardiography and ventricular catheterization. Compared with the NS control, pigs treated with NF/MNC at 1 day post-MI (NF/MC-1D had the greatest improvement in left ventricle ejection fraction (LVEF; 55.1±1.6%; P<0.01 vs. NS 2 months after MI. In contrast, pigs treated with either NF/MNC-4D or NF/MNC-7D showed 48.9±0.8% (P<0.05 vs. NS and 43.5±2.3% (n.s. vs. NS improvements, respectively. The +dP/dt and -dP/dt, infarct size and interstitial collagen content were also improved in the NF/MNC-1D and -4D groups but not in the -7D group. Mechanistically, MNC quality and the states of systemic inflammation and damaged heart tissue influence the therapeutic efficiency of NF/MNC therapy, as revealed by another independent study using 16 pigs.Injection of NF/MNC at 1 or 4 days, but not at 7 days post-MI, improves cardiac performance and prevents ventricular remodeling, confirming the importance of early intervention when using this therapy for acute MI.

  5. Large-scale analysis of acute ethanol exposure in zebrafish development: a critical time window and resilience.

    Directory of Open Access Journals (Sweden)

    Shaukat Ali

    Full Text Available BACKGROUND: In humans, ethanol exposure during pregnancy causes a spectrum of developmental defects (fetal alcohol syndrome or FAS. Individuals vary in phenotypic expression. Zebrafish embryos develop FAS-like features after ethanol exposure. In this study, we ask whether stage-specific effects of ethanol can be identified in the zebrafish, and if so, whether they allow the pinpointing of sensitive developmental mechanisms. We have therefore conducted the first large-scale (>1500 embryos analysis of acute, stage-specific drug effects on zebrafish development, with a large panel of readouts. METHODOLOGY/PRINCIPAL FINDINGS: Zebrafish embryos were raised in 96-well plates. Range-finding indicated that 10% ethanol for 1 h was suitable for an acute exposure regime. High-resolution magic-angle spinning proton magnetic resonance spectroscopy showed that this produced a transient pulse of 0.86% concentration of ethanol in the embryo within the chorion. Survivors at 5 days postfertilisation were analysed. Phenotypes ranged from normal (resilient to severely malformed. Ethanol exposure at early stages caused high mortality (≥88%. At later stages of exposure, mortality declined and malformations developed. Pharyngeal arch hypoplasia and behavioral impairment were most common after prim-6 and prim-16 exposure. By contrast, microphthalmia and growth retardation were stage-independent. CONCLUSIONS: Our findings show that some ethanol effects are strongly stage-dependent. The phenotypes mimic key aspects of FAS including craniofacial abnormality, microphthalmia, growth retardation and behavioral impairment. We also identify a critical time window (prim-6 and prim-16 for ethanol sensitivity. Finally, our identification of a wide phenotypic spectrum is reminiscent of human FAS, and may provide a useful model for studying disease resilience.

  6. Time-limited optimal dynamics beyond the Quantum Speed Limit

    DEFF Research Database (Denmark)

    Gajdacz, Miroslav; Das, Kunal K.; Arlt, Jan

    2015-01-01

    The quantum speed limit sets the minimum time required to transfer a quantum system completely into a given target state. At shorter times the higher operation speed has to be paid with a loss of fidelity. Here we quantify the trade-off between the fidelity and the duration in a system driven...... by a time-varying control. The problem is addressed in the framework of Hilbert space geometry offering an intuitive interpretation of optimal control algorithms. This approach leads to a necessary criterion for control optimality applicable as a measure of algorithm convergence. The time fidelity trade......-off expressed in terms of the direct Hilbert velocity provides a robust prediction of the quantum speed limit and allows to adapt the control optimization such that it yields a predefined fidelity. The results are verified numerically in a multilevel system with a constrained Hamiltonian, and a classification...

  7. Discrete-time inverse optimal control for nonlinear systems

    CERN Document Server

    Sanchez, Edgar N

    2013-01-01

    Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

  8. Kinematically optimal robot placement for minimum time coordinated motion

    Energy Technology Data Exchange (ETDEWEB)

    Feddema, J.T.

    1995-10-01

    This paper describes an algorithm for determining the optimal placement of a robotic manipulator within a workcell for minimum time coordinated motion. The algorithm uses a simple principle of coordinated motion to estimate the time of a joint interpolated motion. Specifically, the coordinated motion profile is limited by the slowest axis. Two and six degree of freedom (DOF) examples are presented. In experimental tests on a FANUC S-800 arm, the optimal placement of the robot can improve cycle time of a robotic operation by as much as 25%. In high volume processes where the robot motion is currently the limiting factor, this increased throughput can result in substantial cost savings.

  9. Time dependent optimal switching controls in online selling models

    Energy Technology Data Exchange (ETDEWEB)

    Bradonjic, Milan [Los Alamos National Laboratory; Cohen, Albert [MICHIGAN STATE UNIV

    2010-01-01

    We present a method to incorporate dishonesty in online selling via a stochastic optimal control problem. In our framework, the seller wishes to maximize her average wealth level W at a fixed time T of her choosing. The corresponding Hamilton-Jacobi-Bellmann (HJB) equation is analyzed for a basic case. For more general models, the admissible control set is restricted to a jump process that switches between extreme values. We propose a new approach, where the optimal control problem is reduced to a multivariable optimization problem.

  10. Intra-Arterial Transplantation of Allogeneic Mesenchymal Stem Cells Mounts Neuroprotective Effects in a Transient Ischemic Stroke Model in Rats: Analyses of Therapeutic Time Window and Its Mechanisms.

    Science.gov (United States)

    Toyoshima, Atsuhiko; Yasuhara, Takao; Kameda, Masahiro; Morimoto, Jun; Takeuchi, Hayato; Wang, Feifei; Sasaki, Tatsuya; Sasada, Susumu; Shinko, Aiko; Wakamori, Takaaki; Okazaki, Mihoko; Kondo, Akihiko; Agari, Takashi; Borlongan, Cesario V; Date, Isao

    2015-01-01

    Intra-arterial stem cell transplantation exerts neuroprotective effects for ischemic stroke. However, the optimal therapeutic time window and mechanisms have not been completely understood. In this study, we investigated the relationship between the timing of intra-arterial transplantation of allogeneic mesenchymal stem cells (MSCs) in ischemic stroke model in rats and its efficacy in acute phase. Adult male Wistar rats weighing 200 to 250 g received right middle cerebral artery occlusion (MCAO) for 90 minutes. MSCs (1 × 10(6) cells/ 1 ml PBS) were intra-arterially injected at either 1, 6, 24, or 48 hours (1, 6, 24, 48 h group) after MCAO. PBS (1 ml) was intra-arterially injected to control rats at 1 hour after MCAO. Behavioral test was performed immediately after reperfusion, and at 3, 7 days after MCAO using the Modified Neurological Severity Score (mNSS). Rats were euthanized at 7 days after MCAO for evaluation of infarct volumes and the migration of MSCs. In order to explore potential mechanisms of action, the upregulation of neurotrophic factor and chemotactic cytokine (bFGF, SDF-1α) induced by cell transplantation was examined in another cohort of rats that received intra-arterial transplantation at 24 hours after recanalization then euthanized at 7 days after MCAO for protein assays. Behavioral test at 3 and 7 days after transplantation revealed that stroke rats in 24h group displayed the most robust significant improvements in mNSS compared to stroke rats in all other groups (p'sstroke rats in 24h group were much significantly decreased compared to those in all other groups (p'sstroke functional recovery and reduction of infarct volumes in ischemic stroke model of rats. The upregulation of bFGF and SDF-1α likely played a key mechanistic role in enabling MSC to afford functional effects in stroke. MSC transplantation at 24 hours after recanalization appears to be the optimal timing for ischemic stroke model, which should guide the design of clinical

  11. Robust time-optimal control of uncertain structural dynamic systems

    Science.gov (United States)

    Wie, Bong; Sinha, Ravi; Liu, Qiang

    1993-01-01

    A time-optimal open-loop control problem of flexible spacecraft in the presence of modeling uncertainty has been investigated. The results indicate that the proposed approach significantly reduces the residual structural vibrations caused by modeling uncertainty. The results also indicate the importance of proper jet placement for practical tradeoffs among the maneuvering time, fuel consumption, and performance robustness.

  12. Optimal Conditional Reachability for Multi-Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal...

  13. Optimization of recurrent neural networks for time series modeling

    DEFF Research Database (Denmark)

    Pedersen, Morten With

    1997-01-01

    The present thesis is about optimization of recurrent neural networks applied to time series modeling. In particular is considered fully recurrent networks working from only a single external input, one layer of nonlinear hidden units and a li near output unit applied to prediction of discrete time...

  14. Time-optimal control of infinite order distributed parabolic systems involving time lags

    Directory of Open Access Journals (Sweden)

    G.M. Bahaa

    2014-06-01

    Full Text Available A time-optimal control problem for linear infinite order distributed parabolic systems involving constant time lags appear both in the state equation and in the boundary condition is presented. Some particular properties of the optimal control are discussed.

  15. Space, time, error, and power optimization of image compression transforms

    Science.gov (United States)

    Schmalz, Mark S.; Ritter, Gerhard X.; Caimi, Frank M.

    2000-11-01

    The implementation of an image compression transform on one or more small, embedded processors typically involves stringent constraints on power consumption and form factor. Traditional methods of optimizing compression algorithm performance typically emphasize joint minimization of space and time complexity, often without significant consideration of arithmetic accuracy or power consumption. However, small autonomous imaging platforms typically require joint optimization of space, time, error (or accuracy), and power (STEP) parameters, which the authors call STEP optimization. In response to implementational constraints on space and power consumption, the authors have developed systems and techniques for STEP optimization that are based on recent research in VLSI circuit design, as well as extensive previous work in system optimization. Building on the authors' previous research in embedded processors as well as adaptive or reconfigurable computing, it is possible to produce system-independent STEP optimization that can be customized for a given set of system-specific constraints. This approach is particularly useful when algorithms for image and signal processing (ISP) computer vision (CV), or automated target recognition (ATR), expressed in a machine- independent notation, are mapped to one or more heterogeneous processors (e.g., digital signal processors or DSPs, SIMD mesh processors, or reconfigurable logic). Following a theoretical summary, this paper illustrates various STEP optimization techniques via case studies, for example, real-time compression of underwater imagery on board an autonomous vehicle. Optimization algorithms are taken from the literature, and error profiling/analysis methodologies developed in the authors' previous research are employed. This yields a more rigorous basis for the simulation and evaluation of compression algorithms on a wide variety of hardware models. In this study, image algebra is employed as the notation of choice

  16. Optimal Time-Trial Bicycle Racing with Headwinds and Tailwinds

    CERN Document Server

    Anton, A Brad

    2013-01-01

    Many time-trial and triathlon bicycle races take place on relatively flat, closed-circuit courses. In the absence of hills, riding-speed is limited almost solely by aerodynamic drag; consequently, winds can have a big effect on elapsed times. I analyze the special case of a straight out-and-back race in a steady wind, assuming the rider has a given total amount of energy to expend and can choose only two speeds - the aided speed with tailwind and the hindered speed into headwind. In this ideal circumstance the problem of choosing optimal riding speeds reduces to a constrained nonlinear optimization that can be solved with elementary calculus. My analysis reveals a practical rule of thumb that can be used more generally to choose optimal riding speeds for time-trial racing on closed-circuit courses in the presence of headwinds and tailwinds.

  17. Window for Optimal Frequency Operation and Reliability of 3DEG and 2DEG Channels for Oxide Microwave MESFETs and HFETs

    Science.gov (United States)

    2016-04-01

    time.The longest energy relaxation time (1.8 ps) was in a reasonably good agreement with the published values obtained through optical time-resolved...phonon accumulation was taken into account. The assumption of electron density-independent hot- phonon lifetime led to a monotonous increase in the hot...preferable for several reasons : (i) a high-density electron gas is present at equilibrium, (ii) doped channels are of direct interest for FETs

  18. Single pairing spike-timing dependent plasticity in BiFeO3 memristors with a time window of 25ms to 125µs

    Directory of Open Access Journals (Sweden)

    Nan eDu

    2015-06-01

    Full Text Available Memristive devices are popular among neuromorphic engineers for their ability to emulate forms of spike-driven synaptic plasticity by applying specific voltage and current waveforms at their two terminals. In this paper, we investigate spike-timing dependent plasticity (STDP with a single pairing of one presynaptic voltage spike and one postsynaptic voltage spike in a BiFeO3 memristive device. In most memristive materials the learning window is primarily a function of the material characteristics and not of the applied waveform. In contrast, we show that the analog resistive switching of the developed artificial synapses allows to adjust the learning time constant of the STDP function from 25ms to 125μs via the duration of applied voltage spikes. Also, as the induced weight change may degrade, we investigate the remanence of the resistance change for several hours after analog resistive switching, thus emulating the processes expected in biological synapses. As the power consumption is a major constraint in neuromorphic circuits, we show methods to reduce the consumed energy per setting pulse to only 4.5 pJ in the developed artificial synapses.

  19. Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

    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.

  20. Particle swarm optimization for discrete-time inverse optimal control of a doubly fed induction generator.

    Science.gov (United States)

    Ruiz-Cruz, Riemann; Sanchez, Edgar N; Ornelas-Tellez, Fernando; Loukianov, Alexander G; Harley, Ronald G

    2013-12-01

    In this paper, the authors propose a particle swarm optimization (PSO) for a discrete-time inverse optimal control scheme of a doubly fed induction generator (DFIG). For the inverse optimal scheme, a control Lyapunov function (CLF) is proposed to obtain an inverse optimal control law in order to achieve trajectory tracking. A posteriori, it is established that this control law minimizes a meaningful cost function. The CLFs depend on matrix selection in order to achieve the control objectives; this matrix is determined by two mechanisms: initially, fixed parameters are proposed for this matrix by a trial-and-error method and then by using the PSO algorithm. The inverse optimal control scheme is illustrated via simulations for the DFIG, including the comparison between both mechanisms.

  1. Hard and Soft Sub-Time-Optimal Robust Controllers

    DEFF Research Database (Denmark)

    Kulczycki, Piotr; Wisniewski, Rafal; Kowalski, Piotr

    2010-01-01

    has been treated as a stochastic process, is presented in this paper. As a result, through a generalization of the classic switching curve occurring in the time-optimal approach, two control structures have been investigated: the hard, defined on the basis of the rules of the statistical decision...... theory, and also the soft, which additionally allows the elimination of rapid changes in control values. The methodology proposed here may be easily adopted for other elements commonly found in mechanical systems, e.g. parameters of drive or motion resistance, giving the sub-time-optimal controlling...

  2. Optimal Conditional Reachability for Multi-Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal...... cost of reaching a given target state, with respect to some primary cost variable, while respecting upper bound constraints on the remaining (secondary) cost variables. Decidability is proven by constructing a zone-based algorithm that always terminates while synthesizing the optimal cost with a single...... secondary cost variable. The approach is then lifted to any number of secondary cost variables....

  3. Atomic Stretch: Optimally bounded real-time stretching and beyond

    DEFF Research Database (Denmark)

    Jensen, Rasmus Ramsbøl; Nielsen, Jannik Boll

    2016-01-01

    Atomic Stretch is a plugin for your preferred Adobe video editing tool, allowing real-time smooth and optimally bounded retarget-ting from and to any aspect ratio. The plugin allows preserving of high interest pixels through a protected region, attention redirection through color-modification, co......Atomic Stretch is a plugin for your preferred Adobe video editing tool, allowing real-time smooth and optimally bounded retarget-ting from and to any aspect ratio. The plugin allows preserving of high interest pixels through a protected region, attention redirection through color...

  4. Optimal estimation of recurrence structures from time series

    Science.gov (United States)

    beim Graben, Peter; Sellers, Kristin K.; Fröhlich, Flavio; Hutt, Axel

    2016-05-01

    Recurrent temporal dynamics is a phenomenon observed frequently in high-dimensional complex systems and its detection is a challenging task. Recurrence quantification analysis utilizing recurrence plots may extract such dynamics, however it still encounters an unsolved pertinent problem: the optimal selection of distance thresholds for estimating the recurrence structure of dynamical systems. The present work proposes a stochastic Markov model for the recurrent dynamics that allows for the analytical derivation of a criterion for the optimal distance threshold. The goodness of fit is assessed by a utility function which assumes a local maximum for that threshold reflecting the optimal estimate of the system's recurrence structure. We validate our approach by means of the nonlinear Lorenz system and its linearized stochastic surrogates. The final application to neurophysiological time series obtained from anesthetized animals illustrates the method and reveals novel dynamic features of the underlying system. We propose the number of optimal recurrence domains as a statistic for classifying an animals' state of consciousness.

  5. Predicting Electrochromic Smart Window Performance

    Energy Technology Data Exchange (ETDEWEB)

    Degerman Engfeldt, Johnny

    2012-07-01

    The building sector is one of the largest consumers of energy, where the cooling of buildings accounts for a large portion of the total energy consumption. Electrochromic (EC) smart windows have a great potential for increasing indoor comfort and saving large amounts of energy for buildings. An EC device can be viewed as a thin-film electrical battery whose charging state is manifested in optical absorption, i.e. the optical absorption increases with increased state-of-charge (SOC) and decreases with decreased state-of-charge. It is the EC technology's unique ability to control the absorption (transmittance) of solar energy and visible light in windows with small energy effort that can reduce buildings' cooling needs. Today, the EC technology is used to produce small windows and car rearview mirrors, and to reach the construction market it is crucial to be able to produce large area EC devices with satisfactory performance. A challenge with up-scaling is to design the EC device system with a rapid and uniform coloration (charging) and bleaching (discharging). In addition, up-scaling the EC technology is a large economic risk due to its expensive production equipment, thus making the choice of EC material and system extremely critical. Although this is a well-known issue, little work has been done to address and solve these problems. This thesis introduces a cost-efficient methodology, validated with experimental data, capable of predicting and optimizing EC device systems' performance in large area applications, such as EC smart windows. This methodology consists of an experimental set-up, experimental procedures and a two dimensional current distribution model. The experimental set-up, based on camera vision, is used in performing experimental procedures to develop and validate the model and methodology. The two-dimensional current distribution model takes secondary current distribution with charge transfer resistance, ohmic and time

  6. Sunlight Responsive Thermochromic Window System

    Energy Technology Data Exchange (ETDEWEB)

    Millett, F,A; Byker,H, J

    2006-10-27

    Pleotint has embarked on a novel approach with our Sunlight Responsive Thermochromic, SRT™, windows. We are integrating dynamic sunlight control, high insulation values and low solar heat gain together in a high performance window. The Pleotint SRT window is dynamic because it reversibly changes light transmission based on thermochromics activated directly by the heating effect of sunlight. We can achieve a window package with low solar heat gain coefficient (SHGC), a low U value and high insulation. At the same time our windows provide good daylighting. Our innovative window design offers architects and building designers the opportunity to choose their desired energy performance, excellent sound reduction, external pane can be self-cleaning, or a resistance to wind load, blasts, bullets or hurricanes. SRT windows would provide energy savings that are estimated at up to 30% over traditional window systems. Glass fabricators will be able to use existing equipment to make the SRT window while adding value and flexibility to the basic design. Glazing installers will have the ability to fit the windows with traditional methods without wires, power supplies and controllers. SRT windows can be retrofit into existing buildings,

  7. Quickest Time Herding and Detection for Optimal Social Learning

    CERN Document Server

    Krishnamurthy, Vikram

    2010-01-01

    This paper considers social learning amongst rational agents (for example, sensors in a network). We consider three models of social learning in increasing order of sophistication. In the first model, based on its private observation of a noisy underlying state process, each agent selfishly optimizes its local utility and broadcasts its action. This protocol leads to a herding behavior where the agents eventually choose the same action irrespective of their observations. We then formulate a second more general model where each agent is benevolent and chooses its sensor-mode to optimize a social welfare function to facilitate social learning. Using lattice programming and stochastic orders, it is shown that the optimal decision each agent makes is characterized by a switching curve on the space of Bayesian distributions. We then present a third more general model where social learning takes place to achieve quickest time change detection. Both geometric and phase-type change time distributions are considered. ...

  8. Analysis and Optimization of Heterogeneous Real-Time Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    2005-01-01

    . The success of such new design methods depends on the availability of analysis and optimization techniques. In this paper, we present analysis and optimization techniques for heterogeneous real-time embedded systems. We address in more detail a particular class of such systems called multi-clusters, composed......An increasing number of real-time applications are today implemented using distributed heterogeneous architectures composed of interconnected networks of processors. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling...... of several networks interconnected via gateways. We present a schedulability analysis for safety-critical applications distributed on multi-cluster systems and briefly highlight characteristic design optimization problems: the partitioning and mapping of functionality, and the packing of application messages...

  9. Simple cryogenic infrared window

    NARCIS (Netherlands)

    Hartemink, M.; Hartemink, M.; Godfried, H.P; Godfried, Herman

    1991-01-01

    A simple, cheap technique is reported that allows materials with both large and small thermal expansion coefficients to be mounted as windows in low temperature cryostats while at the same time avoiding thermal stresses. The construction may be thermally cycled many times with no change in its

  10. A general method to determine sampling windows for nonlinear mixed effects models with an application to population pharmacokinetic studies.

    Science.gov (United States)

    Foo, Lee Kien; McGree, James; Duffull, Stephen

    2012-01-01

    Optimal design methods have been proposed to determine the best sampling times when sparse blood sampling is required in clinical pharmacokinetic studies. However, the optimal blood sampling time points may not be feasible in clinical practice. Sampling windows, a time interval for blood sample collection, have been proposed to provide flexibility in blood sampling times while preserving efficient parameter estimation. Because of the complexity of the population pharmacokinetic models, which are generally nonlinear mixed effects models, there is no analytical solution available to determine sampling windows. We propose a method for determination of sampling windows based on MCMC sampling techniques. The proposed method attains a stationary distribution rapidly and provides time-sensitive windows around the optimal design points. The proposed method is applicable to determine sampling windows for any nonlinear mixed effects model although our work focuses on an application to population pharmacokinetic models. Copyright © 2012 John Wiley & Sons, Ltd.

  11. Investigation of the trade-off between time window length, classifier update rate and classification accuracy for restorative brain-computer interfaces.

    Science.gov (United States)

    Darvishi, Sam; Ridding, Michael C; Abbott, Derek; Baumert, Mathias

    2013-01-01

    Recently, the application of restorative brain-computer interfaces (BCIs) has received significant interest in many BCI labs. However, there are a number of challenges, that need to be tackled to achieve efficient performance of such systems. For instance, any restorative BCI needs an optimum trade-off between time window length, classification accuracy and classifier update rate. In this study, we have investigated possible solutions to these problems by using a dataset provided by the University of Graz, Austria. We have used a continuous wavelet transform and the Student t-test for feature extraction and a support vector machine (SVM) for classification. We find that improved results, for restorative BCIs for rehabilitation, may be achieved by using a 750 milliseconds time window with an average classification accuracy of 67% that updates every 32 milliseconds.

  12. Optimisation of sampling windows design for population pharmacokinetic experiments.

    Science.gov (United States)

    Ogungbenro, Kayode; Aarons, Leon

    2008-08-01

    This paper describes an approach for optimising sampling windows for population pharmacokinetic experiments. Sampling windows designs are more practical in late phase drug development where patients are enrolled in many centres and in out-patient clinic settings. Collection of samples under the uncontrolled environment at these centres at fixed times may be problematic and can result in uninformative data. Population pharmacokinetic sampling windows design provides an opportunity to control when samples are collected by allowing some flexibility and yet provide satisfactory parameter estimation. This approach uses information obtained from previous experiments about the model and parameter estimates to optimise sampling windows for population pharmacokinetic experiments within a space of admissible sampling windows sequences. The optimisation is based on a continuous design and in addition to sampling windows the structure of the population design in terms of the proportion of subjects in elementary designs, number of elementary designs in the population design and number of sampling windows per elementary design is also optimised. The results obtained showed that optimal sampling windows designs obtained using this approach are very efficient for estimating population PK parameters and provide greater flexibility in terms of when samples are collected. The results obtained also showed that the generalized equivalence theorem holds for this approach.

  13. Expected optimal feedback with Time-Varying Parameters

    NARCIS (Netherlands)

    Tucci, M.P.; Kendrick, D.A.; Amman, H.M.

    2011-01-01

    In this paper we derive the closed loop form of the Expected Optimal Feedback rule, sometimes called passive learning stochastic control, with time varying parameters. As such this paper extends the work of Kendrick (1981,2002, Chapter 6) where parameters are assumed to vary randomly around a known

  14. On using priced timed automata to achieve optimal scheduling

    DEFF Research Database (Denmark)

    Rasmussen, Jacob Illum; Larsen, Kim Guldstrand; Subramani, K.

    2006-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...

  15. Optimization of liquid crystal structures for real time holography applications.

    Science.gov (United States)

    Sahraoui, B; Anczykowska, A; Bartkiewicz, S; Mysliwiec, J

    2011-11-21

    In this paper we present results of experiments designed to increase our understanding of the photorefractive effect occurring during processes of dynamic hologram generation in Hybrid Photorefractive Liquid Crystal Structures (HPLCS). We also propose equivalent mathematical model which can be used to optimize those structures in order to obtain the highest diffraction efficiency in possibly shortest time.

  16. ANOTHER LOOK AT LINEAR-QUADRATIC OPTIMIZATION PROBLEMS OVER TIME

    NARCIS (Netherlands)

    NIEUWENHUIS, JW

    1995-01-01

    We will study deterministic quadratic optimization problems over time with linear constraints by means of the behavioral approach of linear systems as developed by Willems (1986, 1989). We will start with a simple example from economics and embed this in a general framework. Then we will develop the

  17. On using priced timed automata to achieve optimal scheduling

    DEFF Research Database (Denmark)

    Rasmussen, Jacob Illum; Larsen, Kim Guldstrand; Subramani, K.

    2006-01-01

    projects VHS (VHS 2005) and AMETIST (AMETIST 2005) and are available in the recently released UPPAAL CORA (UPPAAL CORA 2005), a variant of the real-time verification tool UPPAAL (Larsen, Pettersson, & Yi 1997; Behrmann, David, & Larsen 2004) specialized for cost-optimal reachability for the extended model...

  18. An optimal real-time controller for vertical plasma stabilization

    CERN Document Server

    Cruz, N; Coda, S; Duval, B P; Le, H B; Rodrigues, A P; Varandas, C A F; Correia, C M B A; Goncalves, B S

    2014-01-01

    Modern Tokamaks have evolved from the initial axisymmetric circular plasma shape to an elongated axisymmetric plasma shape that improves the energy confinement time and the triple product, which is a generally used figure of merit for the conditions needed for fusion reactor performance. However, the elongated plasma cross section introduces a vertical instability that demands a real-time feedback control loop to stabilize the plasma vertical position and velocity. At the Tokamak \\`a Configuration Variable (TCV) in-vessel poloidal field coils driven by fast switching power supplies are used to stabilize highly elongated plasmas. TCV plasma experiments have used a PID algorithm based controller to correct the plasma vertical position. In late 2013 experiments a new optimal real-time controller was tested improving the stability of the plasma. This contribution describes the new optimal real-time controller developed. The choice of the model that describes the plasma response to the actuators is discussed. The ...

  19. Optimizing the search for transiting planets in long time series

    Science.gov (United States)

    Ofir, Aviv

    2014-01-01

    Context. Transit surveys, both ground- and space-based, have already accumulated a large number of light curves that span several years. Aims: The search for transiting planets in these long time series is computationally intensive. We wish to optimize the search for both detection and computational efficiencies. Methods: We assume that the searched systems can be described well by Keplerian orbits. We then propagate the effects of different system parameters to the detection parameters. Results: We show that the frequency information content of the light curve is primarily determined by the duty cycle of the transit signal, and thus the optimal frequency sampling is found to be cubic and not linear. Further optimization is achieved by considering duty-cycle dependent binning of the phased light curve. By using the (standard) BLS, one is either fairly insensitive to long-period planets or less sensitive to short-period planets and computationally slower by a significant factor of ~330 (for a 3 yr long dataset). We also show how the physical system parameters, such as the host star's size and mass, directly affect transit detection. This understanding can then be used to optimize the search for every star individually. Conclusions: By considering Keplerian dynamics explicitly rather than implicitly one can optimally search the BLS parameter space. The presented Optimal BLS enhances the detectability of both very short and very long period planets, while allowing such searches to be done with much reduced resources and time. The Matlab/Octave source code for Optimal BLS is made available. The MATLAB code is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/561/A138

  20. Finite time exergoeconomic performance optimization of a thermoacoustic heat engine

    Directory of Open Access Journals (Sweden)

    Xuxian Kan, Lingen Chen, Fengrui Sun, Feng Wu

    2011-01-01

    Full Text Available Finite time exergoeconomic performance optimization of a generalized irreversible thermoacoustic heat engine with heat resistance, heat leakage, thermal relaxation, and internal dissipation is investigated in this paper. Both the real part and the imaginary part of the complex heat transfer exponent change the optimal profit rate versus efficiency relationship quantitatively. The operation of the generalized irreversible thermoacoustic engine is viewed as a production process with exergy as its output. The finite time exergoeconomic performance optimization of the generalized irreversible thermoacoustic engine is performed by taking profit rate as the objective. The analytical formulas about the profit rate and thermal efficiency of the thermoacoustic engine are derived. Furthermore, the comparative analysis of the influences of various factors on the relationship between optimal profit rate and the thermal efficiency of the generalized irreversible thermoacoustic engine is carried out by detailed numerical examples. The optimal zone on the performance of the thermoacoustic heat engine is obtained by numerical analysis. The results obtained herein may be useful for the selection of the operation parameters for real thermoacoustic heat engines.

  1. Resource-Optimal Scheduling Using Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum; Subramani, K.

    2004-01-01

    In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear progr......-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata....

  2. Window Stories

    DEFF Research Database (Denmark)

    Hauge, Bettina

    strategies for overheating or to communicate with people in a more user informed way. The people participating in the study lived in different houses and had different backgrounds. They were involved in the project over a period of 3-4 months. The prolonged participation was facilitated through a variety......, as well as the opposite. The report also includes a special focus on overheating and people’s strategies against this. Knowing about what people appreciate in a window and their actual practices and the reasons for their behaviour may be useful in many different ways, for instance to inform public...

  3. Window shopping

    OpenAIRE

    Shy, Oz

    2013-01-01

    The terms "window shopping" and "showrooming" refer to the activity in which potential buyers visit a brick-and-mortar store to examine a product but end up either not buying it or buying the product from an online retailer. This paper analyzes potential buyers who differ in their preference for after-sale service that is not offered by online retailers. For some buyers, making a trip to the brick-and-mortar store is costly; however, going to the store to examine the product has the advantage...

  4. Window shopping

    OpenAIRE

    SHY, Oz

    2013-01-01

    The terms "window shopping" and "showrooming" refer to the activity in which potential buyers visit a brick-and-mortar store to examine a product but end up either not buying it or buying the product from an online retailer. This paper analyzes potential buyers who differ in their preference for after-sale service that is not offered by online retailers. For some buyers, making a trip to the brick-and-mortar store is costly; however, going to the store to examine the product has the advantage...

  5. Part-Time Unemployment and Optimal Unemployment Insurance

    OpenAIRE

    Ek, Susanne; Holmlund, Bertil

    2011-01-01

    A significant fraction of the labor force consists of employed workers who are part-time unemployed (underemployed) in the sense that they are unable to work as much as they prefer. This paper develops a search and matching model to study the design of optimal unemployment insurance in an economy with unemployment as well as part-time unemployment. Part-time unemployment provides income insurance and serves as a stepping stone to full-time jobs. Unemployment benefits for part-timers increase ...

  6. Comparison of time optimal control for two level quantum systems

    Institute of Scientific and Technical Information of China (English)

    Shuang Cong; Jie Wen; Xubo Zou

    2014-01-01

    The time optimal problem for a two level quantum sys-tem is studied. We compare two different control strategies of bang-bang control and the geometric control, respectively, es-pecial y in the case of minimizing the time of steering the state from North Pole to South Pole on the Bloch sphere with bounded control. The time performances are compared for different param-eters by the individual numerical simulation experiments, and the experimental results are analyzed. The results show that the ge-ometric control spends less time than the bang-bang control does.

  7. Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

    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.

  8. Windows-based Distributed Real-time Simulation System%基于Windows平台的分布式实时仿真系统

    Institute of Scientific and Technical Information of China (English)

    孙亚红

    2012-01-01

    Two solutions for Windows-based distributed simulation are presented after an introduction to RTX-a real-time extension subsystem based on Windows,one being reflective memory network distributed simulation based on RTX,and the other being token ring distributed simulation based on Ethernet.A comparison of the differences in real-time performance between the two architectures and the traditional Windows solutions shows that the two solutions can offer flexible and reliable choice for different simulations while meeting the distributed simulation system's requirement of real-timeness.%通过介绍基于Windows的实时扩展子系统RTX,提出了解决Windows下分布式仿真的两种方案:基于RTX的反射内存网分布式仿真和基于以太网的令牌环分布式仿真架构。并比较了两种架构与传统Windows方案在实时性能上的差别。两种方案在满足分布式仿真系统实时性要求的基础上,能为不同要求的仿真提供灵活可靠的选择。

  9. Window observers for linear systems

    Directory of Open Access Journals (Sweden)

    Utkin Vadim

    2000-01-01

    Full Text Available Given a linear system x ˙ = A x + B u with output y = C x and a window function ω ( t , i.e., ∀ t , ω ( t ∈ {0,1 }, and assuming that the window function is Lebesgue measurable, we refer to the following observer, x ˆ = A x + B u + ω ( t L C ( x − x ˆ as a window observer. The stability issue is treated in this paper. It is proven that for linear time-invariant systems, the window observer can be stabilized by an appropriate design under a very mild condition on the window functions, albeit for linear time-varying system, some regularity of the window functions is required to achieve observer designs with the asymptotic stability. The corresponding design methods are developed. An example is included to illustrate the possible applications

  10. Optimal moving grids for time-dependent partial differential equations

    Science.gov (United States)

    Wathen, A. J.

    1992-01-01

    Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of PDE solutions in the least-squares norm are reported.

  11. Optimal Time to Invest Energy Storage System under Uncertainty Conditions

    Directory of Open Access Journals (Sweden)

    Yongma Moon

    2014-04-01

    Full Text Available This paper proposes a model to determine the optimal investment time for energy storage systems (ESSs in a price arbitrage trade application under conditions of uncertainty over future profits. The adoption of ESSs can generate profits from price arbitrage trade, which are uncertain because the future marginal prices of electricity will change depending on supply and demand. In addition, since the investment is optional, an investor can delay adopting an ESS until it becomes profitable, and can decide the optimal time. Thus, when we evaluate this investment, we need to incorporate the investor’s option which is not captured by traditional evaluation methods. In order to incorporate these aspects, we applied real option theory to our proposed model, which provides an optimal investment threshold. Our results concerning the optimal time to invest show that if future profits that are expected to be obtained from arbitrage trade become more uncertain, an investor needs to wait longer to invest. Also, improvement in efficiency of ESSs can reduce the uncertainty of arbitrage profit and, consequently, the reduced uncertainty enables earlier ESS investment, even for the same power capacity. Besides, when a higher rate of profits is expected and ESS costs are higher, an investor needs to wait longer. Also, by comparing a widely used net present value model to our real option model, we show that the net present value method underestimates the value for ESS investment and misleads the investor to make an investment earlier.

  12. Optimal Radio Window for the Detection of Ultra-High-Energy Cosmic Rays and Neutrinos off the Moon

    CERN Document Server

    Scholten, O; Braun, R; De Bruyn, A G; Falcke, H; Stappers, B; Strom, R G

    2006-01-01

    We show that at wavelengths comparable to the length of the shower produced by an Ultra-High Energy cosmic ray or neutrino, radio signals are an extremely efficient way to detect these particles. Through an example it is shown that this new approach offers, for the first time, the realistic possibility of measuring UHE neutrino fluxes below the Waxman-Bahcall limit. It is shown that in only one month of observing with the upcoming LOFAR radio telescope, cosmic-ray events can be measured beyond the GZK-limit, at a sensitivity level of two orders of magnitude below the extrapolated values.

  13. Thermodynamics constrains allometric scaling of optimal development time in insects.

    Directory of Open Access Journals (Sweden)

    Michael E Dillon

    Full Text Available Development time is a critical life-history trait that has profound effects on organism fitness and on population growth rates. For ectotherms, development time is strongly influenced by temperature and is predicted to scale with body mass to the quarter power based on 1 the ontogenetic growth model of the metabolic theory of ecology which describes a bioenergetic balance between tissue maintenance and growth given the scaling relationship between metabolism and body size, and 2 numerous studies, primarily of vertebrate endotherms, that largely support this prediction. However, few studies have investigated the allometry of development time among invertebrates, including insects. Abundant data on development of diverse insects provides an ideal opportunity to better understand the scaling of development time in this ecologically and economically important group. Insects develop more quickly at warmer temperatures until reaching a minimum development time at some optimal temperature, after which development slows. We evaluated the allometry of insect development time by compiling estimates of minimum development time and optimal developmental temperature for 361 insect species from 16 orders with body mass varying over nearly 6 orders of magnitude. Allometric scaling exponents varied with the statistical approach: standardized major axis regression supported the predicted quarter-power scaling relationship, but ordinary and phylogenetic generalized least squares did not. Regardless of the statistical approach, body size alone explained less than 28% of the variation in development time. Models that also included optimal temperature explained over 50% of the variation in development time. Warm-adapted insects developed more quickly, regardless of body size, supporting the "hotter is better" hypothesis that posits that ectotherms have a limited ability to evolutionarily compensate for the depressing effects of low temperatures on rates of

  14. Existence of the time optimal control for robotic manipulators

    Science.gov (United States)

    Wen, J.; Desrochers, A.

    1986-01-01

    Using Filipov's Theorem, it is shown that the conditions oif nonfinite escape of trajectories, reachability, and convexity of the dynamics over all admissible controls are needed for the existence of a time optimal solution for the robotic equation. With a lower bound for the finite-escape time established using a Liapunov approach, and an upper bound for the time to reach the target established using the exact linearization idea, a single inequality is found which is closely related to the coriolis and the centrifugal terms, the absence of which implies that the domain of existence of the optimal solution can be made arbitrarily large with a large torque constraint. As the work space is finite, this is essentially a global result in practical situations.

  15. Optimal Real-time Dispatch for Integrated Energy Systems

    DEFF Research Database (Denmark)

    Anvari-Moghaddam, Amjad; Guerrero, Josep M.; Rahimi-Kian, Ashkan

    2016-01-01

    With the emerging of small-scale integrated energy systems (IESs), there are significant potentials to increase the functionality of a typical demand-side management (DSM) strategy and typical implementation of building-level distributed energy resources (DERs). By integrating DSM and DERs...... into a cohesive, networked package that fully utilizes smart energy-efficient end-use devices, advanced building control/automation systems, and integrated communications architectures, it is possible to efficiently manage energy and comfort at the end-use location. In this paper, an ontology-driven multi......-agent control system with intelligent optimizers is proposed for optimal real-time dispatch of an integrated building and microgrid system considering coordinated demand response (DR) and DERs management. The optimal dispatch problem is formulated as a mixed integer nonlinear programing problem (MINLP...

  16. Spectroscopic determination of optimal hydration time of zircon surface

    Energy Technology Data Exchange (ETDEWEB)

    Ordonez R, E. [ININ, Departamento de Quimica, Carretera Mexico-Toluca s/n, 52750 Ocoyoacac, Estado de Mexico (Mexico); Garcia R, G. [Instituto Tecnologico de Toluca, Division de Estudios del Posgrado, Av. Tecnologico s/n, Ex-Rancho La Virgen, 52140 Metepec, Estado de Mexico (Mexico); Garcia G, N., E-mail: eduardo.ordonez@inin.gob.m [Universidad Autonoma del Estado de Mexico, Facultad de Quimica, Av. Colon y Av. Tollocan, 50180 Toluca, Estado de Mexico (Mexico)

    2010-07-01

    When a mineral surface is immersed in an aqueous solution, it develops and electric charge produced by the amphoteric dissociation of hydroxyl groups created by the hydration of the solid surface. This is one influential surface property. The complete hydration process takes a time which is specific for each mineral species. The knowledge of the aqueous solution contact time for complete surface hydration is mandatory for further surface phenomena studies. This study deals with the optimal hydration time of the raw zircon (ZrSiO{sub 4}) surface comparing the classical potentiometric titrations with a fluorescence spectroscopy technique. The latter is easy and rea liable as it demands only one sample batch to determine the optimal time to ensure a total hydration of the zircon surface. The analytical results of neutron activation analysis showed the presence of trace quantities of Dy{sup 3+}, Eu{sup 3+} and Er{sup 3} in the bulk of zircon. The Dy{sup 3+} is structured in the zircon crystalline lattice and undergoes the same chemical reactions as zircon. Furthermore, the Dy{sup 3+} has a good fluorescent response whose intensity is enhanced by hydration molecules. The results show that, according to the potentiometric analysis, the hydration process for each batch (at least 8 sample batches) takes around 2 h, while the spectrometric method indicates only 5 minutes from only one batch. Both methods showed that the zircon surface have a 16 h optimal hydration time. (Author)

  17. Identification and optimization of traffic bottleneck with signal timing

    Directory of Open Access Journals (Sweden)

    Shaoxin Yuan

    2014-10-01

    Full Text Available In urban transportation network, traffic congestion is likely to occur at traffic bottlenecks. The signal timing at intersections together with static properties of left-turn and straight-through lanes of roads are two significant factors causing traffic bottlenecks. A discrete-time model of traffic bottleneck is hence developed to analyze these two factors, and a bottleneck indicator is introduced to estimate the comprehensive bottleneck degree of individual road in regional transportation networks universally, the identification approaches are presented to identify traffic bottlenecks, bottleneck-free roads, and bottleneck-prone roads. Based on above work, the optimization method applies ant colony algorithm with effective green time as decision variables to find out an optimal coordinated signal timing plan for a regional network. In addition, a real experimental transportation network is chosen to verify the validation of bottleneck identification. The bottleneck identification approaches can explain the features of occurrence and dissipation of traffic congestion in a certain extent, and the bottleneck optimization method provides a new way to coordinate signal timing at intersections to mitigate traffic congestion.

  18. Optimal rebinning of time-of-flight PET data.

    Science.gov (United States)

    Ahn, Sangtae; Cho, Sanghee; Li, Quanzheng; Lin, Yanguang; Leahy, Richard M

    2011-10-01

    Time-of-flight (TOF) positron emission tomography (PET) scanners offer the potential for significantly improved signal-to-noise ratio (SNR) and lesion detectability in clinical PET. However, fully 3D TOF PET image reconstruction is a challenging task due to the huge data size. One solution to this problem is to rebin TOF data into a lower dimensional format. We have recently developed Fourier rebinning methods for mapping TOF data into non-TOF formats that retain substantial SNR advantages relative to sinograms acquired without TOF information. However, mappings for rebinning into non-TOF formats are not unique and optimization of rebinning methods has not been widely investigated. In this paper we address the question of optimal rebinning in order to make full use of TOF information. We focus on FORET-3D, which approximately rebins 3D TOF data into 3D non-TOF sinogram formats without requiring a Fourier transform in the axial direction. We optimize the weighting for FORET-3D to minimize the variance, resulting in H(2)-weighted FORET-3D, which turns out to be the best linear unbiased estimator (BLUE) under reasonable approximations and furthermore the uniformly minimum variance unbiased (UMVU) estimator under Gaussian noise assumptions. This implies that any information loss due to optimal rebinning is as a result only of the approximations used in deriving the rebinning equation and developing the optimal weighting. We demonstrate using simulated and real phantom TOF data that the optimal rebinning method achieves variance reduction and contrast recovery improvement compared to nonoptimized rebinning weightings. In our preliminary study using a simplified simulation setup, the performance of the optimal rebinning method was comparable to that of fully 3D TOF MAP. © 2011 IEEE

  19. Optimal Real-time Dispatch for Integrated Energy Systems

    Energy Technology Data Exchange (ETDEWEB)

    Firestone, Ryan Michael [Univ. of California, Berkeley, CA (United States)

    2007-05-31

    This report describes the development and application of a dispatch optimization algorithm for integrated energy systems (IES) comprised of on-site cogeneration of heat and electricity, energy storage devices, and demand response opportunities. This work is intended to aid commercial and industrial sites in making use of modern computing power and optimization algorithms to make informed, near-optimal decisions under significant uncertainty and complex objective functions. The optimization algorithm uses a finite set of randomly generated future scenarios to approximate the true, stochastic future; constraints are included that prevent solutions to this approximate problem from deviating from solutions to the actual problem. The algorithm is then expressed as a mixed integer linear program, to which a powerful commercial solver is applied. A case study of United States Postal Service Processing and Distribution Centers (P&DC) in four cities and under three different electricity tariff structures is conducted to (1) determine the added value of optimal control to a cogeneration system over current, heuristic control strategies; (2) determine the value of limited electric load curtailment opportunities, with and without cogeneration; and (3) determine the trade-off between least-cost and least-carbon operations of a cogeneration system. Key results for the P&DC sites studied include (1) in locations where the average electricity and natural gas prices suggest a marginally profitable cogeneration system, optimal control can add up to 67% to the value of the cogeneration system; optimal control adds less value in locations where cogeneration is more clearly profitable; (2) optimal control under real-time pricing is (a) more complicated than under typical time-of-use tariffs and (b) at times necessary to make cogeneration economic at all; (3) limited electric load curtailment opportunities can be more valuable as a compliment to the cogeneration system than alone; and

  20. Adaptive Liquid Crystal Windows

    Energy Technology Data Exchange (ETDEWEB)

    Taheri, Bahman; Bodnar, Volodymyr

    2011-12-31

    Energy consumption by private and commercial sectors in the U.S. has steadily grown over the last decade. The uncertainty in future availability of imported oil, on which the energy consumption relies strongly, resulted in a dramatic increase in the cost of energy. About 20% of this consumption are used to heat and cool houses and commercial buildings. To reduce dependence on the foreign oil and cut down emission of greenhouse gases, it is necessary to eliminate losses and reduce total energy consumption by buildings. To achieve this goal it is necessary to redefine the role of the conventional windows. At a minimum, windows should stop being a source for energy loss. Ideally, windows should become a source of energy, providing net gain to reduce energy used to heat and cool homes. It is possible to have a net energy gain from a window if its light transmission can be dynamically altered, ideally electronically without the need of operator assistance, providing optimal control of the solar gain that varies with season and climate in the U.S. In addition, the window must not require power from the building for operation. Resolution of this problem is a societal challenge and of national interest and will have a broad global impact. For this purpose, the year-round, allclimate window solution to provide an electronically variable solar heat gain coefficient (SHGC) with a wide dynamic range is needed. AlphaMicron, Inc. (AMI) developed and manufactured 1ft × 1ft prototype panels for the world’s first auto-adjusting Adaptive Liquid Crystal Windows (ALCWs) that can operate from sunlight without the need for external power source and demonstrate an electronically adjustable SHGC. This novel windows are based on AlphaMicron’s patented e-Tint® technology, a guesthost liquid crystal system implemented on flexible, optically clear plastic films. This technology is suitable both for OEM and aftermarket (retro-fitting) lamination to new and existing windows. Low level of

  1. Linear optimal control of continuous time chaotic systems.

    Science.gov (United States)

    Merat, Kaveh; Abbaszadeh Chekan, Jafar; Salarieh, Hassan; Alasty, Aria

    2014-07-01

    In this research study, chaos control of continuous time systems has been performed by using dynamic programming technique. In the first step by crossing the response orbits with a selected Poincare section and subsequently applying linear regression method, the continuous time system is converted to a discrete type. Then, by solving the Riccati equation a sub-optimal algorithm has been devised for the obtained discrete chaotic systems. In the next step, by implementing the acquired algorithm on the quantized continuous time system, the chaos has been suppressed in the Rossler and AFM systems as some case studies.

  2. Trajectory optimization for real-time guidance. I - Time-varying LQR on a parallel processor

    Science.gov (United States)

    Psiaki, Mark L.; Park, Kihong

    1990-01-01

    A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.

  3. Free Final-Time Optimal Control for HIV Viral Dynamics

    CERN Document Server

    Pachpute, Gaurav

    2011-01-01

    In this paper, we examine a well-established model for HIV wild-type infection. The algorithm for steepest descent method for fixed final-time is stated and a modified method for free final-time is presented. The first type of cost functional considered, seeks to minimize the total time of therapy. An easy implementation for this problem suggests that it can be effective in the early stages of treatment as well as for individual-based studies, due to the "hit first and hit hard" nature of optimal control. An LQR based cost functional is also presented and the solution is found using steepest descent method. It suggests that the optimal therapy must remain high until the patient shows signs of recovery after which, the therapy gradually decreases. This is in line with the biomedical philosophy. Solution to a modified problem which includes a weight for total time is approximated using the modified algorithm. It shows a considerable drop in the total period. We conclude that, a decreased and optimized therapy p...

  4. ON TIME-OPTIMAL PROCEDURE FOR ANALOG SYSTEM DESIGN

    Directory of Open Access Journals (Sweden)

    A. Zemliak

    2004-04-01

    Full Text Available The process of any analog system design has been formulated on the basis of the control theory application. Thisapproach produces many different design strategies inside the same optimization procedure and allowsdetermining the problem of the optimal design strategy existence from the computer time point of view. Differentkinds of system design strategies have been evaluated from the operations number. The general methodology forthe analog system design was formulated by means of the optimum control theory. The main equations for thisdesign methodology were elaborated. These equations include the special control functions that are introducedartificially. This approach generalizes the design process and generates an infinite number of the different designstrategies. The problem of the optimum design algorithm construction is defined as the minimum-time problem ofthe control theory. Numerical results of some electronic circuit design demonstrate the efficiency and perspectiveof the proposed methodology. These examples show that the computer time gain of the optimal design strategywith respect to the traditional design strategy increases when the size and complexity of the system increase. Anadditional acceleration effect of the design process has been discovered by the analysis of various design strategieswith the different initial points. This effect is displayed for all analyzed circuits and it reduces additionally the totalcomputer time for the system design.

  5. Parareal in time intermediate targets methods for optimal control problem

    CERN Document Server

    Maday, Yvon; Salomon, Julien

    2012-01-01

    In this paper, we present a method that enables solving in parallel the Euler-Lagrange system associated with the optimal control of a parabolic equation. Our approach is based on an iterative update of a sequence of intermediate targets that gives rise to independent sub-problems that can be solved in parallel. This method can be coupled with the parareal in time algorithm. Numerical experiments show the efficiency of our method.

  6. Testing optimality with experimental evolution: lysis time in a bacteriophage.

    Science.gov (United States)

    Heineman, Richard H; Bull, James J

    2007-07-01

    Optimality models collapse the vagaries of genetics into simple trade-offs to calculate phenotypes expected to evolve by natural selection. Optimality approaches are commonly criticized for this neglect of genetic details, but resolution of this disagreement has been difficult. The importance of genetic details may be tested by experimental evolution of a trait for which an optimality model exists and in which genetic details can be studied. Here we evolved lysis time in bacteriophage T7, a virus of Escherichia coli. Lysis time is equivalent to the age of reproduction in an organism that reproduces once and then dies. Delaying lysis increases the number of offspring but slows generation time, and this trade-off renders the optimum sensitive to environmental conditions: earlier lysis is favored when bacterial hosts are dense, later lysis is favored when hosts are sparse. In experimental adaptations, T7 evolved close to the optimum in conditions favoring early lysis but not in conditions favoring late lysis. One of the late lysis adaptations exhibited no detectable phenotypic evolution despite genetic evolution; the other evolved only partly toward the expected optimum. Overall, the lysis time of the adapted phages remained closer to their starting values than predicted by the model. From the perspective of the optimality model, the experimental conditions were expected to select changes only along the postulated trade-off, but a trait outside the trade-off evolved as well. Evidence suggests that the model's failure ultimately stems from a violation of the trade-off, rather than a paucity of mutations.

  7. Identification of nonlinear time-varying systems using an online sliding-window and common model structure selection (CMSS) approach with applications to EEG

    Science.gov (United States)

    Li, Yang; Wei, Hua-Liang; Billings, Stephen. A.; Sarrigiannis, P. G.

    2016-08-01

    The identification of nonlinear time-varying systems using linear-in-the-parameter models is investigated. An efficient common model structure selection (CMSS) algorithm is proposed to select a common model structure, with application to EEG data modelling. The time-varying parameters for the identified common-structured model are then estimated using a sliding-window recursive least squares (SWRLS) approach. The new method can effectively detect and adaptively track and rapidly capture the transient variation of nonstationary signals, and can also produce robust models with better generalisation properties. Two examples are presented to demonstrate the effectiveness and applicability of the new approach including an application to EEG data.

  8. Nearly time-optimal paths for a ground vehicle

    Institute of Scientific and Technical Information of China (English)

    David A. ANISI; Johan HAMBERG; Xiaoming HU

    2003-01-01

    It is well known that the sufficient family of time-optimal paths for both Dubins' as well as Reeds-Shepp' s car models consist of the concatenation of circular arcs with maxmum curvature and straight line segments, all tangentially connected.These time-optimal solutions suffer from some drawbacks. Their discontinuous curvature profde, together with the wear and impairment on the control equipment that the bang-bang solutions induce, calls for "smoother" and more supple reference paths to follow. Avoiding the bang-bang solutions also raises the robustness with respect to any possible uncertainties. In this paper, our main tool for generating these "nearly time-optimal", but nevertheless continuous-curvature paths, is to use the Pontryagin Maximum Principle (PMP) and make an appropriate and cunning choice of the Lagrangian function. Despite some rewarding simuhtion results, this concept tums out to be numerically divergent at some instances. Upon a more careful investigation, it can be concluded that the problem at hand is nearly singular. This is seen by applying the PMP to Dubins' car and studying the corresponding two point boundary value problem, which turn out to be singuhr. Realizing this, one is able to contradict the widespread belief that all the information about the motion of a mobile platform lies in the initial values of the auxiliary variables associated with the PMP.

  9. Chaos Time Series Prediction Based on Membrane Optimization Algorithms

    Directory of Open Access Journals (Sweden)

    Meng Li

    2015-01-01

    Full Text Available This paper puts forward a prediction model based on membrane computing optimization algorithm for chaos time series; the model optimizes simultaneously the parameters of phase space reconstruction (τ,m and least squares support vector machine (LS-SVM (γ,σ by using membrane computing optimization algorithm. It is an important basis for spectrum management to predict accurately the change trend of parameters in the electromagnetic environment, which can help decision makers to adopt an optimal action. Then, the model presented in this paper is used to forecast band occupancy rate of frequency modulation (FM broadcasting band and interphone band. To show the applicability and superiority of the proposed model, this paper will compare the forecast model presented in it with conventional similar models. The experimental results show that whether single-step prediction or multistep prediction, the proposed model performs best based on three error measures, namely, normalized mean square error (NMSE, root mean square error (RMSE, and mean absolute percentage error (MAPE.

  10. Optimal model-free prediction from multivariate time series.

    Science.gov (United States)

    Runge, Jakob; Donner, Reik V; Kurths, Jürgen

    2015-05-01

    Forecasting a time series from multivariate predictors constitutes a challenging problem, especially using model-free approaches. Most techniques, such as nearest-neighbor prediction, quickly suffer from the curse of dimensionality and overfitting for more than a few predictors which has limited their application mostly to the univariate case. Therefore, selection strategies are needed that harness the available information as efficiently as possible. Since often the right combination of predictors matters, ideally all subsets of possible predictors should be tested for their predictive power, but the exponentially growing number of combinations makes such an approach computationally prohibitive. Here a prediction scheme that overcomes this strong limitation is introduced utilizing a causal preselection step which drastically reduces the number of possible predictors to the most predictive set of causal drivers making a globally optimal search scheme tractable. The information-theoretic optimality is derived and practical selection criteria are discussed. As demonstrated for multivariate nonlinear stochastic delay processes, the optimal scheme can even be less computationally expensive than commonly used suboptimal schemes like forward selection. The method suggests a general framework to apply the optimal model-free approach to select variables and subsequently fit a model to further improve a prediction or learn statistical dependencies. The performance of this framework is illustrated on a climatological index of El Niño Southern Oscillation.

  11. Time-limited optimal dynamics beyond the Quantum Speed Limit

    DEFF Research Database (Denmark)

    Gajdacz, Miroslav; Das, Kunal K.; Arlt, Jan

    2015-01-01

    -off expressed in terms of the direct Hilbert velocity provides a robust prediction of the quantum speed limit and allows to adapt the control optimization such that it yields a predefined fidelity. The results are verified numerically in a multilevel system with a constrained Hamiltonian, and a classification......The quantum speed limit sets the minimum time required to transfer a quantum system completely into a given target state. At shorter times the higher operation speed has to be paid with a loss of fidelity. Here we quantify the trade-off between the fidelity and the duration in a system driven...

  12. 带时间窗的粮食物流车辆路径问题的研究%Study on grain logistics Vehicle Routing Problem with Time Windows

    Institute of Scientific and Technical Information of China (English)

    葛宏义; 甄彤; 蒋玉英

    2009-01-01

    带时间窗的粮食物流车辆路径问题是一个典型的NP-难问题.针对粮食物流批量大、多点对多点等特点,建立了带时间窗的粮食物流车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTM)的数学模型,进一步构造粒子群算法(Particle Swarm Optimization,PSO)用于问题求解,并将求解结果与遗传算法进行比较.结果表明,粒子群算法可以快速、有效地求得带时间窗的粮食物流车辆路径问题的优化解,降低配送成本.

  13. Activin/Nodal Signaling Supports Retinal Progenitor Specification in a Narrow Time Window during Pluripotent Stem Cell Neuralization

    Directory of Open Access Journals (Sweden)

    Michele Bertacchi

    2015-10-01

    Full Text Available Retinal progenitors are initially found in the anterior neural plate region known as the eye field, whereas neighboring areas undertake telencephalic or hypothalamic development. Eye field cells become specified by switching on a network of eye field transcription factors, but the extracellular cues activating this network remain unclear. In this study, we used chemically defined media to induce in vitro differentiation of mouse embryonic stem cells (ESCs toward eye field fates. Inhibition of Wnt/β-catenin signaling was sufficient to drive ESCs to telencephalic, but not retinal, fates. Instead, retinal progenitors could be generated from competent differentiating mouse ESCs by activation of Activin/Nodal signaling within a narrow temporal window corresponding to the emergence of primitive anterior neural progenitors. Activin also promoted eye field gene expression in differentiating human ESCs. Our results reveal insights into the mechanisms of eye field specification and open new avenues toward the generation of retinal progenitors for translational medicine.

  14. Activin/Nodal Signaling Supports Retinal Progenitor Specification in a Narrow Time Window during Pluripotent Stem Cell Neuralization

    Science.gov (United States)

    Bertacchi, Michele; Lupo, Giuseppe; Pandolfini, Luca; Casarosa, Simona; D’Onofrio, Mara; Pedersen, Roger A.; Harris, William A.; Cremisi, Federico

    2015-01-01

    Summary Retinal progenitors are initially found in the anterior neural plate region known as the eye field, whereas neighboring areas undertake telencephalic or hypothalamic development. Eye field cells become specified by switching on a network of eye field transcription factors, but the extracellular cues activating this network remain unclear. In this study, we used chemically defined media to induce in vitro differentiation of mouse embryonic stem cells (ESCs) toward eye field fates. Inhibition of Wnt/β-catenin signaling was sufficient to drive ESCs to telencephalic, but not retinal, fates. Instead, retinal progenitors could be generated from competent differentiating mouse ESCs by activation of Activin/Nodal signaling within a narrow temporal window corresponding to the emergence of primitive anterior neural progenitors. Activin also promoted eye field gene expression in differentiating human ESCs. Our results reveal insights into the mechanisms of eye field specification and open new avenues toward the generation of retinal progenitors for translational medicine. PMID:26388287

  15. Optimal Cotton Insecticide Application Termination Timing: A Meta-Analysis.

    Science.gov (United States)

    Griffin, T W; Zapata, S D

    2016-08-01

    The concept of insecticide termination timing is generally accepted among cotton (Gossypium hirsutum) researchers; however, exact timings are often disputed. Specifically, there is uncertainty regarding the last economic insecticide application to control fruit-feeding pests including tarnished plant bug (Lygus lineolaris (Palisot de Beauvois)), boll weevil (Anthonomus grandis), bollworm (Helicoverpa zea), tobacco budworm (Heliothis virescens), and cotton fleahopper (Pseudatomoscelis seriatus). A systematic review of prior studies was conducted within a meta-analytic framework. Nine publicly available articles were amalgamated to develop an optimal timing principle. These prior studies reported 53 independent multiple means comparison field experiments for a total of 247 trial observations. Stochastic plateau theory integrated with econometric meta-analysis methodology was applied to the meta-database to determine the shape of the functional form of both the agronomic optimal insecticide termination timing and corresponding yield potential. Results indicated that current university insecticide termination timing recommendations are later than overall estimated timing suggested. The estimated 159 heat units (HU) after the fifth position above white flower (NAWF5) was found to be statistically different than the 194 HU termination used as the status quo recommended termination timing. Insecticides applied after 159 HU may have been applied in excess, resulting in unnecessary economic and environmental costs. Empirical results also suggested that extending the insecticide termination time by one unit resulted in a cotton lint yield increase of 0.27 kilograms per hectare up to the timing where the plateau began. Based on economic analyses, profit-maximizing producers may cease application as soon as 124 HU after NAWF5. These results provided insights useful to improve production systems by applying inputs only when benefits were expected to be in excess of the

  16. Research on Real-time Memory Management Under Windows Platform%Windows平台下的内存管理实时化研究

    Institute of Scientific and Technical Information of China (English)

    李轩; 江南; 杜承烈

    2013-01-01

    This paper analyzes the factors that affect the real-time property of memory management under Windows platform,and presents a solution to improve the real-time.It works in three aspects:establishing a mapping relationship between virtual address and physical address to avoid the switch between the user mode and kernel mode; locking pages in the physical memory to avoid page missing and page exchanging operation; improving the original algorithm of memory allocation to remove the nondeterministic operations.Experimental results show that this solution is a good way to improve the efficiency of memory management under Windows and maks the use of time in the memory operation steady,improvs the real-time of memory management under Windows platform.%分析Windows平台下内存管理方面的非实时性因素,提出一种提高Windows实时性的方案.建立虚拟地址和物理地址之间的映射来避免用户和内核之间的地址模式切换.将页面锁定在物理内存中,避免内存的缺页换页操作.改进系统原有的内存分配算法,消除系统对内存操作的不确定性.实验结果表明,该方案能较好地提高Windows内存管理操作的效率,内存操作时间稳定,可实现Windows平台下内存管理操作的实时化.

  17. Worst-Case Execution Time Based Optimization of Real-Time Java Programs

    DEFF Research Database (Denmark)

    Hepp, Stefan; Schoeberl, Martin

    2012-01-01

    optimization is method in lining. It is especially important for languages, like Java, where small setter and getter methods are considered good programming style. In this paper we present and explore WCET driven in lining of Java methods. We use the WCET analysis tool for the Java processor JOP to guide...... to optimization along the worst-case path. The tool JCopter is integrated with the WCET analysis tool and is used to explore different in lining strategies. On real-time benchmarks the optimization results in a reduction of the WCET by a few percent up to a factor of about 2....

  18. The Optimal Timing of Adoption of a Green Technology

    Energy Technology Data Exchange (ETDEWEB)

    Cunha-e-Sa, M.A.; Reis, A.B. [Faculdade de Economia, Universidade Nova de Lisboa, Campus de Campolide, P-1099-032 Lisbon (Portugal)

    2007-01-15

    We study the optimal timing of adoption of a cleaner technology and its effects on the rate of growth of an economy in the context of an AK endogenous growth model. We show that the results depend upon the behavior of the marginal utility of environmental quality with respect to consumption. When it is increasing, we derive the capital level at the optimal timing of adoption. We show that this capital threshold is independent of the initial conditions on the stock of capital, implying that capital-poor countries tend to take longer to adopt. Also, country-specific characteristics, as the existence of high barriers to adoption, may lead to different capital thresholds for different countries. If the marginal utility of environmental quality decreases with consumption, a country should never delay adoption; the optimal policy is either to adopt immediately or, if adoption costs are {sup t}oo high{sup ,} to never adopt. The policy implications of these results are discussed in the context of the international debate surrounding the environmental political agenda.

  19. ROAMing terrain (Real-time Optimally Adapting Meshes)

    Energy Technology Data Exchange (ETDEWEB)

    Duchaineau, M.; Wolinsky, M.; Sigeti, D.E.; Miller, M.C.; Aldrich, C.; Mineev, M.

    1997-07-01

    Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly, and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM execution time is proportionate to the number of triangle changes per frame, which is typically a few percent of the output mesh size, hence ROAM performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.

  20. Timing optimization utilizing order statistics and multichannel digital silicon photomultipliers.

    Science.gov (United States)

    Mandai, Shingo; Venialgo, Esteban; Charbon, Edoardo

    2014-02-01

    We present an optimization technique utilizing order statistics with a multichannel digital silicon photomultiplier (MD-SiPM) for timing measurements. Accurate timing measurements are required by 3D rangefinding and time-of-flight positron emission tomography, to name a few applications. We have demonstrated the ability of the MD-SiPM to detect multiple photons, and we verified the advantage of detecting multiple photons assuming incoming photons follow a Gaussian distribution. We have also shown the advantage of utilizing multiple timestamps for estimating time-of-arrivals more accurately. This estimation technique can be widely available in various applications, which have a certain probability density function of incoming photons, such as a scintillator or a laser source.

  1. Discrete Time Optimal Adaptive Control for Linear Stochastic Systems

    Institute of Scientific and Technical Information of China (English)

    JIANG Rui; LUO Guiming

    2007-01-01

    The least-squares(LS)algorithm has been used for system modeling for a long time. Without any excitation conditions, only the convergence rate of the common LS algorithm can be obtained. This paper analyzed the weighted least-squares(WLS)algorithm and described the good properties of the WLS algorithm. The WLS algorithm was then used for daptive control of linear stochastic systems to show that the linear closed-loop system was globally stable and that the system identification was consistent. Compared to the past optimal adaptive controller,this controller does not impose restricted conditions on the coefficients of the system, such as knowing the first coefficient before the controller. Without any persistent excitation conditions, the analysis shows that, with the regulation of the adaptive control, the closed-loop system was globally stable and the adaptive controller converged to the one-step-ahead optimal controller in some sense.

  2. A Novel Real-time Optimization Methodology for Chemical Plants

    Institute of Scientific and Technical Information of China (English)

    黄静雯; 李宏光

    2012-01-01

    In this paper, a novel approach termed process goose queue (PGQ) is suggested to deal with real-time optimization (RTO) of chemical plants. Taking advantage of the ad-hoc structure of PGQ which imitates biologic nature of flying wild geese, a chemical plant optimization problem can be re-formulated as a combination of a multi-layer PGQ and a PGQ-Objective according to the relationship among process variables involved in the objective and constraints. Subsequently, chemical plant RTO solutions are converted into coordination issues among PGQs which could be dealt with in a novel way. Accordingly, theoretical definitions, adjustment rule and implementing procedures associated with the approach are explicitly introduced together with corresponding enabling algorithms. Finally, an exemplary chemical plant is employed to demonstrate the feasibility and validity of the contribution.

  3. Optimal trading strategies—a time series approach

    Science.gov (United States)

    Bebbington, Peter A.; Kühn, Reimer

    2016-05-01

    Motivated by recent advances in the spectral theory of auto-covariance matrices, we are led to revisit a reformulation of Markowitz’ mean-variance portfolio optimization approach in the time domain. In its simplest incarnation it applies to a single traded asset and allows an optimal trading strategy to be found which—for a given return—is minimally exposed to market price fluctuations. The model is initially investigated for a range of synthetic price processes, taken to be either second order stationary, or to exhibit second order stationary increments. Attention is paid to consequences of estimating auto-covariance matrices from small finite samples, and auto-covariance matrix cleaning strategies to mitigate against these are investigated. Finally we apply our framework to real world data.

  4. Unifying time evolution and optimization with matrix product states

    Science.gov (United States)

    Haegeman, Jutho; Lubich, Christian; Oseledets, Ivan; Vandereycken, Bart; Verstraete, Frank

    2016-10-01

    We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we introduce a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions. Rather than a Suzuki-Trotter splitting of the Hamiltonian, which is the idea behind the adaptive time-dependent density matrix renormalization group method or time-evolving block decimation, our method is based on splitting the projector onto the matrix product state tangent space as it appears in the Dirac-Frenkel time-dependent variational principle. We discuss how the resulting algorithm resembles the density matrix renormalization group (DMRG) algorithm for finding ground states so closely that it can be implemented by changing just a few lines of code and it inherits the same stability and efficiency. In particular, our method is compatible with any Hamiltonian for which ground-state DMRG can be implemented efficiently. In fact, DMRG is obtained as a special case of our scheme for imaginary time evolution with infinite time step.

  5. A time-resolved single-pass technique for measuring optical absorption coefficients of window materials under 100 GPa shock pressures.

    Science.gov (United States)

    Li, Jun; Zhou, Xianming; Li, Jiabo

    2008-12-01

    An experimental method was developed to perform time-resolved, single-pass optical absorption measurements and to determine absorption coefficients of window materials under strong shock compression up to approximately 200 GPa. Experimental details are described of (i) a configuration to generate an in situ dynamic, bright, optical source and (ii) a sample assembly with a lithium fluoride plate to essentially eliminate heat transfer from the hot radiator into the specimen and to maintain a constant optical source within the duration of the experiment. Examples of measurements of optical absorption coefficients of several initially transparent single crystal materials at high shock pressures are presented.

  6. Improved time window based conflict-free automated guided vehicle system routing%基于改进时间窗的AGVs避碰路径规划

    Institute of Scientific and Technical Information of China (English)

    乔岩; 钱晓明; 楼佩煌

    2012-01-01

    针对柔性制造系统中的自动导引车在动态不稳定环境下不能按照时间窗规划好的既定路径运行的问题,提出通过实时改变自动导引车通过节点的优先级,调整相应节点的自动导引车的通过顺序来更新自动导引车运行路径,对时间窗算法进行改进,从而实现多自动导引车动态环境下的路径规划。以含有8台自动导引车的淋雨线系统为应用案例进行仿真实验,对改进前的时间窗算法和改进后的时间窗算法进行对比,说明了算法的实现过程。通过仿真证明了该算法能减少冲突数目,有效实现多自动导引车避碰,具有更好的鲁棒性和柔性,同时能够提高系统效率。%In flexible manufacturing system, Automated Guided Vehicles(AGV)could not operate in planned routes of time window under dynamic uncertain environment. Aiming at this problem, the updating AGV operating pass was proposed by changing the priority of AGV passing through the nodes and adjusting the passing sequences of corresponding nodes. Meanwhile, time-window algorithm was improved to realize multiple AGV route planning in dynamic environment. In simulation experiment, rain line system with eight AGV was used to compare the unimproved time-window algorithm with the improved time-window algorithm, and the realization process of the algorithms was illustrated. Through the simulation, the proposed algorithm was proved to have better robustness and flexibility, and could reduce the number of conflicts, realize conflict-free effectively and improve system efficiency.

  7. Optimal Time Allocation in Backscatter Assisted Wireless Powered Communication Networks

    Science.gov (United States)

    Lyu, Bin; Yang, Zhen; Gui, Guan; Sari, Hikmet

    2017-01-01

    This paper proposes a wireless powered communication network (WPCN) assisted by backscatter communication (BackCom). This model consists of a power station, an information receiver and multiple users that can work in either BackCom mode or harvest-then-transmit (HTT) mode. The time block is mainly divided into two parts corresponding to the data backscattering and transmission periods, respectively. The users first backscatter data to the information receiver in time division multiple access (TDMA) during the data backscattering period. When one user works in the BackCom mode, the other users harvest energy from the power station. During the data transmission period, two schemes, i.e., non-orthogonal multiple access (NOMA) and TDMA, are considered. To maximize the system throughput, the optimal time allocation policies are obtained. Simulation results demonstrate the superiority of the proposed model. PMID:28587171

  8. Gasochromic windows

    Energy Technology Data Exchange (ETDEWEB)

    Wittwer, V.; Datz, M.; Ell, J.; Georg, A.; Graf, W.; Walze, G. [Fraunhofer Institute for Solar Energy Systems, Freiburg (Germany)

    2004-10-01

    Gasochromic windows can change their transmittance over a wide range. This change is caused by a thin layer of tungsten oxide (WO{sub 3}), covered by a very thin layer of platinum. Exposing this coating to diluted hydrogen gas leads to reduction of the WO{sub 3}, resulting in colouring. This process can be reversed by introducing diluted oxygen. The hydrogen and oxygen are produced by an electrolyser. Only small amounts of gas are needed for the switching process. The coatings are produced by sputtering. Water is needed in the WO{sub 3} films to allow rapid transport of the hydrogen. However, this water should not escape when the system is operated at higher temperatures, which can exceed 60 deg C. By adjusting the conditions of the sputtering process appropriately, a large amount of water can be incorporated in the films, which remains even up to temperatures above 100 deg C. The best transmittance values obtained for a coated double-glazed unit with a moderate film thickness (560 nm) and hydrogen concentrations below the combustion limit are 76% and 77% for solar and visual transmittance, respectively, in the bleached state and 5% and 6% for solar and visual transmittance, respectively, in the coloured state. Darker states can be obtained by applying thicker films of tungsten oxide without reducing the transmittance in the bleached state. Gasochromic coatings can also be deposited easily on plastic substrates and - because their coating structure is so simple - combined with prismatic microstructures, which allow light to be redirected. In addition, the gasochromic systems technology can be used with metal hydride systems. (Author)

  9. Opposing selection and environmental variation modify optimal timing of breeding.

    Science.gov (United States)

    Tarwater, Corey E; Beissinger, Steven R

    2013-09-17

    Studies of evolution in wild populations often find that the heritable phenotypic traits of individuals producing the most offspring do not increase proportionally in the population. This paradox may arise when phenotypic traits influence both fecundity and viability and when there is a tradeoff between these fitness components, leading to opposing selection. Such tradeoffs are the foundation of life history theory, but they are rarely investigated in selection studies. Timing of breeding is a classic example of a heritable trait under directional selection that does not result in an evolutionary response. Using a 22-y study of a tropical parrot, we show that opposing viability and fecundity selection on the timing of breeding is common and affects optimal breeding date, defined by maximization of fitness. After accounting for sampling error, the directions of viability (positive) and fecundity (negative) selection were consistent, but the magnitude of selection fluctuated among years. Environmental conditions (rainfall and breeding density) primarily and breeding experience secondarily modified selection, shifting optimal timing among individuals and years. In contrast to other studies, viability selection was as strong as fecundity selection, late-born juveniles had greater survival than early-born juveniles, and breeding later in the year increased fitness under opposing selection. Our findings provide support for life history tradeoffs influencing selection on phenotypic traits, highlight the need to unify selection and life history theory, and illustrate the importance of monitoring survival as well as reproduction for understanding phenological responses to climate change.

  10. Optimizing the search for transiting planets in long time series

    CERN Document Server

    Ofir, Aviv

    2013-01-01

    Context: Transit surveys, both ground- and space- based, have already accumulated a large number of light curves that span several years. Aims: The search for transiting planets in these long time series is computationally intensive. We wish to optimize the search for both detection and computational efficiencies. Methods: We assume that the searched systems can be well described by Keplerian orbits. We then propagate the effects of different system parameters to the detection parameters. Results: We show that the frequency information content of the light curve is primarily determined by the duty cycle of the transit signal, and thus the optimal frequency sampling is found to be cubic and not linear. Further optimization is achieved by considering duty-cycle dependent binning of the phased light curve. By using the (standard) BLS one is either rather insensitive to long-period planets, or less sensitive to short-period planets and computationally slower by a significant factor of ~330 (for a 3yr long dataset...

  11. The timing of terrorist attacks: An optimal stopping approach

    Directory of Open Access Journals (Sweden)

    Thomas Jensen

    2016-02-01

    Full Text Available I use a simple optimal stopping model to derive policy relevant insights on the timing of one-shot attacks by small autonomous terrorist units or “lone wolf” individuals. A main insight is that an increase in proactive counterterrorism measures can lead to a short term increase in the number of attempted terrorist attacks because it makes it more risky for existing terrorist units to pursue further development of capabilities. This is consistent with the events in London in 2005 where a terrorist attack on 7 July was followed by a similar but unsuccessful attack two weeks later.

  12. Time Optimal Synchronization Procedure and Associated Feedback Loops

    CERN Document Server

    Angoletta, Maria Elena; CERN. Geneva. ATS Department

    2016-01-01

    A procedure to increase the speed of currently used synchronization loops in a synchrotron by an order of magnitude is presented. Beams dynamics constraint imposes an upper limit on excursions in stable phase angle, and the procedure presented exploits this limit to arrive in the synchronized state from an arbitrary initial state in the fastest possible way. Detailed corrector design for beam phase loop, differential frequency loop and final synchronization loop is also presented. Finally, an overview of the synchronization methods currently deployed in some other CERN’s machines is provided, together with a brief comparison with the newly proposed time-optimal algorithm.

  13. Due-Window Assignment and Scheduling with Multiple Rate-Modifying Activities under the Effects of Deterioration and Learning

    Directory of Open Access Journals (Sweden)

    Zhanguo Zhu

    2011-01-01

    Full Text Available This paper discusses due-window assignment and scheduling with multiple rate-modifying activities. Multiple types of rate-modifying activities are allowed to perform on a single machine. The learning effect and job deterioration are also integrated concurrently into the problem which makes the problem more realistic. The objective is to find jointly the optimal location to perform multiple rate-modifying activities, the optimal job sequence, and the optimal location and size of the due window to minimize the total earliness, tardiness, and due-window-related costs. We propose polynomial time algorithms for all the cases of the problem under study.

  14. Optimization of Allowed Outage Time and Surveillance Test Intervals

    Energy Technology Data Exchange (ETDEWEB)

    Al-Dheeb, Mujahed; Kang, Sunkoo; Kim, Jonghyun [KEPCO international nuclear graduate school, Ulsan (Korea, Republic of)

    2015-10-15

    The primary purpose of surveillance testing is to assure that the components of standby safety systems will be operable when they are needed in an accident. By testing these components, failures can be detected that may have occurred since the last test or the time when the equipment was last known to be operational. The probability a system or system component performs a specified function or mission under given conditions at a prescribed time is called availability (A). Unavailability (U) as a risk measure is just the complementary probability to A(t). The increase of U means the risk is increased as well. D and T have an important impact on components, or systems, unavailability. The extension of D impacts the maintenance duration distributions for at-power operations, making them longer. This, in turn, increases the unavailability due to maintenance in the systems analysis. As for T, overly-frequent surveillances can result in high system unavailability. This is because the system may be taken out of service often due to the surveillance itself and due to the repair of test-caused failures of the component. The test-caused failures include those incurred by wear and tear of the component due to the surveillances. On the other hand, as the surveillance interval increases, the component's unavailability will grow because of increased occurrences of time-dependent random failures. In that situation, the component cannot be relied upon, and accordingly the system unavailability will increase. Thus, there should be an optimal component surveillance interval in terms of the corresponding system availability. This paper aims at finding the optimal T and D which result in minimum unavailability which in turn reduces the risk. Applying the methodology in section 2 to find the values of optimal T and D for two components, i.e., safety injection pump (SIP) and turbine driven aux feedwater pump (TDAFP). Section 4 is addressing interaction between D and T. In general

  15. Thermal lens spectrometry: Optimizing amplitude and shortening the transient time

    Science.gov (United States)

    Silva, Rubens; de Araújo, Marcos A. C.; Jali, Pedro; Moreira, Sanclayton G. C.; Alcantara, Petrus; de Oliveira, Paulo C.

    2011-06-01

    Based on a model introduced by Shen et al. for cw laser induced mode-mismatched dual-beam thermal lens spectrometry (TLS), we explore the parameters related with the geometry of the laser beams and the experimental apparatus that influence the amplitude and time evolution of the transient thermal lens (TL) signal. By keeping the sample cell at the minimum waist of the excitation beam, our results show that high amplitude TL signals, very close to the optimized value, combined with short transient times may be obtained by reducing the curvature radius of the probe beam and the distance between the sample cell and the detector. We also derive an expression for the thermal diffusivity which is independent of the excitation laser beam waist, considerably improving the accuracy of the measurements. The sample used in the experiments was oleic acid, which is present in most of the vegetable oils and is very transparent in the visible spectral range.

  16. Thermal lens spectrometry: Optimizing amplitude and shortening the transient time

    Directory of Open Access Journals (Sweden)

    Rubens Silva

    2011-06-01

    Full Text Available Based on a model introduced by Shen et al. for cw laser induced mode-mismatched dual-beam thermal lens spectrometry (TLS, we explore the parameters related with the geometry of the laser beams and the experimental apparatus that influence the amplitude and time evolution of the transient thermal lens (TL signal. By keeping the sample cell at the minimum waist of the excitation beam, our results show that high amplitude TL signals, very close to the optimized value, combined with short transient times may be obtained by reducing the curvature radius of the probe beam and the distance between the sample cell and the detector. We also derive an expression for the thermal diffusivity which is independent of the excitation laser beam waist, considerably improving the accuracy of the measurements. The sample used in the experiments was oleic acid, which is present in most of the vegetable oils and is very transparent in the visible spectral range.

  17. An Optimized Multikeying Chaotic Encryption for Real Time Applications

    Directory of Open Access Journals (Sweden)

    R. Tamijetchelvy

    2013-12-01

    Full Text Available In recent years, the availability of wireless technologies has become prominent solution for next generation wireless networks (NGWN. Hence the demand for secure communication is an important research issue. Cryptography is recognized as the best method of data protection against active and passive attacks. Therefore a novel chaotic cryptographic scheme is proposed for real time communication. Chaos signals are random behaviour, continuous and sensitive dependence on initial conditions. However, it has been shown that most of these chaotic methods have a low level of security because of single keying concept. In this paper an optimized fast encryption scheme based on chaotic signal with multi key is justified for video frame. Simulation results show that the proposed chaotic encryption scheme outperforms the existing scheme in terms of considerable reduction in encryption and decryption time. The security of the proposed scheme is also analysed by various cryptanalysis attacks.

  18. Memettc algorithm for vehicle routing problem with time windows.%带时间窗车辆路径问题的文化基因算法

    Institute of Scientific and Technical Information of China (English)

    王君; 李波

    2012-01-01

    针对物流配送中带时问窗的车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW),建立了数学模型,并设计了求解VRPTW的文化基因算法.种群搜索采用遗传算法的进化模式,局部搜索采用禁忌搜索机制,并结合可行邻域结构避免对不可行解的搜索,以提高搜索效率.与单纯的遗传算法和禁忌搜索算法进行对比实验,表明该算法是求解VRPTW的一种有效方法.%The Vehicle Routing Problem with Time Windows(VRPTW) is addressed in this paper. A mathematical model is designed and a memetic algorithm is proposed for VRPTW. The pattern of population search is genetic algorithm and the local search used tabu. The feasible neighborhoods are integrated into the algorithm to avoid the search for infeasible solutions, thus it improves search efficiency. Compared with the pure genetic algorithm and the tabu search, computational experiments on Solomon benchmarks show the effectiveness of the proposed memetic algorithm for VRPTW.

  19. Blocking GluN2B subunits reverses the enhanced seizure susceptibility after prolonged febrile seizures with a wide therapeutic time-window.

    Science.gov (United States)

    Chen, Bin; Feng, Bo; Tang, Yangshun; You, Yi; Wang, Yi; Hou, Weiwei; Hu, Weiwei; Chen, Zhong

    2016-09-01

    Febrile seizures (FSs), the most common type of convulsive events in infants, are closely associated with temporal lobe epilepsy (TLE) in adulthood. It is urgent to investigate how FSs promote epileptogenesis and find the potential therapeutic targets. In the present study, we showed that the phosphorylation of GluN2B Tyr1472 gradually reached peak level at 24h after prolonged FSs and remained elevated during 7days thereafter. IL-1β treatment alone, which in previous study mimicked the effect of prolonged FSs on adult seizure susceptibility, increased GluN2B Tyr1472 phosphorylation. Both IL-1 receptor antagonist (IL-1Ra) and IL-1R1 deletion were sufficient to reverse the prolonged FSs induced hyper-phosphorylation of GluN2B Tyr1472. GluN2B antagonist ifenprodil showed a wide therapeutic time-window (3days) to reverse the enhanced seizure susceptibility after prolonged FSs or IL-1β treatment. Our study demonstrated that GluN2B phosphorylation at Tyr1472 site mediated by the transient increase of IL-1β was involved in the enhanced adult seizure susceptibility after prolonged FSs, implicating GluN2B-containing NMDAR is a new potential drug target with a wide therapeutic time window to prevent epileptogenesis in patients with infantile FSs. Copyright © 2016 Elsevier Inc. All rights reserved.

  20. Improved Windows for Cold Climates

    DEFF Research Database (Denmark)

    Laustsen, Jacob Birck; Svendsen, Svend

    2005-01-01

    of the heating demand in typical single-family houses in Denmark and Greenland. The examined windows are typical new windows from Nordic countries and new proposals of improved windows with low thermal transmittance and high total solar energy transmittance. The results show that net energy gain can be increased...... considerably by reducing the frame width, which results in a larger transparent area causing a larger solar gain but still main-taining a low thermal transmittance. Using three layers of glass with large gaps, using very slim frame profiles, and omitting the edge constructions that normally causes thermal...... bridges achieve this. Applying shutters or low emissivity coated roller blinds incorporated in the glazing that are activated during night time can improve the energy performance of windows. The results from this work show that it is possible to develop windows with a positive net energy in a fairly...

  1. Optimizing timing performance of silicon photomultiplier-based scintillation detectors.

    Science.gov (United States)

    Yeom, Jung Yeol; Vinke, Ruud; Levin, Craig S

    2013-02-21

    Precise timing resolution is crucial for applications requiring photon time-of-flight (ToF) information such as ToF positron emission tomography (PET). Silicon photomultipliers (SiPM) for PET, with their high output capacitance, are known to require custom preamplifiers to optimize timing performance. In this paper, we describe simple alternative front-end electronics based on a commercial low-noise RF preamplifier and methods that have been implemented to achieve excellent timing resolution. Two radiation detectors with L(Y)SO scintillators coupled to Hamamatsu SiPMs (MPPC S10362-33-050C) and front-end electronics based on an RF amplifier (MAR-3SM+), typically used for wireless applications that require minimal additional circuitry, have been fabricated. These detectors were used to detect annihilation photons from a Ge-68 source and the output signals were subsequently digitized by a high speed oscilloscope for offline processing. A coincident resolving time (CRT) of 147 ± 3 ps FWHM and 186 ± 3 ps FWHM with 3 × 3 × 5 mm(3) and with 3 × 3 × 20 mm(3) LYSO crystal elements were measured, respectively. With smaller 2 × 2 × 3 mm(3) LSO crystals, a CRT of 125 ± 2 ps FWHM was achieved with slight improvement to 121 ± 3 ps at a lower temperature (15° C). Finally, with the 20 mm length crystals, a degradation of timing resolution was observed for annihilation photon interactions that occur close to the photosensor compared to shallow depth-of-interaction (DOI). We conclude that commercial RF amplifiers optimized for noise, besides their ease of use, can produce excellent timing resolution comparable to best reported values acquired with custom readout electronics. On the other hand, as timing performance degrades with increasing photon DOI, a head-on detector configuration will produce better CRT than a side-irradiated setup for longer crystals.

  2. Computing Finite-Time Lyapunov Exponents with Optimally Time Dependent Reduction

    Science.gov (United States)

    Babaee, Hessam; Farazmand, Mohammad; Sapsis, Themis; Haller, George

    2016-11-01

    We present a method to compute Finite-Time Lyapunov Exponents (FTLE) of a dynamical system using Optimally Time-Dependent (OTD) reduction recently introduced by H. Babaee and T. P. Sapsis. The OTD modes are a set of finite-dimensional, time-dependent, orthonormal basis {ui (x , t) } |i=1N that capture the directions associated with transient instabilities. The evolution equation of the OTD modes is derived from a minimization principle that optimally approximates the most unstable directions over finite times. To compute the FTLE, we evolve a single OTD mode along with the nonlinear dynamics. We approximate the FTLE from the reduced system obtained from projecting the instantaneous linearized dynamics onto the OTD mode. This results in a significant reduction in the computational cost compared to conventional methods for computing FTLE. We demonstrate the efficiency of our method for double Gyre and ABC flows. ARO project 66710-EG-YIP.

  3. Optimal design for hetero-associative memory: hippocampal CA1 phase response curve and spike-timing-dependent plasticity.

    Directory of Open Access Journals (Sweden)

    Ryota Miyata

    Full Text Available Recently reported experimental findings suggest that the hippocampal CA1 network stores spatio-temporal spike patterns and retrieves temporally reversed and spread-out patterns. In this paper, we explore the idea that the properties of the neural interactions and the synaptic plasticity rule in the CA1 network enable it to function as a hetero-associative memory recalling such reversed and spread-out spike patterns. In line with Lengyel's speculation (Lengyel et al., 2005, we firstly derive optimally designed spike-timing-dependent plasticity (STDP rules that are matched to neural interactions formalized in terms of phase response curves (PRCs for performing the hetero-associative memory function. By maximizing object functions formulated in terms of mutual information for evaluating memory retrieval performance, we search for STDP window functions that are optimal for retrieval of normal and doubly spread-out patterns under the constraint that the PRCs are those of CA1 pyramidal neurons. The system, which can retrieve normal and doubly spread-out patterns, can also retrieve reversed patterns with the same quality. Finally, we demonstrate that purposely designed STDP window functions qualitatively conform to typical ones found in CA1 pyramidal neurons.

  4. Duplication of Windows Services

    OpenAIRE

    Shan, Zhiyong; Chiueh, Tzi-cker; Wang, Xin

    2016-01-01

    OS-level virtualization techniques virtualize system resources at the system call interface, has the distinct advantage of smaller run-time resource requirements as compared to HAL-level virtualization techniques, and thus forms an important building block for virtualizing parallel and distributed applications such as a HPC clusters. Because the Windows operating system puts certain critical functionalities in privileged user-level system service processes, a complete OS-level virtualization ...

  5. Identification of optimal inspection interval via delay-time concept

    Directory of Open Access Journals (Sweden)

    Glauco Ricardo Simões Gomes

    2016-06-01

    Full Text Available This paper presents an application of mathematical modeling aimed at managing maintenance based on the delay-time concept. The study scenario was the manufacturing sector of an industrial unit, which operates 24 hours a day in a continuous flow of production. The main idea was to use the concepts of this approach to determine the optimal time of preventive action by the maintenance department in order to ensure the greatest availability of equipment and facilities at appropriate maintenance costs. After a brief introduction of the subject, the article presents topics that illustrate the importance of mathematical modeling in maintenance management and the delay-time concept. It also describes the characteristics of the company where the study was conducted, as well as the data related to the production process and maintenance actions. Finally, the results obtained after applying the delay-time concept are presented and discussed, as well as the limitations of the article and the proposals for future research.

  6. Solving Stochastic Demand Inventory Routing Problem with Hard Time Windows%求解硬时间窗约束下随机需求库存-路径问题的优化算法

    Institute of Scientific and Technical Information of China (English)

    赵达; 李军; 马丹祥; 李妍峰

    2014-01-01

    The Stochastic Demand Inventory Routing Problem (SDIRP)is a kind of typical NP-hard problem.To consider the coordination and optimization problem of inventory and distribution in the supply chain is the key to implementing vendor managed inventory .This paper explores the stochastic demand IRP with hard time windows ( SDIRPHTW) , and decomposes SDIRPHTW into two sub-problems: stochastic inventory routing problem with direct distribution and vehicle routing problem with hard time windows .Then, with the objective to minimizing the system cost and the number of vehicles , we present a heuristic algorithm based on ( s,S) inventory policy and modified C-W saving algorithm , and analyses the efficiency of the algorithm through a numerical example .%随机需求库存-路径问题( Stochastic Demand Inventory Routing Problem , SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机需求库存-路径问题( Stochastic Demand Inventory Routing Problem with Hard Time Windows , SDIRPHTW)为研究对象,将SDIRPHTW分解为直接配送的随机库存-路径问题和具有硬时间窗约束的路径优化问题两个子问题,并以最小化系统运行成本和用车数量为目标,设计了一个基于( s,S)库存策略和修正C-W节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。

  7. Vehicle Routing Problem with Time Windows Based on Spatiotemporal Distance%一种基于时空距离的带时间窗车辆路径问题算法

    Institute of Scientific and Technical Information of China (English)

    戚铭尧; 丁国祥; 周游; 缪立新

    2011-01-01

    带时间窗的车辆路径问题是典型的NP难题,一种常用的求解方法是先对顾客分组,后进行路径优化的两阶段启发式算法.传统算法在顾客分组时主要考虑顾客的空间位置关系,但是忽略了顾客对服务时间窗口的要求.本文同时考虑顾客的时间和空间特性,提出了一种基于时空度量的顾客分组方法.在路径优化阶段,本文提出了一种禁忌搜索算法来进行求解,该算法中禁忌的对象不是解,而是这些解的目标函数值的区间,以便于提高收敛效率.作为验证,本文以Solomon标杆问题集为算例进行演算,结果表明,在窄时间窗约束下,基于时空距离的两阶段启发式算法明显优于基于空间距离的算法,且部分算例的解达到了国内外已发表的最好解.%Vehicle Routing Problem with Time Windows (VRPTW) is a well known NP-hard problem. A typical way to solve this problem is to partition the customers into groups first and then construct optimal routes for each group or groups. Conventionally, customers are partitioned according to the spatial distance only, while ignoring their time window requirements. In this paper, we consider jointly spatial and temporal characteristics of customers and propose a s. patiotemporal distance based criteria for customers partitioning. To improve the initial solution, a tabu search algorithm is developed. To improve the convergence efficiency, this algorithm limits the objective value ranges that around the recently visited solutions, Instead of Iimiting recently visited solutions, the performance of the proposed algorithm is examined with Solomon benchmark problems. The results indicate that spatiotemporal distance is more effective than spatial distance when solving vehicle routing problems with narrow time windows. Some results are even comparable to the best results obtained so far.

  8. 线性时滞系统窗口H∞频域分析%Analysis of Linear Systems with Time Delay in Window H∞ Frequency Domain

    Institute of Scientific and Technical Information of China (English)

    郑敏; 肖维; 李扬

    2012-01-01

    在实际控制系统中,常常需要关注局部频段下的性能指标,而现有的频率加权方法缺乏针对性.由于时滞现象的普遍性及时滞条件下频域分析的复杂性,需要进一步给出时滞系统在局部频段下的H∞性能分析方法.为研究线性时滞系统在局部频段下的性能,基于广义Kalman-Yakubovich-Popov引理及窗口频域H∞范数的概念,给出了线性时滞系统的广义界实定理.针对不同频率范围,给出适用于不同频率条件的频域分析线性矩阵不等式判据.最后通过仿真实例,表明窗口频域分析比传统的全频段H∞分析具有针对性和有效性.%In practical control systems, some concerns are often focused on the performance of the local band. However, the frequency weighing methods lack of efficiency. On the other hand, time delay phenomenon is often encountered in many practical systems and for the complexity of frequency domain analysis, there is a need for further studies on finite frequency analysis of time delay systems. This paper is concerned with window H∞ performance of linear systems with time delay. Generalized bounded real theorem for time delay system is presented based on Generalized Kalman-Yakubovich-Popov lemma and window H∞ concept. Then, a series of criteria in terms of LMI are proposed for different frequency intervals. Finally, the effectiveness of window frequency analysis is illustrated through an example.

  9. Study on combinational disruption management for vehicle routing problem with fuzzy time windows%有模糊时间窗的车辆调度组合干扰管理研究

    Institute of Scientific and Technical Information of China (English)

    王旭坪; 阮俊虎; 张凯; 马超

    2011-01-01

    One-class combinational disruption management model for vehicle routing problem with fuzzy time windows and its hybrid genetic algorithm were studied. After developing the fuzzy processing of time windows and describing customers' satisfaction level by a fuzzy membership function, the paper analyzed the combinational disruptions for vehicle routing problem, and presented methods of disruptions identification and measurement which considered synthetically distribution paths, distribution costs and customer satisfaction levels according to disruption management thoughts, and put forward a disruption recovery model for combinational disruptions. The heuristic insertion nde and genetic algorithm were combined to solve the proposed multi-objective model and a fuzzy optimization procedure was embedded to deal with fuzzy features of the problem. Computational experiments were carried out to examine the model and the algorithm.%研究带有模糊时间窗的车辆调度组合干扰管理模型及其混合遗传算法.采用时间窗模糊化处理方法,定义客户满意度函数,根据干扰管理思想对车辆调度中组合性干扰事件进行分析,从配送路径、配送成本和客户满意度三个方面进行干扰辨识与度量,建立基于模糊时间窗的车辆调度组合干扰管理模型;构造模型求解的混合遗传算法,将最佳客户插入规则与遗传算法结合,同时在算法中嵌入模糊优化程序以处理问题的模糊特征;进行数值实验,实验结果验证了模型与算法的有效性.

  10. FAME Storage Time in an Optimized Natural Antioxidant Mixture

    Directory of Open Access Journals (Sweden)

    Rodolfo Lopes Coppo

    2013-01-01

    Full Text Available The study of B100 biodiesel oxidation stability, and its conservation, is extremely important to control its quality, especially regarding storage. Many spices have shown antioxidant effect and are the targets of study. Knowing the oxidation process in greater detail allows a reliable storage period to be stipulated for the biodiesel without its degradation until the time of use. Results have shown that according to the accelerated stove method, the optimal mixture, composed of 100% of oregano extract, can confer a 535-day shelf life to biodiesel without evident oxidation. According to the results obtained by the Rancimat method, the ideal mixture consists of 100% rosemary, resulting in 483 days of storage. The application of the process variable showed that the accelerated stove method was more suitable to determine oxidative stability of biodiesel.

  11. FXR LIA Optimization - Time-resolved OTR Emittance Measurement

    Energy Technology Data Exchange (ETDEWEB)

    Jacob, J; Ong, M; Wargo, P; LeSage, G

    2005-07-21

    The Flash X-Ray Radiography (FXR) facility at Lawrence Livermore National Laboratory utilizes a high current, long pulse linear induction accelerator to produce high doses of x-ray radiation. Accurate characterization of the transverse beam emittance is required in order to facilitate accelerator modeling and tuning efforts and, ultimately, to optimize the final focus spot size, yielding higher resolution radiographs. In addition to conventional magnet scan, pepper-pot, and multiple screen techniques, optical transition radiation (OTR) has been proven as a useful emittance measurement diagnostic and is particularly well suited to the FXR accelerator. We shall discuss the time-resolved emittance characterization of an induction linac electron beam using OTR, and we will present our experimental apparatus and analysis software. We shall also develop the theoretical background of beam emittance and transition radiation.

  12. Time-optimal chaos control by center manifold targeting.

    Science.gov (United States)

    Starrett, John

    2002-10-01

    Ott-Grebogi-Yorke control and its map-based variants work by targeting the (linear) stable subspace of the target orbit so that after one application of the control the system will be in this subspace. I propose an n-step variation, where n is the dimension of the system, that sends any initial condition in a controllable region directly to the target orbit instead of its stable subspace. This method is time optimal, in that, up to modeling and measurement error, the system is completely controlled after n iterations of the control procedure. I demonstrate the procedure using a piecewise linear and a nonlinear two-dimensional map, and indicate how the technique may be extended to maps and flows of higher dimension.

  13. Optimization of structural and dielectric properties of CdSe loaded poly(diallyl dimethyl ammonium chloride) polymer in a desired frequency and temperature window

    Energy Technology Data Exchange (ETDEWEB)

    Tyagi, Chetna, E-mail: ctyagi05@gmail.com; Sharma, Ambika, E-mail: ambikasharma2004@yahoo.com [Department of Applied Sciences, The NorthCap University (Formerly ITM University), Gurgaon, 122017 Haryana (India)

    2016-01-07

    In the present paper, investigations of CdSe loaded poly(diallyl dimethyl ammonium chloride) (PDADMAC) nanocomposites and pure PDADMAC synthesized by wet chemical technique have been carried out. Fourier transform infrared and X-ray diffraction analysis have been performed to reveal the structural details of pure polymer and polymer nanocomposite (PNC). The dielectric behavior of pure polymer and PNC has been recorded, which results in higher value of the real and imaginary part of dielectric constant for PNC, as compared with pure PDADMAC. The increase is attributed to the addition of CdSe quantum dots to the pure polymer. The contribution of ionic and electronic polarization has been observed at higher frequency. The theoretical fitting of Cole-Cole function to the experimental data of dielectric constant of PNC and pure PDADMAC results in the determination of relaxation time and conductivity of space charge carriers. The CdSe loaded polymer nanocomposite has been used as an electrolyte in the battery fabrication with configuration Al/PNC/Ag{sub 2}O. The ac conductivity measurements have been carried out for both samples in a frequency window of 1 kHz–5 MHz and at different temperatures varying from 298 K to 523 K. Activation energy (E{sub a}) has been determined for pure polymer as well as PNC and is found to be less for PNC, as compared with pure polymer. Further, impedance measurement at different temperatures results in two frequency ranges corresponding to ionic conduction and blocking electrode effect. The value of bulk resistance for pure polymer and PNC has been found to be 3660 Ω and 442 Ω, respectively, at 298 K temperature. Electric modulus has been determined and is observed to support the dielectric constant data; it further reveals the deviation from Debye behavior at a higher frequency.

  14. Optimization of structural and dielectric properties of CdSe loaded poly(diallyl dimethyl ammonium chloride) polymer in a desired frequency and temperature window

    Science.gov (United States)

    Tyagi, Chetna; Sharma, Ambika

    2016-01-01

    In the present paper, investigations of CdSe loaded poly(diallyl dimethyl ammonium chloride) (PDADMAC) nanocomposites and pure PDADMAC synthesized by wet chemical technique have been carried out. Fourier transform infrared and X-ray diffraction analysis have been performed to reveal the structural details of pure polymer and polymer nanocomposite (PNC). The dielectric behavior of pure polymer and PNC has been recorded, which results in higher value of the real and imaginary part of dielectric constant for PNC, as compared with pure PDADMAC. The increase is attributed to the addition of CdSe quantum dots to the pure polymer. The contribution of ionic and electronic polarization has been observed at higher frequency. The theoretical fitting of Cole-Cole function to the experimental data of dielectric constant of PNC and pure PDADMAC results in the determination of relaxation time and conductivity of space charge carriers. The CdSe loaded polymer nanocomposite has been used as an electrolyte in the battery fabrication with configuration Al/PNC/Ag2O. The ac conductivity measurements have been carried out for both samples in a frequency window of 1 kHz-5 MHz and at different temperatures varying from 298 K to 523 K. Activation energy (Ea) has been determined for pure polymer as well as PNC and is found to be less for PNC, as compared with pure polymer. Further, impedance measurement at different temperatures results in two frequency ranges corresponding to ionic conduction and blocking electrode effect. The value of bulk resistance for pure polymer and PNC has been found to be 3660 Ω and 442 Ω, respectively, at 298 K temperature. Electric modulus has been determined and is observed to support the dielectric constant data; it further reveals the deviation from Debye behavior at a higher frequency.

  15. Optimal Selling Time in Stock Market over a Finite Time Horizon

    Institute of Scientific and Technical Information of China (English)

    S.C.P. YAM; S.P. YUNG; W. ZHOU

    2012-01-01

    In this paper,we examine the best time to sell a stock at a price being as close as possible to its highest price over a finite time horizon [0,T],where the stock price is modelled by a geometric Brownian motion and the 'closeness' is measured by the relative error of the stock price to its highest price over [0,T]. More precisely,we want to optimize the expression:V*=sup0≤τ≤T IE[Vτ/MT],where (Vt)t≥0 is a geometric Brownish motion with constant drift α and constant volatility σ > 0,Mt =max0≤s≤t Vs is the running maximum of the stock price,and the supremum is taken over all possible stopping times 0 < τ < Tadapted to the natural filtration (Ft)t≥0 of the stock price.The above problem has been considered by Shiryaev,Xu and Zhou (2008) and Du Toit and Peskir (2009).In this paper we provide an independent proof that when α =1/2σ2,a selling strategy is optimal if and only if it sells the stock either at the terminal time T or at the moment when the stock price hits its maximum price so far.Besides,when α > 1/2σ2,selling the stock at the terminal time T is the unique optimal selling strategy.Our approach to the problem is purely probabilistic and has been inspired by relating the notion of dominant stopping pτ of a stopping time τ to the optimal stopping strategy arisen in the classical "Secretary Problem".

  16. Time-bound product returns and optimal order quantities for mass merchandisers

    Science.gov (United States)

    Yu, Min-Chun; Goh, Mark

    2012-01-01

    The return guidelines for a mass merchandiser usually entail a grace period, a markdown on the original price and the condition of the returned items. This research utilises eight scenarios formed from the variation of possible return guidelines to model the cost functions of single-product categories for a typical mass merchandiser. Models for the eight scenarios are developed and solved with the objective of maximising the expected profit so as to obtain closed form solutions for the associated optimal order quantity. An illustrative example and sensitivity analysis are provided to demonstrate the applicability of the model. Our results show that merchandisers who allow for returns within a time window, albeit with a penalty cost imposed and the returned products being recoverable, should plan for larger order amounts as such products do not affect the business. Similarly, the merchandisers who allow for returns beyond a grace period and without any penalty charges, but where the returned products are irrecoverable, should manage their stocks in this category more judiciously by ordering as little as possible so as to limit the number of returns and carefully consider the effects of their customer satisfaction-guaranteed policies, if any.

  17. Time domain topology optimization of 3D nanophotonic devices

    DEFF Research Database (Denmark)

    Elesin, Yuriy; Lazarov, Boyan Stefanov; Jensen, Jakob Søndergaard;

    2014-01-01

    We present an efficient parallel topology optimization framework for design of large scale 3D nanophotonic devices. The code shows excellent scalability and is demonstrated for optimization of broadband frequency splitter, waveguide intersection, photonic crystal-based waveguide and nanowire...

  18. Process window metrology

    Science.gov (United States)

    Ausschnitt, Christopher P.; Chu, William; Hadel, Linda M.; Ho, Hok; Talvi, Peter

    2000-06-01

    This paper is the third of a series that defines a new approach to in-line lithography control. The first paper described the use of optically measurable line-shortening targets to enhance signal-to-noise and reduce measurement time. The second described the dual-tone optical critical dimension (OCD) measurement and analysis necessary to distinguish dose and defocus. Here we describe the marriage of dual-tone OCD to SEM-CD metrology that comprises what we call 'process window metrology' (PWM), the means to locate each measured site in dose and focus space relative to the allowed process window. PWM provides in-line process tracking and control essential to the successful implementation of low-k lithography.

  19. How to study optimal timing of PET/CT for monitoring of cancer treatment

    DEFF Research Database (Denmark)

    Vach, Werner; Høilund-Carlsen, Poul Flemming; Fischer, Barbara Malene Bjerregaard

    2011-01-01

    Purpose: The use of PET/CT for monitoring treatment response in cancer patients after chemo- or radiotherapy is a very promising approach to optimize cancer treatment. However, the timing of the PET/CT-based evaluation of reduction in viable tumor tissue is a crucial question. We investigated how...... to plan and analyze studies to optimize this timing. Methods: General considerations about studying the optimal timing are given and four fundamental steps are illustrated using data from a published study. Results: The optimal timing should be examined by optimizing the schedule with respect...... to predicting the overall individual time course we can observe in the case of dense measurements. The optimal timing needs not to and should not be studied by optimizing the association with the prognosis of the patient. Conclusions: The optimal timing should be examined in specific ‘schedule optimizing...

  20. Thermal Bridge Effects in Window Grooves

    DEFF Research Database (Denmark)

    Rose, Jørgen

    1997-01-01

    In this report thermal bridge effects in window grooves are analyzed. The analysis is performed using different thicknesses of the window groove insulation, to evaluate what the optimal solution is.All analysis in the report is performed using both 2- and 3-dimensional numerical analysis....

  1. In the interests of time: improving HIV allocative efficiency modelling via optimal time-varying allocations

    Directory of Open Access Journals (Sweden)

    Andrew J Shattock

    2016-02-01

    Full Text Available Introduction: International investment in the response to HIV and AIDS has plateaued and its future level is uncertain. With many countries committed to ending the epidemic, it is essential to allocate available resources efficiently over different response periods to maximize impact. The objective of this study is to propose a technique to determine the optimal allocation of funds over time across a set of HIV programmes to achieve desirable health outcomes. Methods: We developed a technique to determine the optimal time-varying allocation of funds (1 when the future annual HIV budget is pre-defined and (2 when the total budget over a period is pre-defined, but the year-on-year budget is to be optimally determined. We use this methodology with Optima, an HIV transmission model that uses non-linear relationships between programme spending and associated programmatic outcomes to quantify the expected epidemiological impact of spending. We apply these methods to data collected from Zambia to determine the optimal distribution of resources to fund the right programmes, for the right people, at the right time. Results and discussion: Considering realistic implementation and ethical constraints, we estimate that the optimal time-varying redistribution of the 2014 Zambian HIV budget between 2015 and 2025 will lead to a 7.6% (7.3% to 7.8% decrease in cumulative new HIV infections compared with a baseline scenario where programme allocations remain at 2014 levels. This compares to a 5.1% (4.6% to 5.6% reduction in new infections using an optimal allocation with constant programme spending that recommends unrealistic programmatic changes. Contrasting priorities for programme funding arise when assessing outcomes for a five-year funding period over 5-, 10- and 20-year time horizons. Conclusions: Countries increasingly face the need to do more with the resources available. The methodology presented here can aid decision-makers in planning as to when to

  2. Minimal and non-minimal optimal fixed-order compensators for time-varying discrete-time systems

    NARCIS (Netherlands)

    Willigenburg, van L.G.; Koning, de W.L.

    2002-01-01

    The finite horizon optimal fixed-order LQG compensation problem for time-varying discrete-time systems is considered. Using the minimality property of finite horizon time-varying compensators, established in this paper, strengthened discrete-time optimal projection equations and associated boundary

  3. Optimal Planet Properties For Plate Tectonics Through Time And Space

    Science.gov (United States)

    Stamenkovic, Vlada; Seager, Sara

    2014-11-01

    Both the time and the location of planet formation shape a rocky planet’s mass, interior composition and structure, and hence also its tectonic mode. The tectonic mode of a planet can vary between two end-member solutions, plate tectonics and stagnant lid convection, and does significantly impact outgassing and biogeochemical cycles on any rocky planet. Therefore, estimating how the tectonic mode of a planet is affected by a planet’s age, mass, structure, and composition is a major step towards understanding habitability of exoplanets and geophysical false positives to biosignature gases. We connect geophysics to astronomy in order to understand how we could identify and where we could find planet candidates with optimal conditions for plate tectonics. To achieve this goal, we use thermal evolution models, account for the current wide range of uncertainties, and simulate various alien planets. Based on our best model estimates, we predict that the ideal targets for plate tectonics are oxygen-dominated (C/O<1) (solar system like) rocky planets of ~1 Earth mass with surface oceans, large metallic cores super-Mercury, rocky body densities of ~7000kgm-3), and with small mantle concentrations of iron 0%), water 0%), and radiogenic isotopes 10 times less than Earth). Super-Earths, undifferentiated planets, and especially hypothetical carbon planets, speculated to consist of SiC and C, are not optimal for the occurrence of plate tectonics. These results put Earth close to an ideal compositional and structural configuration for plate tectonics. Moreover, the results indicate that plate tectonics might have never existed on planets formed soon after the Big Bang—but instead is favored on planets formed from an evolved interstellar medium enriched in iron but depleted in silicon, oxygen, and especially in Th, K, and U relative to iron. This possibly sets a belated Galactic start for complex Earth-like surface life if plate tectonics significantly impacts the build up

  4. Near-Optimal Sublinear Time Bounds for Distributed Random Walks

    CERN Document Server

    Sarma, Atish Das; Pandurangan, Gopal; Tetali, Prasad

    2009-01-01

    We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample on an undirected network. Despite the widespread use of random walks in distributed computing, most algorithms that compute a random walk sample of length $\\ell$ naively, i.e., in $O(\\ell)$ rounds. Recently, the first sublinear time distributed algorithm was presented that ran in $\\tilde{O}(\\ell^{2/3}D^{1/3})$ rounds {$\\tilde{O}$ hides polylog factors in the number of nodes in the network} where $D$ is the diameter of the network [Das Sarma et al. PODC 2009]. This work further conjectured that a running time of $\\tilde{O}(\\sqrt{\\ell D})$ is possible and that this is essentially optimal. In this paper, we resolve these conjectures by showing almost tight bounds on distributed random walks. We present a distributed algorithm that performs a random walk of length $\\ell$ in $\\tilde{O}(\\sqrt{\\ell D})$ rounds, where...

  5. Inversion of generalized relaxation time distributions with optimized damping parameter

    Science.gov (United States)

    Florsch, Nicolas; Revil, André; Camerlynck, Christian

    2014-10-01

    Retrieving the Relaxation Time Distribution (RDT), the Grains Size Distribution (GSD) or the Pore Size Distribution (PSD) from low-frequency impedance spectra is a major goal in geophysics. The “Generalized RTD” generalizes parametric models like Cole-Cole and many others, but remains tricky to invert since this inverse problem is ill-posed. We propose to use generalized relaxation basis function (for instance by decomposing the spectra on basis of generalized Cole-Cole relaxation elements instead of the classical Debye basis) and to use the L-curve approach to optimize the damping parameter required to get smooth and realistic inverse solutions. We apply our algorithm to three examples, one synthetic and two real data sets, and the program includes the possibility of converting the RTD into GSD or PSD by choosing the value of the constant connecting the relaxation time to the characteristic polarization size of interest. A high frequencies (typically above 1 kHz), a dielectric term in taken into account in the model. The code is provided as an open Matlab source as a supplementary file associated with this paper.

  6. Design Time Optimization for Hardware Watermarking Protection of HDL Designs

    Directory of Open Access Journals (Sweden)

    E. Castillo

    2015-01-01

    Full Text Available HDL-level design offers important advantages for the application of watermarking to IP cores, but its complexity also requires tools automating these watermarking algorithms. A new tool for signature distribution through combinational logic is proposed in this work. IPP@HDL, a previously proposed high-level watermarking technique, has been employed for evaluating the tool. IPP@HDL relies on spreading the bits of a digital signature at the HDL design level using combinational logic included within the original system. The development of this new tool for the signature distribution has not only extended and eased the applicability of this IPP technique, but it has also improved the signature hosting process itself. Three algorithms were studied in order to develop this automated tool. The selection of a cost function determines the best hosting solutions in terms of area and performance penalties on the IP core to protect. An 1D-DWT core and MD5 and SHA1 digital signatures were used in order to illustrate the benefits of the new tool and its optimization related to the extraction logic resources. Among the proposed algorithms, the alternative based on simulated annealing reduces the additional resources while maintaining an acceptable computation time and also saving designer effort and time.

  7. Time-Saving Approach for Optimal Mining of Association Rules

    Directory of Open Access Journals (Sweden)

    Mouhir Mohammed

    2016-10-01

    Full Text Available Data mining is the process of analyzing data so as to get useful information to be exploited by users. Association rules is one of data mining techniques used to detect different correlations and to reveal relationships among data individual items in huge data bases. These rules usually take the following form: if X then Y as independent attributes. An association rule has become a popular technique used in several vital fields of activity such as insurance, medicine, banks, supermarkets… Association rules are generated in huge numbers by algorithms known as Association Rules Mining algorithms. The generation of huge quantities of Association Rules may be time-and-effort consuming this is the reason behind an urgent necessity of an efficient and scaling approach to mine only the relevant and significant association rules. This paper proposes an innovative approach which mines the optimal rules from a large set of Association Rules in a distributive processing way to improve its efficiency and to decrease the running time.

  8. Optimization of Exposure Time Division for Multi-object Photometry

    Science.gov (United States)

    Popowicz, Adam; Kurek, Aleksander R.

    2017-09-01

    Optical observations of wide fields of view entail the problem of selecting the best exposure time. As many objects are usually observed simultaneously, the quality of photometry of the brightest ones is always better than that of the dimmer ones, even though all of them are frequently equally interesting for astronomers. Thus, measuring all objects with the highest possible precision is desirable. In this paper, we present a new optimization algorithm, dedicated for the division of exposure time into sub-exposures, which enables photometry with a more balanced noise budget. The proposed technique increases the photometric precision of dimmer objects at the expense of the measurement fidelity of the brightest ones. We have tested the method on real observations using two telescope setups, demonstrating its usefulness and good consistency with theoretical expectations. The main application of our approach is a wide range of sky surveys, including ones performed by space telescopes. The method can be used to plan virtually any photometric observation of objects that show a wide range of magnitudes.

  9. Design time optimization for hardware watermarking protection of HDL designs.

    Science.gov (United States)

    Castillo, E; Morales, D P; García, A; Parrilla, L; Todorovich, E; Meyer-Baese, U

    2015-01-01

    HDL-level design offers important advantages for the application of watermarking to IP cores, but its complexity also requires tools automating these watermarking algorithms. A new tool for signature distribution through combinational logic is proposed in this work. IPP@HDL, a previously proposed high-level watermarking technique, has been employed for evaluating the tool. IPP@HDL relies on spreading the bits of a digital signature at the HDL design level using combinational logic included within the original system. The development of this new tool for the signature distribution has not only extended and eased the applicability of this IPP technique, but it has also improved the signature hosting process itself. Three algorithms were studied in order to develop this automated tool. The selection of a cost function determines the best hosting solutions in terms of area and performance penalties on the IP core to protect. An 1D-DWT core and MD5 and SHA1 digital signatures were used in order to illustrate the benefits of the new tool and its optimization related to the extraction logic resources. Among the proposed algorithms, the alternative based on simulated annealing reduces the additional resources while maintaining an acceptable computation time and also saving designer effort and time.

  10. Multibeam Satellite Frequency/Time Duality Study and Capacity Optimization

    CERN Document Server

    Lei, Jiang

    2011-01-01

    In this paper, we investigate two new candidate transmission schemes, Non-Orthogonal Frequency Reuse (NOFR) and Beam-Hoping (BH). They operate in different domains (frequency and time/space, respectively), and we want to know which domain shows overall best performance. We propose a novel formulation of the Signal-to-Interference plus Noise Ratio (SINR) which allows us to prove the frequency/time duality of these schemes. Further, we propose two novel capacity optimization approaches assuming per-beam SINR constraints in order to use the satellite resources (e.g. power and bandwidth) more efficiently. Moreover, we develop a general methodology to include technological constraints due to realistic implementations, and obtain the main factors that prevent the two technologies dual of each other in practice, and formulate the technological gap between them. The Shannon capacity (upper bound) and current state-of-the-art coding and modulations are analyzed in order to quantify the gap and to evaluate the performa...

  11. Windows Vista Administrator's Pocket Guide

    CERN Document Server

    Stanek, William R

    2007-01-01

    Portable and precise, this pocket-sized guide delivers immediate answers for the day-to-day administration of Windows Vista. Zero in on core support and maintenance tasks using quick-reference tables, instructions, and lists. You'll get the precise information you need to solve problems and get the job done-whether you're at your desk or in the field! Get fast facts to: Install and configure Windows Vista-and optimize the user workspaceMaintain operating system components, hardware devices, and driversCreate user and group accounts-and control rights and permissionsAdminister group policy se

  12. Active control of time-varying broadband noise and vibrations using a sliding-window Kalman filter

    NARCIS (Netherlands)

    van Ophem, S.; Berkhoff, Arthur P.; Sas, P; Moens, D.; Denayer, H.

    2014-01-01

    Recently, a multiple-input/multiple-output Kalman filter technique was presented to control time-varying broadband noise and vibrations. By describing the feed-forward broadband active noise control problem in terms of a state estimation problem it was possible to achieve a faster rate of

  13. A Fast Topological Trigger for Real Time Analysis of Nanosecond Phenomena; Opening the Gamma Ray Window to Our Universe

    Energy Technology Data Exchange (ETDEWEB)

    Krennrich, Frank [Iowa State University

    2013-09-24

    This work was to enable the development of a proof-of-principle nanosecond trigger system that is designed to perform a real time analysis of fast Cherenkov light flashes from air showers. The basic building blocks of the trigger system have been designed and constructed, and a real world system is now operating in the VERITAS experiment.

  14. Kepler and K2 Light Curves of Active Galaxies: Optical Time Domain Windows into the Central Engine

    Science.gov (United States)

    Smith, Krista Lynne; Mushotzky, Richard; Boyd, Patricia T.; Howell, Steve B.; Gehrels, Neil; Gelino, Dawn M.

    2017-01-01

    We have used the Kepler spacecraft, the most precise photometer ever built, to measure aperiodic variability in active galactic nuclei. Kepler's high cadence and even sampling make it an exquisite instrument for astrophysics far beyond exoplanets, especially in the study of active galactic nuclei, which have long been known for their strong optical variability. Because of the very small size of accretion disks, this variability provides the only direct probe of their interior physics. In order to find AGN for study with the Kepler and K2 missions, we have conducted an X-ray survey of the Kepler and K2 fields of view with the Swift XRT, locating hundreds of new AGN that sample a wide parameter space in black hole mass and accretion rate. This survey also yielded an abundant sample of X-ray bright variable stellar targets. We then built a custom pipeline to handle Kepler light curves of extended objects (the AGN host galaxies) with stochastic variability. This was necessary, since the default Kepler pipeline was not optimized for such objects. Power spectral density (PSD) analysis of the AGN light curves exhibit characteristic timescales on the order of 2.5 days to 80 days, consistent with the physical timescales believed to be important in the disk. Optical spectral follow-up of the full sample enables comparison with physical parameters such as black hole mass, Eddington ratio and bolometric luminosity. The black hole mass relationship with characteristic timescale is consistent with an extrapolation of the relationship seen in stellar mass black holes, implying accretion similarities across many orders of magnitude. One object hosts a strong candidate for an optical quasi-periodic oscillation (QPO), the characteristic frequency of which correctly predicts the measured single-epoch black hole mass. The sample also contains bimodal flux distributions, which may indicate accretion states. Many of the high-frequency power spectral density (PSD) slopes are generally

  15. On selection of the optimal data time interval for real-time hydrological forecasting

    Directory of Open Access Journals (Sweden)

    J. Liu

    2013-09-01

    Full Text Available With the advancement in modern telemetry and communication technologies, hydrological data can be collected with an increasingly higher sampling rate. An important issue deserving attention from the hydrological community is which suitable time interval of the model input data should be chosen in hydrological forecasting. Such a problem has long been recognised in the control engineering community but is a largely ignored topic in operational applications of hydrological forecasting. In this study, the intrinsic properties of rainfall–runoff data with different time intervals are first investigated from the perspectives of the sampling theorem and the information loss using the discrete wavelet transform tool. It is found that rainfall signals with very high sampling rates may not always improve the accuracy of rainfall–runoff modelling due to the catchment low-pass-filtering effect. To further investigate the impact of a data time interval in real-time forecasting, a real-time forecasting system is constructed by incorporating the probability distributed model (PDM with a real-time updating scheme, the autoregressive moving-average (ARMA model. Case studies are then carried out on four UK catchments with different concentration times for real-time flow forecasting using data with different time intervals of 15, 30, 45, 60, 90 and 120 min. A positive relation is found between the forecast lead time and the optimal choice of the data time interval, which is also highly dependent on the catchment concentration time. Finally, based on the conclusions from the case studies, a hypothetical pattern is proposed in three-dimensional coordinates to describe the general impact of the data time interval and to provide implications of the selection of the optimal time interval in real-time hydrological forecasting. Although nowadays most operational hydrological systems still have low data sampling rates (daily or hourly, the future is that higher

  16. On selection of the optimal data time interval for real-time hydrological forecasting

    Directory of Open Access Journals (Sweden)

    J. Liu

    2012-09-01

    Full Text Available With the advancement in modern telemetry and communication technologies, hydrological data can be collected with an increasingly higher sampling rate. An important issue deserving attention from the hydrological community is what suitable time interval of the model input data should be chosen in hydrological forecasting. Such a problem has long been recognised in the control engineering community but is a largely ignored topic in operational applications of hydrological forecasting. In this study, the intrinsic properties of rainfall-runoff data with different time intervals are first investigated from the perspectives of the sampling theorem and the information loss using the discrete wavelet decomposition tool. It is found that rainfall signals with very high sampling rates may not always improve the accuracy of rainfall-runoff modelling due to the catchment low-pass filtering effect. To further investigate the impact of data time interval in real-time forecasting, a real-time forecasting system is constructed by incorporating the Probability Distributed Model (PDM with a real-time updating scheme, the autoregressive-moving average (ARMA model. Case studies are then carried out on four UK catchments with different concentration times for real-time flow forecasting using data with different time intervals of 15 min, 30 min, 45 min, 60 min, 90 min and 120 min. A positive relation is found between the forecast lead time and the optimal choice of the data time interval, which is also highly dependent on the catchment concentration time. Finally, based on the conclusions from the case studies, a hypothetical pattern is proposed in three-dimensional coordinates to describe the general impact of the data time interval and to provide implications on the selection of the optimal time interval in real-time hydrological forecasting. Although nowadays most operational hydrological systems still have low data sampling rates (daily or hourly, the trend in

  17. Cache Timing Attack on RSA Sliding Window Algorithm%针对RSA滑动窗口算法的Cache计时攻击

    Institute of Scientific and Technical Information of China (English)

    田军舰; 寇应展; 陈财森; 高靖哲; 曾剑隽

    2011-01-01

    Based on researching RSA signature algorithm and theory of cache timing attack, analyzing the implementation of RSA in OpenSSL0.9.8a, a caching timing attack method is given against the process of accessing initial table in the sliding windows algorithm. Simulation result demonstrates the cache timing attack can get more than 700 bit secret key from 1 024 bit private key and needs less samples compare to the timing attack based on statistic analysis.%研究RSA签名算法和Cache计时攻击原理,分析OpenSSL0.9.8a中的RSA实现过程,针对RSA滑动窗口算法中的访问初始化表操作,提出一种Cache计时攻击方法.实验结果表明,该方法在1次攻击中可获得1 024 bit密钥中700 bit以上的密钥,与传统基于统计方法的计时攻击相比,所需样本更少.

  18. A review of electrochromic window performance factors

    Energy Technology Data Exchange (ETDEWEB)

    Selkowitz, S.E.; Rubin, M.; Lee, E.S.; Sullivan, R.; Finlayson, E.; Hopkins, D.

    1994-04-01

    The performance factors which will influence the market acceptance of electrochromic windows are reviewed. A set of data representing the optical properties of existing and foreseeable electrochromic window devices was generated. The issue of reflective versus absorbing electrochromics was explored. This data was used in the DOE 2.1 building energy model to calculate the expected energy savings compared to conventional glazings. The effects of several different control strategies were tested. Significant energy and peak electric demand benefits were obtained for some electrochromic types. Use of predictive control algorithms to optimize cooling control may result in greater energy savings. Initial economic results considering annual savings, cooling equipment cost savings, and electrochromic window costs are presented. Calculations of thermal and visual comfort show additional benefits from electrochromics but more work is needed to quantify their importance. The design freedom and aesthetic possibilities of these dynamic glazings should provide additional market benefits, but their impact is difficult to assess at this time. Ultimately, a full assessment of the market viability of electrochromics must consider the impacts of all of these issues.

  19. Windows 10 simplified

    CERN Document Server

    McFedries, Paul

    2015-01-01

    Learn Windows 10 quickly and painlessly with this beginner's guide Windows 10 Simplified is your absolute beginner's guide to the ins and outs of Windows. Fully updated to cover Windows 10, this highly visual guide covers all the new features in addition to the basics, giving you a one-stop resource for complete Windows 10 mastery. Every page features step-by-step screen shots and plain-English instructions that walk you through everything you need to know, no matter how new you are to Windows. You'll master the basics as you learn how to navigate the user interface, work with files, create

  20. Transparent aerogel Windows

    DEFF Research Database (Denmark)

    Jensen, Karsten Ingerslev; Schultz, Jørgen Munthe

    In a recent EU FP5 project, monolithic silica aerogel was further developed with respect to the production process at pilot-scale, its properties and the application as transparent insulation material in highly insulating and transparent windows. The aerogel production process has been optimised...... the supercritical washing step included in the drying phase. At the same time the production plant have been modified to recycle most of the chemicals involved in the production process. A large number of aerogel glazing prototypes have been made with partly evacuated aerogel in between two layers of low iron...