In this paper, from a cybernetic perspective, the human-nature interactions are considered in the context of modern climate change, unprecedented in its scale and rate caused by anthropogenic activity. The developed structure of the “climate-economy” cybernetic system is presented, the weaknesses of the global governance bodies are analysed, and the main causes of the uncertainties in assessing climate change and the economic damage caused by this change are discussed. It is noted that adaptation measures and strategies developed and implemented by governments of different countries and intergovernmental organizations do not eliminate the causes of global warming and, therefore, have limited capacities, since humans and nature can exist only under specified environmental conditions. Going beyond these conditions, due to climate change, can lead to a global biological catastrophe. Climate policy decisions are made under uncertainty due to the ambiguity of estimates of the future climate, which, in turn, is the result of an insufficiently adequate description of feedbacks in the climate system models. Using low-parametric models of the Earth's climate system, the influence of system’s feedbacks on tangible inter-model differences of climate change estimates obtained using modern climate models of a high degree of complexity is illustrated. Since the climate change adaptation measures proposed by experts are not the struggle with causes, but the fight with consequences, we see geoengineering as a radical adaptation strategy. In contrast to previous studies, we consider the problem of purposefully modifying climatic conditions, implemented by geoengineering methods, within the framework of optimal control theory with mathematical formalization of geoengineering objectives and methods for achieving them. In this paper, an example of the formulation and solution of the optimization problem for stabilizing the Earth’s climate through the injection of finely dispersed sulfate aerosol into the stratosphere is presented.
{"title":"Cybernetic Approach to Problem of Interaction Between Nature and Human Sosiety in Context of Unprecedented Climate Change","authors":"S. Soldatenko, R. Yusupov, R. Colman","doi":"10.15622/sp.2020.19.1.1","DOIUrl":"https://doi.org/10.15622/sp.2020.19.1.1","url":null,"abstract":"In this paper, from a cybernetic perspective, the human-nature interactions are considered in the context of modern climate change, unprecedented in its scale and rate caused by anthropogenic activity. The developed structure of the “climate-economy” cybernetic system is presented, the weaknesses of the global governance bodies are analysed, and the main causes of the uncertainties in assessing climate change and the economic damage caused by this change are discussed. It is noted that adaptation measures and strategies developed and implemented by governments of different countries and intergovernmental organizations do not eliminate the causes of global warming and, therefore, have limited capacities, since humans and nature can exist only under specified environmental conditions. Going beyond these conditions, due to climate change, can lead to a global biological catastrophe. Climate policy decisions are made under uncertainty due to the ambiguity of estimates of the future climate, which, in turn, is the result of an insufficiently adequate description of feedbacks in the climate system models. Using low-parametric models of the Earth's climate system, the influence of system’s feedbacks on tangible inter-model differences of climate change estimates obtained using modern climate models of a high degree of complexity is illustrated. Since the climate change adaptation measures proposed by experts are not the struggle with causes, but the fight with consequences, we see geoengineering as a radical adaptation strategy. In contrast to previous studies, we consider the problem of purposefully modifying climatic conditions, implemented by geoengineering methods, within the framework of optimal control theory with mathematical formalization of geoengineering objectives and methods for achieving them. In this paper, an example of the formulation and solution of the optimization problem for stabilizing the Earth’s climate through the injection of finely dispersed sulfate aerosol into the stratosphere is presented.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"29 2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89023264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.4
N. Dudarenko, N. Vunder
The problem of a priory control of potential degeneration of continuous multichannel dynamic systems is considered in the paper. Degeneracy is a property of a system describing operability of a multichannel dynamic system together with the basic properties of stability, reliability and invariance to the changing conditions. An assessment of potential generation of a system and its configuration together with the interconnections and polynomial exogenous signal is proposed. Degeneration process of a multichannel dynamic systems is a process of the rank reducing of the linear operator of the system. This statement is a basic concept of the degeneration factors approach. Algebraic properties of the matrix of the system’s operator is considered, and the matrix is named as the criterion matrix. Degeneration factor is calculated with the singular values of the criterion matrix. The global degeneration factor is conditional number of the criterion matrix of a system. In contrast to previous solutions it is proposed to form the criterion matrix of a system with the resolvent of its state matrix. Deparameterization of the linear algebraic problem is realized by additive decomposition of the output vector of the system by derivatives of the exogenous signal, and the steady-state mode of the system is considered. The procedure of a priori estimation of degeneration of continuous multichannel dynamic systems is proposed. The ways to achieve the required value of degeneration of the criterion matrix of the system with the modal control methods are discussed. The paper is supported with examples.
{"title":"A Priori Estimation of Potential Degeneration of Continuous Multichannel Dynamic Systems","authors":"N. Dudarenko, N. Vunder","doi":"10.15622/10.15622/sp.2020.19.1.4","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.4","url":null,"abstract":"The problem of a priory control of potential degeneration of continuous multichannel dynamic systems is considered in the paper. Degeneracy is a property of a system describing operability of a multichannel dynamic system together with the basic properties of stability, reliability and invariance to the changing conditions. An assessment of potential generation of a system and its configuration together with the interconnections and polynomial exogenous signal is proposed. Degeneration process of a multichannel dynamic systems is a process of the rank reducing of the linear operator of the system. This statement is a basic concept of the degeneration factors approach. Algebraic properties of the matrix of the system’s operator is considered, and the matrix is named as the criterion matrix. Degeneration factor is calculated with the singular values of the criterion matrix. The global degeneration factor is conditional number of the criterion matrix of a system. In contrast to previous solutions it is proposed to form the criterion matrix of a system with the resolvent of its state matrix. Deparameterization of the linear algebraic problem is realized by additive decomposition of the output vector of the system by derivatives of the exogenous signal, and the steady-state mode of the system is considered. The procedure of a priori estimation of degeneration of continuous multichannel dynamic systems is proposed. The ways to achieve the required value of degeneration of the criterion matrix of the system with the modal control methods are discussed. The paper is supported with examples.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84383188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.8
D. Efanov, V. Khoroshev
A method for streamlining state partitioning procedures with two and three outcomes is considered. A terminology and methods of the questionnaire theory were used, and the sequence of partitioning procedures itself was defined as a heterogeneous questionnaire with questions having two or three answers. This class of questionnaires is special and is defined by the authors as a class of binary-ternary questionnaires. This is the simplest class of heterogeneous questionnaires. An increase in number of answers to a question in practice can give an advantage in parameters of the questionnaires, including in the indicator of its effectiveness – the average implementation cost. It is noted that the use of binary-ternary questionnaires in practice can reduce the average time for identifying events on a questionnaire, which is extremely important in those applications of questionnaires in which there is a time limit for identifying events, for example, in critical application systems. A method for optimizing binary-ternary questionnaires is presented, based on the search for the most preferred questions for each subset of identifiable events. The choice of preferred questions is based on establishing a comparison relationship between them. The article describes all possible types of comparison relations between two questions with two answers, two questions with three answers, and also between a question with two answers and a question with three answers. An example of obtaining a mathematical expression for a function that characterizes the preference of questions over each other, as well as a generalized formula for choosing the most preferred question for any heterogeneous questionnaires is given. An algorithm has been formed for the method of ordering questions, which allows one to construct a binary-ternary questionnaire with the lowest implementation cost in polynomial time. An example of a binary-ternary questionnaire optimization by the presented method is given.
{"title":"Method for Ordering Procedures of Dividing States by Procedures with Two and Three Results Taking into Account their Cost and Weight of States","authors":"D. Efanov, V. Khoroshev","doi":"10.15622/10.15622/sp.2020.19.1.8","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.8","url":null,"abstract":"A method for streamlining state partitioning procedures with two and three outcomes is considered. A terminology and methods of the questionnaire theory were used, and the sequence of partitioning procedures itself was defined as a heterogeneous questionnaire with questions having two or three answers. This class of questionnaires is special and is defined by the authors as a class of binary-ternary questionnaires. This is the simplest class of heterogeneous questionnaires. An increase in number of answers to a question in practice can give an advantage in parameters of the questionnaires, including in the indicator of its effectiveness – the average implementation cost. It is noted that the use of binary-ternary questionnaires in practice can reduce the average time for identifying events on a questionnaire, which is extremely important in those applications of questionnaires in which there is a time limit for identifying events, for example, in critical application systems. A method for optimizing binary-ternary questionnaires is presented, based on the search for the most preferred questions for each subset of identifiable events. The choice of preferred questions is based on establishing a comparison relationship between them. The article describes all possible types of comparison relations between two questions with two answers, two questions with three answers, and also between a question with two answers and a question with three answers. An example of obtaining a mathematical expression for a function that characterizes the preference of questions over each other, as well as a generalized formula for choosing the most preferred question for any heterogeneous questionnaires is given. An algorithm has been formed for the method of ordering questions, which allows one to construct a binary-ternary questionnaire with the lowest implementation cost in polynomial time. An example of a binary-ternary questionnaire optimization by the presented method is given.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"104 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89019307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.5
M. Peregudov, A. Steshkovoy
Currently, there is a great interest in digital radio network centralized elements synchronization with random multiple access to the CSMA/CA type , the effectiveness of which determines the process of establishing a communication session. At the same time, there was no assessment effectiveness digital radio communication network centralized elements synchronization with random multiple access to the CSMA/CA type. Also, there was no assessment made the contribution of potential destructive actions by the attacker to the reduction in the effectiveness of such synchronization. This paper presents digital radio networks centralized elements synchronization analytical model with random multiple access to the CSMA/CA type medium. In this model the theoretical resulting indicator is the probability of successful delivery of a synchronization package, and a package frequency of successful delivery is used in experimental indicator evaluation . The model takes into account the potential destructive effects of the attacker in analytical expressions for known probabilistic indicators. An digital radio network centralized elements synchronization with random multiple access to a CSMA/CA type experimental study an environment is also presented. The most common network of digital radio standard IEEE 802.11 (Wi-Fi) is considered as such network. The experimental research results differ from the theoretical research results slightly, which indicates the adequacy of the developed analytical model. It was established, firstly, that the successful delivery probability of a synchronization packet does not depend on number of subscriber terminals in digital radio communication networks, secondly, with an average duration of a data packet transmission by such terminal less than 0.85 ms, it is advisable to use non-random, and the reserved multiple access to the environment, and, thirdly, centralized synchronization is resistant to destructive influences. The model is applicable in the design of digital radio networks with random multiple access to the medium such as CSMA/CA, as well as in optimizing the operation of such networks.
{"title":"Digital Radio Networks Centralized Elements Synchronization Model with Random Multiple Access to the CSMA/CA Type Medium","authors":"M. Peregudov, A. Steshkovoy","doi":"10.15622/10.15622/sp.2020.19.1.5","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.5","url":null,"abstract":"Currently, there is a great interest in digital radio network centralized elements synchronization with random multiple access to the CSMA/CA type , the effectiveness of which determines the process of establishing a communication session. At the same time, there was no assessment effectiveness digital radio communication network centralized elements synchronization with random multiple access to the CSMA/CA type. Also, there was no assessment made the contribution of potential destructive actions by the attacker to the reduction in the effectiveness of such synchronization. This paper presents digital radio networks centralized elements synchronization analytical model with random multiple access to the CSMA/CA type medium. In this model the theoretical resulting indicator is the probability of successful delivery of a synchronization package, and a package frequency of successful delivery is used in experimental indicator evaluation . The model takes into account the potential destructive effects of the attacker in analytical expressions for known probabilistic indicators. An digital radio network centralized elements synchronization with random multiple access to a CSMA/CA type experimental study an environment is also presented. The most common network of digital radio standard IEEE 802.11 (Wi-Fi) is considered as such network. The experimental research results differ from the theoretical research results slightly, which indicates the adequacy of the developed analytical model. It was established, firstly, that the successful delivery probability of a synchronization packet does not depend on number of subscriber terminals in digital radio communication networks, secondly, with an average duration of a data packet transmission by such terminal less than 0.85 ms, it is advisable to use non-random, and the reserved multiple access to the environment, and, thirdly, centralized synchronization is resistant to destructive influences. The model is applicable in the design of digital radio networks with random multiple access to the medium such as CSMA/CA, as well as in optimizing the operation of such networks.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75524790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.6
O. Karsaev, I. Shuklin, S. Yushchenko
An approach to the dynamic formation (adjustment) of schedules for distributed photogrammetric image processing in a network of ground centers included in the United geographically distributed information system for receiving and processing Earth remote sensing data from space is considered. Having the fullest satisfaction of requirements of consumers to the satellite images of necessary areas, the approach provides the formation of self-organizing B2B enterprises in the specified network providing information, software and hardware resources of the ground-based facilities of various departmental and other accessories for photogrammetric processing of any received images of the area from the the United geographically distributed information system. It is shown, that a search in B2B enterprise nodes and borrowing the required resources will allow ground centers to flexibly scale physical and virtual means of photogrammetric processing of Earth remote sensing data, quickly form their local structural and functional organizations depending on the current properties of the consumer requests flow for receiving Earth remote sensing data in the United geographically distributed information system, characteristics of the flow of terrain survey materials from orbital monitoring tools, and also take into account the visual and measuring properties of images of the area subject to photogrammetric processing. A method for truncating the set of potential performers of the application in accordance with the existing semantic and other restrictions on the composition of the desired set of performers is proposed. Also mechanisms to encourage ground centers to provide idle resources to B2B enterprise nodes are proposed. They are based on the possibility of receiving monetary or other remuneration from a ground center for participating in distributed application servicing. The development of a well-known model of a self-organizing B2B enterprise creates conditions for a more efficient organization of servicing the flow of applications in the United geographically distributed information system by attracting unused software, information and hardware resources of ground centers of various departmental affiliations.
{"title":"Self-Organizing B2B Enterprise of Distributed Photogrammetric Processing of Terrain Images in ETRIS","authors":"O. Karsaev, I. Shuklin, S. Yushchenko","doi":"10.15622/10.15622/sp.2020.19.1.6","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.6","url":null,"abstract":"An approach to the dynamic formation (adjustment) of schedules for distributed photogrammetric image processing in a network of ground centers included in the United geographically distributed information system for receiving and processing Earth remote sensing data from space is considered. Having the fullest satisfaction of requirements of consumers to the satellite images of necessary areas, the approach provides the formation of self-organizing B2B enterprises in the specified network providing information, software and hardware resources of the ground-based facilities of various departmental and other accessories for photogrammetric processing of any received images of the area from the the United geographically distributed information system. It is shown, that a search in B2B enterprise nodes and borrowing the required resources will allow ground centers to flexibly scale physical and virtual means of photogrammetric processing of Earth remote sensing data, quickly form their local structural and functional organizations depending on the current properties of the consumer requests flow for receiving Earth remote sensing data in the United geographically distributed information system, characteristics of the flow of terrain survey materials from orbital monitoring tools, and also take into account the visual and measuring properties of images of the area subject to photogrammetric processing. A method for truncating the set of potential performers of the application in accordance with the existing semantic and other restrictions on the composition of the desired set of performers is proposed. Also mechanisms to encourage ground centers to provide idle resources to B2B enterprise nodes are proposed. They are based on the possibility of receiving monetary or other remuneration from a ground center for participating in distributed application servicing. The development of a well-known model of a self-organizing B2B enterprise creates conditions for a more efficient organization of servicing the flow of applications in the United geographically distributed information system by attracting unused software, information and hardware resources of ground centers of various departmental affiliations.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"136 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77363922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.3
A. Malyshev, E. Burgov
Using bioinspired models and methods is one of approaches for solving tasks of swarm robotics. In this paper one of such tasks, modeling of foraging, and it’s solving by creating analogues of social structures of ants and models of feeding behavior are considered. The most important characteristics of ants’ colonies for modeling were defined – individuals number in society and it’s structure, workers’ speed, a communication distance and working area size. Besides, existing experimental basis (a group of robots and a polygon) was estimated for a usage as a hardware platform for experiments. Several models of feeding behavior were considered: a model without foragers’ functions differentiation and a model with differentiation on active and passive ones. Active foragers look for resources by themselves, then they involve passive foragers; passive foragers are settled on a base, while are not involved in harvesting. A set of finite state machines describe the behavior of agents: basic automatons (provide basic behavior functions) and a meta- automaton, that switches with some conditions an execution of basic automatons. Basic movements were tested on experimental basis. A complex test of models were conducted in a simulation program Kvorum. An analogue of real polygon was made in the program. Modeling consists of series of experiments for every model in which agents must harvest resources. Series differ from each other by number of agents. For models’ quality estimation a ratio of received energy to average obtaining time. Experiments settle that model with functions differentiation works more effective.
{"title":"Revisiting Parameters of Bioinspired Behavior Models in Group Foraging Modeling","authors":"A. Malyshev, E. Burgov","doi":"10.15622/10.15622/sp.2020.19.1.3","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.3","url":null,"abstract":"Using bioinspired models and methods is one of approaches for solving tasks of swarm robotics. In this paper one of such tasks, modeling of foraging, and it’s solving by creating analogues of social structures of ants and models of feeding behavior are considered. The most important characteristics of ants’ colonies for modeling were defined – individuals number in society and it’s structure, workers’ speed, a communication distance and working area size. Besides, existing experimental basis (a group of robots and a polygon) was estimated for a usage as a hardware platform for experiments. Several models of feeding behavior were considered: a model without foragers’ functions differentiation and a model with differentiation on active and passive ones. Active foragers look for resources by themselves, then they involve passive foragers; passive foragers are settled on a base, while are not involved in harvesting. \u0000A set of finite state machines describe the behavior of agents: basic automatons (provide basic behavior functions) and a meta- automaton, that switches with some conditions an execution of basic automatons. Basic movements were tested on experimental basis. A complex test of models were conducted in a simulation program Kvorum. An analogue of real polygon was made in the program. Modeling consists of series of experiments for every model in which agents must harvest resources. Series differ from each other by number of agents. For models’ quality estimation a ratio of received energy to average obtaining time. Experiments settle that model with functions differentiation works more effective.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90088983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-07DOI: 10.15622/10.15622/sp.2020.19.1.7
V. Sobol, R. Torishnyi
In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. The main idea of the approximation is to replace the discontinuous Heaviside function in the integral representation of the probability function with a smooth function having such properties as continuity, smoothness, and easily computable derivatives. An example of such a function is the distribution function of a random variable distributed according to the logistic law with zero mean and finite dispersion, which is a sigmoid. The value inversely proportional to the root of the variance is a parameter that provides the proximity of the original function and its approximation. This replacement allows us to obtain a smooth approximation of the probability function, and for this approximation derivatives by the control vector and by other parameters of the problem can be easily found. The article proves the convergence of the probability function approximation obtained by replacing the Heaviside function with the sigmoidal function to the original probability function, and the error estimate of such approximation is obtained. Next, approximate expressions for the derivatives of the probability function by the control vector and the parameter of the function are obtained, their convergence to the true derivatives is proved under a number of conditions for the loss functional. Using known relations between derivatives of probability functions and quantile functions, approximate expressions for derivatives of quantile function by control vector and by the level of probability are obtained. Examples are considered to demonstrate the possibility of applying the proposed estimates to the solution of stochastic programming problems with criteria in the form of a probability function and a quantile function, including in the case of a multidimensional random variable.
{"title":"On smooth approximation of probabilistic criteria in stochastic programming problems","authors":"V. Sobol, R. Torishnyi","doi":"10.15622/10.15622/sp.2020.19.1.7","DOIUrl":"https://doi.org/10.15622/10.15622/sp.2020.19.1.7","url":null,"abstract":"In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. The main idea of the approximation is to replace the discontinuous Heaviside function in the integral representation of the probability function with a smooth function having such properties as continuity, smoothness, and easily computable derivatives. An example of such a function is the distribution function of a random variable distributed according to the logistic law with zero mean and finite dispersion, which is a sigmoid. The value inversely proportional to the root of the variance is a parameter that provides the proximity of the original function and its approximation. This replacement allows us to obtain a smooth approximation of the probability function, and for this approximation derivatives by the control vector and by other parameters of the problem can be easily found. The article proves the convergence of the probability function approximation obtained by replacing the Heaviside function with the sigmoidal function to the original probability function, and the error estimate of such approximation is obtained. Next, approximate expressions for the derivatives of the probability function by the control vector and the parameter of the function are obtained, their convergence to the true derivatives is proved under a number of conditions for the loss functional. Using known relations between derivatives of probability functions and quantile functions, approximate expressions for derivatives of quantile function by control vector and by the level of probability are obtained. Examples are considered to demonstrate the possibility of applying the proposed estimates to the solution of stochastic programming problems with criteria in the form of a probability function and a quantile function, including in the case of a multidimensional random variable. ","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83611186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-19DOI: 10.15622/sp.2019.18.5.1212-1238
I. Prisukhina, D. Borisenko, S. Lunev
Systems of interval control of train movement Signaling systems, which are currently in service in Russian railways, use the electric track circuit as the main data channel between signals and locomotives. Code-modulated electric signals transferred through that channel are frequently get corrupted which leads to railway traffic delays. Decoding of the electric signal received from a track circuit can be represented as an image classification problem, and thus the stability of the data channel could be significantly improved. However, to build such a classifier based on some machine learning algorithm, one needs a large dataset. In this article, a simulation model to synthesize this dataset is proposed. The structure of the computer model matches the main stages of the electric code-modulated signal generation in a track circuit: code signal generator, rails, locomotive receiver. Based on code signal generator schematic and waveform diagrams, a generator algorithm is developed. At this stage, we modeled timings of electric code signals according to the specification as well as their random deviations caused by various factors. The analysis of substitution circuits of the rail line revealed that it has the properties of a low-pass filter. So, the rail line using the Butterworth digital filter with corresponding parameters is modeled. Additionally, at this stage, random noise during transmission was taken into account. A similar technique is applied for modeling of a locomotive receiver which has a band-pass filter as the first signal processing block. Thus, the proposed simulation model consists of a set of algorithms which run in series. By varying the parameters of the model, one can synthesize waveform diagrams of the electric code-modulated signal received by the locomotive equipment from a track circuit working in various modes and conditions.
{"title":"Simulation Model of Electric Code-Modulated Signal in Russian Systems of Interval Control of Train Movement Based on Track Circuit","authors":"I. Prisukhina, D. Borisenko, S. Lunev","doi":"10.15622/sp.2019.18.5.1212-1238","DOIUrl":"https://doi.org/10.15622/sp.2019.18.5.1212-1238","url":null,"abstract":"Systems of interval control of train movement Signaling systems, which are currently in service in Russian railways, use the electric track circuit as the main data channel between signals and locomotives. Code-modulated electric signals transferred through that channel are frequently get corrupted which leads to railway traffic delays. \u0000Decoding of the electric signal received from a track circuit can be represented as an image classification problem, and thus the stability of the data channel could be significantly improved. \u0000However, to build such a classifier based on some machine learning algorithm, one needs a large dataset. In this article, a simulation model to synthesize this dataset is proposed. \u0000The structure of the computer model matches the main stages of the electric code-modulated signal generation in a track circuit: code signal generator, rails, locomotive receiver. \u0000Based on code signal generator schematic and waveform diagrams, a generator algorithm is developed. At this stage, we modeled timings of electric code signals according to the specification as well as their random deviations caused by various factors. \u0000The analysis of substitution circuits of the rail line revealed that it has the properties of a low-pass filter. So, the rail line using the Butterworth digital filter with corresponding parameters is modeled. Additionally, at this stage, random noise during transmission was taken into account. \u0000A similar technique is applied for modeling of a locomotive receiver which has a band-pass filter as the first signal processing block. \u0000Thus, the proposed simulation model consists of a set of algorithms which run in series. By varying the parameters of the model, one can synthesize waveform diagrams of the electric code-modulated signal received by the locomotive equipment from a track circuit working in various modes and conditions.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83182563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-19DOI: 10.15622/sp.2019.18.5.1239-1263
V. Mironov, Y. Mironov, D. Khegay
The successful solution of practical cosmonautics problems is largely achieved by contemporary advances in measurement and computing technology, as well as by improvements in methods of primary and secondary processing of trajectory measurements. Therefore, in long-range programs of space exploration and space technology development, much attention is paid to improving existing and developing new algorithmic and technical means of navigation support for flights of space objects with the purpose to expand capabilities and increasing the efficiency of autonomous navigation systems of spacecraft, as well as ground-based and perspective orbital systems of space monitoring. Currently, active work is underway to modernize and develop promising complexes of specialized optoelectronic devices for monitoring near-Earth space based on angular measurements. The article considers the application of the variational approach for solving problems of statistical estimation of the trajectory parameters of the orbital object by angular measurements, which were carried out by ground-based optoelectronic means that are part of the modern space control system. Models and algorithms for determining estimates of orbital parameters that implement the variational version of the maximum likelihood method are presented, as well as the results of test calculations related to iterative solution of the two-point boundary value problem of variational estimation. The main purpose of the numerical calculations is a study of convergence of the proposed estimation algorithm, as well as the impact of measurement errors on the displacement of the obtained estimates relative to their exact values. The simulation results, presented in the article, correspond to the conditions of the orbital motion of METEOR PRIRODA spacecraft and were obtained using the ephemeris data of the NORAD catalog in TLE-elements.
{"title":"Optimal Determination of Space Objects Orbit by Angular Measurements of Ground-Based Optoelectronic Stations","authors":"V. Mironov, Y. Mironov, D. Khegay","doi":"10.15622/sp.2019.18.5.1239-1263","DOIUrl":"https://doi.org/10.15622/sp.2019.18.5.1239-1263","url":null,"abstract":"The successful solution of practical cosmonautics problems is largely achieved by contemporary advances in measurement and computing technology, as well as by improvements in methods of primary and secondary processing of trajectory measurements. Therefore, in long-range programs of space exploration and space technology development, much attention is paid to improving existing and developing new algorithmic and technical means of navigation support for flights of space objects with the purpose to expand capabilities and increasing the efficiency of autonomous navigation systems of spacecraft, as well as ground-based and perspective orbital systems of space monitoring. Currently, active work is underway to modernize and develop promising complexes of specialized optoelectronic devices for monitoring near-Earth space based on angular measurements. The article considers the application of the variational approach for solving problems of statistical estimation of the trajectory parameters of the orbital object by angular measurements, which were carried out by ground-based optoelectronic means that are part of the modern space control system. Models and algorithms for determining estimates of orbital parameters that implement the variational version of the maximum likelihood method are presented, as well as the results of test calculations related to iterative solution of the two-point boundary value problem of variational estimation. The main purpose of the numerical calculations is a study of convergence of the proposed estimation algorithm, as well as the impact of measurement errors on the displacement of the obtained estimates relative to their exact values. The simulation results, presented in the article, correspond to the conditions of the orbital motion of METEOR PRIRODA spacecraft and were obtained using the ephemeris data of the NORAD catalog in TLE-elements.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89317348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-19DOI: 10.15622/sp.2019.18.5.1149-1181
F. Taubin, A. Trofimov
One of the approaches to organization of error correcting coding for multilevel flash memory is based on concatenated construction, in particular, on multidimensional lattices for inner coding. A characteristic feature of such structures is the dominance of the complexity of the outer decoder in the total decoder complexity. Therefore the concatenated construction with low-complexity outer decoder may be attractive since in practical applications the decoder complexity is the crucial limitation for the usage of the error correction coding. We consider a concatenated coding scheme for multilevel flash memory with the Barnes-Wall lattice based codes as an inner code and the Reed-Solomon code with correction up to 4…5 errors as an outer one. Performance analysis is fulfilled for a model characterizing the basic physical features of a flash memory cell with non-uniform target voltage levels and noise variance dependent on the recorded value (input-dependent additive Gaussian noise, ID-AGN). For this model we develop a modification of our approach for evaluation the error probability for the inner code. This modification uses the parallel structure of the inner code trellis which significantly reduces the computational complexity of the performance estimation. We present numerical examples of achievable recording density for the Reed-Solomon codes with correction up to four errors as the outer code for wide range of the retention time and number of write/read cycles.
{"title":"Concatenated Coding for Multilevel Flash Memory with Low Error Correction Capabilities in Outer Stage","authors":"F. Taubin, A. Trofimov","doi":"10.15622/sp.2019.18.5.1149-1181","DOIUrl":"https://doi.org/10.15622/sp.2019.18.5.1149-1181","url":null,"abstract":"One of the approaches to organization of error correcting coding for multilevel flash memory is based on concatenated construction, in particular, on multidimensional lattices for inner coding. A characteristic feature of such structures is the dominance of the complexity of the outer decoder in the total decoder complexity. Therefore the concatenated construction with low-complexity outer decoder may be attractive since in practical applications the decoder complexity is the crucial limitation for the usage of the error correction coding. \u0000We consider a concatenated coding scheme for multilevel flash memory with the Barnes-Wall lattice based codes as an inner code and the Reed-Solomon code with correction up to 4…5 errors as an outer one. \u0000Performance analysis is fulfilled for a model characterizing the basic physical features of a flash memory cell with non-uniform target voltage levels and noise variance dependent on the recorded value (input-dependent additive Gaussian noise, ID-AGN). For this model we develop a modification of our approach for evaluation the error probability for the inner code. This modification uses the parallel structure of the inner code trellis which significantly reduces the computational complexity of the performance estimation. We present numerical examples of achievable recording density for the Reed-Solomon codes with correction up to four errors as the outer code for wide range of the retention time and number of write/read cycles.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79975135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：