光学非球面二次曲面常数及顶点曲率的研究

受光学非球面制造过程中诸工艺参数的影响,能否保证非球面顶点曲率及二次曲面常数的精度是一个重要问题。基于二次曲面方程,推导出确定光学非球面二次曲面常数k以及顶点曲率半径r的一组算法,并在对一块口径为760mm×200mm标准非球面反射镜的实际测算中进行拟合,经过优化,拟合精度达到Δk=0.015,Δr=0.341mm,从而有效的控制了光学非球面制造过程中的顶点曲率及二次曲面常数的偏差。     

爆磁压缩发生器通过脉冲变压器对脉冲形成线充电的理论分析

 将爆磁压缩等效为电流源的方法，对爆磁压缩发生器通过脉冲变压器对脉冲形成线充电进行了理论分析，得出爆磁压缩发生器在负载上产生电流波形（简称负载电流）为直线情况和任意电流波形情况下充电电流和充电电压的表达式。分析表明变压器耦合互感与负载电流随时间变化增长率是脉冲形成线充电的两个重要参数，脉冲形成线第一个充电电压峰值与变压器的耦合互感和负载电流波形斜率成正比，负载电流波形斜率的变化可以改变充电电压峰值的时间，斜率不断增加可以延长第一个充电电压峰值时间，从而可能增加充电电压的幅值，提高爆磁压缩发生器能量的利用效率。     

PURIFICATION OF L-METHIONINE AND N-ACETYL-D-METHIONINE FROM THE MIXTURE OF ENZYMATICALLY DEACYLATED N-ACETYL-DL-METHIONINE

1. INTRODUCTION Methionine, namely 2-amido-4-thiomethyl butyric acid with a structure of CH3SCH2CH2CHCOOH, is one of the essential amino acids and has two natural enantionmers, D and L-methionine. The mixture of L- and D-isomers can be used as analeptics or nutritive additives to maintain the equilibrium of amino acids of feed [1,2]. L-methionine can release active methyl and accelerate the synthesis of choline, which further speeds up the conversion of the lipid accumulated in liv…     

The Isoelectric Point and the Points of Zero Charge of Fe-Al-Mg Hydrotalcite-like Compounds

The relation of the isoelectric point (IEP) and the point of zero net charge (PZNC) of the hydrotalcite-like compounds was discussed. It was found that the IEP does not equal to the PZNC and the IEP is higher than the PZNC. The structural positive charges existing in the HTlc,which cause the difference between the IEP and the PZNC. The effects of the structural positive charges of the HTlc on its IEP and PZNC are the same as the specific adsorption of metal cations.     

Dynamic Strategic Pricing and Speed of Diffusion

Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices.     

The canonical solution operator of $ {\bar \partial } $ on weighted spaces with holomorphic coefficients

On weighted spaces with strictly plurisubharmonic weightfunctions the canonical solution operator of and the ‐Neumann operator are bounded. In this paper we find a class of strictly plurisubharmonic weightfunctions with certain growth conditions, so that they are Hilbert‐Schmidt operators between weighted spaces with different weightfunctions, if they are restricted to forms with holomorphic coefficients. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.