超曲面的共形数量不变量

对给定的共形流形及其中的超曲面,本文用Fefferman和Graham的辅助时空及其中齐次关联超曲面,引进了由齐次关联超曲面在辅助时空中的伪Riemann数量不变量诱导的原超曲面的共形数量不变量,提供了一套构建更多超曲面的共形数量不变量的计算方法,为寻找像Willmore方程一样关于超曲面的共形不变偏微分方程创造了路径.     

R1^m+1中拟迷向类空超曲面

设f:M^m→R1^m+1是无脐点类空超曲面,则在Mm上可以定义四个基本的共形不变量:共形度量g,共形1-形式C,共形第二基本形式B,共形Blaschke张量A.如果存在光滑函数λ和常数μ,使得A+μB=Ag,则称M^m是拟迷向类空超曲面.本文不仅构造了拟迷向类空超曲面的例子,同时在相差R1^m+1的一个共形变换下,本文还完全分类了拟迷向类空超曲面.     

曲面上一种等距不变量的构造

提出一种基于曲面内蕴度量的等距变换不变量构造方法.通过不变几何基元构造不变核,再对不变核进行多重积分,得到曲面上的等距不变量.这种不变量完全基于曲面的内在属性,有直观的几何解释,并且不受数量约束.实验表明,它对于描述曲面的等距变换,如不同表情的同一人脸、不同姿态的同一人体运动等具有潜在应用意义.     

分形曲面的构造算法研究

以分形理论为依据 ,根据分形几何描绘自然界景物的基本思想 ,结合解析几何中旋转曲面的构造 ,把已生成的二维平面分形曲线绕着同一平面上的直线旋转 ,获得一类三维旋转曲面的构造算法 ,给出了相应的三维迭代函数系统和三维仿射变换矩阵 ,并进行了深入的理论分析 .本文的研究为分形曲面的构造探求了一种简易算法 ,并为分形曲面的生成和实践应用提供了理论依据 .     

Sn+1中具有调和M(o)bius曲率张量的超曲面

设x:Mn→Sn 1是(n 1)维单位球面Sn 1中的无脐点的超曲面.Sn 1中超曲面x有两个基本的共形不变量:M(o)bius度量g和M(o)bius第二基本形式B.当超曲面维数大于3时,在相差一个M(o)bius变换下这两个不变量完全决定了超曲面.另外M(o)bius形式Ф也是一个重要的不变量,在一些分类定理中Ф=0条件的假定是必要的.本文考虑了Sn 1(n≥3)中具有消失M(o)bius形式Ф的超曲面:对具有调和曲率张量的超曲面进行分类,进而,在M(o)bius度量的意义下,对Einstein超曲面和具有常截面曲率的超曲面也进行了分类.     

完备λ-超曲面的几何

本文是一篇有关λ-超曲面的综述性文章,讨论了λ-超曲面的构造、稳定性和λ-超曲面的分类以及面积增长.     

Lasso变量选择的分布式算法

Lasso是机器学习中比较常用的一种变量选择方法,适用于具有稀疏性的回归问题.当样本量巨大或者海量的数据存储在不同的机器上时,分布式计算是减少计算时间提高效率的重要方式之一.本文在给出Lasso模型等价优化模型的基础上,将ADMM算法应用到此优化变量可分离的模型中,构造了一种适用于Lasso变量选择的分布式算法,证明了...     

空间形式中具有三个不同主曲率的极小Willmore超曲面

本文研究了空间形式中关于Willmore超曲面.从2-型旋转超曲面出发,通过计算2-型旋转超曲面的第一基本形式和第二基本形式,运用活动标架的方法,获得了超曲面是极小Willmore超曲面的等价条件,构造了空间形式中一类具有三个不同主曲率的极小Willmore旋转超曲面的新的例子.     

四维时空中两个不同主曲率类时共形齐性超曲面的分类

如果对任意两点p,q∈M_1~3,都存在R_1~4中的一个共形变换σ,使得σ(x(p))=x(q),并且σ(x(M_1~3)=x(M_1~3),则称x(M_1~3)为共形齐性超曲面.在本文中我们主要研究类时共形齐性超曲面x:M_1~3→R_1~4,并假设其形状算子可对角化且有两个不同主曲率.首先通过定义共形不变度量g_c,典则提升Y,共形切标架{E_i}和典则法标架ζ,我们给出了这类超曲面的一个完备共形不变量系统{E_1,E_2,E_3}.接下来通过可积条件,我们构造出了一系列非杜邦超曲面的例子以及对应的共形变换子群,并完成了对这类超曲面的分类.     

空间形式中具有两个线性相关平均曲率函数的超曲面

在空间形式中, 我们构造了一类泛函, 其临界点包括极小与r 极小超曲面. 给出了临界超曲面的代数、微分和变分刻画. 我们证明了Simons 类不存在定理: 在单位球面中不存在稳定的临界超曲面. 同时证明了Alexandrov 类存在性定理: 在欧氏空间中球面是唯一的稳定的临界超曲面.     

Model reduction and optimization of a reactive dividing wall batch distillation column inspired by response surface methodology and differential evolution

Carrying out reaction and separation simultaneously in a reactive dividing wall batch distillation column batch RDWC in the case of ethyl acetate synthesis provides the possibility of separating both products and increasing the equilibrium reaction conversion. Overcoming the known azeotrope conditions, high purity for ethyl acetate and decreasing the batch time compared to simple reactive batch distillation are the advantages of this configuration. The corresponding dynamic simulation is carried out by simultaneously solving the model-associated system of differential and algebraic equations. In this study, the optimal values of the vapour and liquid split ratios are considered as the decision variables in order to maximize the amount of ethyl acetate accumulated during batch time. The optimization strategy is implemented inspired by response surface methodology in which an optimal surface is fitted to the collected data set using differential evolution (DE). The optimal surface relevant algebraic equation is then considered as the reduced form of the complex model and the optimal values are obtained using the DE method.     

A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex

In this paper, we investigate the production order scheduling problem derived from the production of steel sheets in Shanghai Baoshan Iron and Steel Complex (Baosteel). A deterministic mixed integer programming (MIP) model for scheduling production orders on some critical and bottleneck operations in Baosteel is presented in which practical technological constraints have been considered. The objective is to determine the starting and ending times of production orders on corresponding operations under capacity constraints for minimizing the sum of weighted completion times of all orders. Due to large numbers of variables and constraints in the model, a decomposition solution methodology based on a synergistic combination of Lagrangian relaxation, linear programming and heuristics is developed. Unlike the commonly used method of relaxing capacity constraints, this methodology alternatively relaxes constraints coupling integer variables with continuous variables which are introduced to the objective function by Lagrangian multipliers. The Lagrangian relaxed problem can be decomposed into two sub-problems by separating continuous variables from integer ones. The sub-problem that relates to continuous variables is a linear programming problem which can be solved using standard software package OSL, while the other sub-problem is an integer programming problem which can be solved optimally by further decomposition. The subgradient optimization method is used to update Lagrangian multipliers. A production order scheduling simulation system for Baosteel is developed by embedding the above Lagrangian heuristics. Computational results for problems with up to 100 orders show that the proposed Lagrangian relaxation method is stable and can find good solutions within a reasonable time.     

Adaptive reliability analysis based on a support vector machine and its application to rock engineering

The response surface method (RSM), a simple and effective approximation technique, is widely used for reliability analysis in civil engineering. However, the traditional RSM needs a considerable number of samples and is computationally intensive and time-consuming for practical engineering problems with many variables. To overcome these problems, this study proposes a new approach that samples experimental points based on the difference between the last two trial design points. This new method constructs the response surface using a support vector machine (SVM); the SVM can build complex, nonlinear relations between random variables and approximate the performance function using fewer experimental points. This approach can reduce the number of experimental points and improve the efficiency and accuracy of reliability analysis. The advantages of the proposed method were verified using four examples involving random variables with different distributions and correlation structures. The results show that this approach can obtain the design point and reliability index with fewer experimental points and better accuracy. The proposed method was also employed to assess the reliability of a numerically modeled tunnel. The results indicate that this new method is applicable to practical, complex engineering problems such as rock engineering problems.     

Generation of efficient frontiers in multi-objective optimization problems by generalized data envelopment analysis

In many practical problems such as engineering design problems, criteria functions cannot be given explicitly in terms of design variables. Under this circumstance, values of criteria functions for given values of design variables are usually obtained by some analyses such as structural analysis, thermodynamical analysis or fluid mechanical analysis. These analyses require considerably much computation time. Therefore, it is not unrealistic to apply existing interactive optimization methods to those problems. On the other hand, there have been many trials using genetic algorithms (GA) for generating efficient frontiers in multi-objective optimization problems. This approach is effective in problems with two or three objective functions. However, these methods cannot usually provide a good approximation to the exact efficient frontiers within a small number of generations in spite of our time limitation. The present paper proposes a method combining generalized data envelopment analysis (GDEA) and GA for generating efficient frontiers in multi-objective optimization problems. GDEA removes dominated design alternatives faster than methods based on only GA. The proposed method can yield desirable efficient frontiers even in non-convex problems as well as convex problems. The effectiveness of the proposed method will be shown through several numerical examples.     

Reduction of overestimation in interval arithmetic simulation of biological wastewater treatment processes

A novel interval arithmetic simulation approach is introduced in order to evaluate the performance of biological wastewater treatment processes. Such processes are typically modeled as dynamical systems where the reaction kinetics appears as additive nonlinearity in state. In the calculation of guaranteed bounds of state variables uncertain parameters and uncertain initial conditions are considered. The recursive evaluation of such systems of nonlinear state equations yields overestimation of the state variables that is accumulating over the simulation time. To cope with this wrapping effect, innovative splitting and merging criteria based on a recursive uncertain linear transformation of the state variables are discussed. Additionally, re-approximation strategies for regions in the state space calculated by interval arithmetic techniques using disjoint subintervals improve the simulation quality significantly if these regions are described by several overlapping subintervals. This simulation approach is used to find a practical compromise between computational effort and simulation quality. It is pointed out how these splitting and merging algorithms can be combined with other methods that aim at the reduction of overestimation by applying consistency techniques. Simulation results are presented for a simplified reduced-order model of the reduction of organic matter in the activated sludge process of biological wastewater treatment.     

Calculation of Stresses and Consistent Tangent Moduli from Automatic Differentiation of Hyerelastic Strain Energy Functions Through the Use of Hyper Dual Numbers

Many materials as e.g. engineering rubbers, polymers and soft biological tissues are often described by hyperelastic strain energy functions. For their finite element implementation the stresses and consistent tangent moduli are required and obtained mainly in terms of the first and second derivative of the strain energy function. Depending on its mathematical complexity in particular for anisotropic media the analytic derivatives may be expensive to be calculated or implemented. Then numerical approaches may be a useful alternative reducing the development time. Often-used classical finite difference schemes are however quite sensitive with respect to perturbation values and they result in a poor accuracy. The complex-step derivative approximation does never suffer from round-off errors, cf. [1], [2], but it can only provide first derivatives. A method which also provides higher order derivatives is based on hyper dual numbers [3]. This method is independent on the choice of perturbation values and does thus neither suffer from round-off errors nor from approximation errors. Therefore, here we make use of hyper dual numbers and propose a numerical scheme for the calculation of stresses and tangent moduli which are almost identical to the analytic ones. Its uncomplicated implementation and accuracy is illustrated by some representative numerical examples. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The asymptotic laws of shockless strong compression of quasi-one-dimensional gas layers

The solutions of initial-boundary-value problems describing the shockless compression of cylindrically and spherically symmetric layers on an ideal polytropic gas to infinite density are investigated. Attention is also devoted to the quasi-one-dimensional case, when the surface on which the compression takes place is in one-to-one correspondence with the sonic characteristic surface separating the initial background flow and the compression wave. The solutions are expanded in convergent power series in a space of special dependent and independent variables, both in the neighbourhood of the final time. Asymptotic laws of shockless strong compression are found, and it is proved that they are described by curves in the convergence domains of the series. The additional external energy resources required for the transition from the compression of plane layers to that of quasi-one-dimensional layers are shown to be finite, provided that the polytropy index of the gas is not greater than three.     

The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

The transportation problem with exclusionary side constraints, a practical distribution and logistics problem, is formulated as a 0–1 mixed integer programming model. Two branch-and-bound (B&B) algorithms are developed and implemented in this study to solve this problem. Both algorithms use the Driebeek penalties to strengthen the lower bounds so as to fathom some of the subproblems, to peg variables, and to guide the selection of separation variables. One algorithm also strongly exploits the problem structure in selecting separation variables in order to find feasible solutions sooner. To take advantage of the underlying network structure of the problem, the algorithms employ the primal network simplex method to solve network relaxations of the problem. A computational experiment was conducted to test the performance of the algorithms and to characterize the problem difficulty. The commercial mixed integer programming software CPLEX and an existing special purpose algorithm specifically designed for this problem were used as benchmarks to measure the performance of the algorithms. Computational results show that the new algorithms completely dominate the existing special purpose algorithm and run from two to three orders of magnitude faster than CPLEX.     

Approximate open boundary conditions for a class of hyperbolic equations

Initial-boundary value problems formulated in spatially unbounded domains can be sometimes reduced to problems in their bounded subdomains by using the so-called open boundary conditions. These conditions are set on the surface separating the subdomain from the rest of the domain. One of the approaches to obtaining such a kind of conditions is based on an approximation of the kernels of the time convolution operators in the relations connecting the exact solution of the original problem and its derivatives on the open boundary. In this case, it is possible to considerably reduce the requirements for system resources required to solve numerically for a wide range of physical and engineering problems. Estimates of the perturbations of the exact solution due to the approximate conditions are obtained for a model problem with one space variable.     

炉液倾动重心近似计算的数学分析

为给转炉设计提供依据,需要计算炉液倾动的重心.利用数学方法将实际问题进行简化,通过分析炉液倾动过程中变量间的相互关系,来确定每个倾动角度对应情况下的液面位置.利用数学中三重积分的有关应用,进一步得出转炉在每个倾动角度为α∈(0,π2)时的重心计算方法及相关结论,在理论上为工程计算重心的方法提供参考.