Optimizing deployment of multiple decoys to enhance ship survivability

In this paper we model a scenario where a ship uses decoys to evade a hostile torpedo. We address the problem of enhancing ship survivability against enemy torpedoes by using single and multiple decoy deployments. We incorporate deterministic ship maneuvers and realistic constraints on turn rates, field of view, etc in the model. We formulate the objective function to quantify and maximize the survivability of the ship in terms of maximizing the intercept time. We introduce the concept of optimal deployment regions, same side deployment, and zig-zag deployment strategies. Finally, we present simulation results.

Modeling Architecture-OS interactions using Layered Queuing Network Models

The prevalent virtualization technologies provide QoS support within the software layers of the virtual machine monitor(VMM) or the operating system of the virtual machine(VM). The QoS features are mostly provided as extensions to the existing software used for accessing the I/O device because of which the applications sharing the I/O device experience loss of performance due to crosstalk effects or usable bandwidth. In this paper we examine the NIC sharing effects across VMs on a Xen virtualized server and present an alternate paradigm that improves the shared bandwidth and reduces the crosstalk effect on the VMs. We implement the proposed hardwaresoftware changes in a layered queuing network (LQN) model and use simulation techniques to evaluate the architecture. We find that simple changes in the device architecture and associated system software lead to application throughput improvement of up to 60%. The architecture also enables finer QoS controls at device level and increases the scalability of device sharing across multiple virtual machines. We find that the performance improvement derived using LQN model is comparable to that reported by similar but real implementations.

Evolving Random Geometric Graph Models for Mobile Wireless Networks

We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes the stationary distribution of the node locations exponential. For this model we obtain the one-step conditional connectivity probabilities and extend it to the k-step case. Finite and asymptotic analysis are given. We then obtain the k-step connectivity probability conditioned on the network being disconnected. We also derive the pmf of the first passage time for a connected network to become disconnected. We then describe a random birth-death model where at each instant, the node locations evolve according to an AR(1) process. In addition, a random node is allowed to die while giving birth to a node at another location. We derive properties similar to those above.

Influence of Spatial Scales on the Performance of Saturated Subsurface Flow and Transport Models

Numerical modeling of saturated subsurface flow and transport has been widely used in the past using different numerical schemes such as finite difference and finite element methods. Such modeling often involves discretization of the problem in spatial and temporal scales. The choice of the spatial and temporal scales for a modeling scenario is often not straightforward. For example, a basin-scale saturated flow and transport analysis demands larger spatial and temporal scales than a meso-scale study, which in turn has larger scales compared to a pore-scale study. The choice of spatial-scale is often dictated by the computational capabilities of the modeler as well as the availability of fine-scale data. In this study, we analyze the impact of different spatial scales and scaling procedures on saturated subsurface flow and transport simulations.

Inverse models to analyze the spatiotemporal variations of chemical weathering fluxes in a granito-gneissic watershed: Mule Hole, South India

Water-rock reactions are driven by the influx of water, which are out of equilibrium with the mineral assemblage in the rock. Here a mass balance approach is adopted to quantify these reactions. Based on field experiments carried out in a granito-gneissic small experimental watershed (SEW), Mule Hole SEW (similar to 4.5 km(2)), quartz, oligoclase, sericite, epidote and chlorite are identified as the basic primary minerals while kaolinite, goethite and smectite are identified as the secondary minerals. Observed groundwater chemistry is used to determine the weathering rates, in terms of `Mass Transfer Coefficients' (MTCs), of both primary and secondary minerals. Weathering rates for primary and secondary minerals are quantified in two steps. In the first step, top red soil is analyzed considering precipitation chemistry as initial phase and water chemistry of seepage flow as final phase. In the second step, minerals present in the saprolite layer are analyzed considering groundwater chemistry as the output phase. Weathering rates thus obtained are converted into weathering fluxes (Q(weathering)) using the recharge quantity. Spatial variability in the mineralogy observed among the thirteen wells of Mule Hole SEW is observed to be reflected in the MTC results and thus in the weathering fluxes. Weathering rates of the minerals in this silicate system varied from few 10 mu mol/L (in case of biotite) to 1000 s of micromoles per liter (calcite). Similarly, fluxes of biotite are observed to be least (7 +/- 5 mol/ha/yr) while those of calcite are highest (1265 791 mol/ha/yr). Further, the fluxes determined annually for all the minerals are observed to be within the bandwidth of the standard deviation of these fluxes. Variations in these annual fluxes are indicating the variations in the precipitation. Hence, the standard deviation indicated the temporal variations in the fluxes, which might be due to the variations in the annual rainfall. Thus, the methodology adopted defines an inverse way of determining weathering fluxes, which mainly contribute to the groundwater concentration. (C) 2011 Elsevier B.V. All rights reserved.

Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.