REDUCING COMPUTATIONAL EFFORT IN SOLVING GEOMECHANICS PROBLEMS WITH UPPER BOUND FINITE ELEMENTS LIMIT ANALYSIS AND LINEAR OPTIMIZATION

This paper presents a simple technique for reducing the computational effort while solving any geotechnical stability problem by using the upper bound finite element limit analysis and linear optimization. In the proposed method, the problem domain is discretized into a number of different regions in which a particular order (number of sides) of the polygon is chosen to linearize the Mohr-Coulomb yield criterion. A greater order of the polygon needs to be selected only in that region wherein the rate of the plastic strains becomes higher. The computational effort required to solve the problem with this implementation reduces considerably. By using the proposed method, the bearing capacity has been computed for smooth and rough strip footings and the results are found to be quite satisfactory.

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.

Shock tunnel experiments on control of shock induced large separation bubble using boundary layer bleed

Shock-Boundary Layer Interaction (SBLI) often occurs in supersonic/hypersonic flow fields. Especially when accompanied by separation (termed strong interaction), the SBLI phenomena largely affect the performance of the systems where they occur, such as scramjet intakes, thus often demanding the control of the interaction. Experiments on the strong interaction between impinging shock wave and boundary layer on a flat plate at Mach 5.96 are carried out in IISc hypersonic shock tunnel HST-2. The experiments are performed at moderate flow total enthalpy of 1.3 MJ/kg and freestream Reynolds number of 4 million/m. The strong shock generated by a wedge (or shock generator) of large angle 30.96 degrees to the freestream is made to impinge on the flat plate at 95 mm (inviscid estimate) from the leading edge, due to which a large separation bubble of length (75 mm) comparable to the distance of shock impingement from the leading edge is generated. The experimental simulation of such large separation bubble with separation occurring close to the leading edge, and its control using boundary layer bleed (suction and tangential blowing) at the location of separation, are demonstrated within the short test time of the shock tunnel (similar to 600 mu s) from time resolved schlieren flow visualizations and surface pressure measurements. By means of suction - with mass flow rate one order less than the mass flow defect in boundary layer - a reduction in separation length by 13.33% was observed. By the injection of an array of (nearly) tangential jets in the direction of mainstream (from the bottom of the plate) at the location of separation - with momentum flow rate one order less than the boundary layer momentum flow defect - 20% reduction in separation length was observed, although the flow field was apparently unsteady. (C) 2014 Elsevier Masson SAS. All rights reserved.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Risk-sensitive control of continuous time Markov chains

We study risk-sensitive control of continuous time Markov chains taking values in discrete state space. We study both finite and infinite horizon problems. In the finite horizon problem we characterize the value function via Hamilton Jacobi Bellman equation and obtain an optimal Markov control. We do the same for infinite horizon discounted cost case. In the infinite horizon average cost case we establish the existence of an optimal stationary control under certain Lyapunov condition. We also develop a policy iteration algorithm for finding an optimal control.

Taming Control Divergence in GPUs through Control Flow Linearization

Branch divergence is a very commonly occurring performance problem in GPGPU in which the execution of diverging branches is serialized to execute only one control flow path at a time. Existing hardware mechanism to reconverge threads using a stack causes duplicate execution of code for unstructured control flow graphs. Also the stack mechanism cannot effectively utilize the available parallelism among diverging branches. Further, the amount of nested divergence allowed is also limited by depth of the branch divergence stack. In this paper we propose a simple and elegant transformation to handle all of the above mentioned problems. The transformation converts an unstructured CFG to a structured CFG without duplicating user code. It incurs only a linear increase in the number of basic blocks and also the number of instructions. Our solution linearizes the CFG using a predicate variable. This mechanism reconverges the divergent threads as early as possible. It also reduces the depth of the reconvergence stack. The available parallelism in nested branches can be effectively extracted by scheduling the basic blocks to reduce the effect of stalls due to memory accesses. It can also increase execution efficiency of nested loops with different trip counts for different threads. We implemented the proposed transformation at PTX level using the Ocelot compiler infrastructure. We evaluated the technique using various benchmarks to show that it can be effective in handling the performance problem due to divergence in unstructured CFGs.

Use of polydispersity index as control parameter to study melting/freezing of Lennard-Jones system: Comparison among predictions of bifurcation theory with Lindemann criterion, inherent structure analysis and Hansen-Verlet rule

Using polydispersity index as an additional order parameter we investigate freezing/melting transition of Lennard-Jones polydisperse systems (with Gaussian polydispersity in size), especially to gain insight into the origin of the terminal polydispersity. The average inherent structure (IS) energy and root mean square displacement (RMSD) of the solid before melting both exhibit quite similar polydispersity dependence including a discontinuity at solid-liquid transition point. Lindemann ratio, obtained from RMSD, is found to be dependent on temperature. At a given number density, there exists a value of polydispersity index (delta (P)) above which no crystalline solid is stable. This transition value of polydispersity(termed as transition polydispersity, delta (P) ) is found to depend strongly on temperature, a feature missed in hard sphere model systems. Additionally, for a particular temperature when number density is increased, delta (P) shifts to higher values. This temperature and number density dependent value of delta (P) saturates surprisingly to a value which is found to be nearly the same for all temperatures, known as terminal polydispersity (delta (TP)). This value (delta (TP) similar to 0.11) is in excellent agreement with the experimental value of 0.12, but differs from hard sphere transition where this limiting value is only 0.048. Terminal polydispersity (delta (TP)) thus has a quasiuniversal character. Interestingly, the bifurcation diagram obtained from non-linear integral equation theories of freezing seems to provide an explanation of the existence of unique terminal polydispersity in polydisperse systems. Global bond orientational order parameter is calculated to obtain further insights into mechanism for melting.

EXACT INTERNAL CONTROLLABILITY FOR THE WAVE EQUATION IN A DOMAIN WITH OSCILLATING BOUNDARY WITH NEUMANN BOUNDARY CONDITION

In this paper, we study the exact controllability of a second order linear evolution equation in a domain with highly oscillating boundary with homogeneous Neumann boundary condition on the oscillating part of boundary. Our aim is to obtain the exact controllability for the homogenized equation. The limit problem with Neumann condition on the oscillating boundary is different and hence we need to study the exact controllability of this new type of problem. In the process of homogenization, we also study the asymptotic analysis of evolution equation in two setups, namely solution by standard weak formulation and solution by transposition method.