Estimating the Hausdorff-Besicovitch dimension of boundary of basin of attraction in helicopter trim

Helicopter trim involves solution of nonlinear force equilibrium equations. As in many nonlinear dynamic systems, helicopter trim problem can show chaotic behavior. This chaotic behavior is found in the basin of attraction of the nonlinear trim equations which have to be solved to determine the main rotor control inputs given by the pilot. This study focuses on the boundary of the basin of attraction obtained for a set of control inputs. We analyze the boundary by considering it at different magnification levels. The magnified views reveal intricate geometries. It is also found that the basin boundary exhibits the characteristic of statistical self-similarity, which is an essential property of fractal geometries. These results led the authors to investigate the fractal dimension of the basin boundary. It is found that this dimension is indeed greater than the topological dimension. From all the observations, it is evident that the boundary of the basin of attraction for helicopter trim problem is fractal in nature. (C) 2012 Elsevier Inc. All rights reserved.

Multiuser detection in large-dimension multicode MIMO-CDMA systems with higher-order modulation

In this paper, we are interested in high spectral efficiency multicode CDMA systems with large number of users employing single/multiple transmit antennas and higher-order modulation. In particular, we consider a local neighborhood search based multiuser detection algorithm which offers very good performance and complexity, suited for systems with large number of users employing M-QAM/M-PSK. We apply the algorithm on the chip matched filter output vector. We demonstrate near-single user (SU) performance of the algorithm in CDMA systems with large number of users using 4-QAM/16-QAM/64-QAM/8-PSK on AWGN, frequency-flat, and frequency-selective fading channels. We further show that the algorithm performs very well in multicode multiple-input multiple-output (MIMO) CDMA systems as well, outperforming other linear detectors and interference cancelers reported in the literature for such systems. The per-symbol complexity of the search algorithm is O(K2n2tn2cM), K: number of users, nt: number of transmit antennas at each user, nc: number of spreading codes multiplexed on each transmit antenna, M: modulation alphabet size, making the algorithm attractive for multiuser detection in large-dimension multicode MIMO-CDMA systems with M-QAM.

On Selection of Search Space Dimension in Compressive Sampling Matching Pursuit

Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications.

On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Classification calibration dimension for general multiclass losses

We study consistency properties of surrogate loss functions for general multiclass classification problems, defined by a general loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficient conditions for a surrogate loss to be classification calibrated with respect to a loss matrix in this setting. We then introduce the notion of \emph{classification calibration dimension} of a multiclass loss matrix, which measures the smallest `size' of a prediction space for which it is possible to design a convex surrogate that is classification calibrated with respect to the loss matrix. We derive both upper and lower bounds on this quantity, and use these results to analyze various loss matrices. In particular, as one application, we provide a different route from the recent result of Duchi et al.\ (2010) for analyzing the difficulty of designing `low-dimensional' convex surrogates that are consistent with respect to pairwise subset ranking losses. We anticipate the classification calibration dimension may prove to be a useful tool in the study and design of surrogate losses for general multiclass learning problems.

Cooperative Particle Swarm Optimization Based Receiver for Large-Dimension MIMO-ZPSC Systems

In this paper, we propose a cooperative particle swarm optimization (CPSO) based channel estimation/equalization scheme for multiple-input multiple-output zero-padded single-carrier (MIMO-ZPSC) systems with large dimensions in frequency selective channels. We estimate the channel state information at the receiver in time domain using a PSO based algorithm during training phase. Using the estimated channel, we perform information symbol detection in the frequency domain using FFT based processing. For this detection, we use a low complexity OLA (OverLap Add) likelihood ascent search equalizer which uses minimum mean square (MMSE) equalizer solution as the initial solution. Multiple iterations between channel estimation and data detection are carried out which significantly improves the mean square error and bit error rate performance of the receiver.

Fractal dimension method for delamination detection in composite beams

A new delaminated composite beam element is formulated for Timoshenko as well as Euler-Bernoulli beam models. Shape functions are derived from Timoshenko functions; this provides a unified formulation for slender to moderately deep beam analyses. The element is simple and easy to implement, results are on par with those from free mode delamination models. Katz fractal dimension method is applied on the mode shapes obtained from finite element models, to detect the delamination in the beam. The effect of finite element size on fractal dimension method of delamination detection is quantified.

DIMENSION FREE BOUNDEDNESS OF RIESZ TRANSFORMS FOR THE GRUSHIN OPERATOR

Let G = -Delta(xi) - vertical bar xi vertical bar(2) partial derivative(2)/partial derivative eta(2) be the Grushin operator on R-n x R. We prove that the Riesz transforms associated to this operator are bounded on L-p(Rn+1), 1 < p < infinity, and their norms are independent of dimension n.

Matrix Crack Detection in Composite Plate with Spatially Random Material Properties using Fractal Dimension

Fractal dimension based damage detection method is investigated for a composite plate with random material properties. Composite material shows spatially varying random material properties because of complex manufacturing processes. Matrix cracks are considered as damage in the composite plate. Such cracks are often seen as the initial damage mechanism in composites under fatigue loading and also occur due to low velocity impact. Static deflection of the cantilevered composite plate with uniform loading is calculated using the finite element method. Damage detection is carried out based on sliding window fractal dimension operator using the static deflection. Two dimensional homogeneous Gaussian random field is generated using Karhunen-Loeve (KL) expansion to represent the spatial variation of composite material property. The robustness of fractal dimension based damage detection method is demonstrated considering the composite material properties as a two dimensional random field.

Matrix crack detection in spatially random composite structures using fractal dimension

Fractal dimension based damage detection method is studied for a composite structure with random material properties. A composite plate with localized matrix crack is considered. Matrix cracks are often seen as the initial damage mechanism in composites. Fractal dimension based method is applied to the static deformation curve of the structure to detect localized damage. Static deflection of a cantilevered composite plate under uniform loading is calculated using the finite element method. Composite material shows spatially varying random material properties because of complex manufacturing processes. Spatial variation of material property is represented as a two dimensional homogeneous Gaussian random field. Karhunen-Loeve (KL) expansion is used to generate a random field. The robustness of fractal dimension based damage detection methods is studied considering the composite plate with spatial variation in material properties.

SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

Isolated singularities of polyharmonic operator in even dimension

We consider the equation Delta(2)u = g(x, u) >= 0 in the sense of distribution in Omega' = Omega\textbackslash {0} where u and -Delta u >= 0. Then it is known that u solves Delta(2)u = g(x, u) + alpha delta(0) - beta Delta delta(0), for some nonnegative constants alpha and beta. In this paper, we study the existence of singular solutions to Delta(2)u = a(x) f (u) + alpha delta(0) - beta Delta delta(0) in a domain Omega subset of R-4, a is a nonnegative measurable function in some Lebesgue space. If Delta(2)u = a(x) f (u) in Omega', then we find the growth of the nonlinearity f that determines alpha and beta to be 0. In case when alpha = beta = 0, we will establish regularity results when f (t) <= Ce-gamma t, for some C, gamma > 0. This paper extends the work of Soranzo (1997) where the author finds the barrier function in higher dimensions (N >= 5) with a specific weight function a(x) = |x|(sigma). Later, we discuss its analogous generalization for the polyharmonic operator.

Positive isotropic curvature and self-duality in dimension 4

We study a positivity condition for the curvature of oriented Riemannian 4-manifolds: the half-PIC condition. It is a slight weakening of the positive isotropic curvature (PIC) condition introduced by M. Micallef and J. Moore. We observe that the half-PIC condition is preserved by the Ricci flow and satisfies a maximality property among all Ricci flow invariant positivity conditions on the curvature of oriented 4-manifolds. We also study some geometric and topological aspects of half-PIC manifolds.