Open Access Short Research Article

Mathematical Model of Formation Aerosol Particles Fractal Storm Cloud

Tembulat Kumykov, Roman Parovik

Journal of Advances in Mathematics and Computer Science, Page 1-5
DOI: 10.9734/10.9734/BJMCS/2015/18497

The paper proposes a new educational model of aerosol particles in thunderclouds. The model takes into account the fractal properties of the storm clouds, and its solution was obtained by numerical methods of fractional calculus. Built new pro les calculated curves that are consistent with the classical Lifshitz-Slezov-Wagner theory.

Open Access Original Research Article

Computational Algorithms for Syndrome Based Single Error Correction in Residue Number Systems

Hari Krishna Garg

Journal of Advances in Mathematics and Computer Science, Page 1-18
DOI: 10.9734/BJMCS/2015/19903

Error control via residue number systems continues to attract researchers’ attention as evidenced by recent publications dealing with their applications in digital communications and computing. In this paper, we present syndrome based decoding algorithms and analyze their algebraic structure for single error correction in such systems. The mathematical framework is also extended to single error correction and simultaneous multiple error detection. We also bring residue number system product codes under the same framework. Specifically, all the algorithms are based on the computation of a single syndrome value. Computational aspects are also studied along with conditions for the validity of the syndrome based algorithmic approach being described here. Numerous examples are given to illustrate the structure, properties, and decoding procedures associated with the algorithms.

Open Access Original Research Article

The Application of Modified F-expansion Method Solving the Maccari’s System

A. Aasaraai

Journal of Advances in Mathematics and Computer Science, Page 1-14
DOI: 10.9734/BJMCS/2015/19938

The present article investigates the use of a modified F-expansion method in finding the exact traveling wave solution of two-component nonlinear partial differential equations (NLPDEs). More specifically, this method is used to construct new solutions to the nonlinear Maccari’s system (1+2)-dimensional. The solutions obtained can exactly generate soliton solutions, triangular periodic wave solutions, exponential and rational solutions unther some certain condition. In addition, some fig-uses of partial solutions for direct-viewing analysis are suggested.

Open Access Original Research Article

Hiding Secret Information in DNA Sequences Using Silent Mutations

Amal Khalifa, Safwat Hamad

Journal of Advances in Mathematics and Computer Science, Page 1-11
DOI: 10.9734/BJMCS/2015/19561

People are always looking for secure methods to protect valuable information against unauthorized access or use. That's why; disciplines like cryptography and steganography are gaining a great interest among researchers. Although the origin of steganography goes back to the ancient Greeks, recent steganographic techniques hide data into digital media such as sound, images, and videos. However, steganography took a step further to utilize the DNA as a carrier of secret information. DNA-based steganography techniques could be for either authentication or data storage. In this paper, we propose an original idea of hiding data in DNA or RNA called LSBase (Least Significant Base Substitution). It uses a remarkable property of codon redundancy to introduce silent mutations into DNA sequences. In this way, the DNA sequence can be altered without affecting the type or the structure of protein it produces. When compared with other techniques, the proposed algorithm showed to be the only blind technique that is capable of conserving the functionality of the carrier DNA while maintaining a reasonable data payload.

Open Access Original Research Article

Local Binary Pattern and Ant Colony Optimization Based Feature Dimensionality Reduction Technique for Face Recognition Systems

R. S. Babatunde, S. O. Olabiyisi, E. O. Omidiora, R. A. Ganiyu

Journal of Advances in Mathematics and Computer Science, Page 1-11
DOI: 10.9734/BJMCS/2015/19490

Feature dimensionality reduction is the process of minimizing the number of features in high dimensional feature space. It encompasses two vital approaches: feature extraction and feature selection. In face recognition domain, widely adopted face dimensionality reduction techniques include Principal component analysis, Discrete wavelet transform, Linear discriminant analysis and Gabor filters. However, the performances of these techniques are limited by strict requirement of frontal face view, sensitivity to signal shift and sample size, computational intensiveness amongst others. In this paper, a feature dimensionality reduction technique that employed Local binary pattern for feature extraction and Ant colony optimization algorithms for the selection of optimal feature subsets was developed. The developed technique identified and selected the salient feature subsets capable of generating accurate recognition. The average training time, recognition time and recognition rate obtained from the experiment on locally acquired face data using cross-validation evaluation approach indicate an efficient performance of the potential combination of both methods in a two-level technique for dimensionality reduction.

Open Access Original Research Article

A Method for Human Emotion Recognition System

Sarbani Ghosh, Samir K. Bandyopadhyay

Journal of Advances in Mathematics and Computer Science, Page 1-27
DOI: 10.9734/BJMCS/2015/19543

This paper studied computationally efficient algorithm for facial feature selection based on template matching method which further leads to identification of smiling face or neutral face. At first, minimal pre-processing including gray scale conversion is done on the image. After that, matching between original image and template image is done using normalized cross-correlation technique. Each matching area is bounded by box to identify that region of interest. Then the mid points between the eye regions are found and the distance between the mid points and the corners of the mouth region is calculated.  On the basis of the distances between these features, emotions are recognized. After detecting neutral or smiling face, different types of facial expressions are classified using linear support vector machine used as multiclass classifier.

Open Access Original Research Article

V4 Magic Labelings of Some Graphs

P. T. Vandana, V. Anil Kumar

Journal of Advances in Mathematics and Computer Science, Page 1-20
DOI: 10.9734/BJMCS/2015/20515

Let A be an abelian group with identity element 0. A graph G = (V,E) is said to admit an a-sum A-magic labeling if there exists an edge labeling : E(G) −→ A \ {0} and a ∈ A such that the induced vertex labeling + : V (G) −→ A de_ned by

 12.png

is the constant map, +(u) = a for all u ∈ V (G). If a = 0, the labeling is called a zero-sum A-magic labeling of G. A graph G is said to be a-sum (resp.zero-sum) A-magic if G admits an a-sum (resp.zero-sum) A-magic labeling. In this paper we will consider the Klein 4 group V4 = {0, a, b, c} = \mathbb{Z}2 \mathbb{Z}2 and investigate graphs that are a-sum A-magic, zero-sum A-magic and both a-sum and zero-sum A-magic.