A model function f(x1,. . .,xn) defined in the unit hypercube Hn with Lebesque measure dx= dx1. . .dxn is considered. If the unction is square integrable, global sensitivity indices provide adequate estimates for the influence of individual factors xi or roups of such factors. Alternative estimators that require less computer time can also be used. If the function f is differentiable, unctional...

Machining accuracy reliability as a key index of CNC machine tools is seriously influenced by the geometric and thermal errors. In paper, spindle unit error modeling machining analysis method proposed. By analyzing heat generation mechanism, model was developed to describe deformation electric spindle. Based on immune algorithm (IA), power transfer coefficient were optimized, obtained finite el...

We propose a general method for estimating the distance between a compact subspace K of the space L([0, 1]) of Lebesgue measurable functions defined on the hypercube [0, 1], and the class of functions computed by artificial neural networks using a single hidden layer, each unit evaluating a sigmoidal activation function. Our lower bounds are stated in terms of an invariant that measures the osc...

We deene new selection criteria for lattice rules for quasi-Monte Carlo integration. The criteria examine the projections of the lattice over subspaces of small or successive dimensions. Their computation exploits the dimension-stationarity of certain lattice rules, and of other low-discrepancy point sets sharing this property. Numerical results illustrate the usefulness of these new gures of m...

In this lecture, we will study bandit problems with linear costs. In this setting, actions are represented by vectors in a low-dimensional real space. For simplicity, we will assume that all actions lie within a unit hypercube: a ∈ [0, 1]d. The action costs ct(a) are linear in the vector a, namely: ct(a) = a · vt for some weight vector vt ∈ Rd which is the same for all actions, but depends on t...

In the perpetual gossiping problem, introduced by Liestman and Richards, information may be generated at any time and at any vertex of a graph G; adjacent vertices can communicate by telephone calls. We define Wk(G) to be the minimum w such that, placing at most k calls each time unit, we can ensure that every piece of information is known to every vertex within w time units of its generation. ...

The Monte Carlo method is an important numerical simulation tool in many applied fields such as economics, finance, statistical physics, and optimization. One of the most useful aspects of this method is in numerical integration of higher dimensions. For integrals of higher dimensions, the common numerical methods such as Simpson’s method, fail because the total number of grid points needed to ...

Abstrust The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective d...

A new scalable interconnection topology called the Spanning Multichannel Linked Hypercube (SMLH) is proposed along with an optical implementation methodology that combines both the advantages of free space optics with those of wavelength division multiplexing techniques. The SMLH uses the hypercube topology as a basic building block and connects such building blocks using two-dimensional multic...

Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...