The Internet is established on the best-effort service model. The Transmission Control Protocol employed in the current Internet has both fairness and efficiency issues. Pricing scheme has been proposed to address the fairness issue and prevent aggressive users occupying excessive network resource. Random early detection (RED) for the incipient congestion in routers, together with explicit cong...

Scientific publications contain many references to method terminologies used during scientific experiments. New terms are constantly created within the research community, especially in the biomedical domain where thousands of papers are published each week. In this study we report our attempt to automatically extract such method terminologies from scientific research papers, using rule-based a...

since the emergence of the process-oriented approach to second language writing instruction two main questions have been what and how error feedback should be given to the students. the question of whether teachers should provide feedback on grammar in the writing assignments of english as a foreign language students, and if so how, has been a matter of considerable debate in the field of secon...

Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related ``dispersers,'' exhibit some of the most ``random-like'' properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and ...

Completing previous results, we construct, for every 1/2 6 s 6 1, explicit examples of nearest neighbour random walks on the nonnegative integer line such that s is the scaling exponent of the associated random walk in random scenery for square integrable i.i.d. sceneries. We use coupling techniques to compare the distributions of the local times of such random walks.

let $g$ be a molecular graph with vertex set $v(g)$, $d_g(u, v)$ the topological distance between vertices $u$ and $v$ in $g$. the hosoya polynomial $h(g, x)$ of $g$ is a polynomial $sumlimits_{{u, v}subseteq v(g)}x^{d_g(u, v)}$ in variable $x$. in this paper, we obtain an explicit analytical expression for the expected value of the hosoya polynomial of a random benzenoid chain with $n$ hexagon...

An original technique to incorporate random fields non-intrusively in probabilistic design is presented. The approach is based on the extraction of the main features of a random field using a limited number of experimental observations (snapshots). An approximation of the random field is obtained using proper orthogonal decomposition (POD). For a given failure criterion, an explicit limit state...

Mark Kac gave an explicit formula for the expectation of the number, vn (a), of zeros of a random polynomial, n-I Pn(z) = E ?tj, j=O in any measurablc subset Q of the reals. Here, ... ?In-I are independent standard normal random variables. In fact, for each n > 1, he obtained an explicit intensity function gn for which E vn(L) = Jgn(x) dx. Here, we extend this formula to obtain an explicit form...