Multi-UAV Task Allocation using Team Theory

A multiple UAV search and attack mission in a battlefield involves allocating UAVs to different target tasks efficiently. This task allocation becomes difficult when there is no communication among the UAVs and the UAVs sensors have limited range to detect the targets and neighbouring UAVs, and assess target status. In this paper, we propose a team theoretic approach to efficiently allocate UAVs to the targets with the constraint that UAVs do not communicate among themselves and have limited sensor range. We study the performance of team theoretic approach for task allocation on a battle field scenario. The performance obtained through team theory is compared with two other methods, namely, limited sensor range but with communication among all the UAVs, and greedy strategy with limited sensor range and no communication. It is found that the team theoretic strategy performs the best even though it assumes limited sensor range and no communication.

Low loss and frequency (1 kHz–1 MHz) independent dielectric characteristics of 3BaO–3TiO2–B2O3 glasses

X-ray powder diffraction along with differential thermal analysis carried out on the as-quenched samples in the 3BaO–3TiO2–B2O3 system confirmed their amorphous and glassy nature, respectively. The dielectric constants in the 1 kHz–1 MHz frequency range were measured as a function of temperature (323–748 K). The dielectric constant and loss were found to be frequency independent in the 323–473 K temperature range. The temperature coefficient of dielectric constant was estimated using Havinga’s formula and found to be 16 ppm K−1. The electrical relaxation was rationalized using the electric modulus formalism. The dielectric constant and loss were 17±0.5 and 0.005±0.001, respectively at 323 K in the 1 kHz–1 MHz frequency range which may be of considerable interest to capacitor industry.

Cooperative Profit Sharing in Coalition-Based Resource Allocation in Wireless Networks

We consider a network in which several service providers offer wireless access to their respective subscribed customers through potentially multihop routes. If providers cooperate by jointly deploying and pooling their resources, such as spectrum and infrastructure (e.g., base stations) and agree to serve each others' customers, their aggregate payoffs, and individual shares, may substantially increase through opportunistic utilization of resources. The potential of such cooperation can, however, be realized only if each provider intelligently determines with whom it would cooperate, when it would cooperate, and how it would deploy and share its resources during such cooperation. Also, developing a rational basis for sharing the aggregate payoffs is imperative for the stability of the coalitions. We model such cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition, deployment, and allocation of the channels and base stations (to customers), can be computed as the solution of a concave or an integer optimization. We next show that the grand coalition is stable in many different settings, i.e., if all providers cooperate, there is always an operating point that maximizes the providers' aggregate payoff, while offering each a share that removes any incentive to split from the coalition. The optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time by respectively solving the primals and the duals of the above optimizations, using distributed computations and limited exchange of confidential information among the providers. Numerical evaluations reveal that cooperation substantially enhances individual providers' payoffs under the optimal cooperation strategy and several different payoff sharing rules.

Improved algorithm for optimum reactive power allocation

An improvised algorithm is presented for optimal VAr allocation in a large power system using a linear programming technique. The proposed method requires less computer memory than those algorithms currently available.

Glycodelin-A interferes with IL-2/IL-2R signalling to induce cell growth arrest, loss of effector functions and apoptosis in T-lymphocytes

The progesterone-regulated glycoprotein glycodelin-A (GdA), secreted by the decidualized endometrium at high concentrations in primates, inhibits the maternal immune response against fetal antigens and thereby contributes to the tolerance of the semi-allogenic fetus during a normal pregnancy. Our earlier studies demonstrated the ability of GdA to induce an intrinsic apoptotic cascade in CD4 T-lymphocytes and suppress the cytolytic effector function of CD8 T-lymphocytes. In this report, we investigated further into the mechanism of action of GdA controlling perforin and granzyme B expression in CD8 T-lymphocytes and the mechanism of action of GdA leading to lymphocyte death. Flow cytometry analysis was performed to check for the surface expression of interleukin-2 receptor (IL-2R) and intracellular eomesodermin (Eomes) in activated T-lymphocytes, whereas quantitative RTPCR analysis was used to find out their mRNA profile upon GdA treatment. Western analysis was carried out to confirm the protein level of Bax and Bcl-2. GdA reduces the surface expression of the high-affinity IL-2R complex by down-regulating the synthesis of IL-2R (CD25). This disturbs the optimal IL-2 signalling and decreases the Eomes expression, which along with IL-2 directly regulates perforin and granzymes expression. Consequently, the CD8 T-lymphocytes undergo growth arrest and are unable to mature into competent cytotoxic T-lymphocytes. In the CD4 T-lymphocytes, growth factor IL-2 deprivation leads to proliferation inhibition, decreased Bcl-2/enhanced Bax expression, culminating in mitochondrial stress and cell death. GdA spurs cell cycle arrest, loss of effector functions and apoptosis in different T-cell subsets by making T-lymphocytes unable to respond to IL-2.

Basic principles of ultrafast Raman loss spectroscopy

When a light beam passes through any medium, the effects of interaction of light with the material depend on the field intensity. At low light intensities the response of materials remain linear to the amplitude of the applied electromagnetic field. But for sufficiently high intensities, the optical properties of materials are no longer linear to the amplitude of applied electromagnetic field. In such cases, the interaction of light waves with matter can result in the generation of new frequencies due to nonlinear processes such as higher harmonic generation and mixing of incident fields. One such nonlinear process, namely, the third order nonlinear spectroscopy has become a popular tool to study molecular structure. Thus, the spectroscopy based on the third order optical nonlinearity called stimulated Raman spectroscopy (SRS) is a tool to extract the structural and dynamical information about a molecular system. Ultrafast Raman loss spectroscopy (URLS) is analogous to SRS but is more sensitive than SRS. In this paper, we present the theoretical basis of SRS (URLS) techniques which have been developed in our laboratory.

Development of a composite material with high magnetic permeability and low loss factor for high frequency application

A flexible composite suitable for MHz frequency application has been developed by combining Fe3O4 and polyvinyl alcohol (PVA). The loss factor and the permeability have been evaluated. At an optimum weight percentage of Fe3O4 in the PVA matrix, the frequency at which the loss factor gives a minimum shifts to the MHz region. The loss factor has been found to be lower by one order of magnitude at 70 MHz compared to the presently used nickel zinc ferrite. The Henkel plot and the Cole-Cole plot have been obtained for the understanding of the high magnetic permeability and the low loss factor. (C) 2012 American Institute of Physics. doi:10.1063/1.3672867]

Mining sentiments from songs using latent dirichlet allocation

Song-selection and mood are interdependent. If we capture a song’s sentiment, we can determine the mood of the listener, which can serve as a basis for recommendation systems. Songs are generally classified according to genres, which don’t entirely reflect sentiments. Thus, we require an unsupervised scheme to mine them. Sentiments are classified into either two (positive/negative) or multiple (happy/angry/sad/...) classes, depending on the application. We are interested in analyzing the feelings invoked by a song, involving multi-class sentiments. To mine the hidden sentimental structure behind a song, in terms of “topics”, we consider its lyrics and use Latent Dirichlet Allocation (LDA). Each song is a mixture of moods. Topics mined by LDA can represent moods. Thus we get a scheme of collecting similar-mood songs. For validation, we use a dataset of songs containing 6 moods annotated by users of a particular website.

A constellation power allocation scheme for two-user Gaussian MAC

Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple Access Channels (GMAC) have been recently reported, wherein introducing appropriate rotation between the constellations of the two users is shown to maximally enlarge the CC capacity region. Such a Non-Orthogonal Multiple Access (NO-MA) method of enlarging the CC capacity region is referred to as Constellation Rotation (CR) scheme. In this paper, we propose a novel NO-MA technique called Constellation Power Allocation (CPA) scheme to enlarge the CC capacity region of two-user GMAC. We show that the CPA scheme offers CC sum capacities equal (at low SNR values) or close (at high SNR values) to those offered by the CR scheme with reduced ML decoding complexity for some QAM constellations. For the CR scheme, code pairs approaching the CC sum capacity are known only for the class of PSK and PAM constellations but not for QAM constellations. In this paper, we design code pairs with the CPA scheme to approach the CC sum capacity for 16-QAM constellations. Further, the CPA scheme used for two-user GMAC with random phase offsets is shown to provide larger CC sum capacities at high SNR values compared to the CR scheme.

Dramatic Structural Changes Resulting from the Loss of a Crucial Hydrogen Bond in the Hinge Region Involved in C-Terminal Helix Swapping in SurE: A Survival Protein from Salmonella typhimurium

Domain swapping is an interesting feature of some oligomeric proteins in which each protomer of the oligomer provides an identical surface for exclusive interaction with a segment or domain belonging to another protomer. Here we report results of mutagenesis experiments on the structure of C-terminal helix swapped dimer of a stationary phase survival protein from Salmonella typhimurium (StSurE). Wild type StSurE is a dimer in which a large helical segment at the C-terminus and a tetramerization loop comprising two beta strands are swapped between the protomers. Key residues in StSurE that might promote C-terminal helix swapping were identified by sequence and structural comparisons. Three mutants in which the helix swapping is likely to be avoided were constructed and expressed in E. coli. Three-dimensional X-ray crystal structures of the mutants H234A and D230A/H234A could be determined at 2.1 angstrom and 2.35 angstrom resolutions, respectively. Contrary to expectations, helix swapping was mostly retained in both the mutants. The loss of the crucial D230 OD2- H234 NE2 hydrogen bond (2.89 angstrom in the wild type structure) in the hinge region was compensated by new inter and intra-chain interactions. However, the two fold molecular symmetry was lost and there were large conformational changes throughout the polypeptide. In spite of these changes, the dimeric structure and an approximate tetrameric organization were retained, probably due to the interactions involving the tetramerization loop. Mutants were mostly functionally inactive, highlighting the importance of precise inter-subunit interactions for the symmetry and function of StSurE.

A dynamic bandwidth allocation scheme for interactive multimedia applications over cellular networks

Cellular networks played key role in enabling high level of bandwidth for users by employing traditional methods such as guaranteed QoS based on application category at radio access stratum level for various classes of QoSs. Also, the newer multimode phones (e.g., phones that support LTE (Long Term Evolution standard), UMTS, GSM, WIFI all at once) are capable to use multiple access methods simulta- neously and can perform seamless handover among various supported technologies to remain connected. With various types of applications (including interactive ones) running on these devices, which in turn have different QoS requirements, this work discusses as how QoS (measured in terms of user level response time, delay, jitter and transmission rate) can be achieved for interactive applications using dynamic bandwidth allocation schemes over cellular networks. In this work, we propose a dynamic bandwidth allocation scheme for interactive multimedia applications with/without background load in the cellular networks. The system has been simulated for many application types running in parallel and it has been observed that if interactive applications are to be provided with decent response time, a periodic overhauling of policy at admission control has to be done by taking into account history, criticality of applications. The results demonstrate that interactive appli- cations can be provided with good service if policy database at admission control is reviewed dynamically.

A Huber-loss-driven clustering technique and its application to robust cell detection in confocal microscopy images

We address the problem of detecting cells in biological images. The problem is important in many automated image analysis applications. We identify the problem as one of clustering and formulate it within the framework of robust estimation using loss functions. We show how suitable loss functions may be chosen based on a priori knowledge of the noise distribution. Specifically, in the context of biological images, since the measurement noise is not Gaussian, quadratic loss functions yield suboptimal results. We show that by incorporating the Huber loss function, cells can be detected robustly and accurately. To initialize the algorithm, we also propose a seed selection approach. Simulation results show that Huber loss exhibits better performance compared with some standard loss functions. We also provide experimental results on confocal images of yeast cells. The proposed technique exhibits good detection performance even when the signal-to-noise ratio is low.

Loss ratio of the EDF scheduling policy with early discarding technique

This paper considers a firm real-time M/M/1 system, where jobs have stochastic deadlines till the end of service. A method for approximately specifying the loss ratio of the earliest-deadline-first scheduling policy along with exit control through the early discarding technique is presented. This approximation uses the arrival rate and the mean relative deadline, normalized with respect to the mean service time, for exponential and uniform distributions of relative deadlines. Simulations show that the maximum approximation error is less than 4% and 2% for the two distributions, respectively, for a wide range of arrival rates and mean relative deadlines. (C) 2013 Elsevier B.V. All rights reserved.

A Novel Power Allocation Scheme for Two-User GMAC with Finite Input Constellations

Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple Access Channels (GMAC) have been recently reported, wherein an appropriate angle of rotation between the constellations of the two users is shown to enlarge the CC capacity region. We refer to such a scheme as the Constellation Rotation (CR) scheme. In this paper, we propose a novel scheme called the Constellation Power Allocation (CPA) scheme, wherein the instantaneous transmit power of the two users are varied by maintaining their average power constraints. We show that the CPA scheme offers CC sum capacities equal (at low SNR values) or close (at high SNR values) to those offered by the CR scheme with reduced decoding complexity for QAM constellations. We study the robustness of the CPA scheme for random phase offsets in the channel and unequal average power constraints for the two users. With random phase offsets in the channel, we show that the CC sum capacity offered by the CPA scheme is more than the CR scheme at high SNR values. With unequal average power constraints, we show that the CPA scheme provides maximum gain when the power levels are close, and the advantage diminishes with the increase in the power difference.