Ant colony optimization for reporting cell planning in mobile computing using selective paging strategy

Location management problem that arise in mobile computing networks is addressed. One method used in location management is to designate sonic of the cells in the network as "reporting cells". The other cells in the network are "non-reporting cells". Finding an optimal set of reporting cells (or reporting cell configuration) for a given network. is a difficult combinatorial optimization problem. In fact this is shown to be an NP-complete problem. in an earlier study. In this paper, we use the selective paging strategy and use an ant colony optimization method to obtain the best/optimal set of reporting cells for a given a network.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Peristaltic motion of a micropolar fluid

Peristaltic motion of a micropolar fluid is studied for small amplitudes of peristalic waves under low Reynolds number analysis. The effect of pressure gradient on the secondary motion reveals many interesting and useful results. The critical value of the pressure gradient ensuing the reversal effect in both velocity field and microrotation is evaluated and discussed.

A Modified Dubins Method for Optimal Path Planning of a Miniature Air Vehicle Converging to a Straight Line Path

This paper presents a Dubins model based strategy to determine the optimal path of a Miniature Air Vehicle (MAV), constrained by a bounded turning rate, that would enable it to fly along a given straight line, starting from an arbitrary initial position and orientation. The method is then extended to meet the same objective in the presence of wind which has a magnitude comparable to the speed of the MAV. We use a modification of the Dubins' path method to obtain the complete optimal solution to this problem in all its generality.

Automatic Path Planning and Control Design for Autonomous Landing of UAVs using Dynamic Inversion

In this paper a nonlinear control has been designed using the dynamic inversion approach for automatic landing of unmanned aerial vehicles (UAVs), along with associated path planning. This is a difficult problem because of light weight of UAVs and strong coupling between longitudinal and lateral modes. The landing maneuver of the UAV is divided into approach, glideslope and flare. In the approach UAV aligns with the centerline of the runway by heading angle correction. In glideslope and flare the UAV follows straight line and exponential curves respectively in the pitch plane with no lateral deviations. The glideslope and flare path are scheduled as a function of approach distance from runway. The trajectory parameters are calculated such that the sink rate at touchdown remains within specified bounds. It is also ensured that the transition from the glideslope to flare path is smooth by ensuring C-1 continuity at the transition. In the outer loop, the roll rate command is generated by assuring a coordinated turn in the alignment segment and by assuring zero bank angle in the glideslope and flare segments. The pitch rate command is generated from the error in altitude to control the deviations from the landing trajectory. The yaw rate command is generated from the required heading correction. In the inner loop, the aileron, elevator and rudder deflections are computed together to track the required body rate commands. Moreover, it is also ensured that the forward velocity of the UAV at the touch down remains close to a desired value by manipulating the thrust of the vehicle. A nonlinear six-DOF model, which has been developed from extensive wind-tunnel testing, is used both for control design as well as to validate it.

Motion of a bore over a sloping beach: an approximate analytical approach

The motion of a bore over a sloping beach, earlier considered numerically by Keller, Levine & Whitham (1960), is studied by an approximate analytic technique. This technique is an extension of Whitham's (1958) approach for the propagation of shocks into a non-uniform medium. It gives the entire flow behind the bore and is shown to be equivalent to the theory of modulated simple waves of Varley, Ventakaraman & Cumberbatch (1971).

Steady motion of a rotating stratified fluid bounded by porous disks

Abstract is not available.

A Spatial Planning Support System for Managing Bangalore's Urban Sprawl

Urban sprawl is the outgrowth along the periphery of cities and along highways. Although an accurate definition of urban sprawl may be debated, a consensus is that urban sprawl is characterized by an unplanned and uneven pattern of growth, driven by multitude of processes and leading to inefficient resource utilization. Urbanization in India has never been as rapid as it is in recent times. As one of the fastest growing economies in the world, India faces stiff challenges in managing the urban sprawl, while ensuring effective delivery of basic services in urban areas. The urban areas contribute significantly to the national economy (more than 50% of GDP), while facing critical challenges in accessing basic services and necessary infrastructure, both social and economic. The overall rise in the population of the urban poor or the increase in travel times due to congestion along road networks are indicators of the effectiveness of planning and governance in assessing and catering for this demand. Agencies of governance at all levels: local bodies, state government and federal government, are facing the brunt of this rapid urban growth. It is imperative for planning and governance to facilitate, augment and service the requisite infrastructure over time systematically. Provision of infrastructure and assurance of the delivery of basic services cannot happen overnight and hence planning has to facilitate forecasting and service provision with appropriate financial mechanisms.

The fully implicit stochastic-alpha method for stiff stochastic differential equations

A fully implicit integration method for stochastic differential equations with significant multiplicative noise and stiffness in both the drift and diffusion coefficients has been constructed, analyzed and illustrated with numerical examples in this work. The method has strong order 1.0 consistency and has user-selectable parameters that allow the user to expand the stability region of the method to cover almost the entire drift-diffusion stability plane. The large stability region enables the method to take computationally efficient time steps. A system of chemical Langevin equations simulated with the method illustrates its computational efficiency.

An FETI-preconditioned conjuerate gradient method for large-scale stochastic finite element problems

In the spectral stochastic finite element method for analyzing an uncertain system. the uncertainty is represented by a set of random variables, and a quantity of Interest such as the system response is considered as a function of these random variables Consequently, the underlying Galerkin projection yields a block system of deterministic equations where the blocks are sparse but coupled. The solution of this algebraic system of equations becomes rapidly challenging when the size of the physical system and/or the level of uncertainty is increased This paper addresses this challenge by presenting a preconditioned conjugate gradient method for such block systems where the preconditioning step is based on the dual-primal finite element tearing and interconnecting method equipped with a Krylov subspace reusage technique for accelerating the iterative solution of systems with multiple and repeated right-hand sides. Preliminary performance results on a Linux Cluster suggest that the proposed Solution method is numerically scalable and demonstrate its potential for making the uncertainty quantification Of realistic systems tractable.

Seismic Microzonation: A Tool for Disaster Mitigation Planning

Seismic microzonation has generally been recognized as the most accepted tool in seismic hazard assessment and risk evaluation. In general, risk reduction can be done by reducing the hazard, the vulnerability or the value at risk. Since the earthquake hazard can not be reduced, one has to concentrate on vulnerability and value at risk. The vulnerability of an urban area / municipalities depends on the vulnerability of infrastructure and redundancies within the infrastructure. The earthquake risk is the damage to buildings along with number of people that are killed / hurt and the economic losses during the event due to an earthquake with a return period corresponding to this time period. The principal approaches one can follow to reduce these losses are to avoid, if possible, high hazard areas for the siting of buildings and infrastructure, and further ensure that the buildings and infrastructure are designed and constructed to resist expected earthquake loads. This can be done if one can assess the hazard at local scales. Seismic microzonation maps provide the basis for scientifically based decision-making to reduce earthquake risk for Govt./public agencies, private owners and the general public. Further, seismic microzonation carried out on an appropriate scale provides a valuable tool for disaster mitigation planning and emergency response planning for urban centers / municipalities. It provides the basis for the identification of the areas of the city / municipality which are most likely to experience serious damage in the event of an earthquake.

A dynamic renormalization group study of active nematics

We carry out a systematic construction of the coarse-grained dynamical equation of motion for the orientational order parameter for a two-dimensional active nematic, that is a nonequilibrium steady state with uniaxial, apolar orientational order. Using the dynamical renormalization group, we show that the leading nonlinearities in this equation are marginally irrelevant. We discover a special limit of parameters in which the equation of motion for the angle field bears a close relation to the 2d stochastic Burgers equation. We find nevertheless that, unlike for the Burgers problem, the nonlinearity is marginally irrelevant even in this special limit, as a result of a hidden fluctuation-dissipation relation. 2d active nematics therefore have quasi-long-range order, just like their equilibrium counterparts.

Fractional damping: Stochastic origin and finite approximations

Fractional-order derivatives appear in various engineering applications including models for viscoelastic damping. Damping behavior of materials, if modeled using linear, constant coefficient differential equations, cannot include the long memory that fractional-order derivatives require. However, sufficiently great rnicrostructural disorder can lead, statistically, to macroscopic behavior well approximated by fractional order derivatives. The idea has appeared in the physics literature, but may interest an engineering audience. This idea in turn leads to an infinite-dimensional system without memory; a routine Galerkin projection on that infinite-dimensional system leads to a finite dimensional system of ordinary differential equations (ODEs) (integer order) that matches the fractional-order behavior over user-specifiable, but finite, frequency ranges. For extreme frequencies (small or large), the approximation is poor. This is unavoidable, and users interested in such extremes or in the fundamental aspects of true fractional derivatives must take note of it. However, mismatch in extreme frequencies outside the range of interest for a particular model of a real material may have little engineering impact.

Modelling of solute transport in a mild heterogeneous porous medium using stochastic finite element method: Effects of random source conditions

Randomness in the source condition other than the heterogeneity in the system parameters can also be a major source of uncertainty in the concentration field. Hence, a more general form of the problem formulation is necessary to consider randomness in both source condition and system parameters. When the source varies with time, the unsteady problem, can be solved using the unit response function. In the case of random system parameters, the response function becomes a random function and depends on the randomness in the system parameters. In the present study, the source is modelled as a random discrete process with either a fixed interval or a random interval (the Poisson process). In this study, an attempt is made to assess the relative effects of various types of source uncertainties on the probabilistic behaviour of the concentration in a porous medium while the system parameters are also modelled as random fields. Analytical expressions of mean and covariance of concentration due to random discrete source are derived in terms of mean and covariance of unit response function. The probabilistic behaviour of the random response function is obtained by using a perturbation-based stochastic finite element method (SFEM), which performs well for mild heterogeneity. The proposed method is applied for analysing both the 1-D as well as the 3-D solute transport problems. The results obtained with SFEM are compared with the Monte Carlo simulation for 1-D problems.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.