2015/7/4 9:18:26 Zhang Ganzong and Su Tashan 217true 2015/7/4 9:18:26 Sha Jichang 216true Ⅰ takes some beans from the heap, at least one bean and at most s beans. Player two，P_II now picks some beans under the same constraint. The play then reverts to P_II and continues in the same way until all beans have been removed. The player with odd number of beans at hand wins. In this paper，We completely solve the game. At first，we give the winning strategy (if exists) for P_Ⅰ. Theorem Let r be the number of beans P_Ⅰ leaving to P_II at any step，and q be the number p_Ⅰ have at the end of the step. Then p_Ⅰ will win if r=1 or 0(mod(2s+2)) if q is odd ,and r=s+1 or s+2(mod(2s+2)) if q is even when s is odd and r=1 or 0 (mod(s+2)) if q is odd,and r=s+1(mod(s+2)) if q is even when s is even. The theorem can be proved by induction. As a by-product of the theorem we have Corollary Γ(n，s) is a win for P_II iff n=S十1 (mod(2s+2)) when s is odd and n=s+1 (mod(s+2)) when s is even.]]> 2015/7/4 9:18:26 Huang Zhengao and Huang Shouan 215true 2015/7/4 9:18:26 Xiong Yueshan 214true 2015/7/4 9:18:26 Liu Puyin 213true 2015/7/4 9:18:27 Zhang Xinjian 212true i)=y_i，i=0，1，…，n，n+1， 2) q'(x_i)= y'_i i=0，1 ，…，n，n+1. Similar spline functions have a1so been studied for convex sequences {y_i}_i=0ⁿ⁺¹.]]> 2015/7/4 9:18:27 Fang Kui 211true 2015/7/4 9:18:27 Gu Jianxiang 210true 2015/7/4 9:18:27 Li yongle 209true n，?_n)^∞₁ is an adapted reward sequence， (γ_n）^∞₁) is snell's envelope of X_n，(A_n) is a predictable increased process with A₀=0 in Doob-Meyer's decomposition of (γ_n). In this paper，from J. Klass，we prove that σ₁=inf{K≥1:Xk₁≥γ_k} is the smallest semi-optimal and the largest strong regular generalized rule，and K₀?sup{n≥0:A_n=0}<∞ is the largest reqular generalized rule. Hence another expression of the uniqueness of optimal generalized rule is given.]]> 2015/7/4 9:18:27 Jin Zhiming 208true 2015/7/4 9:18:27 Zeng Yonghong 207true 2015/7/4 9:18:27 Li Dengfeng 206true 2015/7/4 9:18:27 1, Huang Xinmin¹ and Zhao Ling²]]> Zou Qingyun¹, Huang Xinmin¹ and Zhao Ling² 205true 2015/7/4 9:18:27 Xu Liping 204true 4)，which is better that of [4].]]> 2015/7/4 9:18:27 Fang Kui 203true p/(1?yz)^2(1?α)p,│x│=│y│=1}(0≤α≤1/2). （2）Supp{s(S(p,α))J}=EHs(S(p,α))(0≤α<1/2). Where J is a continuous linear functional on which does not have the form J(h)=ΣA_nh⁽ⁿ⁾(0) for each h belonging to.]]> 2015/7/4 9:18:27 Zhu Jianmin 202true 2015/7/4 9:18:27 Wang Zhengming 201true 2015/7/4 9:18:27 Wu Yingyu 200true 2015/7/4 9:18:26 Liu Jixiang and Wang Huiping 199true 2015/7/4 9:18:03 Gu Jianxiang 198true 2015/7/4 9:18:03 Wang Yansheng, Sha Yu and Sha Jichang 197true 2015/7/4 9:18:03 Xiong Yueshan 196true 2015/7/4 9:18:03 Zhang Ganzong and Su Tashan 195true m→A(Rⁿ)，Their result has been improved in this paper and the sufficient and necessary conditions for the differentiability are given respectively. The limitation of (3.2) in [l] is proved to be unnecessary and the sufficient and necessary conditions for the differentialbility of ? are found. Furthermore，the sufficient and necessary conditions for the higher order differentialbility of ? are gained and a calculus formula is given.]]> 2015/7/4 9:18:03 Wu Mengda 194true 2015/7/4 9:18:03 Yang Yuanbiao and Tang Qianyu 193true 2015/7/4 9:18:03 Li Dengfeng and Yu Bin 192true 2015/7/4 9:19:34 1, Liu Wuming² and Lan Maqun³]]> Wang Binghong¹, Liu Wuming² and Lan Maqun³ 191true 2015/7/4 9:19:23 Xie Zheng 190true 2-Continuous) convexity preserving cubic parametric interpo1ation curves is derived. the construction of the a1gorithm is 1oca1. The calcu1ation invo1ved is simp1e and efficient. The a1gorithm is a1so approriate for both closed curves and open curves. Finally a few examp1es of curve construction are given.]]> 2015/7/4 9:19:23 Fang Kui 189true 2015/7/4 9:19:23 Qu Tianxing 188true 2015/7/4 9:19:23 Li Dengfeng 187true 2015/7/4 9:19:23 Dong Xiaoguang 186true T factorization of bordering matrix and modified matrix，an efficient method is given. Finally，convergence and complexity of the algorithm are given theoretically.]]> 2015/7/4 9:19:23 Zhang Weimin and Wang Yuwu 185true 2015/7/4 9:19:23 1 and Jiang Zengrong²]]> Tian Zerong¹ and Jiang Zengrong² 184true 2).]]> 2015/7/4 9:20:31 Fang Kui and Zhang Xinjian 183true 2015/7/4 9:20:31 Qin Zuoping 182true 2015/7/4 9:20:31 Zhu Jianmin 181true 2015/7/4 9:20:20 Zhang Ganzong and Liu Jianxiong 180true 3，if the initial value φ(x) is sufficiently small in some Sobolev spaces，there exists a unique global classic solution for the Cauchy problem. And the solution decays as t→+∞. The method used in this paper makes the value of α be closely combined with the spaces in which the sloution and initial value function are defined. The larger the value of α is，the better the properties of the solution are.]]> 2015/7/4 9:20:20 Kong Rong and Zhang Rui 179true 2015/7/4 9:20:20 Zhou Haiyin 178true u=1/2NMlog₂N+1/4MNlog₂M,A_d=3/2NMlog₂NM-3MN-1/2M²+M+N,where N=2^t,M=2^r.When N=M,the result is the same as in [5],which is the best result at present. But the algorithm in [5] has instability leading to large errors easily.This limitation has been overcome in the paper. We also derive some algorithms about 2D-DCT,2D-DST,2D-DCST. A fast algorithm about 2D-DFT is developed in particular,the amount of the operations in paper is similar to that in [1] with FPT to calculate 2D-DFT.]]> 2015/7/4 9:19:55 Jiang Zengrong and Cheng Lizhi 177true k is replaced by the relatively best position function. Optimal stopping rules are obtained with differential probability of backward solicitation.]]> 2015/7/4 9:19:56 1 and Li Xiaojie²]]> Jin Zhiming¹ and Li Xiaojie² 176true n,?_n,n≥0)satisfy the stochastic difference equation x_n+1=x_n+a_n+b_nε_n+1，n=0,1,2,…, whereε_i,i=l, 2，…，is a white noise sequence. In this paper，we discussed the condition for Snell's envelope of(x_n, n≥0)to be approached by using Snell's envelope of finit sequence(x_n，0≤n≤N). We have obtained the decomposable representations of Snell's envelope of x_n=E(x_n︱?_n^ε)，n=0，1，2，…，where ?_n^ε=σ（ε_i，i=0,1,2,…,n）,ε₀=0. It is proposed that the necessary and sufficient condition for σ_n=inf (m≥n，r_m=X_m) is optimal stopping. At last，we discussed the iterative algorithm for optimal stopping rules and obtained the sufficient condition under which the iterative process can be stopped in finit steps.]]> 2015/7/4 9:19:56 Luo Jianshu 175true 2015/7/4 9:19:56 Zhang Ganzong and Liu Jianxiong 174true 2015/7/4 9:19:56 Xie Zheng 173true 1 rational interpolation function over an arbitrary triangle is described in this paper. The interpolation is a convex combination of two functions. The construction of the interpolation is simple and the calculations involved is convenient. The precision of the interpolation is better than those in [3-4]. Finally，the precision set is obtained，and a calculation example is given.]]> 2015/7/4 9:19:56 Fang Kui and Sun Qingwen 172true q^*) is given. Then we solve the problem about the norms of fundamental units in some real quadratic function fiels.]]> 2015/7/4 9:19:56 Li Chao 171true 2015/7/4 9:19:56 Sun Jixiang, Gong Yaming and Wang Runsheng 170true 2015/1/23 11:00:10 Sha Jichang 169true a，P≥2 is a prime number, a≥1 is a positive integer number)is discussed. When the n-pry polynomial g(x₁,x₂,…,x_n) ∈GF(q)[x₁,x₂,… ,x_n] is a polynomial of degree 1, we give the necessary and sufficient condition that the clock controlled sequences get to the maximum period and the maximum linear complexity.]]> 2015/1/23 11:00:10 Li Chao 168true 2015/1/23 11:00:10 Qiu Zhaotai 167true 2015/1/23 11:00:10 Shu Jiang and Sha Jichang 166true 2015/1/23 11:00:10 Zhang Xinjian and Fang Kui 165true 2m) times, where，n, m are degrees of dividend and divisior polynomial，respectively，We then discuss a fast interpolation algorithm through n+1 points that extends n+1 with power of two to any number，the running times is O(n log₂²n).]]> 2015/1/23 11:00:10 Cheng Lizhi 164true 2015/1/23 11:00:10 Ma Xurong 163true 1N₂ (N₁ is odd) into N₁ DHT's of length N₂ and some additional operations. The additional operations can also be turned to N₂ DHT's of length N₁. Therefore，a MIMD parallel Algo-rithm is obtained. If N₁ processors are available,M(N₂)+1/2N+3/2 N₂?2 multiplication steps and A (N₂)+1/2N+5/2N₂?1 addition steps are enough for computing a DHT of length N=N₁N₂, where M(N₂) and A(N₂) represent the number of multiplications and additions for a DHT of length N₂ respectively. The efficiency of the parallel algorithm with respect to itself is approximately 1.]]> 2015/1/23 11:00:10 Zeng Yonghong 162true t(ω)，t∈T} which is equivalent to a fuzzy stochastic process {A_t(ω)，t∈T}. Moreover，if a fuzzy stochastic process {A_t(ω)，t∈T} is stochastically continuous，then the existence of a separable and measurable fuzzy stochastic process {C_t(ω)，t∈T} that is equivalent to {A_t(ω)， t∈T} is proved.]]> 2015/1/23 11:00:10 Liu Puyin 161true 2015/1/23 11:00:32 Chen Qinghua and Li Jianping 160true 2015/1/23 11:00:32 Xie Zheng 159true 1(C²) interpolating in triangles or polygons. In part two，a method is presented for constructing C² interpolating functions in arbitrary triangles. Finally，the error of interpolating function is estimated，and a numerical example is given.]]> 2015/1/23 11:00:32 Fang Kui and Liu Jie 158true [l]and Wang^[2]，etc..]]> 2015/1/23 11:00:32 Shi Bao 157true 2015/1/23 11:00:32 Li Chao 156true ρ criterion^[l] is recently paid much attention to as an important one of variable selection. A parallel algorithm and the number of operations (multiplications and divisions) of selecting the best subset from a11 possible subsets，with regard to a large-scale linear regression model under C_ρ criterion，are presented. The simulation results for the algorithm on the vector super-computers YH-1 and YH-2 are given. The vector speed-up，ratio，s/v, approximates to fifteen and the advantages of the algorithm are shown.]]> 2015/1/23 11:00:33 Hu Qingjun and Wu Yi 155true 2015/1/23 11:00:33 Luo Jianshu 154true 2015/1/23 11:00:33 Xu Peide 153true 1-monotone shape-preserving cubic spline interpolation. The construction is easy to compute and can be applied in shape design.]]> 2015/1/23 11:00:33 Wang Xingbo 152true p-2Du)+k (x) u^P-1=K(x)u^P-1+g(x,u)，u∈W^1,P (R^N),4≤P²≤N,P=NP/N-p，where g (x,u) is a lower-order perturbation of u^p-1. It is the continuation of the zero-perturbation case.]]> 2015/1/23 11:00:44 Zhou Haiyin 151true 2015/1/23 10:59:16 Sha Jichang 150true 2015/1/23 10:59:16 1 and Sun Junsen²]]> Wu Xiaoyue¹ and Sun Junsen² 149true 2015/1/23 10:59:16 Wang Wenzhong and Fang Kui 148true 1 shape preserving interpo1ating quadratic and cubic sp1ine function S(x) by inserting some new knots are constructed by using Bernstein po1ynomai1s. The S(x) is simp1e and efficient to ca1cu1ate. Finally the monotonic shape preserving sp1ine function is a1so discussed.]]> 2015/1/23 10:59:16 1 and Fu Kaixin²]]> Fang Kui¹ and Fu Kaixin² 147true 2015/1/23 10:59:16 Zhu Jubo 146true 2015/1/23 10:59:16 Xie Zheng and Chen Haoguang 145true 2015/1/23 10:59:16 Cai Fang 144true 2015/1/23 10:59:16 Ouyang Jie 143true 2015/1/23 10:59:30 Wang Zhengming 142true 2015/1/23 10:59:30 Li Bing 141true n─1，─2^m─1，─1，2^m─1}，and present the distribution of these crosscorrelation values.]]> 2015/1/23 10:59:42 Li Chao and Xie Duanqiang 140true p martingales. We have obtained many equivalent conditions between the convexity and H_p martingales in complex Banach spaces.]]> 2015/1/23 10:59:57 Li Bing 139true 2015/1/23 10:59:57 Jin Zhiming 138true 2015/1/23 16:03:29 Liu Puyin 137true 2015/1/23 0:00:00 Li Bing 136true 2015/1/23 16:03:29 Wang Xingbo 135true -kk^k/k!. It confirms the classical secretary problem with first criterion on the other hand.]]> 2015/1/23 16:03:29 Che Zhuming and Jin Zhiming 134true 2-continuous) shape preserving parametric cubic interpolation spline curve. The construction of the algorithm is simple，the computation involved is easy and efficient. The algorithm is appropriate both for open and closed curves. Finally，an example is given.]]> 2015/1/23 16:03:15 Fang Kui 133true 3)，which has settled satisfactorily and efficiently the solving problem of maximum independent (-dominating) set and minimum (independent-) dominating set in graph theory. The method and the algorithms provided in this paper can certainly be used for reference in studying the problems of graph coloring, covering and matching and so on.]]> 2015/1/23 16:03:03 Zhang Guangduo and Wang Zhengzhi 132true 2015/1/23 16:03:03 1 and Fang Kui²]]> Luo Yang¹ and Fang Kui² 131true 2014/6/11 0:00:00 Zhu Jianmin 130true c in detail (where p is a prime number). As compared to the ordinary column-row algorithm of 2D-DFT,the number of multiplications of the FPT algorithm is reduced about 50%, while the number of additions increases a little.]]> 2014/6/11 0:00:00 Jiang Zengrong and Fu Bin 129true 2log₂ⁿ+O(1),when p=3n, parallel times are 2h²log₂ⁿ+ O(1)，where his bandwidth.]]> 2014/6/11 0:00:00 Cheng Lizhi and Jiang Zengrong 128true 2014/6/11 15:46:14 Liu Puyin 127true 2014/6/11 15:46:14 Li Bicheng and Luo Jianshu 126true 2014/6/11 15:46:14 Shang Yi,Zhang Guoguang and Cheng Mengjin 125true 1 norm estimations are obtained simultaneously.]]> 2014/6/11 15:43:36 Xiong Yueshan 124true 2014/6/11 15:43:23 Hu Qingjun 123true T=(0.0,1.0,0.0,0.0),BB(1)^T=(0.0,0.0,1.0,0.0) BB′(O)^T=(-0.5,0.0,0.5,0.0)，BB′(1)^T=(0.0,-0.5,0.0,0.5)BB"(O)^T=(1.0,-2.0,1.0,0.0)，BB"(1)^T=(0.0,1.0,-2.0,1.0)Secondly we discuss the rational surface defined in tension-product form using above function vector BB (t). The interpolation surface implies the following results: (1)The surface interpolates control points; (2) It is second order parametrically continuous;(3) It is local and can be adjusted by weights. The effect of weights is also analysed and has similar result as bicubic rational B-spline surface.]]> 2014/6/11 15:43:23 Fang Kui and Zhu Guoqing 122true *τ，J_τ in ^*X and obtain some properties. Eospecially，we give another proof of the Stone-Cech theorem by studying quotient，topologies of ^*X.]]> 2014/6/11 15:43:23 Qin Zuoping 121true 2014/6/11 15:43:05 Xiong Yueshan and Li Xiaomei 120true 2014/6/11 15:43:05 Zhang Guangduo and Wang Zhengzhi 119true tis the theft number of [0,t] and {J_t}_t≥0 is a Poisson process. Profit process and risk process are all i. i. d time series. We find optimal stopping rules by using the weak infinitesimal generator of markov process.]]> 2014/6/11 15:42:50 Li Bicheng,Luo Jianshu and Jin Zhiming 118true 2014/6/11 15:42:50 Fang Kui and Zhao Jun 117true 2014/6/11 15:42:50 Wu Xiaoyue 116true n onto bounded M-QED domain D′? R"，0<α≤(KM)^1/1-n. In this paper，the authors proved that f ∈Lip_a (?D) if and only if f ∈Lip_α (D).]]> 2014/6/11 15:42:50 Chu Yuming and Zhou Haiyin 115true AM and id_B(M○×_AB).]]> 2014/5/28 9:47:43 Dai Qingping and Liu Qingbao 114true 2014/5/28 9:47:43 Qing Zuoping 113true ∧ of the test function space D(Ω) and its properties, and give the structure of the elements in (D)^∧. Finally, We prove that (D)^∧ and D(Ω) are similar in their structures, and (D)^∧ is the strict inductive limit of a class of local convex spaces.]]> 2014/5/28 9:47:11 Liu Puyin 112true 2I possessing the prior information: E(C) = 0, Cov(C, C) =σ²₀I, This article gives a best method of selecting the principal components' numbers in the principal components estimate and presents an improved principal components estimate. Theoretically, we prove that the improved estimate is admissible amd that it is marked much letter than Least Square Estimate and is better than the principal components estimate in a sense of “average”error of mean square. Simulation verifies the inference above.]]> 2014/5/28 9:47:11 Hu Qingjun 111true 3).]]> 2014/5/28 9:46:39 Xiao Bin and Zhang Ganzong 110true 2-Continuous convexity preserving quadratic Bézier interpolation spline is derived. The curve is order 2 geometrical continuous, adjustable.]]> 2014/5/28 9:46:39 1 and Min XiaoPing²]]> Fang Kui¹ and Min XiaoPing² 109true 2014/5/28 9:46:39 Li Bing 108true D and J_D under K-quasiconformal mappings, and proved the distortion coefficient only dependent on K.]]> 2014/5/28 9:46:39 1 and Chu Yuming²]]> Zhou Haiying¹ and Chu Yuming² 107true 2014/1/3 16:01:53 Jin Zhiming 106true 2014/1/3 16:01:53 Wu Xiaoyue and Sha Jichang 105true 0, the low-resolution cutoff, and that the selecting of j₀ is related to the noise power σof a signal corrupted by an additive noise and the sampling rate of the signal. This article analyzes these relationships among these parameters and gives many simulation results. These results have significant meanings in selecting the parameter j₀.]]> 2014/1/3 16:01:53 He Yanlan,Qin Shiqiao,Su Yong and Yang Yan 104true 2014/1/3 16:01:27 1,Lu Zaiming² and Hou Zhenting²]]> Tang Yourong¹,Lu Zaiming² and Hou Zhenting² 103true 2014/1/3 16:01:28 Dai Qingping 102true 7 and F₉ being factored into primes, a new algorithm, the number field sieve, is given, which was proposed by Pollard. Manasse and Pollard investigate this algorithm thoroughly, and develop it from the special number field sieve (SNFS) to the general number field sieve (GNFS). In this paper, we describe the new algorithm and explain the NFS implementation.]]> 2014/1/3 0:00:00 Ni Guyan 101true 2014/1/3 0:00:00 Li Bing 100true 2014/1/3 16:01:17 Li Chao 99true 2014/1/3 16:01:06 Zhang Xinjian 98true 2014/1/3 16:01:06 Ren Jianfang and Wang Shi 97true 2014/1/3 0:00:00 Liu Puyin 96true 2014/1/3 16:00:54 Wang Shi and Li Bing 95true 2013/11/18 15:33:18 Xie Xinyan 94true 2013/11/18 15:33:18 Du Xiaoyong and Li Bing 93true 2013/11/18 15:32:32 Jin Zhiming and Wang Yongxian 92true 2013/11/18 15:32:32 Xie Zheng,Liu Weihua and Tang Zeying 91true 2013/11/18 15:32:32 Dai Qingping 90true 2013/11/18 15:32:32 Ni Guyan 89true 2013/11/18 15:33:04 Li Zhixiang and Tang Yangbin 88true 2013/11/18 15:33:04 Jin Zhiming and Duan Xiaolong 87true 2013/11/15 0:00:00 Li Bing,Luo xueshan and Luo aiming 86true Y/1 in a random environment. ln statistical equilibrium, the author obtains the equilibrium distribution of queue length and that of waiting queue length, the average of queue length and that of waiting queue length as well as the equilibrium distribution of waiting time and that of staying time, the average of waiting time and that of staying time.]]> 2013/11/15 15:37:25 1,Liu Zaiming² and Hou Zengting²]]> Tang Yourong¹,Liu Zaiming² and Hou Zengting² 85true 2013/11/15 15:37:25 Wang Shi,Yang Wenqiang,Jin Zhiming and Li Bing 84true 2013/11/15 15:37:26 Zhang Xinjian and Huang Jianhua 83true 2013/11/18 15:31:16 1 and XU Yifan²]]> CAI Zewei¹ and XU Yifan² 82true 2013/11/18 15:30:33 XIONG Yueshan 81true 2013/11/18 15:32:05 FENG Lianggui 80true 2013/11/18 15:32:05 JIN Zhiming 79true 2013/11/18 15:32:05 1 and TANG Shangui²]]> ZHANG Xinjian¹ and TANG Shangui² 78true 1, x₂,…,x_p)′_p×1 is put forward. Its fundamental idea is, with the sweep operation o f matrix , to structure a few synthetical indexes (called principal variance variables) of X to depict X 's statistical feature. The theoretical foundation, audio-visual explanation and algorithm of the method are given. The method is markedly superior to of principal component analysis especially when X has serious multi-correlation.]]> 2013/11/18 15:32:05 HU Qingjun and WU Yi 77true 2013/8/21 0:00:00 WU Qiang 76true 2013/8/21 9:52:32 FENG Lianggui 75true 2013/8/21 9:52:32 QU Tianxing 74true 2013/8/21 9:52:32 FENG Jing and WU Mengda 73true 2013/8/21 9:52:32 1,TONG Li¹ and TANG Shangui²]]> ZHANG Xinjian¹,TONG Li¹ and TANG Shangui² 72true 2013/8/21 9:52:33 XIE Zheng and YU Dianlong 71true 1,F₂,…,F_t} is a (g,f) factorization of G. If |E(H)∩E(F_i)|=1, 1≤i≤t，then we say that F is orthogonal to H．In the paper［3］,Yan Guiying and Pan Jiaofeng gave the conjecture：Let G is an (mg+k,mf-k)-graph，1≤k 2013/8/21 9:52:31 XIE Zheng,DAI Li and WANG Shuanshi 70true 2013/8/21 9:52:33 OU XinLiang 69true 2013/8/21 9:49:43 GE Zhengkun,LI Bing and WANG Chunling 68true 2013/8/21 9:50:03 1 and CHEN Weifang²]]> FENG Guangbo¹ and CHEN Weifang² 67true 2013/8/21 9:50:19 Yu Zheng,Liu Zaiming and Hou Zhenting 66true 2013/8/21 9:50:19 JIN Guang 65true 2013/8/21 9:50:20 1 and LI Bing²]]> ZHANG Feilian¹ and LI Bing² 64true 2013/8/21 9:50:20 DAI Li,YU Dianlong and XIE Zheng 63true 2013/8/21 0:00:00 WANG Chunling,LI Bing and GE Zhengkun 62true 0_-∞q(s)x(t+s)ds］=A(t,x)x(t)+f(t,x_t) Some results on the existence and uniqueness of almost periodic solutions are obtained by use of C_h space, matrix measure and Krasnoselskii's fixed theorem. Especially, whenq(s)is zero matrix, we derive sufficient conditions for the existence of a unique and uniformly stable almost periodic solution, which generalizes several results in references［1～5］.]]> 2013/6/14 0:00:00 LIU Yicheng and LI Zhixiang 61true 2013/6/14 9:08:39 SHI Zhengwei and FU Yige 60true 2013/6/14 9:08:39 LI Kewen and WU Mengda 59true 2of stock are estimated.Some opimal properties of the estimaters are proved.The method for testing singular market is given.The first and second critical value are proposedsented.]]> 2013/6/14 9:07:50 JIN Zhiming 58true 2013/5/8 10:45:34 TAN Lu,WU Yi and YI Dongyun 57true T(Ψ) is strictly positive with positive probability and with its initial wealth 0.If the net capital gains are strictly positive with positive probability,we can't tell whether it is an arbitrage.How do you tell whether a strategy is an arbitrage with its initial wealth unequal to 0? We give another definition of arbitrage and have shown that judging whether a strategy is an arbitrage is to judge whether its discounted gains are strictly positive with positive probability. We give the equivalent expression forms in mathematics of the original market and different discounted markets with respect to no arbitrage ,and correspondingly we get equivalent expression forms in mathematics with respect to no arbitrage with different strategy requirements.]]> 2013/5/8 10:45:34 GENG Meihua and JIN Zhiming 56true log₂^(M+1)+1)and the space complexity is O(n), where A(1)，A(2)，…，A(n-1)，A(n),and M are all positive integers. This result is better than that of the two-list algorithm when M is relatively small.]]> 2013/5/8 10:45:34 JIANG Xinwen and PENG Lihong 55true 2013/4/27 3:07:24 HAN Guangjun,LUO Qiang and LI Bing 54true 2013/4/27 3:07:07 LIU Cui and CHENG Lizhi 53true 2013/4/22 0:00:00 1 and HAO Zhifeng²]]> FENG Lianggui¹ and HAO Zhifeng² 52true 2013/4/22 10:35:30 LI Tao,XUE Zurui and HU Xiaoping 51true a,b.Kathiresan showed that P_2r,2m-1 is graceful and conjectured that P_a,b is graceful except for (a,b)=(2r+1,4s+2).Yang showed that P_2r+1,2m-1 are graceful. In this paper ,P_3，4m is proved to be graceful. So we prove the conjecture for a=3.]]> 2013/4/8 11:10:35 1,WANG Zhenghua² and XIE Zheng¹]]> DAI Li¹,WANG Zhenghua² and XIE Zheng¹ 50true 1-factor of two-stage iterative methods for solution of linear systems. And the upper bound is expressed applying the R₁-factors of the inner and outer iteration and the numbers of the inner iteration; the premier parts of the upper bound is the R₁-factor of outer iteration. Furthermore, for any inner iteration method and any numbers of the inner iteration, it is also showed that the lower bound of the R₁-factor of the two-stage iterative method can also be given by the R₁-factor of the outer iteration in the case of monotone matrices. The results indicate the effects of convergence rates of the inner and outer iteration and the numbers of inner iteration on the convergence rates of the two-stage iterative method.]]> 2013/4/8 11:09:49 1,2 and XIONG Yueshan³]]> CAI Fang^1,2 and XIONG Yueshan³ 49true 2/dt²(x(t)+p(t)x(t-1))=qx(2［t+1/2])+g(t,x(t),x［t］)By using fixed point theorem and the method of pseudo-almost periodic sequence, we get the existence of the pseudo-almost periodic solution of this equation. Also, some results in reference ［5～8］ have been extended.]]> 2013/4/8 11:09:50 YANG Shufang and WANG Xin 48true 2013/3/25 4:48:43 ZHU Simei and SONG Songhe 47true m -α_m-1(m≥1)depends on the number of customers in the system at time  α_m-1. Using the method of supplementary variables,the integral representation of the transient queue length distribution is obtained, of which the integrated term can be calculated recursively under the condition that the interarrival times and service times of the system have density functions.]]> 2013/3/25 4:48:44 1 and ZHOU Lingbi²]]> YUN Zheng¹ and ZHOU Lingbi² 46true 2013/3/25 4:48:45 DAI Qingping 45true 2013/3/14 10:39:53 ZHU Jianmin,LI Xiang and HUANG Jianhua 44true 2013/3/14 10:39:12 WANG Yibo and WANG Shangwu 43true 2013/3/14 10:38:49 ZHU Jianmin,LI Xiang and HUANG Jianhua 42true 2013/2/28 5:09:22 1,2,CAI Fang^1,3 and XIONG Yueshan¹]]> WANG Liguang^1,2,CAI Fang^1,3 and XIONG Yueshan¹ 41true 2013/2/28 5:08:15 LIU Yan and CHEN Yingwu 40true m₂［a，b］were introduced. Based on this inner product, simple formulas for computing reproducing kernels were obtained by using the Green's function and recursive relationships for computing reproducing kernels were also discussed.]]> 2013/2/28 5:08:15 ZHANG Xinjian and JIANG Yue 39true 2013/2/28 5:08:15 CHEN Jimei,LI Zhixiang and WANG Xiao 38true 2012/12/7 2:58:06 CHENG Wei,FENG Lianggui and YU Sen 37true 2012/12/7 2:57:38 1,2 and HOU Zhenting²]]> LIU Kaiyu^1,2 and HOU Zhenting² 36true 2012/12/7 2:57:38 QU Tianxing 35true 2012/12/7 2:57:24 DAI Qingping and FENG Lianggui 34true 2012/12/7 2:57:24 ZHANG Xinjian and LU Shirong 33true n｝ be a sequence of semimartingale in a filtered complete probability space (Ω，F，F，P) satisfying the usual condition. We use the general Girsanov thorem and closed graph theorem to prove that the sequence ｛X_n｝converges on X in the Emery topology w.r.t Q if｛X_n｝ converges on X in the Emery topology w.r.t P and the probability measureQ^loc《P. In light of this fact, we prove that if X is a d-dimensional semimartingale and a d-dimensional predictable process，H is X-integrable in the sense of vector stochastic integrals w.r.t P， when the probability measure Q^loc《P, H is also X-integrable in the sense of vector stochastic integrals w.r.t Qand these two integrals are Q-differentiable. It is noted that the condition of Q《P is stronger than that of Q^loc《P, therefore, this paper generalizes lemma 4.9 and theorem 4.14 in［1］.]]> 2012/12/7 2:57:08 QU Tianxing and JIN Zhiming 32true n=v₀v₁…v_nsuch that f(v₀)=k . Based on this, a method for constructing bigger graceful trees by joining a path to a graceful tree is given and this makes much more trees to be graceful.]]> 2012/12/7 2:56:54 DAI Li,WANG Zhenghua and XIE Zheng 31true 2012/11/8 3:52:33 FENG Lianggui and LUO Jihong 30true 2(Ω)×C(［-r,0］; L²(Ω)).]]> 2013/1/31 4:04:34 LI Jin,HUANG Jianhua and ZHU Jianmin 29true n×nThe current method investigated the algebraic embedding problem from the quaternion algebra to R^n×n ,and found out all the possible algebraic embeddings under the condition that maps the imaginary units to signed permutation matrices. The method is to consider the images of the generators (i.e. the imaginary units) of quaternion algebra., then investigated the properties of these images and determined what kind of real matrices fulfilled them. Next, it solved the problem by invoking the language of group action. The conclusion turns out to be interesting: the crucial pairs of matrices, which determine the embeddings, are made up of real matrix pairs And there are essentially two pairs of the latter kind.]]> 2012/9/6 8:51:59 WANG Buliao and FENG Lianggui 28true 2012/9/6 8:52:16 ZHANG Xinjian and DU Xinpeng 27true 2012/9/6 8:52:16 YU Sen,CHENG Wei and FENG Lianggui 26true 2012/9/19 9:01:37 QU Tianxing and JIN Zhiming 25true 2012/11/5 8:48:04 XIE Zheng,ZHANG Xiaoming and CHEN Zhi 24true *A(x,κ(u－u_Ω),du)=0.The reverse H?lder type inequality were established for the weak solution u of these equations, very similar to the traditional one. The results obtained here for the special cases of κ=0 can lead to the corresponding situation considered before now, which can be regarded as the foundation for studying the regularity and integrability to this kind of equations.]]> 2012/11/5 8:48:04 ZHU Jianmin,TANG Zhaoyang and HUANG Jianhua 23true 2012/11/5 8:48:04 HUANG Jianhua and LI Jin 22true 2013/11/6 15:57:51 XU Wei and FENG Lianggui 21true 2013/3/13 9:54:34 1 and WANG Hao²]]> DING Wenxia¹ and WANG Hao² 20true 2014/11/25 10:16:01 WU Danqing,LYU Zhenzhou and HU Jixiang 19true 2014/7/17 17:22:22 XIE Meihua 18true 2014/5/14 17:10:48 YAN Fengxia, WANG Zelong, ZHU Jubo, LIU Jiying 17true 2014/3/12 14:49:32 MA Chao,QIAO Chunjie,WANG Yueke and ZHAO Shen 16true 2015/6/30 18:53:57 1,2, WU Yuanli^1,2, HE Xiaoyuan¹ and HU Xiaofeng¹]]> JIA Jun^1,2, WU Yuanli^1,2, HE Xiaoyuan¹ and HU Xiaofeng¹ 15true 2018/1/16 17:02:01 LIU Yicheng, LI Xiang and NIE Fen 14true 2018/1/16 17:02:01 1, HOU Bowen¹, HE Zhangming^1,2 and WANG Jiongqi^1,2]]> CHEN Yuyun¹, HOU Bowen¹, HE Zhangming^1,2 and WANG Jiongqi^1,2 13true 2018/1/16 17:02:02 YU Qi, WANG Zelong, TAN Xintong and ZHU Jubo 12true 2017/9/12 10:09:50 XU Liyang, LYU Zhenzhou, WANG fei and XIAO Sinan 11true 2017/7/9 11:57:46 1, ZHANG Han¹, LUO Yong¹, ZHU Cheng² and HE Wentao²]]> LI Jianping¹, ZHANG Han¹, LUO Yong¹, ZHU Cheng² and HE Wentao² 10true 2017/3/7 11:55:45 YUN Wanying, LYU Zhenzhou and ZHAO Lufeng 9true 2018/7/11 12:40:22 LING Chunyan, LYU Zhenzhou and YUAN Wanying 8true 2018/5/11 16:33:58 HUA Lin, LYU Yansong, WU Fan and ZHANG Er 7true 2018/5/11 16:33:58 1,2, ZHAO Xinwen¹, CAI Qi¹ and HUANG Liqin³]]> GUO Haikuan^1,2, ZHAO Xinwen¹, CAI Qi¹ and HUANG Liqin³ 6true 2019/6/13 15:22:19 YAN Liang, DUAN Xiaojun, LIU Bowen and XU Jin 5true 2019/6/13 15:22:20 1, ZHAO Chengli¹, ZHANG Xue¹ and YI Dongyun^1,2]]> WANG Xiaojie¹, ZHAO Chengli¹, ZHANG Xue¹ and YI Dongyun^1,2 4true 2019/6/13 15:22:20 1, DUAN Xiaojun¹, WANG Zhengming² and YAN Liang¹]]> XU Jin¹, DUAN Xiaojun¹, WANG Zhengming² and YAN Liang¹ 3true 2019/6/13 15:22:20 1, WANG Zhengming², LI Dong³ and WANG Jiongqi¹]]> ZHOU Xuanying¹, WANG Zhengming², LI Dong³ and WANG Jiongqi¹ 2true 2019/3/15 0:00:00 DUAN Xiaojun, YIN Yimin and GU Kongjing 1true