Some non-local problems for the parabolic-hyperbolic type equation with non-characteristic line of changing type

In this work two non-local problems for the parabolic-hyperbolic type equation with non-characteristic line of changing type are considered. Unique solvability of these problems is proven. The uniqueness of the solution is proven by the method of energy integrals and the existence is proven by the method of integral equations.     

Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法

主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集．在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点．同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果．     

On parabolic equations with a small parameter

A singularly perturbed parabolic equation with a nonlinear right-hand side of a special form is examined. A numerical analytical study of such equations is performed.     

涡旋柔性弹簧及组件性能实验研究

本文利用TSL系列弹簧刚度实验仪对用于斯特林制冷机中的单片柔性弹簧及柔性弹簧组件进行了实验研究。测试了四种不同尺寸弹簧刚度的动态特性,研究了单片弹簧的轴向刚度、径向刚度以及力矩特性,然后对柔性弹簧组件进行了实验研究,指出了不同组合方法下的刚度及弯矩特性,得到的数据可以作为斯特林制冷机设计的参考。     

Estimating the Scale Parameter of a Lévy-stable Distribution via the Extreme Value Approach

The characteristic exponent α of a Lévy-stable law S _α (σ, β, μ) was thoroughly studied as the extreme value index of a heavy tailed distribution. For 1 < α < 2, Peng (Statist. Probab. Lett. 52: 255–264, 2001) has proposed, via the extreme value approach, an asymptotically normal estimator for the location parameter μ. In this paper, we derive by the same approach, an estimator for the scale parameter σ and we discuss its limiting behavior.      

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

氢氟烃/烷烃二元混合物的气液相平衡

整理了已公开发表的氢氟烃(HFC)/烷烃(HC)二元混合物气液相平衡实验数据,对实验数据进行了热力学一致性检验。采用PR方程加van der Waals混合规则描述该类混合物的气液相平衡性质,优化得到了11种混合物的二元交互作用系数,经比较表明采用优化结果能够高精度再现气液相平衡实验数据,比k_(ij)取0的计算结果有很大改善.