Repleteness and regular lattice measures

Let X be an abstract set and L a lattice of subsets of X. To each lattice regular measure µ, we associate two induced measures and on suitable lattices of the Wallman space IR(L) and another measure µ on the spaceIR(L). We will investigate the reflection of smoothness properties of p onto , and µ; and try to set some new criterion for repleteness and measure repleteness.     

Some results on the behavior and estimation of the fractal dimensions of distributions on attractors

The strong interest in recent years in analyzing chaotic dynamical systems according to their asymptotic behavior has led to various definitions of fractal dimension and corresponding methods of statistical estimation. In this paper we first provide a rigorous mathematical framework for the study of dimension, focusing on pointwise dimension(x) and the generalized Renyi dimensionsD(q), and give a rigorous proof of inequalities first derived by Grassberger and Procaccia and Hentschel and Procaccia. We then specialize to the problem of statistical estimation of the correlation dimension and information dimension. It has been recognized for some time that the error estimates accompanying the usual procedures (which generally involve least squares methods and nearest neighbor calculations) grossly underestimate the true statistical error involved. In least squares analyses of and we identify sources of error not previously discussed in the literature and address the problem of obtaining accurate error estimates. We then develop an estimation procedure for which corrects for an important bias term (the local measure density) and provides confidence intervals for. The general applicability of this method is illustrated with various numerical examples.     

On vector-valued random Fourier series

Consider a (complex) Banach spaceX, such thatX C_O, and vectors(X _i ) _i ofX. Consider an independent standard normal sequence(g _i ) _i . Then if anX-valued random Fourier series _{|k| n} e ^ikt g _k x _k satisfies

Rare numbers

Suppose thatX ₁,X ₂,... is a sequence of iid random variables taking values inZ ⁺. Consider the random sequenceA(X)(X ₁,X ₂,...). LetY _n be the number of integers which appear exactly once in the firstn terms ofA(X). We investigate the limit behavior ofn ^–(1–) Y _n for [0, 1].     

A long-time tail for random walk in random scenery

Consider a simple random walk on ^d whose sites are colored black or white independently with probabilityq, resp. 1–q. Walk and coloring are independent. Letn _k be the number of steps by the walk between itskth and (k+1) th visits to a black site (i.e., the length of itskth white run), and let _k =E(n _k )–q ^–1. Our main result is a proof that (*) lim _k k ^d/2 _k = (1 –q)q ^{d/2 – 2}(d/2) ^d/2. Since it is known thatq ^{– 1} _k =E(n ₁ n _{k + 1} B) –E(n ₁ B)E(n _{k + 1} B), withB the event that the origin is black, (*) exhibits a long-time tail in the run length autocorrelation function. Numerical calculations of _k (1k100) ind=1, 2, and 3 show that there is an oscillatory behavior of _k for smallk. This damps exponentially fast, following which the power law sets in fairly rapidly. We prove that if the coloring is not independent, but is convex in the sense of FKG, then the decay of _k cannot be faster than (*).     

Random and cooperative sequential adsorption on infinite ladders and strips

We analyze various processes where particles are added irreversibly and sequentially at the sites of infinite ladders or broader strips (i.e., on terraces) of adsorption sites. For sufficiently narrow strips or ladders, exact solution in closed form is possible for a variety of processes. Often this is most naturally achieved by mapping the process onto an equivalent one-dimensional process typically involvingcompetitive adsorption. We demonstrate this procedure for sequential adsorption with nearest-neighbor exclusion on a 2× square ladder. For other select processes on strips slightly too broad for exact solution, almost exact analysis is possible exploiting an empty-site shielding property. In this way, we determine a jamming coverage of 0.91556671 for random sequential adsorption of dimers on a 2× square ladder. For broader strips, we note that the complexity of these problems quickly approaches that for × lattices.     

Polymer blends based on the β-modification of polypropylene

iPP/sPP, iPP/rPP, iPP/PVDF and iPP/PA-6 blends, and their β-nucleated forms were prepared in the present study. The components of iPP/sPP and iPP/rPP blends are compatible in the molten state. The phase structure of the melt of iPP/PVDF and iPP/PA-6 blends is heterogeneous. The melting and crystallisation characteristics as well as the structure and polymorphic composition of these blends were studied by polarised light microscopy (PLM) and differential scanning calorimetry (DSC). When semicrystalline polymers are added to iPP, the most important factor of the formation a blend with β-crystalline phase is the α-nucleation effect of the second polymer. In the case of polymers with an α-nucleating effect, the temperature range of their crystallisation should be lower than that of β-iPP. β-nucleated iPP/PVDF and iPP/PA-6 blends are extreme examples showing that completely β-iPP matrix can not form even in the presence of a highly effective β-nucleant, because of the strong α-nucleating ability and higher crystallisation temperature range of PVDF and PA-6. We found that the β-crystallisation tendency of random propylene copolymers can be enhanced by adding an iPP homopolymer.     

Random walk in an inhomogeneous medium with local impurities

In spite of Sinai's result that the decay of the velocity autocorrelation function for a random walk on ^d (d=2) can drastically change if local impurities are present, it is shown that local impurities can not abolish weak convergence to the Brownian motion if d2.     

随机模糊集与随机集

本文研究了三个方面的工作：一是定义了一种模糊集上的可测结构，从而定义了随机模糊集，这些定义都与论域Ｘ上的拓扑结构无关。将通常意义下的集合看成特殊模糊集得到的通常集合上的超可测结构与文（３）中的定义一致；二是给出了随机模糊集、随机集的一些等价条件；三是研究了随机模糊集、随机集的分布与其有限维落影族的关系。     

基于激光诱导击穿光谱(LIBS)的煤灰熔点快速检测

炉内结渣是影响火电机组和气化工艺可靠运行的关键因素之一,准确预测灰熔点可以提前调整炉膛出口温度以避免结渣。本论文采用激光诱导击穿光谱（LIBS）采集煤灰样中金属元素的光谱,分别建立煤灰中的金属元素的谱线强度与煤灰熔点的随机森林模型、支持向量机回归模型和线性回归模型,直接预测煤灰熔点温度。采用基于马氏距离(MD)的异常数据剔除算法和基于稀疏矩阵的基线估计与降噪算法（BEADS）,对粉煤灰样的全光谱数据进行了预处理。随机森林模型对粉煤灰熔点的预测平均相对误差（MRE）为54.74%,支持向量机回归模型的预测平均相对误差为60.08%,而线性回归模型的预测平均相对误差达到了9.78%。研究结果表明,线性回归模型对煤灰熔点的预测结果更准确。