The relative growth of the fiddler crab Uca sindensis in Pohl Port was studied. Ten 0.5 m2 quadrates were randomly sampled monthly during low tide periods from October 2009 to September 2010. A total of 840 crabs, 449 (53.45%) males and 391(46.5%) ‌ females, were sampled. The Carapace width of males ranged from 5.5 to13.5 mm (mean ± SD) (8.92 ± 2.04), and of females from 5.0 to 11.5 mm (mean ± ...

BACKGROUND Harmane (1-methyl-9H-pyrido[3,4-b]indole), a neurotoxin, may be an environmental risk factor for essential tremor (ET). Harmane and related chemicals are toxic to the cerebellum. Whether it is through this mechanism (cerebellar toxicity) that harmane leads to ET is unknown. Impaired olfaction may be a feature of cerebellar disease. OBJECTIVE To determine whether blood harmane conce...

Let D ={d1, d2, ...dD} be a given set of D string documents of total length n, our task is to index D, such that the k most relevant documents for an online query pattern P of length p can be retrieved efficiently. We propose an index of size |CSA|+ n logD(2 + o(1)) bits and O(ts(p)+k log log n+poly log log n) query time for the basic relevance metric term-frequency, where |CSA| is the size (in...

Fast parallel algorithms are given for the longest common subsequence problem and the string editing problem with bounded weights. In the COMMON PRAM model, the algorithm for the longest common subse-quence problem takes time O(log m), where m is the length of the shorter string, while the algorithm for the string editing problem with bounded weights takes time O(max(log m; log n= log log n)), ...

Triple-base number systems are mainly used in elliptic curve cryptography to speed up scalar multiplication. We give an upper bound on the length of the canonical triple-base representation with base {2, 3, 5} of an integer x, which is O( log x log log x ) by the greedy algorithm, and show that there are infinitely many integers x whose shortest triple-base representations with base {2, 3, 5} h...

We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] proved that for any such distance labelling scheme, the maximum label length is at least 1 8 log n−O(log n) bits. They also gave a separatorbased labelling scheme that has the optimal label length Θ(log n · log(Hn(T ))), w...

We study in this paper the scaling and statistical properties of the ac conductivity of thin metal-dielectric films in different regions of the loss in metallic components and particularly in the limit of vanishing loss. We model the system by a 2D RL − C network and calculate the effective conductivity by using a real space renormalization group method. It is found that the real conductivity s...

Mobile phone log data (e.g., phone call log) is not static as it is progressively added to day-by-day according to individual’s diverse behaviors with mobile phones. Since human behavior changes over time, the most recent pattern is more interesting and significant than older ones for predicting individual’s behavior. The goal of this poster paper is to identify the recent behavioral data lengt...