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

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

粉末衍射峰形拟合程序包CPOWDER

开发了一个Ｘ射线和中子粉末衍射峰形拟合程序包ＣＰＯＷＤＥＲ,它是由多个最小二乘峰形拟合程序与蒙特卡罗分峰程序组成的。最小二乘峰形拟合程序可用于约束条件下的峰形拟合分析,蒙特卡罗分峰程序可用于寻找全局最优解,为最小二乘拟合程序提供优质的峰形参数初始值,两者结合使用特别适合于多个严重重叠峰的分离。     

STUDY ON THE SEQUENCE STRUCTURE OF SBR BY 13C—NMR METHOD Ⅰ. ASSIGNMENT FOR UNSATURAT CARBONS SPECTRA*

The sequence structures of emulsion-processed SBR and solution-processed (by lithium catalyst) SBR were investigated by ~(13)C-NMR spectroscopy. Seventeen peaks within unsaturated carbon region were recorded under the adopted experimental conditions. Assignments for these peaks were made by empirical-parameter-evaluation method.     

Identification of methylated regions with peak search based on Poisson model from massively parallel methylated DNA immunoprecipitation-sequencing data

DNA methylation is one of the most important epigenetic modification types, which plays a critical role in gene expression. High efficient surveying of whole genome DNA methylation has been aims of many researchers for long. Recently, the rapidly developed massively parallel DNA‐sequencing technologies open the floodgates to vast volumes of sequence data, enabling a paradigm shift in profiling the whole genome methylation. Here, we describe a strategy, combining methylated DNA immunoprecipitation sequencing with peak search to identify methylated regions on a whole‐genome scale. Massively parallel methylated DNA immunoprecipitation sequencing combined with methylation DNA immunoprecipitation was adopted to obtain methylated DNA sequence data from human leukemia cell line K562, and the methylated regions were identified by peak search based on Poison model. From our result, 140 958 non‐overlapping methylated regions have been identified in the whole genome. Also, the credibility of result has been proved by its strong correlation with bisulfite‐sequencing data (Pearson R²=0.92). It suggests that this method provides a reliable and high‐throughput strategy for whole genome methylation identification.     

考虑车辆随机停放的停车楼减震设计与可靠度分析

在停车楼的设计中通常将车辆荷载以活荷载的方式均匀分布到结构上,实际上受车辆随机停放的影响,停车楼结构整体质量中心偏移,一旦结构遭遇罕遇地震时,车辆的随机停放可能造成停车楼结构发生扭转破坏.本文在传统减震设计方法的基础上考虑车辆活荷载的随机性,并从可靠度的角度验算减震结构在大震作用下的倒塌概率.结果表明,相同的减震设计布...     

蒙药心舒安中锗的差分脉冲极谱研究

在pH=1.30的H2SO4和3,4-二羟基苯甲醛(DHB)底液中,采用差分脉冲极谱法,测得无机锗的脉冲极谱波.其峰电位为Ep=-0.53V.Ge(Ⅳ)浓度在1.03×10-3-1.04×10-4mol·L-1范围内与峰电流呈线性关系,样品中总锗和无机锗的回收率分别是95.72%和96.43%.     

Trees, parking functions, syzygies, and deformations of monomial ideals

For a graph , we construct two algebras whose dimensions are both equal to the number of spanning trees of . One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to -parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We show that the Hilbert series of a monotone monomial ideal is always bounded by the Hilbert series of its deformation. Then we define an even more general class of monomial ideals associated with posets and construct free resolutions for these ideals. In some cases these resolutions coincide with Scarf resolutions. We prove several formulas for Hilbert series of monotone monomial ideals and investigate when they are equal to Hilbert series of deformations. In the appendix we discuss the abelian sandpile model.

     

Expected Sums of General Parking Functions

A (u₁, u₂, . . . )-parking function of length n is a sequence (x₁, x₂, . . . , x_n) whose order statistics (the sequence (x₍₁₎, x₍₂₎, . . . , x_(n)) obtained by rearranging the original sequence in non-decreasing order) satisfy x_(i) u_(i). The Gonarov polynomials g _n (x; a₀, a ₁, . . . , a _n-1) are polynomials biorthogonal to the linear functionals (a _i) Dⁱ, where (a) is evaluation at a and D is differentiation. In this paper, we give explicit formulas for the first and second moments of sums of u-parking functions using Gonarov polynomials by solving a linear recursion based on a decomposition of the set of sequences of positive integers. We also give a combinatorial proof of one of the formulas for the expected sum. We specialize these formulas to the classical case when u _i=a+ (i-1)b and obtain, by transformations with Abel identities, different but equivalent formulas for expected sums. These formulas are used to verify the classical case of the conjecture that the expected sums are increasing functions of the gaps u_i+1 - u_i. Finally, we give analogues of our results for real-valued parking functions.AMS Subject Classification: 05A15, 05A19, 05A20, 05E35.     

Peak Points for Pseudoconvex Domains: A Survey

This paper surveys results concerning peak points for pseudoconvex domains. It includes results of Laszlo that have not been published elsewhere.