Thermodynamics of higher spin black holes in 3D

We examine the thermodynamic properties of recently constructed black hole solutions in SL(3, R) x SL(3, R) Chern-Simons theory in the presence of a chemical potential for spin-3 charge, which acts as an irrelevant deformation of the dual CFT with W-3 X W-3 symmetry. The smoothness or holonomy conditions admit four branches of solutions describing a flow between two AdS(3) backgrounds corresponding to two different CFTs. The dominant branch at low temperatures, connected to the BTZ black hole, merges smoothly with a thermodynamically unstable branch and disappears at higher temperatures. We confirm that the UV region of the flow satisfies the Ward identities of a CFT with W-3((2)) x W-3((2)) symmetry deformed by a spin-3/2 current. This allows to identify the precise map between UV and HI thermodynamic variables. We find that the high temperature regime is dominated by a black hole branch whose thermodynamics can only be consistently inferred with reference to this W-3((2)) x W-3((2)) CFT.

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.

Operator-splitting finite element algorithms for computations of high-dimensional parabolic problems

An operator-splitting finite element method for solving high-dimensional parabolic equations is presented. The stability and the error estimates are derived for the proposed numerical scheme. Furthermore, two variants of fully-practical operator-splitting finite element algorithms based on the quadrature points and the nodal points, respectively, are presented. Both the quadrature and the nodal point based operator-splitting algorithms are validated using a three-dimensional (3D) test problem. The numerical results obtained with the full 3D computations and the operator-split 2D + 1D computations are found to be in a good agreement with the analytical solution. Further, the optimal order of convergence is obtained in both variants of the operator-splitting algorithms. (C) 2012 Elsevier Inc. All rights reserved.

MULTI-OBJECTIVE GENETIC ALGORITHM FOR EFFICIENT POINT MATCHING IN MULTI-SENSOR SATELLITE IMAGE

This paper investigates a new approach for point matching in multi-sensor satellite images. The feature points are matched using multi-objective optimization (angle criterion and distance condition) based on Genetic Algorithm (GA). This optimization process is more efficient as it considers both the angle criterion and distance condition to incorporate multi-objective switching in the fitness function. This optimization process helps in matching three corresponding corner points detected in the reference and sensed image and thereby using the affine transformation, the sensed image is aligned with the reference image. From the results obtained, the performance of the image registration is evaluated and it is concluded that the proposed approach is efficient.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Point Spread Function Engineering for Super-Resolution Single-Photon and Multiphoton Fluorescence Microscopy

Super-resolution imaging techniques are of paramount interest for applications in bioimaging and fluorescence microscopy. Recent advances in bioimaging demand application-tailored point spread functions. Here, we present some approaches for generating application-tailored point spread functions along with fast imaging capabilities. Aperture engineering techniques provide interesting solutions for obtaining desired system point spread functions. Specially designed spatial filters—realized by optical mask—are outlined both in a single-lens and 4Pi configuration. Applications include depth imaging, multifocal imaging, and super-resolution imaging. Such an approach is suitable for fruitful integration with most existing state-of-art imaging microscopy modalities.

Fracture studies on 3D geometrically similar beams

In the present work, a discrete numerical approach is adopted to understand size effect and fracture behavior in concrete. First, a comparison is performed between 2D and 3D geometrically similar structures to analyze thickness effect. The study is supplemented with element failure pattern to analyze crack propagation. Further, changing influence of notch to depth ratio is analyzed by comparing 3D geometrically similar structures with different values of notch depth ratio. Finally, a statistical analysis is performed to understand the influence of structure size and heterogeneity on regression parameters namely Bf(t)' and D-0. (C) 2012 Elsevier Ltd. All rights reserved.

Simulating grasping behavior of people using the relational description scheme

This paper presents an enhanced relational description for the prescription of the grasp requirement and evolution of the posture of a digital human hand towards satisfaction of this requirement. Precise relational description needs anatomical segmentation of the hand geometry into palmar, dorsal and lateral patches using the palm-plane and joint locations information, and operational segmentation of the object geometry into pull,push and lateral patches with due consideration to the effect of friction. Relational description identifies appropriate patches for a desired grasp condition. Satisfaction of this requirement occurs in two discrete stages,namely,contact establishment and post-contact force exertion for object capturing. Contact establishment occurs in four potentially overlapping phases,namely,re-orientation,transfer,pre- shaping,and closing-in. The novel h and re-orientation phase,enables the palm to face the object in a task sequence scenario, transfer takes the wrist to the ball park ; pre-shaping and close-in finally achieves the contact. In this paper, an anatomically pertinent closed-form formulation is presented for the closing-in phase for identification of the point of contact on the patches ,prescribed by the relational description. Since mere contact does not ensure grasp and slip phenomenon at the point of contact on application of force is a common occurrence, the effect of slip in presence of friction has been studied for 2D and 3D object grasping endeavours and a computational generation of the slip locus is presented.A general slip locus is found to be a non-linear curve even on planar faces.Two varieties of slip phenomena,namely,stabilizing and non-stabilizing slips, and their local characteristics have been identified.Study of the evolution of this slip characteristic over the slip locus exhibited diverse grasping behaviour possibilities. Thus, the relational description paradigm not only makes the requirement specification easy and meaningful but also enables high fidelity hand object interaction studies possible.

Natural motion of one-dimensional flexible objects using minimization approaches

For one-dimensional flexible objects such as ropes, chains, hair, the assumption of constant length is realistic for large-scale 3D motion. Moreover, when the motion or disturbance at one end gradually dies down along the curve defining the one-dimensional flexible objects, the motion appears ``natural''. This paper presents a purely geometric and kinematic approach for deriving more natural and length-preserving transformations of planar and spatial curves. Techniques from variational calculus are used to determine analytical conditions and it is shown that the velocity at any point on the curve must be along the tangent at that point for preserving the length and to yield the feature of diminishing motion. It is shown that for the special case of a straight line, the analytical conditions lead to the classical tractrix curve solution. Since analytical solutions exist for a tractrix curve, the motion of a piecewise linear curve can be solved in closed-form and thus can be applied for the resolution of redundancy in hyper-redundant robots. Simulation results for several planar and spatial curves and various input motions of one end are used to illustrate the features of motion damping and eventual alignment with the perturbation vector.

Tradeoff of average power and average delay for a point-to-point link with fading

We consider a discrete time system with packets arriving randomly at rate lambda per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log (1/V) or 1/V when V down arrow 0, for certain sets of values of lambda. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.

Black hole formation at the correspondence point

We study the process of bound state formation in a D-brane collision. We consider two mechanisms for bound state formation. The first, operative at weak coupling in the worldvolume gauge theory, is pair creation of W-bosons. The second, operative at strong coupling, corresponds to formation of a large black hole in the dual supergravity. These two processes agree qualitatively at intermediate coupling, in accord with the correspondence principle of Horowitz and Polchinski. We show that the size of the bound state and time scale for formation of a bound state agree at the correspondence point. The time scale involves matching a parametric resonance in the gauge theory to a quasinormal mode in supergravity.

A new 3D cadmium(II) coordination polymer having mu(4)-oxalato, mu-aquo and mu-chlorido bridges: crystal structure, solid state fluorescence and thermal behavior

A new 3D cadmium(II) coordination polymer, Cd(C2O4)(0.5)Cl(H2O)](n) (1) has been synthesized from a mixture of CdCl2. H2O and (NH4)(2)C2O4 in a slightly acidic pH. Its molecular structure was determined by single crystal X-ray diffraction which reveals that the new polymeric structure consists of simultaneous mu(4)-oxalato, mu-aquo, and mu-chlorido bridges between the metal centers, embedded in distorted pentagonal bipyramidal geometries. On thermal analysis compound exhibits high thermal stability up to 330 degrees C. Compound 1 also exhibits strong fluorescent emission. (c) 2013 Elsevier B.V. All rights reserved.

Comparison of CloudSat and TRMM radar reflectivities

Comparison of reflectivity data of radars onboard CloudSat and TRMM is performed using coincident overpasses. The contoured frequency by altitude diagrams (CFADs) are constructed for two cases: (a) only include collocated vertical profiles that are most likely to be raining and (b) include all collocated profiles along with cloudy pixels falling within a distance of about 50 km from the centre point of coincidence. Our analysis shows that for both cases, CloudSat underestimates the radar reflectivity by about 10 dBZ compared to that of TRMM radar below 15 km altitude. The difference is well outside the uncertainty value of similar to 2 dBZ of each radar. Further, CloudSat reflectivity shows a decreasing trend while that of TRMM radar an increasing trend below 4 km height. Basically W-band radar that CloudSat flies suffers strong attenuation in precipitating clouds and its reflectivity value rarely exceeds 20 dBZ though its technical specification indicates the upper measurement limit to be 40 dBZ. TRMM radar, on the other hand, cannot measure values below 17 dBZ. In fact combining data from these two radars seems to give a better overall spatial structure of convective clouds.

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.

Vorticity moments in four numerical simulations of the 3D Navier-Stokes equations

The issue of intermittency in numerical solutions of the 3D Navier-Stokes equations on a periodic box 0, L](3) is addressed through four sets of numerical simulations that calculate a new set of variables defined by D-m(t) = (pi(-1)(0) Omega(m))(alpha m) for 1 <= m <= infinity where alpha(m) = 2m/(4m - 3) and Omega(m)(t)](2m) = L-3 integral(v) vertical bar omega vertical bar(2m) dV with pi(0) = vL(-2). All four simulations unexpectedly show that the D-m are ordered for m = 1,..., 9 such that Dm+1 < D-m. Moreover, the D-m squeeze together such that Dm+1/D-m NE arrow 1 as m increases. The values of D-1 lie far above the values of the rest of the D-m, giving rise to a suggestion that a depletion of nonlinearity is occurring which could be the cause of Navier-Stokes regularity. The first simulation is of very anisotropic decaying turbulence; the second and third are of decaying isotropic turbulence from random initial conditions and forced isotropic turbulence at fixed Grashof number respectively; the fourth is of very-high-Reynolds-number forced, stationary, isotropic turbulence at up to resolutions of 4096(3).