条形码技术的国际发展趋势及我国的对策

介绍了供应链管理中的一个得力工具——条形码技术，对这一技术进行了剖析，分析了条形码技术的国际发展趋势以及在我国的应用现状，最后针对我国在实现条形码技术时所遇到的各种问题提出了一些建议。     

线性规划的符号跟踪算法

分析了只含一个约束条件的线性规划最优基变量的特征，将其运用到搜寻含m个约束条件的线性规划的最优基变量，从而提出了线性规划的符号跟踪算法，为线性规划求解提供了新途径。     

关于折射率对散射光场分布影响的研究

根据Mie散射理论,采用理论计算和实验相结合的手法,研究了光散射现象以及散射介质的折射率对散射光场分布的影响.通过对空气中不同折射率的散射介质形成的散射光场光强的实验比较,论证了散射介质折射率的实部变化对散射光强的影响不大,其主要影响是通过对相位的变化来实现的,也即散射介质折射率的虚部变化对光强的影响很大,在实际应用中不可忽略.这一结论对以散射光场的分布为基础的各种研究具有一定的指导意义.     

微分多项式的值分布

文[2-6]讨论了亚纯函数或代数体函数的微分多项式ω‘(z)-αω^n(z)及ω（z)ω^n(z)的例外值问题。本文利用代数体函数的Nevanlinna值分布理论方法，研究了代数体函数的微分多项式P（ω^(k)(z))-aΠk=1^s(ω(z)-ak)^pk,及a(w^(k)(z)^tw^n(t)的Picard值问题，推广了他们的结果。     

Particle Size Analysis by Transmission Fluctuation Spectrometry: Experimental Results Obtained with a Gaussian Beam and Analog Signal Processing

Transmission fluctuation spectrometry (TFS) is a method for the analysis of particle size distributions based on the statistical fluctuations of a transmission signal. Complete information on the PSD and particle concentration can be retrieved by a special transformation of the transmission signal, whereby the expectancy of the transmission square (ETS) is determined after the signal has been subjected to a procedure of spatial and temporal averaging. By varying the averaging parameters over a wide range, a spectrum of ETSs is obtained and introduced into a linear equation system, which yields the PSD. In the experimental realization presented here, variable temporal averaging is realized in the frequency domain with a series of low pass filters at different cutoff frequencies while spatial averaging inevitably occurs as the particles pass through a focused Gaussian beam of finite cross section. Experimental results on spherical particles (glass beads) and non‐spherical particles (SiC) are presented. The PSDs are resolved in 30 intervals within a particle size range from 1–1000 μm, employing a modified Chahine inversion algorithm. So far, the measurements are limited to moderate particle concentrations. Some influences affecting the measurements, especially for higher particle concentrations, are discussed in detail.     

一种有交易费用的交互式组合证券投资方法

本基于乘积最大化准则，提出一种新的交互式组合证券投资方法，即将不可微的双目标规划问题转化为可微的单目标规划问题。该方法可以充分考虑投资的要求，在考虑交易费用的前提下，在整个投资方案达到投资要求底限的同时，实现收益和风险的权衡。     

A new summation identity for the Srivastava-Singhal polynomials

In his recent investigations involving differential operators for some generalizations of the classical Laguerre polynomials, H. Bavinck [J. Phys. A Math. Gen. 29 (1996) L277-L279] encountered and proved a certain summation identity for the classical Laguerre polynomials. The main object of this sequel to Bavinck's work is to prove a generalization of this summation identity for the Srivastava-Singhal polynomials. The demonstration, which is presented here in the general case, differs markedly from the earlier proof given for the known special case. It is also indicated how the general summation identity can be applied to derive the corresponding result for one class of the Konhauser biorthogonal polynomials.     

Qualitative Theory and Identification of Dynamic System with One Degree of Freedom

Dynamic systems described by nonlinear differential equations of the second order are studied. It is assumed that certain preliminary information on the dissipative or elastic characteristics of systems is known. A new approach is demonstrated to obtaining full information on unknown or partially known characteristics of a system from measurements of not only displacements but also velocities and accelerations __________ Published in Prikladnaya Mekhanika, Vol. 41, No. 6, pp. 139–143, June 2005.     

A general Hsu-Robbins-Erdős Type estimate of tail probabilities of sums of independent identically distributed random variables

Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%...     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003