An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Complete genome sequence of Colocasia bobone disease-associated virus, a putative cytorhabdovirus infecting taro

We report the first genome sequence of a Colocasia bobone disease-associated virus (CBDaV) derived from bobone-affected taro [Colocasia esculenta L. Schott] from Solomon Islands. The negative-strand RNA genome is 12,193 nt long, with six major open reading frames (ORFs) with the arrangement 3′-N-P-P3-M-G-L-5′. Typical of all rhabdoviruses, the 3′ leader and 5′ trailer sequences show complementarity to each other. Phylogenetic analysis indicated that CBDaV is a member of the genus Cytorhabdovirus, supporting previous reports of virus particles within the cytoplasm of bobone-infected taro cells. The availability of the CBDaV genome sequence now makes it possible to assess the role of this virus in bobone, and possibly alomae disease of taro and confirm that this sequence is that of Colocasia bobone disease virus (CBDV).

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Evolution of sequence specificity in a restriction endonuclease by a point mutation

Restriction endonucleases (REases) protect bacteria from invading foreign DNAs and are endowed with exquisite sequence specificity. REases have originated from the ancestral proteins and evolved new sequence specificities by genetic recombination, gene duplication, replication slippage, and transpositional events. They are also speculated to have evolved from nonspecific endonucleases, attaining a high degree of sequence specificity through point mutations. We describe here an example of generation of exquisitely site-specific REase from a highly-promiscuous one by a single point mutation.

Engineered protease inhibitors based on sunflower trypsin inhibitor-1 (SFTI-1) provide insights into the role of sequence and conformation in Laskowski mechanism inhibition

Laskowski inhibitors regulate serine proteases by an intriguing mode of action that involves deceiving the protease into synthesizing a peptide bond. Studies exploring naturally occurring Laskowski inhibitors have uncovered several structural features that convey the inhibitor's resistance to hydrolysis and exceptional binding affinity. However, in the context of Laskowski inhibitor engineering, the way that various modifications intended to fine-tune an inhibitor's potency and selectivity impact on its association and dissociation rates remains unclear. This information is important as Laskowski inhibitors are becoming increasingly used as design templates to develop new protease inhibitors for pharmaceutical applications. In this study, we used the cyclic peptide, sunflower trypsin inhibitor-1 (SFTI-1), as a model system to explore how the inhibitor's sequence and structure relate to its binding kinetics and function. Using enzyme assays, MD simulations and NMR spectroscopy to study SFTI variants with diverse sequence and backbone modifications, we show that the geometry of the binding loop mainly influences the inhibitor's potency by modulating the association rate, such that variants lacking a favourable conformation show dramatic losses in activity. Additionally, we show that the inhibitor's sequence (including both the binding loop and its scaffolding) influences its potency and selectivity by modulating both the association and the dissociation rates. These findings provide new insights into protease inhibitor function and design that we apply by engineering novel inhibitors for classical serine proteases, trypsin and chymotrypsin and two kallikrein-related peptidases (KLK5 and KLK14) that are implicated in various cancers and skin diseases.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Scheduling tools to reduce the cost of cane railway transport

Cane railway systems provide empty bins for harvesters to fill and full bins of cane for the factory to process. These operations need to be conducted in a timely fashion to minimise delays to harvesters and the factory and to minimise the cut-to-crush delay, while also minimising the cost of providing this service. A range of tools has been provided over the years to assist in this process. This paper reviews the objectives of the cane transport system and the tools available to achieve those objectives. The facilities within these tools to assist in the control of costs are highlighted.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Amino acid sequence of the winged bean (Psophocarpus tetragonolobus) basic lectin. Adenine binding and identification of the active-site tryptophan residue

The complete amino acid sequence of winged bean basic agglutinin (WBA I) was obtained by a combination of manual and gas-phase sequencing methods. Peptide fragments for sequence analyses were obtained by enzymatic cleavages using trypsin and Staphylococcus aureus V8 endoproteinase and by chemical cleavages using iodosobenzoic acid, hydroxylamine, and formic acid. COOH-terminal sequence analysis of WBA I and other peptides was performed using carboxypeptidase Y. The primary structure of WBA I was homologous to those of other legume lectins and more so to Erythrina corallodendron. Interestingly, the sequence shows remarkable identities in the regions involved in the association of the two monomers of E. corallodendron lectin. Other conserved regions are the double metal-binding site and residues contributing to the formation of the hydrophobic cavity and the carbohydrate-binding site. Chemical modification studies both in the presence and absence of N-acetylgalactosamine together with sequence analyses of tryptophan-containing tryptic peptides demonstrate that tryptophan 133 is involved in the binding of carbohydrate ligands by the lectin. The location of tryptophan 133 at the active center of WBA I for the first time subserves to explain a role for one of the most conserved residues in legume lectins.

Detection,amplification and sequence homology of sodC in clinical isolates of Salmonella sp

Background & objectives: Periplasmic copper and zinc superoxide dismutase (Cu,Zn-SOD or SodC) is an important component of the antioxidant shield which protects bacteria from the phagocytic oxidative burst. Cu,Zn-SODs protect Gram-negative bacteria against oxygen damage which have also been shown to contribute to the pathogenicity of these bacterial species. We report the presence of SodC in drug resistant Salmonella sp. isolated from patients suffering from enteric fever. Further sodC was amplified, cloned into Escherichia coli and the nucleotide sequence and amino acid sequence homology were compared with the standard strain Salmonella Typhimurium 14028. Methods: Salmonella enterica serovar Typhi (S. Typhi) and Salmonellaenterica serovar Paratyphi (S. Paratyphi) were isolated and identified from blood samples of the patients. The isolates were screened for the presence of Cu, Zn-SOD by PAGE using KCN as inhibitor of Cu,Zn-SOD. The gene (sodC) was amplified by PCR, cloned and sequenced. The nucleotide and amino acid sequences of sodC were compared using CLUSTAL X.Results: SodC was detected in 35 per cent of the Salmonella isolates. Amplification of the genomic DNA of S. Typhi and S. Paratyphi with sodC specific primers resulted in 519 and 515 bp amplicons respectively. Single mutational difference at position 489 was observed between thesodC of S. Typhi and S. Paratyphi while they differed at 6 positions with the sodC of S. Typhimurium 14028. The SodC amino acid sequences of the two isolates were homologous but 3 amino acid difference was observed with that of standard strain S. Typhimurium 14028.Interpretation & conclusions: The presence of SodC in pathogenic bacteria could be a novel candidate as phylogenetic marker.

The Line Spectral Frequency Model of a Finite-Length Sequence

The line spectral frequency (LSF) of a causal finite length sequence is a frequency at which the spectrum of the sequence annihilates or the magnitude spectrum has a spectral null. A causal finite-length sequencewith (L + 1) samples having exactly L-LSFs, is referred as an Annihilating (AH) sequence. Using some spectral properties of finite-length sequences, and some model parameters, we develop spectral decomposition structures, which are used to translate any finite-length sequence to an equivalent set of AH-sequences defined by LSFs and some complex constants. This alternate representation format of any finite-length sequence is referred as its LSF-Model. For a finite-length sequence, one can obtain multiple LSF-Models by varying the model parameters. The LSF-Model, in time domain can be used to synthesize any arbitrary causal finite-length sequence in terms of its characteristic AH-sequences. In the frequency domain, the LSF-Model can be used to obtain the spectral samples of the sequence as a linear combination of spectra of its characteristic AH-sequences. We also summarize the utility of the LSF-Model in practical discrete signal processing systems.

Evolution, Homology Conservation, and Identification of Unique Sequence Signatures in GH19 Family Chitinases

The discovery of GH (Glycoside Hydrolase) 19 chitinases in Streptomyces sp. raises the possibility of the presence of these proteins in other bacterial species, since they were initially thought to be confined to higher plants. The present study mainly concentrates on the phylogenetic distribution and homology conservation in GH19 family chitinases. Extensive database searches are performed to identify the presence of GH19 family chitinases in the three major super kingdoms of life. Multiple sequence alignment of all the identified GH19 chitinase family members resulted in the identification of globally conserved residues. We further identified conserved sequence motifs across the major sub groups within the family. Estimation of evolutionary distance between the various bacterial and plant chitinases are carried out to better understand the pattern of evolution. Our study also supports the horizontal gene transfer theory, which states that GH19 chitinase genes are transferred from higher plants to bacteria. Further, the present study sheds light on the phylogenetic distribution and identifies unique sequence signatures that define GH19 chitinase family of proteins. The identified motifs could be used as markers to delineate uncharacterized GH19 family chitinases. The estimation of evolutionary distance between chitinase identified in plants and bacteria shows that the flowering plants are more related to chitinase in actinobacteria than that of identified in purple bacteria. We propose a model to elucidate the natural history of GH19 family chitinases.