Interior Medial Axis Transform computation of 3D objects bound by free-form surfaces

This paper presents an algorithm for generating the Interior Medial Axis Transform (iMAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the part and generates an approximate rational spline description of the iMAT. The algorithm generates the iMAT by a tracing technique that marches along the object's boundary. The level of approximation is controlled by the choice of the step size in the tracing procedure. Criteria based on distance and local curvature of boundary entities are used to identify the junction points and the search for these junction points is done in an efficient way. The algorithm works for multiply-connected objects as well. Results of the implementation are provided. (C) 2010 Elsevier Ltd. All rights reserved.

Interior Photon Absorption Based Adaptive Regularization Improves Diffuse Optical Tomography

An adaptive regularization algorithm that combines elementwise photon absorption and data misfit is proposed to stabilize the non-linear ill-posed inverse problem. The diffuse photon distribution is low near the target compared to the normal region. A Hessian is proposed based on light and tissue interaction, and is estimated using adjoint method by distributing the sources inside the discretized domain. As iteration progresses, the photon absorption near the inhomogeneity becomes high and carries more weightage to the regularization matrix. The domain's interior photon absorption and misfit based adaptive regularization method improves quality of the reconstructed Diffuse Optical Tomographic images.

Swing amplification of nonaxisymmetric perturbations in stars and gas in a sheared galactic disk

We present a study of the growth of local, nonaxisymmetric perturbations in gravitationally coupled stars and gas in a differentially rotating galactic disk. The stars and gas are treated as two isothermal fluids of different velocity dispersions, with the stellar velocity dispersion being greater than that for the gas. We examine the physical effects of inclusion of a low-velocity dispersion component (gas) on the growth of non-axisymmetric perturbations in both stars and gas, as done for the axisymmetric case by Jog & Solomon. The amplified perturbations in stars and gas constitute trailing, material, spiral features which may be identified with the local spiral features seen in all spiral galaxies. The formulation of the two-fluid equations closely follows the one-fluid treatment by Goldreich & Lynden-Bell. The local, linearized perturbation equations in the sheared frame are solved to obtain the results for a temporary growth via swing amplification. The problem is formulated in terms of five dimensionless parameters-namely, the Q-factors for stars and gas, respectively; the gas mass fraction; the shearing rate in the galactic disk; and the length scale of perturbation. By using the observed values of these parameters, we obtain the amplifications and the pitch angles for features in stars and gas for dynamically distinct cases, as applicable for different regions of spiral galaxies. A real galaxy consisting of stars and gas may display growth of nonaxisymmetric perturbations even when it is stable against axisymmetric perturbations and/or when either fluid by itself is stable against non-axisymmetric perturbations. Due to its lower velocity dispersion, the gas exhibits a higher amplification than do the stars, and the amplified gas features are slightly more tightly wound than the stellar features. When the gas contribution is high, the stellar amplification and the range of pitch angles over which it can occur are both increased, due to the gravitational coupling between the two fluids. Thus, the two-fluid scheme can explain the origin of the broad spiral arms in the underlying old stellar populations of galaxies, as observed by Schweizer and Elmegreen & Elmegreen. The arms are predicted to be broader in gas-rich galaxies, as is indeed seen for example in M33. In the linear regime studied here, the arm contrast is shown to increase with radius in the inner Galaxy, in agreement with observations of external galaxies by Schweizer. These results follow directly due to the inclusion of gas in the problem.

Temperature profiles of accretion discs around rapidly rotating strange stars in general relativity: A comparison with neutron stars

We compute the temperature profiles of accretion discs around rapidly rotating strange stars, using constant gravitational mass equilibrium sequences of these objects, considering the full effect of general relativity. Beyond a certain critical value of stellar angular momentum (J), we observe the radius ( $r_{\rm orb}$) of the innermost stable circular orbit (ISCO) to increase with J (a property seen neither in rotating black holes nor in rotating neutron stars). The reason for this is traced to the crucial dependence of ${\rm d}r_{\rm orb}/{\rm d}J$ on the rate of change of the radial gradient of the Keplerian angular velocity at $r_{\rm orb}$ with respect to J. The structure parameters and temperature profiles obtained are compared with those of neutron stars, as an attempt to provide signatures for distinguishing between the two. We show that when the full gamut of strange star equation of state models, with varying degrees of stiffness are considered, there exists a substantial overlap in properties of both neutron stars and strange stars. However, applying accretion disc model constraints to rule out stiff strange star equation of state models, we notice that neutron stars and strange stars exclusively occupy certain parameter spaces. This result implies the possibility of distinguishing these objects from each other by sensitive observations through future X-ray detectors.

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

A numerical approach to determine the sufficiency of given boundary data sets for uniquely estimating interior elastic properties

We consider an inverse elasticity problem in which forces and displacements are known on the boundary and the material property distribution inside the body is to be found. In other words, we need to estimate the distribution of constitutive properties using the finite boundary data sets. Uniqueness of the solution to this problem is proved in the literature only under certain assumptions for a given complete Dirichlet-to-Neumann map. Another complication in the numerical solution of this problem is that the number of boundary data sets needed to establish uniqueness is not known even under the restricted cases where uniqueness is proved theoretically. In this paper, we present a numerical technique that can assess the sufficiency of given boundary data sets by computing the rank of a sensitivity matrix that arises in the Gauss-Newton method used to solve the problem. Numerical experiments are presented to illustrate the method.

A QUADRATIC C degrees INTERIOR PENALTY METHOD FOR LINEAR FOURTH ORDER BOUNDARY VALUE PROBLEMS WITH BOUNDARY CONDITIONS OF THE CAHN-HILLIARD TYPE

We develop a quadratic C degrees interior penalty method for linear fourth order boundary value problems with essential and natural boundary conditions of the Cahn-Hilliard type. Both a priori and a posteriori error estimates are derived. The performance of the method is illustrated by numerical experiments.

Analysis of an Interior Penalty Method for Fourth Order Problems on Polygonal Domains

Error analysis for a stable C (0) interior penalty method is derived for general fourth order problems on polygonal domains under minimal regularity assumptions on the exact solution. We prove that this method exhibits quasi-optimal order of convergence in the discrete H (2), H (1) and L (2) norms. L (a) norm error estimates are also discussed. Theoretical results are demonstrated by numerical experiments.

On the Erdos-Szekeres n-interior point problem

The n-interior point variant of the Erdos-Szekeres problem is to show the following: For any n, n-1, every point set in the plane with sufficient number of interior points contains a convex polygon containing exactly n-interior points. This has been proved only for n-3. In this paper, we prove it for pointsets having atmost logarithmic number of convex layers. We also show that any pointset containing atleast n interior points, there exists a 2-convex polygon that contains exactly n-interior points.

A fully discrete C-0 interior penalty Galerkin approximation of the extended Fisher-Kolmogorov equation

A fully discrete C-0 interior penalty finite element method is proposed and analyzed for the Extended Fisher-Kolmogorov (EFK) equation u(t) + gamma Delta(2)u - Delta u + u(3) - u = 0 with appropriate initial and boundary conditions, where gamma is a positive constant. We derive a regularity estimate for the solution u of the EFK equation that is explicit in gamma and as a consequence we derive a priori error estimates that are robust in gamma. (C) 2013 Elsevier B.V. All rights reserved.

On the Erdos-Szekeres n-interior-point problem

The n-interior-point variant of the Erdos Szekeres problem is the following: for every n, n >= 1, does there exist a g(n) such that every point set in the plane with at least g(n) interior points has a convex polygon containing exactly n interior points. The existence of g(n) has been proved only for n <= 3. In this paper, we show that for any fixed r >= 2, and for every n >= 5, every point set having sufficiently large number of interior points and at most r convex layers contains a subset with exactly n interior points. We also consider a relaxation of the notion of convex polygons and show that for every n, n >= 1, any point set with at least n interior points has an almost convex polygon (a simple polygon with at most one concave vertex) that contains exactly n interior points. (C) 2013 Elsevier Ltd. All rights reserved.