磷酸钙催化剂上二异丁基乙缩醛裂解法合成乙烯基异丁醚的研究

研究了在磷酸钙催化剂上二异丁基乙缩醛裂解制乙烯基异丁醚反应的活性和选择性，其中较好的催化剂是在500度焙烧的Ca3(PO4)2(1)。考察了工艺条件对反应结果的影响，表明在反应温度约300度，缩醛的LHSV＝1．0h^-1时得到最佳反应结果：转化率约98．6％，选择性接近100％，用TPD法测定了催化剂表面的酸度和碱度，并与活性和选择性进行了关联。     

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].     

基于小波压缩的二值图像图视密码学的改进

图视密码学方案最初由Naor和Shamir在 1994年欧洲密码学会议上提出 ,但像素扩展太大 ,生成分存图像太大。采用小波变换对分存图像进行压缩 ,有效地降低了分存图像规模。     

基于小波变换的运动汽车阴影分割

利用在阴影区域内的点所接受环境光强与汽车的相对位置关系，结合多分辨率小波分析，提出了一种新的基于小波变换的运动汽车阴影分割方法．该方法不需要知道光源的方向，也不需要车体的彩色信息；对背景的纹理也没有要求，适用于复杂纹理背景下任何颜色的汽车阴影分割．实验表明，该方法定位准确、速度快、抗噪能力强．     

正交小波包的构造

本文给出尺度因子ａ＝４时正交小波包的构造，推广了［２，４］引入的正交小波包，并给出相应的分解与再构造算法．本文引入的正交小波包具有保持信号ｆ∈Ｌ^２的线性相位，也讨论了尺度因子ａ＝ｋ（ｋ∈Ｚ，ｋ≥２）正交小波的构造     

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.     

一种新的$1/f$过程小波模型

给出了一种新的二进小波1/f过程模型,从理论上证明了一类谱指数为H的近似1/f过程可通过一簇平稳随机过程产生.由于所提方法利用了1/f过程小波系数的相关性,因而有效地减少了合成1/f过程的谱误差.数值实验结果表明,新模型很好地改进了已有模型.     

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的一种新的表示式,给出了具体的算法步骤,并且在文末给出了算例.