Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link lo...Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link loops that are incident to each tree branch in the fundamental loop matrix Bf. The proposed method judges the pendent properties of the tree branches, determines their order one by one and then achieves the realization of the linear tree. The graph that corresponds to Bf is eventually constructed by adding links to the obtained linear tree. The proposed method can be extended for the realization of a general tree.展开更多
This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted av...This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented.展开更多
Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which...Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.展开更多
为解决在选择性催化还原技术(selective catalytic reduction,SCR)的控制策略开发中局部线性模型树(local linear model tree,LOLIMOT)排放模型预测精度不足的问题,提出一种通过优化空间边界,将原模型的超矩形输入空间约束在物理意义范...为解决在选择性催化还原技术(selective catalytic reduction,SCR)的控制策略开发中局部线性模型树(local linear model tree,LOLIMOT)排放模型预测精度不足的问题,提出一种通过优化空间边界,将原模型的超矩形输入空间约束在物理意义范围内的改进LOLIMOT模型。通过某天然气发动机的辨识试验,从分布特征和计算原理角度,分析了该方法对预测结果的影响。结果表明:与原算法相比,改进算法的线性相关度R2提升了1.9%,验证了改进策略的有效性。改进LOLIMOT算法具备较高的收敛速度和稳定性,在排放模型领域具备一定的应用优势。展开更多
文摘Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link loops that are incident to each tree branch in the fundamental loop matrix Bf. The proposed method judges the pendent properties of the tree branches, determines their order one by one and then achieves the realization of the linear tree. The graph that corresponds to Bf is eventually constructed by adding links to the obtained linear tree. The proposed method can be extended for the realization of a general tree.
文摘This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented.
基金supported by the National Natural Science Foundation of China(6050203260672068).
文摘Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.
文摘为解决在选择性催化还原技术(selective catalytic reduction,SCR)的控制策略开发中局部线性模型树(local linear model tree,LOLIMOT)排放模型预测精度不足的问题,提出一种通过优化空间边界,将原模型的超矩形输入空间约束在物理意义范围内的改进LOLIMOT模型。通过某天然气发动机的辨识试验,从分布特征和计算原理角度,分析了该方法对预测结果的影响。结果表明:与原算法相比,改进算法的线性相关度R2提升了1.9%,验证了改进策略的有效性。改进LOLIMOT算法具备较高的收敛速度和稳定性,在排放模型领域具备一定的应用优势。
