Pub Date : 2019-08-01DOI: 10.1109/OPCS.2019.8880251
I. Gubaydullin, K. Koledina, S. Koledin, Ravil Zaynaullin
A multi-criteria issue concerning gasoline catalytic reforming reactor section optimization was stated. The following particular optimization tasks have been defined: modeling and optimization of chemical-technological catalytic processes for bulk low-octane gasoline production and for obtaining effective high-octane enhancers. Process optimization criteria have been elaborated. The issue of multi-criteria optimization of industrial gasoline reforming process conditions with the help of algorithm NSGA-II has been resolved. Pareto set and front approximations that provide for determining of compromise conditions with maximum yield of high-octane gasoline with the smallest content of benzol have been developed.
{"title":"Catalytic Reforming Reactor Section Optimization Based On A Mathematical Model Accounting The Reaction Volume Changes","authors":"I. Gubaydullin, K. Koledina, S. Koledin, Ravil Zaynaullin","doi":"10.1109/OPCS.2019.8880251","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880251","url":null,"abstract":"A multi-criteria issue concerning gasoline catalytic reforming reactor section optimization was stated. The following particular optimization tasks have been defined: modeling and optimization of chemical-technological catalytic processes for bulk low-octane gasoline production and for obtaining effective high-octane enhancers. Process optimization criteria have been elaborated. The issue of multi-criteria optimization of industrial gasoline reforming process conditions with the help of algorithm NSGA-II has been resolved. Pareto set and front approximations that provide for determining of compromise conditions with maximum yield of high-octane gasoline with the smallest content of benzol have been developed.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"4 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":"117348717","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.8880184
L. Danilova, N. Zakharov, M. Oblaukhova
The problem of staff management in the communications industry is considered, as at the moment this area is one of the fundamental for the development of the country and regions, in particular. The optimization mathematical model constructed on the basis of genetic algorithms, generates an optimal composition of activities for management staff. This set of measures is considered as management decisions, the implementation of which increases the efficiency of human resources and reduces the risks typical for staff policy. These parameters are used as particular criteria for optimal solutions in the implementation of multi-criteria optimization using the apparatus of genetic algorithms.
{"title":"Mathematical Model of Optimal Management of Staff Development in the Communications Industry","authors":"L. Danilova, N. Zakharov, M. Oblaukhova","doi":"10.1109/OPCS.2019.8880184","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880184","url":null,"abstract":"The problem of staff management in the communications industry is considered, as at the moment this area is one of the fundamental for the development of the country and regions, in particular. The optimization mathematical model constructed on the basis of genetic algorithms, generates an optimal composition of activities for management staff. This set of measures is considered as management decisions, the implementation of which increases the efficiency of human resources and reduces the risks typical for staff policy. These parameters are used as particular criteria for optimal solutions in the implementation of multi-criteria optimization using the apparatus of genetic algorithms.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"170 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":"116962734","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.8880244
Alymzhan Toleu, Gulmira Tolegen, R. Mussabayev
This paper presents the comparison results of dependency parsing for two distinct languages: Kazakh and English, by using a various discrete and distributed feature-based approaches We apply graph/transition-based methods to train these models and to report the typed and untyped accuracy. Different comparisons are made for comparing these models by utilizing discrete or dense features. Experimental results show that discrete feature-based approaches (graph-based) perform well than others when the size of data-set is relatively small. For a large data set, the results of those approaches are very competitive with each other, and no significant difference in performance can be observed. In terms of training speed, the results show that discrete feature-based parsers take much less training time than the neural network-based parser, but with comparable performances.
{"title":"Comparison of Various Approaches for Dependency Parsing","authors":"Alymzhan Toleu, Gulmira Tolegen, R. Mussabayev","doi":"10.1109/OPCS.2019.8880244","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880244","url":null,"abstract":"This paper presents the comparison results of dependency parsing for two distinct languages: Kazakh and English, by using a various discrete and distributed feature-based approaches We apply graph/transition-based methods to train these models and to report the typed and untyped accuracy. Different comparisons are made for comparing these models by utilizing discrete or dense features. Experimental results show that discrete feature-based approaches (graph-based) perform well than others when the size of data-set is relatively small. For a large data set, the results of those approaches are very competitive with each other, and no significant difference in performance can be observed. In terms of training speed, the results show that discrete feature-based parsers take much less training time than the neural network-based parser, but with comparable performances.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"350 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":"116318294","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.8880234
T. Averina, K. Rybakov
The paper deals with the optimal filtering problem for random processes in dynamical systems whose mathematical models include stochastic differential equations with a compound Poisson process. The particle method and the maximum cross section method are applied for optimal filtering.
{"title":"Maximum Cross Section Method in Optimal Filtering of Jump-Diffusion Random Processes","authors":"T. Averina, K. Rybakov","doi":"10.1109/OPCS.2019.8880234","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880234","url":null,"abstract":"The paper deals with the optimal filtering problem for random processes in dynamical systems whose mathematical models include stochastic differential equations with a compound Poisson process. The particle method and the maximum cross section method are applied for optimal filtering.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"21 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":"129597247","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.8880205
S. Bredikhin, N. Scherbakova
The task of clustering of a set of objects is treated as the graph partitioning problem. The normalized cut criterion is used for a weighted graph partitioning and the approach is applied in two implemented algorithms. The results of testing the method for the journal citation network clustering are presented.
{"title":"Normalized Spectral Clustering of the Journal Citation Network","authors":"S. Bredikhin, N. Scherbakova","doi":"10.1109/OPCS.2019.8880205","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880205","url":null,"abstract":"The task of clustering of a set of objects is treated as the graph partitioning problem. The normalized cut criterion is used for a weighted graph partitioning and the approach is applied in two implemented algorithms. The results of testing the method for the journal citation network clustering are presented.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"1 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":"129079581","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.8880237
I. Belyaev, I. Bykadorov
We study the international trade model ala Dixit-Stiglitz-Krugman with homogeneous firms. The utility of consumers are additive separable. Transport costs are “iceberg type and production cost function assumes non-linear. We study the local comparative statics with respect to transport costs of consumption, prices, firm’s masses and sizes. We study carefully the situations near free trade and autarky. The results can be applied to the investigate the social welfare.
{"title":"International Trade Models in Monopolistic Competition: the Case of Non-linear Costs","authors":"I. Belyaev, I. Bykadorov","doi":"10.1109/OPCS.2019.8880237","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880237","url":null,"abstract":"We study the international trade model ala Dixit-Stiglitz-Krugman with homogeneous firms. The utility of consumers are additive separable. Transport costs are “iceberg type and production cost function assumes non-linear. We study the local comparative statics with respect to transport costs of consumption, prices, firm’s masses and sizes. We study carefully the situations near free trade and autarky. The results can be applied to the investigate the social welfare.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"88 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":"128593141","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.8880256
O. Lyakhov, G. Toktoshov
The results of the numerical experiments on location of the engineering network in a given area are presented. In this paper the task of delivering repair crews and carrying out repair work in networks nodes, in the form of a modified traveling salesman problem, was solved. In contrast to the classic traveling salesman problem, here the possibilities, firstly, the simultaneous use of more than one salesman, secondly, not only the costs of transporting repair crews from the production site to the engineering network nodes and back were taken into account network, but also the cost of repair work in the network nodes were considered. The results of the work by a numerical example demonstrate the effectiveness of the proposed approach, in comparison with the known models of transport routing are illustrated.
{"title":"The Repair Works Planning Problems in the Utility Networks Nodes","authors":"O. Lyakhov, G. Toktoshov","doi":"10.1109/OPCS.2019.8880256","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880256","url":null,"abstract":"The results of the numerical experiments on location of the engineering network in a given area are presented. In this paper the task of delivering repair crews and carrying out repair work in networks nodes, in the form of a modified traveling salesman problem, was solved. In contrast to the classic traveling salesman problem, here the possibilities, firstly, the simultaneous use of more than one salesman, secondly, not only the costs of transporting repair crews from the production site to the engineering network nodes and back were taken into account network, but also the cost of repair work in the network nodes were considered. The results of the work by a numerical example demonstrate the effectiveness of the proposed approach, in comparison with the known models of transport routing are illustrated.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"34 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":"127881429","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.8880188
A. Materukhin, O. Gvozdev, A. A. Maiorov, O. Sokolova
In the process of designing a monitoring network using smart sensors, developers need to solve various optimization problems, both at the data collection level and at the data processing and analysis level. The main problem in studying data streams, both inside and outside the wireless sensor network, is that the characteristics of data streams in such networks are highly dependent on the data collection processes structure. It is almost impossible to determine the intensity of the outgoing data streams without specifying the data collection model. The system for simulation of spatiotemporal data streams from geosensors placed on public transport was developed at the Department of Data Acquisition Systems of Moscow State University of Geodesy and Cartography. This system allows to change configuration of the data collection network as well as the processing system and check various theoretical solutions for structural optimization of the monitoring network. The result of this structural optimization should be to determine the structure of the monitoring network, which will be optimal in terms of various optimality criteria.
{"title":"Simulation of Spatio-Temporal Data Streams from Geosensors Located on Mobile Objects","authors":"A. Materukhin, O. Gvozdev, A. A. Maiorov, O. Sokolova","doi":"10.1109/OPCS.2019.8880188","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880188","url":null,"abstract":"In the process of designing a monitoring network using smart sensors, developers need to solve various optimization problems, both at the data collection level and at the data processing and analysis level. The main problem in studying data streams, both inside and outside the wireless sensor network, is that the characteristics of data streams in such networks are highly dependent on the data collection processes structure. It is almost impossible to determine the intensity of the outgoing data streams without specifying the data collection model. The system for simulation of spatiotemporal data streams from geosensors placed on public transport was developed at the Department of Data Acquisition Systems of Moscow State University of Geodesy and Cartography. This system allows to change configuration of the data collection network as well as the processing system and check various theoretical solutions for structural optimization of the monitoring network. The result of this structural optimization should be to determine the structure of the monitoring network, which will be optimal in terms of various optimality criteria.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"139 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":"126928040","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
扫码关注我们
求助内容：
应助结果提醒方式：