越过临界状态的奇异扩散方程

本文讨论越过临界状态的奇异扩散方程Cauchy问题和带非线性边界条件的第二边值问题的可解性与不可解性.主要结果是(1)若‖u0‖L1(R)＜+∞,则对任意的正数T,方程的Cauchy问题在带型区域QT=R×(0,T)中不存在关于变量x为L1(R)可积的正解;(2)当且仅当T≤T0,矩形区域GT=(0,1)×(0,T)中的一类非线性边值问题存在唯一的经典解,其中T0=u0=∫10u0(x)dx.     

导数型非线性Schr?dinger方程

正Schr?dinger方程主要源于量子力学、光学和深水波;此方程在量子力学的研究中有着很重要的作用.本文主要考虑如下的导数型非线性Schr?dinger方程的Cauchy问题:iu_t+(-Δ)u=iλ·▽(|u|~2u),(t,x)∈R×R~n,u(0,x)=u_0(x),(1)     

无界区域中的非线性双曲型方程

本文研究无界区域中的非线性双曲方程u_tt+A2u+M(x,||A1/2u||₂2)Au=0这类问题的模型来自梁的横向挠曲方程.本文利用不动点方法结合能量估计证明了当M与x有关时,上述方程局部解的存在唯一性.     

带吸收项的非线性双重退缩抛物方程的Cauchy问题

讨论带吸收项的非线性双重退缩抛物方程ut=div(│↓△u^m│^p-2↓△u^m)-u^q u(x,0)=u0(x)的Cauchy问题。     

球外部区域上非线性椭圆型方程的正径向解

本文讨论球外部区域Ω={x∈RN||x|>R}上非线性椭圆边值问题正径向解的存在性,其中g(r),f(u)为非负连续函数.在g(r)满足条件0<∫R∞rg(r)dr<∞,f(u)关于u超线性或次线性增长的情形,获得了该问题正径向解的存在性.     

一类变指数基尔霍夫型方程的无穷多解

本文研究带有各向异性p(x)-Laplace算子的基尔霍夫型方程Dirichlet边值问题-N∑i=1M_i(∫_Ω|_x_iu|~(pi(x)pi(x)dx)_x_i(|_x_iu|~(pi(x)-2_x_iu=H(∫_ΩF(x,u)dx)f(x,u),x∈Ω,u=0,x∈Ω其中Ω是R~N(N≥3)中具有光滑边界的有界区域,f(x,u)∈C(×R,R),,i=1,2,…,N,且M_i(t):R~+→R~+,H(t):R→R和p_i(x):→R为连续函数.当非线性项在零点附近次线性增长时,运用临界点理论中的Clark定理获得了新的多重解存在性结果.     

一类非线性抛物方程的初边值问题

本文研究了一类非线性抛物方程的初边值问题,即ut-f(u)xx=0,x∈R+,f'(u)＞0,u(0,t)=u_,t≥0;u(+∞,0)=u+.这里我们考虑一般情形,即u_≠u+.在某种小性条件下,我们证明了以上抛物方程的解存在且当时间充分大时,解趋近该问题的自相似解(-u)(x/√1+t).我们还进-步得到了解的最优衰减速度为(1+t)-1/4.     

临界情形的非齐次半线性椭圆型方程的多解性

考虑有界区域Ω RN 上非齐次半线性椭圆型方程 -Δu(x) =up(x) λf(x)在齐次混合边值条件 (即第三边值问题 ) u n au Ω =0下正解的存在性 ,其中α ,λ≥ 0 ,p=N 2N- 2 ,N>2 ,f(x) ∈L∞(Ω) .证明了存在常数λ >0 ,当λ∈ (0 ,λ )时 ,上述问题至少存在两个正解     

一类具强非线性源的半线性热方程解的性质

讨论了具强非线性源的半线性热方程ut=△u m in{-ε1,up}边值问题解的性质,证明了TK(uε)在L2(0,T;W10,2(Ω))中关于ε是一致有界的,且(TK(uε))t在L2(Q)中关于ε是一致有界的,从而存在一子列和一可测函数u(x,t)使得当ε→0时,uε→u a.e.于Q.其中TK(r)=m in{K,m ax(r,-K)},Q=Ω×(0,T).     

非经典反应扩散方程在R~3中全局吸引子的存在性

该文证明了带有临界非线性项的非经典反应扩散方程{vt-Δvt-Δu+f(x1,u)=g(x),(x,t)∈R3×R+ u(s,t)|t=0=v0, x∈R3}在H~1(R~3)上的全局吸引子的存在性,推广和改进了文献[15]的结果.     

On the Multiplicity Problem and the Isomorphism Problem for the Four Subspace Algebra

Let Λ be the four subspace algebra. We show that for any Λ-module M there exists an algorithm (up to the problem of finding roots of the so-called characteristic polynomial of M) with relatively low polynomial complexity of determining multiplicities of all direct summands of M. Moreover, we give a fully algorithmic criterion for deciding if two Λ-modules M and N are isomorphic.     

确定Sturm-Liouville问题中系数的反问题

讨论确定Sturm－Liouville问题中算子的系数α（x）或者q（x）的问题．在一定条件下,系数α（x）或者q（x）可由数据或者数据唯一确定,这里的u_j（x）满足而构成L²（0,1）的一个基,α和β为给定的实数.     

Modified Moment Problem in Complex Domains

We study the moment problem in a complex domain. The results obtained generalize and sharpen the well-known Kaz'min result. We also consider applications of these results to the Abel--Goncharov problem (the uniqueness and construction problem) and to the completeness problem for systems of analytic functions.     

Capacitated transportation problem with bounds on RIM conditions

Motivated by dead-mileage problem assessed in terms of running empty buses from various depots to starting points, we consider a class of the capacitated transportation problems with bounds on total availabilities at sources and total destination requirements. It is often difficult to solve such problems and the present paper establishes their equivalence with a balanced capacitated transportation problem which can be easily solved by existing methods. Sometimes, total flow in transportation problem is also specified by some external decision maker because of budget/political consideration and optimal solution of such problem is of practical interest to the decision maker and has motivated us to discuss such problem. Various situations arising in unbalanced capacitated transportation problems have been discussed in the present paper as a particular case of original problem. In addition, we have discussed paradoxical situation in a balanced capacitated transportation problem and have obtained the paradoxical solution by solving one of the unbalanced problems. Numerical illustrations are included in support of theory.     

The weighted Fermat-Torricelli problem on a surface and an “inverse” problem

We study the weighted Fermat-Torricelli (w.F-T) problem for geodesic triangles on a C² complete surface and on an Aleksandrov space of curvature bounded above by a real number K and solve an “inverse” problem on a C² complete surface. The solution of the w.F-T problem and the inverse w.F-T problem on a C² complete surface is based on the differentiation of the length of geodesics with respect to the arc length.     

Minimum power multicasting problem in wireless networks

In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model’s constraints. We also report some experimental results carried out on a set of randomly generated test problems.     

Interface Problems for Elliptic Systems

Interface problems for elliptic systems of second order partial differential equations are studied. The main result is that the solution in the neighborhood of the singular point can be divided into two parts one of which is a solution to the homogeneous system with constant coefficients, and the other one possesses higher regularity.     

A school bus scheduling problem

This paper introduces a school bus scheduling problem wherein trips for each school are given. A trip consists of a sequence of bus stops and their designated school. Each school has its fixed time window within which trips should be completed. A school bus can serve multiple trips for multiple schools. The school bus scheduling problem seeks to optimize bus schedules to serve all the given trips considering the school time windows. We first model the problem as a vehicle routing problem with time windows (VRPTW) by treating a trip as a virtual stop. Two assignment problem based exact approaches are then proposed for special cases and a heuristic algorithm is proposed for more general cases. Benchmark problems and computational experiments are presented. Computational experiments show the effectiveness of the proposed approaches.