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

Representation of MDA Transformation with Logical Objects

Representation of MDA Transformation with Logical Objects

IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON

作者： Evgeny Cherkashin Alexey Shigarov Viacheslav Paramonov Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Scientific Center of SB RAS Irkutsk Russia

The problem of software modeling having various models as sources and its transformation based on logical inference is considered. Source models are converted into graphs of RDF and then processed with knowledge based system organized in a network of objects. Various notation can be used to represent models, such as UML, SysML, CMMN, BPMN2.0, as well as RDF graphs and analyzed source code, having implemented a corresponding converter. The objects are represented in the LogTalk programming language. Objects query graphs and other objects implementing a scenario of a software system synthesis within Model Driven Architecture paradigm. Usage of such kind of transformation approach allows us to develop software system carcasses on the level of abstract models, involve various sources of model data in the transformation, define and structuring conversion knowledge as objects. An example of a dataflow environment synthesis encapsulating Mothur library for new generation sequencing is presented.

关键词： Unified modeling language Object oriented modeling Data models Resource description framework Tools Computational modeling Ontologies

来源：评论

学校读者我要写书评

暂无评论

Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage 23rd

Fast Heuristics for a Staff Scheduling Problem with Time ...

引用

23rd International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2024

作者： Vasilyev, Igor Ushakov, Anton V. Arkhipov, Dmitry Davydov, Ivan Muftahov, Ildar Lavrentyeva, Maria Matrosov Institute for System Dynamics and Control Theory of SB RAS 134 Lermontov Street Irkutsk664033 Russia Sobolev Institute of Mathematics of SB RAS 4 Academic Koptyug Avenue Novosibirsk630090 Russia MPG IT Solutions LLC Novosibirsk Russia Moscow Russia Irkutsk Russia

ISBN: (纸本)9783031627910

Staff scheduling is a key component of supporting and increasing competitiveness for many service enterprises. This is of especially urgent concern for organizations that provide service on a twenty-four hour basis and often encounter significant fluctuations of demand. By scheduling personnel, the employers have also to strictly follow local laws, industrial regulations, and workload agreements that may considerably affect the final schedule. Staff preferences have also to be taken into account when planning work schedules, since it may reduce turnover and increase productivity. In this paper we consider a staff scheduling problem that arise in the industrial fields where the demand in staff is highly dynamic and varies within time intervals throughout a day. The goal is to assign each employee with a shift for each day of a planning horizon so as to minimize the sum of unsatisfied demand over all time intervals subject to hard workplace constraints. Note that each employee may have his/her day-specific set of pre-defined shifts and a set of work-rule constraints. We formulate the scheduling problem as a mixed-integer program. We develop several fast two-stage heuristic algorithms that includes a constructive step to find an initial solution followed by fast local search procedures. We demonstrate the effectiveness of the proposed approaches on a number of real-world huge-scale scheduling problems involving thousands of employees. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Personnel

来源：评论

学校读者我要写书评

暂无评论

Ensemble control of Dynamic systems with Square Impulses

引用

IFAC-PapersOnLine 2022年第16期55卷 242-247页

作者： Maxim Staritsyn Elena Goncharova Fernando Lobo Pereira Faculdade de Engenharia Universidade do Porto Porto Portugal Matrosov Institute for System Dynamics and Control Theory of the Siberian Branch of the Russian Academy of Sciences Irkutsk Russia

In the article, the basic mathematical concepts of quadratic-impulse control are extended to dynamical systems in the space of probability measures (local continuity equations) representing dynamic ensembles of (infinitely many) homotypic individuals. Starting from a model with quadratic dependence on an unbounded control, we constructively design its impulsive trajectory extension, which, as a byproduct, ensures also the well-posedness of an associated optimal control problem. The main attention is paid to the characteristic control ODE whose extension combines a discontinuous time change with a convexification of the velocity set via generalized controls. Finally, we show that it is possible to exclude the generalized controls and represent extended states as impulsive solutions of a measure-driven ODE. The resulting impulsive continuity equation can be viewed as a measure-driven equation in the space of measures.

关键词： Ensemble control continuity equation optimal control in the space of probability measures impulsive control polynomial impulses relaxation

来源：评论

学校读者我要写书评

暂无评论

Ontology Engineering at the Assertion Level Based on Semantic Annotation of Tabular Data

Ontology Engineering at the Assertion Level Based on Semanti...

引用

Ivannikov Memorial Workshop (IVMEM)

作者： Nikita O. Dorodnykh Aleksandr Yu. Yurin Alexey O. Shigarov Denis Yu. Turdakov Matrosov Institute for System Dynamics and Control Theory (ISDCT) Irkutsk Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences (ISP RAS) Moscow Russia

ISBN: (纸本)9781665423281

Web tables are an important source of knowledge and can be used for ontology engineering. In this paper, we propose the approach for the semi-automated formation of domain ontologies at the assertion level (ABox) based on web tables. The proposed approach consists of 6 steps and is based on the use of the semantic annotation of separate elements of web tables. With the use of the semantic annotation procedure, we extract specific entities (ontology instances) from table cells. Our approach is implemented in the form of a web-based tool. We present a description of the architecture of this tool, as well as its experimental evaluation in the case of domain ontology engineering for the TALISMAN framework. We have formed a special dataset for our experiment. The results obtained show the prospects of using our approach and tool to support ontology engineering based on the semantic annotation of web tables.

关键词： Annotations Knowledge acquisition Conferences Semantics Ontologies

来源：评论

学校读者我要写书评

暂无评论

ASTrODS — Distributed storage for middle-size astroparticle physics facilities 27

ASTrODS — Distributed storage for middle-size astroparticle...

引用

27th Symposium on Nuclear Electronics and Computing, NEC 2019

作者： Kryukov, A. Bychkov, I. Mikhailov, A. Nguyen, M.-D. Shigarov, A. M.V.Lomonosov Moscow State University Skobeltsyn Institute of Nuclear Physics Leninskie gory 1 bld.2 Moscow119992 Russia Matrosov Institute for System Dynamics and Control Theory SB RAS. Lermontova 134 box 292 Irkutsk664033 Russia

Currently, a number of experimental facilities for astrophysics of cosmic rays are being built and are already operating in the world. These installations produce large amounts of data that need to be collected, processed, and analyzed. Since many organizations around the world are involved in experimental collaboration, it is necessary to organize distributed data management and processing. Moreover, the widespread use of multi-messenger approach based on the coordinated observation, interpretation and analysis of disparate signals created by different astrophysical processes makes this problem much more urgent and complex. To meet a similar challenge in high energy physics, a WLCG grid was deployed as part of the LHC project. This solution, on the one hand, showed high efficiency, and, on the other hand, it turned out to be a rather heavy solution that requires high administrative costs, highly qualified staff and a very homogeneous environment on which applications operate. The paper considers a distributed data storage, called AstroDS, which was developed for middle-size astrophysical experiments. The storage currently integrates the data of the KASCADE and TAIGA experiments;in the future, the number of supported experiments will be increased. The main ideas and approaches used in the development of this storage are as follows: unification of access to local storages without changing their internal structure;data transfer only at the moment of actual access to them;search for the requested data using metadata and aggregation of the search results into a new collection available to the user. A distinguishing feature of the system is its focus on storing of both raw data and primary processed data, for example, data after calibration, using the Write-One-Read-Many method. Adding data to local repositories is carried out through special local services that provide, among other things, semi-automatic collection of meta-information in the process of downloading of th

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams

Speeding up the Solving of Logical Equivalence Checking Prob...

引用

Proceedings of the International Convention MIPRO

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

In the context of the problem of checking the equivalence of Boolean circuits (LEC), we propose an approach that increases the efficiency of modern SAT solvers on this problem by generating additional constraints of a special kind. To generate such constraints, we use a variant of decision diagrams called disjunctive diagrams. In contrast to well-known Binary Decision Diagrams these diagrams can be constructed effectively for an original formula and can also be used to extend the original CNF formula with new clauses which are its logical consequences. In computational experiments, we show that the resulting formulas, encoding difficult LEC variants, extended by the generated constraints are often significantly easier to solve for state-of-the-art SAT solvers compared to the original formulas.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using binary file format description languages for documenting, parsing, and verifying raw data in TAIGA experiment 8

Using binary file format description languages for documenti...

引用

Selected Papers of the 8th International Conference "Distributed Computing and Grid-Technologies in Science and Education", GRID 2018

作者： Bychkov, I. Demichev, A. Dubenskaya, J. Fedorov, O. Hmelnov, A. Kazarina, Y. Korosteleva, E. Kostunin, D. Kryukov, A. Mikhailov, A. Nguyen, M.D. Polyakov, S. Postnikov, E. Shigarov, A. Shipilov, D. Zhurov, D. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Irkutsk State University Irkutsk Russia Skobeltsyn Institute of Nuclear Physics Lomonosov Moscow State University Moscow Russia Applied Physics Institute Irkutsk State University Irkutsk Russia Institute for Nuclear Physics Karlsruhe Institute of Technology Karlsruhe Germany

The paper is devoted to the issues of raw binary data documenting, parsing and verifying in astroparticle data lifecycle. The long-term preservation of raw data of astroparticle experiments as originally generated is essential for re-running analyses and reproducing research results. The selected high-quality raw data should have detailed documentation and accompanied by open software tools for access to them We consider applicability of binary file format description languages to specify, parse and verify raw data of the Tunka Advanced Instrument for cosmic rays and Gamma Astronomy (TAIGA) experiment. The formal specifications are implemented for five data formats of the experiment and provides automatic generation of source code for data reading libraries in target programming languages (e.g. C++, Java, and Python). These libraries were tested on TAIGA data. They showed a good performance and help us to locate the parts with corrupted data The format specifications can be used as metadata for exchanging of astroparticle raw data. They can also simplify software development for data aggregation from various sources for the multi-messenger analysis. © 2018 Igor Bychkov, Oleg Fedorov, Alexey Hmelnov, Elena Korosteleva, Dmitriy Kostunin, Alexander Kryukov, Andrey Mikhailov, Alexey Shigarov.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

A grid-aware branch, cut and price implementation

引用

12th European PVM/MPI Users' Group Meeting - Recent Advances in Parallel Virtual Machine and Message Passing Interface

作者： Mancini, Emilio P. Marcarelli, Sonya Ritrovato, Pierluigi Vasil'ev, Igor Villano, Umberto Università del Sannio Dipartimento di Ingegneria RCOST Benevento Italy Italy Institute of System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (纸本)3540290095

This paper presents a grid-enabled system for solving large-scale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and consists of two BCP solvers and of an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms, the system architecture, the solvers and the portal user interface are described. Finally, some of the tests performed and the obtained results are illustrated. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

On kinematic configuring of power gyrosystems 22

On kinematic configuring of power gyrosystems

引用

22nd Saint Petersburg International Conference on Integrated Navigation systems, ICINS 2015

作者： Bychkov, I.V. Druzhinin, E.I. Ogorodnikov, Yu.I. Belyaev, B.B. Ul'yashin, A.I. Institute for System Dynamics and Control Theory Siberian Branch of RAS Irkutsk Russia FGUP NPO named after S.A. Lavochkin Khimki Russia

ISBN: (纸本)9785919950233

The paper gives a clue to solving a well-known "singularity problem" of power gyrosystems, i.e. to developing smoothly implemented by gyrodines steering control laws for the operational modes of the object. We believe that this clue is kinematic configuring of control gyrodines systems, viz. single-axis non-restrained gyros. It implies virtual (programmable) constraining for the precession rates of gyro units in addition to choosing the relative position of spin (precession) axes of their gyromotors (gyronodes). Traditional "geometric" configuring is restricted to this factor, by the way. Reliability verification to solve the singularity problem with the proposed method is based on ensuring controllability of the boundary conditions in the problem of the spacecraft re-orientation with the help of virtually synchronized precession rates of the gyro units. A simple working example is provided for the basic idea not to be overlooked.

关键词： Kinematics

来源：评论

学校读者我要写书评

暂无评论

Generation of Code for Reading Data from the Declarative File Format Specifications Written in Language FlexT

Generation of Code for Reading Data from the Declarative Fil...

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Alexei Hmelnov Hmelnov Andrei Mikhailov Laboratory of Complex information systems Matrosov Institute for System Dynamics and Control Theory of Siberian Branch of Russian Academy of Sciences Irkutsk Russia

ISBN: (纸本)9781728112763;9781728112756

The language FlexT (Flexible Types) is intended for specification of binary data formats. The language is declarative and designed to be well understood for human readers. Its main elements are the data type declarations, which look very much like the usual type declarations of the imperative programming languages, but are more flexible. While the primary purpose of the language FlexT development was to make the binary data understandable by displaying them according to the format specifications, recently we have implemented the code generator, which can produce data reading code in some imperative languages from the specifications. By now we have implemented the code generation for the most widely used FlexT data types, but some complex types like that used in specifications of machine instructions' encoding are not supported yet. The current capabilities of the code generator are well characterized by that it have successfully produced a full-featured data reader code for the well-known for the GIS community Shape file format. In the article we first give a review of the features of the modern projects oriented to specification of binary file formats and consider their code generation capabilities. Then we briefly review the main features of the FlexT language. Finally we describe the main approaches that we use for the code generation.

关键词： Protocols Computer languages Generators Task analysis Syntactics Arrays Encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：