Exact Solutions to Space-Time Fractional Fokas-Lenells Equations With Parameters北大核心CSCD

利用多项式完全判别系统法求得非线性光学中带参数时空分数阶Fokas-Lenells方程在一般情况下的精确解,包括有理函数解、周期解、孤波解、Jacobi椭圆函数解和双曲函数解等,绘制了精确解的相关图像,并由此分析了参数对解的结构的影响。     

一类广义Zakharov方程的精确行波解

本文研究了一类广义Zakharov方程的精确解行波解的问题.利用改进的G/G展开方法,借助于计算机代数系统Mathematica,获得了具有重要物理背景的广义Zakharov方程一系列新的含有多个参数的精确行波解,这些解包括孤立波解,双曲函数解,三角函数解,以及有理函数解.     

Riccati展开法求非线性Konno-Oono耦合方程的新精确解

应用Riccati展开法,给出了非线性Konno-Oono方程的一系列新精确解.这些解的形式包括三角函数解、双曲函数解、有理函数解.最后,对特殊函数下的精确解进行数值模拟,给出这些精确解的直观表示.     

关于运输问题最优解的进一步讨论

首先给出了运输问题最优解的相关概念,将最优解扩展到广义范畴,提出狭义多重最优解和广义多重最优解的概念及其区别.然后给出了惟一最优解、多重最优解、广义有限多重最优解、广义无限多重最优解的判定定理及其证明过程.最后推导出了狭义有限多重最优解个数下限和广义有限多重最优解个数上限的计算公式,并举例验证了结论的正确性.     

向量均衡问题的超有效性的对偶形式

在局部凸空间中引进了向量均衡问题的强超有效解、C-强超有效解、弱超有效解, C-弱超有效解、齐次超有效解、 C-齐次超有效解的概念,并在局部凸空间中用极理论为工具讨论了向量均衡问题的 C-弱超有效解, C-超有效解, C-齐次超有效解,以及C-强超有效解的对偶形式. 又在赋范线性空间中讨论了向量均衡问题的以上各种超有效解之间的等价性,并且在赋范线性空间具正规锥的条件下讨论了向量均衡问题的以上各种超有效解的对偶形式. 作为它的应用,给出了向量优化问题各种超有效解的对偶形式.     

多目标优化问题McRow最优解的刻画

基于多目标优化问题的McRow模型,该文确定了W-鲁棒有效解(也称为McRow最优解)与弱有效解、有效解以及真有效解的关系.首先, 针对确定多目标优化问题,研究了W-鲁棒有效解与各种精确解的关系.随后,针对随机多目标优化问题,引进McRow最优解的概念,给出了它与其余各种解的关系.算例表明,利用McRow模型所得到的解更具有鲁棒性.     

广义浅水波方程新的行波解

通过利用新的G展开法,并借助Mathematica计算软件,研究了广义浅水波方程的精确解,获得了该方程的含有多个任意参数的新的显式行波解,分别为三角函数解、双曲函数解、有理函数解和指数函数解,扩大了该类方程的解的范围.     

一类推广的KdV方程的新行波解

本文研究了一类推广的Kd V方程的行波解求解的问题.利用新的G展开法,并借助Mathematica计算软件,获得了该方程的含有多个任意参数的新的行波解,分别为三角函数解、双曲函数解、有理函数解和指数函数解,扩大了该类方程的解的范围.     

共振条件下一类方程无界解和周期解的共存性

讨论了在共振条件下一类具有等时位势的方程无界解和周期解的共存性．利用Poincare映射轨道的性质,给出了无界解的存在性条件．在此条件下,Poincare-Bohl定理,得到了方程的一个周期解,进而说明共振条件下这类方程无界解和周期解的是可以共存的．最后,给出了一个无界解和周期解共存的具有等时位势的方程实例．     

应用辅助方程法求Zakharov方程的精确解

应用辅助方程法求得Zakharov方程的精确解,这些解包括双曲函数解、三角函数解.当对双曲函数解中的参数取特殊值时,可得到孤立波解:当对三角函数解中的参数取特殊值时,可得到周期波函数解.实践表明:辅助方程法在非线性光学、量子光学、激光物理和等离子体物理等领域具有广泛的应用.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

基于规模的企业竞争力蜘蛛图法评价研究

科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点.     

On property of injectivity for real W*-algebras and JW-algebras

In this paper injective real W*-algebras are investigated. It is shown that injectivity is equivalent to the property of E (extension property). It is proven that a real W*-algebra is injective iff its hermitian part is injective, and it is equivalent to, that the enveloping W*-algebra is also injective. Moreover, it is shown that if the second dual space of a real C*-algebra is injective, then the real C*-algebra is nuclear.     

几种类型的K~*空间的特征

<正> §1.引言 假设非平坦的 n 维黎曼空间的曲率张量 R_(hijk)在每一点恒满足下列关系(?)其中(?)是某一向量场,同时也满足     

A numerical method for stationary shock problems with monotonic solutions

Numerical methods are considered for singularly perturbed quasilinear problems having interior-shock solutions. It is shown that the direct discretization on a layer-adapted mesh is ineffective for these problems. A special method is proposed for the case when the solution is monotonic: the problem is transformed by interchanging the dependent and independent variables, and it is then discretized on a uniform mesh. The method is analyzed both theoretically and numerically. It is shown that it can be effective, but that it is not entirely without problems. An approach for improving the method is suggested.     

关于拟平坦模的几个注记

本文所有的环均指有单位元的环,模均指酉模。左R-模M称为拟内射的,如果对任意N相似文献   

List star chromatic index of sparse graphs

A star edge-coloring of a graph $G$ is a proper edge coloring such that every 2-colored connected subgraph of $G$ is a path of length at most 3. For a graph $G$, let the list star chromatic index of $G$, $c{h}_s^{\prime }\left(G\right)$, be the minimum $k$ such that for any $k$-uniform list assignment $L$ for the set of edges, $G$ has a star edge-coloring from $L$. Dvo?ák et al. (2013) asked whether the list star chromatic index of every subcubic graph is at most 7. In Kerdjoudj et al. (2017) we proved that it is at most 8. In this paper we consider graphs with any maximum degree, we proved that if the maximum average degree of a graph $G$ is less than $\frac{14}{5}$ (resp. 3), then $c{h}_s^{\prime }\left(G\right)\le 2\Delta \left(G\right)+2$ (resp. $c{h}_s^{\prime }\left(G\right)\le 2\Delta \left(G\right)+3$).     

A sufficient condition for DP-4-colorability

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-choosable. Furthermore, Jin et al. (2016) showed that for each $k\in \{3,4,5,6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In this paper, we show that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-DP-colorable, which is an extension of the above results.     

Minima of sequences of Gaussian random variables

For a given sequence of real numbers $a_1,\dots ,a_n$ we denote the k-th smallest one by $k\text{-}{\min }_{1?i?n}{a}_i$. We show that there exist two absolute positive constants c and C such that for every sequence of positive real numbers $x_1,\dots ,x_n$ and every $k?n$ one has

$c\underset{1?j?k}{\max }\frac{k+1?j}{{\sum }_{i=j}^{n}1/x_i}?\mathbb{E}k\text{-}\underset{1?i?n}{\min }|x_i{g}_i|?C\ln (k+1)\underset{1?j?k}{\max }\frac{k+1?j}{{\sum }_{i=j}^{n}1/x_i},$

where $g_i\in N(0,1)$, $i=1,\dots ,n$, are independent Gaussian random variables. Moreover, if $k=1$ then the left hand side estimate does not require independence of the $g_i$s. Similar estimates hold for $\mathbb{E}k\text{-}{\min }_{1?i?n}{|x_i{g}_i|}^p$ as well. To cite this article: Y. Gordon et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).