Pub Date : 2019-08-01DOI: 10.1109/OPCS.2019.8880175
A. Materukhin, A. A. Maiorov, Oleg O. Gvozdev
Modeling and simulation of data acquisition systems has always been and remains an important stage in the process of their design. One of the promising classes of data acquisition systems is data acquisition systems based on distributed smart geosensor networks. The aim of the study was to develop a method for assessing the scalability potential of a data acquisition system based on the statistical properties of the latency of its basic components. To simulate the latency of the entire system, authors developed a system model in the form of a coherent set of elements that affect the messages passing through them, mainly by introducing delays in their passage. To quantify the model parameters, the corresponding software tools were developed. The software toolkit was implemented in the Python 3 programming language using the NumPy and SimPy libraries. The approach proposed by the authors of the report allows reducing the a priori uncertainty of the effectiveness of using various algorithms for determining the values of spatial predicates in the developed system and to study processes in the data acquisition system for which there is no exact analytical mathematical description.
{"title":"The Results of Computer Simulation of Data Acquisition Systems Based on Distributed Smart Geosensor Networks","authors":"A. Materukhin, A. A. Maiorov, Oleg O. Gvozdev","doi":"10.1109/OPCS.2019.8880175","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880175","url":null,"abstract":"Modeling and simulation of data acquisition systems has always been and remains an important stage in the process of their design. One of the promising classes of data acquisition systems is data acquisition systems based on distributed smart geosensor networks. The aim of the study was to develop a method for assessing the scalability potential of a data acquisition system based on the statistical properties of the latency of its basic components. To simulate the latency of the entire system, authors developed a system model in the form of a coherent set of elements that affect the messages passing through them, mainly by introducing delays in their passage. To quantify the model parameters, the corresponding software tools were developed. The software toolkit was implemented in the Python 3 programming language using the NumPy and SimPy libraries. The approach proposed by the authors of the report allows reducing the a priori uncertainty of the effectiveness of using various algorithms for determining the values of spatial predicates in the developed system and to study processes in the data acquisition system for which there is no exact analytical mathematical description.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116271334","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-08-01DOI: 10.1109/OPCS.2019.8880248
E. Gimadi, A. Shtepa, O. Tsidulko
In the Capacitated Facility Location Problem (CFLP) the goal is to optimally place facilities at the vertices of a transportation network graph in order to minimize the total facility opening and transportation costs while considering additional restrictions on the facility capacities. The general problem is NP-hard. In this paper we study a special case of the CFLP, where the input transportation network graph is a line graph. We show how to improve the running-time of the best known pseudopolynomial-time algorithm for the CFLP on a line graph from [Mirchandani et al., 1996] by one order.
在可容设施选址问题(CFLP)中，目标是在考虑对设施容量的附加限制的情况下，将设施最优地放置在交通网络图的顶点，以最小化总设施开放和运输成本。一般的问题是np困难的。本文研究了CFLP的一种特殊情况，其中输入交通网络图为线形图。我们展示了如何在[Mirchandani et al.， 1996]的线形图上将最著名的伪多项式时间算法的运行时间提高一个阶。
{"title":"Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph","authors":"E. Gimadi, A. Shtepa, O. Tsidulko","doi":"10.1109/OPCS.2019.8880248","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880248","url":null,"abstract":"In the Capacitated Facility Location Problem (CFLP) the goal is to optimally place facilities at the vertices of a transportation network graph in order to minimize the total facility opening and transportation costs while considering additional restrictions on the facility capacities. The general problem is NP-hard. In this paper we study a special case of the CFLP, where the input transportation network graph is a line graph. We show how to improve the running-time of the best known pseudopolynomial-time algorithm for the CFLP on a line graph from [Mirchandani et al., 1996] by one order.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123787409","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-08-01DOI: 10.1109/OPCS.2019.8880193
R. Mussabayev, Bek Kassymzhanov, Aidos Mukashev, Viktoriya Ibrayeva, Azat Merkebayev
In this paper, we trained distributional models (patterns) for text preprocessing in Word2vec and Glove. Three variants of text preprocessing were used to train distributional patterns. Based on the implemented distribution model Word2Vec, a vector representation was obtained for a cluster-separated test sample of 30 news items. All variants of the weighted average calculation of the vector representation of texts were considered. Two-stage clustering was carried out. After training the Doc2Vec model on normalized documents, a vector representation was obtained for each document. The following news about the same event was selected for the test, but from different sources. A 2-dimensional “factual cube” was analyzed.
{"title":"Creation of Necessary Technical and Expert- Analytical Conditions for Development of the Information System of Evaluating Open Text Information Sources’ Influence on Society","authors":"R. Mussabayev, Bek Kassymzhanov, Aidos Mukashev, Viktoriya Ibrayeva, Azat Merkebayev","doi":"10.1109/OPCS.2019.8880193","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880193","url":null,"abstract":"In this paper, we trained distributional models (patterns) for text preprocessing in Word2vec and Glove. Three variants of text preprocessing were used to train distributional patterns. Based on the implemented distribution model Word2Vec, a vector representation was obtained for a cluster-separated test sample of 30 news items. All variants of the weighted average calculation of the vector representation of texts were considered. Two-stage clustering was carried out. After training the Doc2Vec model on normalized documents, a vector representation was obtained for each document. The following news about the same event was selected for the test, but from different sources. A 2-dimensional “factual cube” was analyzed.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126876521","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-08-01DOI: 10.1109/opcs.2019.8880231
{"title":"OPCS 2019 Table of Contents","authors":"","doi":"10.1109/opcs.2019.8880231","DOIUrl":"https://doi.org/10.1109/opcs.2019.8880231","url":null,"abstract":"","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388192","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-08-01DOI: 10.1109/opcs.2019.8880213
{"title":"OPCS 2019 Committees","authors":"","doi":"10.1109/opcs.2019.8880213","DOIUrl":"https://doi.org/10.1109/opcs.2019.8880213","url":null,"abstract":"","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125649381","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-08-01DOI: 10.1109/OPCS.2019.8880264
V. Shakhov, O. Sokolova
The actual and urgent problem of air pollution monitoring in megacities is considered. Currently, in many countries, wireless sensor networks are used to increase the effectiveness of the atmosphere monitoring. Network nodes equipped with sensors receive information from the environment and transmit it to base stations for further processing. Authors consider a wireless network with mobile sensors, i.e. sensors mounted on moving objects (vehicles). Two variants of the road traffic are considered: deterministic and Poisson flow, i.e. the vehicles inter-arrival time in the area of interest is a constant or exponentially distributed random variable. The presence of an elevated level of pollution is determined during the stay of the vehicle in the study area with a certain probability. The estimation methods for this probability value are discussed. The cumulative distribution function for the rate of critical air pollution detection is derived. The results can be used to design and control the air monitoring systems using vehicles equipped by sensors.
{"title":"Towards Air Pollution Detection With Internet of Vehicles","authors":"V. Shakhov, O. Sokolova","doi":"10.1109/OPCS.2019.8880264","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880264","url":null,"abstract":"The actual and urgent problem of air pollution monitoring in megacities is considered. Currently, in many countries, wireless sensor networks are used to increase the effectiveness of the atmosphere monitoring. Network nodes equipped with sensors receive information from the environment and transmit it to base stations for further processing. Authors consider a wireless network with mobile sensors, i.e. sensors mounted on moving objects (vehicles). Two variants of the road traffic are considered: deterministic and Poisson flow, i.e. the vehicles inter-arrival time in the area of interest is a constant or exponentially distributed random variable. The presence of an elevated level of pollution is determined during the stay of the vehicle in the study area with a certain probability. The estimation methods for this probability value are discussed. The cumulative distribution function for the rate of critical air pollution detection is derived. The results can be used to design and control the air monitoring systems using vehicles equipped by sensors.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117024184","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-08-01DOI: 10.1109/OPCS.2019.8880174
A. Novikov, A. Levykin, E. Novikov
This paper deals with the derivation of numerical methods for optimal control problems. Many of these problems lead to the necessity of the differential-algebraic equations solution of index 1 and higher. The review of control theory problems is given. An L-stable non-iterative (3, 2)-method of order 2 for the Cauchy problem for systems of index not exceeding 2 is proposed. New approach requires 2 function evaluations, 1 computation of the Jacobian matrix and LU-matrix decomposition at each integration step. Numerical results confirming the efficiency of the method are given.
{"title":"(m, k)-Methods for Control Theory Problems","authors":"A. Novikov, A. Levykin, E. Novikov","doi":"10.1109/OPCS.2019.8880174","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880174","url":null,"abstract":"This paper deals with the derivation of numerical methods for optimal control problems. Many of these problems lead to the necessity of the differential-algebraic equations solution of index 1 and higher. The review of control theory problems is given. An L-stable non-iterative (3, 2)-method of order 2 for the Cauchy problem for systems of index not exceeding 2 is proposed. New approach requires 2 function evaluations, 1 computation of the Jacobian matrix and LU-matrix decomposition at each integration step. Numerical results confirming the efficiency of the method are given.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130960245","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-08-01DOI: 10.1109/OPCS.2019.8880245
Kirill V. Tkachev
From the point of view of the problem, the most difficult thing is to separate the model from the task for the experiment. The main thing in this approach is the separation of variables into observable and variable. The observing agent checks the achievement of the stated goals and conditions of the experiment and makes decisions about changes in the variables and / or strategy of the model. A software interface is used to link the model and agent. The model contains potentially observable and variable variables in accordance with a specific task. Variable parameters are usually selected those that are responsible for the behavior of the model (characteristics and parameters of agents). In the interaction of the agent and the model, we consider an interface that will be easy to manage and as informative as possible. It was revealed that with frequent updating of the observed parameters, the model execution time significantly increases. For optimal performance, it is necessary to determine the time intervals with which the values in the interface will be updated.
{"title":"The Interaction Interface Between the Model and the Observer Agent in the Simulation System","authors":"Kirill V. Tkachev","doi":"10.1109/OPCS.2019.8880245","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880245","url":null,"abstract":"From the point of view of the problem, the most difficult thing is to separate the model from the task for the experiment. The main thing in this approach is the separation of variables into observable and variable. The observing agent checks the achievement of the stated goals and conditions of the experiment and makes decisions about changes in the variables and / or strategy of the model. A software interface is used to link the model and agent. The model contains potentially observable and variable variables in accordance with a specific task. Variable parameters are usually selected those that are responsible for the behavior of the model (characteristics and parameters of agents). In the interaction of the agent and the model, we consider an interface that will be easy to manage and as informative as possible. It was revealed that with frequent updating of the observed parameters, the model execution time significantly increases. For optimal performance, it is necessary to determine the time intervals with which the values in the interface will be updated.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121251251","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-08-01DOI: 10.1109/OPCS.2019.8880222
A. Penenko, Z. Mukatova, A. Salimova
Coefficient inverse problems for non-stationary production-destruction models are considered. Such models are used in the studies of the chemical transformation processes. The objective of the work is to apply an approach, consisting in reducing the inverse problem to a quasi-linear matrix equation based on sensitivity operators constructed from an ensemble of independent solutions of adjoint equations. The sensitivity operator relates the variation of the observed values to the variation of the model coefficients. The Newton-Kantorovich-type algorithm is used to solve the obtained matrix equations. The impact of the ensemble construction on local convergence properties of the algorithm are studied numerically on the Brusselator model example.
{"title":"Numerical Solution of the Coefficient Inverse Problem for a Production-Destruction Model with Various Adjoint Ensemble Designs","authors":"A. Penenko, Z. Mukatova, A. Salimova","doi":"10.1109/OPCS.2019.8880222","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880222","url":null,"abstract":"Coefficient inverse problems for non-stationary production-destruction models are considered. Such models are used in the studies of the chemical transformation processes. The objective of the work is to apply an approach, consisting in reducing the inverse problem to a quasi-linear matrix equation based on sensitivity operators constructed from an ensemble of independent solutions of adjoint equations. The sensitivity operator relates the variation of the observed values to the variation of the model coefficients. The Newton-Kantorovich-type algorithm is used to solve the obtained matrix equations. The impact of the ensemble construction on local convergence properties of the algorithm are studied numerically on the Brusselator model example.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114951366","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-08-01DOI: 10.1109/OPCS.2019.8880207
E. Tabarintseva
We consider an optimal control problem for the heat conductivity equation with an integral boundary condition. In addition to the instability of the problem in standard function spaces, it is necessary to take into account that the operator of the problem is not self-adjoint To obtain stable (regularized) solutions to the problem posed, we propose to solve a close stable problem with a small parameter in the overdetermination conditions. For the constructed approximate solution, an exact estimate of its deviation from the accurate solution is derived.
{"title":"Approximate Solving of an Inverse Problem for a Parabolic Equation with Nonlocal Data","authors":"E. Tabarintseva","doi":"10.1109/OPCS.2019.8880207","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880207","url":null,"abstract":"We consider an optimal control problem for the heat conductivity equation with an integral boundary condition. In addition to the instability of the problem in standard function spaces, it is necessary to take into account that the operator of the problem is not self-adjoint To obtain stable (regularized) solutions to the problem posed, we propose to solve a close stable problem with a small parameter in the overdetermination conditions. For the constructed approximate solution, an exact estimate of its deviation from the accurate solution is derived.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125441502","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
扫码关注我们
求助内容：
应助结果提醒方式：