河流COD污染通量变化规律研究

分析了两种类型河流COD污染通量变化特征。汇水面积较大的河流 ,下游断面汛期COD通量远大于点源COD入河排污量 ,典型河流断面可达其 9～ 2 2倍。这类河流COD污染通量与河水流量呈显著正相关 ,r值在 0 .90 3～ 0 .997范围 ,文中给出线性回归方程。河流点源污染量变异系数一般在 30 %～ 6 0 %,面源可达 12 7%～ 2 0 7%。     

Using activity focus networks to pressure terrorist organizations

The predominant idea for using network concepts to fight terrorists centers on disabling key parts of their communication networks. Although this counternetwork strategy is clearly a sound approach, it is vulnerable to missing, incomplete, or erroneous information about the network. This paper describes a different and complementary application of network concepts to terrorist organizations. It is based on activity focus networks (AFNs), which represent the complex activity system of an organization. An activity focus is a conceptual or physical entity around which joint activity is organized. Any organization has a number of these, which are in some cases compatible and in some cases incompatible. The set of foci and their relations of compatibility and incompatibility define the AFN. A hypothetical AFN for a terrorist organization is specified and tested in a simulation called AQAS. It shows that certain activity foci, and in particular one combination, have high potential as pressure points for the activity system. The AFN approach complements the counternetwork approach by reducing the downside risk of incomplete information about the communication network, and enhancing the effectiveness of counternetwork approaches over time. Steven R. Corman is Professor in the Hugh Downs School of Human Communication at Arizona State University and Chair of the Organizational Communication Division of the International Communication Association. His research interests include communication networks and activity systems, high-resolution text and discourse analysis, and modeling and simulation of human communication systems.     

KDP晶体三倍频实验和分析

报道了ＫＤＰ晶体中的三倍频产生的实验研究，计算了比较了直接三倍频过程和级联过程对ＫＤＰ晶体三阶有效非线性系数的贡献，并探讨了ＫＤＰ作为非线性晶体材料三阶非线性系数测量基准的可行性。     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

线性常微分方程的保线性变换及其应用

研究了线性常微分方程的保线性变换，得到任意两个二阶线性常微分方程等价的条件，并用于求解一类二阶线性变系数齐次常微分方程．对数学物理方法教学中怎样通过适当的变换把给定的二阶线性变系数齐次常微分方程化为可解的方程给出了合理解释。     

Complex Geometry of the Universal Teichmuller Space

We prove that all invariant distances on the universal Teichmuller space agree and are determined by the Grunsky coefficients of the naturally related conformal maps. This fact yields various important consequences; in particular, we obtain solutions of certain well-known geometric problems in complex analysis and related fields.     

Unique continuation along curves and hypersurfaces for second order anisotropic hyperbolic systems with real analytic coefficients

In this paper we prove the following kind of unique continuation property. That is, the zero on each geodesic of the solution in a real analytic hypersurface for second order anisotropic hyperbolic systems with real analytic coefficients can be continued along this curve.

     

Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.

The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

正负系数中立型差分方程的正解的存在性

In this paper the sufficient conditions for the existence of positive solutions of the neutral difference equations with positive and negative coefficients are established. The results improve some known conclusions in the literature