检索结果-内蒙古大学图书馆

arXiv 2021年

作者： Dolzhikov, D.A. Kaloshin, A.E. Lomov, Vladimir P. Joint Institute for Nuclear Research Dubna141980 Russia Irkutsk State University Irkutsk664003 Russia Institute for System Dynamics and Control Theory RAS Irkutsk664033 Russia

We discuss diagonalization of propagator for mixing fermions system based on the eigenvalue problem. The similarity transformation converting matrix propagator into diagonal form is obtained. The suggested diagonalization has simple algebraic properties for on-shell fermions and can be used in renormalization of fermion mixing matrix. Copyright © 2021, The Authors. All rights reserved.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

Optimality Conditions for Impulsive Processes with Intermediate State Constraints

Optimality Conditions for Impulsive Processes with Intermedi...

引用

International Conference on Stability and Oscillations of Nonlinear control systems (Pyatnitskiy's Conference)

作者： Olga Samsonyuk Stepan Sorokin Matrosov Institute for System Dynamics and Control Theory of RAS Irkutsk Russia

ISBN: (数字)9781728167053

ISBN: (纸本)9781728167060

This paper is concerned with an optimal impulsive control problem under intermediate state constraints. The control system of this problem is bilinear with respect to states of bounded variation and impulsive controls given by vector Borel measures. We propose necessary and sufficient optimality conditions based on special functions of the Lyapunov type. These functions possess the property of strong and weak monotonicity with respect to the impulsive control system.

关键词： Optimal control Trajectory Dynamic programming Process control system dynamics control theory

来源：评论

学校读者我要写书评

暂无评论

An approach to information export from database for complex master-detail table hierarchies into a single flat table form 1

An approach to information export from database for complex ...

引用

1st International Workshop on Advanced Information and Computation Technologies and systems, AICTS 2020

作者： Hmelnov, Alexei Ruzhnikov, Gennadiy Li, Tianjiao Xu, Huan Matrosov Institute for System Dynamics and Control Theory Siberian Branch Russian Academy of Sciences 134 Lermontov st. Irkutsk Russia "the Belt and Road" Institute for Information Technology Hangzhou Dianzi University No.115 Wenyi Road Xihu District Hangzhou China Hangzhou Dianzi University No.1158 Number Two Street Jianggan District Hangzhou China

When developing a database client application it is usually required to implement a capability to export information from database tables into some simple data-exchange representations of tables like the CSV (Comma-Separated Values) format. It is very straightforward to implement the export for a single database table. But some information about the records of a master table may be represented by the records from, sometimes, several detail tables, so the resulting CSV table would be incomplete without this information. We develop AIS (automated information systems) using declarative specifications of database applications (SDA). The AIS'es are implemented using general algorithms, which are directed by the specifications. In this article we'll consider the approach to generation of flat tables from the master-detail groups of tables, which allows users to represent compactly the data from a hierarchy of tables related by the master-detail relationships and to select conveniently which kind of information to include into the resulting table. © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Large-scale analysis of energy system vulnerability using in-memory data grid 2

Large-scale analysis of energy system vulnerability using in...

引用

2nd International Workshop on Information, Computation, and control systems for Distributed Environments, ICCS-DE 2020

作者： Edelev, A.V. Sidorov, I.A. Gorsky, S.A. Feoktistov, A.G. Melentiev Energy Systems Institute Lermontov St. 130 Irkutsk664033 Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov St. 134 Irkutsk664033 Russia

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. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Development of a computer risk-return model for the formation of a real estate investment portfolio

引用

AIP Conference Proceedings 2023年第1期2948卷

作者： O. Basharina S. Begicheva E. Butsenko Ural State University of Economics Yekaterinburg Russia Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

The article demonstrates the application of the Return-Risk model to develop a synthesized investment strategy. The following parameters of the model are determined as the main sought-for parameters: the size of the time interval, the frequency of portfolio structure revision and the optimal length of the training set. On the example of indices of real estate investment trusts, computational experiments were carried out. Most databases on prices and dividends of financial instruments are updated monthly, so 1 month is chosen as the time interval. The sliding verification method was used to calculate the optimal frequency of revising the portfolio structure in terms of profitability – twice a year. With this frequency, the average portfolio returns increased by 1.5 times. More frequent restructuring reduces the profitability and stability of the portfolio. The search for the optimal length of the training sample was made by the method of coordinate descent and amounted to 5 years. The average monthly expected return on one instrument with this parameter was 0.4%. The evaluation of the resulting synthesized portfolio showed its superiority in terms of profitability over the S&P 500 stock index by almost 2 times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Microservice approach to the qualitative study of attractors of binary dynamic systems based on the Boolean constraint method

Microservice approach to the qualitative study of attractors...

引用

Proceedings of the International Convention MIPRO

作者： G.A. Oparin V.G. Bogdanova A.A Pashinin Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

In recent years, due to the active development of distributed computing technologies, the automation of computations based on these technologies became very important for solving the problems of qualitative research of binary dynamic systems, which are widely used as mathematical models in cryptography, bioinformatics, the study of fault tolerance of computer networks, and some other domains. In this regard, the issues are actualized of developing tools and providing infrastructures for the microservice-based implementation of scientific applications, which are characterized by the dynamism of resource requirements and oriented to use in a hybrid cloud environment. We offer microservice-oriented tools for the automation of solving computationally complex problems of a qualitative study of attractors of binary dynamic systems in a hybrid computing environment. This study is based on the Boolean constraint method and allows the finding of evolutionary parameters of system states (such as, for example, radius, period, and branching) without modeling system dynamics. These tools provide the agents implemented as web-services for the integration of resources of on-premises computers with cloud resources using Dew computing. An example of the application of the developed tools is given.

关键词： Automation system dynamics Computational modeling Tools Software Synchronization Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

HPC-based parallel software for solving applied Boolean satisfiability problems

HPC-based parallel software for solving applied Boolean sati...

引用

Proceedings of the International Convention MIPRO

作者： V.G. Bogdanova S.A. Gorsky A.A. Pashinin Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

Boolean satisfiability is one of the fundamental problems in mathematical logic and the theory of computation. Many practical problems can be formulated as problems of Boolean satisfiability (solving a system of Boolean equations). These include the tasks of cryptography, qualitative research of binary dynamic systems, logical programming, robot action planning, and many others. NP-complexity of the Boolean satisfiability problem actualizes the development of parallel software for solving it in a high-performance computing environment. We focus on the development of specialized parallel solvers for Boolean satisfiability problems oriented to the application in the qualitative study of binary dynamic systems based on the Boolean constraint method. The Boolean constraint method uses a formal definition of the dynamical property, presented in the language of predicate logic with limited existential and universal quantifiers. Based on this definition, a model of dynamical property is formed in the form of Boolean constraints by a series of sequential formal transformations. The developed parallel solvers provide a conclusion on the feasibility of Boolean constraints, interpret this conclusion accordingly the tested property, and find, unlike similar software tools, all sets of values of Boolean variables that lead to this conclusion. An example of applying the developed solver to constructing cycles of a given length of stream ciphers based on shift registers is considered. The results confirming the effectiveness and scalability of the developed software are presented.

关键词： Scalability Tools Shift registers Dynamical systems Software tools Task analysis Robots

来源：评论

学校读者我要写书评

暂无评论

Constructing a Set of Weak Values for Full-round MD4 Hash Function

Constructing a Set of Weak Values for Full-round MD4 Hash Fu...

引用

Proceedings of the International Convention MIPRO

作者： Irina Gribanova Alexander Semenov Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

In this paper we describe the construction of a set of full-round MD4 compression function values, which are weak against the preimage attack of a special kind. The cardinality estimation for this set, obtained by using an effective probabilistic algorithm, is close to 2 32 . According to this, the fraction of weak outputs in the set of all outputs of the MD4 compression function is about $2^{-96}$. Thus, the probability to obtain an easyinvertible output by choosing a random input is significantly higher than $2^{-128}$. These results demonstrate that the full-round MD4 compression function does not have the properties of a random oracle.

关键词： Hash functions Estimation Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

AstroDS-A Distributed Storage for Astrophysics of Cosmic Rays. Current Status 4

AstroDS-A Distributed Storage for Astrophysics of Cosmic Ray...

引用

4th International Workshop on Data Life Cycle in Physics, DLC 2020

作者： Kryukov, Alexander Bychkov, Igor Korosteleva, Elena Mikhailov, Andrey Nguyen, Minh-Duc M.V.Lomonosov Moscow State University D.V.Skobeltsyn Institute of Nuclear Physics Russia Matrosov Institute for System Dynamics and Control Theory Siberian Branch of Russian Academy of Sciences Russia

Currently, the processing of scientific data in astroparticle physics is based on various distributed technologies, the most common of which are Grid and cloud computing. The most frequently discussed approaches are focused on large and even very arge scientific experiments, such as Cherenkov Telescope Array. We, by contrast, offer a solution designed for small to medium experiments such as TAIGA. In such experiments, as a rule, historically developed specific data processing methods and specialized software are used. We have specifically designed a distributed (cloud) data storage for astroparticle physics data collaboration in medium-sized experiments. In this article, we discuss the current state of our work using the example of the TAIGA and CASCADE experiments. A feature of our approach is that we provide our users with scientific data in the form to which they are accustomed to in everyday work on local resources. © 2020 CEUR-WS. All rights reserved.

关键词： Distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers

Using Decision Diagrams of Special Kind for Compactification...

引用

Proceedings of the International Convention MIPRO

作者： Victor Kondratiev Ilya Otpuschennikov Alexander Semenov Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

In the paper we propose new algorithms for constructing compact representations of databases of conflict clauses accumulated by state-of-the-art CDCL SAT solvers. These algorithms use the Decision Diagrams of a special kind (the so-called Disjunctive Diagrams). We consider several families of hard SAT instances and use them to compare the implementations of the proposed algorithms and the well-known CUDD package that uses Zero-Suppressed Binary Decision Diagrams (ZBDD) for solving similar problems. The computational experiments clearly show that our algorithm that uses Disjunctive Diagrams has better effectiveness compared to CUDD.

关键词： Databases Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：