Granular computing classification algorithms are proposed based on distance measures between two granules from the view of set. Firstly, granules are represented as the forms of hyperdiamond, hypersphere, hypercube, and hyperbox. Secondly, the distance measure between two granules is defined from the view of set, and the union operator between two granules is formed to obtain the granule set in...

An advanced and exact geometric description of nonlinear precession dynamics modeling very accurately natural and artificial couplings showing Lorentz symmetry is derived. In the linear description it is usually ignored that the geometric phase of relativistic motion couples back to the orbital motion providing for a non-linear recursive precession dynamics. The high coupling strength in the no...

We explore discrete approaches in LQG where all fields, the gravitational tetrad, and the matter and energy fields, are encoded implicitly in a graph instead of being additional data. Our graph should therefore be richer than a simple simplicial decomposition. It has to embed geometrical information and the standard model. We start from Lisi’s model. We build a trivalent graph which is an F4 la...