郭龍坤
人物簡歷
教育經歷
2001年9月－2005年7月，中國科學技術大學，計算機科學與技術系，學士
2005年7月－2011年6月，中國科學技術大學，計算機學院，博士
海外經歷
2010年3月---2011年1月，澳大利亞阿德萊德大學，聯合培養（國家建設高水平大學公派研究生項目）；
2015年9月---2016年9月，澳大利亞阿德萊德大學，副研究員（Research Associate ，澳方項目DP150104871）．
研究領域
為數據科學與計算機網絡．致力於計算機網絡、數據科學、數據挖掘與隱私保護、並行與分布式計算等領域的重要優化問題的基於組合優化方法／統計概率方法的算法設計與分析．
已發表SCI/EI/ISTP收錄的國內外期刊與會議論文三十餘篇(包括Algorithmica, IEEE transactions on mobile computing(TMC), IEEE transactions on computers(TC), IEEE transactions on parallel and distributed systems (TPDS) 等國際頂級期刊及IJCAI, ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)等國際頂級會議．現任PDCAT, PAAP與Cloud-asia等會議的委員會成員（PC Member）．IEEE transactions on computers (TC)，IEEE transactions on parallel and distributed systems (TPDS)，Theoretical computer science等多個國際期刊審稿人．主持兩項國家自然科學基金與多項省部級自然科學基金，作為主要成員參與多項國家與省部自然科學基金．2018年入選福州大學「旗山學者」．
科研項目
國家自然科學基金面上項目，不相交QoS路徑的理論與應用，批准號61772005，2018.01-2021.12（主持，在研）
福建省自然科學基金面上項目，基於線性規劃的不相交QoS路徑算法研究，批准號2017J01753，2017.04-2020.04（主持，在研）
福州大學＂旗山學者＂項目，不相交路徑的算法與理論研究，批准號GXRC18034，2018.08-2021.07（主持，在研）
國家自然科學基金青年項目，不相交QoS路徑與斯坦納網絡的近似算法研究，批准號61300025，2014.01-2016.12（主持，已結題）
福建省自然科學基金項目，雲計算環境下高效視頻傳輸的算法研究，批准號2012J05115，2012.01-2014.12（主持，已結題）
教育部博士點基金項目（新教師類），基於不相交路徑技術的魯棒視頻流傳輸算法研究，批准號20123514120013，2012.01-2015.12（主持，已結題）
澳大利亞Discovery Project, 隱私保護的網絡流量分類Privacy Preserving Internet Traffic Classification，批准號DP150104871（參與，在研）
國家自然科學基金面上項目，主動學習式群智感知任務分配方法研究，批准號61772136，2018.01-2021.12（參與，在研）
國家自然科學基金青年項目，保護數據隱私性及抗量子密碼分析的可搜索加密研究，批准號61402112，2015.01-2017.12（參與，已結題）
獲獎情況
2014年，「On the Complexity of the edge-disjoint Min-Min problem in Planar Digraphs」, 第十一屆福建省自然科學優秀論文二等獎．
近年發表論文（標記*為通迅作者）
Referred Journal Papers:
Longkun Guo, Hong Shen and Wenxing Zhu, Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval, IEEE Transactions on Mobile Computing, 16(12): 3320-3333 (2017). CCF A類期刊, SCI 二區
Longkun Guo and Hong Shen, Improved Approximation Algorithms for Bounded Flexible Scheduling in Clouds, IEEE Transactions on Parallel and Distributed Systems, 28(12): 3511-3520 (2017). CCF A類期刊, SCI二區
Pei Yao (研究生), Longkun Guo(通訊作者). Exact algorithms for finding constrained minimum spanning trees. Journal of Combinatorial Optimization, DOI: 10.1007/s10878-020-00579-z (SCI三區)
Sai Ji, Dachuan Xu, Longkun Guo(通訊作者), Min Li, Dongmei Zhang. The seeding algorithm for spherical k-means clustering with penalties. Journal of Combinatorial Optimization, DOI: 10.1007/s10878-020-00569-1 SCI三區
Xing Chen, Haijiang Wang, Yun Ma, Xianghan Zheng, Longkun Guo(通訊作者): Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model. Future Generation Computer Systems. 105: 287-296 (2020). SCI一區
Longkun Guo and Peng Li, On the Complexity of and Algorithms for Detecting k-Length Negative Cost Cycles, Journal of Combinatorial Optimization, DOI: 10.1007/s10878-018-00371-0. SCI 三區
Longkun Guo, Min Li and Dachuan Xu, Approximation Algorithms for Maximum Coverage with Group Budget Constraints, Theoretical computer science, 788: 53-65 (2019). CCF B類期刊
Peihuang Huang, Wenxing Zhu, Longkun Guo(通訊作者): Minimizing Maximum Movement of Mobile Sensors for Covering Targets on a Line. Sensors 19(2): 273, 2019. SCI 三區
Peihuang Huang, Wenxing Zhu, Kewen Liao, Timos Sellis, Zhiyong Yu, Longkun Guo(通訊作者): Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing. IEEE Access 6: 50055-50065, 2018. SCI 二區
Longkun Guo, Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. Journal of combinatorial optimization, 32(1): 144-158, 2016. SCI 三區
Longkun Guo, Hong Shen and Kewen Liao, Improved approximation algorithms for computing disjoint paths subject to two constraints, Journal of Combinatorial Optimization, 29(1): 153-164, 2015. SCI 三區
Kaizhi Chen, Chenjun Lin, Shangping Zhong and Longkun Guo (通訊作者), A Parallel SRM Feature Extraction Algorithm for Steganalysis Based on GPU Architecture, Computer Science and Information Systems, 12(4): 1345-1359, 2015. SCI四區
Longkun Guo and Hong Shen, On finding Min-Min disjoint paths, Algorithmica, Vol. 66:641–653, 2013. CCF B類期刊 CORE A*類期刊
Longkun Guo and Hong Shen, On the Complexity of the edge-disjoint Min-Min problem in Planar Digraphs, Theoretical computer science, vol. 432: 58-63, 2012. CCF B類期刊 (二) 非一作/通迅期刊論文
Zhiyong Yu, Weiping Zhu, Longkun Guo, Wenzhong Guo, Zhiwen Yu: Task allocation for crowdsensing based on submodular optimisation. Int. J. Ad Hoc Ubiquitous Comput. 33(1): 48-61 (2020)
Shuangjuan Li, Hong Shen, Qiong Huang, Longkun Guo: Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network. IEEE Access 7: 156301-156314 (2019) SCI 二區
Zhiyong Yu, Jie Zhou, Wenzhong Guo, Longkun Guo, Zhiwen Yu: Participant selection for t-sweep k-coverage crowd sensing tasks. World Wide Web 21(3): 741-758 (2018) SCI 三區
Ping He, Hong Shen, Longkun Guo and Yidong Li, Efficient Data Retrieval Algorithms for Multiple Requests in MIMO Wireless Networks, International Journal of Communication Systems, 30: e2917, 2017. SCI期刊
Kewen Liao, Hong Shen and Longkun Guo, Improved approximation algorithms for constrained fault-tolerant resource allocation, Theoretical computer science, vol. 590: 118-128, 2015. CCF B類期刊，SCI核心
Hong Shen and Longkun Guo, An 8-Approximation Algorithm for Computing Rooted 3-Vertex Connected Minimum Steiner Networks, IEEE Transactions on Computers, 62(9): 1684-1693, 2013. CCF A類期刊
Hong Shen and Longkun Guo, Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks, IEEE Transactions on Computers, 61(7): 954-968, 2012. CCF A類期刊
Referred Conference Papers:
Longkun Guo, Yunyun Deng (研究生), et al. A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths, IJCAI 2018: 1456-1462. CCF A類會議，CORE-A*類會議
Min Cui, Dachuan Xu, Longkun Guo, Dan Wu: Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint. AAIM 2020: 195-203
Hongxiang Zhang, Dachuan Xu, Longkun Guo(通訊作者) and Jingjing Tan. Parallelized maximization of nonsubmodular function subject to a cardinality constraint. The 26th International Computing and Combinatorics Conference (COCOON 2020): 520-531
Xiaoyun Tian, Dachuan Xu, Longkun Guo(通訊作者) and Dan Wu. An improved Bregman k-means++ algorithm via local search. The 26th International Computing and Combinatorics Conference (COCOON 2020): 532-541
Yunyun Deng, Yi Chen, Kewen Liao and Longkun Guo(通訊作者). LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors. Accepted by the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
Ruiqi Yang, Dachuan Xu, Longkun Guo and Dongmei Zhang. Parametric Streaming Two-Stage Submodular Maximization. Accepted by the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
Xin Sun, Dachuan Xu, Longkun Guo (通訊作者) and Min Li. Approximation Guarantees for Deterministic Maximization of Submodular Function with A Matroid Constraint. Accepted by the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
Wenjie Zou, Longkun Guo, and Peihuang Huang, "Min-max movement of sink-based mobile sensors in the plane for barrier coverage," In Proceedings of the 20th International Conference on Parallel and Distributed Computing, Applications and Technologies 2019: 1-6
Haijiang Wang, Yun Ma, Xianghan Zheng, Xing Chen, Longkun Guo: Self-Adaptive Resource Management Framework for Software Services in Cloud. ISPA/BDCloud/SocialCom/SustainCom 2019: 1528-1529
Sai Ji, Dachuan Xu, Longkun Guo (通訊作者), Min Li, Dongmei Zhang:The Seeding Algorithm for Spherical k-Means Clustering with Penalties. AAIM 2019: 149-158
Yi Chen, Peihuang Huang, Longkun Guo (通訊作者): Evaluating Connection Quality between Two Individuals in Social Networks. BESC 2019: 1-6
Hongyu Sun, Qiang He, Kewen Liao, Timos Sellis, Longkun Guo, Xuyun Zhang, Jun Shen, Feifei Chen: Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams. BigData 2019: 1218-1223
Ruiqi Yang, Dachuan Xu, Longkun Guo (通訊作者), Dongmei Zhang: Sequence Submodular Maximization Meets Streaming. COCOA 2019: 565-575
Longkun Guo, Chenchen Wu, Huahui Yu, Xiaoyan Zhang: Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract). CSoNet 2019: 77-78
Zijing Ma, Shuangjuan Li, Longkun Guo, Guohua Wang: Non-linear K-Barrier Coverage in Mobile Sensor Network. PAAP 2019: 12-23
Zhendong Hao, Longkun Guo, Pei Yao, Peihuang Huang, Huihong Peng: Efficient Algorithms for Constrained Clustering with Side Information. PAAP 2019: 275-286
Peihuang Huang, Wenxing Zhu, Longkun Guo(通訊作者): On the Complexity of and Algorithms for Min-Max Target Coverage on a Line Boundary. TAMC 2019: 313-324. CORE B類 會議
Ziran Zhu, Zhuangqi Chen, Jianli Chen, Longkun Guo, Wenxing Zhu. Topology-Matching Bus Routing Considering Non-uniform Track Configurations and Obstacles. China Fault Tolerant Computing Conference (CFTC 2019).
Yunyun Deng (研究生), Longkun Guo(通訊作者), et al. Exact Algorithms for Finding Edge-Disjoint Paths for Multipath Routing, COCOON 2018: 14-25. CORE A類 會議
Yihong Zhang, Yongrui Qin, Longkun Guo: Constructing Multiple Domain Taxonomy for Text Processing Tasks. DEXA (2) 2018: 501-509. CORE B類 會議
Longkun Guo, Min Li and Dachuan Xu, Approximation Algorithms for Maximum Coverage with Group Budget Constraints, Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17): 362-376. CORE B類 會議
PeiYao (研究生) and Longkun Guo (通訊作者), Fast Approximation Algorithms for Computing Constrained Minimum Spanning Tree, Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17): 103-110. CORE B類 會議
Longkun Guo and Peng Li, On the Complexity of Detecting k-Length Negative Cost Cycles, Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17): 240-250. CORE B類 會議
Longkun Guo and Hong Shen, Privacy Preserving Internet Traffic Publication, IEEE TrustCom 2016: 884-891. CORE A類 會議
Longkun Guo, Kewen Liao, Hong Shen and Peng Li, Efficient Approximation Algorithms for Computing k Disjoint QoS Paths, 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015): 62-64, 2015. CORE A類 會議, CCF B類會議
Nianchen Zou(研究生), Longkun Guo (通訊作者), Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees. The 15th Int. Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2015): 567-577. CORE B類 會議
Longkun Guo, Hong Shen and Kewen Liao, On the Shallow-Light Steiner Tree Problem. The 15th International Conference on Parallel and Distributed Computing: Applications and Technologies (PDCAT 2014), 56-60. CORE B類 會議
Longkun Guo, Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. Frontier Algorithmic Workshop 2014, Lecture Notes in Computer Science 8497, pp 94-104, 2014. CORE B類 會議
Longkun Guo, NianChen Zuo, Yidong Li, Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent. The 6th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2014), pp 99-103, 2014.
Kaizhi Chen, Chenjun Lin, Shangping Zhong, Longkun Guo: A Parallel SRM Feature Extraction Algorithm for Steganalysis Based on GPU Architecture. The 6th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2014): pp 178-182, 2014.
Longkun Guo, Hong Shen and Kewen Liao, Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. The 19th International Computing and Combinatorics Conference (COCOON 2013), Lecture notes on computer science Vol. 7936, pp.325-336, 2013. CORE A類 會議
Kewen Liao, Hong Shen and Longkun Guo, "Improved approximation algorithms for constrained fault-tolerant resource allocation (Extended abstract) ". The 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), Lecture Notes in Computer Science, Vol. 8070, pp. 236-247, 2013. CORE A類 會議
Longkun Guo and Hong Shen, Efficient approximation algorithms for computing k disjoint minimum cost paths with delay constraint. The 13th International Conference on Parallel and Distributed Computing: Applications and Technologies (PDCAT2012), pp 627-631. CORE B類 會議
Longkun Guo, Hong Shen: Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. FAW-AAIM 2011: 300-307. CORE B類 會議
Longkun Guo, Hong Shen: A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs. PAAP 2011: 47-51.
Longkun Guo and Hong Shen, On the Complexity of the Edge-Disjoint Min-Min Problem in Undirected Graphs, Proceedings of the International Conference on Computer Research and Development, vol. 2: pp 150-154, 2011.[1]