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

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

Electron attenuation lengths in fullerene and fullerides

Using X-ray photoemission measurements, we have determined the attenuation length of C 1s photoelectrons in C₆₀ film to be 21.5 Å with the incident photon energy of Mg Kα radiation. The inelastic mean free path calculated with the TPP-2M algorithm coincides fairly well with the experimentally determined attenuation length, indicating the validity of the algorithm to fullerene and fullerides. The inelastic mean free paths for some fullerides, i.e. K₃C₆₀, K₆C₆₀, Ba₄C₆₀, Sm_2.75C₆₀ and Sm₆C₆₀ are calculated to help the quantitative analyses of the photoemission spectra for these compounds.     

Comment on “The Free Will Theorem”

In a recent paper Conway and Kochen, Found. Phys. 36, 2006, claim to have established that theories of the Ghirardi-Rimini-Weber (RW) type, i.e., of spontaneous wave function collapse, cannot be made relativistic. On the other hand, relativistic GRW-type theories have already been presented, in my recent paper, J. Stat. Phys. 125, 2006, and by Dowker and Henson, J. Stat. Phys. 115, 2004. Here, I elucidate why these are not excluded by the arguments of Conway and Kochen.      

等腰三角形Mindlin板的自由振动分析

提出了一种新方法来对基于 Mindlin剪切变形理论的等腰三角形板进行自由振动分析 .此方法采用了一种新的基函数并利用 pb-2 Rayleigh-Ritz边界函数得到了一种新型的 Ritz方法 .这种方法的有效性通过收敛性和对比性分析得到了证实 .数值结果表明此方法相当精确有效 .     

On the Modified Crystalline Stefan Problem with Singular Data

We study the behavior of solutions of the modified Stefan problem in the plane for polygonal interfaces. We are particularly interested in a solution near a singularity of either the loss of a facet or the breaking of a facet. We establish precise regularity results if a facet disappears. We use them to establish the existence of a weak solution with singular data, i.e., when some of the zero-crystalline-curvature facets have zero length.     

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.     

中物院远红外自由电子激光实验研究

中国工程物理研究院基于射频直线加速器技术的远红外自由电子激光(FIR-FEL)实验取得阶段性进展,于2005年3月24晚8时30分首次出光, 并多次重复. 中心波长115μm, 谱宽1%.介绍了实验系统的主要组成部分和主要实验结果.     

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