Prospecting for scarabid specific Bacillus thuringiensis crystal toxin cry8 gene in sugarcane ecosystem of Tamil Nadu, India

In the present study, we report the occurrence of cry8 positive isolates of Bacillus thuringiensis (Bt) in selected white grub, Holotrichia serrata F. (Coleoptera: Scarabaeidae), endemic soils of sugarcane ecosystem and other places in Tamil Nadu. Out of the 66 soil samples collected and screened for white grub specific Bt, 74 isolates of the bacterium, all containing only spherical crystal toxin, were identified. PCR screening of these isolates with cry8 gene universal primer revealed six isolates to be positive. Further, the amplicon of a 370 bp band, amplified with another set of degenerate primer designed based on the conserved sequence of cry8 genes, was sequenced from four isolates. Multiple sequence alignment revealed the gene sequences to be the same for all the isolates. The present report of the availability of cry8 positive Bt isolates opens the avenue for controlling white grubs through transgenic research

HPV vaccination of immunocompromised hosts.

It is well-established that immunocompromised people are at increased risk of HPV-related disease compared with those who are immunocompetent. Prophylactic HPV sub-unit vaccines are safe and immunogenic in immunocompromised people and it is strongly recommended that vaccination occur according to national guidelines. When delivered to immunocompromised populations, HPV vaccines should be given as a 3-dose regimen

C1q-targeted inhibition of the classical complement pathway prevents injury in a novel mouse model of acute motor axonal neuropathy

Introduction Guillain-Barré syndrome (GBS) is an autoimmune disease that results in acute paralysis through inflammatory attack on peripheral nerves, and currently has limited, non-specific treatment options. The pathogenesis of the acute motor axonal neuropathy (AMAN) variant is mediated by complement-fixing anti-ganglioside antibodies that directly bind and injure the axon at sites of vulnerability such as nodes of Ranvier and nerve terminals. Consequently, the complement cascade is an attractive target to reduce disease severity. Recently, C5 complement component inhibitors that block the formation of the membrane attack complex and subsequent downstream injury have been shown to be efficacious in an in vivo anti-GQ1b antibody-mediated mouse model of the GBS variant Miller Fisher syndrome (MFS). However, since gangliosides are widely expressed in neurons and glial cells, injury in this model was not targeted exclusively to the axon and there are currently no pure mouse models for AMAN. Additionally, C5 inhibition does not prevent the production of early complement fragments such as C3a and C3b that can be deleterious via their known role in immune cell and macrophage recruitment to sites of neuronal damage. Results and Conclusions In this study, we first developed a new in vivo transgenic mouse model of AMAN using mice that express complex gangliosides exclusively in neurons, thereby enabling specific targeting of axons with anti-ganglioside antibodies. Secondly, we have evaluated the efficacy of a novel anti-C1q antibody (M1) that blocks initiation of the classical complement cascade, in both the newly developed anti-GM1 antibody-mediated AMAN model and our established MFS model in vivo. Anti-C1q monoclonal antibody treatment attenuated complement cascade activation and deposition, reduced immune cell recruitment and axonal injury, in both mouse models of GBS, along with improvement in respiratory function. These results demonstrate that neutralising C1q function attenuates injury with a consequent neuroprotective effect in acute GBS models and promises to be a useful new target for human therapy

Improving Strategies via SMT Solving

We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number of iterations (ii) the use of merge operations (often, convex hulls) at the merge points of the control flow graph. It instead computes the least inductive invariant expressible in the domain at a restricted set of program points, and analyzes the rest of the code en bloc. We emphasize that we compute this inductive invariant precisely. For that we extend the strategy improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method directly, we would have to solve an exponentially sized system of abstract semantic equations, resulting in memory exhaustion. Instead, we keep the system implicit and discover strategy improvements using SAT modulo real linear arithmetic (SMT). For evaluating strategies we use linear programming. Our algorithm has low polynomial space complexity and performs for contrived examples in the worst case exponentially many strategy improvement steps; this is unsurprising, since we show that the associated abstract reachability problem is Pi-p-2-complete

A MEMORY EFFICIENT HARDWARE BASED PATTERN MATCHING AND PROTEIN ALIGNMENT SCHEMES FOR HIGHLY COMPLEX DATABASES

Protein sequence alignment to find correlation between different species, or genetic mutations etc. is the most computational intensive task when performing protein comparison. To speed-up the alignment, Systolic Arrays (SAs) have been used. In order to avoid the internal-loop problem which reduces the performance, pipeline interleaving strategy has been presented. This strategy is applied to an SA for Smith Waterman (SW) algorithm which is an alignment algorithm to locally align two proteins. In the proposed system, the above methodology has been extended to implement a memory efficient FPGA-hardware based Network Intrusion Detection System (NIDS) to speed up network processing. The pattern matching in Intrusion Detection Systems (IDS) is done using SNORT to find the pattern of intrusions. A Finite State Machine (FSM) based Processing Elements (PE) unit to achieve minimum number of states for pattern matching and bit wise early intrusion detection to increase the throughput by pipelining is presented

A systematic review considering risk factors for mortality of patients discharged from hospital with a diagnosis of diabetes

Aim: To identify known risk factors for mortality for adult patients, discharged from hospital with diabetes. Method: The systematic review was based on the PRISMA protocol. Studies were identified through EMBASE & MEDLINE databases. The inclusion criteria were papers that were published over the last 6 years, in English language, and focused on risk factors of mortality in adult patients with diabetes, after they were discharged from hospitals. This was followed by data extraction “with quality assessment and semi-quantitative synthesis according to PRISMA guidelines”. Results: There were 35 studies identified, considering risk factors relating to mortality for patients, discharged from hospital with diabetes. These studies are distributed internationally. 48 distinct statistically significant risk factors for mortality can be identified. Risk factors can be grouped into the following categories; demographic, socioeconomic, lifestyle, patient medical, inpatient stay, medication related, laboratory results, and gylcaemic status. These risk factors can be further divided into risk factors identified in generalized populations of patients with diabetes, compared to specific sub-populations of people with diabetes. Conclusion: A relatively small number of studies have considered risk factors relating to mortality for patients, discharged from hospital with a diagnosis of diabetes. Mortality is an important outcome, when considering discharge from hospital with diabetes. However, there has only been limited consideration within the research literature

Speeding up the constraint-based method in difference logic

"The final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-319-40970-2_18"Over the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to termination and non-termination proving. Quite often the semantics of the program under study as well as the properties to be generated belong to difference logic, i.e., the fragment of linear arithmetic where atoms are inequalities of the form u v = k. However, so far constraint-based techniques have not exploited this fact: in general, Farkas’ Lemma is used to produce the constraints over template unknowns, which leads to non-linear SMT problems. Based on classical results of graph theory, in this paper we propose new encodings for generating these constraints when program semantics and templates belong to difference logic. Thanks to this approach, instead of a heavyweight non-linear arithmetic solver, a much cheaper SMT solver for difference logic or linear integer arithmetic can be employed for solving the resulting constraints. We present encouraging experimental results that show the high impact of the proposed techniques on the performance of the VeryMax verification systemPeer ReviewedPostprint (author's final draft