Modeling harvest rates and numbers from age and sex ratios: A demonstration for elephant populations

Illegal harvest rates of wildlife populations are often unknown or difficult to estimate from field data due to under-reporting or incomplete detection of carcasses. This is especially true for elephants that are killed for ivory or in conflicts with people. We describe a method to infer harvest rates from coarse field data of three population parameters, namely, adult female to male ratio, male old-adult to young-adult ratio, and proportion of adult males in the population using Jensen's (2000) 2-sex, density-dependent Leslie matrix model. The specific combination of male and female harvest rates and numbers can be determined from the history of harvest and estimate of population size. We applied this technique to two populations of elephants for which data on age structure and records of mortality were available-a forest-dwelling population of the Asian elephant (at Nagarahole, India) and an African savannah elephant population (at Samburu, Kenya) that had experienced male-biased harvest regimes over 2-3 decades. For the Nagarahole population, the recorded numbers of male and female elephants killed illegally during 1981-2000 were 64% and 88% of the values predicted by the model, respectively, implying some non-detection or incomplete reporting while for the Samburu population the recorded and modeled numbers of harvest during 1990-1999 closely matched. This technique, applicable to any animal population following logistic growth model, can be especially useful for inferring illegal harvest numbers of forest elephants in Africa and Asia.

MODELING AND SIMULATION OF HYDRODYNAMIC INTERACTION OF DNA IN A MICRO-FLUIDIC CHANNEL

The motion of DNA (in the bulk solution) and the non-Newtonian effective fluid behavior are considered separately and self-consistently with the fluid motion satisfying the no-slip boundary condition on the surface of the confining geometry in the presence of channel pressure gradients. A different approach has been developed to model DNA in the micro-channel. In this study the DNA is assumed as an elastic chain with its characteristic Young's modulus, Poisson's ratio and density. The force which results from the fluid dynamic pressure, viscous forces and electromotive forces is applied to the elastic chain in a coupled manner. The velocity fields in the micro-channel are influenced by the transport properties. Simulations are carried out for the DNAs attached to the micro-fluidic wall. Numerical solutions based on a coupled multiphysics finite element scheme are presented. The modeling scheme is derived based on mass conservation including biomolecular mass, momentum balance including stress due to Coulomb force field and DNA-fluid interaction, and charge transport associated to DNA and other ionic complexes in the fluid. Variation in the velocity field for the non-Newtonian flow and the deformation of the DNA strand which results from the fluid-structure interaction are first studied considering a single DNA strand. Motion of the effective center of mass is analyzed considering various straight and coil geometries. Effects of DNA statistical parameters (geometry and spatial distribution of DNAs along the channel) on the effective flow behavior are analyzed. In particular, the dynamics of different DNA physical properties such as radius of gyration, end-to-end length etc. which are obtained from various different models (Kratky-Porod, Gaussian bead-spring etc.) are correlated to the nature of interaction and physical properties under the same background fluid environment.

Partial delamination modeling in composite beams using a finite element method

A new method of modeling partial delamination in composite beams is proposed and implemented using the finite element method. Homogenized cross-sectional stiffness of the delaminated beam is obtained by the proposed analytical technique, including extension-bending, extension-twist and torsion-bending coupling terms, and hence can be used with an existing finite element method. A two noded C1 type Timoshenko beam element with 4 degrees of freedom per node for dynamic analysis of beams is implemented. The results for different delamination scenarios and beams subjected to different boundary conditions are validated with available experimental results in the literature and/or with the 3D finite element simulation using COMSOL. Results of the first torsional mode frequency for the partially delaminated beam are validated with the COMSOL results. The key point of the proposed model is that partial delamination in beams can be analyzed using a beam model, rather than using 3D or plate models. (c) 2013 Elsevier B.V. All rights reserved.

Rack Level Modeling of Air Flow Through Perforated Tile in a Data Center

Effective air flow distribution through perforated tiles is required to efficiently cool servers in a raised floor data center. We present detailed computational fluid dynamics (CFD) modeling of air flow through a perforated tile and its entrance to the adjacent server rack. The realistic geometrical details of the perforated tile, as well as of the rack are included in the model. Generally, models for air flow through perforated tiles specify a step pressure loss across the tile surface, or porous jump model based on the tile porosity. An improvement to this includes a momentum source specification above the tile to simulate the acceleration of the air flow through the pores, or body force model. In both of these models, geometrical details of tile such as pore locations and shapes are not included. More details increase the grid size as well as the computational time. However, the grid refinement can be controlled to achieve balance between the accuracy and computational time. We compared the results from CFD using geometrical resolution with the porous jump and body force model solution as well as with the measured flow field using particle image velocimetry (PIV) experiments. We observe that including tile geometrical details gives better results as compared to elimination of tile geometrical details and specifying physical models across and above the tile surface. A modification to the body force model is also suggested and improved results were achieved.

Modeling and analysis of MOS capacitor controlled by independent double gates

This paper, for the first time, explores the charcatersictics of MOS capacitor controlled by independent double gates by numerical simulation and analytical modeling for its possible use in RF circuit design as a varactor. By numerical simulation it is shown how the quasi-static and non-quasi-static characteristics of the first gate capacitance could be tuned by the second gate biases. Effect of body doping and energy quantization are also discussed in this regard. A semi-empirical quasi-static model is also developed by using the existing incomplete Poisson solution of independent double gate transistors. Proposed model, which is valid from accumulation to inversion, is shown to have excellent agreement with numerical simulation for practical bias conditions.

Multi-port network modeling of stub loaded Microstrip ring antenna for dual-band operations

A square ring microstrip antenna can be modified for dual-band operations by appropriately attaching an open ended stub. The input impedance of this antenna is analyzed here using multi-port network modeling (MNM) approach. The coupled feed is included by defining additional terms in the model. A prototype antenna is fabricated and tested to validate these computations.

Structural Insights into Saccharomyces cerevisiae Msh4-Msh5 Complex Function Using Homology Modeling

The Msh4-Msh5 protein complex in eukaryotes is involved in stabilizing Holliday junctions and its progenitors to facilitate crossing over during Meiosis I. These functions of the Msh4-Msh5 complex are essential for proper chromosomal segregation during the first meiotic division. The Msh4/5 proteins are homologous to the bacterial mismatch repair protein MutS and other MutS homologs (Msh2, Msh3, Msh6). Saccharomyces cerevisiae msh4/5 point mutants were identified recently that show two fold reduction in crossing over, compared to wild-type without affecting chromosome segregation. Three distinct classes of msh4/5 point mutations could be sorted based on their meiotic phenotypes. These include msh4/5 mutations that have a) crossover and viability defects similar to msh4/5 null mutants; b) intermediate defects in crossing over and viability and c) defects only in crossing over. The absence of a crystal structure for the Msh4-Msh5 complex has hindered an understanding of the structural aspects of Msh4-Msh5 function as well as molecular explanation for the meiotic defects observed in msh4/5 mutations. To address this problem, we generated a structural model of the S. cerevisiae Msh4-Msh5 complex using homology modeling. Further, structural analysis tailored with evolutionary information is used to predict sites with potentially critical roles in Msh4-Msh5 complex formation, DNA binding and to explain asymmetry within the Msh4-Msh5 complex. We also provide a structural rationale for the meiotic defects observed in the msh4/5 point mutations. The mutations are likely to affect stability of the Msh4/5 proteins and/or interactions with DNA. The Msh4-Msh5 model will facilitate the design and interpretation of new mutational data as well as structural studies of this important complex involved in meiotic chromosome segregation.

Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the decoding complexity of a sphere decoder using a depth first search approach. Simulation results of the decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.

Computationally Efficient and Accurate Modeling of Li-ion Battery

A computationally efficient Li-ion battery model has been proposed in this paper. The battery model utilizes the features of both analytical and electrical circuit modeling techniques. The model is simple as it does not involve a look-up table technique and fast as it does not include a polynomial function during computation. The internal voltage of the battery is modeled as a linear function of the state-of-charge of the battery. The internal resistance is experimentally determined and the optimal value of resistance is considered for modeling. Experimental and simulated data are compared to validate the accuracy of the model.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Delineating Ecological Boundaries of Hanuman Langur Species Complex in Peninsular India Using MaxEnt Modeling Approach

Hanuman langur is one of the widely distributed and extensively studied non-human diurnal primates in India. Until recently it was believed to be a single species - Semnopithecus entellus. Recent molecular and morphological studies suggest that the Hanuman langurs consists of at least three species S. entellus, S. hypoleucos and S. priam. Furthermore, morphological studies suggested that both S. hypoleucos and S. priam have at least three subspecies in each. We explored the use of ecological niche modeling (ENM) to confirm the validity of these seven taxa and an additional taxon S. johnii belonging to the same genus. MaxEnt modeling tool was used with 19 bioclimatic, 12 vegetation and 6 hydrological environmental layers. We reduced total environmental variables to 14 layers after testing for collinearity and an independent test for model prediction was done using ENMTools. A total of 196 non-overlapping data points from primary and secondary sources were used as inputs for ENM. Results showed eight distinct ecological boundaries, corroborating the eight taxa mentioned above thereby confirming validity of these eight taxa. The study, for the first time provided ecological variables that determined the ecological requirements and distribution of members of the Hanuman langur species complex in the Indian peninsula.

Low-complexity near-optimal signal detection in underdetermined large-MIMO systems

In this paper, we consider signal detection in nt × nr underdetermined MIMO (UD-MIMO) systems, where i) nt >; nr with a overload factor α = nt over nr >; 1, ii) nt symbols are transmitted per channel use through spatial multiplexing, and iii) nt, nr are large (in the range of tens). A low-complexity detection algorithm based on reactive tabu search is considered. A variable threshold based stopping criterion is proposed which offers near-optimal performance in large UD-MIMO systems at low complexities. A lower bound on the maximum likelihood (ML) bit error performance of large UD-MIMO systems is also obtained for comparison. The proposed algorithm is shown to achieve BER performance close to the ML lower bound within 0.6 dB at an uncoded BER of 10-2 in 16 × 8 V-BLAST UD-MIMO system with 4-QAM (32 bps/Hz). Similar near-ML performance results are shown for 32 × 16, 32 × 24 V-BLAST UD-MIMO with 4-QAM/16-QAM as well. A performance and complexity comparison between the proposed algorithm and the λ-generalized sphere decoder (λ-GSD) algorithm for UD-MIMO shows that the proposed algorithm achieves almost the same performance of λ-GSD but at a significantly lesser complexity.

Low complexity joint estimation of synchronization impairments in sparse channel for MIMO-OFDM system

Low complexity joint estimation of synchronization impairments and channel in a single-user MIMO-OFDM system is presented in this paper. Based on a system model that takes into account the effects of synchronization impairments such as carrier frequency offset, sampling frequency offset, and symbol timing error, and channel, a Maximum Likelihood (ML) algorithm for the joint estimation is proposed. To reduce the complexity of ML grid search, the number of received signal samples used for estimation need to be reduced. The conventional channel estimation techniques using Least-Squares (LS) or Maximum a posteriori (MAP) methods fail for the reduced sample under-determined system, which results in poor performance of the joint estimator. The proposed ML algorithm uses Compressed Sensing (CS) based channel estimation method in a sparse fading scenario, where the received samples used for estimation are less than that required for an LS or MAP based estimation. The performance of the estimation method is studied through numerical simulations, and it is observed that CS based joint estimator performs better than LS and MAP based joint estimator. (C) 2013 Elsevier GmbH. All rights reserved.