Exact Solutions of Extended Boussinesq Equations

The problem addressed in this paper is the verification of numerical solutions of nonlinear dispersive wave equations such as Boussinesq-like system of equations. A practical verification tool for numerical results is to compare the numerical solution to an exact solution if available. In this work, we derive some exact solitary wave solutions and several invariants of motion for a wide range of Boussinesq-like equations using Maple software. The exact solitary wave solutions can be used to specify initial data for the incident waves in the Boussinesq numerical model and for the verification of the associated computed solution. The invariants of motions can be used as verification tools for the conservation properties of the numerical model.     

Classical and quantum integrability for a class of potentials in two dimensions

A method for the construction of the second constant of motion in fourth order is carried out. Correspondingly the fourth order potential equation is obtained whose solutions directly provide the classical integrable systems. Second constant of motion is obtained for a large class of potentials. Quantum invariants are also obtained with second order quantum corrections of the order O(?²) to the corresponding classical invariants. The phase space diagrams for these cases are drawn using a mathematical computer software package in two dimensions.     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

Predictive control of periodic-review production inventory systems with deteriorating items

In this paper a predictive control strategy is applied to a periodic-review dynamic inventory system with deteriorating items. Given the current inventory level, we determine the optimal production rates to be implemented at the beginning of each of the following periods over the control horizon. The effectiveness of this approach is the use of future information of the inventory target level and the desired production rate, which are available, along the fixed horizon. The deterioration coefficient may be known or unknown and both cases are considered. In the case where it is unknown, the self-tuning predictive control is applied. The proposed control algorithms are illustrated by simulations.     

Sharp condition of global existence for second-order derivative nonlinear Schrödinger equations in two space dimensions

This paper discusses a class of second-order derivative nonlinear Schrödinger equations which are used to describe the upper-hybrid oscillation propagation. By establishing a variational problem, applying the potential well argument and the concavity method, we prove that there exists a sharp condition for global existence and blow-up of the solutions to the nonlinear Schrödinger equation. In addition, we also answer the question: how small are the initial data, the global solutions exist?     

Two classes of piecewise-linear difference equations with eventual periodicity three

In this paper, we will study two classes of difference equations which are piecewise-linear and of similar forms. We will show that all nontrivial solutions of one equation are eventually periodic with prime period three. We will show this result for one case of the second equation.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

判定Q上多项式不可约的一种方法

本文运用复变函数论中的Rouche定理,对Person不可约方法作了大的改进,一系列多项式的不可约性被证实.     

Emergence of self-replicating structures in a cellular automata space

Past cellular automata models of self-replication have always been initialized with an original copy of the structure that will replicate, and have been based on a transition function that only works for a single, specific structure. This article demonstrates for the first time that it is possible to create cellular automata models in which a self-replicating structure emerges from an initial state having a random density and distribution of individual components. These emergent self-replicating structures employ a fairly general rule set that can support the replication of structures of different sizes and their growth from smaller to larger ones. This rule set also allows “random” interactions of self-replicating structures with each other and with other structures within the cellular automata space. Systematic simulations show that emergence and growth of replicants occurs often and is essentially independent of the cellular space size, initial random pattern of components, and initial density of components, over a broad range of these parameters. The number of replicants and the total number of components they incorporate generally approach quasi-stable values with time.