|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Independence number in claw-free graphs 显示文摘 | Wang Chunxiang Fei Pusheng | 2009 | Acta Mathematica Scientia2009，29，1： | 1 |
| 2 | Denoising of SAR Images Based on Lifting Scheme Wavelet Packet Transform显示文摘According to the different characteristics that signal and noise exhibit during wavelet decomposition, a new denoising method based on the lifting scheme wavelet packet decomposition is presented. In this method, the SAR images are decom- posed by using the best wavelet packet and the norm of each sub-band are calculated; signals and noise can be discriminated based on the norm and soft-threshold method, and the images can be denoised. Experiments show that the proposed algorithm has excellent performance in denoising SAR images, and can remove most noise of images with well-kept texture detail informa- tion. The calculating speed of the method is twice the speed of the general wavelet packet transform algorithm. | WANG Wenbo YI Xuming FEI Pusheng | 2008 | Geo-Spatial Information Science2008，11，4： | 1 |
| 3 | An Infeasible Mi- zuno - Todd - Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complex- ity 显示文摘 | YANIN WANG PUSHENG FEI | 2007 | Numerical Functional Analysis and Opti- mization2007，28，34： | 1 |
| 4 | An Improved BFGS Algorithm for Unconstrained Optimization Problems显示文摘 | Fei Pusheng Chen Zhong | 1994 | J Wuhan University(Natural Science Edition)1994，，3： | 1 |
| 5 | A Parallel Quasi-newton Algorithm for Unconstrained Optimization显示文摘 | Chen Zhong Fei Pusheng Zhen Huirao | 1995 | Computing1995，55，12： | 1 |
| 6 | The Total Irredundance Numbers on Graphs显示文摘This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H,that is,let H be the clone-contraction graph of G and v1 ,v2 ,,vk be all contraction vertices of H. If S is a maximal total irredundant set of H such that A =S ∩ {v 1,v2 ,,vk}contains as few vertices as possible,then S '= S-A is the maximal total irredundant set of G. Furthermore,we obtain the bound of the total irredundance number:irt ≤(Δ(G))/(2Δ(G)+1)n,which n is the order of graph G,and Δ (G) is maximum degree in G. | WANG Chunxiang FEI Pusheng | 2007 | Wuhan University Journal of Natural Sciences2007，12，3： | 0 |
| 7 | Gomory’s Method Based on the Objective Equivalent Face Technique显示文摘This paper discusses a re-examination of dual methods based on Gomory’s cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily. | YAN Zizong FEI Pusheng WANG Xiaoli | 2006 | Wuhan University Journal of Natural Sciences2006，11，3： | 0 |
| 8 | An Improved Quasi-Newton Method for Unconstrained Optimization显示文摘AnImprovedQuasi-NewtonMethodforUnconstrainedOptimization￥FeiPusheng;ChenZhong(DepartmentofMathematics,WuhanUniversity,Wuhan43... | Fei Pusheng Chen Zhong (Department of Mathematics, Wuhan University, Wuhan 430072, China) | 1996 | Wuhan University Journal of Natural Sciences1996，1，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员