Menu
SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY
By: Nikolay K. Kosovskii, Nikolay N. Kosovskii   (1839 reads)
Rating: (1.00/10)

Abstract: Series of problems concerning systems of linear Diophantine equations and dis-equations with explicitly given parameters are offered below. For every problem from a series the conditions upon the parameters under which the problem is NP-complete are proved.

Keywords: NP-completeness, system of linear Diophantine equations, system of linear Diophantine dis-equations

ACM Classification Keywords: F.2.m Analysis of Algorithms and Problem Complexity Miscellaneous

Link:

SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY

Nikolay K. Kosovskii, Nikolay N. Kosovskii

http://www.foibg.com/ijita/vol22/ijita22-03-p04.pdf

SELF-MODIFICATED PREDICATE NETWORKS
By: Tatiana Kosovskaya  (2624 reads)
Rating: (1.00/10)

Abstract: A model of self-modificated predicate network with cells implementing predicate formulas in the form of elementary conjunction is suggested. Unlike a classical neuron network the proposed model has two blocks: a training block and a recognition block. If a recognition block has a mistake then the control is transferred to a training block. Always after a training block run the configuration of a recognition block is changed. The base of the proposed predicate network is logic-objective approach to AI problems solving and level description of classes.

Keywords: artificial intelligence, pattern recognition, predicate calculus, level description of a class.

ACM Classification Keywords: I.2.4 Artificial Intelligence - Knowledge Representation Formalisms and Methods-- Predicate logic; I.5.1 Pattern Recognition Models – Deterministic; F.2.2 Nonnumerical Algorithms and Problems – Complexity of proof procedures.

Link:

SELF-MODIFICATED PREDICATE NETWORKS

Tatiana Kosovskaya

http://www.foibg.com/ijita/vol22/ijita22-03-p03.pdf

A VISUAL CONCEPT LANGUAGE FOR EMG SPELLER
By: Vasiljevas et al.  (1712 reads)
Rating: (1.00/10)

Abstract: Assistive technologies provide means for disabled or impaired people to extend their capabilities, communicate and control their environment using alternative and augmentative forms of interaction. Neural-computer interface (NCI) is a communication system that translates neural activity of human muscular system (electromyography (EMG) signals) into commands for a computer or other digital device. The paper discusses the development of the visual concept language for EMG speller (text entry application) based on the application of sound visual communication methodological principles. We present a description of language based on the Speller Visual Communication Language Ontology (SVCLO) developed on the analysis of basic requirements of impaired users living in a closed Ambient Assisted Living environment. Evaluation of the language is given.

Keywords: NCI, neural-computer interfaces, speller, visual concept language, ontology, language modeling

ACM Classification Keywords: H5.m. Information interfaces and presentation (e.g., HCI): Miscellaneous

Link:

A VISUAL CONCEPT LANGUAGE FOR EMG SPELLER

Mindaugas Vasiljevas, Tomas Šumskas, Ignas Plauska, Robertas Damaševičius

http://www.foibg.com/ijita/vol22/ijita22-03-p02.pdf

METHODS OF EVALUATION AND IMPROVEMENT OF CONSISTENCY OF EXPERT PAIRWISE...
By: Nataliya Pankratova, Nadezhda Nedashkovskaya   (2162 reads)
Rating: (1.00/10)

Abstract: The notion of consistency is used to evaluate the contradiction level of expert pairwise comparison judgments and their suitability for the purpose of calculation of weights of decision alternatives. Several consistency coefficients and criteria are used to measure inconsistency of a pairwise comparison matrix (PCM). Traditional approach to increase consistency of expert information is to organize a feedback with an expert. However, it is not always possible due to financial and time limitations. The paper deals with methods of improvement (increase) PCM consistency without participation of an expert. Computer simulation is used to provide a comparative study of these methods. It is shown that taking an inadmissibly inconsistent PCM, for example, with the consistency ratio equal to CR=0.2 or CR=0.3, methods of improvement PCM consistency help to decrease inconsistency up to admissible level CR≤0.1 for n≥5. Results reveal that these methods, unfortunately, are not always effective, that is, drawing near to admissible inconsistency does not ensure closeness to the vector of real weights of decision alternatives. Also an analysis of coefficients and criteria of consistency of expert pairwise comparison judgments depending on PCM properties and level of its consistency is carried out.

Keywords: pairwise comparison matrix, coefficients of consistency, admissible level of inconsistency, consistency criteria, weak consistency, methods of consistency improvement without participation of an expert, methods of identification of the most inconsistent judgment, an effective improvement of consistency

ACM Classification Keywords: H.4.2. Information System Application: type of system strategy

Link:

METHODS OF EVALUATION AND IMPROVEMENT OF CONSISTENCY OF EXPERT PAIRWISE COMPARISON JUDGMENTS

Nataliya Pankratova, Nadezhda Nedashkovskaya

http://www.foibg.com/ijita/vol22/ijita22-03-p01.pdf

ON PROBLEM OF ADEQUACY OF MULTISET MATHEMATICAL MODELS
By: Iryna Riasna   (2537 reads)
Rating: (1.00/10)

Abstract: The analysis of adequacy of competitiveness assessments based only on the values of multiplicity function of multiset is made. Such assessments are not adequate according to representational theory of measurement. An example of adequate assessments based on fuzzy multisets is given.

Keywords: adequate assessment, competitiveness, representational theory of measurement, multiset.

ACM Classification Keywords: F.4.1 Mathematical Logic, G.2.1 Combinatorics, I.2.4 Knowledge Representation Formalisms and Methods

ON PROBLEM OF ADEQUACY OF MULTISET MATHEMATICAL MODELS

Iryna Riasna

http://www.foibg.com/ijita/vol22/ijita22-02-p08.pdf

ON CHOOSING PARAMETERS SET FOR ECA HEIGHT OPTIMIZATION
By: Alexander Dokukin  (2423 reads)
Rating: (1.00/10)

Abstract: A problem of choosing an appropriate set of parameters for estimates calculating algorithms height optimization is considered. The task arises for example in AVO-polynomial recognition method that depends on height optimization of individual ECA items. Initially some subset of general ECA family was used for such an optimization according to the simplicity of the resulting algorithms. In the present article it is shown that on some general conditions the defined ECA subfamily is optimal meaning that the optimal solution in more general one will belong to the said subfamily.

Keywords: estimates calculating algorithm, optimization, algebraic approach, pattern recognition.

ACM Classification Keywords: I.5 Pattern Recognition — I.5.0 General

Link:

ON CHOOSING PARAMETERS SET FOR ECA HEIGHT OPTIMIZATION

Alexander Dokukin

http://www.foibg.com/ijita/vol22/ijita22-02-p07.pdf

ALGORITHMS FOR GENERATING OPERATIONAL MODEL OF COMPETENCE BUSINESS GAMES
By: Olga Vikentieva, Alexander Deryabin, Lydia Shestakova  (2805 reads)
Rating: (1.00/10)

Abstract: In this paper we continue the investigation related to the development of tools for the design and implementation of computer business games, aimed at creating a certain level of competence in the process of realization of the scenarios defined by models of the applied domain.

Keywords: competences, business process, business game, business game script, automata model, operational model

ACM Classification Keywords: K.3 Computers And Education: K.3.2 Computer and Information Science Education – Information Systems Education; K.4 Computers and Society: K.4.3 Organizational Impacts – Employment; I.2 Artificial Intelligence: I.2.1 Applications and Expert Systems – Games

Link:

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

(Algorithms for Generating Operational Model of Competence Business Games)

Ольга Викентьева, Александр Дерябин, Лидия Шестакова

http://www.foibg.com/ijita/vol22/ijita22-02-p06.pdf

COMPARING INERVAL ALTERNATIVES "AS A WHOLE"
By: Gennady Shepelev, Mikhail Sternin   (2253 reads)
Rating: (1.00/10)

Abstract: In this paper we address the following questions. Can we assume that choosing the best interval alternative by their pair-wise comparison, we thus choose the alternative that is preferable simultaneously all others in their given set (prefer ability “as a whole”)? Does the answer depend to this question from an amount of compared alternatives? It is shown that comparing interval alternatives "as a whole" reduces the values of chances of prefer ability for each alternative with respect to these values under pair-wise comparison. This in turn leads to a quantitative increasing risk of choice as preferred alternative the alternative, which will not be really such later, in future, when the uncertainty will be removed. The nature of this effect is that in the presence of intersection even for two comparable interval alternatives there is a non-zero risk of making the wrong decision. This risk increases with the amount of comparable alternatives, particularly if the chances of preferability for some of them are not very different from each other. Does generate the comparison "as a whole" other changes in the results of the pair-wise comparison of alternatives? Particularly important is the question of possible depending order of the alternatives in their set defined by preferebilities on using concrete approaches to comparing. The answer to this question is negative: the order established under the pair-wise comparison is the same as the order for comparing “as a whole”. However, an estimation of true value of the risk associated with decision-making is useful for decision-maker or expert. Mentioned risk is in fact greater than risk that was estimated by pair-wise comparison because is determined not only by the 168 International Journal “Information Theories and Applications”, Vol. 22, Number 2, 2015 configurations of the compared pairs of alternatives, but also the concrete set of compared alternatives i.e. the risk depends on the context. The presence of a large number of alternatives aimed at achieving the same goal is a characteristic of the upper hierarchical levels of decision-making. Perhaps this is why the risk of making not quit right decision is more likely to upper management levels. If because of some reasons it is necessary to select a number of alternatives to supporting, the delegation of authority to lower management levels with the assignment of appropriate rights of decision-making concerning corresponding subset of alternatives is presented in the framework of the considered here approach to comparing as the well-founded, because it reduces the risks of decision-making at each level of management.

Keywords: collective effect for comparing the interval alternatives, dependence of the risk of making the wrong decision about prefer ability on context, taking into account results comparing “as a whole” during deciding on preferebility

ACM Classification Keywords: H.1.2 Human information processing; G3 Distribution functions; I.2.3 Uncertainty, “fuzzy”, and probabilistic reasoning.

Link:

СРАВНЕНИЕ ИНТЕРВАЛЬНЫХ АЛЬТЕРНАТИВ “В ЦЕЛОМ”

(Comparing Interval Alternatives “As a Whole”)

Михаил Стернин, Геннадий Шепелев

http://www.foibg.com/ijita/vol22/ijita22-02-p05.pdf

LOGIC-LINGUISTIC MODEL OF FACT GENERATION FROM TEXT STREAMS OF CORPORATE...
By: Nina Khairova, Nataliya Sharonova, Ajit Pratap Singh Gautam   (2795 reads)
Rating: (1.00/10)

Abstract: This paper proposes a logical-linguistic model extracting semi-structured facts in English texts. To identify the fact some entities expressed by lexical units as well as semantic relations between them are defined in the text. The semantic relations are expressed by semantic functions of sentence participants. A fact is written in form of a triplet: Subject - Predicate - Object, in which the Predicate represents the relations and Subject and Object define the subjects, objects or concepts. Two types of the facts are defined. The first type is fact that describes relation between two entities; the second one is fact that fixes the value of a predetermined attribute. The functions are described by predicates of algebra of finite predicates. The mathematical model allows associating meaning relations of concepts of a sentence with elements of the syntactic and morphological structure of the English sentence. The model is applied to the semantic stage of linguistic processor of information subsystem for facts identification, which are essential for business analysis, in the framework a semi-structured texts. Software implementation of the model is designed. The input subsystem receives text streams disparate sources of information of the integrated corporate system, basic facts of space of the system are output. The accuracy and completeness extracted facts from texts in English by the subsystem are compatible with extracted facts by an expert.

Keywords: the system of facts generation, the automatic facts extraction, semantic relations, the algebra of finite predicates, natural language processing.

ACM Classification Keywords: H.3.3 .Information Search and Retrieval, I.2.4. Knowledge Representation Formalisms and Methods

Link:

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

(Logic-linguistic model of fact generation from text streams of corporate information system)

Нина Хайрова, Наталья Шаронова, Аджит Пратап Сингх Гаутам

http://www.foibg.com/ijita/vol22/ijita22-02-p04.pdf

ON A METHOD OF MULTI-ALGORITHMIC CLASSIFICATION
By: Sergei Lvov, Vladimir Ryazanov   (2633 reads)
Rating: (1.00/10)

Abstract: In this paper the calculating estimates model, based on a system of logical regularities to solve the supervised classification problem is considered. A method of determining the weighting parameters of the decision rule, as well as two methods to eliminate bounce on the classification by introducing a logical disjunction of the negations of regularities and the approximation of regularities by sigmoid logic functions are proposed. The results of numerical experiments are presented.

Keywords: classification, pattern recognition, estimates calculation, multi-algorithmic approach, logical regularities

ACM Classification Keywords: I.2.4 Artificial Intelligence Knowledge Representation Formalisms and Methods – Predicate logic; I.5.1 Pattern Recognition Models – Deterministic, H.2.8 Database Applications, Data mining; I.5.3 Clustering.

Link:

ОБ ОДНОМ МЕТОДЕ МУЛЬТИАЛГОРИТМИЧЕСКОЙ КЛАССИФИКАЦИИ

(On a method of multi-algorithmic classification)

Сергей Львов, Владимир Рязанов

http://www.foibg.com/ijita/vol22/ijita22-02-p03.pdf

HIERARCHY OF EMERGENT PROPERTIES OF ALTERNATIVES IN SYSTEMS ANALYSIS
By: Albert Voronin  (2258 reads)
Rating: (1.00/10)

Abstract: It is shown, that under vector approach a decision-making problem by means of decomposition of alternative’s emergent properties can be presented by a hierarchical system of criteria. At the bottom level estimation of the alternative on separate properties is carried out through a vector of criteria, and at the top level by means of mechanism of composition the estimation of the alternative as a whole turns out. The problem is solved by method of nested scalar convolutions of vector-valued criteria. The methodology of the problem solving is based on complementarity principle by N. Bohr and theorem of imperfection by K. Gödel.

Keywords: hierarchy, emergence, embedded scalar convolutions, multicriteriality

ACM Classification Keywords: H.1 Models and Principles, H.1.1 Systems and Information Theory; H.4.2 Types of Systems

Link:

ИЕРАРХИЯ ЭМЕРДЖЕНТНЫХ СВОЙСТВ АЛЬТЕРНАТИВ В СИСТЕМНОМ АНАЛИЗЕ

(Hierarchy of Emergent Properties of Alternatives in Systems Analysis)

Альберт Воронин

http://www.foibg.com/ijita/vol22/ijita22-02-p02.pdf

DEVELOPMENT, STUDY AND PRESENTATION OF FUNCTIONS AND OPERATIONS ON ONTOLOGIES
By: Alexandr Palagin, Sergey Krivii, Nikolay Petrenko  (1967 reads)
Rating: (1.00/10)

Abstract: A set of functions and operations on ontologies for effective representation, analysis, transformation and construction of ontologies is defined.

Keywords: ontology, functions, operations, transformations, construction.

ACM Classification Keywords: I.2 Artificial Intelligence – I.2.4 Knowledge Representation Formalisms and Methods.

Link:

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

(Development, Study and Presentation of Functions and Operations on Ontologies)

Александр Палагин, Сергей Крывый, Николай Петренко

http://www.foibg.com/ijita/vol22/ijita22-02-p01.pdf

PASSIVE STEGANALYSIS OF MULTIDOMAIN EMBEDDING METHODS
By: Dmytro Progonov, Serhii Kushch   (2008 reads)
Rating: (1.00/10)

Abstract: The paper is devoted to analysis of effectiveness the usage of modern statistical model of digital image for revealing the stego images with data, embedded in transformation domain of cover images. It is considered the case of applying of standard Subtractive Pixel Adjacency Matrix model for detection the presence of stegodata, hidden with usage of various type the cover image transformation – Discrete Cosine Transform, Discrete Wavelets Transform, Singular Value Decomposition. It is established that accuracy of stego image detection by usage of the model rises by increasing the amount of stage the cover image processing and significantly depends on type of embedded stegodata.

Keywords: passive steganalysis, multistage embedding methods, digital images.

ACM Classification Keywords: D.4 Operating Systems – Security and protection – Information flow controls.

Link:

PASSIVE STEGANALYSIS OF MULTIDOMAIN EMBEDDING METHODS

Dmytro Progonov, Serhii Kushch

http://www.foibg.com/ijita/vol22/ijita22-01-p06.pdf

REVIEW OF THE SOFTWARE SOLUTIONS OF LOGISTIC TASKS
By: Vitalii Lytvynov, Alina Posadska  (2956 reads)
Rating: (1.00/10)

Abstract: Description of software solutions for logistic tasks and their comparative analysis are considered in the article. The selection of the functionality of Logistics Information System, which is designed to automate the planning of the transport delivery of freights, is presented. The logistical tasks considering features of transportation of agricultural freights, which should solve the Logistics Information System, are analyzed.

Keywords: logistics information system, automation of delivery routes, temporary infrastructure, GIS – technology, ERP-systems.

ACM Classification Keywords: D.2.0 Genera - Software Engineering.

Link:

REVIEW OF THE SOFTWARE SOLUTIONS OF LOGISTIC TASKS

Vitalii Lytvynov, Alina Posadska

http://www.foibg.com/ijita/vol22/ijita22-01-p05.pdf

CONSTRUCTING AN OPTIMAL INVESTMENT PORTFOLIO BY USING FUZZY SETS THEORY
By: Yuri Zaychenko, Inna Sydoruk   (2138 reads)
Rating: (1.00/10)

Abstract: The problem of constructing an optimal portfolio of securities under uncertainty was considered. The global market crisis of recent years has shown that the existing theory of optimization of investment portfolios and forecasting stock indices exhausted and the revision of the basic theory of portfolio management is strongly needed. Therefore the fuzzy sets theory was used for getting an optimal portfolio. In this paper direct, dual and multicriteria problems with the use of triangular membership functions work were considered. The problem of portfolio optimization during the time period also was described in this article. In direct task we define structure of a portfolio, which will provide the maximum profitableness at the set risk level. In dual task we define structure of a portfolio, which will provide the minimum risk level at the set level of critical profitableness. In multicriteria problem we simultaneously maximize profitability and minimize risk level. The input data for the optimization system were predicted by using the Fuzzy Group Method of Data Handling (FGMDH). The optimal portfolios for assets were determined. The comparative analysis of optimal portfolios obtained by different methods and approaches was fulfilled.

Keywords: membership function, fuzzy sets theory, optimal portfolio, investments, stock securities, fuzzy number, FGMDH

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.

Link:

CONSTRUCTING AN OPTIMAL INVESTMENT PORTFOLIO BY USING FUZZY SETS THEORY

Yuri Zaychenko, Inna Sydoruk

http://www.foibg.com/ijita/vol22/ijita22-01-p04.pdf

PROCESSING SETS OF CLASSES’ LOGICAL REGULARITIES
By: Anatoliy Gupal, Maxim Novikov, Vladimir Ryazanov   (2427 reads)
Rating: (1.00/10)

Abstract: The paper considers two methods for processing sets of logical regularities of classes (LRC) found by training samples analysis. The first approach is based on the minimization of logical descriptions of classes. As a result of solving the problem of linear discrete optimization, the shortest logic description of each class is found. Each training object satisfies at least to one LRC of found irreducible subset of logical regularities. The second approach is based on the clustering of the set of LRC and selecting standards of derived clusters. The clustering problem is reduced to the clustering of representations of LRC set. Here each LRC is represented in the form of binary vector with different informative weight. A modification of the known method of "variance criterion minimization" for the case where the objects have different information weights is proposed. We present the results of illustrative experiments.

Keywords: classification, logical regularity of class, feature, clustering

ACM Classification Keywords: I.2.4 Artificial Intelligence Knowledge Representation Formalisms and Methods – Predicate logic; I.5.1 Pattern Recognition Models – Deterministic, H.2.8 Database Applications, Data mining

Link:

PROCESSING SETS OF CLASSES’ LOGICAL REGULARITIES

Anatoliy Gupal, Maxim Novikov, Vladimir Ryazanov

http://www.foibg.com/ijita/vol22/ijita22-01-p03.pdf

INTELLIGENT TRADING SYSTEMS
By: Luis F. de Mingo, Nuria Gómez Blas, Alberto Arteta  (2335 reads)
Rating: (1.00/10)

Abstract: During last 50 years, the markets have been object of study. Technical and fundamental indicators have been used to try to predict the behavior of the market and then execute buying or selling orders. Neural networks are currently being used with good results although they can be useless after a period of time. This paper proposes an algorithm that combines bioinspired techniques to maximize the hits in the prediction rates. The proposal shown in this paper relies in an ANN to achieve these goals. The differential factors of this approach are the election of the ANN structure with grammatical swarm and the training process through the use of HydroPSO. Also a grammatical swarm algorithm is used to generate trading rules, this method shows better results than the first approach. This combination of techniques provides an automatic way to define the most suitable bioinspired model for the instrument in our analysis.

Keywords: Trading strategies, Technical indicators, Grammatical Swarm, Neural networks.

ACM Classification Keywords: F.1.1 Theory of Computation - Models of Computation, I.2.6 Artificial Intelligence.

Link:

INTELLIGENT TRADING SYSTEMS

Luis F. de Mingo, Nuria Gómez Blas, Alberto Arteta

http://www.foibg.com/ijita/vol22/ijita22-01-p02.pdf

CHARACTERIZATION OF A CUFF-BASED SHAPE MEMORY ALLOY (SMA) ACTUATOR
By: Wang et al.  (2293 reads)
Rating: (1.00/10)

Abstract: This article proposes a novel cuff-based microactuator for automatic blood extraction using Shape Memory Alloy (SMA) technology. It aims to provide an actuator solution for an electronic mosquito-like device, e-Mosquito, which enhances blood glucose measurement to off the potential to significantly improve both the quality of life for diabetic patients and their disease management. Fabrication and assembly methods of the microactuator prototype are discussed. The 6-mm thick microactuator prototype underwent mechanical tests in a laboratory environment to characterize its penetration force and depth, which are the major factors facilitating skin penetration and blood extraction. Testing results demonstrated that this actuator can produce a maximum penetration force of 160gf and a maximum displacement depth of 2.45mm, which both exceed the minimum force and depth requirements for blood capillary-reaching skin penetration in humans. Five actuator prototypes were assembled and integrated to a cuff wrist strap. A pilot human study was performed to test the blood extraction capabilities of the device. All five actuators successfully penetrated the skin and drew whole blood samples appearing on the skin surface of the subject.

Keywords: BioMEMS, Shape Memory Alloy Actuator, Diabetes, Blood Extraction.

ACM Classification Keywords: J.3 Life and Medical Sciences.

Link:

CHARACTERIZATION OF A CUFF-BASED SHAPE MEMORY ALLOY (SMA) ACTUATOR

Gang Wang, Michael D. Poscente, Simon S. Park, Orly Yadid-Pecht?, Martin P. Mintchev

http://www.foibg.com/ijita/vol22/ijita22-01-p01.pdf

DECISION MAKING PROBLEM WITH FUZZY SET OF GOAL SETS
By: Sergiy Mashchenko, Oleksandr Bovsunivskyi   (2391 reads)
Rating: (1.00/10)

Abstract: The problem of alternatives rational choice, in which goal of person who makes decision, is defined with the fuzzy set of fuzzy goal (aim) sets. The concept of intersection of fuzzy set of fuzzy sets is introduces and in it also investigated its properties.

Keywords: fuzzy set, fuzzy goal, membership function, fuzzy set of type 2, decision making, rational choice.

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

Link:

DECISION MAKING PROBLEM WITH FUZZY SET OF GOAL SETS

Sergiy Mashchenko, Oleksandr Bovsunivskyi

http://www.foibg.com/ijita/vol19/ijita19-3-p07.pdf

MODELING AND OPTIMIZATION OF CRYOGENIC – OPTICAL GRAVIMETERS
By: Vitaliy Yatsenko, Nikolay Nalyvaychuk   (2854 reads)
Rating: (1.00/10)

Abstract: This paper considers the problem of designing and developing optical-cryogenic devices using optimization techniques, modeling, and new materials. We have shown how to produce reliable YBCO thin films with controllable surfaces and physical properties and how to integrate them in a ring form into the opticalcryogenic gravimeter so as to reduce its size and render it convenient for future space applications. Its function is based on the magnetic levitation phenomenon of the probe and on the measurement of its displacement with subsequent data processing.

Keywords: gravimeter, modeling, optimization, HTSC, YBCO, thin films, superconducting ring

ACM Classification Keywords: 1.6. Simulation and modeling, H.1 Models and principles. Optimization

Link:

MODELING AND OPTIMIZATION OF CRYOGENIC – OPTICAL GRAVIMETERS

Vitaliy Yatsenko, Nikolay Nalyvaychuk

http://www.foibg.com/ijita/vol19/ijita19-3-p05.pdf

AN ESTIMATION OF TIME REQUIRED FOR MODELING OF AN ALGORITHM CALCULATE...
By: Tasho Tashev   (1956 reads)
Rating: (1.00/10)

Abstract: The problem of calculating a non-conflict schedule by packets commutation in crossbar switch node is one of the foremost problems at the stage of node design. From a mathematical point of view this task is NPcomplete. Constantly rising levels of traffic communication require developing of new algorithms. These algorithms must be correctly compared with known algorithms. In this paper we presented the investigations on the time execution of known PIM-algorithm for crossbar switch by means of CERN’s grid-structure. By computer simulation of switching and using synthesized Generalized Nets (GN) model of the PIM-algorithm the execution time is obtained. Its assessment is based on the modeling of the throughput in the presence of uniform incoming traffic. It is shown that direct receiving of the characteristics of simulation time with the required accuracy would require the introduction of strictly defined control points.

Keywords: Modeling, Generalized Nets, Communication Node, Crossbar Switch, Algorithm, Simulation.

ACM Classification Keywords: B.4.4 Performance Analysis and Design Aids, C.2.1 Network Architecture and Design, C.4 Performance of Systems

Link:

AN ESTIMATION OF TIME REQUIRED FOR MODELING OF AN ALGORITHM CALCULATE A NON-CONFLICT SCHEDULE FOR CROSSBAR SWITCH NODE BY MEANS OF GRID-STRUCTURE

Tasho Tashev

http://www.foibg.com/ijita/vol19/ijita19-2-p07.pdf

TREND, DECOMPOSITION AND COMBINED APPROACHES OF TIME SERIES FORECASTING...
By: Vitalii Shchelkalin   (1961 reads)
Rating: (1.00/10)

Abstract: In presented paper mathematical models and methods based on joint applying ideas of the “Caterpillar”-SSA and Box-Jenkins? methods are produced. This combination of models lead to a synergy and mutually compensate the opposite by nature shortcomings of each models separately and increases the accuracy and stability of the model. The further development of technique for models constructing, technique of BoxJenkins?, and improvement of themselves autoregressive integrated moving average (ARIMA) models, designed about forty years ago and remaining in present time as one of the most efficient models for modeling, forecasting and control exceeding their own rivals on whole row of criterions such as: economy on parameters quantity, labour content of models building algorithm and resource-density of their realization, on formalization and automation of models construction is produced. A novel autoregressive spectrally integrated moving average (ARSIMA) model which describes a wider class of processes in contrast to the Box-Jenkins? models is developed. Decomposition and combined forecasting methods based on “Caterpillar”-SSA method for modeling and forecasting of time series is developed. The essence of the proposed decomposition forecasting method and combined forecasting method consist in decomposing of time series (exogenous and predicted) by the “Caterpillar”-SSA method on the components, which in turn can be decomposed into components with a more simpler structure for identification, in selection from any of these components of constructive and dropping the destructive components, and in identification of those constructive components that are proactive on the propagated time series, or vice versa if its delay interval is less than the required preemption interval of forecasting, mathematical models with the most appropriate structure (in the combined approach) or its ARIMAX models (in decomposition approach) models and calculation of their predictions to the required lead time, to use the obtained models, or as a comb filter (in the case of signals modeling), or as an ensemble of models, setting the inputs of MISO model or used as a component of the combined mathematical model whose parameters are adjusted to further cooptimization method. In such models as inputs can be also include the instantaneous amplitudes, obtained after applying the Hilbert transform to the components of the expansions. The advantages of the proposed methods for models of the processes constructing is its rigorous formalization and, therefore, the possibility of complete automation of all stages of construction and usage of the models.

Keywords: modeling, filtering, forecasting, control, "Caterpillar"-SSA method, ARIMA model, "Caterpillar"-SSA – ARIMA – SIGARCH method, ARSIMA model, ARSIMA – SIGARCH model, heteroskedasticity, LevenbergMarquardt? method, Davidon–Fletcher–Powell? method, decomposition forecasting method, combined forecasting methods, Hilbert transform.

Link:

TREND, DECOMPOSITION AND COMBINED APPROACHES OF TIME SERIES FORECASTING BASED ON THE “CATERPILLAR”-SSA METHOD

Vitalii Shchelkalin

http://www.foibg.com/ijita/vol19/ijita19-2-p11.pdf

INTRODUCTION TO STORING GRAPHS BY NL-ADDRESSING
By: Krassimira B. Ivanova et al.  (1908 reads)
Rating: (1.00/10)

Abstract: This paper introduces an approach to storing graphs based on the Natural Language Addressing in multidimensional numbered information spaces. A sample graph is analyzed to find its proper NL-representation. Taking in account the interrelations between nodes and edges, a “multi-layer” representation is possible and identifiers of nodes and edges can be avoided. The advantages and disadvantages of NL-addressing for the multi-layer representation of graphs are discussed.

Keywords: graphs; addressing; natural language addressing.

ACM Classification Keywords: D.4.3 File Systems Management, Access methods.

Link:

INTRODUCTION TO STORING GRAPHS BY NL-ADDRESSING

Krassimira B. Ivanova, Koen Vanhoof, Krassimir Markov, Vitalii Velychko

http://www.foibg.com/ijita/vol20/ijita20-03-p08.pdf

AN ARCHITECTURE FOR REPRESENTING BIOLOGICAL PROCESSES BASED ON NETWORKS...
By: Sandra Gómez Canaval et al.  (1810 reads)
Rating: (1.00/10)

Abstract: In this paper we propose the use of Networks of Bio-inspired Processors (NBP) to model some biological phenomena within a computational framework. In particular, we propose the use of an extension of NBP named Network Evolutionary Processors Transducers to simulate chemical transformations of substances. Within a biological process, chemical transformations of substances are basic operations in the change of the state of the cell. Previously, it has been proved that NBP are computationally complete, that is, they are able to solve NP complete problems in linear time, using massively parallel computations. In addition, we propose a multilayer architecture that will allow us to design models of biological processes related to cellular communication as well as their implications in the metabolic pathways. Subsequently, these models can be applied not only to biological-cellular instances but, possibly, also to configure instances of interactive processes in many other fields like population interactions, ecological trophic networks, industrial ecosystems, etc.

Keywords: Networks of biologically-inspired processors, Bioinspired Architectures, Computational Models, Natural Computing.

ACM Classification Keywords: F.1.1 Models of Computation - Unbounded-action devices.

Link:

AN ARCHITECTURE FOR REPRESENTING BIOLOGICAL PROCESSES BASED ON NETWORKS OF BIO-INSPIRED PROCESSORS

Sandra Gómez Canaval, Fernando Arroyo and José Ramón Sánchez-Couso?

http://www.foibg.com/ijita/vol20/ijita20-03-p03.pdf

MODELING OF COGNITIVE PROCESSES BY NETWORK MODELS
By: Sergii Konovalenko   (1993 reads)
Rating: (1.00/10)

Abstract: The paper describes the conceptual issues of modeling cognitive processes network models at different levels. Describes possible methods construction of intelligent information processing systems based connectionism attitudes and behavior of the human mind. Proposed use of synthesis of hierarchical model based on two approaches: from neuron to concepts.

Keywords: cognitive process, network model, neural networks.

ACM Classification Keywords: I.2 ARTIFICIAL INTELLIGENCE – I.2.6 Learning – Connectionism and neural nets.

Link:

MODELING OF COGNITIVE PROCESSES BY NETWORK MODELS

Sergii Konovalenko

http://www.foibg.com/ijita/vol20/ijita20-02-p08.pdf

[prev]  Page: 13/66  [next]
1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66 
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.26 secs ]   [ Memory usage: 7.57MB ]   [ GZIP Disabled ]   [ Server load: 0.59 ]