10 resultados para Desbordes-Valmore, Marceline, 1786-1859.

em Boston University Digital Common


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Sermon by William Fairfield Warren.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/somebyproductsof013993mbp

Relevância:

10.00% 10.00%

Publicador:

Resumo:

$u http://books.google.com/books?vid=OCLC02623863&id=mQz8gPn0et8C&a_sbrr=1 View book via Google

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Digitized by Google

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/spanishpioneersa009682mbp

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Reproduction of copy held by Special Collections, Bridewell Library, Perkins School of Theology, Southern Methodist University. Includes both DjVu and PDF files for download. Mode of access: World Wide Web.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/socialaspectsoff013484mbp

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Web caching aims to reduce network traffic, server load, and user-perceived retrieval delays by replicating "popular" content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches (which tend to mask these correlations). This trend points to the need for proxy cache replacement algorithms that directly capture and use popularity information. In this paper, we (1) present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy, (2) propose a novel cache replacement policy that uses such information to generalize the well-known GreedyDual-Size algorithm, and (3) show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We present a type inference algorithm, in the style of compositional analysis, for the language TRAFFIC—a specification language for flow composition applications proposed in [2]—and prove that this algorithm is correct: the typings it infers are principal typings, and the typings agree with syntax-directed type checking on closed flow specifications. This algorithm is capable of verifying partial flow specifications, which is a significant improvement over syntax-directed type checking algorithm presented in [3]. We also show that this algorithm runs efficiently, i.e., in low-degree polynomial time.