搜索结果: 1-15 共查到“知识库 随机数值实验”相关记录45条 . 查询时间(2.958 秒)
在实际工程中,设备往往是由多个不同类型元件或部件构成的集合体,其总体性能退化程度是由内部多种随机退化过程综合影响下的结果.不同于现有文献主要采用无记忆效应的单一线性或非线性形式随机过程模型来描述设备的真实退化,首先建立一种基于分数布朗运动(Fractional Brownian motion,FBM)的混合随机退化模型,用以刻画退化过程中的记忆效应与长期依赖性。
针对随机材料的多模态蒙特卡洛均匀化方法（黄记祖）
随机材料 多模态 蒙特卡洛均匀化
2023/2/22
In this paper, we propose and analyze a new stochastic homogenization method for diffusion equations with random and fast oscillatory coefficients. In the proposed method, the homogenized solutions ar...
In this article, we study the density function of the numerical solution of the splitting averaged vector field (AVF) scheme for the stochastic Langevin equation. We first show the existence of the de...
反源问题正则解及其有限元逼近的随机收敛性
反源问题 正则解 有限元逼近 随机收敛性
2023/1/5
In this work, we investigate the regularized solutions and their finite element solutions to the inverse source problems governed by partial differential equations, and we establish the stochastic con...
浮区法因具有无坩埚接触污染的生长优点而成为生长高完整性和高均匀性单晶材料的重要技术.但熔体中存在的毛细对流会给浮区法晶体生长带来极大挑战，这是由于对流的不稳定会导致晶体微观瑕疵的产生和宏观条纹等缺陷的形成.为了提高浮区法生长单晶材料的品质，研究浮区法晶体生长中毛细对流特性及如何控制其不稳定性显得尤为重要.本文采用数值模拟的方法对半浮区液桥内SixGe1-x体系中存在的热质毛细对流展开研究并施加旋转...
Local Limit Theorems for Random Walks in a 1D Random Environment
RWRE quenched random environments
2015/9/29
We consider random walks (RW) in a one-dimensional i.i.d.
random environment with jumps to the nearest neighbours. For almost
all environments, we prove a quenched Local Limit Theorem (LLT) for
the...
The Set of Solutions of Random XORSAT Formulae
random constraint satisfaction problem clustering of solutions phase transition random graph local weak convergence belief propagation
2015/8/21
The XOR-satisfiability (XORSAT) problem requires finding an assignment of n Boolean variables that satisfy m exclusive OR (XOR) clauses, whereby each clause constrains a subset of the variables. We co...
Counting good truth assignments of random k-SAT formulae
Random k-SAT Correlation Decay Uniqueness Gibbs Distribution
2015/8/21
We present a deterministic approximation algorithm to compute logarithm of the number of ‘good’ truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by ‘good’ we m...
The asymptotic error floor of LDPC ensembles under BP decoding
Binary no memory random elements the noise
2015/8/21
We consider communication over binary memoryless symmetric channels using random elements from irregular low density parity check code (LDPC) ensembles, and belief propagation (BP) decoding. Under the...
Reconstruction for models on random graphs
Random variables algorithms the random sequence diagram
2015/8/21
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Several theoretical results (a...
Learning Low Rank Matrices from O(n) Entries
Random items matrix reconstruction matrix the stochastic matrix
2015/8/21
How many random entries of an n × nα, rank r matrix are necessary to reconstruct the matrix within an accuracy δ? We address this question in the case of a random matrix with bounded rank, whereby the...
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. ...
Which graphical models are difficult to learn?
Ising model binary markov random field markov random
2015/8/21
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their re...
Boosting search by rare events
Random search algorithm combination nonequilibrium random random algorithm
2015/8/21
Randomized search algorithms for hard combinatorial problems exhibit a large variability of per- formances. We study the different types of rare events which occur in such out-of-equilibrium stochasti...