Shotgun reconstruction in the hypercube

Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls.     

Stochastic sensitivity analysis of coupled acoustic-structural systems under non-stationary random excitations

This paper presents a new sensitivity analysis method for coupled acoustic–structural systems subjected to non-stationary random excitations. The integral of the response power spectrum density (PSD) of the coupled system is taken as the objective function. The thickness of each structural element is used as a design variable. A time-domain algorithm integrating the pseudo excitation method (PEM), direct differentiation method (DDM) and high precision direct (HPD) integration method is proposed for the sensitivity analysis of the objective function with respect to design variables. Firstly, the PEM is adopted to transform the sensitivity analysis under non-stationary random excitations into the sensitivity analysis under pseudo transient excitations. Then, the sensitivity analysis equation of the coupled system under pseudo transient excitations is derived based on the DDM. Moreover, the HPD integration method is used to efficiently solve the sensitivity analysis equation under pseudo transient excitations in a reduced-order modal space. Numerical examples are presented to demonstrate the validity of the proposed method.     

Phase transitions in graphs on orientable surfaces

Let be the orientable surface of genus and denote by the class of all graphs on vertex set with edges embeddable on . We prove that the component structure of a graph chosen uniformly at random from features two phase transitions. The first phase transition mirrors the classical phase transition in the Erd?s‐Rényi random graph chosen uniformly at random from all graphs with vertex set and edges. It takes place at , when the giant component emerges. The second phase transition occurs at , when the giant component covers almost all vertices of the graph. This kind of phenomenon is strikingly different from and has only been observed for graphs on surfaces.     

The chromatic number of random Borsuk graphs

We study a model of random graph where vertices are n i.i.d. uniform random points on the unit sphere S^d in , and a pair of vertices is connected if the Euclidean distance between them is at least 2??. We are interested in the chromatic number of this graph as n tends to infinity. It is not too hard to see that if ?>0 is small and fixed, then the chromatic number is d+2 with high probability. We show that this holds even if ?→0 slowly enough. We quantify the rate at which ? can tend to zero and still have the same chromatic number. The proof depends on combining topological methods (namely the Lyusternik–Schnirelman–Borsuk theorem) with geometric probability arguments. The rate we obtain is best possible, up to a constant factor—if ?→0 faster than this, we show that the graph is (d+1)‐colorable with high probability.25     

Information percolation and cutoff for the random‐cluster model

We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ_∞ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.     

基于无人机多光谱图像的土壤水分检测方法研究

以表层土壤为对象,探究土壤的多光谱反射率与土壤水分含量相关性,进行基于无人机多光谱图像的土壤水分含量预测模型方法的探究。选取中国农业大学通州实验站为研究区域,实地采集试验田的土壤样本100组,按照一定梯度配制土壤含水量,配成的土壤含水率为10%~50%之间,土壤含量的真实值采用土壤烘干法进行测定。多光谱相机灵巧便捷,可搭载在无人机上对土壤进行监测。将RedEdged-M型多光谱相机搭载在Phantom 3型无人机上,选择阳光充足的采集环境,实时采集土壤样本的多光谱图像,建立土壤多光谱信息与水分含量之间的模型。利用处理光谱数据的ENVI5.3软件提取土壤样本多光谱信息,以多光谱相机自带的标准白板反射率为100%,计算出土壤样本在蓝、绿、红、红边、近红外五个波段的光谱反射率。采用BP神经网络算法、支持向量机算法、偏最小二乘算法分别建立基于无人机多光谱图像的土壤水分含量的预测模型。以80组土壤样本数据作为训练集,建立基于多光谱图像的土壤水分含量预测模型。采用莱文贝格-马夸特算法对BPNN进行改进,提高了其训练速度,当网络结构为5-10-1时,训练效果最好,本文选择该网络结构;SVM采取高斯核函数,当参数为0.56时,模型效果最好。本研究采用归一化均方根误差(NRMSE)和决策系数(R 2)对三种土壤水分含量的预测模型进行定量对比。以20组土壤样本数据作为测试集,结果可知,基于BP神经网络土壤水分含量预测模型的NRMSE为0.268,R 2为0.872;基于支持向量机的土壤水分含量预测模型的NRMSE为0.298,R 2为0.821;基于偏最小二乘土壤水分含量预测模型的NRMSE为0.316,R 2为0.789。对三种模型分析可知,基于BPNN的土壤水分含量预测模型效果均较好。结果可知,土壤的光谱反射率与含水率间存在较密切的相关性,将多光谱相机搭载在无人机上可以对土壤水分含量进行有效的实时监测,对监测土壤墒情提供技术支持和理论支撑。     

Convergence rates of the blocked Gibbs sampler with random scan in the Wasserstein metric

ABSTRACT

This paper establishes explicit estimates of convergence rates for the blocked Gibbs sampler with random scan under the Dobrushin conditions. The estimates of convergence in the Wasserstein metric are obtained by taking purely analytic approaches.     

Dynamic and buckling analysis of polymer hybrid composite beam with variable thickness

This work deals with a study of the dynamic and buckling analysis of polymer hybrid composite(PHC) beam. The beam has variable thickness and is reinforced by carbon nanotubes(CNTs) and nanoclay(NC) simultaneously. The governing equations are derived based on the first shear deformation theory(FSDT). A three-phase HalpinTsai approach is used to predict the mechanical properties of the PHC. We focus our attention on the effect of the simultaneous addition of NC and CNT on the vibration and buckling analysis of the PHC beam with variable thickness. Also a comparison study is done on the sensation of three impressive parameters including CNT, NC weight fractions, and the shape factor of fillers on the mechanical properties of PHC beams,as well as fundamental frequencies of free vibrations and critical buckling load. The results show that the increase of shape factor value, NC, and CNT weight fractions leads to considerable reinforcement in mechanical properties as well as increase of the dimensionless fundamental frequency and buckling load. The variation of CNT weight fraction on elastic modulus is more sensitive rather than shear modulus but the effect of NC weight fraction on elastic and shear moduli is fairly the same. The shape factor values more than the medium level do not affect the mechanical properties.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.     

Counting restricted orientations of random graphs

We count orientations of avoiding certain classes of oriented graphs. In particular, we study , the number of orientations of the binomial random graph in which every copy of is transitive, and , the number of orientations of containing no strongly connected copy of . We give the correct order of growth of and up to polylogarithmic factors; for orientations with no cyclic triangle, this significantly improves a result of Allen, Kohayakawa, Mota, and Parente. We also discuss the problem for a single forbidden oriented graph, and state a number of open problems and conjectures.