Constructions of External Difference Families and Disjoint Difference Families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.     

Bifurcations of travelling wave solutions in a new integrable equation with peakon and compactons

Degasperis and Procesi applied the method of asymptotic integrability and obtain Degasperis–Procesi equation. They showed that it has peakon solutions, which has a discontinuous first derivative at the wave peak, but they did not explain the reason that the peakon solution arises. In this paper, we study these non-smooth solutions of the generalized Degasperis–Procesi equation u_t − u_txx + (b + 1)uu_x = bu_xu_xx + uu_xxx, show the reason that the non-smooth travelling wave arise and investigate global dynamical behavior and obtain the parameter condition under which peakon, compacton and another travelling wave solutions engender. Under some parameter condition, this equation has infinitely many compacton solutions. Finally, we give some explicit expression of peakon and compacton solutions.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

Phase-synchronisation in continuous flow models of production networks

To improve their position at the market, many companies concentrate on their core competences and hence cooperate with suppliers and distributors. Thus, between many independent companies strong linkages develop and production and logistics networks emerge. These networks are characterised by permanently increasing complexity, and are nowadays forced to adapt to dynamically changing markets. This factor complicates an enterprise-spreading production planning and control enormously. Therefore, a continuous flow model for production networks will be derived regarding these special logistic problems. Furthermore, phase-synchronisation effects will be presented and their dependencies to the set of network parameters will be investigated.     

Relation among nonlinear evolution equations and their reductions

The LCZ soliton hierarchy is presented, and their generalized Hamiltonian structures are deduced. From the compatibility of soliton equations, it is shown that this soliton hierarchy is closely related to the Burger equation, the mKP equation and a new (2 + 1)-dimensional nonlinear evolution equation (NEE). Resorting to the nonlinearization of Lax pairs (NLP), all the resulting NEEs are reduced into integrable Hamiltonian systems of ordinary differential equations (ODEs). As a concrete application, the solutions for NEEs can be derived via solving the corresponding ODEs.     

An efficient construction of period-2 bulbs in the cubic Mandelbrot set with parametric boundaries

A parametric boundary equation is established for the principal period-2 bulb in the cubic Mandelbrot set. Using its geometry, an efficient escape-time algorithm which reduces the construction time for the period-2 bulbs in the cubic Mandelbrot set is introduced and the implementation graphic results display the fascinating fractal beauty     

Necessary and sufficient conditions in constrained optimization

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

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.