A CD8(+) T cell clone specific for antigen also recognizes peptidomimics present in anti-idiotypic antibody: Implications for T cell memory

The relay hypothesis [R. Nayak, S. Mitra-Kaushik, M.S. Shaila, Perpetuation of immunological memory: a relay hypothesis, Immunology 102 (2001) 387-395] was earlier proposed to explain perpetuation of immunological memory without requiring long lived memory cells or persisting antigen. This hypothesis envisaged cycles of interaction and proliferation of complementary idiotypic B cells (Burnet cells) and anti-idiotypic B cells (Jerne cells) as the primary reason for perpetuation of immunological memory. The presence of pepti-domimics of antigen in anti-idiotypic antibody and their presentation to antigen specific T cells was postulated to be primary reason for perpetuation of T cell memory. Using a viral hemagglutinin as a model, in this work, we demonstrate the presence of peptidomimics in the variable region of ail anti-idiotypic antibody capable of functionally mimicking the antigen derived peptides. A CD8(+) CTL clone was generated against the hemagglutinin protein which specifically responds to either peptidomimic synthesizing cells or peptidomimic pulsed antigen presenting cells. Thus, it appears reasonable that a population of activated antigen specific T cells is maintained in the body by presentation of peptidomimic through Jerne cells and other antigen presenting cells long after immunization. (C) 2007 Elsevier Inc. All rights reserved.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

Alppihiihdon alkutaival : Pujottelu- ja tunturihiihto Suomessa 1920-luvulta 1960-luvulle

The object of study in this thesis is Finnish skiing culture and Alpine skiing in particular from the point of view of ethnology. The objective is to clarify how, when, why and by what routes Alpine skiing found its way to Finland. What other phenomena did it bring forth? The objective is essentially linked to the diffusion of modern sports culture to Finland. The introduction of Alpine skiing to Finland took place at a time when skiing culture was changing: flat terrain skiing was abandoned in favour of cross-country skiing in the early decades of the 20th century, and new techniques and equipment made skiing a much more versatile sport. The time span of the study starts from the late 19th century and ends in the mid-20th century. The spatial focus is in Finland. People and communities formed through their actions are core elements in the study of sports and physical activity. Organizations tend to raise themselves into influential actors in the field of physical culture even if active individuals work in their background. Original archive documents and publications of sports organizations are central source material for this thesis, complemented by newspapers and sports magazines as well as photographs and films on early Alpine skiing in Finland. Ever since their beginning in the late 19th century skiing races in Finland had mostly taken place on flat terrain or sea ice. Skiing in broken cross-country terrain made its breakthrough in the 1920 s, at a time when modern skiing techniques were introduced in instruction manuals. In the late 1920 s the Finnish Women s Physical Education Association (SNLL) developed unconventional forms of pedagogical skiing instruction. They abandoned traditional Finnish flat terrain skiing and boldly looked for influences abroad, which caused friction between the leaders of the women s sports movement and the (male) leaders of the central skiing organization. SNLL was instrumental in launching winter tourism in Finnish Lapland in 1933. The Finnish Tourism Society, the State Railways and sports organizations worked in close co-operation to instigate a boom in tourism, which culminated in the inauguration of a tourist hotel at Pallastunturi hill in the winter of 1938. Following a Swedish model, fell-skiing was developed as a domestic counterpart to Alpine skiing as practiced in Central Europe. The first Finnish skiing resorts were built at sites of major cross-country skiing races. Inspired by the slope at Bad Grankulla health spa, the first slalom skiing races and fell-skiing, slalom enthusiasts began to look for purpose-built sites to practice turn technique. At first they would train in natural slopes but in the late 1930 s new slopes were cleared for slalom races and recreational skiing. The building of slopes and ski lifts and the emergence of organized slalom racing competitions gradually separated Alpine skiing from the old fell-skiing. After the Second World War fell-skiing was transformed into ski trekking on marked courses. At the same time Alpine skiing also parted ways with cross-country skiing to become a sport of its own. In the 1940 s and 1950 s Finnish Alpine skiing was almost exclusively a competitive sport. The specificity of Alpine skiing was enhanced by rapid development of equipment: the new skis, bindings and shoes could only be used going downhill.

Distributed space-time codes with reduced decoding complexity

We address the problem of distributed space-time coding with reduced decoding complexity for wireless relay network. The transmission protocol follows a two-hop model wherein the source transmits a vector in the first hop and in the second hop the relays transmit a vector, which is a transformation of the received vector by a relay-specific unitary transformation. Design criteria is derived for this system model and codes are proposed that achieve full diversity. For a fixed number of relay nodes, the general system model considered in this paper admits code constructions with lower decoding complexity compared to codes based on some earlier system models.

An intelligent approach using support vector machines for monitoring and identification of faults on transmission systems

Power system disturbances are often caused by faults on transmission lines. When faults occur in a power system, the protective relays detect the fault and initiate tripping of appropriate circuit breakers, which isolate the affected part from the rest of the power system. Generally Extra High Voltage (EHV) transmission substations in power systems are connected with multiple transmission lines to neighboring substations. In some cases mal-operation of relays can happen under varying operating conditions, because of inappropriate coordination of relay settings. Due to these actions the power system margins for contingencies are decreasing. Hence, power system protective relaying reliability becomes increasingly important. In this paper an approach is presented using Support Vector Machine (SVM) as an intelligent tool for identifying the faulted line that is emanating from a substation and finding the distance from the substation. Results on 24-bus equivalent EHV system, part of Indian southern grid, are presented for illustration purpose. This approach is particularly important to avoid mal-operation of relays following a disturbance in the neighboring line connected to the same substation and assuring secure operation of the power systems.

Molecular conformation of alamethicin in dimethylsulfoxide solution A two-dimensional n.m.r. study

The solution conformation of alamethicin, a 20-residue antibiotic peptide, has been investigated using two-dimensional n.m.r. spectroscopy. Complete proton resonance assignments of this peptide have been carried out using COSY, SUPERCOSY, RELAY COSY and NOESY two-dimensional spectroscopies. Observation of a large number of nuclear Overhauser effects between sequential backbone amide protons, between backbone amide protons and CβH protons of preceding residues and extensive intramolecular hydrogen bonding patterns of NH protons has established that this polypeptide is in a largely helical conformation. This result is in conformity with earlier reported solid state X-ray results and a recent n.m.r. study in methanol solution (Esposito et al. (1987) Biochemistry26, 1043-1050) but is at variance with an earlier study which favored an extended conformation for the C-terminal half of alamethicin (Bannerjee et al.

Diverse pathways for salicin utilization in Shigella sonnei and Escherichia coli carrying an impaired bgl operon

Utilization of the aryl-beta-glucosides salicin or arbutin in most wild-type strains of E. coli is achieved by a single-step mutational activation of the bgl operon. Shigella sonnei, a branch of the diverse E. coli strain tree, requires two sequential mutational steps for achieving salicin utilization as the bglB gene, encoding the phospho-beta-glucosidase B, harbors an inactivating insertion. We show that in a natural isolate of S. sonnei, transcriptional activation of the gene SSO1595, encoding a phospho-beta-glucosidase, enables salicin utilization with the permease function being provided by the activated bgl operon. SSO1595 is absent in most commensal strains of E. coli, but is present in extra-intestinal pathogens as bgcA, a component of the bgc operon that enables beta-glucoside utilization at low temperature. Salicin utilization in an E. coli bglB laboratory strain also requires a two-step activation process leading to expression of BglF, the PTS-associated permease encoded by the bgl operon and AscB, the phospho-beta-glucosidase B encoded by the silent asc operon. BglF function is needed since AscF is unable to transport beta-glucosides as it lacks the IIA domain involved in phopho-relay. Activation of the asc operon in the Sal(+) mutant is by a promoter-up mutation and the activated operon is subject to induction. The pathway to achieve salicin utilization is therefore diverse in these two evolutionarily related organisms; however, both show cooperation between two silent genetic systems to achieve a new metabolic capability under selection.

Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks

The use of energy harvesting (EH) nodes as cooperative relays is a promising and emerging solution in wireless systems such as wireless sensor networks. It harnesses the spatial diversity of a multi-relay network and addresses the vexing problem of a relay's batteries getting drained in forwarding information to the destination. We consider a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission. For a general class of stationary and ergodic EH processes, we introduce the notion of energy constrained and energy unconstrained relays and analytically characterize the symbol error rate of the system. Further insight is gained by an asymptotic analysis that considers the cases where the signal-to-noise-ratio or the number of relays is large. Our analysis quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system. The optimal static transmit power setting at the EH relays is also determined. Altogether, our results demonstrate how a system that uses EH relays differs in significant ways from one that uses conventional cooperative relays.