Gene expression profile of epithelial cells and mesenchymal cells derived from limbal explant culture

Purpose: Limbal stem cell deficiency is a challenging clinical problem and the current treatment involves replenishing the depleted limbal stem cell (LSC) pool by either limbal tissue transplantation or use of cultivated limbal epithelial cells (LEC). Our experience of cultivating the LEC on denuded human amniotic membrane using a feeder cell free method, led to identification of mesenchymal cells of limbus (MC-L), which showed phenotypic resemblance to bone marrow derived mesenchymal stem cells (MSC-BM). To understand the transcriptional profile of these cells, microarray experiments were carried out.Methods: RNA was isolated from cultured LEC, MC-L and MSC-BM and microarray experiments were carried out by using Agilent chip (4x44 k). The microarray data was validated by using Realtime and semiquntitative reverse transcription polymerase chain reaction. Results: The microarray analysis revealed specific gene signature of LEC and MC-L, and also their complementary role related to cytokine and growth factor profile, thus supporting the nurturing roles of the MC-L. We have also observed similar and differential gene expression between MC-L and MSC-BM.Conclusions: This study represents the first extensive gene expression analysis of limbal explant culture derived epithelial and mesenchymal cells and as such reveals new insight into the biology, ontogeny, and in vivo function of these cells.

Maturation of a transient outward potassium current in mouse fetal hypothalamic neurons in culture

The whole-cell voltage clamp technique was used to record potassium currents in mouse fetal hypothalamic neurons developing in culture medium from days 1 to 17. The neurons were derived from fetuses of IOPS/OF1 mice on the 14th day of gestation. The mature neurons (>six days in culture) showed both a transient potassium current and a non-inactivating delayed rectifier potassium current. These were identified pharmacologically by using the potassium channel blockers tetraethyl ammonium chloride and 4-aminopyridine, and on the basis of their kinetics and voltage sensitivities. The delayed rectifier potassium current had a threshold of −20 mV, a slow time-course of activation, and was sustained during the voltage pulse. The 4-aminopyridine-sensitive current was transient, and was activated from a holding potential more negative (−80 mV) than that required for evoking the delayed rectifier potassium current (−40 mV). The delayed rectifier potassium current was detectable from day 1 onwards, while the transient potassium current showed a distinct developmental trend. The time-constant of inactivation became faster with age in culture. The half steady-state inactivation potential showed a shift towards less negative membrane potentials with age, and the relationship was best described by a logarithmic regression equation.The developmental trend of the transient potassium current may relate functionally to the progressive morphological changes, and the appearance of synaptic connections during ontogenesis.

Supermacroporous Polymer-Based Cryogel Bioreactor for Monoclonal Antibody Production in Continuous Culture Using Hybridoma Cells

Cryogel matrices composed of different polymeric blends were synthesized, yielding a unique combination of hydrophilicity and hydrophobicity with the presence or absence of charged surface. Four such cryogel matrices composed of polyacrylamide-chitosan (PAAC), poly(N-isopropylacrylamide)-chitosan, polyacrylonitrile (PAN), and poly(N-isopropylacrylamide) were tested for growth of different hybridoma cell lines and production of antibody in static culture. All the matrices were capable for the adherence of hybridoma cell lines 6A4D7, B7B10, and H9E10 to the polymeric surfaces as well as for the efficient monoclonal antibody (mAb) production. PAAC proved to be relatively better in terms of both mAb production and cell growth. Further, PAAC cryogel was designed into three different formats, monolith, disks, and beads, and used as packing material for packed-bed bioreactor. Longterm cultivation of 6A4D7 cell line on PAAC cryogel scaffold in all the three formats could be successfully done for a period of 6 weeks under static conditions. Continuous packed-bed bioreactor was setup using 6A4D7 hybridoma cell line in the three reactor formats. The reactors ran continuously for a period of 60 days during which mAb production and metabolism of cells in the bioreactors were monitored periodically. The monolith bioreactor performed most efficiently over a period of 60 days and produced a total of 57.5 mg of antibody in the first 30 days (in 500 mL) with a highest concentration of 115 mu g mL(-1), which is fourfold higher than t-flask culture. The results demonstrate that appropriate chemistry and geometry of the bioreactor matrix for cell growth and immobilization can enhance the reactor productivity. (C) 2010 American Institute of Chemical Engineers Biotechnol. Prog., 27: 170-180, 2011

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

On approximately universal schemes for two-hop networks

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

A model for tool-use traditions in primates: implications for the coevolution of culture and cognition

Inspired by the demonstration that tool-use variants among wild chimpanzees and orangutans qualify as traditions (or cultures), we developed a formal model to predict the incidence of these acquired specializations among wild primates and to examine the evolution of their underlying abilities. We assumed that the acquisition of the skill by an individual in a social unit is crucially controlled by three main factors, namely probability of innovation, probability of socially biased learning, and the prevailing social conditions (sociability, or number of potential experts at close proximity). The model reconfirms the restriction of customary tool use in wild primates to the most intelligent radiation, great apes; the greater incidence of tool use in more sociable populations of orangutans and chimpanzees; and tendencies toward tool manufacture among the most sociable monkeys. However, it also indicates that sociable gregariousness is far more likely to produce the maintenance of invented skills in a population than solitary life, where the mother is the only accessible expert. We therefore used the model to explore the evolution of the three key parameters. The most likely evolutionary scenario is that where complex skills contribute to fitness, sociability and/or the capacity for socially biased learning increase, whereas innovative abilities (i.e., intelligence) follow indirectly. We suggest that the evolution of high intelligence will often be a byproduct of selection on abilities for socially biased learning that are needed to acquire important skills, and hence that high intelligence should be most common in sociable rather than solitary organisms. Evidence for increased sociability during hominin evolution is consistent with this new hypothesis. (C) 2003 Elsevier Science Ltd. All rights reserved.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative 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 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.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks 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 DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. 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.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Network Coding for TCP Throughput Enhancement over a Multi-Hop wireless Network

The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance of TCP controlled bulk transfers over a chain topology multi-hop wireless network. The nodes use a CSMA/ CA mechanism, such as IEEE 802.11’s DCF, to perform distributed packet scheduling. The reverse flowing TCP ACKs are sought to be X-ORed with forward flowing TCP data packets. We find that, without any modification to theMAC protocol, the gain from network coding is negligible. The inherent coordination problem of carrier sensing based random access in multi-hop wireless networks dominates the performance. We provide a theoretical analysis that yields a throughput bound with network coding. We then propose a distributed modification of the IEEE 802.11 DCF, based on tuning the back-off mechanism using a feedback approach. Simulation studies show that the proposed mechanism when combined with network coding, improves the performance of a TCP session by more than 100%.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.