The mapping properties of the radiosity operator along an edge

In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd.     

前缘弯掠斜流转子叶顶间隙流动特性数值分析

本文对前缘弯掠斜流转子叶顶间隙内的流动特性进行了数值分析。结果表明:叶顶间隙气流与主流发生卷吸而生成泄漏涡。泄漏涡作用的区域具有较低的压力分布。在叶片通道内,泄漏涡沿着与转子旋向相反的方向朝相邻叶片的压力面移动。大间隙时的泄漏涡比小间隙时强烈。低流量时泄漏涡的作用区域比高流量时大。在各种流量特性下,叶顶尾缘近吸力面区域都存在着二次间隙流。     

HL-1M边缘等离子体静电湍流扰动

对HL－1M边缘等离子体静电湍流扰动进行了初步的实验研究。获得了扰动的基本特征量，估计了低杂波引起的径向粒子流的变化。在加低杂波（2．45GHz)前、后，电子密度扰动和极向电场扰动的幅度及其关联性变化不大。虽然低杂波部分抑制了静电湍流，但在数量上不能解释粒子约束改善的实验结果。     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

极紫外望远镜各通道夹角的测量

极紫外望远镜是由四个单通道的望远镜捆绑在一起,以便同时对太阳的相同部分观测,由于受地面装调以及发射过程中的影响,无法保证四个通道光轴严格平行,必然带来观测位置上的误差。只要测出各通道之间的光轴夹角,便可在像面上采取适当的处理方法,以便减小这种误差,但这一夹角的测量精度必须控制在0.1″内。为达到如此高的精度,采用了太阳局部边缘探测的方法,很好地解决了这一问题。     

Energy transfer between the flavin chromophores of electron-transferring flavoprotein fromMegasphaera elsdenii as inferred from time-resolved red-edge and blue-edge fluorescence spectroscopy

Both a mode-locked argon-ion laser and synchrotron radiation were used as excitation sources to obtain time-resolved polarized fluorescence of the two FAD cofactors in electron transferring flavoprotein fromMegasphaera elsdenii. Red-edge excited and blue-edge detected fluorescence anisotropy decay curves did not contain a fast relaxation process which was observed upon mainband excitation and detection. This relaxation was assigned to homo-energy transfer between the two FAD cofactors. Failure of energy transfer as observed with edge spectroscopy on this protein excludes restricted reorientational motion of the flavins as a possible mechanism of depolarization. From the global analysis of the fluorescence anisotropy decay surface obtained at multiple excitation and detection wavelengths, the distance between and the relative orientation of the flavins could be estimated. The methodology described has general applicability in other multichromophoric biopolymers and has the potential to acquire accurate geometrical parameters in these systems.     

单循环赛赛程安排的一个图论方法

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案     

Roughness reduction in submicron waveguides by low-molecular weight development

Roughness reduction of a submicron waveguide profile in chemically amplified negative resist is here performed by proper selection of an alkali-based developer, taking into account that its smaller molecules lead to smoother resist surface by altering the developing mechanism of aggregate extraction performed with standard quaternary ammonium hydroxide. Roughness is then analyzed by means of classical Atomic Force Microscope inspection; furthermore, a non-invasive line edge roughness analysis approach based on top-down scanning electron microscope acquisition gives comparable results, in terms of standard deviation and molecular aggregate periodicity.     

一类非线性方程解的存在和唯一性及在图像中的应用

本文我们给出一个修正的非线性扩散方程模型，与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分：卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题，因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性，同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型，并且给出几个具体图像在该模型下处理结果。     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003