Error analysis of discontinuous Galerkin methods for the Stokes problem under minimal regularity

In this article, we analyse several discontinuous Galerkin (DG) methods for the Stokes problem under minimal regularity on the solution. We assume that the velocity u belongs to H-0(1)(Omega)](d) and the pressure p is an element of L-0(2)(Omega). First, we analyse standard DG methods assuming that the right-hand side f belongs to H-1(Omega) boolean AND L-1(Omega)](d). A DG method that is well defined for f belonging to H-1(Omega)](d) is then investigated. The methods under study include stabilized DG methods using equal-order spaces and inf-sup stable ones where the pressure space is one polynomial degree less than the velocity space.

Solving Axisymmetric Stability Problems by Using Upper Bound Finite Elements, Limit Analysis, and Linear Optimization

A numerical formulation has been proposed for solving an axisymmetric stability problem in geomechanics with upper bound limit analysis, finite elements, and linear optimization. The Drucker-Prager yield criterion is linearized by simulating a sphere with a circumscribed truncated icosahedron. The analysis considers only the velocities and plastic multiplier rates, not the stresses, as the basic unknowns. The formulation is simple to implement, and it has been employed for finding the collapse loads of a circular footing placed over the surface of a cohesive-frictional material. The formulation can be used to solve any general axisymmetric geomechanics stability problem.

Automatic finite element formulation and assembly of hyperelastic higher order structural models

The formulation of higher order structural models and their discretization using the finite element method is difficult owing to their complexity, especially in the presence of non-linearities. In this work a new algorithm for automating the formulation and assembly of hyperelastic higher-order structural finite elements is developed. A hierarchic series of kinematic models is proposed for modeling structures with special geometries and the algorithm is formulated to automate the study of this class of higher order structural models. The algorithm developed in this work sidesteps the need for an explicit derivation of the governing equations for the individual kinematic modes. Using a novel procedure involving a nodal degree-of-freedom based automatic assembly algorithm, automatic differentiation and higher dimensional quadrature, the relevant finite element matrices are directly computed from the variational statement of elasticity and the higher order kinematic model. Another significant feature of the proposed algorithm is that natural boundary conditions are implicitly handled for arbitrary higher order kinematic models. The validity algorithm is illustrated with examples involving linear elasticity and hyperelasticity. (C) 2013 Elsevier Inc. All rights reserved.

Boundary perturbations and the Helmholtz equation in three dimensions

We propose an analytic perturbative scheme in the spirit of Lord Rayleigh's work for determining the eigenvalues of the Helmholtz equation in three dimensions inside an arbitrary boundary where the eigenfunction satisfies either the Dirichlet boundary condition or the Neumann boundary condition. Although numerous works are available in the literature for arbitrary boundaries in two dimensions, to the best of our knowledge the formulation in three dimensions is proposed for the first time. In this novel prescription, we have expanded the arbitrary boundary in terms of spherical harmonics about an equivalent sphere and obtained perturbative closed-form solutions at each order for the problem in terms of corrections to the equivalent spherical boundary for both the boundary conditions. This formulation is in parallel with the standard time-independent Rayleigh-Schrodinger perturbation theory. The efficacy of the method is tested by comparing the perturbative values against the numerically calculated eigenvalues for spheroidal, superegg and superquadric shaped boundaries. It is shown that this perturbation works quite well even for wide departure from spherical shape and for higher excited states too. We believe this formulation would find applications in the field of quantum dots and acoustical cavities.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Mixed finite elements for electromagnetic analysis

The occurrence of spurious solutions is a well-known limitation of the standard nodal finite element method when applied to electromagnetic problems. The two commonly used remedies that are used to address this problem are (i) The addition of a penalty term with the penalty factor based on the local dielectric constant, and which reduces to a Helmholtz form on homogeneous domains (regularized formulation); (ii) A formulation based on a vector and a scalar potential. Both these strategies have some shortcomings. The penalty method does not completely get rid of the spurious modes, and both methods are incapable of predicting singular eigenvalues in non-convex domains. Some non-zero spurious eigenvalues are also predicted by these methods on non-convex domains. In this work, we develop mixed finite element formulations which predict the eigenfrequencies (including their multiplicities) accurately, even for nonconvex domains. The main feature of the proposed mixed finite element formulation is that no ad-hoc terms are added to the formulation as in the penalty formulation, and the improvement is achieved purely by an appropriate choice of finite element spaces for the different variables. We show that the formulation works even for inhomogeneous domains where `double noding' is used to enforce the appropriate continuity requirements at an interface. For two-dimensional problems, the shape of the domain can be arbitrary, while for the three-dimensional ones, with our current formulation, only regular domains (which can be nonconvex) can be modeled. Since eigenfrequencies are modeled accurately, these elements also yield accurate results for driven problems. (C) 2014 Elsevier Ltd. All rights reserved.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Generalized Model Predictive Static Programming and Angle-Constrained Guidance of Air-to-Ground Missiles

A new generalized model predictive static programming technique is presented for rapidly solving a class of finite-horizon nonlinear optimal control problems with hard terminal constraints. Two key features for its high computational efficiency include one-time backward integration of a small-dimensional weighting matrix dynamics, followed bya static optimization formulation that requires only a static Lagrange multiplier to update the control history. It turns out that under Euler integration and rectangular approximation of finite integrals it is equivalent to the existing model predictive static programming technique. In addition to the benchmark double integrator problem, usefulness of the proposed technique is demonstrated by solving a three-dimensional angle-constrained guidance problem for an air-to-ground missile, which demands that the missile must meet constraints on both azimuth and elevation angles at the impact point in addition to achieving near-zero miss distance, while minimizing the lateral acceleration demand throughout its flight path. Simulation studies include maneuvering ground targets along with a first-order autopilot lag. Comparison studies with classical augmented proportional navigation guidance and modern general explicit guidance lead to the conclusion that the proposed guidance is superior to both and has a larger capture region as well.

Two timescale convergent Q-learning for sleep-scheduling in wireless sensor networks

In this paper, we consider an intrusion detection application for Wireless Sensor Networks. We study the problem of scheduling the sleep times of the individual sensors, where the objective is to maximize the network lifetime while keeping the tracking error to a minimum. We formulate this problem as a partially-observable Markov decision process (POMDP) with continuous stateaction spaces, in a manner similar to Fuemmeler and Veeravalli (IEEE Trans Signal Process 56(5), 2091-2101, 2008). However, unlike their formulation, we consider infinite horizon discounted and average cost objectives as performance criteria. For each criterion, we propose a convergent on-policy Q-learning algorithm that operates on two timescales, while employing function approximation. Feature-based representations and function approximation is necessary to handle the curse of dimensionality associated with the underlying POMDP. Our proposed algorithm incorporates a policy gradient update using a one-simulation simultaneous perturbation stochastic approximation estimate on the faster timescale, while the Q-value parameter (arising from a linear function approximation architecture for the Q-values) is updated in an on-policy temporal difference algorithm-like fashion on the slower timescale. The feature selection scheme employed in each of our algorithms manages the energy and tracking components in a manner that assists the search for the optimal sleep-scheduling policy. For the sake of comparison, in both discounted and average settings, we also develop a function approximation analogue of the Q-learning algorithm. This algorithm, unlike the two-timescale variant, does not possess theoretical convergence guarantees. Finally, we also adapt our algorithms to include a stochastic iterative estimation scheme for the intruder's mobility model and this is useful in settings where the latter is not known. Our simulation results on a synthetic 2-dimensional network setting suggest that our algorithms result in better tracking accuracy at the cost of only a few additional sensors, in comparison to a recent prior work.

Formulation of nanotized curcumin and demonstration of its antimalarial efficacy

Aim: The present study was conducted to overcome the disadvantages associated with the poor water solubility and low bioavailability of curcumin by synthesizing nanotized curcumin and demonstrating its efficacy in treating malaria. Materials and methods: Nanotized curcumin was prepared by a modified emulsion-diffusion-evaporation method and was characterized by means of transmission electron microscopy, atomic force microscopy, dynamic light scattering, Zetasizer, Fourier transform infrared spectroscopy, and differential thermal analysis. The novelty of the prepared nanoformulation lies in the fact that it was devoid of any polymeric matrices used in conventional carriers. The antimalarial efficacy of the prepared nanotized curcumin was then checked both in vitro and in vivo. Results: The nanopreparation was found to be non-toxic and had a particle size distribution of 20-50 nm along with improved aqueous dispersibility and an entrapment efficiency of 45%. Nanotized curcumin (half maximal inhibitory concentration IC50]: 0.5 mu M) was also found to be ten-fold more effective for growth inhibition of Plasmodium falciparum in vitro as compared to its native counterpart (IC50: 5 mu M). Oral bioavailability of nanotized curcumin was found to be superior to that of its native counterpart. Moreover, when Plasmodium berghei-infected mice were orally treated with nanotized curcumin, it prolonged their survival by more than 2 months with complete clearance of parasites in comparison to the untreated animals, which survived for 8 days only. Conclusion: Nanotized curcumin holds a considerable promise in therapeutics as demonstrated here for treating malaria as a test system.

TIME VARYING LINEAR PREDICTION USING SPARSITY CONSTRAINTS

Time-varying linear prediction has been studied in the context of speech signals, in which the auto-regressive (AR) coefficients of the system function are modeled as a linear combination of a set of known bases. Traditionally, least squares minimization is used for the estimation of model parameters of the system. Motivated by the sparse nature of the excitation signal for voiced sounds, we explore the time-varying linear prediction modeling of speech signals using sparsity constraints. Parameter estimation is posed as a 0-norm minimization problem. The re-weighted 1-norm minimization technique is used to estimate the model parameters. We show that for sparsely excited time-varying systems, the formulation models the underlying system function better than the least squares error minimization approach. Evaluation with synthetic and real speech examples show that the estimated model parameters track the formant trajectories closer than the least squares approach.

AN OPTIMUM SHRINKAGE ESTIMATOR BASED ON MINIMUM-PROBABILITY-OF-ERROR CRITERION AND APPLICATION TO SIGNAL DENOISING

We address the problem of designing an optimal pointwise shrinkage estimator in the transform domain, based on the minimum probability of error (MPE) criterion. We assume an additive model for the noise corrupting the clean signal. The proposed formulation is general in the sense that it can handle various noise distributions. We consider various noise distributions (Gaussian, Student's-t, and Laplacian) and compare the denoising performance of the estimator obtained with the mean-squared error (MSE)-based estimators. The MSE optimization is carried out using an unbiased estimator of the MSE, namely Stein's Unbiased Risk Estimate (SURE). Experimental results show that the MPE estimator outperforms the SURE estimator in terms of SNR of the denoised output, for low (0 -10 dB) and medium values (10 - 20 dB) of the input SNR.

Development, in vitro and in vivo characterization of zoledronic acid functionalized hydroxyapatite nanoparticle based formulation for treatment of osteoporosis in animal model

We investigated the potential of using novel zoledronic acid (ZOL)-hydroxyapatite (HA) nanoparticle based drug formulation in a rat model of postmenopausal osteoporosis. By a classical adsorption method, nanoparticles of HA loaded with ZOL (HNLZ) drug formulation with a size range of 100-130 nm were prepared. 56 female Wistar rats were ovariectomized (OVX) or sham-operated at 3 months of age. Twelve weeks post surgery, rats were randomized into seven groups and treated with various doses of HNLZ (100, 50 and 25 mu g/kg, intravenous single dose), ZOL (100 mu g/kg, intravenous single dose) and HA nanoparticle (100 mu g/kg, intravenous single dose). Untreated OVX and sham OVX served as controls. After three months treatment period, we evaluated the mechanical properties of the lumbar vertebra and femoral mid-shaft. Femurs were also tested for trabecular microarchitecture. Sensitive biochemical markers of bone formation and bone resorption in serum were also determined. With respect to improvement in the mechanical strength of the lumbar spine and the femoral mid-shaft, the therapy with HNLZ drug formulation was more effective than ZOL therapy in OVX rats. Moreover, HNLZ drug therapy preserved the trabecular microarchitecture better than ZOL therapy in OVX rats. Furthermore, the HNLZ drug formulation corrected increase in serum levels of bone-specific alkaline phosphatase, procollagen type I N-terminal propeptide, osteocalcin, tartrate-resistant acid phosphatase 5b and C-telopeptide of type 1 collagen better than ZOL therapy in OVX rats. The results strongly suggest that HNLZ novel drug formulation appears to be more effective approach for treating severe osteoporosis in humans. (C) 2014 Elsevier B.V. All rights reserved.