双层桥梁耦合系统的强迫振动

本文研究作为双层桥模型的梁方程耦合系统，利用Ｌｅｒａｙ－Ｓｃｈａｕｄｅｒ不动点定理，得到了一个关于这种系统的解的存在性定理，它类似于ＭｃＫｅｎｎａ和Ｗａｌｔｅｒ文２中关于吊桥方程的一个定理。     

共振下n维Lienard型方程的2π周期解

本文在跨共振点条件下证明n维Lienard型方程存在2π周期解.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

具有开发的非自治单种群生态系统研究

研究了具有开发的单种群非自治周期系统．利用非自治微分方程理论．以及变分法理论和泛函极值的Euler方程方法,得到了该开发系统的持续生存性．周期解存在性，全局渐近稳定性．研究了在开发情况下的最大收获量问题，以及取得最大经济效益下的收获问题等．     

具P-Laplacian算子型周期边值问题解的存在性

本文利用拓扑度理论和一些分析技巧讨论了具p—Laplacian算子型周期边值问题(φp(χ’))’+d/dt gradF(χ)+gradG(χ)=e(t),χ(0)=χ(T),χ’(0)=χ’(T)解的存在性,在对阻尼项d/dtgradF(χ)没有任何限制的前提下,给出了解存在的充分条件.     

On the counting function of the lattice profile of periodic sequences

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.     

Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

多维Lotka-Uolterra周期系统周期解的存在性及其全局吸引性

研究了m-维离散Lotka-Volterra竞争系统，并获得了该系统周期解的存在性及其全局吸引性.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.