Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

Simultaneous material selection and geometry design of statically determinate trusses using continuous optimization

In this work, we explore simultaneous geometry design and material selection for statically determinate trusses by posing it as a continuous optimization problem. The underlying principles of our approach are structural optimization and Ashby’s procedure for material selection from a database. For simplicity and ease of initial implementation, only static loads are considered in this work with the intent of maximum stiffness, minimum weight/cost, and safety against failure. Safety of tensile and compression members in the truss is treated differently to prevent yield and buckling failures, respectively. Geometry variables such as lengths and orientations of members are taken to be the design variables in an assumed layout. Areas of cross-section of the members are determined to satisfy the failure constraints in each member. Along the lines of Ashby’s material indices, a new design index is derived for trusses. The design index helps in choosing the most suitable material for any geometry of the truss. Using the design index, both the design space and the material database are searched simultaneously using gradient-based optimization algorithms. The important feature of our approach is that the formulated optimization problem is continuous, although the material selection from a database is an inherently discrete problem. A few illustrative examples are included. It is observed that the method is capable of determining the optimal topology in addition to optimal geometry when the assumed layout contains more links than are necessary for optimality.

Rendering stiffer walls: a hybrid haptic system using continuous and discrete time feedback

Instability in conventional haptic rendering destroys the perception of rigid objects in virtual environments. Inherent limitations in the conventional haptic loop restrict the maximum stiffness that can be rendered. In this paper we present a method to render virtual walls that are much stiffer than those achieved by conventional techniques. By removing the conventional digital haptic loop and replacing it with a part-continuous and part-discrete time hybrid haptic loop, we were able to render stiffer walls. The control loop is implemented as a combinational logic circuit on an field-programmable gate array. We compared the performance of the conventional haptic loop and our hybrid haptic loop on the same haptic device, and present mathematical analysis to show the limit of stability of our device. Our hybrid method removes the computer-intensive haptic loop from the CPU-this can free a significant amount of resources that can be used for other purposes such as graphical rendering and physics modeling. It is our hope that, in the future, similar designs will lead to a haptics processing unit (HPU).

Variational principles in evolution

For a one-locus selection model, Svirezhev introduced an integral variational principle by defining a Lagrangian which remained stationary on the trajectory followed by the population undergoing selection. It is shown here (i) that this principle can be extended to multiple loci in some simple cases and (ii) that the Lagrangian is defined by a straightforward generalization of the one-locus case, but (iii) that in two-locus or more general models there is no straightforward extension of this principle if linkage and epistasis are present. The population trajectories can be constructed as trajectories of steepest ascent in a Riemannian metric space. A general method is formulated to find the metric tensor and the surface-in the metric space on which the trajectories, which characterize the variations in the gene structure of the population, lie. The local optimality principle holds good in such a space. In the special case when all possible linkage disequilibria are zero, the phase point of the n-locus genetic system moves on the surface of the product space of n higher dimensional unit spheres in a certain Riemannian metric space of gene frequencies so that the rate of change of mean fitness is maximum along the trajectory. In the two-locus case the corresponding surface is a hyper-torus.

A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.

Simultaneous Geometry Optimization and Material Selection for Truss Structures

In this work, we explore simultaneous design and material selection by posing it as an optimization problem. The underlying principles for our approach are Ashby's material selection procedure and structural optimization. For the simplicity and ease of initial implementation of the general procedure, truss structures under static load are considered in this work in view of maximum stiffness, minimum weight/cost and safety against failure. Along the lines of Ashby's material indices, a new design index is derived for trusses. This helps in choosing the most suitable material for any design of a truss. Using this, both the design space and material database are searched simultaneously using optimization algorithms. The important feature of our approach is that the formulated optimization problem is continuous even though the material selection is an inherently discrete problem.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

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.

First-principles DFT plus GW study of oxygen vacancies in rutile TiO2

We perform first-principles calculations of the quasiparticle defect states, charge transition levels, and formation energies of oxygen vacancies in rutile titanium dioxide. The calculations are done within the recently developed combined DFT + GW formalism, including the necessary electrostatic corrections for the supercells with charged defects. We find the oxygen vacancy to be a negative U defect, where U is the defect electron addition energy. For Fermi level values below similar to 2.8 eV (relative to the valence-band maximum), we find the +2 charge state of the vacancy to be the most stable, while above 2.8 eV we find that the neutral charge state is the most stable.

Three-Dimensional Study of Natural Convection in a Horizontal Channel With Discrete Heaters on One of Its Vertical Walls

Three-dimensional natural convection in a horizontal channel with an array of discrete flush-mounted heaters on one of its vertical walls is numerically studied. Effects of thermal conductivities of substrate and heaters and convection on outer sides of the channel walls on heat transfer are examined. The substrate affects heat transfer in a wider range of thermal conductivities than do the heaters. At lower heater thermal conductivities a higher heat portion is transferred by direct convection from the heaters to the adjacent coolant. However, higher substrate conductivity is associated with higher heat portion transferred through the substrate. The innermost heater column is found to become the hottest heater column due to the lower coolant accessibility. The heat transfer in the channel is strongly influenced by convection on the outer sides of the channel walls. Correlations are presented for dimensionless temperature maximum and average Nusselt number.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

First principles study of magnetism in divalent Eu perovskites

A comparative first principles study has been carried out for EuLiH3 (ELH) and EuTiO3 (ETO) using the generalized gradient approximation +U approach. While ELH exhibits ferromagnetic ground state for all volumes, the magnetic ground state of ETO has the tendency to switch from G-type antiferromagnetic to a ferromagnetic state with change in volume. The marked difference in magnetic behavior and magnitude of the nearest neighbors exchange interaction of both the compounds are shown to be related to the difference in their respective electronic structure near the Fermi level. The Ti 3d states are shown to play predominant role in weakening the strength of the exchange interaction in ETO.

Identification of a discrete intermediate in the assembly disassembly of physalis mottle tymovirus through mutational analysis

Assembly intermediates of icosahedral viruses are usually transient and are difficult to identify. In the present investigation, site-specific and deletion mutants of the coat protein gene of physalis mottle tymovirus (PhMV) were used to delineate the role of specific amino acid residues in the assembly of the virus and to identify intermediates in this process. N-terminal 30, 34, 35 and 39 amino acid deletion and single C-terminal (N188) deletion mutant proteins of PhMV were expressed in Escherichia coli. Site-specific mutants H69A, C75A, W96A, D144N, D144N-T151A, K143E and N188A were also constructed and expressed. The mutant protein lacking 30 amino acid residues from the N terminus self-assembled to T = 3 particles in vivo while deletions of 34, 35 and 39 amino acid residues resulted in the mutant proteins that were insoluble. Interestingly, the coat protein (pR PhCP) expressed using pRSET B vector with an additional 41 amino acid residues at the N terminus also assembled into T = 3 particles that were more compact and had a smaller diameter. These results demonstrate that the amino-terminal segment is flexible and either the deletion or addition of amino acid residues at the N terminus does not affect T = 3 capsid assembly, in contrast, the deletion of even a single residue from the C terminus (PhN188 Delta 1) resulted in capsids that were unstable. These capsids disassembled to a discrete intermediate with a sedimentation coefficent of 19.4 S. However, the replacement of C-terminal asparagine 188 by alanine led to the formation of stable capsids. The C75A and D144N mutant proteins also assembled into capsids that were as stable as the pR PhCP, suggesting that C75A and D144 are not crucial for the T = 3 capsid assembly. pR PhW96A and pR PhD144N-T151A mutant proteins failed to form capsids and were present as heterogeneous aggregates. Interestingly, the pR PhK143E mutant protein behaved in a manner similar to the C-terminal deletion protein in forming unstable capsids. The intermediate with an s value of 19.4 S was the major assembly product of pR PhH69A mutant protein and could correspond to a 30mer. It is possible that the assembly or disassembly is arrested at a similar stage in pR PhN188 Delta 1, pR PhH69A and pR PhK143E mutant proteins.

Cholinergic Muscarinic Receptors in Human Fetal Brain: Ontogeny of [3H]Quinuclidinyl Benzilate Binding Sites in Corpus Striatum, Brainstem, and Cerebellum

The ontogeny of muscarinic receptors was studied in human fetal striatum, brainstem, and cerebellum to investigate general principles of synaptogenesis as well as the physiological balance between various chemical synapses during development in a given region of the brain. [3H]Quinuclidinyl benzilate ([-'H]QNB) binding was assayed in total particulate fraction (TPF) from various parts of brain. In the corpus striatum, QNB binding sites are present at 16 weeks of gestation (average concentration 180 fmol/mg protein of TPF), slowly increase up to 24 weeks (average concentration 217 fmol/mg protein), and rapidly increase during the third trimester to 480 fmol/mg protein of TPF. In contrast, dopaminergic receptors exist as two subpopulations. one with low affinity and the other with high affinity up to the 24th week of gestation; all of them acquire the highaffinity characteristic during the third trimester. In brainstem, the muscarinic receptors show maximum concentration by 16 weeks of age (360 fmolimg protein of TPF). Subsequently the muscarinic receptor concentration shows a gradual decline in the brainstem. In cerebellum, except for a slight increase at 24 weeks (average concentration 90 fmol/mg protein of TPF), the receptor concentration remained nearly constant at about 60-70 fmolimg protein of TPF throughout fetal life. This study demonstrates that the ontogeny of muscarinic receptors varies among the different regions, and the patterns observed suggest that receptor formation occurs principally in the third trimester. Also noteworthy is the finding that the QNB binding sites decreased in all regions of the human brain during adult life. Key Words: Cholinergic muscarinic receptors-Quinuclidinyl benzilate-Corpus striaturn-Brainstem-Cerebellum. Ravikumar B. V. and Sastry P. S. Cholinergic muscarinic receptors in human fetal brain: Ontogeny of [3H]quinuclidinyl benzilate binding sites in corpus striatum, brainstem, and cerebellum. J. Neurochem. 45, 1948- 1950 (1985).

Adsorption isitherms for neutral organic compounds-A hierarchy in modelling: Part IV. Charge of maximum adsorption-Statistical mechanical basis

The charge at which adsorption of orgamc compounds attains a maximum ( \sigma MAX M) at an electrochenucal interface is analysed using several multi-state models in a hierarchical manner The analysis is based on statistical mechamcal results for the following models (A) two-state site parity, (B) two-state muhl-slte, and (C) three-state site parity The coulombic interactions due to permanent and reduced dipole effects (using mean field approximation), electrostatic field effects and specific substrate interactions have been taken into account. The simplest model in the hierarchy (two-state site parity) yields the exphcit dependence of ( \sigma MAX M) on the permanent dipole moment, polarizability of the solvent and the adsorbate, lattice spacing, effective coordination number, etc Other models in the baerarchy bring to hght the influence of the solvent structure and the role of substrate interactions, etc As a result of this approach, the "composition" of oM.x m terms of the fundamental molecular constants becomes clear. With a view to use these molecular results to maxamum advantage, the derived results for ( \sigma MAX M) have been converted into those involving experimentally observable parameters lake Co, C 1, E N, etc Wherever possible, some of the earlier phenomenologlcal relations reported for ( \sigma MAX M), notably by Parsons, Damaskm and Frumkln, and Trasattl, are shown to have a certain molecular basis, vlz a simple two-state sate panty model.As a corollary to the hxerarcbacal modelling, \sigma MAX M and the potential corresponding to at (Emax) are shown to be constants independent of 0max or Corg for all models The lmphcatlon of our analysis f o r OmMa x with respect to that predicted by the generalized surface layer equation (which postulates Om~ and Ema x varlaUon with 0) is discussed in detail Finally we discuss an passing o M. and the electrosorptlon valency an this context.