نتایج جستجو برای: fixed time plan
تعداد نتایج: 2115790 فیلتر نتایج به سال:
Evidence from recent studies bolsters the idea of preestablished motor plans in scanning isolated items. Thus, refixation saccades are preplanned at the same time as the primary saccade directed to a peripheral item and are completed with fixed amplitudes irrespective of the first fixation position in the item. In order to examine the saccadic system's ability to correct the motor plan during i...
To determine whether the investment decisions of institutional plan sponsors contribute to their asset values, this study used a dataset of 80,000 yearly observations of institutional investment product assets, accounts, and returns for 19842007. Results show that plan sponsors may not be acting in their stakeholders’ best interests when they make rebalancing or reallocation decisions. Investm...
This paper investigates the global stability and the global asymptotic stability independent of the sizes of the delays of linear time-varying Caputo fractional dynamic systems of real fractional order possessing internal point delays. The investigation is performed via fixed point theory in a complete metric space by defining appropriate nonexpansive or contractive self-mappings from initial c...
We consider a second order three point boundary value problem for dynamic equations on time scales and establish criteria for the existence of at least two positive solutions of an eigenvalue problem by an application of a fixed point theorem in cones. Existence result for non-eigenvalue problem is also given by the monotone method.
We study the existence of positive solutions to the p-Laplacian dynamic equations (g(u∆(t)))∇+a(t)f(t, u(t)) = 0 for t ∈ [0, T ]T satisfying either the boundary condition u(0) − B0(u(0)) = 0, u(T ) = 0 or u(0) = 0, u(T ) + B1(u(T )) = 0, where g(ν) = |ν|p−2 ν with p > 1. By using a new five functionals fixed-point theorem due to Avery, we prove that the boundary value problems has at least thre...
We propose a method to plan the number of occasions of recapture experiments for population size estimation. We do so by fixing the smallest number of capture occasions so that the expected length of the profile confidence interval is less than or equal to a fixed threshold. In some cases, we solve the optimization problem in closed form. For more complex models we use numerical optimization. W...
For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This report describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The spec...
We present in this paper a hybrid planning systemwhich combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its own consistency rules and filtering and decomposition mechanisms suitable for planning. Given a fixed bound on the plan length, our planner works directly on a structure related to Graphplan’s planning graph. This struc...
Submit Manuscript | http://medcraveonline.com Abbreviations: TB: Tuberculosis; NTP: National Tuberculosis Control Program; DOTS: Directly Observed Treatment ShortCourse; DOH: Department of Health; SDF: Single Drug Formulation, FDC: Fixed Dose Combination; MDG: Millennium Development Goals; UN: United Nations; WHO: World Health Organization; NTPS: National Tuberculosis Prevalence Study; NCDPC: N...
Our paper investigates complex modified function projective lag synchronization with fixed-time stability guarantees for hyperchaotic systems via a FxTC proposal. The of and the desired performance are definitely guaranteed within period bounded time. interval can be predefined without demanding information initial conditions from where is performed. Furthermore, control scheme achieved accordi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید