首页 > 最新文献

International Workshop on Information, Computation, and Control Systems for Distributed Environments最新文献

英文 中文
Information and algorithmic support of a multi-level integrated system for the investment strategies formation 信息和算法支持多层次综合系统,形成投资策略
D. Gercekovich, O. Basharina, I. Shilnikova, E. Gorbachevskaya, S. Gorsky
The article summarizes the accumulated practical experience of the authors in the development of algorithms for the formation of investment strategies. For this purpose, the optimization of the studied parameters, information support of investment activities, verification, monitoring and adjustment in the testing mode and the subsequent practical application of the described tools are considered. The system is based on the main provisions of the Markowitz portfolio theory. The analytical block of the Information System Portfolio Investor includes Profitability-Risk model; empirical models of optimal complexity; hybrid predictive model systems; the principle of combining (integrating) both models and forecasts, as well as decision rules; optimization of the training sample length (modified Markowitz model); optimization of the frequency of monitoring and adjusting the composition of the investment portfolio. The principles of design and development of the information block of the system, its replenishment and functioning are described in detail. All the above listed components of the algorithmic content of the investment decision making system are described sequentially. The system modules have been successfully tested on a wide class of financial instruments: ordinary shares, preferred shares, government and corporate bonds, exchange commodities, stock, commodity, industry and bond indices, exchange-traded investment funds and real estate funds. The implemented Markowitz model with a dynamic database of historical data can significantly increase the efficiency of investment decisions, which is facilitated by taking into account the characteristics of both the markets under study and the corresponding financial instruments.
本文总结了作者在开发投资策略形成算法方面积累的实践经验。为此,考虑了所研究参数的优化、投资活动的信息支持、测试模式的验证、监测和调整以及随后所述工具的实际应用。该系统是基于马科维茨投资组合理论的主要规定。信息系统投资组合的分析模块包括盈利-风险模型;最优复杂性的经验模型;混合预测模型系统;模型与预测、决策规则相结合(整合)的原则;训练样本长度优化(修正Markowitz模型);优化监测频率,调整投资组合的构成。详细阐述了该系统信息块的设计与开发原理、信息块的补充与功能。以上列出的投资决策系统算法内容的各个组成部分依次进行描述。系统模块已成功地在广泛的金融工具上进行了测试:普通股,优先股,政府和公司债券,交易所商品,股票,商品,工业和债券指数,交易所交易投资基金和房地产基金。实现的带有动态历史数据数据库的马科维茨模型可以显著提高投资决策的效率,这是通过考虑所研究的市场和相应金融工具的特征而实现的。
{"title":"Information and algorithmic support of a multi-level integrated system for the investment strategies formation","authors":"D. Gercekovich, O. Basharina, I. Shilnikova, E. Gorbachevskaya, S. Gorsky","doi":"10.47350/iccs-de.2021.06","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.06","url":null,"abstract":"The article summarizes the accumulated practical experience of the authors in the development of algorithms for the formation of investment strategies. For this purpose, the optimization of the studied parameters, information support of investment activities, verification, monitoring and adjustment in the testing mode and the subsequent practical application of the described tools are considered. The system is based on the main provisions of the Markowitz portfolio theory. The analytical block of the Information System Portfolio Investor includes Profitability-Risk model; empirical models of optimal complexity; hybrid predictive model systems; the principle of combining (integrating) both models and forecasts, as well as decision rules; optimization of the training sample length (modified Markowitz model); optimization of the frequency of monitoring and adjusting the composition of the investment portfolio. The principles of design and development of the information block of the system, its replenishment and functioning are described in detail. All the above listed components of the algorithmic content of the investment decision making system are described sequentially. The system modules have been successfully tested on a wide class of financial instruments: ordinary shares, preferred shares, government and corporate bonds, exchange commodities, stock, commodity, industry and bond indices, exchange-traded investment funds and real estate funds. The implemented Markowitz model with a dynamic database of historical data can significantly increase the efficiency of investment decisions, which is facilitated by taking into account the characteristics of both the markets under study and the corresponding financial instruments.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116928774","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
A logical method for the synthesis of periodic trajectory in a binary dynamical system 二元动力系统周期轨迹综合的逻辑方法
G. Oparin, V. Bogdanova, A. A. Pashinin
A logic method for structural-parametric synthesis of a binary dynamical system with a given periodic trajectory is proposed. This method provides a constructive solution for the considered problem. The attraction region of such a trajectory must coincide with a given subset of the state space. An additional constraint sets the acceptable time for reaching this trajectory from its attraction region. As admissible structures for dynamical models of the synthesis, we consider the following systems: linear systems, systems with the disjunctive and conjunctive right sides. All conditions of the problem are written in the form of a quantified Boolean formula with subsequent verification of its truth using a specialized solver, which gives values of the required parameters of the dynamical model. The software implementation of the proposed method in the form of a composite service is presented. All stages of the parametric synthesis of a Boolean network based on the proposed method are demonstrated in the example of a one-step linear system.
提出了一种具有给定周期轨迹的二元动力系统结构参数综合的逻辑方法。这种方法为所考虑的问题提供了建设性的解决方案。这种轨迹的吸引区域必须与状态空间的给定子集重合。另一个约束规定了从吸引区域到达该轨迹的可接受时间。作为综合动力学模型的允许结构,我们考虑了以下系统:线性系统,具有析取和合取右侧的系统。问题的所有条件都以量化布尔公式的形式写成,随后使用专门的求解器验证其正确性,该求解器给出了动态模型所需参数的值。提出了以组合服务形式实现该方法的软件实现。以一步线性系统为例,说明了基于该方法的布尔网络参数综合的各个阶段。
{"title":"A logical method for the synthesis of periodic trajectory in a binary dynamical system","authors":"G. Oparin, V. Bogdanova, A. A. Pashinin","doi":"10.47350/iccs-de.2021.10","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.10","url":null,"abstract":"A logic method for structural-parametric synthesis of a binary dynamical system with a given periodic trajectory is proposed. This method provides a constructive solution for the considered problem. The attraction region of such a trajectory must coincide with a given subset of the state space. An additional constraint sets the acceptable time for reaching this trajectory from its attraction region. As admissible structures for dynamical models of the synthesis, we consider the following systems: linear systems, systems with the disjunctive and conjunctive right sides. All conditions of the problem are written in the form of a quantified Boolean formula with subsequent verification of its truth using a specialized solver, which gives values of the required parameters of the dynamical model. The software implementation of the proposed method in the form of a composite service is presented. All stages of the parametric synthesis of a Boolean network based on the proposed method are demonstrated in the example of a one-step linear system.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779180","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
End-user development of knowledge bases for semi-automated formation of task cards 最终用户开发用于半自动化生成任务卡的知识库
N. Dorodnykh, Yu. G. Kotlov, O. Nikolaychuk, V. Popov, A. Yurin
The complexity of creating artificial intelligence applications remains high. One of the factors that cause such complexity is the high qualification requirements for developers in the field of programming. Development complexity can be reduced by using methods and tools based on a paradigm known as End-user development. One of the problems that requires the application of the methods of this paradigm is the development of intelligent systems for supporting the search and troubleshooting onboard aircraft. Some tasks connected with this problem are identified, including the task of dynamic formation of task cards for troubleshooting in terms of forming a list of operations. This paper presents a solution to this problem based on some principles of End-user development: model-driven development, visual programming, and wizard form-filling. In particular, an extension of the Prototyping expert systems based on transformations technology, which implements the End-user development, is proposed in the context of the problem to be solved for Sukhoi Superjet aircraft. The main contribution of the work is as follows: expanded the main technology method by supporting event trees formalism (as a popular expert method for formalizing scenarios for the development of problem situations and their localization); created a domain-specific tool (namely, Extended event tree editor) for building standard and extended event trees, including for diagnostic tasks; developed a module for supporting transformations of XML-like event tree representation format for the knowledge base prototyping system – Personal knowledge base designer. A description of the proposed extension and the means of its implementation, as well as an illustrative example, are provided.
创建人工智能应用程序的复杂性仍然很高。造成这种复杂性的因素之一是编程领域对开发人员的高资格要求。通过使用基于终端用户开发范例的方法和工具,可以降低开发的复杂性。需要应用该范式方法的问题之一是开发支持飞机上搜索和故障排除的智能系统。确定了与此问题相关的一些任务,包括动态形成任务卡以形成操作列表进行故障排除的任务。本文提出了一种基于最终用户开发的一些原则的解决方案:模型驱动开发、可视化编程和向导表单填充。针对苏霍伊超级喷气飞机的问题,提出了一种基于转换技术的原型专家系统的扩展,实现了最终用户的开发。该工作的主要贡献如下:通过支持事件树形式化(作为一种流行的专家方法,用于形式化问题情境的开发及其本地化的场景)扩展了主要的技术方法;创建了一个特定于领域的工具(即扩展事件树编辑器),用于构建标准和扩展事件树,包括用于诊断任务;为知识库原型系统——个人知识库设计器开发了一个模块,用于支持类xml事件树表示格式的转换。提供了所提议的扩展及其实现方法的描述,以及一个说明性示例。
{"title":"End-user development of knowledge bases for semi-automated formation of task cards","authors":"N. Dorodnykh, Yu. G. Kotlov, O. Nikolaychuk, V. Popov, A. Yurin","doi":"10.47350/iccs-de.2021.05","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.05","url":null,"abstract":"The complexity of creating artificial intelligence applications remains high. One of the factors that cause such complexity is the high qualification requirements for developers in the field of programming. Development complexity can be reduced by using methods and tools based on a paradigm known as End-user development. One of the problems that requires the application of the methods of this paradigm is the development of intelligent systems for supporting the search and troubleshooting onboard aircraft. Some tasks connected with this problem are identified, including the task of dynamic formation of task cards for troubleshooting in terms of forming a list of operations. This paper presents a solution to this problem based on some principles of End-user development: model-driven development, visual programming, and wizard form-filling. In particular, an extension of the Prototyping expert systems based on transformations technology, which implements the End-user development, is proposed in the context of the problem to be solved for Sukhoi Superjet aircraft. The main contribution of the work is as follows: expanded the main technology method by supporting event trees formalism (as a popular expert method for formalizing scenarios for the development of problem situations and their localization); created a domain-specific tool (namely, Extended event tree editor) for building standard and extended event trees, including for diagnostic tasks; developed a module for supporting transformations of XML-like event tree representation format for the knowledge base prototyping system – Personal knowledge base designer. A description of the proposed extension and the means of its implementation, as well as an illustrative example, are provided.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241619","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}
引用次数: 3
Determining the rank of a number in the residue number system 在余数系统中确定一个数的秩
M. Babenko, N. Kucherov, A. Tchernykh, V. Kuchukov, E. Golimblevskaia, E. Kuchukova, I. Vashchenko
In this article, the formulation and proof of the theorem on the difference in the ranks of the numbers represented in the Residue Number System is carried out. A method is proposed that allows to reduce the amount of necessary calculations and increases the speed of calculating the rank of a number relative to the method for calculating the rank of a number based on the approximate method. To find the rank of a number in the method for calculating the rank of a number based on the approximate method, it is necessary to calculate n operations with numbers exceeding the modulus value; in the proposed method, it is necessary to calculate n·(n−1)/2 operations not exceeding the value of the module.
本文给出了残数系统中所表示数的秩差定理的表述和证明。本文提出了一种方法,相对于基于近似方法的计算数的秩的方法,可以减少必要的计算量并提高计算数的秩的速度。在基于近似法计算数秩的方法中,要求出数的秩,需要计算n个超过模值的数的运算;在提出的方法中,需要计算n·(n−1)/2个不超过模块值的操作。
{"title":"Determining the rank of a number in the residue number system","authors":"M. Babenko, N. Kucherov, A. Tchernykh, V. Kuchukov, E. Golimblevskaia, E. Kuchukova, I. Vashchenko","doi":"10.47350/iccs-de.2021.01","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.01","url":null,"abstract":"In this article, the formulation and proof of the theorem on the difference in the ranks of the numbers represented in the Residue Number System is carried out. A method is proposed that allows to reduce the amount of necessary calculations and increases the speed of calculating the rank of a number relative to the method for calculating the rank of a number based on the approximate method. To find the rank of a number in the method for calculating the rank of a number based on the approximate method, it is necessary to calculate n operations with numbers exceeding the modulus value; in the proposed method, it is necessary to calculate n·(n−1)/2 operations not exceeding the value of the module.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124547565","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
Decision support in the information maintenance of individual education trajectory based on ontological models and distributed RDF-storage 基于本体模型和分布式rdf存储的个人教育轨迹信息维护决策支持
A. V. Klimova, N. Yusupova, O. Smetanina, Alexey S. Kovtunenko
The article considers the problem of decision support in the information maintenance of individual education trajectory. The development of algorithms and software for processes automating in educational systems requires a special approach. The use of ontological models makes it possible to unify the description of the elements of educational systems and apply the technology of digital footprints when managing business processes in educational systems. An ontological model for managing educational trajectories is proposed. An algorithm has also been developed to compare competence-based models of curricula using latent-semantic analysis. The proposed models and methods are implemented as a distributed software system using the semantic web approach on the basis of distributed RDF-storage. The effectiveness of the developed algorithms and software solutions is demonstrated by the example of academic mobility in Ufa State Aviation Technical University. Prospects for further research in this area are outlined.
本文研究了个体教育轨迹信息维护中的决策支持问题。为教育系统的自动化过程开发算法和软件需要一种特殊的方法。本体论模型的使用使得统一教育系统要素的描述和在管理教育系统业务流程时应用数字足迹技术成为可能。提出了一种管理教育轨迹的本体论模型。还开发了一种算法来比较使用潜在语义分析的基于能力的课程模型。所提出的模型和方法在分布式rdf存储的基础上,采用语义web的方法实现为一个分布式软件系统。乌法国立航空技术大学的学术流动实例证明了所开发算法和软件解决方案的有效性。展望了该领域进一步研究的前景。
{"title":"Decision support in the information maintenance of individual education trajectory based on ontological models and distributed RDF-storage","authors":"A. V. Klimova, N. Yusupova, O. Smetanina, Alexey S. Kovtunenko","doi":"10.47350/iccs-de.2021.07","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.07","url":null,"abstract":"The article considers the problem of decision support in the information maintenance of individual education trajectory. The development of algorithms and software for processes automating in educational systems requires a special approach. The use of ontological models makes it possible to unify the description of the elements of educational systems and apply the technology of digital footprints when managing business processes in educational systems. An ontological model for managing educational trajectories is proposed. An algorithm has also been developed to compare competence-based models of curricula using latent-semantic analysis. The proposed models and methods are implemented as a distributed software system using the semantic web approach on the basis of distributed RDF-storage. The effectiveness of the developed algorithms and software solutions is demonstrated by the example of academic mobility in Ufa State Aviation Technical University. Prospects for further research in this area are outlined.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125720324","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
Modelling purposeful processes based on the geometric representation of their trajectories 基于其轨迹的几何表示对有目的的过程建模
I. Skopin
The possibilities of studying processes based on the geometric representation of their trajectories in a multidimensional space of factors and using projections of trajectories on planes suitable for analysis are discussed. A connection is established between such constructions and the spiral and snail of development. Based on the proposed projection, a development snail is defined as a special representation format of the purposeful process, expanding the possibilities of analysis of modelling results.
讨论了在多维因子空间中基于过程轨迹的几何表示和在适合分析的平面上使用轨迹投影来研究过程的可能性。这种建设与螺旋式和蜗牛式的发展之间建立了联系。基于建议的投影,开发蜗牛被定义为有目的过程的特殊表示格式,扩展了建模结果分析的可能性。
{"title":"Modelling purposeful processes based on the geometric representation of their trajectories","authors":"I. Skopin","doi":"10.47350/iccs-de.2021.13","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.13","url":null,"abstract":"The possibilities of studying processes based on the geometric representation of their trajectories in a multidimensional space of factors and using projections of trajectories on planes suitable for analysis are discussed. A connection is established between such constructions and the spiral and snail of development. Based on the proposed projection, a development snail is defined as a special representation format of the purposeful process, expanding the possibilities of analysis of modelling results.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120984567","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
Digital twin of the process of thermal cutting of flat material into figured parts 平面材料热切割成图形零件的数字孪生过程
M. Verkhoturov, G. Verkhoturova, D. Zaripov, N. Kondratyeva, S. Valeev
The designing a digital twin of the process of the thermal cutting of sheet material using laser or gas equipment for its figure cutting is considered. The solution to the problem of optimizing the path of the cutting tool taking into account the thermal effects on the material to be cut is discussed. The solution of the problem of modeling the temperature change of the material to be cut is considered on the basis of a discrete - logical representation of information about the state of the technological system of sheet cutting. The results of a computational experiment are presented.
研究了利用激光或气体设备对板材热切割过程进行图形切割的数字孪生设计。讨论了考虑被切削材料热效应的刀具路径优化问题的解决方法。在板料切割工艺系统状态信息的离散逻辑表示的基础上,考虑了被切割材料温度变化的建模问题。给出了计算实验的结果。
{"title":"Digital twin of the process of thermal cutting of flat material into figured parts","authors":"M. Verkhoturov, G. Verkhoturova, D. Zaripov, N. Kondratyeva, S. Valeev","doi":"10.47350/iccs-de.2021.16","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.16","url":null,"abstract":"The designing a digital twin of the process of the thermal cutting of sheet material using laser or gas equipment for its figure cutting is considered. The solution to the problem of optimizing the path of the cutting tool taking into account the thermal effects on the material to be cut is discussed. The solution of the problem of modeling the temperature change of the material to be cut is considered on the basis of a discrete - logical representation of information about the state of the technological system of sheet cutting. The results of a computational experiment are presented.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636683","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}
引用次数: 2
Large-scale analysis of energy system vulnerability using in-memory data grid 基于内存数据网格的大规模能源系统脆弱性分析
A. Edelev, I. Sidorov, S. Gorsky, A. Feoktistov
Nowadays, determining critical components of energy systems is a relevant problem. The complexity of its solving increases significantly when it is necessary to take into account the simultaneous failures of such components. Usually, in problem-solving, processing a large number of failure variants and their consequences is required. Processing such data using traditional relational database management systems does not allow us to quickly identify the most critical components. In the paper, our successful practical experience in applying an in-memory data grid within large-scale analyzing of the energy system vulnerability is provided. The experimental analysis showed the good scalability of distributed computing and significant reduction in data processing time compared to using an open-source SQL relational database management system. In developing and applying the distributed applied software package for solving the aforementioned problem we have used the Orlando Tools framework. Within its applying, we have implemented continuous integration of the package software taking into account the preparing and processing of subject-oriented data through the in-memory data grid.
如今,确定能源系统的关键部件是一个相关的问题。当需要考虑这些部件的同时失效时,其求解的复杂性显着增加。通常,在解决问题时,需要处理大量的故障变体及其后果。使用传统的关系数据库管理系统处理此类数据不允许我们快速识别最关键的组件。本文提供了在大规模能源系统脆弱性分析中应用内存数据网格的成功实践经验。实验分析表明,与使用开源SQL关系数据库管理系统相比,分布式计算具有良好的可扩展性,显著减少了数据处理时间。在开发和应用分布式应用软件包以解决上述问题时,我们使用了Orlando Tools框架。在它的应用中,考虑到通过内存数据网格准备和处理面向主题的数据,我们实现了软件包软件的持续集成。
{"title":"Large-scale analysis of energy system vulnerability using in-memory data grid","authors":"A. Edelev, I. Sidorov, S. Gorsky, A. Feoktistov","doi":"10.47350/iccs-de.2020.08","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.08","url":null,"abstract":"Nowadays, determining critical components of energy systems is a relevant problem. The complexity of its solving increases significantly when it is necessary to take into account the simultaneous failures of such components. Usually, in problem-solving, processing a large number of failure variants and their consequences is required. Processing such data using traditional relational database management systems does not allow us to quickly identify the most critical components. In the paper, our successful practical experience in applying an in-memory data grid within large-scale analyzing of the energy system vulnerability is provided. The experimental analysis showed the good scalability of distributed computing and significant reduction in data processing time compared to using an open-source SQL relational database management system. In developing and applying the distributed applied software package for solving the aforementioned problem we have used the Orlando Tools framework. Within its applying, we have implemented continuous integration of the package software taking into account the preparing and processing of subject-oriented data through the in-memory data grid.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128507458","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
Modelling of diesel generator operating modes on the basis of the engine speed characteristic in autonomous photovoltaic systems 自主光伏系统中基于发动机转速特性的柴油发电机运行模式建模
D. Karamov, I. Naumov, D. Ivanov, S. Podyachikh
The article presents a universal diesel generator model based on the processing of the engine speed characteristic. Processing uses linear interpolation with a fixed discrete step. An autonomous photovoltaic system arbitrarily located in Eastern Siberia is used as a case study. Solar radiation modelling was based on multi-year meteorological data sets using the tandem of Iqbal-Kasten/Czeplak models. The photovoltaic system under investigation consists of two 400 kW diesel generators (totalling 800 kW) and one 375 kW solar power plant. In calculating the operating modes, the diesel power plant’s minimum limit load factor was taken into consideration. The resulting values of the diesel generator’s operating modes show the following patterns. As an example, the lesser the diesel generator’s load, the lesser engine speed and the higher specific fuel consumption. The suggested model can be used in comprehensive energy research, specifically in areas such as optimal equipment configuration, operational reliability and sustainability as well as cost-efficiency.
本文提出了一种基于发动机转速特性处理的通用柴油发电机模型。处理使用线性插值与一个固定的离散步骤。一个位于东西伯利亚的自主光伏系统被用作一个案例研究。太阳辐射模型是基于使用Iqbal-Kasten/Czeplak模式串联的多年气象数据集。受调查的光伏发电系统包括两台400千瓦柴油发电机(总功率为800千瓦)和一台375千瓦太阳能发电厂。在计算运行模式时,考虑了柴油机的最小极限负荷系数。柴油发电机运行模式的结果值显示如下模式。例如,柴油发电机负荷越小,发动机转速越低,比油耗越高。该模型可用于综合能源研究,特别是在优化设备配置、运行可靠性和可持续性以及成本效益等领域。
{"title":"Modelling of diesel generator operating modes on the basis of the engine speed characteristic in autonomous photovoltaic systems","authors":"D. Karamov, I. Naumov, D. Ivanov, S. Podyachikh","doi":"10.47350/iccs-de.2020.12","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.12","url":null,"abstract":"The article presents a universal diesel generator model based on the processing of the engine speed characteristic. Processing uses linear interpolation with a fixed discrete step. An autonomous photovoltaic system arbitrarily located in Eastern Siberia is used as a case study. Solar radiation modelling was based on multi-year meteorological data sets using the tandem of Iqbal-Kasten/Czeplak models. The photovoltaic system under investigation consists of two 400 kW diesel generators (totalling 800 kW) and one 375 kW solar power plant. In calculating the operating modes, the diesel power plant’s minimum limit load factor was taken into consideration. The resulting values of the diesel generator’s operating modes show the following patterns. As an example, the lesser the diesel generator’s load, the lesser engine speed and the higher specific fuel consumption. The suggested model can be used in comprehensive energy research, specifically in areas such as optimal equipment configuration, operational reliability and sustainability as well as cost-efficiency.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116473083","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}
引用次数: 5
Computationally secure threshold secret sharing scheme with minimal redundancy 具有最小冗余的计算安全阈值秘密共享方案
M. Babenko, A. Tchernykh, E. Golimblevskaia, N. V. Hung, V. Chaurasiya
When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it iscomputationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme.
在设计和使用采用云技术的分布式存储系统时,安全问题变得至关重要。其中一种很有前途的机制是计算安全的阈值秘密共享方案。提出了一种基于最小冗余模块化代码的计算安全秘密共享方案。它降低了数据编码和解码的计算复杂度,减少了数据冗余。我们证明了它在计算上是安全的,并提供了相当于Rabin系统冗余的数据冗余。我们证明了最小冗余模码不满足序列紧性准则,但它可以作为渐近理想的秘密共享方案。
{"title":"Computationally secure threshold secret sharing scheme with minimal redundancy","authors":"M. Babenko, A. Tchernykh, E. Golimblevskaia, N. V. Hung, V. Chaurasiya","doi":"10.47350/iccs-de.2020.02","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.02","url":null,"abstract":"When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is\u0000computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128865800","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
期刊
International Workshop on Information, Computation, and Control Systems for Distributed Environments
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1