Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Reconstruction from incomplete data in cone-beam tomography

A method for reconstruction of an object f(x) x=(x,y,z) from a limited set of cone-beam projection data has been developed. This method uses a modified form of convolution back-projection and projection onto convex sets (POCS) for handling the limited (or incomplete) data problem. In cone-beam tomography, one needs to have a complete geometry to completely reconstruct the original three-dimensional object. While complete geometries do exist, they are of little use in practical implementations. The most common trajectory used in practical scanners is circular, which is incomplete. It is, however, possible to recover some of the information of the original signal f(x) based on a priori knowledge of the nature of f(x). If this knowledge can be posed in a convex set framework, then POCS can be utilized. In this report, we utilize this a priori knowledge as convex set constraints to reconstruct f(x) using POCS. While we demonstrate the effectiveness of our algorithm for circular trajectories, it is essentially geometry independent and will be useful in any limited-view cone-beam reconstruction.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Further results on geometric properties of a family of relative entropies

This paper extends some geometric properties of a one-parameter family of relative entropies. These arise as redundancies when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the Kullback-Leibler divergence. They satisfy the Pythagorean property and behave like squared distances. This property, which was known for finite alphabet spaces, is now extended for general measure spaces. Existence of projections onto convex and certain closed sets is also established. Our results may have applications in the Rényi entropy maximization rule of statistical physics.

Flow of metal into the flash gap in the last stages of a plane-strain closed-die forging operation

In closed-die forging the flash geometry should be such as to ensure that the cavity is completely filled just as the two dies come into contact at the parting plane. If metal is caused to extrude through the flash gap as the dies approach the point of contact — a practice generally resorted to as a means of ensuring complete filling — dies are unnecessarily stressed in a high-stress regime (as the flash is quite thin and possibly cooled by then), which reduces the die life and unnecessarily increases the energy requirement of the operation. It is therefore necessary to carefully determine the dimensions of the flash land and flash thickness — the two parameters, apart from friction at the land, which control the lateral flow. The dimensions should be such that the flow into the longitudinal cavity is controlled throughout the operation, ensuring complete filling just as the dies touch at the parting plane. The design of the flash must be related to the shape and size of the forging cavity as the control of flow has to be exercised throughout the operation: it is possible to do this if the mechanics of how the lateral extrusion into the flash takes place is understood for specific cavity shapes and sizes. The work reported here is part of an ongoing programme investigating flow in closed-die forging. A simple closed shape (no longitudinal flow) which may correspond to the last stages of a real forging operation is analysed using the stress equilibrium approach. Metal from the cavity (flange) flows into the flash by shearing in the cavity in one of the three modes considered here: for a given cavity the mode with the least energy requirement is assumed to be the most realistic. On this basis a map has been developed which, given the depth and width of the cavity as well as the flash thickness, will tell the designer of the most likely mode (of the three modes considered) in which metal in the cavity will shear and then flow into the flash gap. The results of limited set of experiments, reported herein, validate this method of selecting the optimum model of flow into the flash gap.

Approximate closed-form solutions of realistic true proportional navigation guidance using the Adomian decomposition method

Approximate closed-form solutions of the non-linear relative equations of motion of an interceptor pursuing a target under the realistic true proportional navigation (RTPN) guidance law are derived using the Adomian decomposition method in this article. In the literature, no study has been reported on derivation of explicit time-series solutions in closed form of the nonlinear dynamic engagement equations under the RTPN guidance. The Adomian method provides an analytical approximation, requiring no linearization or direct integration of the non-linear terms. The complete derivation of the Adomian polynomials for the analysis of the dynamics of engagement under RTPN guidance is presented for deterministic ideal case, and non-ideal dynamics in the loop that comprises autopilot and actuator dynamics and target manoeuvre, as well as, for a stochastic case. Numerical results illustrate the applicability of the method.

A Closed-Cycle Refrigerator Based Pulsed Management System

A low cost 12 T pulsed magnet system has been integrated with a closed-cycle helium refrigerator. The copper solenoid is directly immersed in liquid nitrogen for reduced electrical resistance and more efficient heat transfer. This ensures a minimal delay of few minutes between pulses. The sample is mounted on the cold finger of the refrigerator and, along with the surrounding vacuum shroud, is inserted into the bore of the solenoid. When combined with software lock-in signal processing to reduce noise, quick but accurate measurements can be performed at temperatures 4 K-300 K up to 12 T. Quantum Hall effect data in a p-channel SiGe/Si heterostructure has been used to calibrate the instrument against a commercial superconducting magnet. Its versatility as a routine characterization tool is demonstrated bymeasuring parallel conduction in Si/SiGe modulation doped heterostructures.

X-ray studies on crystalline complexes involving amino acids and peptides. Part XIV: Closed conformation and head-to-tail arrangement in a new crystal form of L-histidine L-aspartate monohydrate

A new form of L-histidine L-aspartate monohydrate crystallizes in space group P22 witha = 5.131(1),b = 6.881(1),c= 18.277(2) Å,β= 97.26(1)° and Z = 2. The structure has been solved by the direct methods and refined to anR value of 0.044 for 1377 observed reflections. Both the amino acid molecules in the complex assume the energetically least favourable allowed conformation with the side chains staggered between the α-amino and α-scarboxylate groups. This results in characteristic distortions in some bond angles. The unlike molecules aggregate into alternating double layers with water molecules sandwiched between the two layers in the aspartate double layer. The molecules in each layer are arranged in a head-to-tail fashion. The aggregation pattern in the complex is fundamentally similar to that in other binary complexes involving commonly occurring L amino acids, although the molecules aggregate into single layers in them. The distribution of crystallographic (and local) symmetry elements in the old form of the complex is very different from that in the new form. So is the conformation of half the histidine molecules. Yet, the basic features of molecular aggregation, particularly the nature and the orientation of head-to-tail sequences, remain the same in both the forms. This supports the thesis that the characteristic aggregation patterns observed in crystal structures represent an intrinsic property of amino acid aggregation.

Estimation Of Properties Of Rare-Gas Solids From Compression Characteristics Of Closed-Shell Ions

We present a unified approach to repulsion in ionic and van der Waals solids based on a compressible-ion/atom model. Earlier studies have shown that repulsion in ionic crystals can be viewed as arising from the compression energy of ions, described by two parameters per ion. Here we obtain the compression parameters of the rare-gas atoms Ne. Ar. Kr and Xe by interpolation using the known parameters of related equi-electronic ions (e.g. Ar from S2-. Cl-, K- and Ca2-). These parameters fit the experimental zero-temperature interatomic distances and compressibilities of the rare-gas crystals satisfactorily. A hightemperature equation of state based on an Einstein model of thermal motions is used to calculate the thermal expansivities, compressibilities and their temperature derivatives for Ar. Kr and Xe. It is argued that an instability at higher temperatures represents the limit to which the solid can be superheated. beyond which sublimation must occur.

Reliable Means of Diagnosis and Serovar Determination of Blood-Borne Salmonella Strains: Quick PCR Amplification of Unique Genomic Loci by Novel Primer Sets

Typhoid fever is becoming an ever increasing threat in the developing countries. We have improved considerably upon the existing PCR-based diagnosis method by designing primers against a region that is unique to Salmonella enterica subsp. enterica serovar Typhi and Salmonella enterica subsp. enterica serovar Paratyphi A, corresponding to the STY0312 gene in S. Typhi and its homolog SPA2476 in S. Paratyphi A. An additional set of primers amplify another region in S. Typhi CT18 and S. Typhi Ty2 corresponding to the region between genes STY0313 to STY0316 but which is absent in S. Paratyphi A. The possibility of a false-negative result arising due to mutation in hypervariable genes has been reduced by targeting a gene unique to typhoidal Salmonella serovars as a diagnostic marker. The amplified region has been tested for genomic stability by amplifying the region from clinical isolates of patients from various geographical locations in India, thereby showing that this region is potentially stable. These set of primers can also differentiate between S. Typhi CT18, S. Typhi Ty2, and S. Paratyphi A, which have stable deletions in this specific locus. The PCR assay designed in this study has a sensitivity of 95% compared to the Widal test which has a sensitivity of only 63%. As observed, in certain cases, the PCR assay was more sensitive than the blood culture test was, as the PCR-based detection could also detect dead bacteria.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

Non-linear Transceiver Designs with Imperfect CSIT Using Convex Optimization

In this paper, we consider non-linear transceiver designs for multiuser multi-input multi-output (MIMO) down-link in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas and each user terminal is equipped with multiple receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for inter-user interference pre-cancellation at the transmitter. We investigate robust THP transceiver designs based on the minimization of BS transmit power with mean square error (MSE) constraints, and balancing of MSE among users with a constraint on the total BS transmit power. We show that these design problems can be solved by iterative algorithms, wherein each iteration involves a pair of convex optimization problems. The robustness of the proposed algorithms to imperfections in CSIT is illustrated through simulations.

The effect of closed boundary conditions on a stationary dynamo

One of two boundary conditions generally assumed in solutions of the dynamo equation is related to the disappearance of the azimuthal field at the boundary. Parker (1984) points out that for the realization of this condition the field must escape freely through the surface. Escape requires that the field be detached from the gas in which it is embedded. In the case of the sun, this can be accomplished only through reconnection in the tenuous gas above the visible surface. Parker concludes that the observed magnetic activity on the solar surface permits at most three percent of the emerging flux to escape. He arrives at the conclusion that, instead of B(phi) = 0, the partial derivative of B(phi) to r is equal to zero. The present investigation is concerned with the effect of changing the boundary condition according to Parker's conclusion. Implications for the solar convection zone are discussed.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.