Phytoplankton size structure in the southern Bay of Bengal modified by the Summer Monsoon Current and associated eddies: Implications on the vertical biogenic flux

The present study combines field and satellite observations to investigate how hydrographical transformations influence phytoplankton size structure in the southern Bay of Bengal during the peak Southwest Monsoon/Summer Monsoon (July-August). The intrusion of the Summer Monsoon Current (SMC) into the Bay of Bengal and associated changes in sea surface chemistry, traceable eastward up to 90 degrees E along 8 degrees N, seems to influence biology of the region significantly. Both in situ and satellite (MODIS) data revealed low surface chlorophyll except in the area influenced by the SMC During the study period, two well-developed cydonic eddies (north) and an anti-cyclonic eddy (south), closely linked to the main eastward flow of the SMC, were sampled. Considering the capping effect of the low-saline surface water that is characteristic of the Bay of Bengal, the impact of the cyclonic eddy, estimated in terms of enhanced nutrients and chlorophyll, was mostly restricted to the subsurface waters (below 20 m depth). Conversely, the anti-cyclonic eddy aided by the SMC was characterized by considerably higher nutrient concentration and chlorophyll in the upper water column (upper 60 m), which was contrary to the general characteristic of such eddies. Albeit smaller phytoplankton predominated the southern Bay of Bengal (60-95% of the total chlorophyll), the contribution of large phytoplankton was double in the regions influenced by the SMC and associated eddies. Multivariate analysis revealed the extent to which SMC-associated eddies spatially influence phytoplankton community structure. The study presents the first direct quantification of the size structure of phytoplankton from the southern Bay of Bengal and demonstrates that the SMC-associated hydrographical ramifications significantly increase the phytoplankton biomass contributed by larger phytoplankton and thereby influence the vertical opal and organic carbon flux in the region. (C) 2014 Elsevier B.V. All rights reserved.

Hydrodynamic instability and shear layer effect on the response of an acoustically excited laminar premixed flame

Combustion instabilities can cause serious problems which limit the operating envelope of low-emission lean premixed combustion systems. Predicting the onset of combustion instability requires a description of the unsteady heat release driving the instability, i.e., the heat release response transfer function of the system. This study focuses on the analysis of fully coupled two-way interactions between a disturbance field and a laminar premixed flame that incorporates gas expansion effects by solving the conservation equations of a compressible fluid. Results of the minimum and maximum flame front deflections are presented to underline the impact of the hydrodynamic instability on the flame and the shear layer effect on the initial flame front wrinkling which is increased at decreasing gas expansion. These phenomena influence the magnitude of the burning area and burning area rate response of the flame at lower frequency excitation more drastically than reduced-order model (ROM) predictions even for low temperature ratios. It is shown that the general trend of the flame response magnitudes can be well captured at higher frequency excitation, where stretch effects are dominant. The phase response is influenced by the DL mechanism, which cannot be captured by the ROM, and by the resulting discrepancy in the flame pocket formation and annihilation process at the flame tip. (C) 2014 The Combustion Institute. Published by Elsevier Inc. All rights reserved,

Effects of Withania somnifera and Tinospora cordifolia Extracts on the Side Population Phenotype of Human Epithelial Cancer Cells: Toward Targeting Multidrug Resistance in Cancer

Recent reports suggest the existence of a subpopulation of stem-like cancer cells, termed as cancer stem cells (CSCs), which bear functional and phenotypic resemblance with the adult, tissue-resident stem cells. Side population (SP) assay based on differential efflux of Hoechst 33342 has been effectively used for the isolation of CSCs. The drug resistance properties of SP cells are typically due to the increased expression of ABC transporters leading to drug efflux. Conventionally used chemotherapeutic drugs may often leads to an enrichment of SP, revealing their inability to target the drug-resistant SP and CSCs. Thus, identification of agents that can reduce the SP phenotype is currently in vogue in cancer therapeutics. Withania somnifera (WS) and Tinospora cordifolia (TC) have been used in Ayurveda for treating various diseases, including cancer. In the current study, we have investigated the effects of ethanolic (ET) extracts of WS and TC on the cancer SP phenotype. Interestingly, we found significant decrease in SP on treatment with TC-ET, but not with WS-ET. The SP-inhibitory TC-ET was further fractionated into petroleum ether (TC-PET), dichloromethane (TC-DCM), and n-butyl alcohol (TC-nBT) fractions using bioactivity-guided fractionation. Our data revealed that TC-PET and TC-DCM, but not TC-nBT, significantly inhibited SP in a dose-dependent manner. Furthermore, flow cytometry-based functional assays revealed that TC-PET and TC-DCM significantly inhibited ABC-B1 and ABC-G2 transporters and sensitized cancer cells toward chemotherapeutic drug-mediated cytotoxicity. Thus, the TC-PET and TC-DCM may harbor phytochemicals with the potential to reverse the drug-resistant phenotype, thus improving the efficacy of cancer chemotherapy.

Dependence of shear yield strain and shear transformation zone on the glass transition temperature in thin film metallic glasses

The dependence of shear yield strain, the activation energy and volume of shear transformation zone on the glass transition temperature was investigated through the analysis of statistical distributions of the first pop-in events during spherical indentation of four different thin film metallic glasses. Only the Cu-Zr metallic glass exhibits a bimodal distribution of the first pop-in loads, whereas W-Ru-B, Zr-Cu-Ni-Al and La-Co-Al metallic glasses show an unimodal distribution. Results show that shear yield strain and activation energy of shear transformation zone decrease whereas the volume of shear transformation zone increases with increasing homologous temperature, indicating that it is the activation energy rather than the volume of shear transformation zone that controls shear yield strain. (C) 2015 Elsevier B.V. All rights reserved.

Comparison of Convective and Radiative Heating Modes on the Thermophysical Changes of a Cerium Nitrate Droplet

In this paper, we try to establish the equivalence or similarity in the thermal and physiochemical changes in precursor droplets (cerium nitrate) in convective and radiative fields. The radiative field is created through careful heating of the droplet using a monochromatic light source (CO2 laser). The equivalence is also established for different modes of convection like droplet injected into a high-speed flow and droplet experiencing a convective flow due to acoustic streaming (levitated) only. The thermophysical changes are studied in an aqueous cerium nitrate droplet, and the dissociation of cerium nitrate to ceria is modeled using modified Kramers' reaction rate formulation. It is observed that vaporization, species accumulation, and chemical characteristics obtained in a convectively heated droplet are retained in a radiatively heated droplet by careful adjustment of the laser intensity. The timescales and ceria yield match reasonably well for both the cases. It is also noted that similar conclusions are drawn in both levitated droplet and a nonlevitated droplet.

On the diversity and complexity of Zero Forcing receivers for MIMO Zero Padded systems

Zero padded systems with linear receivers are shown to be robust and amenable to fast implementations in single antenna scenarios. In this paper, properties of such systems are investigated when multiple antennas are present at both ends of the communication link. In particular, their diversity and complexity are evaluated for precoded transmissions. The linear receivers are shown to exploit multipath and receive diversities, even in the absence of any coding at the transmitter. Use of additional redundancy to improve performance is considered and the effect of transmission rate on diversity order is analyzed. Low complexity implementations of Zero Forcing receivers are devised to further enhance their applicability.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

On the complexity of finding stopping set size in Tanner Graphs

The problem of determining whether a Tanner graph for a linear block code has a stopping set of a given size is shown to be NT-complete.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Status of the MSSM Higgs sector using global analysis and direct search bounds, and future prospects at the High Luminosity LHC

In this paper, we search for the regions of the phenomenological minimal supersymmetric standard model (pMSSM) parameter space where one can expect to have moderate Higgs mixing angle (alpha) with relatively light (up to 600 GeV) additional Higgses after satisfying the current LHC data. We perform a global fit analysis using most updated data (till December 2014) from the LHC and Tevatron experiments. The constraints coming from the precision measurements of the rare b-decays B-s -> mu(+)mu(-) and b -> s gamma are also considered. We find that low M-A(less than or similar to 350) and high tan beta(greater than or similar to 25) regions are disfavored by the combined effect of the global analysis and flavor data. However, regions with Higgs mixing angle alpha similar to 0.1-0.8 are still allowed by the current data. We then study the existing direct search bounds on the heavy scalar/pseudoscalar (H/A) and charged Higgs boson (H-+/-) masses and branchings at the LHC. It has been found that regions with low to moderate values of tan beta with light additional Higgses (mass <= 600 GeV) are unconstrained by the data, while the regions with tan beta > 20 are excluded considering the direct search bounds by the LHC-8 data. The possibility to probe the region with tan beta <= 20 at the high luminosity run of LHC are also discussed, giving special attention to the H -> hh, H/A -> t (t) over bar and H/A -> tau(+)tau(-) decay modes.

On the Capacity and Performance of Generalized Spatial Modulation

Generalized spatial modulation (GSM) uses N antenna elements but fewer radio frequency (RF) chains (R) at the transmitter. In GSM, apart from conveying information bits through R modulation symbols, information bits are also conveyed through the indices of the R active transmit antennas. In this letter, we derive lower and upper bounds on the the capacity of a (N, M, R)-GSM MIMO system, where M is the number of receive antennas. Further, we propose a computationally efficient GSM encoding method and a message passing-based low-complexity detection algorithm suited for large-scale GSM-MIMO systems.