Haemophilus influenzae Genome Database (HIGDB): A single point web resource for Haemophilus influenzae

Background: Haemophilus influenzae (H. Influenzae) is the causative agent of pneumonia, bacteraemia and meningitis. The organism is responsible for large number of deaths in both developed and developing countries. Even-though the first bacterial genome to be sequenced was that of H. Influenzae, there is no exclusive database dedicated for H. Influenzae. This prompted us to develop the Haemophilus influenzae Genome Database (HIGDB). Methods: All data of HIGDB are stored and managed in MySQL database. The HIGDB is hosted on Solaris server and developed using PERL modules. Ajax and JavaScript are used for the interface development. Results: The HIGDB contains detailed information on 42,741 proteins, 18,077 genes including 10 whole genome sequences and also 284 three dimensional structures of proteins of H. influenzae. In addition, the database provides ``Motif search'' and ``GBrowse''. The HIGDB is freely accessible through the URL:http://bioserverl.physicslisc.ernetin/HIGDB/. Discussion: The HIGDB will be a single point access for bacteriological, clinical, genomic and proteomic information of H. influenzae. The database can also be used to identify DNA motifs within H. influenzae genomes and to compare gene or protein sequences of a particular strain with other strains of H. influenzae. (C) 2014 Elsevier Ltd. All rights reserved.

Lizards of the Thar Desert - Resource partitioning and community composition

How similar species co-exist in nature is a fundamental question in community ecology. Resource partitioning has been studied in desert lizard communities across four continents, but data from South Asia is lacking. We used area-constrained visual encounter surveys to study community composition and spatial and temporal resource partitioning in a lizard community during summer in the Thar Desert, western India, addressing an important biogeographic gap in knowledge. Twelve one-hectare grids divided into 25 m x 25 m plots were placed across four habitats barren dunes, stabilized dunes, grassland, and rocky hills. We recorded 1039 sightings of 12 species during 84 sampling sessions. Lizard abundance decreased in the order stabilized dunes > grassland > barren dunes > rocky hills; richness was in roughly the opposite order. Resource partitioning was examined for the seven commonest species. Overall spatial overlap was low (<0.6) between species pairs. Overlap was higher within habitats, but species showed finer separation through use of different microhabitat categories and specific spatial resources, as well as by positioning at different distances to vegetation. Diurnal species were also separated by peak time of activity. Space appears to be an important resource dimension facilitating coexistence in this desert lizard community. (C) 2015 Elsevier Ltd. All rights reserved.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Optimal Power Allocation Policies for Low Powered Wireless Communication Systems

We consider optimal average power allocation policies in a wireless channel in the presence of individual delay constraints on the transmitted packets. Power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. We have developed a computationally efficient online algorithm, when there is same hard delay constraint for all packets. Later on, we generalize it to the case when there are multiple real time streams with different hard deadline constraints. Our algorithm uses linear programming and has very low complexity.

Creating a specialist protein resource network: a meeting report for the protein bioinformatics and community resources retreat

During 11-12 August 2014, a Protein Bioinformatics and Community Resources Retreat was held at the Wellcome Trust Genome Campus in Hinxton, UK. This meeting brought together the principal investigators of several specialized protein resources (such as CAZy, TCDB and MEROPS) as well as those from protein databases from the large Bioinformatics centres (including UniProt and RefSeq). The retreat was divided into five sessions: (1) key challenges, (2) the databases represented, (3) best practices for maintenance and curation, (4) information flow to and from large data centers and (5) communication and funding. An important outcome of this meeting was the creation of a Specialist Protein Resource Network that we believe will improve coordination of the activities of its member resources. We invite further protein database resources to join the network and continue the dialogue.

SInCRe-structural interactome computational resource for Mycobacterium tuberculosis

We have developed an integrated database for Mycobacterium tuberculosis H37Rv (Mtb) that collates information on protein sequences, domain assignments, functional annotation and 3D structural information along with protein-protein and protein-small molecule interactions. SInCRe (Structural Interactome Computational Resource) is developed out of CamBan (Cambridge and Bangalore) collaboration. The motivation for development of this database is to provide an integrated platform to allow easily access and interpretation of data and results obtained by all the groups in CamBan in the field of Mtb informatics. In-house algorithms and databases developed independently by various academic groups in CamBan are used to generate Mtb-specific datasets and are integrated in this database to provide a structural dimension to studies on tuberculosis. The SInCRe database readily provides information on identification of functional domains, genome-scale modelling of structures of Mtb proteins and characterization of the small-molecule binding sites within Mtb. The resource also provides structure-based function annotation, information on small-molecule binders including FDA (Food and Drug Administration)-approved drugs, protein-protein interactions (PPIs) and natural compounds that bind to pathogen proteins potentially and result in weakening or elimination of host-pathogen protein-protein interactions. Together they provide prerequisites for identification of off-target binding.

Coupling geomorphology parameters with lithology for micro-level groundwater resource assessment: a case study from semi-arid hard rock terrain in Tamil Nadu, India

The standard procedure of groundwater resource estimation in India till date is based on the specific yield parameters of each rock type (lithology) derived through pumping test analysis. Using the change in groundwater level, specific yield, and area of influence, groundwater storage change could be estimated. However, terrain conditions in the form of geomorphological variations have an important bearing on the net groundwater recharge. In this study, an attempt was made to use both lithology and geomorphology as input variables to estimate the recharge from different sources in each lithology unit influenced by the geomorphic conditions (lith-geom), season wise separately. The study provided a methodological approach for an evaluation of groundwater in a semi-arid hard rock terrain in Tirunelveli, Tamil Nadu, India. While characterizing the gneissic rock, it was found that the geomorphologic variations in the gneissic rock due to weathering and deposition behaved differently with respect to aquifer recharge. The three different geomorphic units identified in gneissic rock (pediplain shallow weathered (PPS), pediplain moderate weathered (PPM), and buried pediplain moderate (BPM)) showed a significant variation in recharge conditions among themselves. It was found from the study that Peninsular gneiss gives a net recharge value of 0.13 m/year/unit area when considered as a single unit w.r.t. lithology, whereas the same area considered with lith-geom classes gives recharge values between 0.1 and 0.41 m/year presenting a different assessment. It is also found from this study that the stage of development (SOD) for each lith-geom unit in Peninsular gneiss varies from 168 to 230 %, whereas the SOD is 223 % for the lithology as a single unit.

QEP Based Solution for Power Allocation in Amplify and Forward Networks

The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.

Efficient Low Complexity Power Allocation Policies for Wireless Communication Systems Guaranteeing QoS

We consider near-optimal policies for a single user transmitting on a wireless channel which minimize average queue length under average power constraint. The power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. Later, we also extend these results to the multiuser case. We show that our policies can be used in a system with energy harvesting sources at the transmitter. Next we consider data users which require minimum rate guarantees. Finally we consider the system which has both data and real time users. Our policies have low computational complexity, closed form expression for mean delays and require only the mean arrival rate with no queue length information.

Pricing and Power allocation in Femtocells using Stackelberg Game Theory

We consider a system with multiple Femtocells operating in a Macrocell. The transmissions in one Femtocell interfere with its neighboring Femtocells as well as with the Macrocell Base Station. We model Femtocells as selfish nodes and the Macrocell Base Station protects itself by pricing subchannels for each usage. We use Stackelberg game model to study this scenario and obtain equilibrium policies that satisfy certain quality of service.

Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.

Optimization of bus allocation to depots by minimizing dead kilometers

In metropolitan cities, public transportation service plays a vital role in mobility of people, and it has to introduce new routes more frequently due to the fast development of the city in terms of population growth and city size. Whenever there is introduction of new route or increase in frequency of buses, the nonrevenue kilometers covered by the buses increases as depot and route starting/ending points are at different places. This non-revenue kilometers or dead kilometers depends on the distance between depot and route starting point/ending point. The dead kilometers not only results in revenue loss but also results in an increase in the operating cost because of the extra kilometers covered by buses. Reduction of dead kilometers is necessary for the economic growth of the public transportation system. Therefore, in this study, the attention is focused on minimizing dead kilometers by optimizing allocation of buses to depots depending upon the shortest distance between depot and route starting/ending points. We consider also depot capacity and time period of operation during allocation of buses to ensure parking safety and proper maintenance of buses. Mathematical model is developed considering the aforementioned parameters, which is a mixed integer program, and applied to Bangalore Metropolitan Transport Corporation (BMTC) routes operating presently in order to obtain optimal bus allocation to depots. Database for dead kilometers of depots in BMTC for all the schedules are generated using the Form-4 (trip sheet) of each schedule to analyze depot-wise and division-wise dead kilometers. This study also suggests alternative locations where depots can be located to reduce dead kilometers. Copyright (C) 2015 John Wiley & Sons, Ltd.

CheepSync: A Time Synchronization Service for Resource Constrained Bluetooth LE Advertisers

Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans. It improves the efficiency, modularity, and scalability of the system, and optimizes use of event triggers. For IoTH, BLE - a subset of the recent Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This article presents and describes CheepSync, a time synchronization service for BLE advertisers, especially tailored for applications requiring high time precision on resource constrained BLE platforms. Designed on top of the existing Bluetooth v4.0 standard, the CheepSync framework utilizes low-level time-stamping and comprehensive error compensation mechanisms for overcoming uncertainties in message transmission, clock drift, and other system-specific constraints. CheepSync was implemented on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners). We demonstrate the efficacy of CheepSync by numerous empirical evaluations in a variety of experimental setups, and show that its average (single-hop) time synchronization accuracy is in the 10 mu s range.

Appraisal of groundwater resource in Holocene soil deposits by resistivity, hydrochemical and granulomerial studies in the Gulf of Mannar Coast from Southern India

This article is aimed to delineate groundwater sources in Holocene deposits area in the Gulf of Mannar Coast from Southern India. For this purpose 2-D electrical resistivity tomography (ERT), hydrochemical and granulomerical studies were carried out and integrated to identify hydrogeological structures and portable groundwater resource in shallow depths which in general appears in the coastal tracts. The 2-D ERT was used to determine the two-dimensional subsurface geological formations by multicore cable with Wenner array. Low resistivity of 1-5 Omega m for saline water appeared due to calcite at the depth of about 5 m below the ground level (bgl). Sea water intrusion was observed around the maximum resistivity as 5 Omega m at the 8 m depth, bgl in the calcite environs, but the calcareous sandstone layer shows around 15-64 Omega m at the 6 m depth, bgl. The hydrochemical variation of TDS, HCO3-, Cl-, Na+, K+, Ca2+, and Mg2+ concentrations was observed for the saline and sea water intrusion in the groundwater system. The granulometic analysis shows that the study area was under the sea between 5400 and 3000 year ago. The events of ice melting an unnatural ice-stone rain/hail among 5000-4000 years ago resulted in the inundation of sea over the area and deposits of late Holocene marine transgression formation up to Puthukottai quartzite region for a stretch of around 17 km.