Antibodies to Influenza and West Nile Viruses in Horses in Mexico

INFLUENZA A virus (IAV) (family Orthomyxoviridae) is a highly infectious respiratory pathogen of birds and mammals, including human beings and horses (Palese and Shaw 2007). The virus is classified into different subtypes based on the antigenic properties of the haemagglutinin (HA) and neuraminidase (NA) proteins. Sixteen HA subtypes (H1 to H16) and nine NA subtypes (N1 to N9) have been identified (Fouchier and others 2005). Two subtypes, H3N8 and H7N7, have been isolated from horses. The H7N7 subtype was first isolated from a horse in Czechoslovakia in 1956 (Prague/56) (Sovinova and others 1958), and the H3N8 subtype was first isolated from a horse in Miami, USA, in 1963 (Waddell and others 1963). The H7N7 subtype has not been isolated from horses for three decades and is presumed to be extinct (Webster 1993). The H3N8 subtype is currently a common cause of disease in horses worldwide. In horses, influenza is characterized by an abrupt onset of pyrexia, depression, coughing and nasal discharge, and is often complicated by secondary bacteria infections that can lead to pneumonia and death (Hannant and Mumford 1996). Although H3N8 is a major cause of morbidity in horses throughout the world, information on the seroprevalence of IAV in horses and other domestic animals in Mexico is limited.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.