— In this paper, an algorithm for construction of multiple sets of two dimensional (2D) or matrix unipolar (optical) orthogonal codes has been proposed. Representations of these 2D codes in difference of positions representation (DoPR) have also been discussed along-with conventional weighted positions representation (WPR) of the code. This paper also proposes less complex methods for calculati...

a series of experiments were designed to utilize the taguchi method for investigating the effects of important parameters on the synthesis of nax zeolite and to find the best conditions of synthesis. an l9 orthogonal design of taguchi approach was applied to design experiments consisting of 9 trails. the effect of molar composition, including sio2/al2o3 and na2o/al2o3 ratios, and the crystalliz...

An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we consider the case where the graph to be covered twice is the complete bipartite graph Kmn,mn (for any values ofm,n) and all graphs in the collection are isomorphic to certa...

CoHErrelation between weldability and improvement in properties is a key issue in materials science research. The objective of this work is to optimize the process parameters viz., aging temperature, aging time, solutionizing time, to enhance the hardness of Al6061 alloy. Hence, the present paper deals with hardness study of Tungsten Inert Gas welded 6061 aluminium alloy after age hardening und...

Existence of fixed point in orthogonal metric spaces has been initiated recently by Eshaghi and et al. [On orthogonal sets and Banach fixed Point theorem, Fixed Point Theory, in press]. In this paper, we introduce the notion of the strongly orthogonal sets and prove a genuine generalization of Banach' fixed point theorem and Walter's theorem. Also, we give an example showing that our main theor...

The uni-polar orthogonal codes, with code length 'n' and code weight 'w' having auto-correlation and cross-correlation constraints equal to 1, can be designed with proposed algorithm. This proposed scheme design all the possible groups containing maximum number of orthogonal codes as per Johnson bounds. In this case, each of the designed groups is independent with other groups of uni-polar orth...

When an orthogonal array is projected on a small number of factors, as is done in screening experiments, the question of interest is the structure of the projected design, by which we mean its decomposition in terms of smaller arrays of the same strength. In this paper we investigate the decomposition of arrays of strength t having t + 1 factors. The decomposition problem is well-understood for...