Lower-Bound Axisymmetric Formulation for Geomechanics Problems Using Nonlinear Optimization

A lower-bound limit analysis formulation, by using two-dimensional finite elements, the three-dimensional Mohr-Coulomb yield criterion, and nonlinear optimization, has been given to deal with an axisymmetric geomechanics stability problem. The optimization was performed using an interior point method based on the logarithmic barrier function. The yield surface was smoothened (1) by removing the tip singularity at the apex of the pyramid in the meridian plane and (2) by eliminating the stress discontinuities at the corners of the yield hexagon in the pi-plane. The circumferential stress (sigma(theta)) need not be assumed. With the proposed methodology, for a circular footing, the bearing-capacity factors N-c, N-q, and N-gamma for different values of phi have been computed. For phi = 0, the variation of N-c with changes in the factor m, which accounts for a linear increase of cohesion with depth, has been evaluated. Failure patterns for a few cases have also been drawn. The results from the formulation provide a good match with the solutions available from the literature. (C) 2014 American Society of Civil Engineers.

Probabilistic Prediction based Scheduling for Delay Sensitive Traffic in Internet of Things

This paper proposes a probabilistic prediction based approach for providing Quality of Service (QoS) to delay sensitive traffic for Internet of Things (IoT). A joint packet scheduling and dynamic bandwidth allocation scheme is proposed to provide service differentiation and preferential treatment to delay sensitive traffic. The scheduler focuses on reducing the waiting time of high priority delay sensitive services in the queue and simultaneously keeping the waiting time of other services within tolerable limits. The scheme uses the difference in probability of average queue length of high priority packets at previous cycle and current cycle to determine the probability of average weight required in the current cycle. This offers optimized bandwidth allocation to all the services by avoiding distribution of excess resources for high priority services and yet guaranteeing the services for it. The performance of the algorithm is investigated using MPEG-4 traffic traces under different system loading. The results show the improved performance with respect to waiting time for scheduling high priority packets and simultaneously keeping tolerable limits for waiting time and packet loss for other services. Crown Copyright (C) 2015 Published by Elsevier B.V.

PREDICTION OF TRANSITIONAL AND SEPARATED BOUNDARY LAYERS IN A COMPRESSOR CASCADE

Numerical simulations were performed of experiments from a cascade of stator blades at three low Reynolds numbers representative of flight conditions. Solutions were assessed by comparing blade surface pressures, velocity and turbulence intensity along blade normals at several stations along the suction surface and in the wake. At Re = 210,000 and 380,000 the laminar boundary layer over the suction surface separates and reattaches with significant turbulence fluctuations. A new 3-equation transition model, the k-k(L)-omega model, was used to simulate this flow. Predicted locations of the separation bubble, and profiles of velocity and turbulence fluctuations on blade-normal lines at various stations along the blade were found to be quite close to measurements. Suction surface pressure distributions were not as close at the lower Re. The solution with the standard k-omega SST model showed significant differences in all quantities. At Re = 640,000 transition occurs earlier and it is a turbulent boundary layer that separates near the trailing edge. The solution with the Reynolds stress model was found to be quite close to the experiment in the separated region also, unlike the k-omega SST solution. Three-dimensional computations were performed at Re = 380,000 and 640,000. In both cases there were no significant differences between the midspan solution from 3D computations and the 2D solutions. However, the 3D solutions exhibited flow features observed in the experiments the nearly 2D structure of the flow over most of the span at 380,000 and the spanwise growth of corner vortices from the endwall at 640,000.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

A FRAMEWORK FOR THE ERROR ANALYSIS OF DISCONTINUOUS FINITE ELEMENT METHODS FOR ELLIPTIC OPTIMAL CONTROL PROBLEMS AND APPLICATIONS TO C-0 IP METHODS

In this article, an abstract framework for the error analysis of discontinuous Galerkin methods for control constrained optimal control problems is developed. The analysis establishes the best approximation result from a priori analysis point of view and delivers a reliable and efficient a posteriori error estimator. The results are applicable to a variety of problems just under the minimal regularity possessed by the well-posedness of the problem. Subsequently, the applications of C-0 interior penalty methods for a boundary control problem as well as a distributed control problem governed by the biharmonic equation subject to simply supported boundary conditions are discussed through the abstract analysis. Numerical experiments illustrate the theoretical findings.

Prediction and validation of gold nanoparticles (GNPs) on plant growth promoting rhizobacteria (PGPR): a step toward development of nano-biofertilizers

Several soil microbes are present in the rhizosphere zone, especially plant growth promoting rhizobacteria (PGPR), which are best known for their plant growth promoting activities. The present study reflects the effect of gold nanoparticles (GNPs) at various concentrations on the growth of PGPR. GNPs were synthesized chemically, by reduction of HAuCl 4, and further characterized by UV-Vis spectroscopy, X-ray diffraction technique (XRD), and transmission electron microscopy (TEM), etc. The impact of GNPs on PGPR was investigated by Clinical Laboratory Standards Institute (CLSI) recommended Broth-Microdilution technique against four selected PGPR viz., Pseudomonas fluorescens, Bacillus subtilis, Paenibacillus elgii, and Pseudomonas putida. Neither accelerating nor reducing impact was observed in P. putida due to GNPs. On the contrary, significant increase was observed in the case of P. fluorescens, P. elgii, and B. subtilis, and hence, GNPs can be exploited as nano-biofertilizers.

Graph Modification Problems: A Modern Perspective

We give an overview of recent results and techniques in parameterized algorithms for graph modification problems.

A fast algorithm for speech polarity detection using long-term linear prediction

Speech polarity detection is a crucial first step in many speech processing techniques. In this paper, an algorithm is proposed that improvises the existing technique using the skewness of the voice source (VS) signal. Here, the integrated linear prediction residual (ILPR) is used as the VS estimate, which is obtained using linear prediction on long-term frames of the low-pass filtered speech signal. This excludes the unvoiced regions from analysis and also reduces the computation. Further, a modified skewness measure is proposed for decision, which also considers the magnitude of the skewness of the ILPR along with its sign. With the detection error rate (DER) as the performance metric, the algorithm is tested on 8 large databases and its performance (DER=0.20%) is found to be comparable to that of the best technique (DER=0.06%) on both clean and noisy speech. Further, the proposed method is found to be ten times faster than the best technique.

Prediction of Indian rainfall during the summer monsoon season on the basis of links with equatorial Pacific and Indian Ocean climate indices

Interannual variation of Indian summer monsoon rainfall (ISMR) is linked to El Nino-Southern oscillation (ENSO) as well as the Equatorial Indian Ocean oscillation (EQUINOO) with the link with the seasonal value of the ENSO index being stronger than that with the EQUINOO index. We show that the variation of a composite index determined through bivariate analysis, explains 54% of ISMR variance, suggesting a strong dependence of the skill of monsoon prediction on the skill of prediction of ENSO and EQUINOO. We explored the possibility of prediction of the Indian rainfall during the summer monsoon season on the basis of prior values of the indices. We find that such predictions are possible for July-September rainfall on the basis of June indices and for August-September rainfall based on the July indices. This will be a useful input for second and later stage forecasts made after the commencement of the monsoon season.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Prediction of electronically nonadiabatic decomposition mechanisms of isolated gas phase nitrogen-rich energetic salt: Guanidium-triazolate

Electronically nonadiabatic decomposition pathways of guanidium triazolate are explored theoretically. Nonadiabatically coupled potential energy surfaces are explored at the complete active space self-consistent field (CASSCF) level of theory. For better estimation of energies complete active space second order perturbation theories (CASPT2 and CASMP2) are also employed. Density functional theory (DFT) with B3LYP functional and MP2 level of theory are used to explore subsequent ground state decomposition pathways. In comparison with all possible stable decomposition products (such as, N-2, NH3, HNC, HCN, NH2CN and CH3NC), only NH3 (with NH2CN) and N-2 are predicted to be energetically most accessible initial decomposition products. Furthermore, different conical intersections between the S-1 and S-0 surfaces, which are computed at the CASSCF(14,10)/6-31G(d) level of theory, are found to play an essential role in the excited state deactivation process of guanidium triazolate. This is the first report on the electronically nonadiabatic decomposition mechanisms of isolated guanidium triazolate salt. (C) 2015 Elsevier B.V. All rights reserved.

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.

Numerical prediction of nozzle flow separation: Issue of turbulence modeling

Numerical simulation of separated flows in rocket nozzles is challenging because existing turbulence models are unable to predict it correctly. This paper addresses this issue with the Spalart-Allmaras and Shear Stress Transport (SST) eddy-viscosity models, which predict flow separation with moderate success. Their performances have been compared against experimental data for a conical and two contoured subscale nozzles. It is found that they fail to predict the separation location correctly, exhibiting sensitivity to the nozzle pressure ratio (NPR) and nozzle type. A careful assessment indicated how the model had to be tuned for better, consistent prediction. It is learnt that SST model's failure is caused by limiting of the shear stress inside boundary layer according to Bradshaw's assumption, and by over prediction of jet spreading rate. Accordingly, SST's coefficients were empirically modified to match the experimental wall pressure data. Results confirm that accurate RANS prediction of separation depends on the correct capture of the jet spreading rate, and that it is feasible over a wide range of NPRs by modified values of the diffusion coefficients in the turbulence model. (C) 2015 Elsevier Masson SAS. All rights reserved.