In this paper we introduce a new interconnection network Fault Tolerant Hierarchical Interconnection network for parallel Computers denoted by FTH(k, 1).This network has fault tolerant hierarchical structure which overcomes the fault tolerant properties of Extended hypercube(EH).This network has low diameter, constant degree connectivity and low message traffic density in comparisons with other...

A twisted hypercube of dimension k is created from two twisted hypercubes of dimension k − 1 by adding a matching joining their vertex sets, with the twisted hypercube of dimension 0 consisting of one vertex and no edges. We generate random twisted hypercube by generating the matchings randomly at each step. We show that, asymptotically almost surely, joining any two vertices in a random twiste...

Various methods have been proposed to construct Latin hypercube designs with small correlations. Orthogonal arrays have been used to construct Latin hypercube designs with multidimensional stratification. To integrate these two ideas, we propose a method to construct Latin hypercube designs with both controlled correlations and multi-dimensional stratification. For numerical integration, the co...

A ABSTRACT connected hypercube containing faulty nodes/links is called an injured hypercube, f whereas a hypercube without faulty components is called a healthy hypercube. To allow non-aulty nodes in an injured hypercube to communicate with one another, each hypercube node has to be equipped with enough information so as to make correct routing decisions, and 1 y c update the information whenev...

A new interconnection topology-the Extended Hy-percube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same time has some additional advantages like red...

The Latin hypercube design is a popular choice of experimental design when computer simulation is used to study a physical process. These designs guarantee uniform samples for the marginal distribution of each single input. A number of methods have been proposed for extending the uniform sampling to higher dimensions. We show how to construct Latin hypercube designs in which all main effects ar...

Sensor nodes, charged with battery power and capable of wireless communications, are distributed around to survey the environments and to send the needed data to the base station. The limited energy resources of sensor nodes are consumed in computation and especially in communication. To reduce power consumption for the sensor network, this paper presents a new data gathering scheme based on th...

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

We give a result that implies an improvement by a factor or IogIog n in the hypercube bounds for the geometric problems of hatched planar point location I trapezoidal decomposition, and polygon triangulation. The improvements are achieved through a better solution to the multisearch problem on a hypercube, a parallel search problem where the elements in the data structure S to be searched arc t...

Hypercube estimators for the mean vector in a general linear model include algebraic equivalents to penalized least squares estimatorswith quadratic penalties and to submodel least squares estimators. Penalized least squares estimators necessarily break down numerically for certain penalty matrices. Equivalent hypercube estimators resist this source of numerical instability. Under conditions, a...