Subadditive ergodic theorems for random sets in infinite dimensions

We prove pointwise and mean versions of the subadditive ergodic theorem for superstationary families of compact, convex random subsets of a real Banach space, extending previously known results that were obtained in finite dimensions or with additional hypotheses on the random sets. We also show how the techniques can be used to obtain the strong law of large numbers for pairwise independent random sets, as well as results in the weak topology.     

Generalized loopy 2U: A new algorithm for approximate inference in credal networks

Credal networks generalize Bayesian networks by relaxing the requirement of precision of probabilities. Credal networks are considerably more expressive than Bayesian networks, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal networks. The algorithm is based on an important representation result we prove for general credal networks: that any credal network can be equivalently reformulated as a credal network with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal network is then updated by L2U, a loopy approximate algorithm for binary credal networks. Overall, we generalize L2U to non-binary credal networks, obtaining a scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences with respect to other state-of-the-art algorithms is evaluated by extensive numerical tests.     

不同权Bloch型空间之间的加权Cesàro 算子

该文讨论了$\a$-Bloch空间$\ba$和对数Bloch空间$\bl$之间的加权Ces\'aro算子$\tg$的有界性和紧性,给出$\tg$是$\ba$到$\bl$的有界算子或紧算子的充要条件和$\tg$是$\bl$到$\ba$的有界算子或紧算子的充要条件.     

Vacuum condensates of QCD

We study the properties of QCD vacuum state in this paper. The values of various local quark vacuum condensates, quark-gluon mixed vacuum condensates, and the structure of non-local quark vacuum condensate are predicted by the solution of Dyson-Schwinger Equations in "rainbow" approximation with three sets of different parameters for effective gluon propagator. The light quark virtuality is also obtained in a consistent way. Our all theoretical results here are in good agreement with the empirical values used widely in literature and many other theoretical calculations.     

模型论简介

本文将模型论介绍为“可定义集的数学”．首先给出“可定义集”的确切定义，并引入处理可定义集的主要工具——一阶公式的概念．然后给出一些例子．最后介绍一些相当于可定义集的组合性质的稳定性理论．     

An interdependency index for the outputs of uncertain systems

The study of mechanical systems with uncertain parameters is gaining increasing interest in the field of system analysis to provide an expedient model for the prediction of the system behavior. Making use of the Transformation Method, the uncertain parameters of the system are modeled by fuzzy numbers in contrast to random numbers used in stochastic approaches. As a result of this analysis, a quantification of the overall uncertainty of the system outputs, including a worst-case scenario, is obtained. The inputs of the resulting fuzzy-valued model are a priori uncorrelated but after the uncertainties are propagated through the model, interdependency (or interaction) between the outputs may arise. If such interdependency is neglected, a misinterpretation of the results may occur. For example, in the case of applying uncertainty analysis in the early design phase of a product to determine the relevant design-parameter space, the interdependency between the design variables may reduce significantly the available part of the design space. This paper proposes a measure of interdependency between the uncertain system outputs. The interdependency index can be derived by a postprocessing of the data gained by the analysis with the Transformation Method. Such information can be obtained by a negligible amount of extra computation time.     

On the sharpness of two-sided bounds for the Perron Root and of the related eigenvalue inclusion sets

The paper considers the sharpness problem for certain two-sided bounds for the Perron root of an irreducible nonnegative matrix. The results obtained are applied to prove the sharpness of the related eigenvalue inclusion sets in classes of matrices with fixed diagonal entries, bounded above deleted absolute row sums, and a partly specified irreducible sparsity pattern.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Compact operators which factor through subspaces of lp

Let 1 ≤ p ≤ ∞. A subset K of a Banach space X is said to be relatively p ‐compact if there is an 〈x_n 〉 ∈ l^s _p (X) such that for every k ∈ K there is an 〈α_n 〉 ∈ l_{p ′} such that k = σ^∞_n=1 α_n x_n . A linear operator T: X → Y is said to be p ‐compact if T (Ball (X)) is relatively p ‐compact in Y. The set of all p ‐compact operators K_p (X, Y) from X to Y is a Banach space with a suitable factorization norm κ_p and (K_p , κ_p ) is a Banach operator ideal. In this paper we investigate the dual operator ideal (K^d _p , κ^d _p ). It is shown that κ^d _p (T) = π_p (T) for all T ∈ B (X, Y) if either X or Y is finite‐dimensional. As a consequence it is proved that the adjoint ideal of K^d _p is I_{p ′}, the ideal of p ′‐integral operators. Further, a composition/decomposition theorem K^d _p = Π_p K is proved which also yields that (Π^min _p )^inj = K^d _p . Finally, we discuss the density of finite rank operators in K^d _p and give some examples for different values of p in this respect. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The anticipative concept in warehouse optimization using simulation in an uncertain environment

The modern business environment is highly unpredictable. An anticipation approach in a real case study is presented to cope with such instability and minimize the total inventory cost without stock-outs occurring and inventory capacity being exceeded. The anticipation concept is performed using simulation models supported by inventory control algorithms on a selected sample of representative items. The inventory control algorithms include Silver–Meal, Part period balancing, Least-unit cost, and Fuzzy inventory control algorithm based on fuzzy stock-outs, highest inventory level and total cost. Transportation cost is explicitly defined as a discrete function of shipment size. The algorithms are tested on historic data. Simulation results are presented and the risk of accepting them as reliable is discussed. The process of simulation model implementation is briefly discussed to further validate the model and train order managers to use the simulation model in their order placement process.