The problem of uniform exact model matching is studied via state and output feedback, for a class of linear time-varying analytic systems. The following two major issues are resolved: The nessecary and sufficient conditions for the problem to have a solution and the general analytical expressions for the controller matrices. A major feature of the proposed approach, is that it reduces the unifo...

Biometrics such as fingerprints, irises, faces, voice, gait and hands are often used for access control, authentication and encryption instead of PIN and passwords. In this paper a syndrome decoding technique is proposed to provide a secure means of storing and matching various biometrics data. We apply an algebraic coding technique called coset decomposition to the model of fingerprint biometr...

In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and use properties...

Pattern matching is a powerful tool for symbolic computations, based on the well-defined theory of term rewriting systems. Application domains include algebraic expressions, abstract syntax trees, and XML and JSON data. Unfortunately, no lightweight implementation of pattern matching as general and flexible as Mathematica exists for Python [Pö16], [Hao14], [Sch14], [Jen15]. Therefore, we create...

The JMatch language extends Java with iterable abstract pattern matching, pattern matching that is compatible with the data abstraction features of Java and makes iteration abstractions convenient. JMatch has ML-style deep pattern matching, but patterns can be abstract; they are not tied to algebraic data constructors. A single JMatch method may be used in several modes; modes may share a singl...

The JMatch language extends Java with iterable abstract pattern matching, pattern matching that is compatible with the data abstraction features of Java and makes iteration abstractions convenient. JMatch has ML-style deep pattern matching, but patterns can be abstract; they are not tied to algebraic data constructors. A single JMatch method may be used in several modes; modes may share a singl...

Segregation and matching are techniques to estimate variance components in mixed models. A question arising is whether segregation can be applied in situations where matching does not apply. Our motivation for this research relies on the fact that we want an answer to that question and to explore this important class of models that can contribute to the development of mixed models. That is poss...

The graphical realization of a given degree sequence and partition adjacency matrix simultaneously is relevant problem in data driven modeling networks. Here we formulate common generalizations this the Exact Matching Problem, solve them with an algebraic Monte-Carlo algorithm that runs polynomial time if number classes bounded.

Various theoretical equations have been proposed to predict response rate as a function of the rate of reinforcement. If both the rate and probability of reinforcement are considered, a simple identity, defining equation, or "law" holds. This identity places algebraic constraints on the allowable forms of our mathematical models and can help identify the referents for certain empirical or theor...

MBPConflate is proof-of-concept software developed to aid in conflation research. The program implements a powerful algorithm for automatic multi-source image conflation that utilizes new Algebraic Systems-based similarity metrics during the feature comparison process. One benefit of integrating Algebraic Systems into the feature comparison process is that more global shape properties can be di...