基于生成式对抗网络的人脸素描图像转换为RGB图像方法
发明/设计人：
赵辉煌;张丰;孙雅琪;林睦纲
申请/专利权人：
衡阳师范学院
申请/专利号：
CN202011283698.4
申请时间：
2020-11-17
公开号：
CN112270300A
公开时间：
2021-01-26
主申请人地址：
421000 湖南省衡阳市雁峰区黄白路165号
摘要：
本发明公开了一种基于生成式对抗网络的人脸素描图像转换为RGB图像的方法，该方法针对单幅人脸素描图像转换为RGB图像，首先对数据集进行预处理，其次建立生成式对抗网络模型，并利用预处理后的数据集对其生成模型和判别模型进行交替训练，然后通过优化损失函数，得到训练好的模型，再将测试集输入模型进行测试，输出生成的彩色人脸图像，利用结构相似性(即SSIM)方法与真实的彩色人脸图像进行计算，得到两张图像最终的相似度；本发明填补了生成式对抗网络在人脸图像运用上的空缺，同时网络的泛化能力和鲁棒性更强，少量的数据集也可以作为训练样本，节省了人工搜集图像的时间且能够提高了模型的性能和图像转换的精度。
展开
A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem
作者：
Lin, Mugang* ;Liu, Fangju;Zhao, Huihuang;Chen, Jianzhen
期刊：
工程与科学中的计算机建模(英文) ,2020年125(1):197-214 ISSN：1526-1492
通讯作者：
Lin, Mugang
作者机构：
[Chen, Jianzhen; Zhao, Huihuang; Lin, Mugang] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China.;[Chen, Jianzhen; Zhao, Huihuang; Lin, Mugang] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421002, Peoples R China.;[Liu, Fangju] Univ South China, Sch Comp Sci, Hengyang 421001, Peoples R China.
通讯机构：
[Lin, Mugang] H;Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China.;Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421002, Peoples R China.
关键词：
Binary firefly algorithm;Discrete optimization;Meta-heuristics;Minimum labeling spanning tree problem
摘要：
Given a connected undirected graph G whose edges are labeled, the minimum labeling spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of different labels. The MLST is an NP-hard combinatorial optimization problem, which is widely applied in communication networks, multimodal transportation networks, and data compression. Some approximation algorithms and heuristics algorithms have been proposed for the problem. Firefly algorithm is a new meta-heuristic algorithm. Because of its simplicity and easy implementation, it has been successfully applied in various fields. However, the basic firefly algorithm is not suitable for discrete problems. To this end, a novel discrete firefly algorithm for the MLST problem is proposed in this paper. A binary operation method to update firefly positions and a local feasible handling method are introduced, which correct unfeasible solutions, eliminate redundant labels, and make the algorithm more suitable for discrete problems. Computational results show that the algorithm has good performance. The algorithm can be extended to solve other discrete optimization problems. © 2020 Tech Science Press. All rights reserved.
语种：
英文
展开
Exponential time approximation scheme for TSP
作者：
Chen, Zhixiang;Feng, Qilong;Fu, Bin* ;Lin, Mugang;Wang, Jianxin
期刊：
Lecture Notes in Computer Science ,2019年11640:121-128 ISSN：0302-9743
通讯作者：
Fu, Bin
作者机构：
[Fu, Bin; Chen, Zhixiang] Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX 78539 USA.;[Feng, Qilong; Wang, Jianxin] Cent Southern Univ, Sch Informat, Changsha, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.
通讯机构：
[Fu, Bin] U;Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX 78539 USA.
会议名称：
13th International Conference on Algorithmic Aspects in Information and Management (AAIM)
会议时间：
AUG 06-08, 2019
会议地点：
Beijing, PEOPLES R CHINA
会议主办单位：
[Chen, Zhixiang;Fu, Bin] Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX 78539 USA.^[Feng, Qilong;Wang, Jianxin] Cent Southern Univ, Sch Informat, Changsha, Peoples R China.^[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.
会议论文集名称：
Lecture Notes in Computer Science
关键词：
Directed graphs;Polynomial approximation;Traveling salesman problem;Approximation scheme;Complexity theory;Exponential time;Exponential time hypothesis;Nonnegative real number;Polynomial space;Time constants;Undirected graph;Approximation algorithms
摘要：
In this paper, we develop an exponential time approximation scheme for the traveling salesman problem (TSP) on undirected graphs. If the weight of each edge is a nonnegative real number, then there is an algorithm to give an (1 + ϵ) approximation for the TSP problem in O(1/ϵ·1.66n) and a polynomial space. It is in contrast to Golovnen’s approximation scheme for TSP on directed graphs with O(1/ϵ·2n) time. We also show that there is no 2o(n) time constant factor approximation for the TSP problem under Exponential Time Hypothesis in complexity theory. © Springer Nature Switzerland AG 2019.
语种：
英文
展开
基于局部和全局优化融合图像卷积神经网络风格迁移方法
发明/设计人：
赵辉煌;郑金华;王耀南;梁小满;林睦纲;...
申请/专利权人：
衡阳师范学院
申请/专利号：
201910388700.5
申请时间：
2019.05.10
公开号：
110118468B
公开时间：
2019.08.09
主申请人地址：
湖南省衡阳市雁峰区黄白路165号
摘要：
本发明公开了一种基于局部和全局优化融合图像卷积神经网络风格迁移方法，首先选定需转换的内容图像和风格图像，采用深度卷积神经网络VGG‑19作为图像高级风格特征提取基础模型。然后在VGG‑19模型中挑选局部优化内容约束层和风格约束层，建立新的网络模型F1，并定义基于局部优化的图像风格迁移损失函数；然后在VGG‑19模型中选择全局优化风格约束层，建立新的网络模型F2，然后把图像风格迁移局部优化损失函数和图像风格迁移全局优化损失函数进行线性融合得到总的损失函数。最后初始化一张噪声图像，依据图像风格迁移损失函数，采用网络模型F1、F2分别提取内容图像和风格图像和特征图，利用梯度下降法，经多次迭代最小化损失函数，最后生成风格迁移结果图像。
展开
Image Neural Style Transfer With Global and Local Optimization Fusion
作者：
Zhao, Hui-Huang* ;Rosin, Paul L.;Lai, Yu-Kun;Lin, Mu-Gang;Liu, Qin-Yun
期刊：
IEEE ACCESS ,2019年7:85573-85580 ISSN：2169-3536
通讯作者：
Zhao, Hui-Huang
作者机构：
[Liu, Qin-Yun; Lin, Mu-Gang; Zhao, Hui-Huang] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421008, Peoples R China.;[Liu, Qin-Yun; Lin, Mu-Gang; Zhao, Hui-Huang] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421008, Hunan, Peoples R China.;[Lai, Yu-Kun; Rosin, Paul L.] Cardiff Univ, Sch Comp Sci & Informat, Cardiff CF24 3AA, S Glam, Wales.
通讯机构：
[Zhao, Hui-Huang] H;Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421008, Peoples R China.;Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421008, Hunan, Peoples R China.
关键词：
Deep neural networks;gram matrix;local patch;Markov random field;style transfer
摘要：
This paper presents a new image synthesis method for image style transfer. For some common methods, the textures and colors in the style image are sometimes applied inappropriately to the content image, which generates artifacts. In order to improve the results, we propose a novel method based on a new strategy that combines both local and global style losses. On the one hand, a style loss function based on a local approach is used to keep the style details. On the other hand, another style loss function based on global measures is used to capture more global structural information. The results on various images show that the proposed method reduces artifacts while faithfully transferring the style image's characteristics and preserving the structure and color of the content image.
语种：
英文
展开
Randomized Parameterized Algorithms for the Kidney Exchange Problem
作者：
Mugang Lin;Jianxin Wang 0001;Qilong Feng;Bin Fu
期刊：
Algorithms ,2019年12(2):50 ISSN：1999-4893
通讯作者：
Wang, Jianxin(jxwang@csu.edu.cn)
作者机构：
[Mugang Lin; Jianxin Wang 0001; Qilong Feng] School of Computer Science and Engineering, Central South University, Changsha;410083, China;School of Computer Science and Technology, Hengyang Normal University, Hengyang;421002, China;Hunan Provincial Key Laboratory of Intelligent Information Processing and Application, Hengyang
通讯机构：
[Jianxin Wang] S;School of Computer Science and Engineering, Central South University, Changsha 410083, China<&wdkj&>Author to whom correspondence should be addressed.
关键词：
Kidney exchange problem;Multilinear monomial detection;Parameterized algorithm;Random partitioning;Randomized algorithm
摘要：
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries. In the programs, designing algorithms for the kidney exchange problem plays a critical role. The graph theory model of the kidney exchange problem is to find a maximum weight packing of vertex-disjoint cycles and chains for a given weighted digraph. In general, the length of cycles is not more than a given constant L (typically 2 ≤ L ≤ 5), and the objective function corresponds to maximizing the number of possible kidney transplants. In this paper, we study the parameterized complexity and randomized algorithms for the kidney exchange problem without chains from theory. We construct two different parameterized models of the kidney exchange problem for two cases L = 3 and L ≥ 3, and propose two randomized parameterized algorithms based on the random partitioning technique and the randomized algebraic technique, respectively. © 2019 by the authors.
语种：
英文
展开
An improved FPT algorithm for Almost Forest Deletion problem
作者：
Lin, Mugang;Feng, Qilong* ;Wang, Jianxin;Chen, Jianer;Fu, Bin;...
期刊：
Information Processing Letters ,2018年136:30-36 ISSN：0020-0190
通讯作者：
Feng, Qilong
作者机构：
[Feng, Qilong; Lin, Mugang; Wang, Jianxin] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.;[Lin, Mugang] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang, Peoples R China.;[Chen, Jianer] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA.;[Fu, Bin] Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX USA.
通讯机构：
[Feng, Qilong] C;Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
关键词：
Almost forest deletion;Feedback vertex set;Fixed-parameter algorithm;Graph algorithms;Iterative compression
摘要：
Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given graph G whose removal from G results in an l-forest, where k and l are two given non-negative integers, and an l-forest is a graph which can be transformed into a forest by deleting at most l edges. Based on the iterative compression technique, we study the iterative version of the AFD problem, called Almost Forest Deletion Disjoint Compression problem (AFDDC), which asks for a new l-forest deletion set X′ of size at most k for a given graph G that is disjoint with a given l-forest deletion set X of graph G for two given non-negative integers k and l. For the AFDDC problem, we develop some reduction rules to simplify a given instance, and give a new branching algorithm for the problem. A new branching measure is presented to evaluate the efficiency of the algorithm, which results in an algorithm of running time O⁎(4k+l). Based on the proposed algorithm for the AFDDC problem, a parameterized algorithm for the AFD problem with running time O⁎(5k4l) is presented, improving the previous result O⁎(5.0024(k+l)).
语种：
英文
展开
Constant factor approximation algorithm for l-pseudoforest deletion problem
作者：
Lin, Mugang;Fu, Bin;Feng, Qilong*
期刊：
Lecture Notes in Computer Science ,2018年10976 LNCS:726-737 ISSN：0302-9743
通讯作者：
Feng, Qilong
作者机构：
[Feng, Qilong; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.;[Lin, Mugang] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang, Peoples R China.;[Fu, Bin] Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX 78539 USA.
通讯机构：
[Feng, Qilong] C;Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
会议名称：
24th International Computing and Combinatorics Conference (COCOON)
会议时间：
JUL 02-04, 2018
会议地点：
Qing Dao, PEOPLES R CHINA
会议主办单位：
[Lin, Mugang;Feng, Qilong] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.^[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.^[Lin, Mugang] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang, Peoples R China.^[Fu, Bin] Univ Texas Rio Grande Valley, Dept Comp Sci, Edinburg, TX 78539 USA.
会议论文集名称：
Lecture Notes in Computer Science
关键词：
Graph theory;Polynomial approximation;Trees (mathematics);Approximation factor;Approximation ratios;Connected component;Constant-factor approximation algorithms;Feedback Vertex Set problems;l-Pseudoforest Deletion problem;Local ratio;Local ratio technique;Approximation algorithms
摘要：
An l-pseudoforest is a graph each of whose connected component is at most l edges away from being a tree. The l-Pseudoforest Deletion problem is to delete a vertex set P of minimum weight from a given vertex-weighted graph (Formula Presented) such that the remaining graph (Formula Presented) is an l-pseudoforest. The Feedback Vertex Set problem is a special case of the l-Pseudoforest Deletion problem with (Formula Presented). In this paper, we present a polynomial time 4l-approximation algorithm for the l-Pseudoforest Deletion problem with (Formula Presented) by using the local ratio technique. When (Formula Presented), we get a better approximation ratio 2 for the problem by further analyzing the algorithm, which matches the current best constant approximation factor for the Feedback Vertex Set problem. © 2018, Springer International Publishing AG, part of Springer Nature.
语种：
英文
展开
一种网络学习资源聚合查询的方法和系统
发明/设计人：
唐四薪,林睦纲,唐琼
申请/专利权人：
衡阳师范学院
申请/专利号：
CN201710152062.8
申请时间：
2017-3-15
公开号：
CN106934036A
公开时间：
2017-7-7
主申请人地址：
421002 湖南省衡阳市珠晖区衡花路16号
摘要：
本发明提供了一种网络学习资源聚合查询的方法和系统，目的是克服需要目标网站提供技术支持，以及需要将采集的数据进行结构化处理的缺点，且不引起版权纠纷，满足个性化搜索的需要。技术方案是采用CURL多线程函数同时向若干个目标网站发送查询请求和查询关键字，使用正则表达式提取所述目标网站返回代码中的搜索结果列表区域，再对所述返回代码中的URL进行修正，最后将这些所述返回代码载入到本系统的搜索结果页中。本发明的优点在于：不需要将从目标网站获取的非结构化数据转换为结构化数据；不需要在本系统的服务器端存储从目标网站获取得到的数据，从而不会产生版权纠纷；不需要目标网站提供任何技术支持，满足个性化搜索需要，简单实用。
展开
应用型本科院校离散数学教学改革与探索
作者：
林睦纲;郑光勇;陈坚祯
期刊：
衡阳师范学院学报 ,2017年38(06):124-127 ISSN：1673-0313
作者机构：
衡阳师范学院计算机科学与技术学院,湖南 衡阳,421002;[陈坚祯; 郑光勇; 林睦纲] 衡阳师范学院
关键词：
离散数学;应用型本科;教学改革
摘要：
分析当前离散数学教学过程中存在的问题,根据应用型人才培养目标,结合离散数学课程特点,对离散数学教学进行改革与探索.在实际教学中,通过精选教学内容,设置不同的知识模块,构建应用型知识体系,改革教学方法与手段,加强实践操作,建立全面的考核机制等教学改革,培养学生的自主学习能力,提高学生分析解决实际问题的能力,取得较好的教学效果.
语种：
中文
展开
Partition on trees with supply and demand: Kernelization and algorithms
作者：
Lin, Mugang;Feng, Qilong* ;Chen, Jianer;Li, Wenjun
期刊：
Theoretical Computer Science ,2017年657(PA):11-19 ISSN：0304-3975
通讯作者：
Feng, Qilong
作者机构：
[Feng, Qilong; Chen, Jianer; Li, Wenjun; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Peoples R China.;[Chen, Jianer] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA.;[Li, Wenjun] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Hunan Prov Key Lab Intelligent Proc Big Data Tran, Changsha, Hunan, Peoples R China.
通讯机构：
[Feng, Qilong] C;Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
关键词：
Fixed-parameter tractability;Network reconfiguration;Kemelizaton;Branching algorithm
摘要：
Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition problem on trees with supply and demand from parameterized computation perspective. We analyze the relationship between supply nodes and demand nodes, and give four reduction rules, which result in a kernel of size O(k(2)) for the problem. Based on branching technique, a parameterized algorithm of running time O*(2.828(k)) is presented. (C) 2016 Published by Elsevier B.V.
语种：
英文
展开
Verifiable Top-k Query Processing in Tiered Mobile Sensor Networks
作者：
Liu, Fangju* ;Ma, Xingpo;Liang, Junbin;Lin, Mugang
期刊：
International Journal of Distributed Sensor Networks ,2015年2015(10):437678:1-437678:13 ISSN：1550-1329
通讯作者：
Liu, Fangju
作者机构：
[Liu, Fangju] Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.;[Ma, Xingpo] Xinyang Normal Univ, Sch Comp & Informat Technol, Xinyang 464000, Henan, Peoples R China.;[Liang, Junbin] Guangxi Univ, Sch Comp & Elect Informat, Nanning 530004, Guangxi, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
通讯机构：
[Liu, Fangju] U;Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
关键词：
Information retrieval;Query processing;Sensor networks;Analysis and simulation;Mobile sensor networks;Mobile sensor node;Static sensor networks;Static sensor nodes;Static state;Symmetric keys;Top-k query processing;Sensor nodes
摘要：
Verifiable top-k query processing in tiered sensor networks, which refers to verifying the authenticity and the completeness of top-k query results received by the network owner in tiered sensor networks, has received attention in very recent years. However, the existing solutions of this problem are only fit for static sensor network. In this paper, we try to solve the problem in a tiered mobile sensor network model, where not only static sensor nodes but also mobile sensor nodes existed. Based on the tiered mobile sensor network model, we propose a novel verifiable scheme named VTMSN for fine-grained top-k queries. The main idea of VTMSN is as follows: it maps each of the positions where sensor nodes are in a static state to a virtual node and then establishes relationships among data items of each virtual node with their score orders, which are encrypted along with the scores of the data items and the time epochs using the distinct symmetric keys kept by each sensor node and the network owner. Both theory analysis and simulation results show the efficiency and the security of VTMSN. © 2015 Fangju Liu et al.
语种：
英文
展开
基于DCMSTP问题的算法综述
作者：
赵磊;魏书堤;陈坚祯;林睦纲
期刊：
福建电脑 ,2015年(3):10-11+58 ISSN：1673-2782
作者机构：
衡阳师范学院计算机系 湖南 衡阳 421001;[陈坚祯; 魏书堤; 赵磊; 林睦纲] 衡阳师范学院
关键词：
度限制最小生成树问题;大规模;启发式算法
摘要：
DCMSTP （度限制最小生成树问题）是一个NP难问题，具有重要的实际应用价值。对于大规模的DCMSTP问题，至今还没有非常有效的求解方法。为此，本文对讨论了DCMSTP问题的数学模型和求解该问题的精确算法和启发式算法。
语种：
中文
展开
Randomized Algorithms for Parameterized Kidney Exchange Problem
作者：
Mugang Lin;Jianxin Wang;Qilong Feng
作者机构：
[Mugang Lin; Jianxin Wang; Qilong Feng] School of Information Science and Engineering,Central South University,Changsha 410083,China;[Mugang Lin] Department of Computer Science,Hengyang Normal University,Hengyang 421002,China
会议名称：
2015全国理论计算机科学学术年会
会议时间：
2015-10-30
会议地点：
金华
会议主办单位：
中国计算机学会
会议论文集名称：
2015全国理论计算机科学学术年会论文集
关键词：
Kidney exchange problem;Randomized algorithm;Parameterized algorithm
摘要：
Kidney exchange programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs.The core of these programs are algorithms to solve kidney exchange problem, which can be modeled as finding a maximum weight packing of vertex-disjoint cycles with length at most some small constant L (typically 2 ≤ L ≤ 5) in a directed graph.In generally, the objective function is maximizing the number of possible kidney transplants.In this paper, we study the random methods for the kidney exchange problem involving only 2-cycle and 3-cycle exchanges.First, we formal the kidney exchange problem as a parameterized model.And then we propose a randomized parameterized algorithm of running time O*(5.63k3 · 22k2) by randomly partitioning the vertices.Last, by using the random divide-and-conquer technique, another randomized algorithm of running time O* (k2[log k2/2.k3[logk3]/2.42k3.22k2) is given for the parameterized kidney problem.Moreover,our randomized algorithms can be extended to solve the general kidney exchange problem.
语种：
英文
展开
Parameterized minimum cost partition of a tree with supply and demand
作者：
Lin, Mugang* ;Li, Wenjun;Feng, Qilong
期刊：
Lecture Notes in Computer Science ,2015年9130:180-189 ISSN：0302-9743
通讯作者：
Lin, Mugang
作者机构：
[Feng, Qilong; Li, Wenjun; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
通讯机构：
[Lin, Mugang] C;Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
会议名称：
International Frontiers of Algorithmics Workshop
会议时间：
20150703-05
会议地点：
Guilin
会议主办单位：
[Lin, Mugang;Li, Wenjun;Feng, Qilong] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.^[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
会议论文集名称：
Frontiers in algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings
关键词：
Algorithms;Economics;Forestry;Minimum cost;Parameterized;Parameterized algorithm;Partition problem;Reduction rules;Running time;Supply and demand;Costs
摘要：
In this paper, we study the minimum cost partition problem of a tree with supply and demand. For the kernelizaton of the problem, several reduction rules are given, which result in a kernel of size O(k2) for the problem. Based on the branching technique, a parameterized algorithm of running time O* (2.828k) is presented. © Springer International Publishing Switzerland 2015.
语种：
英文
展开
一种基于边交换的贪心算法求解md-MST问题
作者：
赵磊;刘辉;魏书堤;陈坚祯;林睦纲
期刊：
数学的实践与认识 ,2015年(19):175-185 ISSN：1000-0984
作者机构：
衡阳师范学院计算机系,湖南衡阳,421001
关键词：
最小度限制最小生成树;贪心;边交换;最优解
摘要：
通过对最小度限制最小生成树（md-MST）问题性质进行分析,提出了一种基于边交换的贪心算法.算法先用贪心算法生成一棵生成树ST,然后对生成树ST经过边交换调整,得到满足问题约束条件的可行解,再对生成树ST进行进一步边交换优化,得到md-MST问题的最优解或接近最优解的近似解.实验证明,算法能在短对间内求出大规模顶点随机图的md-MST,是一种非常实用的求解md-MST问题的精确算法.
语种：
中文
展开
一种基于萤火虫算法的模糊聚类方法
作者：
林睦纲;刘芳菊;童小娇
期刊：
计算机工程与应用 ,2014年50(21):35-38,73 ISSN：1002-8331
作者机构：
[林睦纲; 童小娇] 衡阳师范学院计算机科学系;[刘芳菊] 南华大学计算机科学与技术学院
关键词：
萤火虫算法;模糊聚类;模糊C-均值聚类
摘要：
针对模糊C-均值聚类对初始值敏感、容易陷入局部最优的缺陷，提出了一种基于萤火虫算法的模糊聚类方法。该方法结合萤火虫算法良好的全局寻优能力和模糊C-均值算法的较强的局部搜索特性，用萤火虫算法优化搜索FCM的聚类中心，利用FCM进行聚类，有效地克服了模糊C-均值聚类的不足，同时增强了萤火虫算法的局部搜索能力。实验结果表明，该算法具有很好的全局寻优能力和较快的收敛速度，能有效地收敛于全局最优解，具有较好的聚类效果。
语种：
中文
展开
基于有序搜索的攻击图生成算法
作者：
刘芳菊;林睦纲;谭敏生
期刊：
南华大学学报(自然科学版) ,2014年(3):82-86 ISSN：1673-0062
作者机构：
南华大学 计算机科学与技术学院,湖南 衡阳,421001;衡阳师范学院 计算机科学系,湖南 衡阳,421008;[谭敏生; 刘芳菊] 南华大学;[林睦纲] 衡阳师范学院
关键词：
攻击图;有序搜索;网络安全
摘要：
为了有效的生成攻击图并且限制攻击图的规模,提出基于有序搜索的攻击图生成方法.该方法采用估价函数作为网络状态节点拓展的依据,估价函数值越小,优先进行扩展.利用该方法降低网络攻击图的规模,减少系统生成攻击图时耗费的资源,生成的攻击图能够用于评估网络的安全性,能够给网络管理员提供有价值的信息用于管理网络,预防入侵.
语种：
中文
展开
基于免疫算法的属性约简方法
作者：
朱志勇;林睦纲;徐长梅
期刊：
计算机工程与科学 ,2012年34(1):174-177 ISSN：1007-130X
作者机构：
[朱志勇; 徐长梅] 长沙学院计算机科学与技术系;[林睦纲] 衡阳师范学院计算机科学系
关键词：
免疫算法;粗糙集;属性约简
摘要：
为了求取决策表系统中属性的最小约简,本文提出了一种基于免疫算法的属性约简方法。该算法应用决策表的相对核来初始化种群,根据决策属性对条件属性的依赖度和抗体中条件属性的个数设计抗体的适应度函数,通过免疫记忆特性和抗体浓度的促进与抑制作用,保持了个体的多样性,提高了算法的全局搜索能力,避免陷入局部最优现象,从而求解出最小属性约简集合。实验结果表明,算法快速、有效,能得到较好的最小属性约简。
语种：
中文
展开
《网络编程》课程教学改革研究与探索
作者：
林睦纲;姜小奇;魏书堤;陈坚祯
期刊：
福建电脑 ,2011年27(1):37-38 ISSN：1673-2782
作者机构：
衡阳师范学院计算机科学系,湖南,衡阳,421002;[姜小奇; 陈坚祯; 魏书堤; 林睦纲] 衡阳师范学院
关键词：
网络编程;教学改革;教学方法
摘要：
针对网络编程课程教学中存在的主要问题,结合学生的实际情况,从教学实际出发,对网络编程课程的教学内容、教学方法与手段、课程考核等进行教学研究与探索,提出了教学改革的内容与方法,并应用于教学实践,取得较好的教学效果,提高了学生的网络编程能力与综合应用能力。
语种：
中文
展开
