Eigenvalues of kinematical conservation laws (KCL) based 3-D weakly nonlinear ray theory (WNLRT)

System of kinematical conservation laws (KCL) govern evolution of a curve in a plane or a surface in space, even if the curve or the surface has singularities on it. In our recent publication K. R. Arun, P. Prasad, 3-D kinematical conservation laws (KCL): evolution of a surface in R-3-in particular propagation of a nonlinear wavefront, Wave Motion 46 (2009) 293-311] we have developed a mathematical theory to study the successive positions and geometry of a 3-D weakly nonlinear wavefront by adding an energy transport equation to KCL. The 7 x 7 system of equations of this KCL based 3-D weakly nonlinear ray theory (WNLRT) is quite complex and explicit expressions for its two nonzero eigenvalues could not be obtained before. In this short note, we use two different methods: (i) the equivalence of KCL and ray equations and (ii) the transformation of surface coordinates, to derive the same exact expressions for these eigenvalues. The explicit expressions for nonzero eigenvalues are important also for checking stability of any numerical scheme to solve 3-D WNLRT. (C) 2010 Elsevier Inc. All rights reserved.

Control of Agent Swarms using Generalized Centroidal Cyclic Pursuit Laws

One of the major tasks in swarm intelligence is to design decentralized but homogenoeus strategies to enable controlling the behaviour of swarms of agents. It has been shown in the literature that the point of convergence and motion of a swarm of autonomous mobile agents can be controlled by using cyclic pursuit laws. In cyclic pursuit, there exists a predefined cyclic connection between agents and each agent pursues the next agent in the cycle. In this paper we generalize this idea to a case where an agent pursues a point which is the weighted average of the positions of the remaining agents. This point correspond to a particular pursuit sequence. Using this concept of centroidal cyclic pursuit, the behavior of the agents is analyzed such that, by suitably selecting the agents' gain, the rendezvous point of the agents can be controlled, directed linear motion of the agents can be achieved, and the trajectories of the agents can be changed by switching between the pursuit sequences keeping some of the behaviors of the agents invariant. Simulation experiments are given to support the analytical proofs.

Turbulent near-wake studies behind an infinitely swept wing

The three-dimensional asymmetric turbulent near-Rake behind an infinitely swept wing with GAW(2) airfoil has been investigated at low speeds. The near-wake in the present study is asymmetric because the boundary layers on the top and bottom surfaces of the model develop under different streamwise pressure gradients. Distributions of mean velocity, three turbulent normal stresses, and two important Reynolds shear stresses have been measured using hot-wire anemometry. The profiles of mean velocity and Reynolds shear stress exhibit asymmetry near the trailing edge and seem to have become symmetric within a short distance of 6 trailing edge momentum thicknesses. Results of computation using K-epsilon turbulence model with a simple scheme to predict the near-wake behind the swept wing have also been presented and compared with the experimental data. The agreement of the predicted mean How development with the experiment is fair considering the simplicity of the scheme.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Limit Laws for Coverage in Backbone-Sensor Networks

We study the coverage in sensor networks having two types of nodes, sensor and backbone nodes. Each sensor is capable of transmitting information over relatively small distances. The backbone nodes collect information from the sensors. This information is processed and communicated over an ad-hoc network formed by the backbone nodes,which are capable of transmitting over much larger distances. We consider two modes of deployment of sensors, one a Poisson-Poisson cluster model and the other a dependently-thinned Poisson point process. We deduce limit laws for functionals of vacancy in both models using properties of association for random measures.

Universality of scaling laws in correlation between velocity and shear stress in turbulent boundary layers

In this study, we analyse simultaneous measurements (at 50 Hz) of velocity at several heights and shear stress at the surface made during the Utah field campaign for the presence of ranges of scales, where distinct scale-to-scale interactions between velocity and shear stress can be identified. We find that our results are similar to those obtained in a previous study [Venugopal et al., 2003] (contrary to the claim in V2003, that the scaling relations might be dependent on Reynolds number) where wind tunnel measurements of velocity and shear stress were analysed. We use a wavelet-based scale-to-scale cross-correlation to detect three ranges of scales of interaction between velocity and shear stress, namely, (a) inertial subrange, where the correlation is negligible; (b) energy production range, where the correlation follows a logarithmic law; and (c) for scales larger than the boundary layer height, the correlation reaches a plateau.

Quenching across quantum critical points in periodic systems: Dependence of scaling laws on periodicity

We study the quenching dynamics of a many-body system in one dimension described by a Hamiltonian that has spatial periodicity. Specifically, we consider a spin-1/2 chain with equal xx and yy couplings and subject to a periodically varying magnetic field in the (z) over cap direction or, equivalently, a tight-binding model of spinless fermions with a periodic local chemical potential, having period 2q, where q is a positive integer. For a linear quench of the strength of the magnetic field (or chemical potential) at a rate 1/tau across a quantum critical point, we find that the density of defects thereby produced scales as 1/tau(q/(q+1)), deviating from the 1/root tau scaling that is ubiquitous in a range of systems. We analyze this behavior by mapping the low-energy physics of the system to a set of fermionic two-level systems labeled by the lattice momentum k undergoing a nonlinear quench as well as by performing numerical simulations. We also show that if the magnetic field is a superposition of different periods, the power law depends only on the smallest period for very large values of tau, although it may exhibit a crossover at intermediate values of tau. Finally, for the case where a zz coupling is also present in the spin chain, or equivalently, where interactions are present in the fermionic system, we argue that the power associated with the scaling law depends on a combination of q and the interaction strength.

Fatigue crack growth due to overloads in plain concrete using scaling laws

Scaling laws are represented in power law form and can be utilized to extract the characteristic properties of a new phenomenon with the help of self-similar solutions. In this work, an attempt has been made to propose a scaling law analytically, for plain concrete when subjected to variable amplitude loading. Due to the application of overload on concrete structures, acceleration in the crack growth process takes place. A closed form expression has been developed to capture the acceleration in crack growth rate in conjunction with the principles of dimensional analysis and self-similarity. The proposed model accounts for parameters such as, the tensile strength, fracture toughness, overload effect and the structural size. Knowing the governed and the governing parameters of the physical problem and by using the concepts of self-similarity, a relationship is obtained between the different parameters involved. The predicted results are compared with experimental crack growth data for variable amplitude loading and are found to capture the overload effect with sufficient accuracy. Through a sensitivity analysis, fracture toughness is found to be the most dominant parameter in accelerating the crack length due to application of overload.

Directional Diffusion Regulator (DDR) for some numerical solvers of hyperbolic conservation laws

A computational tool called ``Directional Diffusion Regulator (DDR)'' is proposed to bring forth real multidimensional physics into the upwind discretization in some numerical schemes of hyperbolic conservation laws. The direction based regulator when used with dimension splitting solvers, is set to moderate the excess multidimensional diffusion and hence cause genuine multidimensional upwinding like effect. The basic idea of this regulator driven method is to retain a full upwind scheme across local discontinuities, with the upwind bias decreasing smoothly to a minimum in the farthest direction. The discontinuous solutions are quantified as gradients and the regulator parameter across a typical finite volume interface or a finite difference interpolation point is formulated based on fractional local maximum gradient in any of the weak solution flow variables (say density, pressure, temperature, Mach number or even wave velocity etc.). DDR is applied to both the non-convective as well as whole unsplit dissipative flux terms of some numerical schemes, mainly of Local Lax-Friedrichs, to solve some benchmark problems describing inviscid compressible flow, shallow water dynamics and magneto-hydrodynamics. The first order solutions consistently improved depending on the extent of grid non-alignment to discontinuities, with the major influence due to regulation of non-convective diffusion. The application is also experimented on schemes such as Roe, Jameson-Schmidt-Turkel and some second order accurate methods. The consistent improvement in accuracy either at moderate or marked levels, for a variety of problems and with increasing grid size, reasonably indicate a scope for DDR as a regular tool to impart genuine multidimensional upwinding effect in a simpler framework. (C) 2012 Elsevier Inc. All rights reserved.

Limit laws for coverage in backbone-sensor networks

We study coverage in sensor networks having two types of nodes, namely, sensor nodes and backbone nodes. Each sensor is capable of transmitting information over relatively small distances. The backbone nodes collect information from the sensors. This information is processed and communicated over an ad hoc network formed by the backbone nodes, which are capable of transmitting over much larger distances. We consider two models of deployment for the sensor and backbone nodes. One is a PoissonPoisson cluster model and the other a dependently thinned Poisson point process. We deduce limit laws for functionals of vacancy in both models using properties of association for random measures.

Terminal Impact Angle Constrained Guidance Laws Using Variable Structure Systems Theory

In this brief, variable structure systems theory based guidance laws, to intercept maneuvering targets at a desired impact angle, are presented. Choosing the missile's lateral acceleration (latax) to enforce sliding mode, which is the principal operating mode of variable structure systems, on a switching surface defined by the line-of-sight angle leads to a guidance law that allows the achievement of the desired terminal impact angle. As will be shown, this law does not ensure interception for all states of the missile and the target during the engagement. Hence, additional switching surfaces are designed and a switching logic is developed that allows the latax to switch between enforcing sliding mode on one of these surfaces so that the target can be intercepted at the desired impact angle. The guidance laws are designed using nonlinear engagement dynamics for the general case of a maneuvering target.

Sliding mode control based terminal impact angle constrained guidance laws using dual sliding surfaces

In this paper, sliding mode control theory based guidance laws to intercept non-maneuvering targets at a desired impact angle are presented. The desired impact angle, defined in terms of a desired line-of-sight (LOS) angle, is achieved by selecting the missile's lateral acceleration (latax) to enforce sliding mode on a sliding surface based on this LOS angle. As will be shown, this guidance law does not ensure interception for all states of the missile and the target during the engagement. Hence, to satisfy the requirement of interception at the desired impact angle, a second sliding surface is designed and a switching logic, based on the conditions necessary for interception, is presented that allows the latax to switch between enforcing sliding mode on one of these surfaces so that the target can be intercepted at the desired impact angle. The guidance laws are designed using non-linear engagement dynamics.