A class of multivariate skew-normal models

The existing model for multivariate skew normal data does not cohere with the joint distribution of a random sample from a univariate skew normal distribution. This incoherence causes awkward interpretation for data analysis in practice, especially in the development of the sampling distribution theory. In this paper, we propose a refined model that is coherent with the joint distribution of the univariate skew normal random sample, for multivariate skew normal data. The proposed model extends and strengthens the multivariate skew model described in Azzalini (1985,Scandinavian Journal of Statistics,12, 171–178). We present a stochastic representation for the newly proposed model, and discuss a bivariate setting, which confirms that the newly proposed model is more plausible than the one given by Azzalini and Dalla Valle (1996,Biometrika,83, 715–726).     

Quantum-Chemical Evaluation of the Protolytic Properties of Thiophenols

The enthalpies and free energies of proton affinity (PA) were calculated by the PM3 method for 27 thiophenoxide anions. For thiophenols, linear correlation has been found between the PAs and the values of pK _a measured by different authors in aqueous acetone, aqueous ethanol, and methanol media. The dependences found permit one to predict a priori the protolytic properties of thiophenols. The differential effects of aqueous ethanol media with different ethanol contents on thiophenol acidity were evaluated based on quantum-chemical data.Original Russian Text Copyright © 2004 by A. N. Pankratov and A. V. Shalabai__________Translated from Zhurnal Strukturnoi Khimii, Vol. 45, No. 5, pp. 800–806, September–October, 2004.     

线性规划的符号跟踪算法

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

微分多项式的值分布

文[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.     

Probing proton halo of the exotic nucleus28S by elastic electron scattering

Elastic electron scattering on the exotic light nucleus²⁸S is investigated in the plane wave Born approximation. The variation of the squared form factors of²⁸S with momentum transfer is compared with that of³²S. It is found that the behavior of the form factors near the second minimum (with a moderate momentum transfer) is sensitive to the alteration of the charge density distribution of halo protons in²⁸S. This indicates that elastic electron scattering can be a good probe of the structure of proton-halo nuclei.     

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