Program, abstracts and related documents.

The context: Soil biodiversity and sustainable agriculture; Abstracts - Theme 1: Monitoring and assessment: Bioindicators of soil health: assessment and monitoring for sustainable agriculture; Practical tools to measure soil health and their use by farmers; Biological soil quality from biomass to biodiversity - importance and resilience to management stress and disturbance; Integrated management of plant-parasitic nematodes in maize-bean cropping systems; Microbial quantitative and qualitative changes in soils under different crops and tillage management systems in Brazil; Diversity in the rhizobia associated with Phaseolus vulgaris L: in Ecuador and comparisons with Mexican bean rhizobia; Sistemas integrados ganadería-agricultura en Cuba; Soil macrofauna as bioindicator of soil quality; Biological functioning of cerrado soils; Hydrolysis of fluorescein diacetate as a soil quality indicator in different pasture systems; Soil management and soil macrofauna communities at Embrapa Soybean, Londrina, Brazil; Soil macrofauna in a 24 - year old no-tillage system in Paraná, Brazil; Invertebrate macrofauna of soils inpastures under different forms of management in the cerrado (Brazil); Soil tillage modifies the invertebrate soil macrofauna community; Soil macrofauna in various tillage and land use systems on an oxisols near Londrina, Paraná, Brazil; Interference of agricultural systems on soil macrofauna; Scarab beetle-grub holes in various tillage and crop management systems at Embrapa Soybean, Londrina, Brazil; Biological management of agroecosystems; Soil biota and nutrient dynamics through litterfall in agroforestry system in Rondônia, Amazônia, Brazil; Soil-C stocks and earthworm diversity of native and introduced pastures in Veracruz, Mexico; Theme 2 : Adaptive management: Some thoughts on the effects and implications of the transition from weedy multi-crop to wead-free mono-crop systems in Africa; Towards sustainable agriculture with no-tillage and crop rotation systems in South Brazil; Effect of termites on crusted soil rehabilitation in the Sahel; Management of macrofauna in traditional and conventional agroforestry systems from India with special reference to termites and earthworms; Adaptive management for redeveloping traditional agroecosystems; Conservation and sustainable use of soil biodiversity: learning with master nature!; Convergence of sciences: inclusive technology innovation processes for better integrated crop/vegetation, soil and biodiversity management; Potential for increasing soil biodiversity in agroecosystems; Biological nitrogen fixation and sustainability in the tropics; Theme 3: Research and innovation: Plant flavonoids and cluster roots as modifiers of soil biodiversity; The significance of biological diversity in agricultural soil for disease suppressiveness and nutrient retention; Linking above - and belowground biodiversity: a comparison of agricultural systems; Insect-pests in biologically managed oil and crops: the experience at ICRISAT; Sistemas agricolas micorrizados en Cuba; The effect of velvetbean (Mucuna pruriens) on the tropical earthworm Balanteodrilus pearsei: a management option for maize crops in the Mexican humid tropics; The potential of earthworms and organic matter quality in the rehabilitation of tropical soils; Research and innovation in biological management of soil ecosystems; Application of biodynamic methods in the Egyptian cotton sector; Theme 4: Capacity building and mainstreaming: Soil ecology and biodiversity: a quick scan of its importance for government policy in The Netherlands; Agrotechnological transfer of legume inoculants in Eastern and Southern Africa; Agricultura urbana en Cuba; Soil carbon sequestration for sustaining agricultural production and improving the environment; Conservation and sustainable management of below-ground biodiversity: the TSBF-BGBD network project; The tropical soil biology and fertility institute of CIAT (TSBF); South-South initiative for training and capacity building for the management of soil biology/biodiversity; Strategies to facilititate development and adoption of integrated resource management for sustainable production and productivity improvement; The challenge program on biological nitrogen fixation (CPBNF); Living soil training for farmers: improving knowledge and skills in soil nutrition management; Do we need an inter-governmental panel on land and soil (IPLS)? Protection and sustainable use of biodiversity of soils; Cases Studies -- Plant parasitic nematodes associated with common bean (Phaseolus vulgaris L.) and integrated management approaches; Agrotechnological transfer of legume inoculants in Eastern and Southern Africa; Restoring soil fertility and enhancing productivity in Indian tea plantations with earthworms and organic fertilizers; Managing termites and organic resources to improve soil productivity in the Sahel; Overview and case studies on biological nitrogen fixation: perspectives and limitations; Soil biodiversity and sustainable agriculture: an overview.

Epidemiologia da vassoura-de-bruxa (Crinipellis perniciosa) do cupuacuzeiro (Theobroma grandiflorum).

Determinacao dos periodos mais favoraveis a ocorrencia da vassoura-de-bruxa, envolvendo a fenologia do hospedeiro, na esporulacao do fungo e nas condicoes climaticas de Manaus, AM (Brasil).

Invertebrates of ancient heavy metal spoil and smelting tip sites in southern Jordan: Thier distribution and use as bioindicators of metalliferous pollution derived from ancient sources

Pyatt, B. Amos, D. Grattan, J. Pyatt, A. Terrell-Nield, C. Invertebrates of ancient heavy metal spoil and smelting tip sites in southern Jordan: Thier distribution and use as bioindicators of metalliferous pollution derived from ancient sources. Journal of Arid Environments. 2002. 52 pp 53-62

The ecological effects of exotic disease resistance genes introgressed into British gooseberries

Warren, J. and James, P. (2006). The ecological effects of exotic disease resistance genes introgressed into British gooseberries. Oecologia 147(1),69-75. RAE2008

Proteomic analysis of the larval stage of the parasite Echinococcus granulosus: causative agent of cystic hydatid disease

Gustavo Chemale, Arjan J. van Rossum, James R. Jefferies, John Barrett, Peter M. Brophy, Henrique B. Ferreira, Arnaldo Zaha (2003). Proteomic analysis of the larval stage of the parasite Echinococcus granulosus: causative agent of cystic hydatid disease. Proteomics, 3(8), 1633-1636. Sponsorship: CNPq / PADCT/CNPq / FAPERGS (Brazil)/ BBSRC (UK) RAE2008

Biblioteka Uniwersytecka w Poznaniu w Web 2.0 - rozwój przyjaznej komunikacji cyfrowej i wynikające z niej korzyści

Poster pokazuje metody komunikacji z czytelnikiem stosowane w Bibliotece Uniwersyteckiej w Poznaniu w technologii mediów cyfrowych. Cyfrowe narzędzia komunikacji stały się bardzo pomocne, niemal niezbędne w pozyskiwaniu nowych czytelników, podtrzymywaniu i rozwijaniu współpracy w społeczności w sieci Web.2.0, zarówno tej globalnej, jak i lokalnej akademickiej. Strona WWW jako statyczna komunikacyjnie jest wspierana przez fora dyskusyjne, chaty, wideokonferencje, warsztaty informacyjne, które są prowadzone w czasie rzeczywistym. Twórczą siłę relacji społecznych z biblioteką rozwinęły interaktywne serwisy społecznościowe (Facebook) oraz komunikatory internetowe integrowane na platformie Ask a Librarian. Biblioteka stała się Biblioteką 2.0 ukierunkowaną na komunikację z czytelnikiem. Aktywne uczestnictwo i udział czytelników przy tworzeniu zasobów naukowych wdrożyliśmy w projekcie instytucjonalnego repozytorium - Adam Mickiewicz Repository (AMUR). Biblioteka zmienia się dla czytelników i z czytelnikami. Wykorzystywane platformy i serwisy społecznościowe dostarczają unikatowych danych o nowych potrzebach informacyjnych i oczekiwaniach docelowego Patrona 2.0, co skutkuje doskonaleniu usług istniejących i tworzeniu nowych. Biblioteka monitoruje usługi i potrzeby czytelników przez prowadzone badania społeczne. Technologie cyfrowe stosowane w komunikacji sprawiają, iż biblioteka staje się bliższa, bardziej dostępna, aby stać się w rezultacie partnerem dla stałych i nowych czytelników. Biblioteka Uniwersytecka w Poznaniu bierze udział w programach europejskich w zakresie katalogowania i digitalizacji zasobu biblioteki cyfrowej WBC, w zakresie wdrożenia nowych technologii i rozwiązań podnoszących jakość usług bibliotecznych, działalności kulturotwórczej (Poznańska Dyskusyjna Akademia Kominksu, deBiUty) i edukacji informacyjnej. Biblioteka Uniwersytecka w Poznaniu jest członkiem organizacji międzynarodowych: LIBER (Liga Europejskich Bibliotek Naukowych), IAML (Stowarzyszenie Bibliotek Muzycznych, Archiwów i Ośrodków Dokumentacji), CERL - Europejskie Konsorcjum Bibliotek Naukowych.

On the Size Distribution of Autonomous Systems

This paper explores reasons for the high degree of variability in the sizes of ASes that have recently been observed, and the processes by which this variable distribution develops. AS size distribution is important for a number of reasons. First, when modeling network topologies, an AS size distribution assists in labeling routers with an associated AS. Second, AS size has been found to be positively correlated with the degree of the AS (number of peering links), so understanding the distribution of AS sizes has implications for AS connectivity properties. Our model accounts for AS births, growth, and mergers. We analyze two models: one incorporates only the growth of hosts and ASes, and a second extends that model to include mergers of ASes. We show analytically that, given reasonable assumptions about the nature of mergers, the resulting size distribution exhibits a power law tail with the exponent independent of the details of the merging process. We estimate parameters of the models from measurements obtained from Internet registries and from BGP tables. We then compare the models solutions to empirical AS size distribution taken from Mercator and Skitter datasets, and find that the simple growth-based model yields general agreement with empirical data. Our analysis of the model in which mergers occur in a manner independent of the size of the merging ASes suggests that more detailed analysis of merger processes is needed.

A Pragmatic Approach to DHT Adoption

Despite the peer-to-peer community's obvious wish to have its systems adopted, specific mechanisms to facilitate incremental adoption have not yet received the same level of attention as the many other practical concerns associated with these systems. This paper argues that ease of adoption should be elevated to a first-class concern and accordingly presents HOLD, a front-end to existing DHTs that is optimized for incremental adoption. Specifically, HOLD is backwards-compatible: it leverages DNS to provide a key-based routing service to existing Internet hosts without requiring them to install any software. This paper also presents applications that could benefit from HOLD as well as the trade-offs that accompany HOLD. Early implementation experience suggests that HOLD is practical.

Efficient End-Host Architecture for High Performance Communication Using User-level Sandboxing

Current low-level networking abstractions on modern operating systems are commonly implemented in the kernel to provide sufficient performance for general purpose applications. However, it is desirable for high performance applications to have more control over the networking subsystem to support optimizations for their specific needs. One approach is to allow networking services to be implemented at user-level. Unfortunately, this typically incurs costs due to scheduling overheads and unnecessary data copying via the kernel. In this paper, we describe a method to implement efficient application-specific network service extensions at user-level, that removes the cost of scheduling and provides protected access to lower-level system abstractions. We present a networking implementation that, with minor modifications to the Linux kernel, passes data between "sandboxed" extensions and the Ethernet device without copying or processing in the kernel. Using this mechanism, we put a customizable networking stack into a user-level sandbox and show how it can be used to efficiently process and forward data via proxies, or intermediate hosts, in the communication path of high performance data streams. Unlike other user-level networking implementations, our method makes no special hardware requirements to avoid unnecessary data copies. Results show that we achieve a substantial increase in throughput over comparable user-space methods using our networking stack implementation.

Application-Level Document Caching in the Internet

With the increasing demand for document transfer services such as the World Wide Web comes a need for better resource management to reduce the latency of documents in these systems. To address this need, we analyze the potential for document caching at the application level in document transfer services. We have collected traces of actual executions of Mosaic, reflecting over half a million user requests for WWW documents. Using those traces, we study the tradeoffs between caching at three levels in the system, and the potential for use of application-level information in the caching system. Our traces show that while a high hit rate in terms of URLs is achievable, a much lower hit rate is possible in terms of bytes, because most profitably-cached documents are small. We consider the performance of caching when applied at the level of individual user sessions, at the level of individual hosts, and at the level of a collection of hosts on a single LAN. We show that the performance gain achievable by caching at the session level (which is straightforward to implement) is nearly all of that achievable at the LAN level (where caching is more difficult to implement). However, when resource requirements are considered, LAN level caching becomes much more desirable, since it can achieve a given level of caching performance using a much smaller amount of cache space. Finally, we consider the use of organizational boundary information as an example of the potential for use of application-level information in caching. Our results suggest that distinguishing between documents produced locally and those produced remotely can provide useful leverage in designing caching policies, because of differences in the potential for sharing these two document types among multiple users.

Dynamic Server Selection in the Internet

As distributed information services like the World Wide Web become increasingly popular on the Internet, problems of scale are clearly evident. A promising technique that addresses many of these problems is service (or document) replication. However, when a service is replicated, clients then need the additional ability to find a "good" provider of that service. In this paper we report on techniques for finding good service providers without a priori knowledge of server location or network topology. We consider the use of two principal metrics for measuring distance in the Internet: hops, and round-trip latency. We show that these two metrics yield very different results in practice. Surprisingly, we show data indicating that the number of hops between two hosts in the Internet is not strongly correlated to round-trip latency. Thus, the distance in hops between two hosts is not necessarily a good predictor of the expected latency of a document transfer. Instead of using known or measured distances in hops, we show that the extra cost at runtime incurred by dynamic latency measurement is well justified based on the resulting improved performance. In addition we show that selection based on dynamic latency measurement performs much better in practice that any static selection scheme. Finally, the difference between the distribution of hops and latencies is fundamental enough to suggest differences in algorithms for server replication. We show that conclusions drawn about service replication based on the distribution of hops need to be revised when the distribution of latencies is considered instead.

To Queue or Not to Queue: When Queueing is Better Than Timesharing in a Distributed System

We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the processor-sharing (PS) discipline at the hosts in a distributed server system. We are interested in the case in which service times are drawn from a heavy-tailed distribution, and so have very high variability. Traditional wisdom when task sizes are highly variable would prefer the PS discipline, because it allows small tasks to avoid being delayed behind large tasks in a queue. However, we show that system performance can actually be significantly better under FCFS queueing, if each task is assigned to a host based on the task's size. By task assignment, we mean an algorithm that inspects incoming tasks and assigns them to hosts for service. The particular task assignment policy we propose is called SITA-E: Size Interval Task Assignment with Equal Load. Surprisingly, under SITA-E, FCFS queueing typically outperforms the PS discipline by a factor of about two, as measured by mean waiting time and mean slowdown (waiting time of task divided by its service time). We compare the FCFS/SITA-E policy to the processor-sharing case analytically; in addition we compare it to a number of other policies in simulation. We show that the benefits of SITA-E are present even in small-scale distributed systems (four or more hosts). Furthermore, SITA-E is a static policy that does not incorporate feedback knowledge of the state of the hosts, which allows for a simple and scalable implementation.

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

Informed Content Delivery Across Adaptive Overlay Networks

Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large, multipoint transfers across richly connected overlay networks, focusing on the question of what to put in each transmitted packet. We first make the case for transmitting encoded content in this scenario, arguing for the digital fountain approach which enables end-hosts to efficiently restitute the original content of size n from a subset of any n symbols from a large universe of encoded symbols. Such an approach affords reliability and a substantial degree of application-level flexibility, as it seamlessly tolerates packet loss, connection migration, and parallel transfers. However, since the sets of symbols acquired by peers are likely to overlap substantially, care must be taken to enable them to collaborate effectively. We provide a collection of useful algorithmic tools for efficient estimation, summarization, and approximate reconciliation of sets of symbols between pairs of collaborating peers, all of which keep messaging complexity and computation to a minimum. Through simulations and experiments on a prototype implementation, we demonstrate the performance benefits of our informed content delivery mechanisms and how they complement existing overlay network architectures.

On the Cost of Supporting Multihoming and Mobility

As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of multihoming—as a node moves, it unsubscribes from one network and subscribes to another, which is akin to one interface becoming inactive and another active. The current Internet architecture has been facing significant challenges in effectively dealing with multihoming (and consequently mobility). The Recursive INternet Architecture (RINA) [1] was recently proposed as a clean-slate solution to the current problems of the Internet. In this paper, we perform an average-case cost analysis to compare the multihoming / mobility support of RINA, against that of other approaches such as LISP and MobileIP. We also validate our analysis using trace-driven simulation.