Prognostication of aging of polymeric composite materials

Experimental data demonstrate that a study of accelerated aging can enable prognostication of the working capacity and storage life of polymeric formulations used in aircraft components on the basis of changes in thermogravimetric constants of these polymeric formulations.     

Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models

This paper proposes a new method that extends the efficient global optimization to address stochastic black-box systems. The method is based on a kriging meta-model that provides a global prediction of the objective values and a measure of prediction uncertainty at every point. The criterion for the infill sample selection is an augmented expected improvement function with desirable properties for stochastic responses. The method is empirically compared with the revised simplex search, the simultaneous perturbation stochastic approximation, and the DIRECT methods using six test problems from the literature. An application case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency and efficiency in finding global optimal solutions, and is particularly useful for expensive systems.     

Transverse susceptibility as the low-frequency limit of ferromagnetic resonance

A new theory of transverse susceptibility (TS) based on magnetization vector dynamics, as described by the Landau–Lifshitz equation of motion, is given. It is shown that the traditional TS experiment is, in fact, the zero-frequency limit of the ferromagnetic resonance (FMR). The importance of these results resides in the generality of the approach which allows one to find the TS for virtually any magnetic system if an expression for the magnetic free-energy density is known. Moreover, the effect of the frequency of excitatory AC field on the TS experiments and the effect of energy dissipation through the imaginary part of TS emerge coherently from the new TS model.     

Improving the Fundamental Theorem of Algebra

Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.     

Ultrashort-pulse dual-wavelength source for digital holographic two-wavelength contouring

Digital holographic shape measurements using femtosecond laser pulses are reported. For contouring of very fast moving objects, the simultaneous generation of at least two spectrally separated ultrashort pulses is required. To deliver this particular spectral signature at high pulse energies, a chirped-pulse Ti:sapphire laser amplifier was modified to emit two spectrally separated pulses with energies above 1 μJ each. The wavelength separation of these pulses was adjustable within the 50 nm gain bandwidth, cutting out two distinct wavelength peaks by a variable double-slit assembly in a prism sequence. A Michelson-type interferometer was employed to perform the two-wavelength contouring. The phases of the holograms and the phase differences are calculated numerically, which allow us to deduce the contour lines of the topology of the object. The suitability of the light source for digital holography is demonstrated with contouring of stationary objects and the potential for high-speed applications is indicated. PACS 42.40.-i; 42.60.By     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.