2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)最新文献

筛选
英文 中文
The Application of the k-shortest Paths Method for Constructing an Optimal Hypernet k最短路径法在构造最优超网络中的应用
G. Toktoshov, D. Migov
{"title":"The Application of the k-shortest Paths Method for Constructing an Optimal Hypernet","authors":"G. Toktoshov, D. Migov","doi":"10.1109/OPCS.2019.8880221","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880221","url":null,"abstract":"The utility networks optimization problem by the minimum construction cost criterion with a reliability constraint is considered. It is assumed that failures occur in the communication channels of the primary network, and the nodes in the secondary network must be connected reliably enough. An algorithm for building networks has been obtained, which can be applied in upgrading existing or designing new networks in accordance with the development and expansion plan of modern cities. In addition, the approximate algorithm proposed allows us to construct the cheapest network, taking into account its reliability.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"16 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":"130308954","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}
引用次数: 1
Analysis and Optimisation of PBS/TORQUE Fault Tolerance Tools PBS/TORQUE容错工具的分析与优化
A. Efimov, K. Pavsky
{"title":"Analysis and Optimisation of PBS/TORQUE Fault Tolerance Tools","authors":"A. Efimov, K. Pavsky","doi":"10.1109/OPCS.2019.8880236","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880236","url":null,"abstract":"This work is devoted to the problem of detecting and processing faults of computing nodes during execution of parallel programs on distributed computing systems. The fault tolerance tools of PBS/TORQUE are considered. The functional model for faults handling optimization are proposed.","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":"122445047","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}
引用次数: 0
Designing of Optimal Power Supply Networks for the Equipment of Multifunctional Safety Systems (MFSS) 多功能安全系统设备最优供电网络设计
Artyom M. Kalney, D. Migov, T. Nasibullina, A. Rodionov, Kirill V. Tkachev, G. Toktoshov
{"title":"Designing of Optimal Power Supply Networks for the Equipment of Multifunctional Safety Systems (MFSS)","authors":"Artyom M. Kalney, D. Migov, T. Nasibullina, A. Rodionov, Kirill V. Tkachev, G. Toktoshov","doi":"10.1109/OPCS.2019.8880253","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880253","url":null,"abstract":"The task of calculating and optimizing reliability of power networks in coal mines is examined. One of main parts of engineering equipment, which supports functioning of telecommunication networks in coal mines, is wire network of power supply, requirements for which highly depend on specific environment. optimization task is stated and some results concerning choosing points of connection with outer power networks are presented.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"101 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":"127118013","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}
引用次数: 1
Comparison of the Work of Algorithms for Arranging Message Distribution Devices in Transport Networks 传输网络中安排消息分发设备的算法工作比较
Kirill V. Tkachev, K. A. Volzhankina, D. Migov
{"title":"Comparison of the Work of Algorithms for Arranging Message Distribution Devices in Transport Networks","authors":"Kirill V. Tkachev, K. A. Volzhankina, D. Migov","doi":"10.1109/OPCS.2019.8880212","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880212","url":null,"abstract":"We study the problem of the optimal arrangement of warning devices on transport networks in order to transmit information about situations on the roads to the maximum number of traffic participants. A weighted graph is considered as a model of a transport network. Some restrictions have been introduced: the cost of installing warning devices, the transmission radius of devices, etc. A solution is proposed using several algorithms. Computational experiments using simulation are carried out.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"43 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":"127391004","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}
引用次数: 0
On Edgeworth Equilibrium for a Multiregional Economic System 论多区域经济体系的埃奇沃斯均衡
V. Vasil'ev
{"title":"On Edgeworth Equilibrium for a Multiregional Economic System","authors":"V. Vasil'ev","doi":"10.1109/OPCS.2019.8880265","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880265","url":null,"abstract":"In the paper, we extend our investigations of Edgeworth allocations in non-classic markets being some modifications of the well-known Arrow-Debreu model. Existence and core equivalence problems for Edgeworth equilibria in a model of multi-regional economic system are considered. It is shown that regional strict autarchy property guarantees coincidence of the fuzzy core and the set of Edgeworth plans of the economies under consideration. By uniting strict autarchy property and ”no cornucopia” assumption we obtain a new Edgeworth equilibrium existence theorem without rather complicated bounded transferability requirement applied in the previous existence results. The proof is based on appropriate generalization of the famous Scarf Theorem on the core to the case of fuzzy NTU cooperative game.","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":"130330039","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}
引用次数: 0
Academician Andrei Ershov and Graphs in Programming Andrei Ershov院士与程序设计中的图形
V. Kasyanov
{"title":"Academician Andrei Ershov and Graphs in Programming","authors":"V. Kasyanov","doi":"10.1109/OPCS.2019.8880185","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880185","url":null,"abstract":"Academician Andrei Petrovich Ershov (19 April 1931 — 8 December 1988) was one of the Soviet pioneers in the field of theoretical and systems programming, the founder of the Siberian School of Programming. His significant contributions to establishing informatics as a new branch of science and a new phenomenon of the social life are widely recognized both in Russia and abroad. His pioneering works on graph-theory methods in programming are somewhat less well known but equally important and highly regarded by the experts. A.P. Ershov called graphs to be the basic tool for the programmer, and said that graphs possess a vast, inexhaustible power commensurate with the scale of programming tasks. He made a fundamental contribution to graph theory particularly in the area of programming.In this paper, A.P. Ershov’s works on graph methods in programming are considered.","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":"130637292","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}
引用次数: 0
OPCS 2019 Author Index OPCS 2019作者索引
{"title":"OPCS 2019 Author Index","authors":"","doi":"10.1109/opcs.2019.8880198","DOIUrl":"https://doi.org/10.1109/opcs.2019.8880198","url":null,"abstract":"","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"31 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":"116617252","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}
引用次数: 0
Distribution of Investment Resources among the Agents of a Megaproject based on the Network Model 基于网络模型的大型项目代理投资资源分配
N. Plyaskina
{"title":"Distribution of Investment Resources among the Agents of a Megaproject based on the Network Model","authors":"N. Plyaskina","doi":"10.1109/OPCS.2019.8880224","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880224","url":null,"abstract":"The report proposes a step-by-step algorithm for solving the problem of distribution of investment resources in the network model of the megaproject. The megaproject is presented in the form of a directed graph without contours. The duration of each work of the network model is a random variable. Works of the network model are grouped in projects of economic agents participants of megaproject. Each agent has the directive term of the completion and also minimum and maximum admissible probability of completion of the projects in this time. The main task of resource allocation between projects is to increase the likelihood of their completion within a directive term frame with given initial volumes of investment resources of the megaproject. The algorithm is tested on the example of allocation of investment resources of PJSC Transneft by sections of Eastern Siberia-Pacific Ocean pipeline.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"491 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":"124432166","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}
引用次数: 0
About One Approach to the Planning in Retail with the Stochastic Parameters 一种具有随机参数的零售业规划方法
A. Novikov
{"title":"About One Approach to the Planning in Retail with the Stochastic Parameters","authors":"A. Novikov","doi":"10.1109/OPCS.2019.8880160","DOIUrl":"https://doi.org/10.1109/OPCS.2019.8880160","url":null,"abstract":"Retail is one of the largest industries for financial investments in Russia. There are various mathematical descriptions for the development of retail projects. Earlier in [1] the researchers considered the resource region development model and a corresponding linear stochastic programming problem, where the budget constraints are assumed to vary in a random manner at specified interval; and the methods of its solving. In this paper, we propose new models for planning retail investment projects related to carrying out promo efficiency in the retail chain. As well as in [1], these models are based on linear stochastic programming problems, where the dimension of the problems increases essentially, and the stochastic parameters appear in market behaviour. To solve this problem, we put forward the method based on its reduction to the deterministic one. For the numerical check of the algorithms we use the data on transactions of the LLC NSK Holdi.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"7 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":"115840104","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}
引用次数: 0
OPCS 2019 Copyright Page OPCS 2019版权页面
{"title":"OPCS 2019 Copyright Page","authors":"","doi":"10.1109/opcs.2019.8880183","DOIUrl":"https://doi.org/10.1109/opcs.2019.8880183","url":null,"abstract":"","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"5 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":"123830702","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信