P3，4m的优美性

设u、v是两个固定顶点,用b条内部互不相交且长度均为a的道路连接u、v所得到的图用Pa,b表示.Kathiresan证实P2r,2m-1(r,m均为任意正整数)是优美的,且猜想除了(a,b)=(2r+1,4s+2)外,所有的Pa,b都是优美的.杨元生已证实P2r+1,2m-1是优美的.本文证明P3,4m是优美图,从而当a=3时Kathiresan猜想成立.     

Banach空间中含Lipschitz强增生 算子的算子方程之构造可解性

设X为实一致光滑Banach空间 ,A :X→X为Lipschitz强增生算子 ,设L≥ 1和k∈( 0 ,1)分别为A的Lipschitz常数与强增生常数。设 {tn}n≥ 0 为 ( 0 ,1]中的实数列满足条件 :(i)tn→ 0 (n→∞ ) ;(ii)∑∞n =0 tn=∞ , f∈X , x0 ∈X ,迭代地定义序列 {xn}n≥ 0如下 :( )　　xn 1 =xn-tn(Axn- f) ,n≥ 0 .则 {xn}n≥ 0 强收敛于方程Ax =f的唯一解 ,而且对充分大的n≥n0 ,‖Axn- f‖ ≤ exp{-k∑n- 1j=n0tj}‖Axn0 - f‖　　一个相关的结果研究含强伪压缩映象的方程Tx =x的构造可解性。     

Gabor框架的稳定性研究

对于Hilbert空间中的Gabor框架,定义A=inf x∈[0,a][∑n∈Z｜f（x-na）｜^2-∑k≠0｜∑n∈Zf（x-na）f^-（x-na-k/b｜]〉0,B=supx∈[0,a]∑n∈Z｜∑n∈Zf（x-naf^-（x-na-k/b）｜〈∞,通过算子放缩证明的方法,可知{Mb^mSa^nf}m,n∈Z构成L^2（R）的框架,且框架界为A/b,B/b.     

具有正交(g,f)-因子分解的子图

设G是一个图 ,g (x)和f (x)是定义在V (G)上的整数值函数 ,且对任意的x∈V (G) ,设g (x)≤f (x) ,H是G的一个子图 ,F ={F1,F2 ,… ,Ft}是G的一个因子分解 ,如果对任意的 1≤i≤t,|E (H)∩E (Fi) |=1 ,则称F与H正交。闫桂英和潘教峰在文 [3]中提出如下猜想 :设G是一个 (mg+k,mf-k) -图 ,1≤k相似文献   

一类三次系统的中心—焦点判定

预备知识定义设函数g(x)任C“,张算子29:C-一C‘,定义为 Z。(‘’‘·,一(毙)‘这样,““,(·,一(病(毙{,其余类推。关于张算子有如下三个结论:命题一若f(x)任C一,且f(x)=ah(x)(a为常数),则有Z盆(f)(x)=aZ菩(h)(x)(Vn任N)。命题2设f(x)、g(x)任C一,且f(o)=g(0)~o,f‘(0)=g‘(0)一1,那么,(1)Z‘(f)(o)=一Zf(g)(0);(2)若Z尝(f)(o)~o,1簇k成n一z,则Z盆(f)(o)-一ZP(g)(o)。命题3 Li色nard型方程!爷一y一万(于’几y-一g叹Xj其中;(二)一芡f(?)d?,f(。)一。,g(X)一 h一t,并设v3,vs,一vZn·;表示各阶焦J点量。,;么,(1)v3一z:(,)(。)一}澳{…     

一类差分方程的三点边值问题的正解

研究了一类离散型三点边值问题:Δ2y(k-1) a(k)f(k,y(k))=0,k∈N={1,2,…,T},Δy(0)=0,y(T 1)=βy(l),式中:f是变号的,l∈N1={2,3,…,T-1},T∈{3,4,…}。应用双锥上的不动点定理,得到了至少存在两个正解的充分条件,并给出了上述边值问题的Green函数。     

我国论文总数居世界第11位

B@ozk0＄;;。W＄SO”Al?;12SN口m口NeF＄＄wD98＄＄XE＄1]丫凶I三茨矿坦二二呛X囚z丁芙。bq工z于区妇二G二”十S一汹9艺一召一服f田._._灼_三二C,_二_二收L..t:二iC6k＃＃ta＄G4:6op＃ S11＄@sc恤囚合一窍册仓卓曰匕a,％M,％@0＆f＄＄％＄＄44＄teMll＄o@@X％kSBK＃K＄＄M,,k①     

最佳（n,2,w）二进制等重检错码的研究

本文研究了最佳(n,2,w)二进制等重检错码的存在性问题。对于文[5]中n 为偶数时所得的结论,本文给了一个简练的证明。更为重要的是,利用以上方法,作者证明了文[5]中关于n 为奇数时的一个猜想。     

欧拉猜想计算机证明的一个新算法

文献（１）通过直接构造正交拉丁方对解答树并搜索树的所有结点这一算法,用计算机证明了不存在６阶正交拉丁方对。本文对上述算法做了改进,首先寻找所有６阶标准拉丁方,然后运用遍历解答树每个结点的方法逐一证明没有与之正交的拉丁方,从而实现欧拉猜想的机器证明,新算法使得机器运行时间大为缩短。     

离散系统卷积和的简便计算法

在无线电电子学领域中.欲求离散时间系统中的零状态响应,常常要用卷积和的方法.其计算步骤是:(1)画出两个相卷积的函数f(k)与h(k)的图形.(2)进行变量代换.得到f(j)、h(j).(3)将h(j)反折,得b(-j).(4)将h(-j)沿j轴平移k个单.得到h(k-j).(5)将h(k-j)与f(j)相乘.     

论高校学报“作者”和“参考文献”标注的规范化

我国的各种期刊杂志都在倡导各种规范的国际接轨。无论自然版（理工科）还是哲学与社会科学版（文科）学报研究会,都出台了相关规定。但是,我国高校学报编排规范化的问题却依然明显地存在着。其中,“作者”和“参考文献”标注问题更为突出。既然是规范,就必须在充分讨论的基础上整齐划一。     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

递归划分的标签约束可达性计算方法

现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。     

层次化新闻视频处理框架的设计与实现

提出了一个通用的层次化新闻视频处理框架,将新闻视频处理分为句法分段、语义标注以及视频摘要三个层次,并给出了三个层次中涉及的故事单元探测、字幕探测、视频摘要等关键技术的解决方案。框架突破了传统的新闻视频处理框架仅局限于句法分段以及单媒体特征进行处理的缺陷,通过对视音频特征进行多模态的综合分析来获取新闻视频高层的语义内容。实验通过一个新闻视频处理原型系统NVPS验证了框架的可行性,重点对故事单元探测、标题探测以及口播帧探测三个算法进行了实验,实验结果分别达到88%,86%和86%的探测准确率,从而进一步证实了层次框架在新闻视频处理方面的有效性。     

基于不稳定性采样的主动学习方法

传统的主动学习方法往往仅基于当前的目标模型来挑选样本,而忽略了历史模型所蕴含的对未标注样本预测稳定性的信息。因此,提出基于不稳定性采样的主动学习方法,依据历史模型的预测差异来估计每个未标注样本对提高模型性能的潜在效用。该方法基于历史模型对样本的预测后验概率之间的差异来衡量无标注样本的不稳定性,并挑选最不稳定的样本进行查询。在多个数据集上的大量实验结果验证了方法的有效性。     

Putin – the masked nemesis of the strategy of ambiguity

Recent events demonstrate the complex and adaptive approach employed by Russia to reassert influence in Europe. The changing face of Russia’s strategy commenced in 2007 when it launched a crippling cyber-attack against Estonia. This was followed by a large Russian conventional attack against Georgia in 2008, occupying two large areas of the nation. 2014 witnessed the Russian annexation of Crimea where in just a week, Russia seized control of Crimea “without firing a shot.” The annexation of Crimea was rapidly followed by a Russian inspired and led subversive war in eastern Ukraine. The common thread among these diverse Russian operations is its use of ambiguity to confound and confuse decision makers in the West.     

India's counter-insurgency experience: the ‘trust and nurture’ strategy

The Indian Army, a force trained primarily for conventional warfare, has been engaged in internal counter-insurgency operations since the 1950s. Despite such a long innings on a counter-insurgency mode, little attention has been accorded within military circles to doctrinal innovation for waging sub-conventional warfare in India's democratic political context. At best, the Army continues to view counter-insurgency duty as secondary to its primary duty of defending India from external conventional threats. By conceptualizing a counter-insurgency strategy of ‘trust and nurture’, this article aims to fill this critical doctrinal gap in India's military policy. The author argues that a counter-insurgency strategy of ‘trust and nurture’ based on democratic political culture, measured military methods, special counter-insurgency forces, local social and cultural awareness and an integrative nation-building approach will result in positive handling of India's internal security problems. The author utilizes India's counter-insurgency experiences in Assam, Mizoram, Nagaland, Punjab, and Operation ‘Sadhbhavana’ in Jammu and Kashmir as illustrative empirical indicants in order to validate the ‘trust and nurture’ strategy.     

An Unlikely Alliance: Portuguese and South African Airpower in Angola, 1968–1974

The war that Portugal was obliged to fight in Africa began in 1961 and immediately stretched the resources of its armed forces. Nowhere was this thinness more apparent than in policing the vast territory of Angola. The east and southeast of Angola were particularly vulnerable, as the area was a vast, sparsely populated region characterised by enormous featureless plains or chanas covered in tall grass and broken by an extensive river system and mountainous forests. The only military solution to policing these immense spaces was aviation and specifically the helicopter that could carry troops into battle, protect them with a gunship and bring them home when the operation was concluded. The immediate problem for the Portuguese Air Force (Força Aérea Portuguesa or FAP) in Angola and elsewhere was a scarcity of helicopters. The solution was an alliance with South Africa, which had a strong inventory of Alouette IIIs, to help in policing the east. This move was likewise in the interest of South Africa, as its threat came from Zambia through south-eastern Angola. This article examines the strategic and tactical development of this unusual, cross-cultural alliance and the symbiotic relationship that resulted in destruction of the enemies of both in Angola.     

国内外结构钢焊条研究的现状与发展

本文主要介绍了国外焊条的现状和发展趋势,包括焊条的高韧性、高效率、低尘低毒和耐吸潮性能,为国内的焊条研究提供了参考依据。