A flexible receiver-driven cache replacement scheme for continuous media objects in best-effort networks

In this paper, we investigate the potential of caching to improve quality of reception (QoR) in the context of continuous media applications over best-effort networks. Specifically, we investigate the influence of parameters such as loss rate, jitter, delay and area in determining a proxy's cache contents. We propose the use of a flexible cost function in caching algorithms and develop a framework for benchmarking continuous media caching algorithms. The cost function incorporates parameters in which, an administrator and or a client can tune to influence a proxy's cache. Traditional caching systems typically base decisions around static schemes that do not take into account the interest of their receiver pool. Based on the flexible cost function, an improvised Greedy Dual (GD) algorithm called GD-multi has been developed for layered multiresolution multimedia streams. The effectiveness of the proposed scheme is evaluated by simulation-based performance studies. Performance of several caching schemes are evaluated and compared with those of the proposed scheme. Our empirical results indicate GD-multi performs well despite employing a generalized caching policy.

Performance modelling of speculative prefetching for compound requests in low bandwidth networks

To improve the accuracy of access prediction, a prefetcher for web browsing should recognize the fact that a web page is a compound. By this term we mean that a user request for a single web page may require the retrieval of several multimedia items. Our prediction algorithm builds an access graph that captures the dynamics of web navigation rather than merely attaching probabilities to hypertext structure. When it comes to making prefetch decisions, most previous studies in speculative prefetching resort to simple heuristics, such as prefetching an item with access probabilities larger than a manually tuned threshold. The paper takes a different approach. Specifically, it models the performance of the prefetcher and develops a prefetch policy based on a theoretical analysis of the model. In the analysis, we derive a formula for the expected improvement in access time when prefetch is performed in anticipation for a compound request. We then develop an algorithm that integrates prefetch and cache replacement decisions so as to maximize this improvement. We present experimental results to demonstrate the effectiveness of compound-based prefetching in low bandwidth networks.

A performance model of speculative prefetching in distributed information systems

Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modelling. We use improvement in access time as the performance metric, for which we derive a formula in terms of resource parameters (time available and time required for prefetching) and speculative parameters (probabilities for next access). The performance maximization problem is expressed as a stretch knapsack problem. We develop an algorithm to maximize the improvement in access time by solving the stretch knapsack problem, using theoretically proven apparatus to reduce the search space. Integration between speculative prefetching and caching is also investigated, albeit under the assumption of equal item sizes.

A cache-based mobility-aware scheme for real-time continuous media delivery in wireless networks

Providing real-time or continuous media (CM) application services in wireless networks poses a significant challenge, as it requires timely delivery of data in a best-effort network. In this paper, we propose a cache-based scheme for mobility-aware, CM applications. The proposed scheme exploits a previously proposed caching strategy to complement Mobile-IP by placing services closer to migrated mobile nodes. The central idea of this work is based on the migration of sessions in order to facilitate uninterrupted delivery of CM in mobile environments. The performance of the proposed scheme is investigated by simulation studies. In particular, the effect of the proposed scheme on several QoS parameters under varying conditions of mobility and CM data is measured.

Cache and carry : hoarding behavior of arctic fox

Food-hoarding animals are expected to preferentially cache items with lower perishability and/or higher consumption time. We observed arctic foxes (Alopex lagopus) foraging in a greater snow goose (Anser caerulescens atlanticus) colony where the main prey of foxes consisted of goose eggs, goslings, and lemmings (Lemmus and Dicrostonyx spp.). We recorded the number of prey consumed and cached and the time that foxes invested in these activities. Foxes took more time to consume a goose egg than a lemming or gosling but cached a greater proportion of eggs than the other prey type. This may be caused by the eggshell, which presumably decreases the perishability and/or pilfering risk of cached eggs, but also increases egg consumption time. Arctic foxes usually recached goose eggs but rarely recached goslings or lemmings. We tested whether the rapid-sequestering hypothesis could explain this recaching behavior. According to this hypothesis, arctic foxes may adopt a two-stage strategy allowing both to maximize egg acquisition rate in an undefended nest and subsequently secure eggs in potentially safer sites. Foxes spent more time carrying an egg and traveled greater distances when establishing a secondary than a primary cache. To gain further information on the location and subsequent fate of cached eggs, we used dummy eggs containing radio transmitters. Lifespan of primary caches increased with distance from the goose nest. Secondary caches were generally located farther from the nest and had a longer lifespan than primary caches. Behavioral observations and the radio-tagged egg technique both gave results supporting the rapid-sequestering hypothesis.

Common ravens raid arctic fox food caches

Cache recovery is critical for evolution of hoarding behaviour, because the energy invested in caching may be lost if consumers other than the hoarders benefit from the cached food. By raiding food caches, animals may exploit the caching habits of others, that should respond by actively defending their caches. The arctic fox (Alopex lagopus) is the main predator of lemmings and goose eggs in the Canadian High Arctic and stores much of its prey in the ground. Common ravens (Corvus corax) are not as successful as foxes in taking eggs from goose nests. This generalist avian predator regularly uses innovation and opportunism to survive in many environments. Here, we provide the first report that ravens can successfully raid food cached by foxes, and that foxes may defend their caches from ravens.

Software Tools For Large Scale Interactive Hydrodynamic Modeling

Running hydrodynamic models interactively allows both visual exploration and change of model state during simulation. One of the main characteristics of an interactive model is that it should provide immediate feedback to the user, for example respond to changes in model state or view settings. For this reason, such features are usually only available for models with a relatively small number of computational cells, which are used mainly for demonstration and educational purposes. It would be useful if interactive modeling would also work for models typically used in consultancy projects involving large scale simulations. This results in a number of technical challenges related to the combination of the model itself and the visualisation tools (scalability, implementation of an appropriate API for control and access to the internal state). While model parallelisation is increasingly addressed by the environmental modeling community, little effort has been spent on developing a high-performance interactive environment. What can we learn from other high-end visualisation domains such as 3D animation, gaming, virtual globes (Autodesk 3ds Max, Second Life, Google Earth) that also focus on efficient interaction with 3D environments? In these domains high efficiency is usually achieved by the use of computer graphics algorithms such as surface simplification depending on current view, distance to objects, and efficient caching of the aggregated representation of object meshes. We investigate how these algorithms can be re-used in the context of interactive hydrodynamic modeling without significant changes to the model code and allowing model operation on both multi-core CPU personal computers and high-performance computer clusters.

Windows of opportunities and knowledge networks: implications for the catch-up in developing countries

This document represents a doctoral thesis held under the Brazilian School of Public and Business Administration of Getulio Vargas Foundation (EBAPE/FGV), developed through the elaboration of three articles. The research that resulted in the articles is within the scope of the project entitled “Windows of opportunities and knowledge networks: implications for catch-up in developing countries”, funded by Support Programme for Research and Academic Production of Faculty (ProPesquisa) of Brazilian School of Public and Business Administration (EBAPE) of Getulio Vargas Foundation.

Gerenciamento de Entrada e Saída

O material apresenta a estrutura geral de um subsistema de Entrada/Saída, seus princípios do tratamento e complexidade. Destaca assuntos como: Hardware de E/S; Estrutura típica do barramento do PC; Comunicação entre CPU e controladoras; Endereços de algumas portas de I/O do PC; E/S programada – Polling; E/S por Interrupções; e Vetor de eventos do Intel Pentium. O material também trata do Acesso Direto à Memória e a operação de transferência por DMA; os dispositivos de Rede; as operações do subsistema de E/S (Escalonamento, Buferização, Caching, Spooling, Reserva de dispositivo); o tratamento de erros e as operações que podem estar sujeitas a falhas; e por fim, tratamento de requisições de E/S e o ciclo de vida de uma requisição de E/S.

Seed survival and dispersal of an endemic Atlantic forest palm: the combined effects of defaunation and forest fragmentation

About 45 palm species occur in the Atlantic forest of Brazil, and most of them are affected by loss of seed dispersers resulting from forest fragmentation and hunting. Here we report the effects of habitat loss and defaunation on the seed dispersal system of an endemic palm, Astrocaryum aculeatissimum. We evaluated seed removal, insect and rodent seed predation, and scatter-hoarding in nine sites, ranging from 19 ha to 79 000 ha. We report the seedling, juvenile and adult palm densities in this range of sites. Endocarps remaining beneath the parent palm had a higher probability of being preyed upon by insects in small, mostly fragmented and more defaunated sites. The frequency of successful seed removal, scatter-hoarding and consumption by rodents increased in the larger, less defaunated sites. Successful removal and dispersal collapsed in small (< 1000 ha), highly defaunated sites and frequently resulted in low densities of both seedlings and juveniles. Our results indicate that a large fraction of Atlantic forest palms that rely on scatter-hoarding rodents may become regionally extinct due to forest fragmentation and defaunation. Current management practices including palm extraction and hunting pressure have a lasting effect on Atlantic forest palm regeneration by severely limiting successful recruitment of prereproductive individuals.(c) 2006 the Linnean Society of London.

Testing the quick meal hypothesis: the effect of pulp on hoarding and seed predation of Hymenaea courbaril by red-rumped agoutis (Dasyprocta leporina)

Red-rumped agoutis (Dasyprocta leporina) are important seed dispersers/predators of Neotropical large-seeded plants. Several species of seeds cached by agoutis have an edible reward, in contrast to temperate rodent-dispersed diaspores. The quick meal hypothesis states that the presence of a reward such as edible pulp will enhance the efficiency of rodents as seed disperses by satiating the animal and, consequently, reducing seed predation and enhancing hoarding. In this study, this hypothesis was tested using as the reference system the pulp and seeds of Hymenaea courbaril. Seeds with and without pulp were offered to agoutis and the behaviour of each individual was recorded. Since the probability of predation and hoarding were complementary, we used the probability of predation. The proportion of agoutis that preyed on at least one seed was similar for seeds with (42.8% of individuals) and without (40.0% of individuals) pulp. In agoutis that preyed upon at least one seed, the probability that they killed a seed did not differ between seeds with (0.17 +/- 0.03) and without (0.20 +/- 0.08) pulp. Hence, these results do not support the 'quick meal hypothesis'.

The effect of trail length on task partitioning in three Acromyrmex species (Hymenoptera: Formicidae)

By comparing the behavior of three Acromyrmex (Hymenoptera, Formicidae) species during foraging on artificial trails of different lengths, we observed the occurrence of task partitioning and its relation to the food distance from the nest. Task partitioning was verified by leaf cache formation along the trail and leaf direct transferring among workers. There was significant difference between the number of leaf fragments carried directly to the fungus chamber and those transferred direct or indirectly, via cache, depending upon the trail length. Task partitioning could be a strategy used by leaf-cutting ants that allows the workers to use food sources far from their nests.

O clima do oeste do Paraná: análises da presença do lago de Itaipu

Pós-graduação em Geografia - IGCE

An architecture for scaling ontology networks

Constructing ontology networks typically occurs at design time at the hands of knowledge engineers who assemble their components statically. There are, however, use cases where ontology networks need to be assembled upon request and processed at runtime, without altering the stored ontologies and without tampering with one another. These are what we call "virtual [ontology] networks", and keeping track of how an ontology changes in each virtual network is called "multiplexing". Issues may arise from the connectivity of ontology networks. In many cases, simple flat import schemes will not work, because many ontology managers can cause property assertions to be erroneously interpreted as annotations and ignored by reasoners. Also, multiple virtual networks should optimize their cumulative memory footprint, and where they cannot, this should occur for very limited periods of time. We claim that these problems should be handled by the software that serves these ontology networks, rather than by ontology engineering methodologies. We propose a method that spreads multiple virtual networks across a 3-tier structure, and can reduce the amount of erroneously interpreted axioms, under certain raw statement distributions across the ontologies. We assumed OWL as the core language handled by semantic applications in the framework at hand, due to the greater availability of reasoners and rule engines. We also verified that, in common OWL ontology management software, OWL axiom interpretation occurs in the worst case scenario of pre-order visit. To measure the effectiveness and space-efficiency of our solution, a Java and RESTful implementation was produced within an Apache project. We verified that a 3-tier structure can accommodate reasonably complex ontology networks better, in terms of the expressivity OWL axiom interpretation, than flat-tree import schemes can. We measured both the memory overhead of the additional components we put on top of traditional ontology networks, and the framework's caching capabilities.