Simulation and modelling of orbital debris environment by equivalent breakups

It is well known that the increasing space activities pose a serious threat to future missions. This is mainly due to the presence of spent stages, rockets spacecraft and fragments which can lead to collisions. The calculation of the collision probability of future space vehicles with the orbital debris is necessary for estimating the risk. There is lack of adequately catalogued and openly available detailed information on the explosion characteristics of trackable and untrackable debris data. Such a situation compels one to develop suitable mathematical modelling of the explosion and the resultant debris environment. Based on a study of the available information regarding the fragmentation, subsequent evolution and observation, it turns out to be possible to develop such a mathematical model connecting the dynamical features of the fragmentation with the geometrical/orbital characteristics of the debris and representing the environment through the idea of equivalent breakup. (C) 1997 COSPAR.

Land availability and biomass production potential in India

In this paper we have assessed the availability of land and the potential for biomass production in India to meet various demands for biomass, including modern bioenergy. This is estimated by considering the various demands on land and its suitability. The biomass production potential of energy plantations is assessed for different agroecological zones. The total woody biomass production is estimated to be 321 Mt, based on biomass productivity in the range 2 to 17 t/ha/yr for the different agro-ecological zones and considering the conservative estimate of 43 Mha land availability for biomass production. A surplus of 231 Mt of biomass (after meeting the increased demand for fuelwood and timber by the year 2010) is estimated to be available for energy, which has an electricity generation potential of 231 TWh. As a first step, only the feasible physical potential of biomass production is assessed, along with an analysis of barriers. The potential costs and benefits of biomass production strategy are not analysed. (C) 1999 Elsevier Science Ltd. All rights reserved.

Mean first passage time approach to the problem of optimal barrier subdivision for Kramer's escape rate

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

Freezing of classical fluids in a quenched random potential

The phase diagram of a hard-sphere fluid in the presence of a random pinning potential is studied analytically and numerically. In the analytic work, replicas are introduced for averaging over the quenched disorder, and the hypernetted chain approximation is used to calculate density correlations in the replicated liquid. The freezing transition of the liquid into a nearly crystalline state is studied using a density-functional approach, and the liquid to glass transition is studied using a phenomenological replica symmetry breaking approach. In the numerical work, local minima of a discretized version of the Ramakrishnan-Yussouff free-energy functional are located and the phase diagram in the density-disorder plane is obtained from an analysis of the relative stability of these minima. Both approaches lead to similar results for the phase diagram. The first-order liquid to crystalline solid transition is found to change to a continuous liquid to glass transition as the strength of the disorder is increased above a threshold value.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.

Nonlinear Dynamics of Beams with Stochastic Parameter Variations

The aim of this paper is to investigate the steady state response of beams under the action of random support motions. The study is of relevance in the context of earthquake response of extended land based structures such as pipelines and long span bridges, and, secondary systems such as piping networks in nuclear power plant installations. The following complicating features are accounted for in the response analysis: (a) differential support motions: this is characterized in terms of cross power spectral density functions associated with distinct support motions, (b) nonlinear support conditions, and (c) stochastically inhomogeneous stiffness and mass variations of the beam structure; questions on non-Gaussian models for these variations are considered. The method of stochastic finite elements is combined with equivalent linearization technique and Monte Carlo simulations to obtain response moments.

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Doubly spectral stochastic finite element method (DSSFEM) for random field problems

Uncertainties in complex dynamic systems play an important role in the prediction of a dynamic response in the mid- and high-frequency ranges. For distributed parameter systems, parametric uncertainties can be represented by random fields leading to stochastic partial differential equations. Over the past two decades, the spectral stochastic finite-element method has been developed to discretize the random fields and solve such problems. On the other hand, for deterministic distributed parameter linear dynamic systems, the spectral finite-element method has been developed to efficiently solve the problem in the frequency domain. In spite of the fact that both approaches use spectral decomposition (one for the random fields and the other for the dynamic displacement fields), very little overlap between them has been reported in literature. In this paper, these two spectral techniques are unified with the aim that the unified approach would outperform any of the spectral methods considered on their own. An exponential autocorrelation function for the random fields, a frequency-dependent stochastic element stiffness, and mass matrices are derived for the axial and bending vibration of rods. Closed-form exact expressions are derived by using the Karhunen-Loève expansion. Numerical examples are given to illustrate the unified spectral approach.

Estimation of BT interference and equivalent channel tap in multipath fading channel

One of the major sources of interference for WLANs operating in 2.4GHz unlicensed ISM is Bluetooth (BT). Though OFDM based WLAN's have features like strong immunity to multipath channel effects, its performance detoriates severely whenever there is BT operating nearby. Even for high SIR (Signal to Interference Ratio), performance does not improve much because WLAN is not able to estimate correctly all its channel parameters in presence of BT interference. So, in this paper, the authors propose an algorithm for estimating BT interference and equivalent channel filter tap values.

Search on a Hypercubic Lattice using Quantum Random Walk

We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d=2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article [ A. Patel and M. A. Rahaman Phys. Rev. A 82 032330 (2010)] provides an O(√NlnN) algorithm, which is not optimal. The scaling behavior can be improved to O(√NlnN) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi Phys. Rev. A 78 012310 (2008). We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.

Evolving Random Geometric Graph Models for Mobile Wireless Networks

We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes the stationary distribution of the node locations exponential. For this model we obtain the one-step conditional connectivity probabilities and extend it to the k-step case. Finite and asymptotic analysis are given. We then obtain the k-step connectivity probability conditioned on the network being disconnected. We also derive the pmf of the first passage time for a connected network to become disconnected. We then describe a random birth-death model where at each instant, the node locations evolve according to an AR(1) process. In addition, a random node is allowed to die while giving birth to a node at another location. We derive properties similar to those above.

Quantum Random Walks without Coin Toss

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.