Numerical analysis for stochastic age-dependent population equations with Poisson jumps

In this paper, stochastic age-dependent population equations with Poisson jumps are considered. In general, most of stochastic age-dependent population equations with jumps do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical Euler scheme and show the convergence of the numerical approximation solution to the true solution.     

Approximation of signals from local averages

This work is concerned with approximation of a signal from local averages. It improves a result of Butzer and Lei [P.L. Butzer, J. Lei, Approximation of signals using measured sampled values and error analysis, Commun. Appl. Anal. 4 (2000) 245–255].     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).     

Stationary remaining service time conditional on queue length

In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments.     

Electron-confined LO-phonon scattering in GaAs-Al0.45Ga0.55As superlattice

We develop a theoretical model to the scattering time due to the electron-confined LO-phonon in GaAs-Al_xGa_1-xAs superlattice taking into account the sub-band parabolicity. Using the new analytic wave function of electron miniband conduction of superlattice and a reformulation slab model for the confined LO-phonon modes, an expression for the electron-confined LO-phonon scattering time is obtained. In solving numerically a partial differential equation for the phonon generation rate, our results show that forx = 0.45, the LO-phonon in superlattice changes from a bulk-like propagating mode to a confined mode. The dispersion of the relaxation time due to the emission of confined LO-phonons depends strongly on the total energy.     

TDI线扫相机光学通道建模与仿真

卫星相机建模与仿真研究不论在民用还是军事领域都具有重要的理论研究和实际应用价值。根据TDI线扫相机的工作原理建立了一个TDI线扫相机光学通道的数学模型,该模型包括从景物到TDI CCD离散图像的几何投影关系和能量传递关系两部分,对于确定的成像系统,给定景物参数和光学系统参数,就可以确定对应图像传感器上的离散图像。为了验证模型,对一幅卫星图像进行了计算机仿真。建立的模型可以用来研究当成像条件改变时对图像的影响,进一步还可以用来发展虚拟卫星相机系统。     

KNSBN晶体猫式互抽动相位共轭光特性

在KNSBN：Ce晶体中，利用二波耦合作用，在单一光束无法获得相位共轭光的条件下，实现了“猫”式互抽运相位共轭光输出，获得较高的共轭光发射率，实验结果表明，晶体的二波耦合作用可以使晶体的自抽运相位共轭光的阈值光强降低。入射光的入射角范围增大，响应时间缩短。     

交流源作用下介观RLC电路系统量子态随时间的演化

根据量子不变量理论，同时考虑介观电容器极板间电子波函数的耦合作用和电路的耗散,研究介观RLC电路系统在交流电流源作用下动力学的演化过程，并且得到描述系统量子态随时间的演化算符.进一步的分析结果表明，介观RLC电路系统的波函数将由任意的初态演化到一般的压缩态. 关键词： 介观RLC电路 交变电源 不变量理论 时间演化算符     

安全质量费用工期在网络计划中的系统优化研究

施工网络计划中安全、质量、费用、工期达到综合优化是工程管理决策追求的目标,在工程项目管理中对这4个指标进行全面系统分析,并且进行综合均衡优化,对于提高工程项目的综合效益至关重要.采取在网络计划所有可行的施工方案中寻求最优的方案组合,从而达到总目标的优化.并且通过一个实例来说明本方法的应用.     

On the classification of all self-dual additive codes over GF(4) of length up to 12

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.