An analysis on potential renewable energy system using triangular tile pasting as a Markov Chain in terms of Maximal Clique

Abstract

Transformation is an art of wavering chattels from one location to the other location or one zone to the other zone or one pattern to the other pattern. Designing any regular or irregular polygonal structures especially in tile pasting plays decisive portrayal of procreation. Tile pasting is a technique of gluing tiles in sequence of specific nature, and subsidize collection of structures to the constructors. The sequence of tile pasting can be analyzed and the best sequential path will be determined using Viterbi Algorithm. The pictorial representation of Viterbi algorithm is the trellis path that hand out more strength to the algorithm which shows the sequential order of tile pasting effectively. This paper will also be initiated to find the renewable energy produced by gluing triangular tiles of different polygonal structures and gives an intention to identify the most effective structure among the shapes discussed.

An Analysis on the Markovian Model for Production Management and Establishment of New Pharmacies Using Hyper Graph

“…Since the maximal clique c * 1 exists in all hyper assignments and the corresponding edge c 1 is adjacent to all other edges of a given hypergraph, every clique of a hyper assignment is connected to each other. erefore, the hypergraph corresponding to the given model representing the Markov chain is irreducible [22]. Hyper assignments are identi ed using cliques rather than the nonadjacency search method is reliable and adapted to di erent circumstances.…”