Allele resolution of HLA-A using oligonucleotide probes in a two-stage typing strategy

High-resolution polymerase chain reaction using sequence-specific oligonucleotide probes (PCR-SSOP) typing methods for HLA-A identification have been established. The four systems, which operate independently of each other, are intended for use as secondary typing systems following HLA-A identification with a medium-resolution PCR-SSOP technique. The systems, all using digoxigenin-labelled probes, are based on group specific amplifications for resolution of: i) HLA-A*29 & -A*33; ii) HLA-A*24 & -A*30; and iii) HLA-A*26, -A*25, -A*11, -A*34, -A*66 and -A*68 alleles, respectively. The fourth system, for the detection of HLA-A*02 alleles, is a modification of a previously reported PCR-SSOP subtyping system. The methods have been applied to individuals from the local bone marrow registry and HLA-A allele frequencies for the Northern Ireland population have been established.

Genetic diversity, virulence genes and antimicrobial resistance of Salmonella Enteritidis isolated from food and humans over a 24-year period in Brazil

Salmonellosis is a major health problem worldwide. Serovar Enteritidis has been a primary cause of Salmonella outbreaks in many countries. In Brazil, few molecular typing studies have been performed. The aims of this study were to molecularly type Salmonella Enteritidis strains isolated in Brazil in order to determine the genetic relationship between strains of food and human origin, as well as, to assess their pathogenic potential and antimicrobial resistance. A total of 128 S. Enteritidis strains isolated from human feces (67) and food (61) between 1986 and 2010 were studied. The genotypic diversity was assessed by ERIC-PCR and PFGE using Xbal, the antimicrobial resistance by the disc-diffusion assay and the presence of the SPI-1, SPI-2 and pSTV virulence genes assessed by PCR. The ERIC-PCR results revealed that 112 strains exhibited a similarity of >85.4% and the PFGE that 96 strains exhibited a similarity of >80.0%. Almost all strains (97.6%) harbored all 13 virulence genes investigated. Thirty-six strains (28.12%) were resistant to nalidixic acid. In conclusion, the nalidixic acid resistance observed after 1996 is indicative of an increase in the use of this drug. It may be suggested that these 128 strains might have descended from a common ancestor that differed little over 24 years and has been both contaminating food and humans and causing disease for more than two decades in Brazil. (c) 2012 Elsevier Ltd. All rights reserved.

On model typing

Where object-oriented languages deal with objects as described by classes, model-driven development uses models, as graphs of interconnected objects, described by metamodels. A number of new languages have been and continue to be developed for this model- based paradigm, both for model transformation and for general programming using models. Many of these use single-object approaches to typing, derived from solutions found in object-oriented systems, while others use metamodels as model types, but without a clear notion of polymorphism. Both of these approaches lead to brittle and overly restrictive reuse characteristics. In this paper we propose a simple extension to object-oriented typing to better cater for a model-oriented context, including a simple strategy for typing models as a collection of interconnected objects. We suggest extensions to existing type system formalisms to support these concepts and their manipulation. Using a simple example we show how this extended approach permits more flexible reuse, while preserving type safety.

Non-intrusive continuous user behaviour analysis using computerized systems

There are different ways to authenticate humans, which is an essential prerequisite for access control. The authentication process can be subdivided into three categories that rely on something someone i) knows (e.g. password), and/or ii) has (e.g. smart card), and/or iii) is (biometric features). Besides classical attacks on password solutions and the risk that identity-related objects can be stolen, traditional biometric solutions have their own disadvantages such as the requirement of expensive devices, risk of stolen bio-templates etc. Moreover, existing approaches provide the authentication process usually performed only once initially. Non-intrusive and continuous monitoring of user activities emerges as promising solution in hardening authentication process: iii-2) how so. behaves. In recent years various keystroke dynamic behavior-based approaches were published that are able to authenticate humans based on their typing behavior. The majority focuses on so-called static text approaches, where users are requested to type a previously defined text. Relatively few techniques are based on free text approaches that allow a transparent monitoring of user activities and provide continuous verification. Unfortunately only few solutions are deployable in application environments under realistic conditions. Unsolved problems are for instance scalability problems, high response times and error rates. The aim of this work is the development of behavioral-based verification solutions. Our main requirement is to deploy these solutions under realistic conditions within existing environments in order to enable a transparent and free text based continuous verification of active users with low error rates and response times.

Safe Compositional Specification of Network Systems With Polymorphic, Constrained Types

In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It allows safety property to be formalized in terms of types and subtyping relations. Extending upon our previous work, we add Hindley-Milner style polymorphism [8] with constraints [9] to the type system of TRAFFIC. This allows a programmer to use for-all quantifier to describe types of network components, escalating power and expressiveness of types to a new level that was not possible before with propositional subtyping relations. Furthermore, we design our type system with a pluggable constraint system, so it can adapt to different application needs while maintaining soundness. In this paper, we show the soundness of the type system, which is not syntax-directed but is easier to do typing derivation. We show that there is an equivalent syntax-directed type system, which is what a type checker program would implement to verify the safety of a network flow. This is followed by discussion on several constraint systems: polymorphism with subtyping constraints, Linear Programming, and Constraint Handling Rules (CHR) [3]. Finally, we provide some examples to illustrate workings of these constraint systems.

DNA typing in thirty seconds with a microfabricated device

We report the development of a practical ultrafast allelic profiling assay for the analysis of short tandem repeats (STRs) by using a highly optimized microfluidic electrophoresis device. We have achieved baseline-resolved electrophoretic separations of single-locus STR samples in 30 sec. Analyses of PCR samples containing the four loci CSF1PO, TPOX, THO1, and vWA (abbreviated as CTTv) were performed in less than 2 min. This constitutes a 10- to 100-fold improvement in speed relative to capillary or slab gel systems. The separation device consists of a microfabricated channel 45 μm × 100 μm in cross section and 26 mm in length, filled with a replaceable polyacrylamide matrix operated under denaturing conditions at 50°C. A fluorescently labeled STR ladder was used as an internal standard for allele identification. Samples were prepared by standard procedures and only 4 μl was required for each analysis. The device is capable of repetitive operation and is suitable for automated high-speed and high-throughput applications.

On the zeros of the Abelian integrals for a class of Liénard systems

A planar polynomial differential system has a finite number of limit cycles. However, finding the upper bound of the number of limit cycles is an open problem for the general nonlinear dynamical systems. In this paper, we investigated a class of Liénard systems of the form x'=y, y'=f(x)+y g(x) with deg f=5 and deg g=4. We proved that the related elliptic integrals of the Liénard systems have at most three zeros including multiple zeros, which implies that the number of limit cycles bifurcated from the periodic orbits of the unperturbed system is less than or equal to 3.