Aspects of the biology of the lagoon crab Callinectes amnicola (Derocheburne) in Badagry, Lagos and Lekki lagoons, Nigeria

A preliminary report of the size, composition, growth pattern and food habits of the blue crab, Callinectes amnicola, (De Rocheburne) in the Badagry, Lagos and Lekki Lagoons (Nigeria) is presented. The collection of crabs from the three lagoons covered the period from May 1999 to October 2000. The carapace length for Badagry Lagoon ranged from 2.2 cm to 16.4 cm with weight of 4.4 g to 252.6 g. The crabs showed a unimodal size distribution. For the Lagos Lagoon, crabs sizes ranged from 3.5 cm to 16.8 cm and weighed 3.28 to 277.1 g. The sizes of crabs in the Lekki Lagoon ranged from 3.5 cm to 16.1 cm and weighed 3.5 g to 262.7 g. Crabs from the three lagoons exhibited negative allometric growth. The food items were similar in the three lagoons and comprised mainly mollusc shells, fish parts, shrimps and crab appendages and occasionally higher plant material

An early warning system for multivariate time series with sparse and non-uniform sampling

In this paper we propose a new early warning test statistic, the ratio of deviations (RoD), which is defined to be the root mean squared of successive differences divided by the standard deviation. We show that RoD and autocorrelation are asymptotically related, and this relationship motivates the use of RoD to predict Hopf bifurcations in multivariate systems before they occur. We validate the use of RoD on synthetic data in the novel situation where the data is sparse and non-uniformly sampled. Additionally, we adapt the method to be used on high-frequency time series by sampling, and demonstrate the proficiency of RoD as a classifier.Comment: 14 pages, 8 figure

Heisenberg modules as function spaces

Let $\Delta$ be a closed, cocompact subgroup of $G \times \widehat{G}$, where $G$ is a second countable, locally compact abelian group. Using localization of Hilbert $C^*$-modules, we show that the Heisenberg module $\mathcal{E}_{\Delta}(G)$ over the twisted group $C^*$-algebra $C^*(\Delta,c)$ due to Rieffel can be continuously and densely embedded into the Hilbert space $L^2(G)$. This allows us to characterize a finite set of generators for $\mathcal{E}_{\Delta}(G)$ as exactly the generators of multi-window (continuous) Gabor frames over $\Delta$, a result which was previously known only for a dense subspace of $\mathcal{E}_{\Delta}(G)$. We show that $\mathcal{E}_{\Delta}(G)$ as a function space satisfies two properties that make it eligible for time-frequency analysis: Its elements satisfy the fundamental identity of Gabor analysis if $\Delta$ is a lattice, and their associated frame operators corresponding to $\Delta$ are bounded.Comment: 24 pages; several changes have been made to the presentation, while the content remains essentially unchanged; to appear in Journal of Fourier Analysis and Application

Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood (ML) decodable (SSD) distributed space-time block codes (DSTBCs) for two-hop wireless relay networks using the amplify and forward protocol. However, to implement DSTBCs from square TE-CODs, the overhead due to the transmission of training symbols becomes prohibitively large as the number of relays increase. In this paper, we propose TE-Coordinate Interleaved Orthogonal Designs (TE-CIODs) to construct SSD DSTBCs. Exploiting the block diagonal structure of TE-CIODs, we show that, the overhead due to the transmission of training symbols to implement DSTBCs from TE-CIODs is smaller than that for TE-CODs. We also show that DSTBCs from TE-CIODs offer higher rate than those from TE-CODs for identical number of relays while maintaining the SSD and full-diversity properties.Comment: 7 pages, 2 figure

A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks

This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.Comment: This paper is accepted for publication at the IEEE ICC Workshop on Cooperative Communications and Networkin