高速色散补偿系统中喇曼放大器性能研究

利用喇曼放大器的非线性偏微分耦合方程组,对带喇曼放大器的色散补偿系统进行了仿真,并与传统的仿真方法进行了比较.结果表明:在色散完全补偿系统中,当传输速率较高时,忽略色散后的传统仿真方法的结果,与采用色散补偿技术后使整个系统色散为零的仿真结果有一定偏差,此时不能忽略色散的作用.还对前补偿系统和后补偿系统进行了研究,利用Q值性能判别法,分别得到了信号光脉冲的最佳占空比和最佳脉冲阶数.     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

三种群食物链交错扩散模型的整体

本文应用能量估计方法和Gagliardo-Nirenberg型不等式证明了一类强耦合反应扩散系统整体解的存在性和一致有界性，该系统是带自扩散和交错扩散项的三种群Lotka-Volterra食物链模型．通过构造Lyapunov函数给出了该模型正平衡点全局渐近稳定的充分条件．     

可允许集上的广义向量拟均衡问题

主要讨论可允许集上的广义向量拟均衡问题,推广L in的一些结果.     

空气比热容比实验的非绝热问题

通过一系列的实验数据分析，发现空气比热容比实验中非绝热现象不可以忽略．     

Hydrodynamical limit for a drift-diffusion system modeling large-population dynamics

In this paper we study the stability of the following nonlinear drift-diffusion system modeling large population dynamics ∂_tρ+div(ρU−ε∇ρ)=0, divU=±ρ, with respect to the viscosity parameter ε. The sign in the second equation depends on the attractive or repulsive character of the field U. A proof of the compactness and convergence properties in the vanishing viscosity regime is given. The lack of compactness in the attractive case is caused by the blow-up of the solution which depends on the mass and on the space dimension. Our stability result is connected, depending of the character of the potentials, with models in semiconductor theory or in biological population.     

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

FI代数的滤子

研究FI代数的滤子理论，建立F滤子、P滤子、Q滤子、C滤子之间的联系．     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.