期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
微分系统=y,=x(l-x^2)+(α-x^2)y的极限环的最大数目及相对位置 被引量:1
1
作者 姚卫红 《工程数学学报》 CSCD 北大核心 2000年第1期103-104,共2页
证明了微分系统   x=y,y=x(l - x2 ) +(α- x2 ) y   (l >0 )至多存在 3个极限环 ;当极限环存在时有且只有
关键词 极限环 焦点 鞍点 微分系统 最大数目 相对位置
下载PDF
两两正交拉丁方最大数目的新上界
2
作者 汤燕 李乔良 《数学理论与应用》 2005年第3期60-63,共4页
记D(x)是使得TD(x,n)存在的最小的数.本文给出D(x)的一个上界.
关键词 正交拉丁方 横截设计 平衡不完全区组设计 最大数目 上界
下载PDF
(v,e)——图正常2一着色的最大数目与极图
3
作者 陈协彬 《漳州师院学报》 1996年第4期25-27,共3页
设P(G,λ)表示图G的色多项式。给定正整数v,e和λ,设f(v,e,λ)=max(P(G,λ),G是个(v,e)-ltu )。若一个(v,e)-图G使得P(G,λ)=f(v,e,λ),则称G是个λ-极图。本文指出文... 设P(G,λ)表示图G的色多项式。给定正整数v,e和λ,设f(v,e,λ)=max(P(G,λ),G是个(v,e)-ltu )。若一个(v,e)-图G使得P(G,λ)=f(v,e,λ),则称G是个λ-极图。本文指出文「2」给出的2-极图族是不完全的,并得到2-级图的完全族。 展开更多
关键词 色多项式 极图 简单图 正常2-着色 最大数目
下载PDF
Texworld USA Winter Edition Features Largest Number of Exhibitors to Date
4
《China Textile》 2014年第3期22-22,共1页
The sixteenth edition of Texworld USA showcased 268 exhibitors from 18 countries representing an 13% increase over January 2013. The winter edition featured 4 international pavilions including Turkey, Taiwan, Egypt an... The sixteenth edition of Texworld USA showcased 268 exhibitors from 18 countries representing an 13% increase over January 2013. The winter edition featured 4 international pavilions including Turkey, Taiwan, Egypt and Pakistan covering 12 product categories to offer buyers an extensive array of fabrics, textile acessories and sourcing options. A total of 2,815 verified attendees visited the three day event. Visitors came from 43 countries including, but not limited to: United States, Canada, Mexico and India. 展开更多
关键词 参展商 最大数目 美国 冬季 巴基斯坦 产品类别 土耳其 加拿大
下载PDF
A robust object tracking framework based on a reliable point assignment algorithm 被引量:2
5
作者 Rong-feng ZHANG Ting DENG +2 位作者 Gui-hong WANG Jing-lun SHI Quan-sheng GUAN 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2017年第4期545-558,共14页
Visual tracking, which has been widely used in many vision fields, has been one of the most active research topics in computer vision in recent years. However, there are still challenges in visual tracking, such as il... Visual tracking, which has been widely used in many vision fields, has been one of the most active research topics in computer vision in recent years. However, there are still challenges in visual tracking, such as illumination change, object occlu- sion, and appearance deformation. To overcome these difficulties, a reliable point assignment (RPA) algorithm based on wavelet transform is proposed. The reliable points are obtained by searching the location that holds local maximal wavelet coefficients. Since the local maximal wavelet coefficients indicate high variation in the image, the reliable points are robust against image noise, illumination change, and appearance deformation. Moreover, a Kalman filter is applied to the detection step to speed up the detection processing and reduce false detection. Finally, the proposed RPA is integrated into the tracking-learning-detection (TLD) framework with the Kalman filter, which not only improves the tracking precision, but also reduces the false detections. Experimental results showed that the new framework outperforms TLD and kernelized correlation filters with respect to precision, f-measure, and average overlap in percent. 展开更多
关键词 Local maximal wavelet coefficients Reliable point assignment Object tracking Tracking learning detection (TLD) Kalman filter
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部