A fractional Hamilton Jacobi Bellman equation for scaled limits of controlled Continuous Time Random Walks
In this article we study a controlled Continuous Time Random Walk and its position-dependent extensions. We heuristically derive the optimal payoff function equations for their scaling limits. The general equation for the corresponding optimal payoff of the limiting process may be called a fractional Hamilton Jacobi Bellman equation.
In this article I examine the situation of girls in the North Caucasus, a region that combines features of both a traditional society with its emphasis on the value of religion, family, and older generations, and a modernized society with its emphasis on the economic emancipation of women, and the pursuit of self-development and individual life strategies. The research model used interviews with girls and an analysis of essays written by girls in high school to explore their life values, priorities, and the impact of religion and traditions on their lives. The research also sought to identify girls place in the gender, age, and status hierarchies of local societies. © Berghahn Journals.
The application of neural networks for prediction of long-term changes of observed parameter on the example of thermal treatment control of concrete products is considered. Experimental results are presented, and the algorithm of the work plan of an actuating mechanism is proposed.
The article analyzes the technological shifts which took place in the second half of the 20th and early 21st centuries and forecasts the main shifts in the next half a century. On the basis of the analysis of the latest achievements in innovative technological directions and also on the basis of the opportunities provided by the theory of production revolutions the authors present a detailed analysis of the latest production revolution which is denoted as ‘Сybernetic’. The authors give some forecasts about its development in the nearest five decades and up to the end of the 21st century. It is shown that the development of various self-regulating systems will be the main trend of this revolution. The authors argue that at first the transition to the beginning of the final phase of the Cybernetic Revolution will start in the field of medicine (in its some innovative directions). In future we will deal with the start of convergence of innovative technologies which will form the system of MBNRIC-technologies (i.e. the technological paradigm based on medicine, bio- and nanotechnologies, robotics, IT and cognitive technologies). The article gives a detailed analysis of the future breakthroughs in medicine, bio- and nanotechnologies as well as some other technologies in terms of the development of self-regulating systems with their growing ability to select optimum modes of functioning as well as of other characteristics of the Cybernetic Revolution (resources and energy saving, miniaturization, individualization, etc.).
The Working Paper examines the peculiarities of the Russian model of corporate governance and control in the banking sector. The study relies upon theoretical as well as applied research of corporate governance in Russian commercial banks featuring different forms of ownership. We focus on real interests of all stakeholders, namely bank and stock market regulators, bank owners, investors, top managers and other insiders. The Anglo-American concept of corporate governance, based on agency theory and implying outside investors’ control over banks through stock market, is found to bear limited relevance. We suggest some ways of overcoming the gap between formal institutions of governance and the real life.
Soft Computing (SC) is a consortium of fuzzy logic (FL), neurocomputing (NC), evolutionary computing (EC), probabilistic computing (PC), chaotic computing (CC) and parts of machine learning theory (ML). SC is the foundation for computational intelligence and is leading to the development of numerous hybrid intelligent information, control and decision-making systems. The methodology of computing with words (CW) is an important event in the evolution of cognitive science, natural language processing, artificial intelligence, and different existing scientific theories. This is because CW can enrich the existing scientific theories and the above-mentioned science fields giving them the capability of using natural languages to operate on perception-based information, not only measurement-based information. Indeed in many real-world problems in natural sciences as well as in industrial engineering, economics, and business, often there is a need to deal with both perception and measurement based information. In the case of perception based information, the available information is not precise enough to justify the use of numbers. Such information is usually described in natural languages rather than in strict (idealized) mathematical expressions. So a strong need has appeared for a new approach, theory and technology for the development of knowledge representation, computing, and reasoning tools that allow creation of systems with high MIQ. The sessions of the ICSCCW-2011 will focus on the development and application of Soft Computing technology and computing with words paradigm in system analysis, decision and control.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
The International Conference on Computers Communications and Control (ICCCC) has been founded in 2006 by I. Dzitac, F.G. Filip and M.-J. Manolescu and organized every even year by Agora University of Oradea, under the aegis of the Information Science and Technology Section of Romanian Academy and IEEE - Romania Section. 2016 edition is Co-Sponsored by IEEE Region 8 - Europe, Middle East, Africa. The goal of this conference is to bring together international researchers, scientists in academia and industry to present and discuss in a friendly environment their latest research findings on a broad array of topics in computer networking and control.
In this paper we consider the behavior of Kalman Filter state estimates in the case of distribution with heavy tails .The simulated linear state space models with Gaussian measurement noises were used. Gaussian noises in state equation are replaced by components with alpha-stable distribution with different parameters alpha and beta. We consider the case when "all parameters are known" and two methods of parameters estimation are compared: the maximum likelihood estimator (MLE) and the expectation- maximization algorithm (EM). It was shown that in cases of large deviation from Gaussian distribution the total error of states estimation rises dramatically. We conjecture that it can be explained by underestimation of the state equation noises covariance matrix that can be taken into account through the EM parameters estimation and ignored in the case of ML estimation.
The article examines the problems of delegation of public powers of authority to self-regulated organizations: public powers of authority which may be delegated, spheres of state administration, where delegation of powers is not allowed, validity of control over realization of delegated powers in all cases of such delegation and responsibility of the state for the acts of private persons who exercise public powers of authority.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.