改进的随机蛙跳算法对农机润滑油污染浓度的近红外光谱检测研究

润滑油是农业机械正常作业的必要物资,农业机械发动机工作的动力性、安全性、经济性以及寿命与润滑油状况有着紧密联系。污染浓度作为油液的综合评价指标,常规的实验室检测耗时长、成本高,所以开发高效的润滑油污染浓度检测技术具有重要意义。提出了一种基于近红外光谱技术的农机润滑油污染浓度的检测方法,同时针对随机蛙跳(RF)特征波长选择算法中迭代次数大,结果再现性低等缺点,提出了一种迭代保留信息变量的随机蛙跳(IRIV-RF)特征波长选择算法。该算法一方面利用迭代保留信息变量(IRIV)算法提取出强信息变量和弱信息变量,将其作为RF算法中的初始变量集,消除初始变量集的随机性对结果再现性的影响。另一方面通过对变量按被选概率值由大到小正向排序后,从首个波长开始依次增加一个波长建立偏最小二乘回归(PLSR)模型,选择交叉验证均方根误差(RMSECV)值最小时的变量子集为特征波长,消除RF算法所提取的特征波长数量的不确定性。利用近红外光谱仪采集自行配制的101份不同污染浓度的农机润滑油原始光谱数据,选用三种不同的预处理方法分别对原始光谱进行处理,确定最佳的预处理方法为变量标准化(SNV)。在此基础上通过RF,...     

随机森林结合CatBoost的近红外光谱药品鉴别

药品质量关乎人民健康和国家命脉,随着社会经济的飞速发展对药品质量的快速、有效鉴别具有极其重要的作用。光谱分析技术具有较高的准确性、较快的分析速度且对样品不存在污染等突出优点,广泛应用在化工、石油以及医药等重要的领域。为了解决传统药品鉴别模型存在的鉴别精度低、鉴别速度不能满足实际需求且鉴别模型稳定性差的问题,采用光谱仪采集药品的近红外光谱数据达到对药品无污染鉴别的目的。结合随机森林和CatBoost对药品进行分类鉴别,以实现快速且准确的鉴别。首先采用随机森林(RF)对光谱仪采集的光谱数据进行有效特征波长的筛选,从而将药品光谱数据中的无关波长去除、筛选出最能表征样品属性的特征波长,然后以极限学习机(ELM)作为CatBoost的弱分类器分析筛选的特征波长对药品的属性鉴别。由于ELM仅只含有一个隐含层且无需多次迭代寻优保证了鉴别模型运行速度更快,CatBoost通过集成弱分类器以改善模型鉴别准确性。为对所提出的药品鉴别模型性能进行有效评估,采用随机抽取训练集的方式构造不同规模药品光谱数据并分别上进行独立实验且以10次运行结果的均值作为其最终结果,并通过与CatBoost、持向量机(SVM)、...     

基于两步正交相移干涉的振幅图像光学加密技术

提出一种基于两步正交相移干涉的光学图像加密技术.这种相移干涉数字全息只要记录两幅干涉图,不需要记录物光波和参考光波的强度信息,就可以再现没有零级像和共轭像的再现像.物光波对应的光路经过两次菲涅尔变换,并结合双随机相位编码.参考光分别引入0和π/2相位,用数字化记录介质记录两幅数字全息图作为加密图像.解密时只要获得正确的密钥,经过简单的计算就可以重建清晰的原始图像.模拟实验验证了它的可行性和有效性,分析了抗裁剪和噪音的鲁棒性.     

Computational investigations of folded self-avoiding walks related to protein folding

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are studied computationally in this article. We show that these two sets are equal and correspond to the whole n-step self-avoiding walks for n ≤ 14, but that they are different for numerous n ≥ 108, which are common protein lengths. Concrete counterexamples are provided and the computational methods used to discover them are completely detailed. A tool for studying these subsets of walks related to both pivot moves and protein conformations is finally presented.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

A Strong Limit Theorem on Random Selection

In this paper, the idea of random selection in the theorem on gambling system is extended to Markov chains, by using the notion likelihood ratio and an analytic technique. A strong limit theorem on the relative frequency of ordered couple under random selection is established.AMS Subject Classification (2001) primary 60F15 Secondary 60J10     

Persistent Random Walks in Stationary Environment

We study the behavior of persistent random walks (RW) on the integers in a random environment. A complete characterization of the almost sure limit behavior of these processes, including the law of large numbers, is obtained. This is done in a general situation where the environmental sequence of random variables is stationary and ergodic. Szász and Tóth obtained a central limit theorem when the ratio /, of right- and left-transpassing probabilities satisfies /a<1 a.s. (for a given constant a). We consider the case where / has wider fluctuations; we shall observe that an unusual situation arises: the RW may converge a.s. to infinity even with zero drift. Then, we obtain nonclassical limiting distributions for the RW. Proofs are based on the introduction of suitable branching processes in order to count the steps performed by the RW.     

Stability and other limit laws for exit times of random walks from a strip or a halfplane

We show that the passage time, T^*(r), of a random walk S_n above a horizontal boundary at r (r≥0) is stable (in probability) in the sense that as r→∞ for a deterministic function C(r)>0, if and only if the random walk is relatively stable in the sense that as n→∞ for a deterministic sequence B_n>0. The stability of a passage time is an important ingredient in some proofs in sequential analysis, where it arises during applications of Anscombe's Theorem. We also prove a counterpart for the almost sure stability of T^*(r), which we show is equivalent to E|X|<∞, EX>0. Similarly, counterparts for the exit of the random walk from the strip {|y|≤r} are proved. The conditions arefurther related to the relative stability of the maximal sum and the maximum modulus of the sums. Another result shows that the exit position of the random walk outside the boundaries at ±r drifts to ∞ as r→∞ if and only if the random walk drifts to ∞.     

Almost-Sure Results for a Class of Dependent Random Variables

The aim of this note is to establish almost-sure Marcinkiewicz-Zygmund type results for a class of random variables indexed by _d ⁺ —the positive d-dimensional lattice points—and having maximal coefficient of correlation strictly smaller than 1. The class of applications include filters of certain Gaussian sequences and Markov processes.