In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...

in this paper, we study the arens regularity properties of module actions and we extend some proposition from baker, dales, lau and others into general situations. we establish some relationships between the topological centers of module actions and factorization properties of them with some results in group algebras. in 1951 arens shows that the second dual of banach algebra endowed with the e...

In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...

some servers are to be located at nodes of a network. demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. customers may waive receiving service with a known proba...

The matrix affine Poisson space (Mm,n, πm,n) is the space of complex rectangular matrices equipped with a canonical quadratic Poisson structure which in the square case m = n reduces to the standard Poisson structure on GLn(C). We prove that the Hamiltonian flows of all minors are complete. As a corollary we obtain that all Kogan–Zelevinsky integrable systems on Mn,n are complete and thus induc...

We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable W satisfies a certain negative dependence assumption, then W is smaller (in the convex sense) than a Poisson variable of equal mean. Such W include those which may be written as a sum of totally negatively dependent indicators. This is generalised to other stochastic orderings. Application...

A symplectic variety X is a normal algebraic variety (defined over C) which admits an everywhere non-degenerate d-closed 2-form ω on the regular locus Xreg of X such that, for any resolution f : X̃ → X with f (Xreg) ∼= Xreg, the 2-form ω extends to a regular closed 2-form on X̃ (cf. [Be]). There is a natural Poisson structure { , } on X determined by ω. Then we can introduce the notion of a Poiss...

A symplectic variety X is a normal algebraic variety (defined over C) which admits an everywhere non-degenerate d-closed 2-form ω on the regular locus Xreg of X such that, for any resolution f : X̃ → X with f (Xreg) ∼= Xreg, the 2-form ω extends to a regular closed 2-form on X̃ (cf. [Be]). There is a natural Poisson structure { , } on X determined by ω. Then we can introduce the notion of a Poiss...