State Dependent Attempt Rate Modeling of Single Cell IEEE 802.11 WLANs with Homogeneous Nodes and Poisson Arrivals

Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.

A Computationally Efficient Generalized Poisson Solution for Independent Double-Gate Transistors

Previous techniques used for solving the 1-D Poisson equation ( PE) rigorously for long-channel asymmetric and independent double-gate (IDG) transistors result in potential models that involve multiple intercoupled implicit equations. As these equations need to be solved self-consistently, such potential models are clearly inefficient for compact modeling. This paper reports a different rigorous technique for solving the same PE by which one can obtain the potential profile of a generalized IDG transistor that involves a single implicit equation. The proposed Poisson solution is shown to be computationally more efficient for circuit simulation than the previous solutions.

Effect of relative density and confining pressure on Poisson ratio from bender and extender elements tests

By using the bender and extender elements tests, together with measurements of the travel times of shear (S) and primary (P) waves, the variation of Poisson ratio (nu) was determined for dry sands with respect to changes in relative densities and effective confining pressures (sigma(3)). The tests were performed for three different ranges of particle sizes. The magnitude of the Poisson ratio decreases invariably with an increase in both the relative density and the effective confining pressure. The effect of the confining pressure on the Poisson ratio was found to become relatively more significant for fine-grained sand as compared with the coarse-grained sand. For a given material, at a particular value of sigma(3), the magnitude of the Poisson ratio decreases, almost in a linear fashion, with an increase in the value of maximum shear modulus (G(max)). The two widely used correlations in literature, providing the relationships among G(max), void ratio (e) and effective confining pressure (sigma(3)), applicable for angular granular materials, were found to compare reasonably well with the present experimental data for the fine- and medium-grained sands. However, for the coarse-grained sand, these correlations tend to overestimate the values of G(max).

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

State Dependent Attempt Rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson packet arrivals

We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of n saturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells. (C) 2012 Elsevier B.V. All rights reserved.

MODELING HETEROSTRUCTURES WITH SCHRODINGER-POISSON-NAVIER ITERATIVE SCHEMES, EFFECT OF CARRIER CHARGE, AND INFLUENCE OF ELECTROMECHANICAL COUPLING

This paper presents a detailed investigation of the erects of piezoelectricity, spontaneous polarization and charge density on the electronic states and the quasi-Fermi level energy in wurtzite-type semiconductor heterojunctions. This has required a full solution to the coupled Schrodinger-Poisson-Navier model, as a generalization of earlier work on the Schrodinger-Poisson problem. Finite-element-based simulations have been performed on a A1N/GaN quantum well by using both one-step calculation as well as the self-consistent iterative scheme. Results have been provided for field distributions corresponding to cases with zero-displacement boundary conditions and also stress-free boundary conditions. It has been further demonstrated by using four case study examples that a complete self-consistent coupling of electromechanical fields is essential to accurately capture the electromechanical fields and electronic wavefunctions. We have demonstrated that electronic energies can change up to approximately 0.5 eV when comparing partial and complete coupling of electromechanical fields. Similarly, wavefunctions are significantly altered when following a self-consistent procedure as opposed to the partial-coupling case usually considered in literature. Hence, a complete self-consistent procedure is necessary when addressing problems requiring more accurate results on optoelectronic properties of low-dimensional nanostructures compared to those obtainable with conventional methodologies.

Bipolar Poisson Solution for Independent Double-Gate MOSFET

We propose a new set of input voltage equations (IVEs) for independent double-gate MOSFET by solving the governing bipolar Poisson equation (PE) rigorously. The proposed IVEs, which involve the Legendre's incomplete elliptic integral of the first kind and Jacobian elliptic functions and are valid from accumulation to inversion regimes, are shown to have good agreement with the numerical solution of the same PE for all bias conditions.

Optimal parameter selection for bilateral filters using Poisson unbiased risk estimate

Bilateral filters perform edge-preserving smoothing and are widely used for image denoising. The denoising performance is sensitive to the choice of the bilateral filter parameters. We propose an optimal parameter selection for bilateral filtering of images corrupted with Poisson noise. We employ the Poisson's Unbiased Risk Estimate (PURE), which is an unbiased estimate of the Mean Squared Error (MSE). It does not require a priori knowledge of the ground truth and is useful in practical scenarios where there is no access to the original image. Experimental results show that quality of denoising obtained with PURE-optimal bilateral filters is almost indistinguishable with that of the Oracle-MSE-optimal bilateral filters.

An Ensemble Kushner-Stratonovich-Poisson Filter for Recursive Estimation in Nonlinear Dynamical Systems

We propose a Monte Carlo filter for recursive estimation of diffusive processes that modulate the instantaneous rates of Poisson measurements. A key aspect is the additive update, through a gain-like correction term, empirically approximated from the innovation integral in the time-discretized Kushner-Stratonovich equation. The additive filter-update scheme eliminates the problem of particle collapse encountered in many conventional particle filters. Through a few numerical demonstrations, the versatility of the proposed filter is brought forth.

解非定常不可压缩N-S方程的迭代压力Poisson方程法

该文将压力Poisson方程法改进为多步迭代计算,Poisson方程中未知量改为压力的增量.称这样的方法为迭代压力Poisson方程法.其优点如下:1.能保证离散的连续方程成立(达到要求的精度,);2.Poisson方程中~2_H不必用高精度的算子,例如对二维四阶紧致格式,可取~2_H为五点中心差.Chorin方法相当于取Poisson方程中~2_H为－λ/Δt;3.与Chorin方法相比,收敛速度要快得多;4.可直接应用于三维问题.(对三维问题,~2_H可用七点中心差);5.可以推广到有限元格式.为了提高计算精度,利用三次样条函数插值的思想构造差分格式,可以在不增加网格点的情况下提高差分精度.

Thermodynamical versus log-Poisson distribution in turbulence

The thermodynamical model of intermittency in fully developed turbulence due to Castaing (B. Castaing, J. Phys. II France 6 (1996) 105) is investigated and compared with the log-Poisson model (Z-S, She, E. Leveque, Phys. Rev. Lett. 72 (1994) 336). It is shown that the thermodynamical model obeys general scaling laws and corresponds to the degenerate class of scale-invariant statistics. We also find that its structure function shapes have physical behaviors similar to the log-Poisson's one. The only difference between them lies in the convergence of the log-Poisson's structure functions and divergence of the thermodynamical one. As far as the comparison with experiments on intermittency is concerned, they are indifferent.

Tractable nonparametric bayesian inference in poisson processes with Gaussian process intensities

The inhomogeneous Poisson process is a point process that has varying intensity across its domain (usually time or space). For nonparametric Bayesian modeling, the Gaussian process is a useful way to place a prior distribution on this intensity. The combination of a Poisson process and GP is known as a Gaussian Cox process, or doubly-stochastic Poisson process. Likelihood-based inference in these models requires an intractable integral over an infinite-dimensional random function. In this paper we present the first approach to Gaussian Cox processes in which it is possible to perform inference without introducing approximations or finitedimensional proxy distributions. We call our method the Sigmoidal Gaussian Cox Process, which uses a generative model for Poisson data to enable tractable inference via Markov chain Monte Carlo. We compare our methods to competing methods on synthetic data and apply it to several real-world data sets. Copyright 2009.

Tractable nonparametric Bayesian inference in Poisson processes with Gaussian process intensities

The inhomogeneous Poisson process is a point process that has varying intensity across its domain (usually time or space). For nonparametric Bayesian modeling, the Gaussian process is a useful way to place a prior distribution on this intensity. The combination of a Poisson process and GP is known as a Gaussian Cox process, or doubly-stochastic Poisson process. Likelihood-based inference in these models requires an intractable integral over an infinite-dimensional random function. In this paper we present the first approach to Gaussian Cox processes in which it is possible to perform inference without introducing approximations or finite-dimensional proxy distributions. We call our method the Sigmoidal Gaussian Cox Process, which uses a generative model for Poisson data to enable tractable inference via Markov chain Monte Carlo. We compare our methods to competing methods on synthetic data and apply it to several real-world data sets.