解析函数的p叶性条件

本文指出 Ｍ．Ｊａｈａｎｇｉｒｉ的评论［Ｍａｔｈｅｍａｔｉｃａｌ Ｒｅｖｉｅｗｓ　９８ｅ：３００２０］错误，并且导出解析函数ｐ叶星形性与ｐ叶凸性的某些充分条件．     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

The measurement of subcritical electroconvection

Under idealized conditions, electroconvection in a nematic liquid crystal sets in at a well-defined threshold of the driving ac voltage. Fluctuating convection rolls of a small amplitude below that threshold have been observed recently. The measurement of the amplitude of these fluctuations is described in detail in this paper. It is based on averaging the light intensity signals using the structure function and a quantitative analysis of the light deflection.     

改善光纤倒像器的对比度传递特性

光纤倒像器是一种特殊类型的光纤板，可将传递图像直接倒转180°并应用于像增强器。由于光纤倒像器的特殊结构，造成光纤随着距扭转轴心的距离增加，数值孔径和光通量逐渐下降。相对于光纤板，光纤倒像器在透过率和对比度传递特性上均有一定程度的下降。通过改进玻璃系统，在一定程度上降低芯皮玻璃间离子扩散和相互渗透的程度，可提高光纤倒像器的实际数值孔径；通过调节EMA吸收量，既能满足像增强器对光纤倒像器荧光屏透过率的要求，又能保证最大程度地吸收光纤中逸出的杂散光，提高对比度。选择合理的芯皮比，不仅可弥补因扭转拉伸造成的皮层厚度减薄，还可进一步增加皮层厚度，抑制光从光纤中逸出。通过以上改进，可改善光纤倒像器的对比度传递特性。     

基于平均和峰值灰度加权的自动调光系统

介绍了在CCD高速电视测量仪系统中，利用电子快门和可变光阑有机结合，在运动控制卡控制下实现自动调光，扩大了调光的动态范围.采用了平均灰度和峰值灰度加权的办法来获取反馈信号，有效的解决不同背景下自调光系统的适应性.提出了基于二次函数的调光反馈量计算方法，提高了调光过程中的收敛速度，同时也保证了系统有较小的超调量.     

动态激光衍射法测量细丝直径

基于夫琅禾费衍射理论和巴比涅互补原理,提出了利用激光衍射对细丝直径进行动态测量的方法.该方法具有测量精度高、速度快、非接触、使用方便且易于微机联接实现自动化测量等优点.     

一类相空间中的准几率分布函数系

定义了一类相空间中的准几率分布函数系，这个准几率分布函数系直接建立在具有更加广泛意义的量子相空间Schr?dinger方程解的基础之上，其中定义_α=αp-i?q和_α=(1-α)q+i?p.发现了两个有趣的关系.(1)建立的量子相空间Schr?dinger方程的解实际上是对函数φ(λ)exp［i(1-α)qp］做窗口Fourier变换.(2)这个窗口函数g(λ)起着选择窗口形式的作用，而且不同的窗口对应着不同的分布函数.当g(λ)是一个代表Gauss窗的Gauss函数的时候，准几率分布函数就是一个类似于Husimi的分布函数f^HL_α(q,p)；当g(λ)是一个表示椭圆的复函数时，准几率分布函数就是一个椭圆分布函数f^E_α(q,p)；再在g(λ)为复函数的基础上附加α=0，就可得到标准序分布函数f^S(q,p)、反标准序分布函数f^AS(q,p)和Wigner分布函数f^W(q,p)，此时g(λ)表示高度为1/12π?而长度为λ的矩形窗. 关键词： 窗口Fourier变换 相空间 Wigner分布函数     

光学低通滤波器的光学传递函数分析

光电成像系统的抽样过程会引起图像频谱在频谱空间上的多次复制,如果抽样过程不满足系统的奈奎斯特条件,相邻的频谱项就会产生混叠.光学传递函数可以反映系统中光学成像,抽样和重建等各个过程对图像信号频谱的响应.通过对使用光学低通滤波器(OLPF)光电成像系统的光学传递函数的分析,表明光学低通滤波器可以有效地限制图像的频谱宽度,使抽样满足奈奎斯特条件,达到消除频谱混叠,改善重建图像质量的目的.     

ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES

ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.