59 research outputs found
A dictionary of Sango
No full textCreated by Charles R. Taber (author) & W. J. Samarin (project director: field work collection and preparation of data).This dictionary is intended to be a companion volume to the one entitled A Grammar of Sango,* which was written in 1963 by William J. Samarin. Since the Sango language and its use are described at some length in the Grammar (i-iii), nothing further will be said in this volume
Tractable Reserve Scheduling Formulations for Alternating Current Power Grids with Uncertain Generation
No full textThe increasing penetration of wind power generation introduces uncertainty in the behaviour of electric power grids. This work is concerned with the problem of day-ahead reserve scheduling (RS) for power systems with high levels of wind power penetration, and proposes a novel set-up that incorporates an alternating current (AC) Optimal Power Flow (OPF) formulation. The OPF-RS problem is non-convex and in general hard to solve. Using a convex relaxation technique, we focus on systems with uncertain generation and formulate a chance-constrained optimization problem to determine the minimum cost of production and reserves. Following a randomization technique, we approximate the chance constraints and provide a-priori feasibility guarantees in a probabilistic sense. However, the resulting problem is computationally intractable, due to the fact that the computation time complexity grows polynomially with respect to the size of the power network and scheduling horizon. In this thesis, we first use the so-called scenario approach to approximate a convex set which contains almost surely the probability mass distribution of underlying random events. We rely on the special property of reserve scheduling problems which leads to linear constraint functions with respect to the uncertain parameters. We can therefore formulate a robust problem for only the vertices of the approximated set. Using the proposed approach, the number of scenarios is reduced significantly which is beneficial for the tractability. Such a formulation requires the power network state to only be feasible for all vertices of the convex approximated set. To even further relax such a requirement, we develop a novel RS formulation by considering the network state as a non-linear parametrization function of the uncertainty. By using a conic combination of matrices, only three positive semidefinite constraints per time step are considered. Unlike existing works in RS, our proposed parametrization has a practical meaning and is directly related to the distribution of reserve power. Such a reformulation yields a reduction in computational complexity of OPF-RS problems. Finally, we extend our results to a more realistic size of power grids, using sparsity pattern and spatiality (multi-area) decomposition of the power networks, leading to a decomposed semidefinite programming (SDP) problem. To solve the SDP in a distributed setting, we formulate a distributed consensus optimization problem, and then the alternating direction method of multipliers (ADMM) algorithm is employed to coordinate local OPF-RS problems between neighbouring areas. The theoretical developments in aforementioned cases were validated on a realistic benchmark system and a discussion on the tractability of the resulting optimization problems by means of computational time analysis is presented.Mechanical, Maritime and Materials EngineeringDelft Center for Systems and Control (DCSC
THE HOLY SYNODANDTHE ECCLESIOLOGY OF THE FIRST SLAVOPHILES: ALEKSEI KHOMYAKOV AND JURIJ SAMARIN
No full textThe teaching of the slavophiles regarding the concept of communion or sobornost’ of the church is in some ways a sort of trademark of Russian theological thought. In its fi nal form, it seems to be very critical of the synodal tradition. However, a closer look at its origin and development reveals that the synodal reform and tradition itself provided the impetus and ecclesiastical background for the entire conception of the theory of sobornost
Tractable Stochastic Model Predictive Control using Conditional Value at Risk Optimization
No full textA numerically tractable Stochastic Model Predictive Control (SMPC) strategy using Conditional Value at Risk (CVaR) optimization for discrete-time linear time-invariant systems, with state and input constraints, subject to additive uncertainty, is presented. SMPC strategies make use of the probabilistic description of uncertainty to define chance constraints which allow a certain admissible level of constraint violation. SMPC strategies require the initial state of a system to be within a particular set, referred to as feasibility set, probabilistically, such that the derived control input, when applied to the system, gives rise to states that are also within the feasibility set satisfying all chance constraints on the system. This leads to recursive feasibility of the SMPC strategy. Such strategies are restrictive in nature when the uncertainty in the system is unbounded, as in the case of White Gaussian noise. In such a case, the feasibility set is very small and leads to a strategy that is very conservative. To reduce this conservatism, some constraint violations are permitted. However, such violations affect the closed-loop behaviour of the system leading to performance degradation. This performance degradation can be quantified as a penalty on the system for violating constraints, and intuitively, it can be thought of as a risk taken by the system in that undesirable state. An approach following the exact penalty method is proposed using the CVaR function to determine the penalty cost. The same optimal solution as the original constrained problem is obtained from a single unconstrained minimization. Since accurate computation of the expected value of risk using the CVaR function is not possible, a scenario-based approximation of the CVaR is used to obtain an overall tractable and computationally efficient SMPC strategy. An extensive simulation study of the double integrator system is provided to present the functionality of the proposed method.Electrical Engineerin
PREPARATION OF EDUCATIONAL CENTRE OFFICERS INTERPERSONALCO-OPERATION OF CONSCRIPTION SERVICEMEN
No full textModern tendencies of understanding the problem of military personnel preparation in educational modernization are considered in this article. The practical meaning of applying the preparation program for interpersonal cooperation is claimed.
Purpose. The article is devoted to actual educational state policy and focused on applying modern pedagogical technologies in educational process including military servicemen preparation for interpersonal cooperation in education.
Methodology. The research is based on comparative analysis, synthesis and objectivity.
Results. The author analyses the essence of the concept of interpersonal co-operation exposed by both Russian and foreign scholars and psychologists, emphasizes systematic approach and suggests realizing it in an educational organization by making servicemen preparation programs that have social and practical value.
Practical implications. Research results can be applied in the field of military and psychological and pedagogical education
- …
