In this paper, we consider a symmetric α-stable p-sub-stable twodimensional random vector. Our purpose is to show when the function exp { − (|a|p + |b|p) } is a characteristic function of such a vector for some p and α. The solution of this problem we can find in [3], in the language of isometric embeddings of Banach spaces. Our proof is based on simple properties of stable distributions and so...

We propose an approach to improve the performance of neuro-genetic hybrids. We used a two-dimensional genetic encoding to represent the network with less information loss and devised a careful restructuring of neural network so that the geographic contributions of neurons can be better re ected in the genetic process. We test handwritten character recognition problem to examine the performance ...

In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...

In this paper, a new method is presented for TAM/wrapper co-optimization based on hybrid genetic algorithm and twodimensional packing problem. In this method, core test is represented by rectangles, and a hybrid genetic algorithm that provides highly optimal solution for two-dimensional packing problem is introduced for TAM allocation and test scheduling. During the scheduling, the TAM width as...

Triangulation of a three-dimensional point from n ≥ 2 twodimensional images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no fal...

We investigate the problem of minimizing an L2sensitivity measure subject to L2-norm dynamic-range scaling constraints for one-dimensional (1-D) as well as a class of twodimensional (2-D) state-space digital filters, where the 2-D digital filters are described by a transposed structure of the FornasiniMarchesini second local state-space model. In each case, a novel iterative technique is develo...

The bandwidth minimization problem is of significance in network communication and related areas. Let G be a graph of n vertices. The two-dimensional bandwidth B2(G) of G is the minimum value of the maximum distance between adjacent vertices when G is embedded into an n × n grid in the plane. As a discrete optimization problem, determining B2(G) is NP-hard in general. However, exact results for...

In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...

Consider the motion of a Brownian particle that initially takes place in a twodimensional plane and then after some random/unobservable time continues in the three-dimensional space. Given that only the distance of the particle to the origin is being observed, the problem is to detect the time at which the particle departs from the plane as accurately as possible. We solve this problem in the m...

Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented OðminfK + n logn‚ n ffiffiffiffi K p gÞ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays...