亚州成人免费特级黄色片100,中文字幕成人三级片,久久手机看片国产片

張贊波

教授

廣東財(cái)經(jīng)大學(xué) 統(tǒng)計(jì)與數(shù)學(xué)學(xué)院

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

www.sibylla19999.cn/eltonzhang

簡(jiǎn)介 ABOUT

動(dòng)態(tài) NEWS

學(xué)術(shù) ACADEMIC

圈子 LINKS

個(gè)人簡(jiǎn)介

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

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

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

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

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

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

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

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

教育背景

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

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

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

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

工作經(jīng)歷

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

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

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

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

主要榮譽(yù)

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

教學(xué)信息

本科課程

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

高職高專課程。

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

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

自動(dòng)數(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)化的可能性測(cè)度計(jì)算樹(shù)邏輯檢測(cè)模型, 《中山大學(xué)學(xué)報(bào)（自然科學(xué)版）》, 2015, 54(4), 49-54.

10. 陳燕升, 張贊波等, 改進(jìn)的最小鏈接負(fù)載均衡調(diào)度算法, 《計(jì)算機(jī)系統(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è)計(jì), 《計(jì)算機(jī)仿真》2012, 29 (11), 47-50, 94. 參加2012年9月舉行的第十二屆中國(guó)虛擬現(xiàn)實(shí)大會(huì).

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é)報(bào) (自然科學(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. 邵亮, 李磊, 張贊波. 評(píng)估無(wú)級(jí)電話網(wǎng)選路方案的一個(gè)解析模型. 通信學(xué)報(bào), 第24卷第2期, 38-44, 2003.2 (EI).

Biography

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.