Cooperative Regulation of NOTCH1 Protein-Phosphatidylinositol 3-Kinase (PI3K) Signaling by NOD1, NOD2, and TLR2 Receptors Renders Enhanced Refractoriness to Transforming Growth Factor-beta (TGF-beta)- or Cytotoxic T-lymphocyte Antigen 4 (CTLA-4)-mediated Impairment of Human Dendritic Cell Maturation

Dendritic cells (DCs) as sentinels of the immune system are important for eliciting both primary and secondary immune responses to a plethora of microbial pathogens. Cooperative stimulation of a complex set of pattern-recognition receptors, including TLR2 and nucleotide-binding oligomerization domain (NOD)-like receptors on DCs, acts as a rate-limiting factor in determining the initiation and mounting of the robust immune response. It underscores the need for ``decoding'' these multiple receptor interactions. In this study, we demonstrate that TLR2 and NOD receptors cooperatively regulate functional maturation of human DCs. Intriguingly, synergistic stimulation of TLR2 and NOD receptors renders enhanced refractoriness to TGF-beta- or CTLA-4-mediated impairment of human DC maturation. Signaling perturbation data suggest that NOTCH1-PI3K signaling dynamics assume critical importance in TLR2- and NOD receptor-mediated surmounting of CTLA-4- and TGF-beta -suppressed maturation of human DCs. Interestingly, the NOTCH1-PI3K signaling axis holds the capacity to regulate DC functions by virtue of PKC delta-MAPK-dependent activation of NF-kappa B. This study provides mechanistic and functional insights into TLR2-and NOD receptor-mediated regulation of DC functions and unravels NOTCH1-PI3K as a signaling cohort for TLR2 and NOD receptors. These findings serve in building a conceptual foundation for the design of improved strategies for adjuvants and immunotherapies against infectious diseases.

A Coalitional Game Framework for Cooperative Secondary Spectrum Access

We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.

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

Volume Change Behaviour of Soil Influenced with Sulfuric Acid

The paper brings out the role of calcium carbonate (CaCO3) on the volume change behaviour of natural black cotton soil with 1N sulfuric acid (H2SO4) as pore fluid. Natural black cotton soil contained predominantly montmorillonite [Ca0.2(Al,Mg)2Si4 O10 (OH)2 .4H2O] along with other minerals such as amesite [(Mg Fe)2 Al (Si Al)2 O5 (OH)4], kalsilite [KAlSiO4] and quartz [SiO2]. The calcitic soil, reacted with H2SO4 during consolidation testing, showed the presence of the new mineral yavapaiite [K Fe(SO4)2]. Consequently, the carbonate soil treated with 1N H2SO4 led to higher swell at seating load and more compression upon loading than the soil with no carbonate. The swelling increased with increase in the amount of carbonate present in the soil.

Volume Change behaviour in Calcitic Soil influenced with Sulphuric Acid using Artificial Neural Networks

This paper elucidates the methodology of applying artificial neural network model (ANNM) to predict the percent swell of calcitic soil in sulphuric acid solutions, a complex phenomenon involving many parameters. Swell data required for modelling is experimentally obtained using conventional oedometer tests under nominal surcharge. The phases in ANN include optimal design of architecture, operation and training of architecture. The designed optimal neural model (3-5-1) is a fully connected three layer feed forward network with symmetric sigmoid activation function and trained by the back propagation algorithm to minimize a quadratic error criterion.The used model requires parameters such as duration of interaction, calcite mineral content and acid concentration for prediction of swell. The observed strong correlation coefficient (R2 = 0.9979) between the values determined by the experiment and predicted using the developed model demonstrates that the network can provide answers to complex problems in geotechnical engineering.

Effect of non-plastic fines on cyclic behaviour of sandy soils

This paper presents the results of the detailed studies on stress - controlled cyclic triaxial tests on sandy soils from Ahmedabad, Gujarat, India subjected to a loading frequency of 0.1 Hz in cyclic triaxial equipment. Undrained stress controlled cyclic triaxial tests were carried out on cylindrical samples of size 50 mm diameter and height 100 mm with different cyclic stress ratios. Laboratory evaluations were carried out to compare the cyclic resistance of clean sand to that of sand with various fines contents at a constant gross void ratio. The gross void ratio considers the voids formed by sand particles and fines. The effects of gross void ratio with and without fines on pore water pressure build up and liquefaction potential of sandy soils in stress controlled tests are presented. The results obtained from this study provide direct evidence that the limiting silt content plays an important role in the cyclic resistance of sandy soils. Below the limiting silt content the cyclic resistance decreases until the limiting silt content is reached and then the cyclic resistance increases.

The Behaviour of Two-Phase Flow of DNAPL and Water through a Fractured Rock under Confining Pressure

This study presents the characterization of DNAPL and water flow in a fracture under confining pressure. A comprehensive mathematical model and the conditions under which DNAPL will enter an initially water-saturated deforming rock fracture are discussed. A numerical model with which to predict the quantity of each phase in terms of their saturations in deforming rock joint is developed. The effect of varying confining stresses on the traverse time of DNAPL across a fractured aquitard is studied. The sensitivity analysis for physical and hydraulic properties like initial fracture apertures, fracture dips, equivalent fracture aperture and confining pressures are performed and discussed.

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

On the fundamentally asynchronous nature of interference in cooperative base station systems

Cooperative transmission by base stations can significantly improve the spectral efficiency of multiuser, multi-cell multiple input multiple output systems. We show that in such systems the multiuser interference is asynchronous by nature, even when perfect timing-advance mechanisms ensure that the desired signal components arrive synchronously. We establish an accurate mathematical model for the asynchronism, and use it to show that the asynchronism leads to a significant performance degradation of existing linear preceding designs that assumed synchronous interference. We consider three different previously proposed precoding designs, and show how to modify them to effectively mitigate asynchronous interference.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.