The determination of all syzygies for the dependent polynomial invariants of the Riemann tensor. I. Pure Ricci and pure Weyl invariants

In this paper, we shall consider all pure Ricci and pure Weyl scalar invariants of any degree, in a four-dimensional Lorentzian space. We present a general graph-theoretic based reduction algorithm which decomposes, using syzygies, any pure invariant in terms of the independent base invariants {r₁,r₂,r₃} or {w₁,w₂}

The determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. II. mixed invariants of Eeven degree in the Ricci Spinor

We continue our analysis of the polynomial invariants of the Riemann tensor in a four-dimensional Lorentzian space. We concentrate on the mixed invariants of even degree in the Ricci spinor Φ_ABȦḂ and show how, using constructive graph-theoretic methods, arbitrary scalar contractions between copies of the Weyl spinor ψ_ABCD, its conjugate ψ_ȦḂĊḊ and an even number of Ricci spinors can be expressed in terms of paired contractions between these spinors. This leads to an algorithm for the explicit expression of dependent invariants as polynomials of members of the complete set. Finally, we rigorously prove that the complete set as given by Sneddon [J. Math. Phys. 39, 1659-1679 (1998)] for this case is both complete and minimal.

Determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. III. mixed invariants of arbitrary degree in the Ricci Spinor

In this paper, we rigorously prove that the complete set of Riemann tensor invariants given by Sneddon [J. Math. Phys. 40, 5905 (1999)] is both minimal and complete. Furthermore, we provide a two-stage algorithm for the explicit construction of polynomial syzygies relating any dependent Riemann tensor invariant to members of the complete set.

A Grobner-Shirshov algorithm for applications in internet security

The design of multiple classification and clustering systems for the detection of malware is an important problem in internet security. Grobner-Shirshov bases have been used recently by Dazeley et al. [15] to develop an algorithm for constructions with certain restrictions on the sandwich-matrices. We develop a new Grobner Shirshov algorithm which applies to a larger variety of constructions based on combinatorial Rees matrix semigroups without any restrictions on the sandwich matrices.

Switch point finding using polynomial regression for fuzzy type reduction algorithms

Karnik-Mendel (KM) algorithm is the most widely used type reduction (TR) method in literature for the design of interval type-2 fuzzy logic systems (IT2FLS). Its iterative nature for finding left and right switch points is its Achilles heel. Despite a decade of research, none of the alternative TR methods offer uncertainty measures equivalent to KM algorithm. This paper takes a data-driven approach to tackle the computational burden of this algorithm while keeping its key features. We propose a regression method to approximate left and right switch points found by KM algorithm. Approximator only uses the firing intervals, rnles centroids, and FLS strnctural features as inputs. Once training is done, it can precisely approximate the left and right switch points through basic vector multiplications. Comprehensive simulation results demonstrate that the approximation accuracy for a wide variety of FLSs is 100%. Flexibility, ease of implementation, and speed are other features of the proposed method.