Super parametric convex model and its application for non-probabilistic reliability-based design optimization

In this study, we attempt to propose a new super parametric convex model by giving the mathematical definition, in which an effective minimum volume method is constructed to give a reasonable enveloping of limited experimental samples by selecting a proper super parameter. Two novel reliability calculation algorithms, including nominal value method and advanced nominal value method, are proposed to evaluate the non-probabilistic reliability index. To investigate the influence of non-probabilistic convex model type on non-probabilistic reliability-based design optimization, an effective approach based on advanced nominal value method is further developed. Four examples, including two numerical examples and two engineering applications, are tested to demonstrate the superiority of the proposed non-probabilistic reliability analysis and optimization technique.     

Reliability Approximation for Markov Chain Imbeddable Systems

In the present article, a simple method is developed for approximating the reliability of Markov chain imbeddable systems. The approximating formula reduces the problem to the reliability assessment of smaller systems with structure similar to the original systems. Two specific reliability structures which have attracted considerable research interest recently (r-within-consecutive-k-out-of-n system and two dimensional r-within-k ₁ × k ₂-out-of-n ₁ × n ₂ system) are studied by the new approach and numerical calculations are carried out, which reveal the high quality of our approximations. Several possible extensions and generalizations are also presented in brief.     

Reliability and covariance estimation of weighted k-out-of-n multi-state systems

In the literature of reliability engineering, reliability of the weighted k-out-of-n system can be calculated using component reliability based on the structure function. The calculation usually assumes that the true component reliability is completely known. However, this is not the case in practical applications. Instead, component reliability has to be estimated using empirical sample data. Uncertainty arises during this estimation process and propagates to the system level. This paper studies the propagation mechanism of estimation uncertainty through the universal generating function method. Equations of the complete solution including the unbiased system reliability estimator and the corresponding unbiased covariance estimator are derived. This is a unified approach. It can be applied to weighted k-out-of-n systems with multi-state components, to weighted k-out-of-n systems with binary components, and to simple series and parallel systems. It may also serve as building blocks to derive estimators of system reliability and uncertainty measures for more complicated systems.     

<Emphasis Type="Italic">τ</Emphasis>-primitive subgroups of finite groups

We study the influence of τ-primitive subgroups on the structure of finite groups. As applications, we give the structure of the finite groups whose every subgroup is an intersection of subgroups of prime power index and the structure of finite groups whose every subnormal subgroup is an intersection of subnormal subgroups of prime power index.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-mixed intersection bodies

In this paper the author first introduce a new concept of L _p -dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of L _p intersection body to L _p -mixed intersection body. Inequalities for L _p -dual mixed volumes of L _p -mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities. This work was supported by the Natural Science Foundation of Zhejiang Province of China (Grant No. Y605065) and the Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

铁路应急设施非概率可靠性选址优化研究

为解决小样本、贫信息下铁路应急资源储备点的可靠性选址问题,创新性地将选址-路径问题与区间非概率可靠性方法结合起来,考虑灾情发生后应急设施点在可接受的时间范围内响应受灾点的需求能力及其稳定程度,采用区间值度量路段阻抗,基于区间非概率可靠性理论及区间运算规则,提出路径的非概率可靠性度量及可靠最短路径选择方法;建立基于区间时间阻抗下可靠最短路径的无容量设施选址模型,提出约束条件限制的Monte Carlo改进算法,确定了铁路资源储备点选址的最优方案。实例表明,本文的优化方案能更好地保证救援的时间可靠性,改进的求解算法具有更小的时间复杂度,有效地缩短了运算时间,改善了解的质量。本文的方法与模型体系对于实现铁路应急设施可靠性选址,为决策者提供决策支持,提高铁路应急响应能力具有重要的指导意义。     

Non-Probabilistic Structural Reliability Analysis Integrating the PSO and the Kriging Model北大核心CSCD

针对复杂结构可靠性分析中面临的隐式功能函数和小样本问题,提出了一种粒子群优化和Kriging模型相结合的结构非概率可靠性分析方法。采用多维椭球描述结构不确定参数,运用粒子群优化对模型相关参数进行求解,并构建隐式功能函数的Kriging模型进行可靠性分析。三个算例结果表明所提方法有效可行,精度和效率均优于基于Kriging模型的非概率可靠性分析方法。     

Certain summation formulas involving harmonic numbers and generalized harmonic numbers

Harmonic numbers and generalized harmonic numbers have been studied since the distant past and involved in a wide range of diverse fields such as analysis of algorithms in computer science, various branches of number theory, elementary particle physics and theoretical physics. Here we aim at presenting further interesting identities about certain finite or infinite series involving harmonic numbers and generalized harmonic numbers by applying an algorithmic method to a known summation formula for the hypergeometric function ₅F₄(1).     

Stability analysis of a new kind n-unit series repairable system

In this paper, we deal with a new model of an n-unit series repairable system, in which a concept of a repairman with multiple-delayed vacation is introduced and the impact on the system reliability due to a replaceable facility is also considered. This paper is devoted to studying the unique existence and stability of the system solution. C₀-semigroup theory is used to prove the existence of a unique nonnegative time-dependent solution of the system. Then by analyzing the spectra distribution of the system operator, we prove that the dynamic solution of the system asymptotically converges to the nonnegative steady-state solution which is the eigenfunction corresponding to eigenvalue 0 of the system operator. Furthermore, we discuss the exponential stability of the system in a special case. Some reliability indices of the system are also studied and the optimal vacation time is analyzed at the end of the paper.     

An efficient strategy for reliability-based multidisciplinary design optimization of twin-web disk with non-probabilistic model

The twin-web disk holds big promise for increasing efficiency of the aircraft engine. Its reliability-based multidisciplinary design optimization involves several disciplines including fluid mechanics, heat transfer, structural strength, and vibration. The solution to this optimization problem requires three-loop calculations including loops for optimization, reliability, and interdisciplinary consistence often making its computational cost unacceptably high. The lack of sufficient amount of probabilistic data, especially for this brand-new turbine disk, makes matters worse. In this paper, the non-probabilistic uncertain variables are described by an evidence theory-based fuzzy set method, which we extend to general structure of uncertain data. We also propose two modifications of the active learning kriging model: one of them for the purpose of optimization with respect to the distance from the optimum point and another one for the purpose of assessing reliability by introducing the importance concept. Applications of these two modifications are demonstrated in this paper. Finally, a multi-adaptive learning kriging strategy for non-probabilistic reliability-based multidisciplinary design optimization of twin-web disk is proposed to improve its power efficiency and reliability in a computationally effective way.     

Reliability of a consecutive (r, s)-out-of-(m, n):F lattice system with conditions on the number of failed components in the system

A consecutive(r, s)-out-of-(m, n):F lattice system which is defined as a two-dimensional version of a consecutive k-out-of-n:F system is used as a reliability evaluation model for a sensor system, an X-ray diagnostic system, a pattern search system, etc. This system consists of m × n components arranged like an (m, n) matrix and fails iff the system has an (r, s) submatrix that contains all failed components. In this paper we deal a combined model of a k-out-of-mn:F and a consecutive (r, s)-out-of-(m, n):F lattice system. Namely, the system has one more condition of system down, that is the total number of failed components, in addition to that of a consecutive (r, s)-out-of-(m, n):F lattice system. We present a method to obtain reliability of the system. The proposed method obtains the reliability by using a combinatorial equation that does not depend on the system size. Some numerical examples are presented to show the relationship between component reliability and system reliability.     

p-adic Arakelov theory

We introduce the p-adic analogue of Arakelov intersection theory on arithmetic surfaces. The intersection pairing in an extension of the p-adic height pairing for divisors of degree 0 in the form described by Coleman and Gross. It also uses Coleman integration and is related to work of Colmez on p-adic Green functions. We introduce the p-adic version of a metrized line bundle and define the metric on the determinant of its cohomology in the style of Faltings. We also prove analogues of the Adjunction formula and the Riemann-Roch formula.     

Combined m-consecutive and k-out-of-n sliding window systems

This paper proposes a new model that generalizes the linear multi-state sliding window system. In this model the system consists of n linearly ordered multi-state elements. Each element can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. The system fails if at least one of the following two conditions is met: (1) there exist at least m consecutive overlapping groups of r adjacent elements having the cumulative performance lower than V; (2) there exist at least k arbitrarily located groups of r adjacent elements having the cumulative performance lower than W. An algorithm for system reliability evaluation is suggested which is based on an extended universal moment generating function. Examples of evaluating system reliability and elements’ reliability importance indices are presented. Optimal sequencing of system elements is demonstrated.     

Nonparametric predictive reliability of series of voting systems

Nonparametric Predictive Inference (NPI) for system reliability reflects the dependence of reliabilities of similar components due to limited knowledge from testing. NPI has recently been presented for reliability of a single voting system consisting of multiple types of components. The components are all assumed to play the same role within the system, but with regard to their reliability components of different types are assumed to be independent. The information from tests is available per type of component. This paper presents NPI for systems with subsystems in a series structure, where all subsystems are voting systems and components of the same type can be in different subsystems. As NPI uses only few modelling assumptions, system reliability is quantified by lower and upper probabilities, reflecting the limited information in the test data. The results are illustrated by examples, which also illustrate important aspects of redundancy and diversity for system reliability.     

Weak barrelledness for C(X) spaces

Buchwalter and Schmets reconciled C_c(X) and C_p(X) spaces with most of the weak barrelledness conditions of 1973, but could not determine if -barrelled ⇔ ?^∞-barrelled for C_c(X). The areas grew apart. Full reconciliation with the fourteen conditions adopted by Saxon and Sánchez Ruiz needs their 1997 characterization of Ruess' property (L), which allows us to reduce the C_c(X) problem to its 1973 status and solve it by carefully translating the topology of Kunen (1980) and van Mill (1982) to find the example that eluded Buchwalter and Schmets. The more tractable C_p(X) readily partitions the conditions into just two equivalence classes, the same as for metrizable locally convex spaces, instead of the five required for C_c(X) spaces. Our paper elicits others, soon to appear, that analytically characterize when the Tychonov space X is pseudocompact, or Warner bounded, or when C_c(X) is a df-space (Jarchow's 1981 question).     

Infinitely many radial solutions for a p-Laplacian problem p-superlinear at the origin

We prove the existence of infinitely many radial solutions for a p-Laplacian Dirichlet problem which is p-superlinear at the origin. The main tool that we use is the shooting method. We extend for more general nonlinearities the results of J. Iaia in [J. Iaia, Radial solutions to a p-Laplacian Dirichlet problem, Appl. Anal. 58 (1995) 335-350]. Previous developments require a behavior of the nonlinearity at zero and infinity, while our main result only needs a condition of the nonlinearity at zero.     

Intersection of a ruled surface with a free-form surface

This paper presents a simple method for computing the intersection curve of a ruled surface and a free-form surface. The basic idea is to reduce the problem of surface intersection to the one of projecting an appropriate curve such as a directrix of the ruled surface, along its indicatrix curve (direction vector field of its generating lines), onto the free-form surface; the projection curve is just the intersection curve. With techniques in classical differential geometry, we derive the differential equations of the intersection curve in the cases of parametrically and implicitly defined free-form surfaces. The intersection curve naturally inherits the parameter of the chosen directrix. Moreover, it is independent of the base surface geometry and its parameterization, and is obtained by numerically solving the initial-value problem for a system of first-order ordinary differential equations in the parametric domain associated to the surface representation for parametric case or in 3D space for implicit case. Some experimental examples are also given to demonstrate that the presented method is effective and potentially useful in computer aided design and computer graphics. An erratum to this article can be found at     

On a Strong Continuous Analogue of the Szpilrajn Theorem and its Strengthening by Dushnik and Miller

The Szpilrajn theorem states that every (partial) order has a total (linear) refinement or extension by a total (linear) order. Its strengthening by Dushnik and Miller states, moreover, that every (partial) order is the intersection of its total (linear) refinements or extensions. In any theory that combines the concepts of topology and order, however, one is interested in (weakly) continuous orders. Therefore, in this paper the question will be answered, if the Szpilrajn theorem and its strengthening by Dushnik and Miller respectively can be generalized in such a way that they also include the case that (weakly) continuous orders are considered. Since arbitrary preorders are not considered in this paper we speak of possible strong continuous analogues of the Szpilrajn theorem and its strengthening by Dushnik and Miller. The main results of this paper show that the Dushnik–Miller theorem cannot be generalized to the (weakly) continuous case while the Szpilrajn theorem at least in very particular situations allows generalizations to the case that (weakly) continuous orders are considered. Finally, also a strong semicontinuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller will be discussed.     

Approximation of signals of class Lip(α, p) by linear operators

Mittal, Rhoades [5], [6], [7] and [8] and Mittal et al. [9] and [10] have initiated a study of error estimates E_n(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows. In this paper we continue the work. Here we extend two theorems of Leindler [4], where he has weakened the conditions on {p_n} given by Chandra [2], to more general classes of triangular matrix methods. Our Theorem also partially generalizes Theorem 4 of Mittal et al. [11] by dropping the monotonicity on the elements of matrix rows, which in turn generalize the results of Quade [15].     

C-GV triviality of function germs and Newton polyhedra

We provide estimates on the degree of C l GV determinacy ( G is one of Mather’s groups R or K ) of function germs which are defined on analytic variety V and satisfies a non-degeneracy condition with respect to some Newton polyhedron. The result gives an explicit order such that the C l geometrical structure of a function germ is preserved after higher order perturbations, which generalizes the result on C l G triviality of function germs given by M.A.S.Ruas.