Abstract: The classification of scientific papers is based on the ability of the artificial system (let’s call such a system ARSA i.e. Automated Review of Scientific Articles) to reflect the similarity of different scientific papers and differential of similar papers. To identify the text as similar to and different from other texts a set of characteristics needs to be used. In this paper the approach of the extraction of “linguistic items” from scientific paper that provides representative information about the document content is considered.

Keywords: text mining, word’s properties, text pattern.

ACM Classification Keywords: I.2 Artificial intelligence: I.2.7 Natural Language Processing: Text analysis.

Link:

NUMERIC-LINGUAL DISTINGUISHING FEATURES OF SCIENTIFIC DOCUMENTS

Vladimir Lovitskii, Ina Markova, Krassimir Markov, Ilia Mitov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p11.pdf

Abstract: The topic of the presented investigation is the contemporary threats, that will lead to big problems in the nearest future. The prevention of such threats is impossible without applications of intelligent agents.Even more, the multi-agent system should possess some features of knowledge discovery, web mining, collective evolutionary systems, and other advanced features which are impossible be applied in only one agent. Advantages and disadvantages of synthetic data mining methods are investigated, and obstacles are revealed to their distribution in information security systems. Original results for juxtaposing statistical vs. logical data mining methods aiming at possible evolutionary fusions are described, and recommendations are made on how to build more effective applications of classical and/or presented novel methods: caleidoscope, funnel, puzzle, frontal and contradiction. The usage of ontologies is investigated with the purpose of information transfer by sense in security agent environments or to reduce the computational complexity of practical applications. It is shown that humancentered methods are very suitable for resolutions in case, and often they are based on the usage of dynamic ontologies . Practical aspects of agent applications are discussed at the information security and/or the national security levels. Other cryptography applications, multiple software and e-learning research results are mentioned aiming to show that intelligent and classical technologies should be carefully combined in one software/hardware complex to achieve the goals of the security. It is shown that all the demonstrated advantages may be successfully combined with other known methods and information security techologies.

Key words: agent, knowledge discovery, data mining, web mining, ontology, information security systems, national security, human-centered systems, knowledge management, automation of creative processes, humanmachine brainstorming methods.

Link:

MULTIAGENT APPLICATIONS IN SECURITY SYSTEMS: NEW PROPOSALS AND PERSPECTIVES

Vladimir Jotsov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p10.pdf

Abstract: Various real problems can be modeled as multicriteria optimization problems (MOP). In the general case, there is no single solution that optimizes all the criteria, but there is a set of solutions where improvement in the value of one criterion leads to deterioration in the value of at least another criterion. This set is known as a Pareto optimal set and any element of this set could be the final solution of the MOP. In order to select the final solution, additional information is necessary and it is supplied by the so-called decision maker. The quality of the interactive algorithms for solving MOP depends mainly on the scalarizing problems they are designed and based on. The scalarizing problems of the reference neighborhood, which are presented in the paper, are especially appropriate for solving multiobjective linear integer programming problems.

Keywords: Multicriteria Linear Integer Optimization, Scalarizing problem.

ACM Classification Keywords: G.1.6. Optimization – Integer Programming

Link:

REFERENCE-NEIGHBOURHOOD SCALARIZATION FOR MULTIOBJECTIVE INTEGER LINEAR PROGRAMMING PROBLEMS

Krassimira Genova, Mariana Vassileva

http://foibg.com/ibs_isc/ibs-16/ibs-16-p09.pdf

Abstract: Properties of convex correcting procedures (CCP) on ensembles of predictors are studied. CCP calculates integral solution as convex linear combination of predictors’ prognoses. Structure of forecasting squared error and generalized error are analyzed. At that generalized error is defined as mean of squared error at Cartezian product of forecasted objects space and space of training sets. It is shown that forecasting squared error, bias and variance component of generalized error have similar structure. Search of optimal CCP coefficients is reduced to quadratic programming task which is solved in terms of ensemble superfluity. Ensemble is considered superfluous if some members can be removed without loss of forecasting ability. Necessary and sufficient conditions of superfluity absence are proven. A regression method based on the described principles has been developed. Its concepts as well as testing results are shown revealing CCP’s significant superiority over stepwise regression.

Keywords: forecasting, bias-variance decomposition, convex combinations, variables selection

ACM Classification Keywords: G.3 Probability and Statistics - Correlation and regression analysis, Statistical computing

Link:

OPTIMAL FORECASTING BASED ON CONVEXCORRECTING PROCEDURES

Oleg Senko, Alexander Dokukin

http://foibg.com/ibs_isc/ibs-16/ibs-16-p08.pdf

Abstract: New results are obtained in logical data analysis and in the development of recognition procedures based on constructing conjunctive rules. Asymptotically optimal methods of constructing normal forms for characteristic functions of classes are developed. The technique of effective search is improved for the conjunctive rules in the case of incomplete data. Theoretical results are confirmed by experimental estimations.

Keywords: logical recognition procedures, enumeration problem complexity, dualization problem, algorithm with a polynomial delay, asymptotically optimal algorithm, normal form of a logical function, maximal conjunction, transformation of normal forms.

ACM Classification Keywords: F.2.1 Theory of Computation – Analysis of Algorithms and Problem Complexity – Numerical Algorithms and Problems – Computations on matrices, G.2.1. Mathematics of Computing – Discrete Mathematics – Combinatorics – Counting problems.

Link:

ON THE COMPLEXITY OF SEARCH FOR CONJUNCTIVE RULES IN RECOGNITION PROBLEMS

Elena Djukova, Vladimir Nefedov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p07.pdf

Abstract: Genome wide expression analysis with DNA microarrays has become a mainstay of genomics research. The problem with microarrays is that there is no “gold standard” for microarray-generated data analysis. In most cases, traditional statistical and pattern recognition approaches are not productive in analysis of high dimension low sample size data analysis, and improvements, alternative approaches are currently being developed in order to effectively analyze and interpret microarray data. In this study we design and extend logiccombinatorial scheme that can be used in high-throughput gene expression data. Applied results show that proposed algorithm is able accurately discriminate different biological phenotypes, although some improvements should be further made.

Keywords: Pattern Recognition, Functional Pathways, gene expression, post traumatic stress disorder

ACM Classification Keywords: I.5 Pattern Recognition, I.5.2 Design Methodology

Link:

GROWING SUPPORT SET SYSTEMS IN ANALYSIS OF HIGH-THROUGHPUT GENE EXPRESSION DATA

Arsen Arakelyan, Anna Boyajian, Hasmik Sahakyan, Levon Aslanyan, Krassimira Ivanova, Iliya Mitov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p06.pdf

Abstract: The new method for analysis of regularities systems is discussed. Regularities are related to effect of explanatory variables on outcome. At that it is supposed that different levels of outcome correspond to different subregions of explanatory variables space. Such regularities may be effectively uncovered with the help of optimal valid partitioning technique. The OVP approach is based on searching partitions of explanatory variables space that in the best way separate observations with different levels of outcomes. Partitions of single variables ranges or two-dimensional admissible areas for pairs of variables are searched inside corresponding families. Output system of regularities is formed with the help of statistical validity estimates by two types of permutation tests. One of the problems associated with OVP procedure is great number of regularities in output system in high-dimensional tasks. The new approach for output system structure evaluating is suggested that is based on searching subsystem of small size with possibly better forecasting ability of convex combination of associated predictors. Mean error of convex combination becomes smaller when average forecasting ability of ensemble members becomes better and deviations between prognoses associated with different regularities increase. So minimization of convex combination mean error allows to receive subsystem of regularities with strong forecasting abilities that significantly differ from each other. Each regularity of output system may be characterized by distances to regularities in subsystem.

Keywords: Optimal partitioning, statistical validity, permutation test, regularities, explanatory variables effect, complexity

ACM Classification Keywords: H.2.8 Database Applications - Data mining, G.3 Probability and Statistics - Nonparametric statistics, Probabilistic algorithms

Link:

METHODS FOR EVALUATING OF REGULARITIES SYSTEMS STRUCTURE

Irina Kostomarova, Anna Kuznetsova, Natalia Malygina, Oleg Senko

http://foibg.com/ibs_isc/ibs-16/ibs-16-p05.pdf

Abstract: The model of recognizing procedures based on construction of family of logic correctors is proposed. For these purposes the genetic approach is used. This method allows, firstly, to reduce calculation costs and, secondly, to construct correctors with high recognition ability. The proposed model is tested on real problems.

Key words: logical recognition procedures, covering of the Boolean matrix, logical corrector, algebra-logic data analysis, genetic algorithm.

ACM Classification Keywords: I.5.1 Computing Methodologies - Pattern Recognition - Models Introduction

Link:

SYNTHESIS OF CORRECTOR FAMILY WITH HIGH RECOGNITION ABILITY*

Elena Djukova, Yurii Zhuravlev, Roman Sotnezov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p04.pdf

Abstract: There are different applications that require finding in a set all points most similar to the given query element. These are problems known as classification problems, or as best match, or the nearest neighbor search procedures. The main goal of this paper is to analyze the algorithmic constructions that appear in a model of recognizing the nearest neighbors in binary data sets. Our target is an earlier proposed algorithm W,1971, R 1974, A,2000 where existence and effectiveness of structures that serve the search procedure is raised. These structures split the search area into the perfect codes and/or the discrete isoperimetry problem solutions, which coexist for a very limited area of parameters. We extend indirectly these parameters through the composite block constructions and estimate the resulting loss of effectiveness of the procedure under consideration.

Keywords: Pattern Recognition, Classification, Best Match, Perfect Code

ACM Classification Keywords: 1.5. Pattern recognition, H.2.8 Database applications, Data mining

Link:

COMPOSITE BLOCK OPTIMIZED CLASSIFICATION DATA STRUCTURES

Levon Aslanyan, Hasmik Sahakyan

http://foibg.com/ibs_isc/ibs-16/ibs-16-p03.pdf

Abstract. Two approaches to solution of the task of restoring of dependence between a vector of independent variables and a dependent scalar according to training sampling are considered. The first (parametrical) approach is grounded on a hypothesis of existence of piecewise linear dependence, and private linear dependences correspond to some intervals of change of the dependent parameter. The second (nonparametric) approach consists in solution of main task as search of collective solution on set of tasks of recognition

Keywords: dependence restoring, regression, algorithm of recognition, piecewise linear function, feature, dynamic programming

ACM Classification Keywords: A.0 General Literature - Conference proceedings, G.1.2 Approximation: Nonlinear approximation, H.4.2 Types of Systems: Decision support, I.2 Artificial intelligence, I.5 Pattern recognition

Link:

RESTORING OF DEPENDENCES ON SAMPLINGS OF PRECEDENTS WITH USAGE OF MODELS OF RECOGNITION

V.V.Ryazanov, Ju.I.Tkachev

http://foibg.com/ibs_isc/ibs-16/ibs-16-p02.pdf

Abstract: Mixed-integer formulation of the problem of minimization of empirical risk is considered. Some possibilities of decision of the continuous relaxation of this problem are analyzed. Comparison of the proposed continuous relaxation with a similar SVM problem is performed too.

Keywords: cluster, decision rule, discriminant function, linear and non-linear programming, non-smooth optimization

ACM Classification Keywords: G.1.6 Optimization - Gradient methods, I.5 Pattern Recognition; I.5.2 Design Methodology - Classifier design and evaluation

Link:

MINIMIZATION OF EMPIRICAL RISK IN LINEAR CLASSIFIER PROBLEM

Yurii I. Zhuravlev, Yury Laptin, Alexander Vinogradov

http://foibg.com/ibs_isc/ibs-16/ibs-16-p01.pdf

Abstract: The process of training is the most difficult for effective realization through information technologies. Is suggested the methods for the most complete implementation of original techniques of material description, ensuring versatility of development environment and functioning of interactive systems of training process. The given technology requires as the exact description of teaching model, as application of modern methods of development intelligent skills.

Keywords: Distance Learning, Computer Based Learning System, Fuzzy Logics, Fuzzy Nondetermined Automat.

ACM Classification Keywords: K.3.1 Computer Uses in Education

Link:

МЕТОДЫ ИНТЕГРАЦИИ УЧЕБНЫХ МАТЕРИАЛОВ ДЛЯ ДИСТАНЦИОННОГО ОБУЧЕНИЯ

Игорь Шубин, Ярослав Святки, Ирина Белоус

http://foibg.com/ibs_isc/ibs-07/IBS-07-p09.pdf

Abstract: Different kinds of associative relations are described. There are defined measures for power of these associative relations.

Keywords: associative relation, associative map, measure

ACM Classification Keywords: I.2.4 Knowledge Representation Formalisms and Methods

Link:

ОТНОШЕНИЯ АССОЦИАЦИИ ДЛЯ АНАЛИЗА ПРЕДМЕТНЫХ ОБЛАСТЕЙ УЧЕБНЫХ КУРСОВ

Вера Любченко, Алексей Ярмула

http://foibg.com/ibs_isc/ibs-07/IBS-07-p08.pdf

Аннотация: В данной работе предложен подход к моделированию и анализу фактов, записи о которых имеются в хранилище данных, и связей между ними. Описаны основные положения формальной математической теории, лежащей в основе предлагаемого подхода. Программные компоненты, реализующие предложенный подход, будут включены в программный комплекс BiP, предназначенный для многомерного анализа данных, получаемых из гетерогенных источников, и позволяет упростить разработку приложений Business Intelligence. Кроме того, планируется использовать описанный подход при разработке исследовательского портала ”Инновационное развитие регионов”.

Keywords: исчисление фактов, Business Intelligence, BI, бизнес-анализ, Data Mining, Reporting, системы поддержки принятия решений, DSS, информационно-аналитические системы.

ACM Classification Keywords: H.4 Information Systems Applications: H.4.2 Types of Systems – Decision support (e.g., MIS).

Link:

МОДЕЛИРОВАНИЕ И АНАЛИЗ ФАКТОВ И СВЯЗЕЙ МЕЖДУ НИМИ

Павел Мальцев

http://foibg.com/ibs_isc/ibs-17/ibs-17-p22.pdf

Abstract: в работе определены основные концептуальные принципы построения, методы разработки и средства реализации автоматизированной системы оперативно-диспетчерского управления (АСОДУ) газотранспортной системой (ГТС) Украины. В качестве современного программно- технического ядра (каркаса) АСОДУ ГТС был обосновано выбран новый класс систем оперативного управления – MES (). Важной особенностью систем класса MES является наличие единого реляционного хранилища оперативной информации, собираемой множеством систем нижнего уровня типа SCADA и передаваемой по современным корпоративным каналам передачи данных.

ACM Classification Keywords: J/1 Administrative data processing

Link:

КОНЦЕПЦИЯ ПОСТРОЕНИЯ И МЕТОДЫ РЕАЛИЗАЦИИ АВТОМАТИЗИРОВАННОЙ СИСТЕМЫ ОПЕРАТИВНО-ДИСПЕТЧЕРСКОГО УПРАВЛЕНИЯ ГАЗОТРАНСПОТНОЙ СИСТЕМОЙ УКРАИНЫ

Юрий Пономарев, Богдан Клюк, Виктор Борисенко

http://foibg.com/ibs_isc/ibs-17/ibs-17-p21.pdf

Abstract: The software ecology as a new branch of the software engineering is presented. Three directions of software ecology dessicions (green software, sustainable development, ecosystems) are looked.

Keywords: software, software engineering, software ecosystem, reverse engineering.

ACM Classification Keywords: software, software engineering, distribution, maintence and enchaincment

Link:

ПРОГРАММНОЕ ОБЕСПЕЧЕНИЕ – ЭКОЛОГИЧЕСКИЙ ПОДХОД К ИССЛЕДОВАНИЯМ

Максим Луцкий, Николай Сидоров

http://foibg.com/ibs_isc/ibs-17/ibs-17-p20.pdf

Аннотация: В работе рассматриваются различные подходы к решению проблемы балансировки во время распределенного имитационного эксперимента. Авторы предлагают решать эту проблему с помощью управляемой балансировки, которая позволяет при распределении нагрузки по вычислительным узлам использовать не только знания о состоянии вычислительной системы, но и знания о поведении конкретной имитационной модели. При этом предполагается использовать мультиагентный подход. Авторы приводят архитектуру мультиагентной системы балансировки, рассматривают вопросы реализации и результаты проведенных экспериментов.

Keywords: Распределенные вычисления; мультиагентная система; динамическая балансировка; имитационная модель.

ACM Classification Keywords: I.6 Simulation and Modelling – I.6.2 Simulation Languages; I.2 Artificial Intelligence – I.2.5 Programming Languages and Software – Expert system tools and techniques.

Link:

МУЛЬТИАГЕНТНЫЙ ПОДХОД К РЕШЕНИЮ ПРОБЛЕМЫ РАВНОМЕРНОГО РАСПРЕДЕЛЕНИЯ ВЫЧИСЛИТЕЛЬНОЙ НАГРУЗКИ

Александр Миков, Елена Замятина, Арсений Козлов

http://foibg.com/ibs_isc/ibs-17/ibs-17-p19.pdf

Аннотация: Рассматривается подход к тиражированию данных в распределенных информационных системах, допускающих динамическую реструктуризацию данных, расширение функциональности системы в ходе ее эксплуатации. Описывается модель информационной системы, управляемой метаданными, приводятся описания схемы и алгоритмов тиражирования, обсуждаются некоторые особенности их реализации. Предлагаемые средства позволяют реплицировать данные, размещенные в локальной базе данных системы-источника, в соответствии со схемой, определяемой пользователем, во внешние подсистемы-приёмники в формате, пригодном для тиражирования данных в гетерогенных системах. Восстановление данных в системе-приёмнике происходит в автоматическом и «ручном» режиме.

Keywords: реплицирование данных, схема тиражирования, распределенные информационные системы, гетерогенные системы, динамическая адаптация, метаданные, метамоделирование.

ACM Classification Keywords: C. Computer Systems Organization – C.2 Computer-Communication? Networks: C.2.4 Distributed Systems – Distributed applications, Distributed databases; H. Information Systems – H.2 Database Management: H.2.4 Systems – Distributed databases; H.2.5 Heterogeneous Databases – Data translation.

Link:

ТИРАЖИРОВАНИЕ ДАННЫХ В ДИНАМИЧЕСКИ НАСТАИВАЕМЫХ РАСПРЕДЕЛЕННЫХ ИНФОРМАЦИОННЫХ СИСТЕМАХ

Людмила Лядова, Михаил Стрелков

http://foibg.com/ibs_isc/ibs-17/ibs-17-p18.pdf

Аннотация: В данной статье проведено обобщение табличной алгебры, построенной на основе реляционных алгебр Кодда;обобщение состоит в том, что вместо таблиц рассматриваются пары, состоящие из таблиц и схем таблиц. Представлено обобщение классического результата об эквивалентности реляционной алгебры Кодда и исчисление строк (кортежей). Исчисление строк пополнено произвольными предикатными и функциональными сигнатурами на универсальном домене. Доказано, что при этом обобщении исчисление строк остается не менее выразительным, чем табличная алгебра.

Ключевые слова: реляционные (табличние) базы данных, исчисление строк, табличная алгебра.

ACM классификация ключевых слов:H.2 Database Management (E.5) H.2.4 Systems – Relational databases

Link:

ОБОБЩЕННАЯ ТАБЛИЧНАЯ АЛГЕБРА, ОБОБЩЕННОЕ ИСЧИСЛЕНИЕ СТРОК И ИХ ЭКВИВАЛЕНТНОСТЬ

Дмитрий Буй, Ирина Глушко

http://foibg.com/ibs_isc/ibs-17/ibs-17-p17.pdf

Abstract The vision physiology investigations and computer vision information technologies creation objectively are the interconnected areas of human activity. One of principle differences between the vision and the computer vision is the variable sizes of the receptive fields excitation zones. Using the systemology analysis of the neurophysiology sources the new model of the neuron operation is offered. The variable resolving ability to be used the new tasks of visual information processing can be solved.

Keywords: переменная разрешающая способность, нейрон, рецептивные поля, визуальная информация, распознавание

ACM Classification Keywords: I.5.1 Models, I.3.5 Computational Geometry and Object Modeling.

Link:

ПЕРЕМЕННАЯ РАЗРЕШАЮЩАЯ СПОСОБНОСТЬ КАК ФАКТОР РАЗВИТИЯ СРЕДСТВ ОБРАБОТКИ ВИЗУАЛНОЙ ИНФОРМАЦИИ

Владимир Калмыков

http://foibg.com/ibs_isc/ibs-17/ibs-17-p16.pdf

Abstract: Complex information technology for visualization communications gesture and mimicry is created.

Keywords: modelling, sign language, computer system.

ACM Classification Keywords: I.2.8 Problem Solving, And Search H.1.1 Systems and Information

Link:

МОДЕЛИРОВАНИЕ РЕАЛИСТИЧЕСКИХ ДВИЖЕНИЙ И МИМИКИ ДЛЯ ЗАДАЧ ВИЗУАЛИЗАЦИИ ЖЕСТОВОЙ ИНФОРМАЦИИ

Юрий Крак, Юрий Кривонос, Aлександр Бармак, Антон Тернов, Богдан Троценко

http://foibg.com/ibs_isc/ibs-17/ibs-17-p15.pdf

Аннотация: Рассматривается эволюция и перспективы развития пяти поколений систем управления в мехатронике и робототехнике. Описываются проблемы и методы интеллектуального сетевого управления информационными потоками в глобальных телекоммуникационных сетях и GRID- системах. Значительное внимание уделяется теории сетевых и нейросетевых агентов и мульти- агентных систем обработки информации и управления.

Kлючевые слова: системы интеллектуального управления; сетевые и нейросетеые агенты; мульти-агентные технологии; GRID-системы.

Link:

МУЛЬТИ-АГЕНТНЫЕ ТЕХНОЛОГИИ ИНТЕЛЛЕКТУАЛЬНОГО УПРАВЛЕНИЯ В РОБОТОТЕХНИЧЕСКИХ, ТЕЛЕКОММУНИКАЦИОННЫХ И GRID-СЕТЯХ

Адиль Васильевич Тимофеев

http://foibg.com/ibs_isc/ibs-17/ibs-17-p14.pdf

Abstract: The dual problem of fuzzy portfolio optimization is considered and investigated. A mathematical model of this problem was constructed , explored and the sufficient conditions for its convexity were obtained. The sufficient optimality conditions of its solution are presented. The results of experimental investigations of solutions are presented and discussed

Keywords: fuzzy portfolio optimization, dual optimization problem/ convexity sufficient conditions,

ACM Classification Keywords: G.1.0 Mathematics of Computing– General – Error analysis; G.1.6 Mathematics of Computing – NUMERICAL ANALYSIS – Optimization - Gradient methods, Least squares methods; I.2.3 Computing Methodologies - ARTIFICIAL INTELLIGENCE - Uncertainty, “fuzzy”, and probabilistic reasoning; I.2.6 Computing Methodologies - ARTIFICIAL INTELLIGENCE – Learning - Connectionism and neural nets;

Link:

ИССЛЕДОВАНИЕ ДВОЙСТВЕННОЙ ЗАДАЧИ ОПТИМИЗАЦИИ ИНВЕСТИЦИОННОГО ПОРТФЕЛЯ В НЕЧЕТКИХ УСЛОВИЯХ

Юрий Зайченко, Ови Нафас Агаи Аг Гамиш

http://foibg.com/ibs_isc/ibs-17/ibs-17-p13.pdf

Аннотация: рассматривается проблема возможного риска банкротства предприятия, приведен общий обзор существующих методик анализа: метода Альтмана, метода Давыдовой-Беликова и нечеткого матричного метода, проведен сравнительный анализ описанных методов на основании полученных результатов.

Ключевые слова: нечёткая логика, прогнозирование банкротства

ACM Classification Keywords: G.1.0 Mathematics of Computing – NUMERICAL ANALYSIS – General – Error analysis I.2.3 Computing Methodologies - ARTIFICIAL INTELLIGENCE - Deduction and Theorem Proving - Uncertainty, “fuzzy”, and probabilistic reasoning; I.2.6 Computing Methodologies - ARTIFICIAL INTELLIGENCE – Learning - Connectionism and neural nets; I.5.1 Computing Methodologies - PATTERN RECOGNITION - Models - Fuzzy set

Link:

СРАВНИТЕЛЬНЫЙ АНАЛИЗ МЕТОДОВ ОЦЕНКИ РИСКА БАНКРОТСТВА КОРПОРАЦИИ

Ольга Прокопенко

http://foibg.com/ibs_isc/ibs-17/ibs-17-p12.pdf

Abstract: Expansion of classical model of interbranch balance and its transformation in optimization model.

Keywords: Inter-branch balance model, Marginal variables, economic-mathematical modeling.

ACM Classification Keywords: ACM Classification Keywords: I. Computing Methodologies – I.6. Simulation and modeling (Time series analysis) – I.6.8 Types of Simulation – Gaming.

Link:

ПОСТРОЕНИЕ ОПТИМИЗАЦИОННОЙ БАЛАНСОВОЙ МОДЕЛИ С ПРИРОСТНЫМИ КОЭФФИЦИЕНТАМИ

Елена Единак

http://foibg.com/ibs_isc/ibs-17/ibs-17-p11.pdf