Diagnosis and the management constituency of small-scale fisheries

Diagnosis and adaptive management can help improve the ability of small-scale fisheries (SSF) in the developing world to better cope with and adapt to both external drivers and internal sources of uncertainty. This paper presents a framework for diagnosis and adaptive management and discusses ways of implementing the first two phases of learning: diagnosis and mobilising an appropriate management constituency. The discussion addresses key issues and suggests suitable approaches and tools as well as numerous sources of further information. Diagnosis of a SSF defines the system to be managed, outlines the scope of the management problem in terms of threats and opportunities, and aims to construct realistic and desired future projections for the fishery. These steps can clarify objectives and lead to development of indicators necessary for adaptive management. Before management, however, it is important to mobilize a management constituency to enact change. Ways of identifying stakeholders and understanding both enabling and obstructive interactions and management structures are outlined. These preliminary learning phases for adaptive SSF management are expected to work best if legitimised by collaborative discussion among fishery stakeholders drawing on multiple knowledge systems and participatory approaches to assessment. (PDF contains 33 pages

SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks

Some mobile sensor network applications require the sensor nodes to transfer their trajectories to a data sink. This paper proposes an adaptive trajectory (lossy) compression algorithm based on compressive sensing. The algorithm has two innovative elements. First, we propose a method to compute a deterministic projection matrix from a learnt dictionary. Second, we propose a method for the mobile nodes to adaptively predict the number of projections needed based on the speed of the mobile nodes. Extensive evaluation of the proposed algorithm using 6 datasets shows that our proposed algorithm can achieve sub-metre accuracy. In addition, our method of computing projection matrices outperforms two existing methods. Finally, comparison of our algorithm against a state-of-the-art trajectory compression algorithm show that our algorithm can reduce the error by 10-60 cm for the same compression ratio

Climate change, agriculture and Fairtrade: identifying the challenges and opportunities

This paper presents the findings of a study commissioned by the UK's Fairtrade Foundation on the implications of climate change for agricultural producers in Fairtrade value chains

Beta Oscillations and Hippocampal Place Cell Learning during Exploration of Novel Environments

Berke et al. (2008) reported that beta oscillations occur during the learning of hippocampal place cell receptive fields in novel environments. Place cell selectivity can develop within seconds to minutes, and can remain stable for months. Paradoxically, beta power was very low during the first lap of exploration, grew to full strength as a mouse traversed a lap for the second and third times, and became and remained low again after the first two minutes of exploration. Beta oscillation power also correlated with the rate at which place cells became spatially selective, and not with theta oscillations. We explain such beta oscillations as a consequence of how place cell receptive fields may be learned as spatially selective categories due to feedback interactions between entorhinal cortex and hippocampus. Top-down attentive feedback helps to ensure rapid learning and stable memory of place cells. Beta oscillations are generated when top-down feedback mismatches bottom-up data as place cell receptive fields are refined. Beta oscillations do not occur on the first trial because adaptive weights in feedback pathways are all sufficiently large then to match any input pattern. On subsequent trials, adaptive weights become pruned as they learn to match the sharpening receptive fields of the place cell categories, thereby causing mismatches until place cell receptive fields stabilize.National Science Foundation (SBE-0354378

A Sparsity-Aware Adaptive Algorithm for Distributed Learning

In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this paper, the property sets take the form of hyperslabs. The goal is to find a point that belongs to the intersection of these hyperslabs. To this end, sparsity encouraging variable metric projections onto the hyperslabs have been adopted. Moreover, sparsity is also imposed by employing variable metric projections onto weighted $\ell_1$ balls. A combine adapt cooperation strategy is adopted. Under some mild assumptions, the scheme enjoys monotonicity, asymptotic optimality and strong convergence to a point that lies in the consensus subspace. Finally, numerical examples verify the validity of the proposed scheme, compared to other algorithms, which have been developed in the context of sparse adaptive learning