Model-checking bisimulation-based information flow properties for infinite state sstems

Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.

Scalable flow-sensitive pointer analysis for fava with strong updates

The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.

Packet flow analysis in IP networks using data-flow analysis

Static analysis (aka offline analysis) of a model of an IP network is useful for understanding, debugging, and verifying packet flow properties of the network. Data-flow analysis is a method that has typically been applied to static analysis of programs. We propose a new, data-flow based approach for static analysis of packet flows in networks. We also investigate an application of our analysis to the problem of inferring a high-level policy from the network, which has been addressed in the past only for a single router.

Radiatively inefficient accretion flow simulations with cooling: implications for black hole transients

We study the effects of optically thin radiative cooling on the structure of radiatively inefficient accretion flows (RIAFs). The flow structure is geometrically thick, and independent of the gas density and cooling, if the cooling time is longer than the viscous time-scale (i.e. t(cool) greater than or similar to t(visc)). For higher densities, the gas can cool before it can accrete and forms the standard geometrically thin, optically thick Shakura-Sunyaev disc. For usual cooling processes (such as bremsstrahlung), we expect an inner hot flow and an outer thin disc. For a short cooling time the accretion flow separates into two phases: a radiatively inefficient hot coronal phase and a cold thin disc. We argue that there is an upper limit on the density of the hot corona corresponding to a critical value of t(cool)/t(ff)( similar to 10-100), the ratio of the cooling time and the free-fall time. Based on our simulations, we have developed a model for transients observed in black hole X-ray binaries (XRBs). An XRB in a quiescent hot RIAF state can transition to a cold blackbody-dominated state because of an increase in the mass accretion rate. The transition from a thin disc to a RIAF happens because of mass exhaustion due to accretion; the transition happens when the cooling time becomes longer than the viscous time at inner radii. Since the viscous time-scale for a geometrically thin disc is quite long, the high-soft state is expected to be long-lived. The different time-scales in black hole transients correspond to different physical processes such as viscous evolution, cooling and free fall. Our model captures the overall features of observed state transitions in XRBs.

MRT Letter: Light Sheet Based Imaging Flow Cytometry on a Microfluidic Platform

We propose a light sheet based imaging flow cytometry technique for simultaneous counting and imaging of cells on a microfluidic platform. Light sheet covers the entire microfluidic channel and thus omits the necessity of flow focusing and point scanning based technology. Another advantage lies in the orthogonal detection geometry that totally cuts-off the incident light, thereby substantially reducing the background in the detection. Compared to the existing state-of-art techniques the proposed technique shows marked improvement. Using fluorescently-coated Saccharomyces cerevisiae cells we have recorded cell counting with throughput as high as 2,090 cells/min in the low flow rate regime and were able to image the individual cells on-the-go. Overall, the proposed system is cost-effective and simple in channel geometry with the advantage of efficient counting in operational regime of low laminar flow. This technique may advance the emerging field of microfluidic based cytometry for applications in nanomedicine and point of care diagnostics. Microsc. Res. Tech. 76:1101-1107, 2013. (c) 2013 Wiley Periodicals, Inc.

Rack Level Modeling of Air Flow Through Perforated Tile in a Data Center

Effective air flow distribution through perforated tiles is required to efficiently cool servers in a raised floor data center. We present detailed computational fluid dynamics (CFD) modeling of air flow through a perforated tile and its entrance to the adjacent server rack. The realistic geometrical details of the perforated tile, as well as of the rack are included in the model. Generally, models for air flow through perforated tiles specify a step pressure loss across the tile surface, or porous jump model based on the tile porosity. An improvement to this includes a momentum source specification above the tile to simulate the acceleration of the air flow through the pores, or body force model. In both of these models, geometrical details of tile such as pore locations and shapes are not included. More details increase the grid size as well as the computational time. However, the grid refinement can be controlled to achieve balance between the accuracy and computational time. We compared the results from CFD using geometrical resolution with the porous jump and body force model solution as well as with the measured flow field using particle image velocimetry (PIV) experiments. We observe that including tile geometrical details gives better results as compared to elimination of tile geometrical details and specifying physical models across and above the tile surface. A modification to the body force model is also suggested and improved results were achieved.

Joint Evaluation of Reduced Feedback Scheme, Scheduling, and Rate Adaptation in OFDMA Systems with Feedback Delays

Orthogonal frequency division multiple access (OFDMA) systems exploit multiuser diversity and frequency-selectivity to achieve high spectral efficiencies. However, they require considerable feedback for scheduling and rate adaptation, and are sensitive to feedback delays. We develop a comprehensive analysis of the OFDMA system throughput as a function of the feedback scheme, frequency-domain scheduler, and discrete rate adaptation rule in the presence of feedback delays. We analyze the popular best-n and threshold-based feedback schemes. We show that for both the greedy and round-robin schedulers, the throughput degradation, given a feedback delay, depends primarily on the fraction of feedback reduced by the feedback scheme and not the feedback scheme itself. Even small feedback delays at low vehicular speeds are shown to significantly degrade the throughput. We also show that optimizing the link adaptation thresholds as a function of the feedback delay can effectively counteract the detrimental effect of delays.

Joint Routing, Scheduling and Power Control in Multihop MIMO Networks with MAC and Broadcast Links

We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We focus on exploiting the multiple degrees-of-freedom available at each transmitter and receiver due to multiple antennas. Specifically we use multiple antennas at each node to form multiple access and broadcast links in the network rather than just point to point links. We show that such a generic transmission model improves the system performance significantly. Since the complexity of the resulting optimization problem is very high, we also develop efficient suboptimal solutions for joint routing, scheduling and power control in this setup.

Scheduling for Fading Channels Under Partial Channel Information

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughput-optimal policy for the network under QoS constraints when real-time and rate-guaranteed data traffic may be present.

Constraining complex aquifer geometry with geophysics (2-D ERT and MRS measurements) for stochastic modelling of groundwater flow

Stochastic modelling is a useful way of simulating complex hard-rock aquifers as hydrological properties (permeability, porosity etc.) can be described using random variables with known statistics. However, very few studies have assessed the influence of topological uncertainty (i.e. the variability of thickness of conductive zones in the aquifer), probably because it is not easy to retrieve accurate statistics of the aquifer geometry, especially in hard rock context. In this paper, we assessed the potential of using geophysical surveys to describe the geometry of a hard rock-aquifer in a stochastic modelling framework. The study site was a small experimental watershed in South India, where the aquifer consisted of a clayey to loamy-sandy zone (regolith) underlain by a conductive fissured rock layer (protolith) and the unweathered gneiss (bedrock) at the bottom. The spatial variability of the thickness of the regolith and fissured layers was estimated by electrical resistivity tomography (ERT) profiles, which were performed along a few cross sections in the watershed. For stochastic analysis using Monte Carlo simulation, the generated random layer thickness was made conditional to the available data from the geophysics. In order to simulate steady state flow in the irregular domain with variable geometry, we used an isoparametric finite element method to discretize the flow equation over an unstructured grid with irregular hexahedral elements. The results indicated that the spatial variability of the layer thickness had a significant effect on reducing the simulated effective steady seepage flux and that using the conditional simulations reduced the uncertainty of the simulated seepage flux. As a conclusion, combining information on the aquifer geometry obtained from geophysical surveys with stochastic modelling is a promising methodology to improve the simulation of groundwater flow in complex hard-rock aquifers. (C) 2013 Elsevier B.V. All rights reserved.

On the k(1)(-1) scaling in sink-flow turbulent boundary layers

Scaling of the streamwise velocity spectrum phi(11)(k(1)) in the so-called sink-flow turbulent boundary layer is investigated in this work. The present experiments show strong evidence for the k(1)(-1) scaling i.e. phi(11)(k(1)) = Lambda(1)U(tau)(2)k(1)(-1), where k(1)(-1) is the streamwise wavenumber and U-tau is the friction velocity. Interestingly, this k(1)(-1) scaling is observed much farther from the wall and at much lower flow Reynolds number (both differing by almost an order of magnitude) than what the expectations from experiments on a zero-pressure-gradient turbulent boundary layer flow would suggest. Furthermore, the coefficient A(1) in the present sink-flow data is seen to be non-universal, i.e. A(1) varies with height from the wall; the scaling exponent -1 remains universal. Logarithmic variation of the so-called longitudinal structure function, which is the physical-space counterpart of spectral k(1)(-1) scaling, is also seen to be non-universal, consistent with the non-universality of A(1). These observations are to be contrasted with the universal value of A(1) (along with the universal scaling exponent of 1) reported in the literature on zero-pressure-gradient turbulent boundary layers. Theoretical arguments based on dimensional analysis indicate that the presence of a streamwise pressure gradient in sink-flow turbulent boundary layers makes the coefficient A(1) non-universal while leaving the scaling exponent -1 unaffected. This effect of the pressure gradient on the streamwise spectra, as discussed in the present study (experiments as well as theory), is consistent with other recent studies in the literature that are focused on the structural aspects of turbulent boundary layer flows in pressure gradients (Harun etal., J. Flui(d) Mech., vol. 715, 2013, pp. 477-498); the present paper establishes the link between these two. The variability of A(1) accommodated in the present framework serves to clarify the ideas of universality of the k(1)(-1) scaling.

Joint Scheduling & Jamming for Data Secrecy in Wireless Networks

The broadcast nature of the wireless medium jeopardizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capability; however, it can be assured from information theoretic security approaches. We use physical layer security to guarantee non-zero secrecy rate in single source, single destination multi-hop networks with eavesdroppers for two cases: when eavesdropper locations and channel gains are known and when their positions are unknown. We propose a two-phase solution which consists of finding activation sets and then obtaining transmit powers subject to SINR constraints for the case when eavesdropper locations are known. We introduce methods to find activation sets and compare their performance. Necessary but reasonable approximations are made in power minimization formulations for tractability reasons. For scenarios with no eavesdropper location information, we suggest vulnerability region (the area having zero secrecy rate) minimization over the network. Our results show that in the absence of location information average number of eavesdroppers who have access to data is reduced.

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Flow resistance network analysis of the back-pressure of automotive mufflers

Complexity of mufflers generally introduces considerable pressure drop, which affects the engine performance adversely. Not much literature is available for pressure drop across perforates. In this paper, the stagnation pressure drop across perforated muffler elements has been measured experimentally and generalized expressions have been developed for the pressure loss across cross-flow expansion and cross-flow contraction elements. A flow resistance model available in the literature has been made use of to analytically determine the flow distribution and thereby the pressure drop of mufflers. A generalized expression has been derived here for evaluation of the equivalent flow resistance for parallel flow paths. Expressions for flow resistance across perforated elements, derived by means of flow experiments, have been implemented in the flow resistance network. The results have been validated with experimental data. Thus, the newly developed integrated flow resistance networks would enable us to determine the normalized stagnation pressure drop of commercial automotive mufflers, thus enabling an efficient flow-acoustic design of silencing systems.