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

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

A New Approach to Source Conditions in Regularization with General Residual Term

This article addresses Tikhonov-like regularization methods with convex penalty functionals for solving nonlinear ill-posed operator equations formulated in Banach or, more general, topological spaces. We present an approach for proving convergence rates that combines advantages of approximate source conditions and variational inequalities. Precisely, our technique provides both a wide range of convergence rates and the capability to handle general and not necessarily convex residual terms as well as nonsmooth operators. Initially formulated for topological spaces, the approach is extensively discussed for Banach and Hilbert space situations, showing that it generalizes some well-known convergence rates results.     

A connection between linear normal modes and lines of curvature on the potential surface

For the N-degree-of-freedom of linear conservative vibratory systems, the corresponding potential functions can be viewed as N-hypersurfaces in (N + 1)-dimensional space. In this paper, a connection between the geometrical properties (principal curvatures, curvature lines) of potential surfaces and the vibratory characteristics (natural frequencies, linear modes) of the system is built. It is proved that the linear normal modes are exactly the projections of the lines of curvature on the potential surface onto the configuration space with metric m_ij (the mass-matrix); and that the squared natural frequencies are exactly the principal curvatures, at the origin of the configuration space, of the potential surface.     

S[a,b]类中边界Nevanlinna-Pick插值(Ⅱ)

继续作者最近的研究,用所谓的Hankel向量方法建立S[a,b]函数类中带边界插值数据的Nevanlinna-Pick插值问题与[a,b]上的某种带约束条件的Hausdorff矩量问题之间解集之间明确的一一对应关系.通过N[a,b]函数类与S[a,b]函数类之间的联系,从而由BNP(N[a,b])问题的可解性准则和解的参数化描述获得BNP(S[a,b)问题的可解性准则和解的参数化表示.     

具有避难所的非自治竞争系统的持续生存和全局稳定性

考虑一个四缀块模型，其中一缀块里有三个竞争种群，另外三个分别是它们的避难所，并且种群能在竞争缀块和各自的避难所间相互扩散．在一定的条件下，我们给出了此模型的持续生存，周期性和全局稳定性．     

Uncompensated magnetization in the layered molecular antiferromagnet {N(n-C5H11)4[MnFe(ox)3]}∞

Studies on the magnetic properties of the molecular antiferromagnetic material {N(n-C₅H₁₁)₄[Mn^IIFe^III(ox)₃]}_∞, carried out by various physical techniques (AC/DC magnetic susceptibility, magnetization, heat capacity measurements and Mössbauer spectroscopy) at low temperatures, have been presented. Different experimental observations complement each other and provide a clue for the observation of an uncompensated magnetization below the Néel temperature and short-range correlations persisting high above T_N. It is understood that the honeycomb layered structure of the compound contains non-equivalent magnetic sub-lattices, (Mn^II–ox–Fe^III_A–...) and (Mn^II–ox–Fe^III_B–...), where different responses of the Fe^III_A and Fe^III_B spin sites towards an external magnetic field might be responsible for the observation of the uncompensated magnetization in this compound at T < T_N. The present magnetic system is an S = 5/2 2-D Heisenberg antiferromagnet system with the intralayer exchange parameter J/k_B = −3.29 K. A very weak interlayer exchange interaction was anticipated from the spin wave modeling of the magnetic heat capacity for T < 0.5T_N. The positive sign of the coupling between the layers has been concluded from the Mössbauer spectrum in the applied magnetic field. Frustration in the magnetic interactions gives rise to the uncompensated magnetic moment in this compound at low temperatures.     

Four matroidal structures of covering and their relationships with rough sets

Covering is a common form of data representation, and covering-based rough sets serve as an efficient technique to process this type of data. However, many important problems such as covering reduction in covering-based rough sets are NP-hard so that most algorithms to solve them are greedy. Matroids provide well-established platforms for greedy algorithm foundation and implementation. Therefore, it is necessary to integrate covering-based rough set with matroid. In this paper, we propose four matroidal structures of coverings and establish their relationships with rough sets. First, four different viewpoints are presented to construct these four matroidal structures of coverings, including 1-rank matroids, bigraphs, upper approximation numbers and transversals. The respective advantages of these four matroidal structures to rough sets are explored. Second, the connections among these four matroidal structures are studied. It is interesting to find that they coincide with each other. Third, a converse view is provided to induce a covering by a matroid. We study the relationship between this induction and the one from a covering to a matroid. Finally, some important concepts of covering-based rough sets, such as approximation operators, are equivalently formulated by these matroidal structures. These interesting results demonstrate the potential to combine covering-based rough sets with matroids.     

对偶算法的进一步研究

The dual algorithm for minimax problems is further studied in this paper. The resulting theoretical analysis shows that the condition number of the corresponding Hessian of the smooth modified Lagrange function with changing parameter in the dual algorithm is proportional to the reciprocal of the parameter,which is very important for the efficiency of the dual algorithm. At last ,the numerical experiments are reported to validate the analysis results.     

Zeros of Dedekind zeta functions in the critical strip

In this paper, we describe a computation which established the GRH to height (resp. ) for cubic number fields (resp. quartic number fields) with small discriminant. We use a method due to E. Friedman for computing values of Dedekind zeta functions, we take care of accumulated roundoff error to obtain results which are mathematically rigorous, and we generalize Turing's criterion to prove that there is no zero off the critical line. We finally give results concerning the GRH for cubic and quartic fields, tables of low zeros for number fields of degree and , and statistics about the smallest zero of a number field.

     

PdH2、YH2分子的结构与势能函数

用密度泛函理论的B3LYP方法,对钯和钇原子采用SDD收缩价基函数,氢原子采用6-311＋＋G**全电子基函数,对PdH2和YH2体系的结构进行优化计算,得到PdH2分子最稳态为C2v构型,电子组态为1A1,平衡核间距RPdH=0.1692 nm,键角∠HPdH=29.4°,离解能De=5.5212 eV,基态简正振动频率:ν1(b2)=1470.1 cm－1、ν2(a1)=1007.9 cm－1、ν3(a1)=2907.0 cm－1.YH2分子最稳态也为C2v构型,电子组态2A1,RYH=0.1962 nm,∠HYH=114.3°,De=5.6691 eV,基态简正振动频率:ν1(b2)=1457.9 cm－1、ν2(a1)=476.0 cm－1、ν3(a1)=1506.3 cm－1.由微观过程的可逆性原理分析了分子的可能离解极限.并用多体项展式理论方法分别导出基态PdH2和YH2分子的势能函数,其等值势能面图准确地再现了PdH2和YH2分子的结构特征和离解能,由此讨论了Pd ＋ H2和Y ＋ H2分子反应的势能面静态特征.