Pub Date : 2019-08-01DOI: 10.1109/OPCS.2019.8880152
Y. Shevtsova, V. Kanev, A. Poletaikin, N. Kuleshova
We propose new original mathematical approach to the problem of a risk management concerning ensuring quality of educational activity of higher education institution. As a basic method of risk management the risk thermometer identifying a risk background of educational process is used. Estimation of risks is carried out by means of fuzzy composition of the obtained temperature data with the fuzzy relation of compliance of risks to their key indicators. The method of fuzzy clustering is applied to construction of risk temperature’s function with optimum parameters. As examination results the complex of actions for developing educational organization formed, which ranging is carried out also on the basis of temperature data.
{"title":"Optimizing Risk-Free Model of Development of Educational Organization Based on Modified Risk Thermometer","authors":"Y. Shevtsova, V. Kanev, A. Poletaikin, N. Kuleshova","doi":"10.1109/OPCS.2019.8880152","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880152","url":null,"abstract":"We propose new original mathematical approach to the problem of a risk management concerning ensuring quality of educational activity of higher education institution. As a basic method of risk management the risk thermometer identifying a risk background of educational process is used. Estimation of risks is carried out by means of fuzzy composition of the obtained temperature data with the fuzzy relation of compliance of risks to their key indicators. The method of fuzzy clustering is applied to construction of risk temperature’s function with optimum parameters. As examination results the complex of actions for developing educational organization formed, which ranging is carried out also on the basis of temperature data.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"35 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":"124457621","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.8880233
O. Tilzo, I. Bykadorov
The paper presents extensive research on the analysis of the monopolistic competition model altered by adding vertical market interaction with several manufacturers, a retailer and consumers. The analysis of different types of interaction of market participants is given.The characteristic of these situations is presented in terms of the retailer’s and manufacturers’ profits, special attention is also paid to the consumer surplus function. The comparison of different types of interaction allows us to identify their strengths and weaknesses, and reveals the various possibilities of maintaining the balance.For each situation under consideration, detailed solutions are provided, and ways to further improve the model are proposed.
{"title":"Retailing Under Monopolistic Competition: A Comparative Analysis","authors":"O. Tilzo, I. Bykadorov","doi":"10.1109/OPCS.2019.8880233","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880233","url":null,"abstract":"The paper presents extensive research on the analysis of the monopolistic competition model altered by adding vertical market interaction with several manufacturers, a retailer and consumers. The analysis of different types of interaction of market participants is given.The characteristic of these situations is presented in terms of the retailer’s and manufacturers’ profits, special attention is also paid to the consumer surplus function. The comparison of different types of interaction allows us to identify their strengths and weaknesses, and reveals the various possibilities of maintaining the balance.For each situation under consideration, detailed solutions are provided, and ways to further improve the model are proposed.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"340 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":"116657709","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.8880255
D. Pinigina, A. Yakimenko
The paper considers the possibility of using the seismic event localization algorithm for localizing objects of the geophysical model of the environment. When adapting this algorithm the localization algorithm for point objects and the localization algorithm of objects of a certain form are proposed.
{"title":"Optimization Algorithm for Seismic Location of Underground Objects","authors":"D. Pinigina, A. Yakimenko","doi":"10.1109/OPCS.2019.8880255","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880255","url":null,"abstract":"The paper considers the possibility of using the seismic event localization algorithm for localizing objects of the geophysical model of the environment. When adapting this algorithm the localization algorithm for point objects and the localization algorithm of objects of a certain form are proposed.","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":"131369098","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.8880158
I. Davydov, D. Tolstykh, P. Kononova, Irina Legkih
Congestion, derived from the permanent increase in road traffic, is a pressing problem in the big cities all around the world nowadays. Thus, the methods of the intelligent control of vehicles traffic have to answer the growing demand. Optimization of traffic signal plans is an important step in this direction. Well-tuned traffic lights schedule augments the efficiency of vehicles flows processing. The research in intelligent traffic signal control helps to significantly improve a traffic situation, reduce the average vehicles waiting time and increase the average speed in the road network.In this study, we propose different configurations of a genetic algorithm to find an effective traffic lights schedule on the real road network. This heuristic evolutionary algorithm is known to cope well with different kinds of optimization problems. For application part of our research, we consider a complex segment of the street network in the city of Novosibirsk, Russia. Using a microscopic traffic simulator, SUMO, we model a corresponding road map fragment. The obtained model serves to evaluate the solutions of the traffic scheduling problem. We analyze the performance of the proposed genetic algorithm with different parameters and discuss the results of numerical experiments considering three different objectives functions which reflect traffic congestion. We show that the proposed approach can be applied to increase the quality of the traffic lights schedule, reducing traffic jams.
{"title":"Genetic Based Approach For Novosibirsk Traffic Light Scheduling","authors":"I. Davydov, D. Tolstykh, P. Kononova, Irina Legkih","doi":"10.1109/OPCS.2019.8880158","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880158","url":null,"abstract":"Congestion, derived from the permanent increase in road traffic, is a pressing problem in the big cities all around the world nowadays. Thus, the methods of the intelligent control of vehicles traffic have to answer the growing demand. Optimization of traffic signal plans is an important step in this direction. Well-tuned traffic lights schedule augments the efficiency of vehicles flows processing. The research in intelligent traffic signal control helps to significantly improve a traffic situation, reduce the average vehicles waiting time and increase the average speed in the road network.In this study, we propose different configurations of a genetic algorithm to find an effective traffic lights schedule on the real road network. This heuristic evolutionary algorithm is known to cope well with different kinds of optimization problems. For application part of our research, we consider a complex segment of the street network in the city of Novosibirsk, Russia. Using a microscopic traffic simulator, SUMO, we model a corresponding road map fragment. The obtained model serves to evaluate the solutions of the traffic scheduling problem. We analyze the performance of the proposed genetic algorithm with different parameters and discuss the results of numerical experiments considering three different objectives functions which reflect traffic congestion. We show that the proposed approach can be applied to increase the quality of the traffic lights schedule, reducing traffic jams.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"42 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":"130149617","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.8880223
E. Gimadi, A. Shevyakov, E. Shin
We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.
{"title":"Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data","authors":"E. Gimadi, A. Shevyakov, E. Shin","doi":"10.1109/OPCS.2019.8880223","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880223","url":null,"abstract":"We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"2 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":"130465958","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.8880195
Y. Shornikov, E. Popov
Original mathematical and program models of modes of the biliary system are considered. The optimal solutions are found by using computer simulation and varying the parameters of the event-continuous systems in a modeling and simulation environment with a textual domain-specific language. The objective diagnosis of the morphofunctional state of the gastroduodenal region was conducted based on data from open sources. It is constructively proven that the optimal solutions obtained by simulation are almost equal to the exact solutions except for a small error. The proposed approach can be applied to other domains that employ the mentioned mathematical model types.
{"title":"Finding Optimal Solutions on Models of Living Systems","authors":"Y. Shornikov, E. Popov","doi":"10.1109/OPCS.2019.8880195","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880195","url":null,"abstract":"Original mathematical and program models of modes of the biliary system are considered. The optimal solutions are found by using computer simulation and varying the parameters of the event-continuous systems in a modeling and simulation environment with a textual domain-specific language. The objective diagnosis of the morphofunctional state of the gastroduodenal region was conducted based on data from open sources. It is constructively proven that the optimal solutions obtained by simulation are almost equal to the exact solutions except for a small error. The proposed approach can be applied to other domains that employ the mentioned mathematical model types.","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":"132872114","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.8880240
A. Zakharova, A. Marenkova, L. Danilova, A. Poletaikin, V. Podkolzin
The article presents the development of information technology for developing an optimal portfolio of communication services for corporate clients. To solve the problem, an optimization model is developed, which formalizes the selection of the most accurate composition of communication services for a corporate client. The problem is solved using the method of genetic algorithms.
{"title":"Formation of Optimal Communication Service Portfolio for Corporate Clients","authors":"A. Zakharova, A. Marenkova, L. Danilova, A. Poletaikin, V. Podkolzin","doi":"10.1109/OPCS.2019.8880240","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880240","url":null,"abstract":"The article presents the development of information technology for developing an optimal portfolio of communication services for corporate clients. To solve the problem, an optimization model is developed, which formalizes the selection of the most accurate composition of communication services for a corporate client. The problem is solved using the method of genetic algorithms.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"51 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":"114907274","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.8880202
Sergey M. Antsyz
A new approach to the construction of mathematical models of complex socio-economic systems is described. The period of economic growth consisting of intervals equal in duration is considered. It is assumed that per capita consumption at each interval is limited from below. The choice of restrictions, providing growth of welfare of individuals, is supported by the process of taking and repayment loans. In contrast to the classical Ramsey-Solow model, it is proposed to minimize the total income for the period. The neoclassical function of economic growth is approximated at each interval by a linear function. It is shown that the development of the economy strategy, obtained with the help of a new approach, allows reducing damage to the environment.
{"title":"On Models of Economic Development, Taking Into Account Lending","authors":"Sergey M. Antsyz","doi":"10.1109/OPCS.2019.8880202","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880202","url":null,"abstract":"A new approach to the construction of mathematical models of complex socio-economic systems is described. The period of economic growth consisting of intervals equal in duration is considered. It is assumed that per capita consumption at each interval is limited from below. The choice of restrictions, providing growth of welfare of individuals, is supported by the process of taking and repayment loans. In contrast to the classical Ramsey-Solow model, it is proposed to minimize the total income for the period. The neoclassical function of economic growth is approximated at each interval by a linear function. It is shown that the development of the economy strategy, obtained with the help of a new approach, allows reducing damage to the environment.","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":"115116763","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.8880182
M. Kurnosov, Daniil Berlizov, Tatiana Tkacheva, E. Tokmasheva
Theoretical and experimental analysis of MPI Bcast algortihms is presented. The optimal tree degrees and segment sizes for pipelined versions of algorithms are obtained. Algorithms were investigated according to their implementation in the Open MPI library. Theoretical results are consistent with experiments on a computer cluster with Gigabit Ethernet and InfiniBand communication networks.
{"title":"Analysis and Optimization of Pipelined Broadcast Algorithms on Gigabit Ethernet and InfiniBand Networks","authors":"M. Kurnosov, Daniil Berlizov, Tatiana Tkacheva, E. Tokmasheva","doi":"10.1109/OPCS.2019.8880182","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880182","url":null,"abstract":"Theoretical and experimental analysis of MPI Bcast algortihms is presented. The optimal tree degrees and segment sizes for pipelined versions of algorithms are obtained. Algorithms were investigated according to their implementation in the Open MPI library. Theoretical results are consistent with experiments on a computer cluster with Gigabit Ethernet and InfiniBand communication networks.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"278 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":"132386749","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.8880155
V. Il'in
The concept, general structure and main components of the integrated computing environment (ICE) for optimization of complex systems based on the methods of conditional minimization of the objective functional characterizing the initial formulation of the problem of mathematical modeling on supercomputers are considered. The inverse problem is solved based on a sequence of direct initial-boundary value problems, each of which can be a resource-intensive interdisciplinary problem described by a system of multidimensional differential and/or integral (and/or discrete) equations in multi-scale computational domains with multi-connected piecewise smooth geometric configurations of boundaries and contrast material properties of multiphase media. This includes, in particular, the actual problems of surrogate optimization. The functional core of the ICE is focused on a high-performance support of all major stages of a large-scale computational experiment, including geometric and semantic modeling, generation of computational grids, approximation of initial equations, solution of algebraic problems, optimization algorithms for solving inverse problems, post-processing and visualization of results, decision-making on the results of the study. Technical requirements for the ICE involve a flexible expansion of the models and methods used, adaptation to the evolution of computer platforms, effective reuse of external software products, coordinated participation of different teams of developers and focus on a broad demand of the end users from different industries. These qualities are designed to provide a long life cycle and a qualitative increase in productivity in the development and application of the new generation software.
{"title":"The Integrated Computational Environment for Optimization of Complex Systems","authors":"V. Il'in","doi":"10.1109/OPCS.2019.8880155","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880155","url":null,"abstract":"The concept, general structure and main components of the integrated computing environment (ICE) for optimization of complex systems based on the methods of conditional minimization of the objective functional characterizing the initial formulation of the problem of mathematical modeling on supercomputers are considered. The inverse problem is solved based on a sequence of direct initial-boundary value problems, each of which can be a resource-intensive interdisciplinary problem described by a system of multidimensional differential and/or integral (and/or discrete) equations in multi-scale computational domains with multi-connected piecewise smooth geometric configurations of boundaries and contrast material properties of multiphase media. This includes, in particular, the actual problems of surrogate optimization. The functional core of the ICE is focused on a high-performance support of all major stages of a large-scale computational experiment, including geometric and semantic modeling, generation of computational grids, approximation of initial equations, solution of algebraic problems, optimization algorithms for solving inverse problems, post-processing and visualization of results, decision-making on the results of the study. Technical requirements for the ICE involve a flexible expansion of the models and methods used, adaptation to the evolution of computer platforms, effective reuse of external software products, coordinated participation of different teams of developers and focus on a broad demand of the end users from different industries. These qualities are designed to provide a long life cycle and a qualitative increase in productivity in the development and application of the new generation software.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"63 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046050","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
扫码关注我们
求助内容：
应助结果提醒方式：