Finite dimensional approximation in infinite dimensional mathematical programming

We consider the problem of approximating an optimal solution to a separable, doubly infinite mathematical program (P) with lower staircase structure by solutions to the programs (P(N)) obtained by truncating after the firstN variables andN constraints of (P). Viewing the surplus vector variable associated with theNth constraint as a state, and assuming that all feasible states are eventually reachable from any feasible state, we show that the efficient set of all solutions optimal to all possible feasible surplus states for (P(N)) converges to the set of optimal solutions to (P). A tie-breaking algorithm which selects a nearest-point efficient solution for (P(N)) is shown (for convex programs) to converge to an optimal solution to (P). A stopping rule is provided for discovering a value ofN sufficiently large to guarantee any prespecified level of accuracy. The theory is illustrated by an application to production planning.The work of Robert L. Smith was partially supported by the National Science Foundation under Grant ECS-8700836.     

Massive and massless neutrinos on unbalanced seesaws

The observation of neutrino oscillations requires new physics beyond the standard model (SM).A SM-like gauge theory with p lepton families can be extended by introducing q heavy right-handed Majorana neutrinos but preserving its SU(2)L x U(1)y gauge symmetry.The overall neutrino mass matrix M turns out to be a symmetric (p+q) x (p+q) matrix.Given p＞q,the rank of M is in general equal to 2q,corresponding to 2q non-zero mass eigenvalues.The existence of (p-q) massless left-handed Majorana neutrinos is an exact consequence of the model,independent of the usual approximation made in deriving the Type-I seesaw relation between the effective p x p light Majorana neutrino mass matrix M,and the q x q heavy Majorana neutrino mass matrix MR.In other words,the numbers of massive left- and right-handed neutrinos are fairly matched.A good example to illustrate this "seesaw fair play rule"is the minimal seesaw model with p ＝ 3 and q ＝ 2,in which one masslese neutrino sits on the unbalanced seesaw.     

Cover Image

This paper presents a framework for incorporating arbitrary implicit multistep schemes into the lattice Boltzmann method. While the temporal discretization of the lattice Boltzmann equation is usually derived using a second-order trapezoidal rule, it appears natural to augment the time discretization by using multistep methods. The effect of incorporating multistep methods into the lattice Boltzmann method is studied in terms of accuracy and stability. Numerical tests for the third-order accurate Adams-Moulton method and the second-order backward differentiation formula show that the temporal order of the method can be increased when the stability properties of multistep methods are considered in accordance with the second Dahlquist barrier.     

Chebyshev spectral variational integrator and applications

The Chebyshev spectral variational integrator(CSVI) is presented in this paper. Spectral methods have aroused great interest in approximating numerically a smooth problem for their attractive geometric convergence rates. The geometric numerical methods are praised for their excellent long-time geometric structure-preserving properties.According to the generalized Galerkin framework, we combine two methods together to construct a variational integrator, which captures the merits of both methods. Since the interpolating points of the variational integrator are chosen as the Chebyshev points,the integration of Lagrangian can be approximated by the Clenshaw-Curtis quadrature rule, and the barycentric Lagrange interpolation is presented to substitute for the classic Lagrange interpolation in the approximation of configuration variables and the corresponding derivatives. The numerical float errors of the first-order spectral differentiation matrix can be alleviated by using a trigonometric identity especially when the number of Chebyshev points is large. Furthermore, the spectral variational integrator(SVI) constructed by the Gauss-Legendre quadrature rule and the multi-interval spectral method are carried out to compare with the CSVI, and the interesting kink phenomena for the Clenshaw-Curtis quadrature rule are discovered. The numerical results reveal that the CSVI has an advantage on the computing time over the whole progress and a higher accuracy than the SVI before the kink position. The effectiveness of the proposed method is demonstrated and verified perfectly through the numerical simulations for several classical mechanics examples and the orbital propagation for the planet systems and the Solar system.     

Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms

Previous research has resulted in a number of different algorithms for rule discovery. Two approaches discussed here, the ‘all-rules’ algorithm and multi-objective metaheuristics, both result in the production of a large number of partial classification rules, or ‘nuggets’, for describing different subsets of the records in the class of interest. This paper describes the application of a number of different clustering algorithms to these rules, in order to identify similar rules and to better understand the data.     

Pluriassociative algebras I: The pluriassociative operad

Diassociative algebras form a category of algebras recently introduced by Loday. A diassociative algebra is a vector space endowed with two associative binary operations satisfying some very natural relations. Any diassociative algebra is an algebra over the diassociative operad, and, among its most notable properties, this operad is the Koszul dual of the dendriform operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter γ of diassociative algebras, called γ-pluriassociative algebras, so that 1-pluriassociative algebras are diassociative algebras. Pluriassociative algebras are vector spaces endowed with 2γ associative binary operations satisfying some relations. We provide a complete study of the γ-pluriassociative operads, the underlying operads of the category of γ-pluriassociative algebras. We exhibit a realization of these operads, establish several presentations by generators and relations, compute their Hilbert series, show that they are Koszul, and construct the free objects in the corresponding categories. We also study several notions of units in γ-pluriassociative algebras and propose a general way to construct such algebras. This paper ends with the introduction of an analogous generalization of the triassociative operad of Loday and Ronco.     

Fuzzy rule generation methods for high-level computer vision

In many decision making systems involving multiple sources, the decisions made may be considered as the result of a rule-based system in which the decision rules are usually enumerated by experts or generated by a learning process. In this paper, we discuss the various issues involved in the generation of fuzzy rules automatically from training data for high-level computer vision. Features are treated as linguistic variables that appear in the antecedent clauses of the rules. We present methods to generate the corresponding linguistic labels (values) and their membership functions. Rules are generated by constructing a minimal approximate fuzzy aggregation network and then training the network using gradient descent methods. Several examples are given.     

Integral operators with Green's function type kernel

A variant of the Nyström method based on Simpson's rule is presented. This is designed to deal with integral operators with kernels k(s, t) that are not continuous along the diagonal s = t. A complete analysis is carried out, generalizations for other interpolatory quadrature rules are proposed; also a variant using Gaussian quadrature is considered and examples are given.     

钙钛矿型复合氧化物LaNi_(1-x)Mn_xO_3晶体结构与催化性能的关系

用XRD、IR和TPR等技术研究了钙钛矿型复合氧化物的晶体结构及其反应性能.整个组成范围内,LaNi_(i-x)Mn_xO_3(0.0≤x≤1.0)体系都生成单一钙钛矿相;x=0.0,0.6≤X≤1.0时为菱形晶系,0.2≤x≤0.5为立方晶系.IR和TPR研究表明,晶体结构对B—O键合作用存在较大影响.CO微反考察表明,本体系的催化活性与晶系存在密切关系,晶体对称性越高,反应活性越低.说明钙钛矿型复合氧化物的催化活性与体系活性中心的B—O键合作用能力有关.     

认知无线电中自适应切换频谱分配准则的算法

在认知无线网络空闲频谱分配的过程中,为了适应认知用户数和空闲频带数的动态变化,提高系统整体性能（主要指系统总带宽收益和认知用户接入公平性）,构造了最大化系统性能的目标函数,设计了在协作最大总带宽收益CMSB（collaborative max sum bandwidth）和协作最大比例公平性CMPF（collaborativemax proportional fair）2种频谱分配准则之间自适应切换的算法,并给出了其具体实施步骤。采用系统总带宽收益和认知用户接入公平性2种性能评估指标,分析了该算法的性能。仿真结果表明,自适应算法可以在保证系统总带宽收益的同时获得更好的公平性,可以提高系统的整体性能。