Research & Reviews: Discrete Mathematical Structures
Volume 3, Issue 2 (2016)
Published
Table of contents
-
Numerical Programming in Computational Biology
Abstract: The field of computational science has encountered a gigantic development in the recent years. In this list of sources, we overview probably the most noteworthy commitments that were made to the field and which utilize as numerical programming strategies, while giving a wide review of use territories of cutting edge computational sub-atomic science. The regions incorporate arrangement examination, microarrays, protein structure and work, haplotyping and developmental separations.Cite this ArticleHimanshu Verma. …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 1–4 Read article
-
A Statistical Approach Noise Tolerant Texture Classification
Abstract: A simple, efficient, yet robust multi resolution approach to texture classification binary rotation invariant and noise tolerant. The proposed approach is very fast to build and very compact while remaining robust to illumination variations, rotation changes, and noise. We have developed a novel and simple strategy to compute a local binary descriptor based on the conventional local binary pattern (LBP) approach, preserving the advantageous characteristics of uniform LBP. Points are …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 14–19 Read article
-
Enhanced Association Rule Mining Algorithm (EARMA) for Reducing Computational Time on Large Data Set
Abstract: Association rule learning is a trendy process for discovering exciting relationships between variables in big database. It is frequently used in market basket analysis field e.g. if a buyer buys onions and potatoes then he also purchases beef. But, in fact, it can be implemented in different application area where we want to determine the association among variables. The APRIORI method is definitely the trendiest. But, even with its good …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 20–25 Read article
-
Homogeneous geodesics on the solvable homogeneous principal bundles
Abstract: Let $M=G/K$ be a homogeneous differentiable manifold .We consider the homogeneous bundle $\Im=(G,\pi,G/K,K)$ and the tangent bundle $\tau_{G/K}$ of $M=G/K$. Let $G$ be a connected Lie group and $K$a closed subgroup of $G$. We take the Lie algebras $\cal{G}$ and$\cal{K}$ of $G$ and $K$ respectively and define $\xi=(G\times_{K}\cal{ G} / \cal {K}, \rho_{\xi}, \emph{G} / \emph{K},\cal {G} /\cal {K})$ to be the bundle associated with $\Im$. We considerthat $ \xi$ …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 26–37 Read article
-
Laceability in Line Graphs and Jump Graphs of Petersen Graph
Abstract: A simple connected graph is Hamiltonian laceable if there exists a Hamiltonian path between every pair of distinct vertices at an odd distance in it. is Hamiltonian-t-laceable (t*-laceable) if there exists a Hamiltonian path in between every pair (at least one pair) of vertices u and v in with the property Manjunath et al. obtained Hamiltonian laceability properties in line graphs and jump graphs of some graphs. In this paper …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 5–13 Read article