郭龙坤查看源代码讨论查看历史
|
郭龙坤男，博士生导师，福州大学“旗山学者”，计算机科学系主任，教授．
人物简历
教育经历
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]