An Improved Extra-Gradient Method for Minimizing a Sum of p-norms—A Variational Inequality Approach

This paper presents a variational inequality (VI) approach to the problem of minimizing a sum of p-norms. First the original problem is reformulated as an equivalent linear VI. Then an improved extra-gradient method is presented to solve the linear VI. Applications to the problem of p-norm Steiner Minimum Trees (SMT) shows that the proposed method is effective. Comparison with the general extra-gradient method is also provided to show the improvements of the new method.     

图的最小完整度

主要研究了图的完整度,并给出若干关于完整度的结果. 对于所有的顶点数和边数都给定的连通图类,如何确定该图类中完整度最小的图. 同时研究了对于顶点数和完整度都给定的连通图类,如何确定该图类中边数最多的图的问题. 这些结果为图的最小完整度的优化设计提供了理论和方法.     

Novel evolutionary models and applications to sequence alignment problems

In this paper, we present a novel graph-theoretical approach for representing a wide variety of sequence analysis problems within a single model. The model allows incorporation of the operations “insertion”, “deletion”, and “substitution”, and various parameters such as relative distances and weights. Conceptually, we refer the problem as the minimum weight common mutated sequence (MWCMS) problem. The MWCMS model has many applications including multiple sequence alignment problem, the phylogenetic analysis, the DNA sequencing problem, and sequence comparison problem, which encompass a core set of very difficult problems in computational biology. Thus the model presented in this paper lays out a mathematical modeling framework that allows one to investigate theoretical and computational issues, and to forge new advances for these distinct, but related problems. Through the introduction of supernodes, and the multi-layer supergraph, we proved that MWCMS is -complete. Furthermore, it was shown that a conflict graph derived from the multi-layer supergraph has the property that a solution to the associated node-packing problem of the conflict graph corresponds to a solution of the MWCMS problem. In this case, we proved that when the number of input sequences is a constant, MWCMS is polynomial-time solvable. We also demonstrated that some well-known combinatorial problems can be viewed as special cases of the MWCMS problem. In particular, we presented theoretical results implied by the MWCMS theory for the minimum weight supersequence problem, the minimum weight superstring problem, and the longest common subsequence problem. Two integer programming formulations were presented and a simple yet elegant decomposition heuristic was introduced. The integer programming instances have proven to be computationally intensive. Consequently, research involving simultaneous column and row generation and parallel computing will be explored. The heuristic algorithm, introduced herein for multiple sequence alignment, overcomes the order-dependent drawbacks of many of the existing algorithms, and is capable of returning good sequence alignments within reasonable computational time. It is able to return the optimal alignment for multiple sequences of length less than 1500 base pairs within 30 minutes. Its algorithmic decomposition nature lends itself naturally for parallel distributed computing, and we continue to explore its flexibility and scalability in a massive parallel environment.     

Regression and ANN models for estimating minimum value of machining performance

Surface roughness is one of the most common performance measurements in machining process and an effective parameter in representing the quality of machined surface. The minimization of the machining performance measurement such as surface roughness (R_a) must be formulated in the standard mathematical model. To predict the minimum R_a value, the process of modeling is taken in this study. The developed model deals with real experimental data of the R_a in the end milling machining process. Two modeling approaches, regression and Artificial Neural Network (ANN), are applied to predict the minimum R_a value. The results show that regression and ANN models have reduced the minimum R_a value of real experimental data by about 1.57% and 1.05%, respectively.     

关于最小二乘QR分解算法(LSQR)的一个注记

本文从最小多项式出发,通过寻找包含奇异线性系统Ax=b最小范数解的一个解空间,获得了一个更简单的求解广义逆的计算公式.并从理论上对最小二乘QR分解算法（LSQR）收敛性进行了简单分析,分析表明LSQR的收敛性与矩阵A的非零奇异值密切相关,并用A的非零奇异值以及所寻找到的最小范数解空间将最小范数解线性表出.     

最小范数二次无偏估计与最小方差二次无偏估计的关系

本文给出了当V0 ≥ 0时 ,c′σ2 在混合模型M =( y ,Xβ ,Uξ,σ20 V0 )下的最小范数二次无偏估计的表达式及其证明 ;得到了当 y服从正态分布时 ,c′σ2 的最小范数二次无偏估计与其最小方差二次无偏估计之间的关系。     

λ_5-geometry中的Steiner树问题(Ⅰ)

本文首先提出了 λ5-geometry中的 Steiner最小树问题 .讨论了 λ5-ge-ometry中的 Steiner最小树的若干性质 ,并给出了给定点数为 3或 4时 Steiner最小树的基本结构 .     

Non-linear determinacy of minimum wave speed for a Lotka-Volterra competition model

For a reaction-diffusion system that serves as a 2-species Lotka-Volterra diffusive competition model, suppose that the corresponding reaction system has one stable boundary equilibrium and one unstable boundary equilibrium. Then it is well known that there exists a positive number c^?, called the minimum wave speed, such that, for each c larger than or equal to c^?, the reaction-diffusion system has a positive traveling wave solution of wave speed c connecting these two equilibria if and only if c?c^?. It has been shown that the minimum wave speed for this system is identical to another important quantity - the asymptotical speed of population spread towards the stable equilibrium. Hence to find the minimum wave speed c^? not only is of the interest in mathematics but is of the importance in application. It has been conjectured that the minimum wave speed can be determined by studying the eigenvalues of the unstable equilibrium, called the linear determinacy. In this paper we will show that the conjecture on the linear determinacy is not true in general.     

Minimum selections and fixed points of set-valued operators in Banach spaces with some uniform convexity

A new continuity theorem of minimum selection is presented for a continuous set-valued operator from a topological space into a Banach space with some uniform convexity. As applications, some problems concerning minimum right inverses for linear operators and minimum fixed points for condensing set-valued nonlinear operators are discussed. Also, the existence of minimum solutions for an integral inclusion is proved.     

Minimum sum set coloring of trees and line graphs of trees

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.