This work is concerned with the algorithmic reachability analysis of continuous-time linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of ...
详细信息
This work is concerned with the algorithmic reachability analysis of continuous-time linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of states reachable on a bounded time interval. The main contribution over previous works is that it allows us to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We actually compute two over-approximations of the reachable set. The first one is given by the union of convex sets with computable support functions. As the representation of convex sets by their support function is not suitable for some tasks, we derive from this first over-approximation a second one given by the union of polyhedrons. The overall computational complexity of our approach is comparable to the complexity of the most competitive available specialized algorithms for reachability analysis of linear systems using zonotopes or ellipsoids. The effectiveness of our approach is demonstrated on several examples. (C) 2009 Elsevier Ltd. All rights reserved.
In this paper a vector optimization problem (VOP) is considered where each component of objective and constraint function involves a term containing support function of a compact convex set. Weak and strong Kuhn-Tucke...
详细信息
In this paper a vector optimization problem (VOP) is considered where each component of objective and constraint function involves a term containing support function of a compact convex set. Weak and strong Kuhn-Tucker necessary optimality conditions for the problem are obtained under suitable constraint qualifications. Necessary and sufficient conditions are proved for a critical point to be a weak efficient or an efficient solution of the problem (VOP) assuming that the functions belong to different classes of pseudoinvex functions. Two Mond Weir type dual problems are considered for (VOP) and duality results are established.
In this article, we have introduced a new class of higher-order (KxQ)-F-type I functions. Further, we have formulated two higher-order dual models, Wolfe and Schaible type, for a multiobjective fractional programming ...
详细信息
In this article, we have introduced a new class of higher-order (KxQ)-F-type I functions. Further, we have formulated two higher-order dual models, Wolfe and Schaible type, for a multiobjective fractional programming problem over arbitrary cones and proved appropriate duality relations under the higher-order (KxQ)-F-type I assumption. Nontrivial examples are also discussed to validate the weak duality results obtained in the paper.
BackgroundEffective surveillance and response systems are vital to achievement of disease control and elimination goals. Kenya adopted the revised guidelines of the integrated disease surveillance and response system ...
详细信息
BackgroundEffective surveillance and response systems are vital to achievement of disease control and elimination goals. Kenya adopted the revised guidelines of the integrated disease surveillance and response system in 2012. Previous assessments of surveillance system core and support functions in Africa are limited to notifiable diseases with minimal attention given to neglected tropical diseases amenable to preventive chemotherapy (PC-NTDs). The study aimed to assess surveillance system core and support functions relating to PC-NTDs in *** mixed method cross-sectional survey was adapted involving 192 health facility workers, 50 community-level health workers and 44 sub-national level health personnel. Data was collected using modified World Health Organization generic questionnaires, observation checklists and interview schedules. Descriptive summaries, tests of associations using Pearson's Chi-square or Fisher's exact tests and mixed effects regression models were used to analyse quantitative data. Qualitative data derived from interviews with study participants were coded and analysed *** core and support functions in relation to PC-NTDs were assessed in comparison to an indicator performance target of 80%. Optimal performance reported on specimen handling (84%;100%), reports submission (100%;100%) and data analysis (84%;80%) at the sub-county and county levels respectively. Facilities achieved the threshold on reports submission (84%), reporting deadlines (88%) and feedback (80%). However, low performance reported on case definitions availability (60%), case registers (19%), functional laboratories (52%) and data analysis (58%). Having well-equipped laboratories (3.07, 95% CI: 1.36, 6.94), PC-NTDs provision in reporting forms (3.20, 95% CI: 1.44, 7.10) and surveillance training (4.15, 95% CI: 2.30, 7.48) were associated with higher odds of functional surveillance systems. Challenges facing surveillance activities impleme
In this paper a new class of higher order (F, rho, sigma)-type I functions for a multiobjective programming problem is introduced, which subsumes several known studied classes. Higher order Mond-Weir and Schaible type...
详细信息
In this paper a new class of higher order (F, rho, sigma)-type I functions for a multiobjective programming problem is introduced, which subsumes several known studied classes. Higher order Mond-Weir and Schaible type dual programs are formulated for a nondifferentiable multiobjective fractional programming problem where the objective functions and the constraints contain support functions of compact convex sets in R-n. Weak and strong duality results are studied in both the cases assuming the involved functions to be higher order (F, rho, sigma)-type I. A number of previously studied problems appear as special cases. (C) 2008 Elsevier Inc. All rights reserved.
This paper addresses the problem of computation of reachable sets or tubes for uncertain linear time invariant systems. Outer-approximations are frequently used for verification or control synthesis. However, inner-ap...
详细信息
ISBN:
(纸本)9789463842365
This paper addresses the problem of computation of reachable sets or tubes for uncertain linear time invariant systems. Outer-approximations are frequently used for verification or control synthesis. However, inner-approximations have received less attention. In this paper, we present a method to obtain inner-approximations of reachable tubes based on Minkowski erosion and intersection operators, computed by means of support functions. The benefit of the proposed algorithm is assessed on a 5D example.
This study examines the content of developmental networks from the perspective of self-determination theory. We qualitatively examine 18 proteges constellations of developmental relationships to identify specific type...
详细信息
This study examines the content of developmental networks from the perspective of self-determination theory. We qualitatively examine 18 proteges constellations of developmental relationships to identify specific types of developmental support functions. Our study shows that the adoption of self-determination theory leads to a theory-based classification of support functions. The results show the manner in which developmental relationships meet proteges' needs for autonomy, competence, and relatedness. Proteges identified the importance of their developer's need-supportive functions to their success, including creating freedom, encouraging self-initiation (autonomy), emulating effective behaviors, confirming and praising (competence), and intimacy and self-disclosure (relatedness). Implications of the findings and suggestions for future research are presented. (C) 2012 Elsevier Inc. All rights reserved.
In this paper a new class of higher order (F, rho, sigma)- type I functions over cones are defined for a multiobjective programming problem, which subsumes several known studied classes. A higher order Mond-Weir type ...
详细信息
In this paper a new class of higher order (F, rho, sigma)- type I functions over cones are defined for a multiobjective programming problem, which subsumes several known studied classes. A higher order Mond-Weir type dual program is formulated for a non-differentiable multiobjective programming problem over cones where the objective functions and the constraints contain support functions of compact convex sets in R-n. Weak and strong duality results are established by using the above defined functions.
Let f:Sn-1 → ℝ be a support function. Then, for every a ∈ ℝ, if the function u →f(u)-〈a, u〉 has a negative minimum, then a unique argument exists for which this minimum is attained. It is shown that the converse ...
详细信息
This work is concerned with the algorithmic reachability analysis of linear systems with constrained initial states and inputs. In this paper, we present a new approach for the computation of tight polyhedral over-app...
详细信息
This work is concerned with the algorithmic reachability analysis of linear systems with constrained initial states and inputs. In this paper, we present a new approach for the computation of tight polyhedral over-approximations of the reachable sets of a linear system. The main contribution over our previous work is that it makes it possible to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We first consider the discrete-time setting and then we show how our algorithm can be extended to handle continuous-time linear systems. Finally, the effectiveness of our approach is demonstrated through several examples.
暂无评论