Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
On the basis of experimental observations on animals, applications to clinical data on patients and theoretical statistical reasoning, the author developed a com-puter-assisted general mathematical model of the ‘prob...On the basis of experimental observations on animals, applications to clinical data on patients and theoretical statistical reasoning, the author developed a com-puter-assisted general mathematical model of the ‘probacent’-probability equation, Equation (1) and death rate (mortality probability) equation, Equation (2) derivable from Equation (1) that may be applica-ble as a general approximation method to make use-ful predictions of probable outcomes in a variety of biomedical phenomena [1-4]. Equations (1) and (2) contain a constant, γ and c, respectively. In the pre-vious studies, the author used the least maximum- difference principle to determine these constants that were expected to best fit reported data, minimizing the deviation. In this study, the author uses the method of computer-assisted least sum of squares to determine the constants, γ and c in constructing the ‘probacent’-related formulas best fitting the NCHS- reported data on survival probabilities and death rates in the US total adult population for 2001. The results of this study reveal that the method of com-puter-assisted mathematical analysis with the least sum of squares seems to be simple, more accurate, convenient and preferable than the previously used least maximum-difference principle, and better fit-ting the NCHS-reported data on survival probabili-ties and death rates in the US total adult population. The computer program of curved regression for the ‘probacent’-probability and death rate equations may be helpful in research in biomedicine.展开更多
In case of mathematical programming problems with conflicting criteria, the Pareto set is a useful tool for a decision maker. Based on the geometric properties of the Pareto set for a bicriteria linear programming pro...In case of mathematical programming problems with conflicting criteria, the Pareto set is a useful tool for a decision maker. Based on the geometric properties of the Pareto set for a bicriteria linear programming problem, we present a simple and fast method to compute this set in the criterion space using only an elementary linear program solver. We illustrate the method by solving the pig diet formulation problem which takes into account not only the cost of the diet but also nitrogen or phosphorus excretions.展开更多
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis...Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in [1]. Our approach is based on the use of linear programming and is solvable in polynomial time. The algorithm we developed can be implemented and parallelized in a very easy way.展开更多
In this paper we derive analytically the optimal set of relays for the maximal destination signal-to-noise ratio (SNR) in a two-hop amplify-and-forward cooperative network with frequency-selective fading channels. Sim...In this paper we derive analytically the optimal set of relays for the maximal destination signal-to-noise ratio (SNR) in a two-hop amplify-and-forward cooperative network with frequency-selective fading channels. Simple rules are derived to determine the optimal relays from all available candidates. Our results show that a node either participates in relaying with full power or does not participate in relaying at all, and that a node is a valid relay if and only if its SNR is higher than the optimal destination SNR. In addition, we develop a simple distributed algorithm for each node to determine whether participating in relaying by comparing its own SNR with the broadcasted destination SNR. This algorithm has extremely low overhead, and is shown to converge to the optimal solution fast and exactly within a finite number of iterations. The extremely high efficiency makes it especially suitable to time-varying mobile networks.展开更多
In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pe...In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pessimistic Pareto optimal solution concept by assuming that a player supposes the opponent adopts the most disadvantage strategy for the self. It is shown that any pessimistic Pareto optimal solution can be obtained on the basis of linear programming techniques even if the membership functions for the objective functions are nonlinear. Moreover, we propose interactive algorithms based on the bisection method to obtain a pessimistic compromise solution from among the set of all pessimistic Pareto optimal solutions. In order to show the efficiency of the proposed method, we illustrate interactive processes of an application to a vegetable shipment problem.展开更多
在机器学习和模式识别中,降维能够显著提升分类器的判别性能与效率。比率和(ratio sum,RS)是线性判别分析(linear discriminant analysis,LDA)的一种全新变体,它试图使投影矩阵在每个维度上都达到最优。但RS并没有考虑到数据的局部几何...在机器学习和模式识别中,降维能够显著提升分类器的判别性能与效率。比率和(ratio sum,RS)是线性判别分析(linear discriminant analysis,LDA)的一种全新变体,它试图使投影矩阵在每个维度上都达到最优。但RS并没有考虑到数据的局部几何结构,这就可能导致无法求得最优解。为了克服RS的这一缺点,提出了一种自适应近邻局部比值和线性判别分析算法(adaptive neighbor local ratio sum linear discriminant analysis,ANLRSLDA)。该算法使用自适应近邻的构图方法构建邻接矩阵,保留数据的局部几何结构完成了数据类间及类内矩阵的构建,从而更好地找到数据的最优表示;并且该方法采用有效的无核参数邻域分配策略来构造邻接矩阵,避免调整热核参数的需要。在UCI数据集及人脸数据集进行了对比实验,验证了该算法的有效性。展开更多
基金Foundation item： Supported by the National Natural Science Foundation of China（10671057） Supported by the Natural Science Foundation of Henan Institute of Science and Technology（06054）
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
文摘On the basis of experimental observations on animals, applications to clinical data on patients and theoretical statistical reasoning, the author developed a com-puter-assisted general mathematical model of the ‘probacent’-probability equation, Equation (1) and death rate (mortality probability) equation, Equation (2) derivable from Equation (1) that may be applica-ble as a general approximation method to make use-ful predictions of probable outcomes in a variety of biomedical phenomena [1-4]. Equations (1) and (2) contain a constant, γ and c, respectively. In the pre-vious studies, the author used the least maximum- difference principle to determine these constants that were expected to best fit reported data, minimizing the deviation. In this study, the author uses the method of computer-assisted least sum of squares to determine the constants, γ and c in constructing the ‘probacent’-related formulas best fitting the NCHS- reported data on survival probabilities and death rates in the US total adult population for 2001. The results of this study reveal that the method of com-puter-assisted mathematical analysis with the least sum of squares seems to be simple, more accurate, convenient and preferable than the previously used least maximum-difference principle, and better fit-ting the NCHS-reported data on survival probabili-ties and death rates in the US total adult population. The computer program of curved regression for the ‘probacent’-probability and death rate equations may be helpful in research in biomedicine.
文摘In case of mathematical programming problems with conflicting criteria, the Pareto set is a useful tool for a decision maker. Based on the geometric properties of the Pareto set for a bicriteria linear programming problem, we present a simple and fast method to compute this set in the criterion space using only an elementary linear program solver. We illustrate the method by solving the pig diet formulation problem which takes into account not only the cost of the diet but also nitrogen or phosphorus excretions.
文摘Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in [1]. Our approach is based on the use of linear programming and is solvable in polynomial time. The algorithm we developed can be implemented and parallelized in a very easy way.
文摘In this paper we derive analytically the optimal set of relays for the maximal destination signal-to-noise ratio (SNR) in a two-hop amplify-and-forward cooperative network with frequency-selective fading channels. Simple rules are derived to determine the optimal relays from all available candidates. Our results show that a node either participates in relaying with full power or does not participate in relaying at all, and that a node is a valid relay if and only if its SNR is higher than the optimal destination SNR. In addition, we develop a simple distributed algorithm for each node to determine whether participating in relaying by comparing its own SNR with the broadcasted destination SNR. This algorithm has extremely low overhead, and is shown to converge to the optimal solution fast and exactly within a finite number of iterations. The extremely high efficiency makes it especially suitable to time-varying mobile networks.
文摘In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pessimistic Pareto optimal solution concept by assuming that a player supposes the opponent adopts the most disadvantage strategy for the self. It is shown that any pessimistic Pareto optimal solution can be obtained on the basis of linear programming techniques even if the membership functions for the objective functions are nonlinear. Moreover, we propose interactive algorithms based on the bisection method to obtain a pessimistic compromise solution from among the set of all pessimistic Pareto optimal solutions. In order to show the efficiency of the proposed method, we illustrate interactive processes of an application to a vegetable shipment problem.
文摘在机器学习和模式识别中,降维能够显著提升分类器的判别性能与效率。比率和(ratio sum,RS)是线性判别分析(linear discriminant analysis,LDA)的一种全新变体,它试图使投影矩阵在每个维度上都达到最优。但RS并没有考虑到数据的局部几何结构,这就可能导致无法求得最优解。为了克服RS的这一缺点,提出了一种自适应近邻局部比值和线性判别分析算法(adaptive neighbor local ratio sum linear discriminant analysis,ANLRSLDA)。该算法使用自适应近邻的构图方法构建邻接矩阵,保留数据的局部几何结构完成了数据类间及类内矩阵的构建,从而更好地找到数据的最优表示;并且该方法采用有效的无核参数邻域分配策略来构造邻接矩阵,避免调整热核参数的需要。在UCI数据集及人脸数据集进行了对比实验,验证了该算法的有效性。
