All international and domestic spheres of production service are developing at a frantic pace, in modern life it is no longer possible to imagine any enterprise or government institution without connecting the Internet using cloud services. The development digital technologies forces application innovative solutions everyday entertainment. In our age with society’s current dependence on high-te...

A prototype for an extensible interactive graphical term manipulation system is presented that combines pattern matching and nondeterministic evaluation to provide a convenient framework for doing tedious algebraic manipulations that so far had to be done manually in a semi-automatic fashion.

The problem of fault accommodation is considered for a class of nonlinear systems whose purpose is tracking the prescribed trajectory. In the framework of solving above problem, two main tasks are investigated involving algebraic tools (algebra of functions). The first task is nonlinear model reduction followed by adaptive observer design for fault estimation. The second one is asymptotic model...

This paper briefly describes process functional language compiler architecture. Process functional language is an experimental functional language with imperative features like memory cell variables. The main parts of the process functional language compiler are presented with short description and examples. Current implementation of PFL compiler comprises a algebraic types, primitive functions...

Local feature matching is an essential component of many image retrieval algorithms. Euclidean and Mahalanobis distances are mostly used in order to compare two feature vectors. The first distance does not give satisfactory results in many cases and is inappropriate in the typical case where the components of the feature vector are incommensurable, whereas the second one requires training data....

This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does not depend on identifying common points. It uses the method of algebraic invariants to provide a common set of coordinates to images using chains of line segments formally described as polylines with possible gaps bet...

We report on implementing graph grammars for intelligence analysis in OCaml. Graph grammars are represented as elements of an algebraic data type in OCaml. In addition to algebraic data types, we use other concepts from functional programming languages to implement features of graph grammars. We use type checking to perform graph pattern matching. Graph transformations are defined as implicit c...

The first ideas about programmable rewriting strategies supporting generic term traversal were developed in the algebraic specification formalism ASF+SDF [3]. That paper introduces the 2 (all) and 3 (one) traversal primitives, and their use in the definition of full term traversals such as bottomup, topdown, and innermost. The calculus of strategy operators is further developed and formalized u...

In this paper, we consider high-level structures like graphs, Petri nets, and algebraic specifications and investigate two kinds of satisfiability of conditions and two kinds of rule matching over these structures. We show that, for weak adhesive HLR categories with class A of all morphisms and a class M of monomorphisms, strictly closed under decompositions, Aand M-satisfiability and Aand M-ma...

Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a...