15 resultados para Schelling, Pauline (Gotter) 1786-1854.

em Boston University Digital Common


Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Digitized by Google

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

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/callofwatersstud01crowrich

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://moa.umdl.umich.edu/cgi/sgml/moa-idx?notisid=AAU8319 View book via University of Michigan

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

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:

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently adopt a set of local policies that specify which routes it accepts and advertises from/to other networks, as well as which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme (APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially-conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts (policy conflict-avoidance vs. -control mode), each AS dynamically adjusts its own path preferences—increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the substability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, routing load, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.