国产v亚洲v天堂无码久久无码_久久久久综合精品福利啪啪_美女扒开尿口让男人桶_国产福利第一视频在线播放_滨崎步无码AⅤ一区二区三区_三年片免费观看了_大屁股妇女流出白浆_泷川苏菲亚无码AV_我想看我想看一级男同乱伦_国产精品午夜福利免费视频,gogo国模全球大胆高清摄影图,2008门艳照全集视频,欧美午夜在线精品品亚洲AV中文无码乱人伦在线播放

廣東財經(jīng)大學(xué)統(tǒng)計與數(shù)學(xué)學(xué)院教授。廣東省千百十人才工程省級培養(yǎng)對象,。

張贊波的研究方向是圖論及其算法,，組合優(yōu)化和圖計算,。在圖論方面,，研究興趣包括圖的匹配問題,、圖劃分問題和有向圖的路圈問題,；在圖算法和圖計算方面,，主要研究圖與超圖劃分問題的可近似性和近似算法設(shè)計,，大規(guī)模圖的并行算法。迄今,，發(fā)表圖論與算法方向的論文近30篇,，包括在組合數(shù)學(xué)著名期刊《SIAM Journal on Discrete Mathematics》發(fā)表論文兩篇，在圖論著名期刊《Journal of Graph Theory》發(fā)表論文一篇,。

取得的重要結(jié)果包括：

圖的匹配理論方面：提出并證明了圖的匹配擴展理論中兩個重要圖類的等價條件,；證明了匹配可擴性與有向圖連通性的等價關(guān)系；以及研究了匹配可擴性的極值條件等,。

有向圖方面：證明了有向圖中存在長圈,、任意長度的圈或任意長度的路的一系列充分條件；改進了具有30多年歷史的有向哈密頓圈存在性的Woodall條件,；有向圖路可擴性的一系列度條件和競賽圖的路可擴性,；二部競賽圖的圈可擴性與哈密頓性的等價關(guān)系。

圖算法和圖計算：在具有大數(shù)據(jù)管理和分析應(yīng)用背景的圖與超圖劃分問題的算法設(shè)計和復(fù)雜度分析方面取得一系列成果,，包括基于半定規(guī)劃的圖最大割算法設(shè)計,，染色圖的圈和團劃分問題的復(fù)雜度分析和算法設(shè)計，以及圖的最大獨立三角形集的判定條件等,；近期從事超級計算機上大規(guī)模圖的并行算法研究,。

主持廣東省自然科學(xué)基金項目“有向圖的Hamilton問題和因子問題”（2016A030313829）和“對集交錯圈與對集擴展的若干問題”（9451030007003340）,。作為第一參與人參與國家自然科學(xué)基金項目“反推數(shù)學(xué)及相關(guān)可計算性理論問題”（11471342）。作為第二參與人參與廣東省自然科學(xué)基金項目“基于NPLS-樣條函數(shù)的智能傳感器自校正建模方法研究（S2012040007521）”,。作為第二參與人參與參與廣州市科技計劃項目“物聯(lián)網(wǎng)室內(nèi)微環(huán)境監(jiān)測技術(shù)研究”,。

為《Discrete Applied Mathematics》，《Graphs and Combinatorics》,，《Frontiers of Mathematics in China》和《Ars Combinatorics》等國際期刊審稿,。并獲美國數(shù)學(xué)會《數(shù)學(xué)評論》和歐洲《數(shù)學(xué)文摘》邀請成為其評論員。多次應(yīng)邀往國內(nèi)外大學(xué)訪問和演講,。

2014.1-2017.9,， 荷蘭特文特大學(xué)（University of Twente），博士

2004.9-2008.6,，中山大學(xué)計算機科學(xué)系,，博士

1998.9-2001.6，中山大學(xué)軟件研究所,，碩士

1993.9-1997.6,，中山大學(xué)計算機科學(xué)系，學(xué)士

2019.11-今,，廣東財經(jīng)大學(xué),，教授。

2004.08-2019.11,，廣東輕工職業(yè)技術(shù)學(xué)院計算機工程系/信息技術(shù)學(xué)院,，講師，副教授,，教授

2001.08-2004.08,，廣東北電研發(fā)中心，軟件工程師,，系統(tǒng)維護和支持 

1997.07-1998.08,，中山大學(xué)軟件研究所，軟件工程師

廣東省“千百十工程”省級培養(yǎng)對象

本科課程

線性代數(shù),，離散數(shù)學(xué)

高職高專課程,。

數(shù)據(jù)結(jié)構(gòu)，C程序設(shè)計,，C#程序設(shè)計,，C#應(yīng)用開發(fā)，Java程序設(shè)計,，Java應(yīng)用開發(fā),，SQL Server，項目開發(fā)指導(dǎo)

博士/碩士專業(yè)課

自動數(shù)據(jù)采集，極圖理論,，算法圖論,，匹配理論，大數(shù)據(jù)算法,，并行算法,，并行圖論算法

        圖論及其算法 , 組合優(yōu)化

1.        X. Zhang, R. Ma, J. Sun, & Z. B. Zhang（張贊波，通訊）(2020). Randomized selection algorithm for online stochastic unrelated machines scheduling. Journal of Combinatorial Optimization, 1-16.

2.        L. Wang, Y. Shi, Z. Zhang, Z. B. Zhang（張贊波）& Zhang, X. (2020). Approximation algorithm for a generalized Roman domination problem in unit ball graphs. Journal of Combinatorial Optimization, 39(1), 138-148.

3.        Z. Zhang（張贊波）, Z. Chen. Length of cycles in generalized Petersen graphs. Acta Mathematics Universitatis Comenianae 88 (2019) 1093-1100.

4.        J. Liang, B. Zeng, Q. Liu, Z. Zhang（張贊波,，通訊）, N. Nie. An improved algorithm based on KNN and random forest, In Proceedings of the 3rd International Conference on Computer Science and Application Engineering (2019). ACM.

5.        Zan-Bo Zhang(張贊波), X. Zhang, H. Broersma and D. Lou. Extremal and degree conditions for path extendability in digraphs. Siam Journal on Discrete Mathematics 31.3 (2017) 1990-2014(SCI).

6.        唐彩虹, 張贊波. 激光遙感圖像乘性噪聲降噪技術(shù). 現(xiàn)代電子技術(shù), 2017, 40(20), 98-100.

7.        J. Liang, D. Lou, and Zan-Bo Zhang(張贊波). A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. International Journal of Computer Mathematics (SCI), 94-7 (2017) 1501-1514.

8.        X. Zhang, Zan-Bo Zhang (張贊波，通訊作者), H. Broersma and X. Wen. On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete Mathematics & Theoretical Computer Science (SCI), 17-3 (2016), 227-244.

9.        陳燕升, 張贊波等, 一種優(yōu)化的可能性測度計算樹邏輯檢測模型, 《中山大學(xué)學(xué)報（自然科學(xué)版）》, 2015, 54(4), 49-54.

10.     陳燕升, 張贊波等, 改進的最小鏈接負載均衡調(diào)度算法, 《計算機系統(tǒng)應(yīng)用》, 2015, 24(7), 88-92.

11.     Z. Gan, D. Lou, Zan-Bo Zhang(張贊波), X. Wen. Bipartite double cover and perfect 2-matching covered graph with its algorithm. Frontiers of Mathematics in China 10 (2015): 621-634 (SCI).

12.     B. Xu, X. Yu, X. Zhang and Zan-Bo Zhang (張贊波). An SDP approximation algorithm for max hypergraph cut with limited unbalance. Science China Mathematics 57 (2014), 2437-2462 (SCI). (該論文作者名按姓氏排序,。)

13.     Zan-Bo Zhang (張贊波), X. Zhang. Triangle strings: structures for augmentation of vertex disjoint triangle sets. Information Processing Letter 114 (2014), 450-456 (SCI).

14.     Zan-Bo Zhang (張贊波), X. Zhang and X. Wen. Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs. Siam Journal on Discrete Mathematics 27 (2013) 274-289 (SCI).

15.     李均豪, 張贊波等, 代謝反應(yīng)網(wǎng)絡(luò)可視化系統(tǒng)的力導(dǎo)向布局算法設(shè)計, 《計算機仿真》2012, 29 (11), 47-50, 94. 參加2012年9月舉行的第十二屆中國虛擬現(xiàn)實大會.

16.     Zan-Bo Zhang (張贊波), X. Zhang, D. Lou and X. Wen. Minimum size of n-factor-critical graphs and k-extendable graphs. Graphs and Combinatorics 28(2012) 433-448 (SCI).

17.     X. Wen, Zan-Bo Zhang (張贊波) and D. Lou, M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivity. Discrete Mathematics 311(2011) 817-826 (SCI).

18.     X. Zhang, Zan-Bo Zhang (張贊波, 通訊作者), X. Lu and J. Li. Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility. Ars Combinatoria 95(2010) 437-444 (SCI).

19.     Zan-Bo Zhang (張贊波), Y. Li and D. Lou. M-alternating Hamilton paths and M-alternating Hamilton cycles. Discrete Mathematics 309 (2009) 3385-3392 (SCI).

20.     X. Wen, Z. Yang and Zan-Bo Zhang (張贊波). Construction characterizations for defect n-extendable bipartite graphs. AKCE Journal of Graphs and Combinatorics  6 (2009) 353-360.

21.     Q.-M. Wang, Y. Tang and Zan-Bo Zhang (張贊波). Research in Enterprise Applications of Dynamic Web Service Composition Methods and Models. In ISECS '09: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01, 146-150, IEEE Computer Society,  Washington, DC, USA, 2009 (EI).

22.     Zan-Bo Zhang (張贊波), D. Lou. Notes on bipartite graphs with a perfect matching and digraphs. Advances and Applications in Discrete Mathematics 3 (2009) 87-96.

23.     Zan-Bo Zhang (張贊波), D. Lou and X. Zhang. Notes on factor-criticality, extendibility and independence number. Ars Combinatoria 87 (2008) 139-146 (SCI).

24.     Zhang X., Wang C., Sun Z. and Zhang Zanbo (張贊波). A new Image encryption scheme based on two-dimensional CA joint with CWQ method. 南京師大學(xué)報 (自然科學(xué)版), 第31卷第1期, 1-7, 2008.3.

25.     Zan-Bo Zhang (張贊波), T. Wang and D. Lou. Equivalence between extendibility and factor-criticality. Ars Combinatoria 85(2007) 279-285 (SCI).

26.     邵亮, 李磊, 張贊波. 評估無級電話網(wǎng)選路方案的一個解析模型. 通信學(xué)報, 第24卷第2期, 38-44, 2003.2 (EI).

Introduction

Education

Ph.D. in Applied Mathematics, University of Twente, the Netherlands, September

2017, advised by Professor Hajo Broersma. Doctoral Thesis: Paths, Cycles and

Related Partitioning Problems in Graphs.

Ph.D. in Computer Science, Sun Yat-sen University, China, June 2008, advised by

Professor Dingjun Lou. Doctoral Thesis: Equivalence between k-extendable Graphs

and n-factor-critical Graphs and Their Properties.

M.Eng. in Computer Science, Sun Yat-sen University, China, June 2001.

B.S. in Computer Science, Sun Yat-sen University, China, June 1997.

Work Experience

1997-1998, The Software Research Institute of Sun Yat-sen University, as a software

engineer.

2001-2004, Research and Development Center, Guangdong Nortel Telecommunica-

tions Equipment Co., Ltd (A key joint venture of Nortel Networks, Canada).

- 2001.7-2003.3, as a software engineer and technical support engineer.

- 2003.4-2004.8, as the global technical support team leader.

2004-2019, Guangdong Industry Polytechnic, as a lecturer, an associate professor, and a professor.

2019-now, Guangdong University of Finance and Economics, as a professor.

Honor

Academic Activities

Teaching