Dual-channel phase-shifting interferometry for microscopy with second wavelength assistance

Dual-channel phase-shifting interferometry for simultaneous phase microscopy is presented. Red and blue light beams are used for microscope illumination. A 45 tilted beamsplitter replicates the object and reference waves in red light together with the object wave in blue light into two parallel beams. The two resulting quadrature phase-shifting interferograms in red light and the object waves in blue light are generated in the two channels. The two interferograms are recorded simultaneously by a color charge-coupled device (CCD) camera, and can be separated via RGB components of the recorded color patterns without crosstalk. As a result, the phase of tested specimen can be retrieved. The feasibility of the proposed method is demonstrated by test performed on a microscopic specimen.     

三维显示中基于彩色叠栅条纹的视差障栅参数设计

为确定三维显示中视差障栅(PB)的最优参数,提出一种基于彩色叠栅条纹的PB参数设计方法。液晶显示器(LCD)和PB简化为相应参数的黑白光栅模型,而具有特定参数的特定辐射光栅作为周期和倾角变化的PB模型,通过序数方程和傅里叶分析方法分析特定辐射光栅和LCD单色等效黑白光栅的叠加图样,由此推断出不同PB周期的低频主导条纹频率组项,然后利用傅里叶理论的部分和提取方法(PSE)分析不同PB周期的低频主导叠栅条纹的强度轮廓,得出PB的最佳节距和相应倾斜角度。实验结果表明,所设计的PB三维显示系统没有出现降低像质的叠栅条纹,具有较好的三维显示效果。     

基于裸光纤探头的双点光子多普勒测速系统

全光纤光子多普勒速度测量(PDV)系统是一种新型的激光测速系统,可广泛用于冲击波、爆轰波以及其他短时高速运动物体的速度测量。多点测量可以获得靶面不同位置的速度,以测量靶面的形变。为提高测量的空间分辨率,提出使用裸光纤束为PDV系统的探头,并在实验上实现了空间分辨率为375μm的双点速度测量。裸光纤探头的间距较小,一个探头的测量结果可能受到另一个探头反射光的干扰。理论和实验的研究结果表明,当靶面各点速度相同时,测量结果不受干扰光的影响;当各点速度不同时,其测速误差不但与两被测点的速度差有关,还与传感光和干扰光的光强和相位有关。     

马尔可夫方程

1879年,一个23岁的年轻人在圣彼得堡大学提交了以"论行列式为正的二元二次型"为标题的硕士论文.这篇论文主要讨论数论的某些困难问题,并且为数论这个分支开创了一个新的方向.这个年轻人的名字叫安德雷·安德耶维齐·马尔可夫(Andrei Andreevich Markov,1856-1922).马尔可夫的论文基于他的先前的两篇文章,这两篇文章分别于1879,1880年刊登在世界上最权威的数学期刊之一——德国《数学年刊》上.     

浅析面积等分线的作法

"等底等高的三角形面积相等",这个性质在作图形面积等分线时很有用,比如:三角形的中线把三角形分成等底等高的两个三角形,分得的两三角形面积相等,这条线就是三角形面积等分线.如图1,D为BC中点,AD就为△ABC的一条面积等分线.应用一、过三角形一边上任一点作三角形的面积等分线     

Ore度和条件下赋权triangle-free图中的重圈(英文)

设G是一个2-连通赋权图,且G中每一对不相邻顶点u和v都满足d~w(u)+d~w(v)≥2d.Bondy等人证明了G或者包含一个哈密尔顿圈,或者包含一个权至少为2d的圈.如果G不是哈密尔顿图,这个结论意味着G中包含一个权至少为2d的圈.但是当G是哈密尔顿图时,我们不能判断G是否包含一个权至少为2d的圈.这篇文章中,在Fujisawa的一篇文章的启发下,我们证明了当G是triangle-free图并且|V(G)|是奇数时,G中一定包含一个权至少为2d的圈,即使G是哈密尔顿图.     

(*)-serial Incidence代数(英文)

设K是一个代数闭域,A是域K上一个有限维代数.我们利用箭图方法给出了(*)-serial incidence代数的分类.     

Wm∨Pn的交叉数

在Klesc M给出的联图W_3 V P_n的交叉数的基础上,继续对联图Wm V Pn（m=4,5）的交叉数cr进行了研究,得到了cr（W3 V Pn）=Z（5,n）＋n＋「n/2＋1」以及cr（W5 V Pn）=Z（6,n）＋n＋3[n/2」＋1,n≥2.     

(0, mf-k+1)-图中具有正交(0,f)-因子分解的子图

设G是一个简单图, f是定义在V(G)上的整数值函数,且m是大于等于2的整数. 讨论(0, mf-k+1)-图G的正交因子分解, 并且证明了对任意的1≤k≤m, (0, mf-k+1)-图G中存在着一个子图R, 使得R有一个(0,f)-因子分解正交于图G中的任意一个k-子图H.     

Unique factorization of compositive hereditary graph properties

A graph property is any class of graphs that is closed under isomorphisms. A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs G1, G2 ∈ P there exists a graph G ∈ P containing both G1 and G2 as subgraphs. Let H be any given graph on vertices v1, . . . , vn, n ≥ 2. A graph property P is H-factorizable over the class of graph properties P if there exist P 1 , . . . , P n ∈ P such that P consists of all graphs whose vertex sets can be partitioned into n parts, possibly empty, satisfying: 1. for each i, the graph induced by the i-th non-empty partition part is in P i , and 2. for each i and j with i = j, there is no edge between the i-th and j-th parts if vi and vj are non-adjacent vertices in H. If a graph property P is H-factorizable over P and we know the graph properties P 1 , . . . , P n , then we write P = H [ P 1 , . . . , P n ]. In such a case, the presentation H[ P 1 , . . . , P n ] is called a factorization of P over P. This concept generalizes graph homomorphisms and (P 1 , . . . , P n )-colorings. In this paper, we investigate all H-factorizations of a graph property P over the class of all hered- itary compositive graph properties for finite graphs H. It is shown that in many cases there is exactly one such factorization.