Abstract: The information technology of Kirlian images preprocessing is developed for decision making support in the telemedicine diagnostic system. Particularly, the image preprocessing includes the selection of objects - fingers emissions in a general image. The algorithms and image processing examples are decrypted.

Keywords: information technology, Kirlian image, preprocessing.

ACM Classification Keywords: J.3 Life and medical sciences – Medical information systems

Link:

KIRLIAN IMAGE PREPROCESSING DIAGNOSTIC SYSTEM

Vitaly Vishnevskey, Vladimir Kalmykov, Tatyana Romanenko, Aleksandr Tugaenko

http://foibg.com/ijita/vol16/IJITA16-2-p07.pdf

Abstract: In this paper, we develop an approach for improving the accuracy and speed of the solution of discrete ill-posed problems using the pseudo-inverse method. It is based on a random projection of the initial coefficient matrix. First, a brief introduction is given to least squares and discrete ill-posed problems, approximate matrix decompositions with randomized algorithms, and randomized least squares approximations. Then, we describe the techniques used in this paper to solve discrete ill-posed inverse problems, including the standard Tikhonov regularization and pseudo-inverse after a random projection. The bias-variance decomposition of solution errors is provided for different solution techniques and it is shown experimentally that the error has a minimum at some value of the varied smaller dimension of the random projection matrix. Taking two well-known test examples of the discrete ill-posed problems of Carasso and Baart, we obtain experimental results of their solution. The comparison shows that the minimal error of the pseudo-inverse solution after a random projection is close to the error of the standard Tikhonov regularization, but the former solution is obtained faster, especially at the larger noise values.

Keywords: discrete ill-posed problems, pseudo-inverse, regularization, random projection, bias, variance

ACM Classification Keywords: I.5.4 Signal processing, I.6 SIMULATION AND MODELING (G.3), G.1.9 Integral Equations

Link:

USING RANDOMIZED ALGORITHMS FOR SOLVING DISCRETE ILL-POSED PROBLEMS

Elena G. Revunova, Dmitri A. Rachkovskij

http://foibg.com/ijita/vol16/IJITA16-2-p06.pdf

Abstract: This paper proposes and discusses a new type of tool for Linux based software systems analysis, testing and optimization as well as the new approach which is based on this tool and will help to define the best moment for executing of effective and smart software upgrade in automatic mode on active and online system. The best moment means one when the software upgrade will cause the minimal services losses. The presented tool is called CAP (Characterization of Availability and Performance) and provides engineers with an instrument for systems performance tuning, profiling and issues investigation as well as stress and load testing. The described system operates with over 150 Linux based system parameters to optimize over 50 performance characteristics. The paper discusses the CAP tool’s architecture, multi-parametric analysis algorithms, and application areas. Furthermore, the paper presents possible future work to improve the tool and extend it to cover additional system parameters and characteristics. The prediction of the software upgrade (SU) best moment mentioned above is supposed to be made on basis of performance and availability statistics got from the CAP tool.

Keywords: Software Systems Analyses, Linux Servers, Telecommunication System, Performance, Availability, Serviceability, Software Upgrade Prediction.

ACM Classification Keywords: C.4 Computer Systems Organization - Performance of Systems - Reliability, availability, and serviceability.

Link:

SOME APPROACHES FOR SOFTWARE SYSTEMS ANALYSES AND ITS UPGRADE PREDICTION

Igor Karelin

http://foibg.com/ijita/vol16/IJITA16-2-p05.pdf

Abstract: The purpose of the paper is to explore the possibility of applying the language PRALU, proposed for description of parallel logical control algorithms and rooted in the Petri net formalism for design and modeling real-time multi-agent systems. It is demonstrated with a known example of English auction on how to specify an agent interaction protocol using considered means. A methodology of programming agents in multi-agent system is proposed; it is based on the description of its protocol on the language PRALU of parallel algorithms of logic control. The methodology consists in splitting agent programs into two parts: the block of synchronization and the functional block.

Keywords: multi-agent system, interaction protocol, BDI agent, parallel control algorithm.

ACM Classification Keywords: I.2.11 Computer Applications; Distributed Artificial Intelligence, Multiagent systems; D.3.3 Programming Languages: Language Constructs and Features – Control structures, Concurrent programming structures

Link:

PROGRAMMING OF AGENT-BASED SYSTEMS

Dmitry Cheremisinov, Liudmila Cheremisinova

http://foibg.com/ijita/vol16/IJITA16-2-p04.pdf

Abstract: Most of the object-oriented cohesion metrics proposed in the literature are static in nature and are defined at the class level. In this paper, new dynamic cohesion metrics are proposed which provide scope of cohesion measurement up to the object level and take into account important and widely used object-oriented features such as inheritance, polymorphism and dynamic binding during measurement. The proposed dynamic measures are computed at run-time, which take into consideration the actual interactions taking place among members of a class. The proposed measures are evaluated using a theoretical framework to prove their usefulness. A dynamic analyzer tool is presented which can be used to perform dynamic analysis of Java applications for the purpose of collecting run-time data for the computation of the proposed metrics. Further, a case study is conducted using a Java program to demonstrate the computation process for the proposed dynamic cohesion measures.

Keywords: Cohesion; Software metrics; Static metrics; Dynamic metrics; Aspect oriented programming; Object-oriented software.

ACM Classification Keywords: D.2.8 Software Engineering: Metrics; D.2.3 Software Engineering: Coding Tools and Techniques - Object-oriented programming

Link:

OBJECT LEVEL RUN-TIME COHESION MEASUREMENT

Varun Gupta, Jitender Kumar Chhabra

http://foibg.com/ijita/vol16/IJITA16-2-p03.pdf

Abstract: This report examines important issues related to different ways to influence the information security of file objects, subjected to information attacks by the methods of compression. Accordingly, the report analyzes the relationships that may exist between selected set of known by the moment of exploration attacks, methods and objects. A methodology for evaluation of information security of objects exposed to attacks is proposed. This methodology reports the impact of different methods of compression which can be applied to these objects. A coefficient of information security for each relation attack—method—object is created. It depends on two main parameters TIME and SIZE, which describe, respectively, the attack and the object. The parameters are presented as two separate relations variables before and after the impact of methods of compression. Since one object can be processed by more than one method of compression, different criteria and methods are used for evaluating and selecting the best method of compression with respect to the information security of the investigated objects. An analysis of the obtained results is made. On this basis are made recommendations for choosing methods of compression with the lowest risk with respect to the information security of file objects, subjected to information attacks.

Keywords: Information Security, Information Attacks, Methods of Compression, File Objects, Co-efficient of Information Security, Risk Assessment.

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

INVESTIGATION ON COMPRESSION METHODS USED AS A PROTECTION INSTRUMENT OF FILE OBJECTS

Dimitrina Polimirova, Eugene Nickolov

http://foibg.com/ijita/vol16/IJITA16-2-p02.pdf

Abstract: Methods for automated development and maintenance of intellectual software user interfaces are proposed. They rest on an ontology-based approach and intended for decreasing effort and time for user interface development and maintenance. A survey, principal conception of the approach, project components and methods of automated development of the project as well as comparison the methods with their analogues are described.

Keywords: ontology, interface project, automated generation

ACM classification: I.2.2 Automatic Programming

Link:

METHODS FOR AUTOMATED DESIGN AND MAINTENANCE OF USER INTERFACES

Valeriya Gribova

http://foibg.com/ijita/vol16/IJITA16-2-p01.pdf

Abstract: A natural requirement on transliteration systems is that transliteration and its inversion could be easily performed. To make this requirement more precise, we consider a text transduction as easily performable if it can be accomplished by a finite transducing device such that all successful tokenizations of input words are compliant with the left-to-right longest-match strategy. Applied to inversion of transliteration this gives a convenient sufficient condition for reversibility of transliteration.

Keywords: left to right, longest match, transliteration, reversible transliteration, sequential transducer.

ACM Classification Keywords: E.4 Data: Coding and information theory — Formal models of communication

Link:

TRANSLITERATION AND LONGEST MATCH STRATEGY

Dimiter Skordev

http://foibg.com/ijita/vol16/IJITA16-1-p07.pdf

Abstract: The article presents the software written in Builder C++ that monitors the process of processor impulse charger. Protocol, interface, components used and the future research are presented.

Keywords: PCgraph, developing software, charging process, C++ Builder

ACM Classification Keywords: C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS

Link:

INCREASING RELIABILITY AND IMPROVING THE PROCESS OF ACCUMULATOR CHARGING BASED ON THE DEVELOPMENT OF PCGRAPH APPLICATION

Irena Nowotyńska, Andrzej Smykla

http://foibg.com/ijita/vol16/IJITA16-1-p06.pdf

Abstract: To this date, strategies aiming at a safe operation of nuclear power plants focused mainly on the prevention of technological breakdowns and, more recently, on the human attitudes and behaviors. New incidents and challenges to safety, however, motivated the nuclear community to look for a new safety approach. The solution became a strong focus on knowledge management and associated theories and sciences as information theories, artificial intelligence, informatics, etc. In all of these, the fundamental role is played by a category of information. This work reviews a number of information interpretations and theories, among which of great relevance are those capturing the fundamental role information plays as a mean to exercise control on the state of a system, those analyzing information communication between agents involved in safety-related activities, and, finally, those which explore the link between information and the limits of our knowledge. Quantitative measures of information content and value are introduced. Completeness, accuracy, and clarity are presented as attributes of information acquired by the receiver. To conclude, suggestions are offered on how to use interpretations and mathematical tools developed within the information theories to maintain and improve safety of nuclear power plants.

Link:

APPLICATION OF INFORMATION THEORIES TO SAFETY OF NUCLEAR POWER PLANTS

Elena Ilina

http://foibg.com/ijita/vol16/IJITA16-1-p05.pdf

Abstract: The theory of probabilistic automata is still evolving discipline of theory of information. As in classical theory of automata, it might be a base for computations, can be exploited in design and verification of circuits and algorithms, in lexical analyzers in compilers computers in future. Minimization of any type of automata gives always saving in resources and time, and is important problem that has been analyzed for almost sixty years. Different types of automata are used for modeling systems or machines with finite number of states. In this article we show few specific type of probabilistic automata, especially the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic automata), and definitions of languages accepted by it. We present definition of bisimulation relation for automata's states and define relation of indistinguishableness of automata states, on base of which we could effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s minimization with determination of its complexity and analyse example solved with help of this algorithm.

Keywords: minimization algorithm, reactive probabilistic automata, equivalence of states of automata, bisimulation relation.

ACM Classification Keywords: F. Theory of Computation, F.1 Computation by Abstract Devices, F.1.1 Models of Computation, Automata; F.4 Mathematical logic and formal languages, F.4.3 Formal Languages

Link:

METHOD AND ALGORITHM FOR MINIMIZATION OF PROBABILISTIC AUTOMATA

Olga Siedlecka

http://foibg.com/ijita/vol16/IJITA16-1-p04.pdf

Abstract: In that paper problems that arising in seismic data processing for real time are considered. The main issue is defects in investigation of mathematical and physical model of object. The static and kinematic residual correction problem is relevant for real time in spite of the modern graph of seismic data processing contains such procedures. The quality of final results that presented by seismic and depth-distance plot doesn’t answer to modern requirements. Three adaptive approaches to realization of numerical method for regression model of static and kinematic residual correction problem are considered. Its use a priory information about number of supporting points of seismic profile at the most.

Keywords: the model of residual time of reflected waves, kinematic and static corrections, number of supporting points of seismic profile, line regression model, measure of a priori information, functional of quality, adaptive algorithm, the condition of stability.

ACM Classification Keywords: G1.10 Numerical Analysis - Applications, G3 Probability and statistics - Correlation and regression analysis.

Link:

ADAPTIVE APPROACH TO STATIC CORRECTION WITH RESPECT TO APRIORISTIC INFORMATION IN PROBLEM OF SEISMIC DATA PROCESSING

Tatyana Stupina

http://foibg.com/ijita/vol16/IJITA16-1-p03.pdf

Abstract. Systems of many Boolean equations with many variables are regarded, which have a lot of practical applications in logic design and diagnostics, pattern recognition, artificial intelligence, etc. A special attention is paid to systems of linear equations playing an important role in information security problems. A compact matrix representation is suggested for such systems. A series of original methods and algorithms for their solution is surveyed in this paper, as well as the information concerning their program implementation and experimental estimation of their efficiency.

Keywords: Solving Boolean equations, large systems, combinatorial search

ACM Classification Keywords: G.2.1 Combinatorics. I.2.8. Problem solving, G.3 Probability and Statistics

Link:

SOLVING LARGE SYSTEMS OF BOOLEAN EQUATIONS

Arkadij Zakrevskij

http://foibg.com/ijita/vol16/IJITA16-1-p02.pdf

Abstract: In the generalized paper, materials of physic-mathematical theory of hyper-random phenomena oriented to description of statistically unstable physical phenomena are presented. Cognition questions of the world are discussed from position of this theory. Different measurement models are researched. The hypothesis of statistical unpredictability and the hypothesis of hyper-random setting up of the world are analyzed. From these hypotheses follow that cognition horizon is restricted by boundaries of unpredictable changes of researched physical phenomenon and of statistical conditions of their observations.

Keywords: hyper-random phenomena, setting up of the world, measurement models, cognition.

ACM Classification Keywords G.3 Probability and Statistics

Link:

COGNITION HORIZON AND THE THEORY OF HYPER-RANDOM PHENOMENA

Igor Gorban

http://foibg.com/ijita/vol16/IJITA16-1-p01.pdf

Abstract: An approach for indirect spatial data extraction by learning restricted finite state automata from web documents created using Bulgarian language are outlined in the paper. It uses heuristics to generalize initial finite-state automata that recognizes only the positive examples and nothing else into automata that recognizes as larger language as possible without extracting any non-positive examples from the training data set. The learning method, program realization and experiments are presented. The investigation is carried out in accordance and following the rules of EU INSPIRE Network.

Keywords: Indirect Spatial Data, Automatic Data Extraction, Restricted Finite State Automata, Web Documents.

ACM Classification Keywords: H.2.8 Database Applications - Data mining; F.1.1 Models of Computation - Finite State Automata

Link:

INDIRECT SPATIAL DATA EXTRACTION FROM WEB DOCUMENTS

Dimitar Blagoev, George Totkov, Milena Staneva, Krassimira Ivanova, Krassimir Markov, Peter Stanchev

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p08.pdf

Abstract: In the article it is considered preconditions and main principles of creation of virtual laboratories for computer-aided design, as tools for interdisciplinary researches. An important feature of this project is using the advanced multi-dimensional access method for organizing the information base of the Virtual laboratory. Virtual laboratory, what are offered, is worth to be used on the stage of the requirements specification or EFT-stage, because it gives the possibility of fast estimating of the project realization, certain characteristics and, as a result, expected benefit of its applications. Using of these technologies already increase automation level of design stages of new devices for different purposes. Proposed computer technology gives possibility to specialists from such scientific fields, as chemistry, biology, biochemistry, physics etc, to check possibility of device creating on the basis of developed sensors. It lets to reduce terms and costs of designing of computer devices and systems on the early stages of designing, for example on the stage of requirements specification or EFT-stage. An instance of using the VLCAD is designing the Portable Device "Floratest" as Tool for Estimating of Megalopolis Ecology State. Portable device "Floratest" is aimed for express-diagnostic of plant state. It is developed in the V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine. Party of this device is manufactured and transferred to organizations, worked in the agricultural sector, environmental protection area, mineral fertilizer production etc. for working out of methodical tools. Using of the device for estimating of megalopolis ecology state by means of evaluation of green plant state is described in the article. Together with Megalopolis Ecomonitoring and Biodiversity Research Center of National Academy of Sciences of Ukraine there were got results of experimental researches of influence detecting of heavy metals and harmful substances on the trees and plants in Kiev.

Keywords: Virtual Laboratory; Computer-Aided? Design; Access Methods; Distributed System, Kautsky effect, chlorophyll, chlorophyll fluorescence induction, fluorescence, fluorometer, portable device, ecology.

ACM Classification Keywords: J.6 Computer-Aided? Engineering –Computer-Aided Design (CAD); D.4.3 File Systems Management – Access Methods; K.4.3 Organizational Impacts – Computer-Supported? Collaborative Work; J.3 Life and Medical Sciences - Biology and Genetics, J.7 Computers in Other Systems – Real Time, C.3 Special-Purpose? and Application-Based? Systems – Microprocessor/microcomputer applications

Link:

DISTRIBUTED VIRTUAL LABORATORIES FOR SMART SENSOR SYSTEM DESIGN

Oleksandr Palagin, Volodymyr Romanov, Vitalii Velychko, Igor Galelyuka, Volodymyr Fedak, Volodymyr Grusha, Dmytro Artemenko, Oksana Galelyuka

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p07.pdf

Abstract: This paper presents the numerical solution of a constrained optimal control problem (COCP) for quasilinear parabolic equations. The COCP Is converted to unconstrained optimization problem (UOCP) by applying the exterior penalty function method. The numerical algorithm for solving UOCP using the conjugate gradient method (CGM) is given. The computing optimal controls are helped to identify the unknown coefficients of the quasilinear parabolic equation. Numerical results are reported.

Keywords: optimal control, quasilinear parabolic equations, penalty function method, finite difference methods.

ACM Classification Keywords: G.1 Numerical Analysis, G.1.6 Optimization, G.1.8 Partial Differential Equations

Link:

ON THE EXTERIOR PENALTY FUNCTION METHOD FOR THE CONSTRAINED OPTIMAL CONTROL PROBLEM FOR QUASILINEAR PARABOLIC EQUATIONS

Mahmoud Farag

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p06.pdf

Abstract: In the article you can find an intermediate outcomes for the complex approach to implementation of development electronic document management subsystem in the CASE-system METAS. The system meant for creating distributed information systems that allow dynamic settings for changeable environment and user requirements. The operational efficiency of electronic documents processing is suggested to increase considerable because of automatic smart document analysis. Agent- and ontology-based approaches are suggested as a solution. Ontologies are used to present the semantic and the structure of the document explicitly. Agents are used for simplification of analysis, made it scalable and upgradable. The results of smart analysis and processing of the documents taken from the heterogeneous sources can be used not only for automatic document classification and clusterization in information system in user friendly form, not only for reducing the labor intensity for subject field analysis and design of information system, but also for intellectualization the processes of reports creating based on information from the database of the system.

Keywords: ontology, agent, multiagent system, smart search, document analysis, adaptive information systems, CASE-technology.

ACM Classification Keywords: D.2 Software Engineering: D.2.2 Design Tools and Techniques – Computer-aided software engineering (CASE); H.2 Database Management: H.2.3 Languages – Report writers; H.3.3 Information Search and Retrieval – Query formulation.

Link:

MULTIAGENT SYSTEM FOR SMART DOCUMENT ANALYSIS

Vyachslav Lanin, Elena Mozzherina

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p05.pdf

Annotation: In this article there are considered problems of forecasting economical macroparameters, and in the first place, index of inflation. Concept of development of synthetical forecasting methods which use directly specified expert information as well as calculation result on the basis of objective economical and mathematical models for forecasting separate “slowly changeable parameters” are offered. This article discusses problems of macroparameters operation on the basis of analysis of received prognostic magnitude.

Key words: decision tree method, index of inflation, expert information, operation.

ACM Classification Keywords: H.4.2 Information Systems Applications: Types of Systems: Decision Support.

Link:

EXPERIENCE OF DEVELOPMENT AND APPLICATION OF EXPERT SYSTEMS FOR ECONOMIC MACROPARAMETERS FORECASTING AND OPERATION

Alexey Voloshyn, Victoria Satyr

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p04.pdf

Abstract: Blindly copying and mimicking evolutionary processes in animated nature along with well developed mathematical models for them looses its base, the inevitable evolution looses its meaning. Instead the evolution by choice more and more establishes itself and it has much greater perspectives to spread. The experiments of evolution by choice is in an abstract mathematical domain where the models include numerous number of elements, i.e. much too bigger in number than the biological evolutionary models. The paper introduces the idea of evolving-by-choice ontologies, a juxtaposition of evolving ontologies with an evolution by choice algorithm. A principle scheme of evolving-by-choice ontology is introduced and the starting options of the model are presented. In total the fundamental problem for biologically inevitable evolution – prove that the solution space exists – in the case of evolving-by-choice ontologies is replaced by the problem to find the shortest path to the solution space.

Keywords: inevitable evolution, evolution by choice, evolving ontologies, evolving-ontologies state-of-the-art, evolving-by-choice ontologies.

ACM Classification Keywords: C.0 Computer Systems Organization – System architectures, C.4 Performance of Systems – Modeling techniques & Performance attributes, D.2.4 Software/Program Verification - Validation, D.2.8 Metrics – Complexity measures & Performance measures, D.2.9 Management - Life cycle & Productivity, D.2.10 Design – Methodologies, D.4.8 Performance – Modeling and prediction, F.2.2 Nonnumerical Algorithms and Problems – Complexity of proof procedures, G.4 Mathematical Software – Efficiency

Link:

EVOLUTION BY CHOICE IN ONTOLOGIES

Stefan Kojnov, Vassil Sgurev

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p03.pdf

Abstract: Development of upgradable tree-level editor of metaontologies, ontologies and knowledge for a chemistry intellectual system is described. A fragment of multilevel chemistry ontology is given. A dialogue scenario for editing ontologies of the second level is described. Data base schemes for representing ontologies and knowledge are defined. A way for adding graphical components to the editor is described.

Keywords: Upgradable multilevel editor of ontologies and knowledge, domain ontology, chemistry ontology, domain knowledge

ACM Classification Keywords: I 2.5 – Expert system tools and techniques.

Link:

UPGRADABLE TREE-LEVEL EDITOR OF METAONTOLOGIES, ONTOLOGIES AND KNOWLEDGE OF CHEMISTRY AND ITS DEVELOPMENT ON THE BASIS OF MULTILEVEL CHEMISTRY ONTOLOGY

Irene Artemieva

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p02.pdf

Abstract: The principal feature of ontology, which is developed for a text processing, is wider knowledge representation of an external world due to introduction of three-level hierarchy. It allows improving semantic interpretation of natural language texts.

Keywords: ontology, text processing, thematic text analysis.

ACM Classification Keywords: I.2.7 Natural Language Processing - Text analysis

Link:

HIERARCHICAL THREE-LEVEL ONTOLOGY FOR TEXT PROCESSING

Victor Gladun, Vitalii Velychko, Leonid Svyatogor

http://foibg.com/ijitk/ijitk-vol03/IJITK03-4-p01.pdf

Abstract: Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a general rule such search result exceed 160 characters; the dialog is required to deliver the relevant portion of a response to the mobile user. In this paper we focus initially on mobile search and mobile advert creation, and later the mechanism of interaction between the user’s request, the result of searching, advertising and dialog.

Keywords: mobile text messages, mobile search, mobile advertising, question-answering system

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

Conference: The paper is selected from Second International Conference "Intelligent Information and Engineering Systems" INFOS 2009, Varna, Bulgaria, June-July? 2009

Link:

MOBILE SEARCH AND ADVERTISING

Vladimir Lovitskii, Colin McCaffery?, Michael Thrasher, David Traynor, Peter Wright

http://foibg.com/ijitk/ijitk-vol03/IJITK03-3-p07.pdf

Abstract: In this paper a model of the university course timetabling problem is presented. The basic data structures, parameters, vectors and matrices, which are used in the definition of the problem, are presented. The hard constraints, which include checking simultaneous involvement of lecturers, students or auditoriums, checking for exceeded capacity of auditoriums as well as verification of commitment of students and lecturers exceeding the predetermined number of hours, are considered. Objective functions for each of the soft constraints, which will be united in a common objective function, are defined. Thus the problem under investigation, will acquire multicriteria optimization nature. The future trends of work are presented.

Keywords: timetable problem, multicriteria optimization.

Link:

A MODEL FOR THE UNIVERSITY COURSE TIMETABLE PROBLEM

Velin Kralev

http://foibg.com/ijitk/ijitk-vol03/IJITK03-3-p06.pdf

Abstract: Improving management systems is getting more and more important and topical, as the organizational structure of modern society consists of many features, peculiarities, relations, and is continuously getting more intricate. Although the society has been complex for a long time, it is only now that we are starting to comprehend its real complexity. It has become obvious that changing a characteristic can easily cause or require change to other parts of the system. Attempting to achieve an enterprise’s highest efficiency, each modern executive should use computer modeling from time to time, as it is an efficient tool for management system research that weighs qualitatively and quantitatively characteristics of system functioning. A prerequisite of modern management is to know the principles and capabilities of modeling, be able to create research and use such models. This report considers the role of business modeling for modern management tasks. Generalizing theory development in the area along with international practices and domestic experience, the author chooses the main directions of modeling for modern management and those fields of management where applying computer modeling is more efficient.. This paper weighs perspectives of modeling used to solve business problems; considers modern modeling approaches used to describe architecture, develop operational models and carry out reengineering; briefs on existing techniques and instrumental tools used in modern business modeling.

Keywords: business process, business modeling, business process modeling techniques, simulation modeling, structure-function approach, discontinuous event-driven approach, agent modeling, modeling tools.

ACM Classification Keywords: I.6.5 Model development – Modeling methodology

Link:

MODERN BUSINESS MODELING APPROACHES AND TOOLS FOR MANAGEMENT

Elena Serova

http://foibg.com/ijitk/ijitk-vol03/IJITK03-3-p05.pdf