Growing pseudo-eigenmodes and positive logarithmic norms in rotating shear flows

Rotating shear flows, when angular momentum increases and angular velocity decreases as functions of radiation coordinate, are hydrodynamically stable under linear perturbation. The Keplerian flow is an example of such a system, which appears in an astrophysical context. Although decaying eigenmodes exhibit large transient energy growth of perturbation which could govern nonlinearity in the system, the feedback of inherent instability to generate turbulence seems questionable. We show that such systems exhibiting growing pseudo-eigenmodes easily reach an upper bound of growth rate in terms of the logarithmic norm of the involved non-normal operators, thus exhibiting feedback of inherent instability. This supports the existence of turbulence of hydrodynamic origin in the Keplerian accretion disc in astrophysics. Hence, this answers the question of the mismatch between the linear theory and experimental/observed data and helps in resolving the outstanding question of the origin of turbulence therein.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

Decorrelation of broad band signals by toeplitz-block-toeplitz structuring

We propose F-norm of the cross-correlation part of the array covariance matrix as a measure of correlation between the impinging signals and study the performance of different decorrelation methods in the broadband case using this measure. We first show that dimensionality of the composite signal subspace, defined as the number of significant eigenvectors of the source sample covariance matrix, collapses in the presence of multipath and the spatial smoothing recovers this dimensionality. Using an upper bound on the proposed measure, we then study the decorrelation of the broadband signals with spatial smoothing and the effect of spacing and directions of the sources on the rate of decorrelation with progressive smoothing. Next, we introduce a weighted smoothing method based on Toeplitz-block-Toeplitz (TBT) structuring of the data covariance matrix which decorrelates the signals much faster than the spatial smoothing. Computer simulations are included to demonstrate the performance of the two methods.

Studies of phosphazenes. Part 34. group 6 metal carbonyl complexes of bis(pyrazolyl)cyclotriphosphazenes

Reactions of the bis(3,5-dimethylpyrazol-1-yl)cyclotriphosphazenes gem-N3P3Ph4(C3HN2Me2)2 (L1) and N3P3(MeNCH2CH2O)2(C3HN2Me2)2 (L2) with [M(CO)6] (M = Mo or W) afford complexes of the type [M(CO)3L] (L = L1 or L2), which have been characterised by IR and NMR spectroscopic data. The structures of [Mo(CO)3L1], [W(CO)3L2] and the ligand L2 have been determined by single-crystal X-ray diffraction. The phosphazenes act as novel tridentate NNN-donor ligands with two pyrazolyl nitrogen atoms and one phosphazene ring nitrogen atom bonded to the metal atom

Variable Sparsity Kernel Learning

This paper(1) presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assume that the given kernels are grouped and employ l(1) norm regularization for promoting sparsity within RKHS norms of each group and l(s), s >= 2 norm regularization for promoting non-sparse combinations across groups. Various sparsity levels in combining the kernels can be achieved by varying the grouping of kernels-hence we name the formulations as Variable Sparsity Kernel Learning (VSKL) formulations. While previous attempts have a non-convex formulation, here we present a convex formulation which admits efficient Mirror-Descent (MD) based solving techniques. The proposed MD based algorithm optimizes over product of simplices and has a computational complexity of O (m(2)n(tot) log n(max)/epsilon(2)) where m is no. training data points, n(max), n(tot) are the maximum no. kernels in any group, total no. kernels respectively and epsilon is the error in approximating the objective. A detailed proof of convergence of the algorithm is also presented. Experimental results show that the VSKL formulations are well-suited for multi-modal learning tasks like object categorization. Results also show that the MD based algorithm outperforms state-of-the-art MKL solvers in terms of computational efficiency.

Synthesis, Structures, and Magnetic Behavior of a Series of Copper(II) Azide Polymers of Cu-4 Building Clusters and Isolation of a New Hemiaminal Ether as the Metal Complex

Four new neutral copper azido polymers, Cu-4(N-3)(8)(L-1)(2)](n) (1), Cu-4(N-3)(8)(L-2)(2)](n) (2), Cu-4(N-3)(8)(L-3)(2)](n) (3), and Cu-9(N-3)(18)(L-4)(4)](n) (4) L1-4 are formed in situ by reacting pyridine-2-carboxaldehyde with 22-(methylamino)ethyl]pyridine (mapy, L-1), N,N-dimethylethylenediamine (N,N-dmen, L-2), N,N-diethylethylenediamine (N,N-deen, L-3), and N,N,2,2-tetramethylpropanediamine (N,N,2,2-tmpn, L-4)], have been synthesized by using 0.5 mol equiv of the chelating tridentate ligands with Cu-(NO3)(2)center dot 3H(2)O and an excess of NaN3. Single-crystal X-ray structures show that the basic unit of these complexes, especially 1-3, contains very similar Cu-4(II) building blocks. The overall structure of 3 is two-dimensional, while the other three complexes are one-dimensional in nature. Complex 1 represents a unique example containing hemiaminal ether arrested by copper(R). Complexes 1 and 2 have a rare bridging azido pathway: both end-on and end-to-end bridging azides between a pair of Cu-II centers. Cryomagnetic susceptibility measurements over a wide range of temperature exhibit dominant ferromagnetic behavior in all four complexes. Density functional theory calculations (B3LYP functional) have been performed on complexes 1-3 to provide a qualitative theoretical interpretation of their overall ferromagnetic behavior.

First-principle description of magnonic PdnFem multilayers

Ab-initio calculations are used to determine the parameters that determine magnonic band structure of PdnFem multilayers (n = 2, m <= 8). We obtain the layer-resolved magnetization, the exchange coupling, and the magnetic anisotropy of the Pd-Fe structures. The Fe moment is 3.0 mu(B) close to the Pd layers and 2.2 mu(B) in the middle of the Fe layers. An intriguing but not usually considered aspect is that the elemental Pd is nonmagnetic, similar to Cu spacer layers in other multilayer systems. This leads to a pre-asymptotic ferromagnetic coupling through the Pd (about 40 mJ/m(2)). Furthermore, the Pd acquires a small moment due to spin polarization by neighboring Fe atoms, which translates into magnetic anisotropy. The anisotropies are large, in the range typical for L1(0) structures, which is beneficial for high-frequency applications. (C) 2011 American Institute of Physics. doi:10.1063/1.3556763]

Growth inhibitory, apoptotic and anti-inflammatory activities displayed by a novel modified triterpenoid, cyano enone of methyl boswellates

Triterpenoids are pentacyclic secondary metabolites present in many terrestrial plants. Natural triterpenoids have been reported to exhibit anti-inflammatory and anti-carcinogenic activities. Here, we show that modifications of ring A of boswellic acid (2 cyano, 3 enone) resulted in a highly active growth inhibitory, anti-inflammatory, pro-differentiative and anti-tumour triterpenoid compound called cyano enone of methyl boswellates (CEMB). This compound showed cytotoxic activity on a number of cancer cell lines with IC50 ranging from 0.2 to 0.6 mu M. CEMB inhibits DNA synthesis and induces apoptosis in A549 cell line at 0.25 mu M and 1 mu M concentrations, respectively. CEMB induces adipogenic differentiation in 3T3-L1 cells at a concentration of 0.1 mu M. Finally, administration of CEMB intra-tumourally significantly inhibited the growth of C6 glioma tumour xenograft in immuno-compromised mice. Collectively, these results suggest that CEMB is a very potent anti-tumour compound.

Performance analysis of a modified spatial smoothing technique for direction estimation

The statistical performance analysis of ESPRIT, root-MUSIC, minimum-norm methods for direction estimation, due to finite data perturbations, using the modified spatially smoothed covariance matrix, is developed. Expressions for the mean-squared error in the direction estimates are derived based on a common framework. Based on the analysis, the use of the modified smoothed covariance matrix improves the performance of the methods when the sources are fully correlated. Also, the performance is better even when the number of subarrays is large unlike in the case of the conventionally smoothed covariance matrix. However, the performance for uncorrelated sources deteriorates due to an artificial correlation introduced by the modified smoothing. The theoretical expressions are validated using extensive simulations. (C) 1999 Elsevier Science B.V. All rights reserved.

Data rectification and detection of trend shifts in jet engine path measurements using median filters and fuzzy logic

Filtering methods are explored for removing noise from data while preserving sharp edges that many indicate a trend shift in gas turbine measurements. Linear filters are found to be have problems with removing noise while preserving features in the signal. The nonlinear hybrid median filter is found to accurately reproduce the root signal from noisy data. Simulated faulty data and fault-free gas path measurement data are passed through median filters and health residuals for the data set are created. The health residual is a scalar norm of the gas path measurement deltas and is used to partition the faulty engine from the healthy engine using fuzzy sets. The fuzzy detection system is developed and tested with noisy data and with filtered data. It is found from tests with simulated fault-free and faulty data that fuzzy trend shift detection based on filtered data is very accurate with no false alarms and negligible missed alarms.

Surfaces of Bounded Mean Curvature In Riemannian Manifolds

Consider a sequence of closed, orientable surfaces of fixed genus g in a Riemannian manifold M with uniform upper bounds on the norm of mean curvature and area. We show that on passing to a subsequence, we can choose parametrisations of the surfaces by inclusion maps from a fixed surface of the same genus so that the distance functions corresponding to the pullback metrics converge to a pseudo-metric and the inclusion maps converge to a Lipschitz map. We show further that the limiting pseudo-metric has fractal dimension two. As a corollary, we obtain a purely geometric result. Namely, we show that bounds on the mean curvature, area and genus of a surface F subset of M, together with bounds on the geometry of M, give an upper bound on the diameter of F. Our proof is modelled on Gromov's compactness theorem for J-holomorphic curves.

Emulating Optimal Replacement with a Shepherd Cache

The inherent temporal locality in memory accesses is filtered out by the L1 cache. As a consequence, an L2 cache with LRU replacement incurs significantly higher misses than the optimal replacement policy (OPT). We propose to narrow this gap through a novel replacement strategy that mimics the replacement decisions of OPT. The L2 cache is logically divided into two components, a Shepherd Cache (SC) with a simple FIFO replacement and a Main Cache (MC) with an emulation of optimal replacement. The SC plays the dual role of caching lines and guiding the replacement decisions in MC. Our pro- posed organization can cover 40% of the gap between OPT and LRU for a 2MB cache resulting in 7% overall speedup. Comparison with the dynamic insertion policy, a victim buffer, a V-Way cache and an LRU based fully associative cache demonstrates that our scheme performs better than all these strategies.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

Two-level Mapping Based Cache Index Selection for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the placement function to reduce conflict misses. Traditional placement functions use a one-level mapping that naively partitions trie-nodes into cache sets. However, as a significant percentage of trie nodes are not useful, these schemes suffer from a non-uniform distribution of useful nodes to sets. This in turn results in increased conflict misses. Newer organizations such as variable associativity caches achieve flexibility in placement at the expense of increased hit-latency. This makes them unsuitable for L1 caches.We propose a novel two-level mapping framework that retains the hit-latency of one-level mapping yet incurs fewer conflict misses. This is achieved by introducing a secondlevel mapping which reorganizes the nodes in the naive initial partitions into refined partitions with near-uniform distribution of nodes. Further as this remapping is accomplished by simply adapting the index bits to a given routing table the hit-latency is not affected. We propose three new schemes which result in up to 16% reduction in the number of misses and 13% speedup in memory access time. In comparison, an XOR-based placement scheme known to perform extremely well for general purpose architectures, can obtain up to 2% speedup in memory access time.

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.