On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

EXPERIMENTAL INVESTIGATION OF UNSTEADY FLOW IN A TRANSONIC UNI-STAGE AXIAL COMPRESSOR

Detailed steady and unsteady experimental measurements and analysis were performed on a Single stage Transonic Axial Compressor with asymmetric rotor tip clearance for studying the compressor stall phenomena. The installed compressor had asymmetric tip clearance around the rotor casing varying from about 0.65mm to 1.25mm. A calibrated 5-hole aerodynamic probe was traversed radially at exit of rotor and showed the characteristics of increased flow angle at lower mass flow rates for all the speeds. Mach number distribution and boundary layer effects were also clearly captured. Unsteady measurements for velocity were carried out to study the stall cell behavior using a single component calibrated hotwire probe oriented in axial and tangential directions for choke/free flow and near stall conditions. The hotwire probe was traversed radially across the annulus at inlet to the compressor and showed that the velocity fluctuations were dissimilar when probe was aligned axial and tangential to the flow. Averaged velocities across the annulus showed the reduction in velocity as stall was approached. Axial mean flow velocity decreased across the annulus for all the speeds investigated. Tangential velocity at free flow condition was higher at the tip region due to larger radius. At stall condition, the tangential velocity showed decreased velocities at the tip and slightly increased velocities at the hub section indicating that the flow has breakdown at the tip region of the blade and fluid is accelerated below the blockage zone. The averaged turbulent intensity in axial and tangential flow directions increased from free flow to stall condition for all compressor rated speeds. Fast Fourier Transform (FFT) of the raw signals at stall flow condition showed stall cell and its corresponding frequency of occurrence. The stalling frequency of about half of rotational speed of the rotor along with large tip clearance suggests that modal type stall inception was occurring.

Molecular Dynamics Study of the Structure, Flexibility, and Hydrophilicity of PETIM Dendrimers: A Comparison with PAMAM Dendrimers

A new class of dendrimers, the poly(propyl ether imine) (PETIM) dendrimer, has been shown to be a novel hyperbranched polymer having potential applications as a drug delivery vehicle. Structure and dynamics of the amine terminated PETIM dendrimer and their changes with respect to the dendrimer generation are poorly understood. Since most drugs are hydrophobic in nature, the extent of hydrophobicity of the dendrimer core is related to its drug encapsulation and retention efficacy. In this study, we carry out fully atomistic molecular dynamics (MD) simulations to characterize the structure of PETIM (G2-G6) dendrimers in salt solution as a function of dendrimer generation at different protonation levels. Structural properties such as radius of gyration (R-g), radial density distribution, aspect ratio, and asphericity are calculated. In order to assess the hydrophilicity of the dendrimer, we compute the number of bound water molecules in the interior of dendrirner as well as the number of dendrimer-water hydrogen bonds. We conclude that PETIM dendrimers have relatively greater hydrophobicity and flexibility when compared with their extensively investigated PAMAM counterparts. Hence PETIM dendrimers are expected to have stronger interactions with lipid membranes as well as improved drug encapsulation and retention properties when compared with PAMAM dendrimers. We compute the root-mean-square fluctuation of dendrimers as well as their entropy to quantify the flexibility of the dendrimer. Finally we note that structural and solvation properties computed using force field parameters derived based on the CHARMM general purpose force field were in good quantitative agreement with those obtained using the generalized Amber force field (GAFF).

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

A mean-reverting stochastic model for the political business cycle

In this article, we look at the political business cycle problem through the lens of uncertainty. The feedback control used by us is the famous NKPC with stochasticity and wage rigidities. We extend the New Keynesian Phillips Curve model to the continuous time stochastic set up with an Ornstein-Uhlenbeck process. We minimize relevant expected quadratic cost by solving the corresponding Hamilton-Jacobi-Bellman equation. The basic intuition of the classical model is qualitatively carried forward in our set up but uncertainty also plays an important role in determining the optimal trajectory of the voter support function. The internal variability of the system acts as a base shifter for the support function in the risk neutral case. The role of uncertainty is even more prominent in the risk averse case where all the shape parameters are directly dependent on variability. Thus, in this case variability controls both the rates of change as well as the base shift parameters. To gain more insight we have also studied the model when the coefficients are time invariant and studied numerical solutions. The close relationship between the unemployment rate and the support function for the incumbent party is highlighted. The role of uncertainty in creating sampling fluctuation in this set up, possibly towards apparently anomalous results, is also explored.

Photometric metallicity map of the Large Magellanic Cloud

We have estimated a metallicity map of the Large Magellanic Cloud (LMC) using the Magellanic Cloud Photometric Survey (MCPS) and Optical Gravitational Lensing Experiment (OGLE III) photometric data. This is a first of its kind map of metallicity up to a radius of 4 degrees-5 degrees, derived using photometric data and calibrated using spectroscopic data of Red Giant Branch (RGB) stars. We identify the RGB in the V, (V - I) colour-magnitude diagrams of small subregions of varying sizes in both data sets. We use the slope of the RGB as an indicator of the average metallicity of a subregion, and calibrate the RGB slope to metallicity using spectroscopic data for field and cluster red giants in selected subregions. The average metallicity of the LMC is found to be Fe/H] = -0.37 dex (sigmaFe/H] = 0.12) from MCPS data, and Fe/H] = -0.39 dex (sigmaFe/H] = 0.10) from OGLE III data. The bar is found to be the most metal-rich region of the LMC. Both the data sets suggest a shallow radial metallicity gradient up to a radius of 4 kpc (-0.049 +/- 0.002 dex kpc(-1) to -0.066 +/- 0.006 dex kpc(-1)). Subregions in which the mean metallicity differs from the surrounding areas do not appear to correlate with previously known features; spectroscopic studies are required in order to assess their physical significance.

Correlation equations for average deposition rate coefficients of nanoparticles in a cylindrical pore

Nanoparticle deposition behavior observed at the Darcy scale represents an average of the processes occurring at the pore scale. Hence, the effect of various pore-scale parameters on nanoparticle deposition can be understood by studying nanoparticle transport at pore scale and upscaling the results to the Darcy scale. In this work, correlation equations for the deposition rate coefficients of nanoparticles in a cylindrical pore are developed as a function of nine pore-scale parameters: the pore radius, nanoparticle radius, mean flow velocity, solution ionic strength, viscosity, temperature, solution dielectric constant, and nanoparticle and collector surface potentials. Based on dominant processes, the pore space is divided into three different regions, namely, bulk, diffusion, and potential regions. Advection-diffusion equations for nanoparticle transport are prescribed for the bulk and diffusion regions, while the interaction between the diffusion and potential regions is included as a boundary condition. This interaction is modeled as a first-order reversible kinetic adsorption. The expressions for the mass transfer rate coefficients between the diffusion and the potential regions are derived in terms of the interaction energy profile. Among other effects, we account for nanoparticle-collector interaction forces on nanoparticle deposition. The resulting equations are solved numerically for a range of values of pore-scale parameters. The nanoparticle concentration profile obtained for the cylindrical pore is averaged over a moving averaging volume within the pore in order to get the 1-D concentration field. The latter is fitted to the 1-D advection-dispersion equation with an equilibrium or kinetic adsorption model to determine the values of the average deposition rate coefficients. In this study, pore-scale simulations are performed for three values of Peclet number, Pe = 0.05, 5, and 50. We find that under unfavorable conditions, the nanoparticle deposition at pore scale is best described by an equilibrium model at low Peclet numbers (Pe = 0.05) and by a kinetic model at high Peclet numbers (Pe = 50). But, at an intermediate Pe (e.g., near Pe = 5), both equilibrium and kinetic models fit the 1-D concentration field. Correlation equations for the pore-averaged nanoparticle deposition rate coefficients under unfavorable conditions are derived by performing a multiple-linear regression analysis between the estimated deposition rate coefficients for a single pore and various pore-scale parameters. The correlation equations, which follow a power law relation with nine pore-scale parameters, are found to be consistent with the column-scale and pore-scale experimental results, and qualitatively agree with the colloid filtration theory. These equations can be incorporated into pore network models to study the effect of pore-scale parameters on nanoparticle deposition at larger length scales such as Darcy scale.

Ellipse Fitting Using the Finite Rate of Innovation Sampling Principle

Standard approaches for ellipse fitting are based on the minimization of algebraic or geometric distance between the given data and a template ellipse. When the data are noisy and come from a partial ellipse, the state-of-the-art methods tend to produce biased ellipses. We rely on the sampling structure of the underlying signal and show that the x- and y-coordinate functions of an ellipse are finite-rate-of-innovation (FRI) signals, and that their parameters are estimable from partial data. We consider both uniform and nonuniform sampling scenarios in the presence of noise and show that the data can be modeled as a sum of random amplitude-modulated complex exponentials. A low-pass filter is used to suppress noise and approximate the data as a sum of weighted complex exponentials. The annihilating filter used in FRI approaches is applied to estimate the sampling interval in the closed form. We perform experiments on simulated and real data, and assess both objective and subjective performances in comparison with the state-of-the-art ellipse fitting methods. The proposed method produces ellipses with lesser bias. Furthermore, the mean-squared error is lesser by about 2 to 10 dB. We show the applications of ellipse fitting in iris images starting from partial edge contours, and to free-hand ellipses drawn on a touch-screen tablet.