General expressions of peaked traveling wave solutions of CH-γ and CH equations

We use qualitative analysis and numerical simulation to study peaked traveling wave solutions of CH-γ and CH equations. General expressions of peakon and periodic cusp wave solutions are obtained. Some previous results become our special cases.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.

The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.     

数学物理方程中的通解问题

通过例证说明,通解法对于偏微分方程而言,其适用范围要比通常认为的大.并表明,只要适当变通,行波法就可用于有界情况.     

纵波模拟演示装置

介绍了一种纵波模拟演示装置，并给出了其结构要点及演示效果，实现了对纵波行波的演示。     

40 GHz Mode-Locked Semiconductor Lasers: Theory, Simulations and Experiment

We study both theoretically and experimentally typical operation regimes of 40 GHz monolithic mode-locked lasers. The underlying Traveling Wave Equation model reveals quantitative agreement for characteristics of the fundamental mode-locking as pulse width and repetition frequency tuning, as well as qualitative agreement with the experiments for other dynamic regimes. Especially the appearance of stable harmonic mode-locking at 80 GHz has been predicted theoretically and confirmed by measurements. Furthermore, we derive and apply a simplified Delay-Differential-Equation model which guides us to a qualitative analysis of bifurcations responsible for the appearance and the breakup of different mode-locking regimes. Higher harmonics of mode-locking are predicted by this model as well.     

Scattering theory relevant to the linear transport of particle swarms

The long-time behavior of the velocity distribution of a spatially uniform diluted guest population of charged particles moving within a host medium under the influence of a D.C. electric field is studied within the framework of scattering theory. We prove the existence of wave and scattering operators for a simplified one-dimensional model of the linearized Boltzmann equation. The theory is applied to the study of the long-term behavior of electrons and the occurrence of traveling waves in runaway processes.     

Traveling waves for a four-compartment lattice epidemic system with exposed class and standard incidence

This paper is considering the problem of traveling wave solutions (TWS) for a susceptible-exposed-infectious-recovered (SEIR) epidemic model with discrete diffusion. The threshold condition for the existence and nonexistence of TWS is obtained. More specifically, such kind of solutions are governed by the threshold number ?₀. We can find a critical wave speed c^? if ?₀ > 1, by employing the Schauder's fixed point theorem, limiting argument and two-sided Laplace transform, we confirm that there exists TWS for c > c^?, while there exists no TWS for c < c^?. We also obtain the nonexistence of TWS for ?₀ ≤ 1. At last, we give some biological explanations from the epidemiological perspective.