How big are the increments of G-Brownian motion?

In this paper,we investigate the problem:How big are the increments of G-Brownian motion.We obtain the Csrg and R′ev′esz’s type theorem for the increments of G-Brownian motion.As applications of this result,we get the law of iterated logarithm and the Erds and R′enyi law of large numbers for G-Brownian motion.Furthermore,it turns out that our theorems are natural extensions of the classical results obtained by Csrg and R′ev′esz(1979).     

三级备件保障系统下的备件库存优化模型

目前我军装备备件保障通常采用三级保障模式,以各级备件期望短缺数量之和最小为目标,研究在不同库存水平条件下,三级备件保障系统的备件库存优化模型.经示例分析,验证了该模型的可行性和有效性,该结果可为多级备件保障提供理论依据.     

Robust adaptive synchronization of uncertain complex networks with multiple time‐varying coupled delays

In this article, the synchronization problem of uncertain complex networks with multiple coupled time‐varying delays is studied. The synchronization criterion is deduced for complex dynamical networks with multiple different time‐varying coupling delays and uncertainties, based on Lyapunov stability theory and robust adaptive principle. By designing suitable robust adaptive synchronization controllers that have strong robustness against the uncertainties in coupling matrices, the all nodes states of complex networks globally asymptotically synchronize to a desired synchronization state. The numerical simulations are given to show the feasibility and effectiveness of theoretical results. © 2014 Wiley Periodicals, Inc. Complexity 20: 62–73, 2015     

NONLINEAR EXPECTATIONS AND NONLINEAR MARKOV CHAINS

§1.IntroductionLet(?,F)be a measurable space and let Lb(F)be the space of F-measurable andbounded real functions.A nonlinear expectation is a continuous functionalE[·]:Lb(F)?→Rthat is order preserving(i.e.,E[X1]≥E[X2],if X1≥X2)and constant preserving     

一类不确定时变时滞系统的鲁棒自适应稳定控制

研究了一类不确定时变时滞系统的鲁棒自适应稳定控制问题.系统包含多变时滞非线性扰动.基于Lyapunov稳定性理论和Lyapunov-K rasovsk ii型泛函设计出了一种无记忆的自适应状态反馈控制器,并证明了满足一定条件时,此控制器使得闭环系统最终一致有界.     

Copolymerization of Ethylene with 1,9‐Decadiene: Part II—Prediction of Molecular Weight Distributions

In the present work, adaptive orthogonal collocation and a Monte Carlo method are used to compute the molecular weight distributions (MWD) of ethylene/1,9‐decadiene copolymers produced with a constrained geometry catalyst. Predictions from each model are compared to each other and to the experimental MWDs, allowing for the evaluation of relative strengths and weaknesses of each mathematical modeling method. Comparisons with experimental results indicate that the rate of macromonomer incorporation in the growing polymer chains decays with the macromonomer radius of gyration. In all cases, the proposed models are able to fit appropriately the available experimental MWDs.     

双向粘弹性节理岩体时域等效分析

以双向粘弹性节理岩体为研究对象,基于一种简单等效假定和自适应算法,并结合有限元方法,得到递推格式的等效本构模型和等效粘弹性场计算模型.通过算例,将等效解与基于ANSYS的非均质解进行比较.从计算精度和效率平衡的角度而言,等效模型的结果是令人满意的.     

Spatially adaptive sparse grids for high-dimensional data-driven problems

Sparse grids allow one to employ grid-based discretization methods in data-driven problems. We present an extension of the classical sparse grid approach that allows us to tackle high-dimensional problems by spatially adaptive refinement, modified ansatz functions, and efficient regularization techniques. The competitiveness of this method is shown for typical benchmark problems with up to 166 dimensions for classification in data mining, pointing out properties of sparse grids in this context. To gain insight into the adaptive refinement and to examine the scope for further improvements, the approximation of non-smooth indicator functions with adaptive sparse grids has been studied as a model problem. As an example for an improved adaptive grid refinement, we present results for an edge-detection strategy.     

Discrete space location-allocation solutions from genetic algorithms

Genetic algorithms are adaptive sampling strategies based on information processing models from population genetics. Because they are able to sample a population broadly, they have the potential to out-perform existing heuristics for certain difficult classes of location problems. This paper describes reproductive plans in the context of adaptive optimization methods, and details the three genetic operators which are the core of the reproductive design. An algorithm is presented to illustrate applications to discrete-space location problems, particularly thep-median. The algorithm is unlikely to compete in terms of efficiency with existingp-median heuristics. However, it is highly general and can be fine-tuned to maximize computational efficiency for any specific problem class.