PDA, Ebooks, Print Books Usage and Expenditures: Knowledge Ecosystem Remix

This article presents data-rich findings of a comprehensive follow-up study on the patron-driven/demand-driven ebook acquisitions (DDA) plan chronicled in two prior articles from the DDA ebook plan's October 2011 inception. Into the third fiscal year, print vs. ebook usage preferences have begun to emerge, and the results broken out by discipline are presented.

Strategic alliances between companies and non-governmental organizations pursuing the creation of shared value: an exploratory study at the base of the pyramid in Brazil

Na última década, uma crescente atenção tem sido dedicada ao desenvolvimento de estratégias que permitem uma empresa de atender os mercados de baixa renda de uma forma rentável e ao mesmo tempo enfrentar os desafios sociais. Uma das ferramentas estratégicas identificados para operar com sucesso na base da pirâmide ( BoP ), consiste no estabelecimento de alianças com organizações não governamentais (ONGs). Isso, no entanto, é um desafio, especialmente porque os atores do setor empresarial e da sociedade civil são movidos por um propósito diferente e adotam uma abordagem diferente na condução das suas atividades. O objetivo desta pesquisa é, portanto, investigar precisamente como ONGs e empresas podem alavancar os seus respectivos recursos e capacidades para criar valor econômico e social , servindo este segmento. Um estudo de casos múltiplos, com foco na base da pirâmide brasileira é utilizado, a fim de entender as dificuldades e fatores de sucesso para a criação e gestão de tais alianças e identificar os recursos e capacidades que são mobilizados por cada parceiro. Os resultados sugerem que as principais dificuldades estão em encontrar um parceiro adequado; superar percepções estereotipadas negativos e falta de confiança e, finalmente, na diferente estrutura, cultura e processos. Por sua vez, os fatores mais importantes que levam ao sucesso incluem a escolha do parceiro certo; compatibilidade em termos de missão, estratégia e valores; estabelecimento de confiança e comprometimento; comunicação eficaz e, finalmente, a capacidade da aliança de gerar valor para ambos os parceiros. Além disso, os resultados demostram que o papel das ONGs é na maior parte limitado a agir como uma ponte entre a empresa e as comunidades de baixa renda, enquanto as capacidades operacionais e os recursos financeiros são fornecidos pelas empresas.

GeOntoQuery - um mecanismo de busca em bancos de dados geográficos baseado em ontologias

Geographic Information System (GIS) are computational tools used to capture, store, consult, manipulate, analyze and print geo-referenced data. A GIS is a multi-disciplinary system that can be used by different communities of users, each one having their own interest and knowledge. This way, different knowledge views about the same reality need to be combined, in such way to attend each community. This work presents a mechanism that allows different community users access the same geographic database without knowing its particular internal structure. We use geographic ontologies to support a common and shared understanding of a specific domain: the coral reefs. Using these ontologies' descriptions that represent the knowledge of the different communities, mechanisms are created to handle with such different concepts. We use equivalent classes mapping, and a semantic layer that interacts with the ontologies and the geographic database, and that gives to the user the answers about his/her queries, independently of the used terms

The shared influence of phylogeny and ecology on the reproductive patterns of Myrteae (Myrtaceae)

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Public policies for the information society: a shared vision?

Includes bibliography

Small- and medium-sized enterprises' restructuring in a context of transition: a shared process: inter-player effects on efficient boundary choice in the Argentine manufacturing sector

Includes bibliography

Host-specificity and morphometrics of female Haemonchus contortus, H. placei and H. similis (Nematoda: Trichostrongylidae) in cattle and sheep from shared pastures in Sao Paulo State, Brazil

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Shared Escovopsis parasites between leaf-cutting and non-leaf-cutting ants in the higher attine fungus-growing ant symbiosis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Shared Feed as a Means of Deer-to-Deer Transmission of Mycobacterium bovis

To determine the ability of experimentally inoculated white-tailed deer (Odocoileus virginianus) to transmit Mycobacterium bovis to naive deer through the sharing of feed, four deer were intratonsillarly inoculated with 4x105 colony-forming units of M. bovis. On a daily basis, feed not consumed by inoculated deer after approximately 8 hr was offered to four naıve deer maintained in a separate pen, where direct contact, aerosol transmission, or transmission through personnel were prevented. After 150 days, naıve deer were euthanized and examined. All naıve deer had lesions consistent with tuberculosis and M. bovis was isolated from various tissues. The most commonly affected tissues were lung, tracheobronchial lymph nodes, and mediastinal lymph nodes. This study demonstrates the potential for indirect transmission of M. bovis through the sharing of feed. Intentional or unintentional feeding of deer by wildlife or agricultural interests in regions where M. bovis infection is endemic should be avoided because both direct and indirect transmission through sharing of feed are enhanced.

Survivable Lightpath Provisioning in WDM Mesh Networks Under Shared Path Protection and Signal Quality Constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.

A Load-Balancing Shared-Protection-Path Reconfiguration Approach in WDM Wavelength-Routed Networks

Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In shared-path protection, several protection paths can share a wavelength on a fiber link if their working paths are risk-independent. In real-world networks, provisioning is usually implemented without the knowledge of future network resource utilization status. As the network changes with the addition and deletion of connections, the network utilization will become sub-optimal. Reconfiguration, which is referred to as the method of re-provisioning the existing connections, is an attractive solution to fill in the gap between the current network utilization and its optimal value [2]. In this paper, we propose a new shared-protection-path reconfiguration approach. Unlike some of previous reconfiguration approaches that alter the working paths, our approach only changes protection paths, and hence does not interfere with the ongoing services on the working paths, and is therefore risk-free. Previous studies have verified the benefits arising from the reconfiguration of existing connections [2] [3] [4]. Most of them are aimed at minimizing the total used wavelength-links or ports. However, this objective does not directly relate to cost saving because minimizing the total network resource consumption does not necessarily maximize the capability of accommodating future connections. As a result, service providers may still need to pay for early network upgrades. Alternatively, our proposed shared-protection-path reconfiguration approach is based on a load-balancing objective, which minimizes the network load distribution vector (LDV, see Section 2). This new objective is designed to postpone network upgrades, thus bringing extra cost savings to service providers. In other words, by using the new objective, service providers can establish as many connections as possible before network upgrades, resulting in increased revenue. We develop a heuristic load-balancing (LB) reconfiguration approach based on this new objective and compare its performance with an approach previously introduced in [2] and [4], whose objective is minimizing the total network resource consumption.

A Heuristic with Bounded Guarantee to Compute Diverse Paths under Shared Protection in WDM Mesh Networks

Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.

Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we computed the survivable virtual topology routing against link and SRLG failures for small and medium sized networks efficiently. As even our improved ILP formulation becomes intractable for large networks, we present a congestion-based heuristic and a tabu search heuristic (which uses the congestion-based heuristic solution as the initial solution) for computing survivable routing of a virtual topology. Our experimental results show that tabu search heuristic coupled with the congestion based heuristic (used as initial solution) provides fast and near-optimal solutions.

Evidence that a single bioluminescent system is shared by all known bioluminescent fungal lineages

Since the early 20th century, many researchers have attempted to determine how fungi are able to emit light. The first successful experiment was obtained using the classical luciferin-luciferase test that consists of mixing under controlled conditions hot (substrate/luciferin) and cold (enzyme/luciferase) water extracts prepared from bioluminescent fungi. Failures by other researchers to reproduce those experiments using different species of fungi lead to the hypothesis of a non-enzymatic luminescent pathway. Only recently, the involvement of a luciferase in this system was proven, thus confirming its enzymatic nature. Of the 100 000 described species in Kingdom Fungi, only 71 species are known to be luminescent and they are distributed unevenly amongst four distantly related lineages. The question we address is whether the mechanism of bioluminescence is the same in all four evolutionary lineages suggesting a single origin of luminescence in the Fungi, or whether each lineage has a unique mechanism for light emission implying independent origins. We prepared hot and cold extracts of numerous species representing the four bioluminescent fungal lineages and performed cross-reactions (luciferin x luciferase) in all possible combinations using closely related non-luminescent species as controls. All cross-reactions with extracts from luminescent species yielded positive results, independent of lineage, whereas no light was emitted in cross-reactions with extracts from non-luminescent species. These results support the hypothesis that all four lineages of luminescent fungi share the same type of luciferin and luciferase, that there is a single luminescent mechanism in the Fungi, and that fungal luciferin is not a ubiquitous molecule in fungal metabolism.