河南師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院導(dǎo)師:王世英

發(fā)布時間:2021-11-22 編輯:考研派小莉 推薦訪問:
河南師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院導(dǎo)師:王世英

河南師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院導(dǎo)師:王世英內(nèi)容如下,更多考研資訊請關(guān)注我們網(wǎng)站的更新!敬請收藏本站,或下載我們的考研派APP和考研派微信公眾號(里面有非常多的免費考研資源可以領(lǐng)取,有各種考研問題,也可直接加我們網(wǎng)站上的研究生學(xué)姐微信,全程免費答疑,助各位考研一臂之力,爭取早日考上理想中的研究生院校。)

河南師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院導(dǎo)師:王世英 正文


姓名:王世英
電話:0373-3326148
傳真:0373-3326174
電子郵件:wangshiying@htu.cn
通信地址:數(shù)學(xué)與信息科學(xué)學(xué)院
郵編:453007

個人簡歷
1990年在陜西師范大學(xué)獲理學(xué)學(xué)士學(xué)位。1993年在陜西師范大學(xué)獲理學(xué)碩士學(xué)位。2000年于鄭州大學(xué)系統(tǒng)科學(xué)與數(shù)學(xué)系博士研究生畢業(yè),獲理學(xué)博士學(xué)位。2002年8月于華中科技大學(xué)系統(tǒng)工程博士后流動站出站,獲博士后證書。學(xué)士學(xué)位論文:《圖與補圖斷裂度的關(guān)系》,碩士學(xué)位論文:《Cayley 圖》,博士學(xué)位論文:《Some structure problems for matching in graphs》和博士后研究工作報告:《Some new results of DNA computing and graph theory》。
出版專著2部,在國內(nèi)外學(xué)術(shù)刊物上發(fā)表學(xué)術(shù)論文150多篇。培養(yǎng)畢業(yè)了36個碩士研究生,6個博士研究生(基礎(chǔ)數(shù)學(xué)5個,系統(tǒng)工程1個)。2005年作為完成人之一(7(13))獲中華人民共和國教育部自然科學(xué)一等獎;2011年作為第一完成人獲山西省科學(xué)技術(shù)三等獎。

社會兼職
曾經(jīng)擔(dān)任中國運籌學(xué)學(xué)會理事(2004-2012)。現(xiàn)任美國數(shù)學(xué)評論評論員,中國運籌學(xué)會數(shù)學(xué)規(guī)劃分會理事,中國運籌學(xué)會圖論組合專業(yè)委員會委員,山西省數(shù)學(xué)學(xué)會常務(wù)理事,山西省工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會理事。

研究方向
離散數(shù)學(xué)與理論計算機科學(xué)。

科研成果與獎勵

在研項目
近年主持的科研項目:
國家自然科學(xué)基金項目:
1.DNA計算在圖論中的應(yīng)用(10471081)(2005.1-2007.12)
2.圖論中NP完全問題的DNA計算 (60773131)( 2008.01-2008.12
3.網(wǎng)絡(luò)可靠性參數(shù)的優(yōu)化研究(61070229)(2011.01-2013.12)
4.教育部博士點基金(博導(dǎo)類)網(wǎng)絡(luò)連通性優(yōu)化研究(20111401110005)(2012.01-2014.12)
山西省自然科學(xué)基金項目:
1.圖論和DNA計算中若干新課題(20041002)(2004.1-2006.12)
2.若干NP完全問題的DNA計算 (2008011010)( 2008.01-2010.12)
3.山西省研究生教育改革研究課題資助項目:交叉學(xué)科研究生教學(xué)的探討(20062003)(2007.01-2009.12)

論文著作
2012年文章和著作
1.Shiying Wang,Yuxing Yang,F(xiàn)ault tolerance in bubble-sort graph networks,Theoretical Computer Science,2012,421:62-69(SCI特二區(qū),EI).
2.Shiying Wang,Kai Feng,Shurong Zhang,Jing Li,Embedding long cycles in faulty k-ary 2-cubes,Applied Mathematics and Computation,2012,218 (9):5409-5413 (SCI EI).
3.Shiying Wang,Lei Zhang,Shangwei Lin,A neighborhood condition for graphs to be maximally k-restricted edge connected,Information Processing Letters,2012,112 (3):95-97(SCI EI).
4.Yuxing Yang,Shiying Wang,Conditional connectivity of star graph networks under embedding restriction,Information Sciences,2012,199 (15):187–192 (SCI特一區(qū),EI).
5.Shiying Wang,Guozhen Zhang,Kai Feng,F(xiàn)ault tolerance in k-ary n-cube networks,Theoretical Computer Science,460 (2012) 34–41 (SCI特二區(qū),EI).
6.Shiying Wang,Shurong Zhang,Embeddings of hamiltonian paths in faulty k-ary 2-cubes,Discussiones Mathematicae Graph Theory,2011,32(1):47-61.
7.Yuxing Yang,Shiying Wang,F(xiàn)ault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges,Theoretical Computer Science,DOI:10.1016/j.tcs.2012.10.048(SCI特二區(qū) ,EI)
8.王世英,李晶,楊玉星,互連網(wǎng)絡(luò)的容錯嵌入(專著).北京:科學(xué)出版社,2012.
2011年文章
1.Shiying Wang,Ruixia Wang,Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc- transitive digraphs,Discrete Mathematics,2011,311(4):282-288(SCI,EI)
2.Shangwei Lin,Shiying Wang,Chunfang Li,Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements,Discrete Applied Mathematics,2011,159 (4):212-223(SCI特二級區(qū),EI) 3.Jing Li,Shiying Wang,Di Liu,Pancyclicity of ternary n-cube networks under the conditional fault model,Information Processing Letters,2011,111(8):370-374.(SCI,EI)
4.馮凱,王世英.帶有條件故障邊的k元2方體的圈嵌入.計算機工程與應(yīng)用(二級主學(xué)報),2011
5.Shiying Wang,Shurong Zhang,Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults,Theoretical Computer Science,2011,412(46):6570-6584,(SCI特二區(qū),EI)
6.Jing Li,Shiying Wang,Di Liu,Shangwei Lin,Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges,Information Sciences,2011,181 (11):2260–2267(SCI特一區(qū),EI).
7.Shiying Wang,Jing Li,Ruixia Wang,Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube,Information Sciences 181(14) (2011) 3054-3065(SCI特一區(qū),EI).
8.王世英,楊玉星,林上為,李晶.圖的孤立斷裂度.?dāng)?shù)學(xué)學(xué)報,2011,54(5):861-874(一級主學(xué)報)。
9.Shiying Wang,Yuxing Yang,Jing Li,Shangwei Lin,Hamiltonian cycles passing through linear forests in k-ary n-cubes,Discrete Applied Mathematics 2011,159 (14):1425-1435 (SCI特二區(qū),EI).
10.Shiying Wang,Guozhen Zhang,Xiuli Wang,Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs,The Australasian Journal of Combinatorics,50 (2011) 233-242.
11.楊玉星,王世英.泡形互連網(wǎng)絡(luò)的條件連通性度量.計算機工程及其應(yīng)用,2011,47(22):13-16.(二級主學(xué)報).
12.林上為,李春芳,王世英.含有兩個非臨界點的強連通定向圖的弧數(shù).運籌學(xué)學(xué)報,2011,15(3):57-61(二級主學(xué)報).
2010年論文
1.Shiying Wang,Shangwei Lin,Path embeddings in faulty 3-ary n-cubes,Information Sciences 180(1)(2010)191-197(SCI特一級區(qū)IDS Number:523XK,EI,影響因子3.291).
2.Ruixia Wang,Aimin Yang,Shiying Wang,Kings in locally semicomplete digraphs,Journal of Graph Theory,2010,63(4):279-287(SCI特二級區(qū)SCI IDS 號:567HC ).
3.Shiying Wang,Jing Li,Lihong Wu,Shangwei Lin,Neighborhood conditions for graphs to be super restricted edge connected,Networks,2010,56(1):11-19(SCI特二級區(qū),IDS 號:632SH,EI).
4.Shiying Wang,Jing Li,Wei Han,Shangwei Lin,The base sets of primitive zero-symmetric sign pattern matrices with zero trace,Linear Algebra and its Applications,2010,433(3):595-605(SCI特二級區(qū),IDS 號:611GT).
5.Shiying Wang,Ruixia Wang,Shangwei Lin,Jing Li,Matching preclusion for k-ary n-cubes,Discrete Applied Mathematics,158(18) (2010):2066-2070(SCI特二級區(qū),EI).
6.李晶,王世英 .求二部圖的最大匹配圖的一種算法.電子學(xué)報(一級主學(xué)報),2010,38(1):161-166.
7.張淑蓉,王世英.有故障點的廣義4元n方體中不同長度的路的嵌入。計算機工程與應(yīng)用(二級主學(xué)報)2010,46(14):81-83,87.
8.Shiying Wang,Jun Yuan,A degree condition for hamiltonian digraphs,Southeast Asian Bulletin of Mathematics,2010,34(3):523-536.
9.王世英,任云霞.網(wǎng)絡(luò)邊連通性的最優(yōu)化.?dāng)?shù)學(xué)的實踐與認(rèn)識,2010,40(6):145-150.
10.Jiangshan Wangmu ,Jun Yuan,Shangwei Lin,Shiying Wang,Ordered and Ordered Hamilton Digraphs,Chinese Quarterly Journal of Mathematics,2010,25 (3):317-326.
2009年論文和著作
1.王世英,林上為.網(wǎng)絡(luò)連通性的最優(yōu)化(專著).北京:科學(xué)出版社,2009.
2.Shangwei Lin,Shiying Wang,Super p-Restricted Edge Connectivity of Line Graphs,Information Science,179 (2009) 3122–3126 (SCI特一級區(qū),IDS Number:479HA EI),
3.Shiying Wang,Shangwei Lin,The k-restricted edge connectivity of undirected Kautz graphs,Discrete Mathematics,2009,309(13):4649-4652(SCI,EI).
4.Shiying Wang,Ruixia Wang,The structure of strong arc-locally in-semicomplete digraphs,Discrete Mathematics,(SCI,EI) .
5.黃學(xué)臻,林上為,王世英.一類無向Kautz圖的k限制邊連通度的上界,應(yīng)用數(shù)學(xué)學(xué)報(一級主學(xué)報),2009,269-276.
6.王世英.交叉學(xué)科研究生教學(xué)的探討,山西財經(jīng)大學(xué)學(xué)報(高等教育版),2009,12(1):42-45 .
7.Guozhi Zhang,Shiying Wang,Matrix Multiplication Based on DNA Computing,The 5th International Conference on Natural Computation and the 6th International Conference on Fuzzy Systems and Knowledge Discovery(EI,ISTP)
2008年論文
1.Shiying Wang(王世英),Jun Yuan,Aixia Liu,k-Restricted edge connectivity for some interconnection networks,Applied Mathematics and Computation,2008,201(1-2):587-596.(SCI IDS Number:312HQ,EI).
2.Shiying Wang(王世英),Shangwei Lin,Sufficient conditions for a graph to be super restricted edge-connected,Networks,2008,51(3):200-209.(SCI IDS Number:300WF,EI:Accession number:083811547410)
3.WANG Shiying(王世英),YUAN Jun LIN,Shangwei,DNA Labelled Graphs with DNA Computing,Science in China,Series A:Mathematics,2008,51(3):437-452( SCI:IDS Number:258SK).
4.Shiying Wang(王世英),Shangwei Lin,Chunfang Li,Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2,Discrete Mathematics,2009,309(4):908-919(SCI,EI) 5.原軍,王世英,劉愛霞.一些DNA圖的標(biāo)號.中北大學(xué)學(xué)報,2008,29(1):4-7.
6.Wang Shi-Ying(王世英),Lin Shang-Wei,Li Chun-Fang,A Sufficient Condition for -Optimal Graphs,Intelligent Information Management Systems and Technologies ,2008,4(1):23-34.
7.王世英,郭繼文,一類(k+1)-色有向圖的本原指數(shù),應(yīng)用數(shù)學(xué),2008,21(4):778-786.
8.林上為,王世英,李春芳.$/lambda_k$最優(yōu)圖的充分條件,數(shù)學(xué)認(rèn)識與實踐,2008,38(12):208-213.
9.Shiying Wang(王世英),Shangwei Lin,$/lambda'$-optimal digraphs,Information Processing Letters,2008,108 (6) 386-389(SCI IDS Number:370IG,EI) .
10.Shiying Wang(王世英),Jun Yuan,Aixia Liu,Sufficient conditions for super-arc-strongly connected oriented graphs,Graphs and Combinatorics,2008,24(6):587-595(SCI IDS Number:378RP).
11.Jun Yuan,Aixia Liu,Shiying Wang(王世英),Sufficient Conditions for Bipartite Graphs to Be Super k-Restricted Edge Connected,Discrete Mathematics,2009,309(9):2886-2896(SCI,EI).

*如果發(fā)現(xiàn)導(dǎo)師信息存在錯誤或者偏差,歡迎隨時與我們聯(lián)系,以便進(jìn)行更新完善。 聯(lián)系方式>>

以上老師的信息來源于學(xué)校網(wǎng)站,如有更新或錯誤,請聯(lián)系我們進(jìn)行更新或刪除,聯(lián)系方式

添加河南師范大學(xué)學(xué)姐微信,或微信搜索公眾號“考研派小站”,關(guān)注[考研派小站]微信公眾號,在考研派小站微信號輸入[河南師范大學(xué)考研分?jǐn)?shù)線、河南師范大學(xué)報錄比、河南師范大學(xué)考研群、河南師范大學(xué)學(xué)姐微信、河南師范大學(xué)考研真題、河南師范大學(xué)專業(yè)目錄、河南師范大學(xué)排名、河南師范大學(xué)保研、河南師范大學(xué)公眾號、河南師范大學(xué)研究生招生)]即可在手機上查看相對應(yīng)河南師范大學(xué)考研信息或資源

河南師范大學(xué)考研公眾號 考研派小站公眾號
河南師范大學(xué)

本文來源:http://m.zhongzhouzhikong.com/henanshifandaxue/yanjiushengdaoshi_556546.html

推薦閱讀