Structural optimization of lattice materials

Lattice materials are characterized at the microscopic level by a regular pattern of voids confined by walls. Recent rapid prototyping techniques allow their manufacturing from a wide range of solid materials, ensuring high degrees of accuracy and limited costs. The microstructure of lattice material permits to obtain macroscopic properties and structural performance, such as very high stiffness to weight ratios, highly anisotropy, high specific energy dissipation capability and an extended elastic range, which cannot be attained by uniform materials. Among several applications, lattice materials are of special interest for the design of morphing structures, energy absorbing components and hard tissue scaffold for biomedical prostheses. Their macroscopic mechanical properties can be finely tuned by properly selecting the lattice topology and the material of the walls. Nevertheless, since the number of the design parameters involved is very high, and their correlation to the final macroscopic properties of the material is quite complex, reliable and robust multiscale mechanics analysis and design optimization tools are a necessary aid for their practical application. In this paper, the optimization of lattice materials parameters is illustrated with reference to the design of a bracket subjected to a point load. Given the geometric shape and the boundary conditions of the component, the parameters of four selected topologies have been optimized to concurrently maximize the component stiffness and minimize its mass. Copyright © 2011 by ASME.

Multi-objective optimization for multiphase orbital rendezvous missions

A multi-objective optimization approach was proposed for multiphase orbital rendezvous missions and validated by application to a representative numerical problem. By comparing the Pareto fronts obtained using the proposed method, the relationships between the three objectives considered are revealed, and the influences of other mission parameters, such as the sensors' field of view, can also be analyzed effectively. For multiphase orbital rendezvous missions, the tradeoff relationships between the total velocity increment and the trajectory robustness index as well as between the total velocity increment and the time of flight are obvious and clear. However, the tradeoff relationship between the time of flight and the trajectory robustness index is weak, especially for the four- and five-phase missions examined. The proposed approach could be used to reorganize a stable rendezvous profile for an engineering rendezvous mission, when there is a failure that prevents the completion of the nominal mission.

Uncertainty increases pain: evidence for a novel mechanism of pain modulation involving the periaqueductal gray.

Predictions about sensory input exert a dominant effect on what we perceive, and this is particularly true for the experience of pain. However, it remains unclear what component of prediction, from an information-theoretic perspective, controls this effect. We used a vicarious pain observation paradigm to study how the underlying statistics of predictive information modulate experience. Subjects observed judgments that a group of people made to a painful thermal stimulus, before receiving the same stimulus themselves. We show that the mean observed rating exerted a strong assimilative effect on subjective pain. In addition, we show that observed uncertainty had a specific and potent hyperalgesic effect. Using computational functional magnetic resonance imaging, we found that this effect correlated with activity in the periaqueductal gray. Our results provide evidence for a novel form of cognitive hyperalgesia relating to perceptual uncertainty, induced here by vicarious observation, with control mediated by the brainstem pain modulatory system.

Modulation of pain ratings by expectation and uncertainty: Behavioral characteristics and anticipatory neural correlates.

Expectations about the magnitude of impending pain exert a substantial effect on subsequent perception. However, the neural mechanisms that underlie the predictive processes that modulate pain are poorly understood. In a combined behavioral and high-density electrophysiological study we measured anticipatory neural responses to heat stimuli to determine how predictions of pain intensity, and certainty about those predictions, modulate brain activity and subjective pain ratings. Prior to receiving randomized laser heat stimuli at different intensities (low, medium or high) subjects (n=15) viewed cues that either accurately informed them of forthcoming intensity (certain expectation) or not (uncertain expectation). Pain ratings were biased towards prior expectations of either high or low intensity. Anticipatory neural responses increased with expectations of painful vs. non-painful heat intensity, suggesting the presence of neural responses that represent predicted heat stimulus intensity. These anticipatory responses also correlated with the amplitude of the Laser-Evoked Potential (LEP) response to painful stimuli when the intensity was predictable. Source analysis (LORETA) revealed that uncertainty about expected heat intensity involves an anticipatory cortical network commonly associated with attention (left dorsolateral prefrontal, posterior cingulate and bilateral inferior parietal cortices). Relative certainty, however, involves cortical areas previously associated with semantic and prospective memory (left inferior frontal and inferior temporal cortex, and right anterior prefrontal cortex). This suggests that biasing of pain reports and LEPs by expectation involves temporally precise activity in specific cortical networks.

POMDP-based statistical spoken dialog systems: A review

Statistical dialog systems (SDSs) are motivated by the need for a data-driven framework that reduces the cost of laboriously handcrafting complex dialog managers and that provides robustness against the errors created by speech recognizers operating in noisy environments. By including an explicit Bayesian model of uncertainty and by optimizing the policy via a reward-driven process, partially observable Markov decision processes (POMDPs) provide such a framework. However, exact model representation and optimization is computationally intractable. Hence, the practical application of POMDP-based systems requires efficient algorithms and carefully constructed approximations. This review article provides an overview of the current state of the art in the development of POMDP-based spoken dialog systems. © 1963-2012 IEEE.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.

From subspace learning to distance learning: A geometrical optimization approach

In this paper, we adopt a differential-geometry viewpoint to tackle the problem of learning a distance online. As this problem can be cast into the estimation of a fixed-rank positive semidefinite (PSD) matrix, we develop algorithms that exploits the rich geometry structure of the set of fixed-rank PSD matrices. We propose a method which separately updates the subspace of the matrix and its projection onto that subspace. A proper weighting of the two iterations enables to continuously interpolate between the problem of learning a subspace and learning a distance when the subspace is fixed. © 2009 IEEE.