The aim of this article is twofold: First, we study the problem of packets retention in a queue with the aim of minimizing transmission power in delay-tolerant applications. The problem is classified as an optimal stopping problem. The optimal stopping rule has been derived as well. Optimal number of released packets is determined in each round through an Integer Linear Programming (ILP) optimi...

The proximal method is a standard regularization approach in optimization. Practical implementations of this algorithm require (i) an algorithm to compute the proximal point, (ii) a rule to stop this algorithm, (iii) an update formula for the proximal parameter. In this work we focus on (ii), when smoothness is present – so that Newton-like methods can be used for (i): we aim at giving adequate...

We calculate the stopping power for heavy-ion diclusters moving in a strongly coupled two-dimensional electron gas system by using the local field corrected dielectric function at finite temperature. We obtain a parameterized local field correction factor based on a relation between the thermal compressibility and exchange-correlation energy in two-dimension. The interpolated parameter is deriv...

canola genotypes reaction to stopping irrigation was surveyed. this experiment was carried out as a split plot randomized block design whit three replications in the safiabad argicultural research center for two years. main plot was considered of different levels of stopping  irrigation (stopping irrigation at the ending flowering, poding, 10%  and 30% ripening of pods in main stem ) and sub pl...

1.1. The subject of this paper is the problem of optimal stopping for discrete multiparameter stochastic processes; in particular, for a family of Markov processes. In 1953, Snell [12J discovered the relation between optimal stopping of a random sequence and supermartingales. In 1963, Dynkin [3] described the optimal stopping rule for a Markov process in terms of excessive functions. In 1966, H...

The discrete Green’s function (without boundary) G is a pseudo-inverse of the combinatorial Laplace operator of a graph G = (V,E). We reveal the intimate connection between Green’s function and the theory of exact stopping rules for random walks on graphs. We give an elementary formula for Green’s function in terms of state-to-state hitting times of the underlying graph. Namely, G(i, j) = πj (∑...

A belief network is a graphical representation of the underlying probabilistic relationships in a complex system. Belief networks have been employed as a representation of uncertain relationships in computer-based diagnostic systems. These diagnostic systems provide assistance by assigning likelihoods to alternative explanatory hypotheses in response to a set of ndings or observations. Approxim...

Network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking advantage of the broadcast nature of wireless channels. However, there are some scenarios where the coding cannot be exploited due to the stochastic nature of...