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...

This paper generalizes and extends the theory of conceptual spaces as originally proposed by Gardenförs (Conceptual spaces. Cambridge, MA: MIT Press) to provide further geometric representations of both concepts and object observations within a multi-dimensional fuzzy space corresponding to a subset of a unit hypercube. With these representations, we are able directly to calculate normalized sc...

Latin hypercube designs (LHDs) are widely used in many applications. As the number of design points or factors becomes large, the total number of LHDs grows exponentially. The large number of feasible designs makes the search for optimal LHDs a difficult discrete optimization problem. To tackle this problem, we propose a new population-based algorithm named LaPSO that is adapted from the standa...

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 review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approximating the minimum of some classes of functions (including Lipschitz continuous functions) on the standard simplex. The main tools used in the analysis are Bernstein approximation and Lagrange interpolation on the simp...

Abstract In this paper we present optical communication multibus system including: physical topology, logical topology, structure of central control unit (CCU). We describe the task of CCU: analyze the state of logical buses, topology reconfiguration, system structures clustering, unexpected events handling, statistic gathering, etc. In this paper we present synthesis of core system network bas...