Domain decomposition for an asymptotic geological fault modeling

We present in this paper a domain decomposition method to treat faults in geological basin modeling. The particularity of this model is that the faults whose widths are very small in comparison with the basin size, are not characterized as subdomains any more but as interfaces between sedimentary blocks. The originality of this work lies in the formulation of this new fault model and in the definition and the computation of the interface conditions between the subdomains. To cite this article: E. Flauraud et al., C. R. Mecanique 331 (2003).     

Local polynomial fitting under association

We consider the estimation of multivariate regression functions r(x₁,…,x_d) and their partial derivatives up to a total order p1 using high-order local polynomial fitting. The processes {Y_i,X_i} are assumed to be (jointly) associated. Joint asymptotic normality is established for the estimates of the regression function r and all its partial derivatives up to the total order p. Expressions for the bias and variance/covariance matrix (of the asymptotic distribution) are given.     

A note on conservation laws for a multiclass service queueing system with setup times

This paper derives a conservation law for mean waiting times in a single-server multi-class service queueing system (M ^X/G/1 type queue) with setup times which may be dependent on multiple customer classes and its arrival batch size by using the work decomposition property in the queueing system with vacations.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].     

Improved customer choice predictions using ensemble methods

In this paper various ensemble learning methods from machine learning and statistics are considered and applied to the customer choice modeling problem. The application of ensemble learning usually improves the prediction quality of flexible models like decision trees and thus leads to improved predictions. We give experimental results for two real-life marketing datasets using decision trees, ensemble versions of decision trees and the logistic regression model, which is a standard approach for this problem. The ensemble models are found to improve upon individual decision trees and outperform logistic regression.     

On the successive supersymmetric rank‐1 decomposition of higher‐order supersymmetric tensors

In this paper, a successive supersymmetric rank‐1 decomposition of a real higher‐order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank‐1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd.     

带W权Drazin逆的一种新算法

利用矩阵A的带W权Drazin逆的一个性质特征,对任意的矩阵A∈Cm×n,W∈Cn×m,建立了带W权的Drazin逆Ad,w的一种新的表示式,给出了具体的算法步骤,并且在文末给出了算例.     

热等离子体裂解天然气制备C2烃

采用氮气热等离子体来裂解天然气制备乙炔乙烯,着重研究了天然气转化率和乙炔、乙烯收率随氮气流量和天然气流量的变化.结果表明,天然气流量与氮气流量之比为11时,可得到较好的结果.当等离子体功率为15kW、天然气流量为3Nm3*h-1、氮气流量为3Nm3*h-1时得到最好的结果.这时天然气转化率为57%,乙炔、乙烯的收率分别为34%和9%;乙炔在反应气中的体积浓度为7.5%,与部分氧化法相似;扣除不参加反应的氮气,乙炔在气相产品中的体积浓度为13.2%,与热力学平衡计算结果基本符合.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.