Interaction of a discrete breather with a lattice junction

We study the scattering of a moving discrete breather (DB) on a junction in a Fermi-Pasta-Ulam chain consisting of two segments with different masses of the particles. We consider four distinct cases: (i) a light-heavy (abrupt) junction in which the DB impinges on the junction from the segment with lighter mass, (ii) a heavy-light junction, (iii) an up mass ramp in which the mass in the heavier segment increases continuously as one moves away from the junction point, and (iv) a down mass ramp. Depending on the mass difference and DB characteristics (frequency and velocity), the DB can either reflect from, or transmit through, or get trapped at the junction or on the ramp. For the heavy-light junction, the DB can even split at the junction into a reflected and a transmitted DB. The latter is found to subsequently split into two or more DBs. For the down mass ramp the DB gets accelerated in several stages, with accompanying radiation (phonons). These results are rationalized by calculating the Peierls-Nabarro barrier for the various cases. We also point out implications of our results in realistic situations such as electron-phonon coupled chains.

Confinement of discrete breathers in inhomogeneously profiled nonlinear chains

We investigate numerically the scattering of a moving discrete breather on a pair of junctions in a Fermi-Pasta-Ulam chain. These junctions delimit an extended region with different masses of the particles. We consider (i) a rectangular trap, (ii) a wedge shaped trap, and (iii) a smoothly varying convex or concave mass profile. All three cases lead to DB confinement, with the ease of trapping depending on the profile of the trap. We also study the collision and trapping of two DBs within the profile as a function of trap width, shape, and approach time at the two junctions. The latter controls whether one or both DBs are trapped.

On-axis joint transform correlation based on a four-level power spectrum

We propose a method to obtain a single centered correlation with use of a joint transform correlator. We analyze the required setup to carry out the whole process optically, and we also present experimental results.

Effects of thresholding level variation in fringe binarization of multiobject joint transform correlation

It is possible to improve the fringe binarization method of joint transform correlation by choosing a suitable threshold level.

Controlled-intensity detection peaks in a binary joint transform correlator

In multiobject pattern recognition the height of the correlation peaks should be controlled when the power spectrum of ajoint transform correlator is binarized. In this paper a method to predetermine the value of detection peaks is demonstrated. The technique is based on a frequency-variant threshold in order to remove the intraclass terms and on a suitable factor to normalize the binary joint power spectrum. Digital simulations and experimental hybrid implementation of this method were carried out.

Nonlinear filtering in object and Fourier space in a joint transform optical correlator: comparison and experimental realization

The use of different kinds of nonlinear filtering in a joint transform correlator are studied and compared. The study is divided into two parts, one corresponding to object space and the second to the Fourier domain of the joint power spectrum. In the first part, phase and inverse filters are computed; their inverse Fourier transforms are also computed, thereby becoming the reference in the object space. In the Fourier space, the binarization of the power spectrum is realized and compared with a new procedure for removing the spatial envelope. All cases are simulated and experimentally implemented by a compact joint transform correlator.

Reduction of the effect of aberrations in a joint transform correlator

We report the study of the influence of optical aberrations in a joint-transform correlator: The wave aberration of the optical system is computed from data obtained by ray tracing. Three situations are explored: We consider the aberration only in the first diffraction stage (generation of power spectrum), then only in the second (transformation of the power spectrum into correlation), and finally in both stages simultaneously. The results show that the quality of the correlation is determined mostly by the aberrations of the first diffraction stage and that we can optimize the setup by moving the cameras along the optical axis to a suitable position. The good agreement between the predicted data and the experimental results shows that the method explains well the behavior of optical diffraction systems when aberrations are taken into account.

Discrete analysis of dividend payments in a non-life insurance portfolio

The process of free reserves in a non-life insurance portfolio as defined in the classical model of risk theory is modified by the introduction of dividend policies that set maximum levels for the accumulation of reserves. The first part of the work formulates the quantification of the dividend payments via the expectation of their current value under diferent hypotheses. The second part presents a solution based on a system of linear equations for discrete dividend payments in the case of a constant dividend barrier, illustrated by solving a specific case.

Retaining principal components for discrete variables

The present study discusses retention criteria for principal components analysis (PCA) applied to Likert scale items typical in psychological questionnaires. The main aim is to recommend applied researchers to restrain from relying only on the eigenvalue-than-one criterion; alternative procedures are suggested for adjusting for sampling error. An additional objective is to add evidence on the consequences of applying this rule when PCA is used with discrete variables. The experimental conditions were studied by means of Monte Carlo sampling including several sample sizes, different number of variables and answer alternatives, and four non-normal distributions. The results suggest that even when all the items and thus the underlying dimensions are independent, eigenvalues greater than one are frequent and they can explain up to 80% of the variance in data, meeting the empirical criterion. The consequences of using Kaiser"s rule are illustrated with a clinical psychology example. The size of the eigenvalues resulted to be a function of the sample size and the number of variables, which is also the case for parallel analysis as previous research shows. To enhance the application of alternative criteria, an R package was developed for deciding the number of principal components to retain by means of confidence intervals constructed about the eigenvalues corresponding to lack of relationship between discrete variables.

Applications of Fourier transform infrared spectroscopy

This article summarizes the basic principles of Fourier Transform Infrared Spectroscopy, with examples of methodologies and applications to different field sciences.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Evolutionarily stable learning schedules and cumulative culture in discrete generation models.

Individual learning (e.g., trial-and-error) and social learning (e.g., imitation) are alternative ways of acquiring and expressing the appropriate phenotype in an environment. The optimal choice between using individual learning and/or social learning may be dictated by the life-stage or age of an organism. Of special interest is a learning schedule in which social learning precedes individual learning, because such a schedule is apparently a necessary condition for cumulative culture. Assuming two obligatory learning stages per discrete generation, we obtain the evolutionarily stable learning schedules for the three situations where the environment is constant, fluctuates between generations, or fluctuates within generations. During each learning stage, we assume that an organism may target the optimal phenotype in the current environment by individual learning, and/or the mature phenotype of the previous generation by oblique social learning. In the absence of exogenous costs to learning, the evolutionarily stable learning schedules are predicted to be either pure social learning followed by pure individual learning ("bang-bang" control) or pure individual learning at both stages ("flat" control). Moreover, we find for each situation that the evolutionarily stable learning schedule is also the one that optimizes the learned phenotype at equilibrium.