A family of skew Hadamard difference sets

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.     

The Generalized West Decomposition of Operators and Other Compact Perturbation Problems

This paper introduces the concept of the generalized Riesz operators and the concept of the generalized West decomposition of a general operator which generalizes the definition of the West decomposition of Riesz operators, and proves that the following three statements are equivalent on a general Banach space： （a） Every generalized Riesz operator has the generalized West decomposition; （b） Every operator makes strong Stampfli theorem true; Every operator has Apostol＇s compact correction.     

一类非线性方程解的存在和唯一性及在图像中的应用

本文我们给出一个修正的非线性扩散方程模型，与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分：卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题，因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性，同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型，并且给出几个具体图像在该模型下处理结果。     

Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition

In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The new method preserves the global convergence of the traditional trust region methods in which the trust region radius will be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic. Finally, some numerical results are given. This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong University, and E-Institute of Computational Sciences of Shanghai Universities. An erratum to this article is available at .     

About Regularity of Collections of Sets

The paper continues investigations of stationarity and regularity properties of collections of sets in normed spaces. It contains a summary of different characterizations (both primal and dual) of regularity and a list of sufficient conditions for a collection of sets to be regular.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

Isomorphisms of fiber spaces over Teichmüller spaces

We will be mainly concerned with some important fiber spaces over Teichmuller spaces, including the Bers fiber space and Teichmuller curve, establishing an isomorphism theorem between "punctured" Teichmuller curves and determining the biholomorphic isomorphisms of these fiber spaces.     

Successive column correction algorithms for solving sparse nonlinear systems of equations

This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-successive column correction algorithm and a modified CM-successive column correction algorithm. Aq-superlinear convergence theorem and anr-convergence order estimate are given for both algorithms. Some numerical results and the detailed comparisons with some previously established algorithms show that the new algorithms have some promise of being very effective in practice.This research was partially supported by contracts and grants: DOE DE-AS05-82ER1-13016, AFOSR 85-0243 at Rice University, Houston, U.S.A. and Natural Sciences and Engineering Research Council of Canada grant A-8639.     

利用驻波实验研究混沌现象

利用驻波实验演示了混沌现象,并对其进行了理论分析和计算机仿真研究.仿真结果与实验结果都表明:当连接点接近驻波波节处时,振动系统处于混沌运动状态;而当连接点接近驻波波腹处时,系统处于稳定驻波运动状态.