Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

双向分束角对称的偏光分束镜设计与性能分析

为了获得分束角对称的偏光分束棱镜，在双Wollaston棱镜结构的基础上，通过合理设计棱镜左右两端晶体光轴的取向，使棱镜整体呈中心切面对称；在保证对正向入射的光对称分束的同时，对反向入射光同样可以对称分束，达到了双向对称分束的目的；在此基础上给出了晶体光轴的旋转角δ与棱镜结构角S以及与波长的关系；并分析了对633 nm设计的棱镜用于其他波长时分束角的对称性.结果表明：在±300 nm的光谱范围内，分束角的不对称度均小于0.24°.     

基于神经网络的三维宽场显微图像复原研究

提出一种利用BP神经网络进行三维宽场显微图像复原的非线性映射方法，将三维图像转化为二维图像进行处理，利用神经网络的学习能力，通过训练，建立含有散焦信息的二维模糊图像与二维清晰图像之间的映射关系，然后对切片堆叠进行逐幅复原，从而实现显微图像的三维复原.得到的复原图像在视觉上和定量分析上都获得了很好的效果.由于采用小规模神经网络，训练时间短，计算量小，使实时复原成为可能.     

为实现准等熵压缩的波阻抗梯度飞片的实验研究

采用粉末冶金方法,制备出波阻抗沿厚度方向呈特定分布的WMoTi体系梯度飞片,在二级轻气炮上进行了梯度飞片击靶实验的初步研究.结果表明,利用梯度飞片可以实现对靶样品的准等熵压缩,击靶后产生的波阵面是平缓、连续上升的,明显不同于冲击压缩的陡峭波阵面,靶面压力峰值最高达到了167GPa.波阻抗按二次函数分布的梯度飞片能够获得最佳的击靶波形 关键词： 波阻抗梯度飞片 准等熵压缩     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002