Conditional Congruence Closure over Uninterpreted and Interpreted Symbols

A framework for generating congruence closure and conditional congruence closure of ground terms over uninterpreted as well as interpreted symbols satisfying various properties is proposed. It is based on some of the key concepts from Kapur’s congruence closure algorithm (RTA97) for ground equations based on introducing new symbols for all nonconstant subterms appearing in the equation set and using ground completion on uninterpreted constants and purified equalities over interpreted symbols belonging to different theories. In the original signature, the resulting rewrite systems may be nonterminating but they still generate canonical forms. A byproduct of this framework is a constant Horn completion algorithm using which ground canonical Horn rewrite systems can be generated for conditional ground theories.

New efficient algorithms for generating congruence closure of conditional and unconditional equations on ground terms over uninterpreted symbols are presented. The complexity of the conditional congruence closure is shown to be O(n*log(n)), which is the same as for unconditional ground equations. The proposed algorithm is motivated by our attempts to generate efficient and succinct interpolants for the quantifier-free theory of equality over uninterpreted function symbols which are often a conjunction of conditional equations and need additional simplification. A completion algorithm to generate a canonical conditional rewrite system from ground conditional equations is also presented. The framework is general and flexible and is used later to develop congruence closure algorithms for cases when function symbols satisfy simple properties such as commutativity, nilpotency, idempotency and identity as well as their combinations. Interesting outcomes include algorithms for canonical rewrite systems for ground equational and conditional theories on uninterpreted and interpreted symbols leading to generation of canonical forms for ground terms, constrained terms and Horn equations.

     

基于多信号流图和相似性度量的故障可诊断性评价方法

针对目前基于定性模型无法对电子系统故障可诊断性进行定量评价的问题, 将定性模型与数据驱动方法相结合, 提出一种基于多信号流图和相似性度量的故障可诊断性评价方法。首先, 根据系统的组成结构建立多信号流图模型并得到故障-测试相关性矩阵, 基于故障-测试相关性矩阵提出了故障可诊断性评价准则。其次, 提取测试信号的小波包Shannon熵作为特征向量, 以欧式距离作为相似性度量指标, 将故障可诊断性定量评价问题转换为不同故障模式下测试信号特征向量的相似性度量问题。然后, 构建故障可诊断性评价矩阵, 依据故障可诊断性评价矩阵提出了系统可诊断性指标。最后, 通过仿真分析验证了所提方法的有效性。结果表明, 所提方法在不构建数学模型的前提下, 能够实现电子系统的故障可诊断性的定量评价。     

A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Zm ～ Sn

We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m ≥ 3 and n ≥3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by [m/2]（3n^2- 8n ＋ 4） - 2n ＋ 1. The connectivity and the optimal fault tolerance of the proposed networks are also derived. In conclusion, we present comparisons of some familiar networks with constant degree 3.     

The recursive solution of queue length for <Emphasis Type="Italic">Geo/G</Emphasis>/1 queue with <Emphasis Type="Italic">N</Emphasis>-policy

This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n~-,n~+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n~-,n~+,n and departure epoch D_n).     

Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.     

Construction and comparisons of simultaneous confidence intervals for the mean difference of multivariate normal distributions

<正> In this paper,Scheffé and Simplified Scheffé simultaneous confidence intervals are firstconstructed for mean difference of several multivariate normal distributions.Then the authors theoreticallyprove that when there are only two populations,Bonferroni bounds and Simplified Scheffébounds are the same and they are shorter than Scheffé bounds for p10.In the case for 3k10and 2p10,there exists n(p,k)such that Bonferroni method is better than Simplified Schefféprocedure for nn(p,k),otherwise Simplified Scheffé procedure is better.Finally,the authors findout that neither of Scheffé critical values nor Simplified Scheffé critical values are always larger thananother through numerical calculation.     

Measuring the Performance of a Research Strategic Plan System Using the Soft Systems Methodology’s Three ‘Es’ and the Viable System Model’s Indices of Achievement

We explore problems involving the measurement of the performance of a system. We outline two systemic approaches that have come from different epistemological positions: one from the interpretivist paradigm (soft systems methodology) and the other from the cybernetic paradigm (viable systems model). These two systemic methodologies that have tackled problems involving performance measurement are considered and discussed: (a) Checkland’s systems ideas of ‘managing and controlling’ a system throughout a set of three measures of performance: efficacy, efficiency and effectiveness; and (b) Beer’s concepts of Actuality, Capability, Potentiality of the firm and his claims that the performance of a system needs to be quantifiable and resumed on ‘pure’ numbers which should reflect the survivability of the firm. A parallel is drawn between the two approaches concluding that although the paradigms underpinning them are in some way different, the practicalities of these approaches to control, measure and improve the performance of a system are very similar. A case involving the measurement of a proposed research strategic plan for a Manchester Metropolitan University Business School’s department is used to illustrate the systemic approaches.     

Asymptotic normality of wavelet estimator in heteroscedastic model with <Emphasis Type="Italic">α</Emphasis>-mixing errors

Consider heteroscedastic regression model Y _ni = g(x _ni ) + σ _ni ɛ _ni (1 ≤ i ≤ n), where σ _ni ² = f(u _ni ), the design points (x _ni , u _ni ) are known and nonrandom, g(·) and f(·) are unknown functions defined on closed interval [0, 1], and the random errors {ɛ _ni , 1 ≤ i ≤ n} are assumed to have the same distribution as {ξ _i , 1 ≤ i ≤ n}, which is a stationary and α-mixing time series with Eξ _i = 0. Under appropriate conditions, we study asymptotic normality of wavelet estimators of g(·) and f(·). Finite sample behavior of the estimators is investigated via simulations, too.     

RELIABILITY OF LINEAR （n,f, k） SYSTEMS WITH WEIGHTED COMPONENTS

The (n, f, k): F(G) system consists of n components and the system fails (works) if and only if there are at least f failed (working) components or at least k consecutive failed (working) components. These system models can be used in electronic equipment, automatic payment systems in banks, and furnace systems. In this paper we introduce and study the (n, f, k):F and (n, f, k): G systems consisting of weighted components. Recursive equations are presented for reliability evaluation of these new models. We also provide some conditions on the weights to represent weighted-(n, f, k) systems as usual (n, f, k) systems.     

Transient Queue Size Distribution Solution of Geom / G / 1 Queue with Feedback-A Recursive Method

This paper considers the Geom / G / 1 queueing model with feedback according to a late arrival system with delayed access (LASDA). Using recursive method, this paper studies the transient property of the queue size from the initial state N(0⁺) = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n ⁺ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n ⁻, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered (being different from the relations given in M / G / 1 queueing system). The model discussed in this paper can be widely applied in all kinds of communications and computer network. This research is supported by the National Natural Science Foundation of China under Grant No. 70871084, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, and the Scientific Research Fund of Southwestern University of Finance and Economics.     

Several cryptographic applications of Σ-protocol

Σ-protocol has been proved to be a very powerful cryptographic tool and widely used in numerous important cryptographic applications. In this paper, the authors make use of Σ-protocol as a main tool to resolve the following difficult problems 1–3 and to construct three efficient cryptographic protocols 4–6:

Testing <Emphasis Type="Italic">k</Emphasis>-edge-connectivity of digraphs

This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or ɛ-far from k-edge-connectivity. This is the first testing algorithm for k-edgeconnectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ɛ-far from k-edge-connectivity if at least ɛdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ɛ and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and rejects all digraphs that is ɛ-far from k-edge-connectivity with probability at least 2/3. It runs in $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) (c > 1 is a constant) time when input digraphs are restricted to be (k-1)-edge connected and runs in $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) (c > 1 is a constant) time for general digraphs.     

Invariant density,Lapunov exponent,and almost sure stability of Markovian-regime-switching linear systems

This paper is concerned with stability of a class of randomly switched systems of ordinary differential equations. The system under consideration can be viewed as a two-component process (X(t), α(t)), where the system is linear in X(t) and α(t) is a continuous-time Markov chain with a finite state space. Conditions for almost surely exponential stability and instability are obtained. The conditions are based on the Lyapunov exponent, which in turn, depends on the associate invariant density. Concentrating on the case that the continuous component is two dimensional, using transformation techniques, differential equations satisfied by the invariant density associated with the Lyapunov exponent are derived. Conditions for existence and uniqueness of solutions are derived. Then numerical solutions are developed to solve the associated differential equations.     

基于Markov链的分布式仿真系统可用度研究

根据HLA仿真系统的特点及不同进程对仿真结果的重要程度，提出了分布式仿真系统的故障模型，并将仿真进程分为关键仿真进程和次要仿真进程；根据处理机是否在进行仿真运算，将处理机的计算时间分为有效时间和无效时间，并以此为基础定义了分布式仿真系统的可用度，然后利用Markov链分析了分别采用两级恢复策略和传统容错策略的分布式仿真系统的可用度。结果表明，在发生故障时，在将仿真节点重启时间算入恢复开销的前提下，两极恢复策略会降低系统的可用度，而传统容错策略由于可立即在备份机上进行故障恢复，所以可使系统获得更高的可用度。最后用一组数据验证了该结论的正确性。     

Discriminant analysis based on statistical depth

<正> In the past two decades,many statistical depth functions seemed as powerful exploratoryand inferential tools for multivariate data analysis have been presented.In this paper,a new depthfunction family that meets four properties mentioned in Zuo and Serfling(2000)is proposed.Then aclassification rule based on the depth function family is proposed.The classification parameter b couldbe modified according to the type-Ⅰ error α,and the estimator of b has the consistency and achievesthe convergence rate n~(-1/2).With the help of the proper selection for depth family parameter c,theapproach for discriminant analysis could minimize the type-Ⅱ error β.A simulation study and a realdata example compare the performance of the different discriminant methods.     

<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control for stochastic systems with Poisson jumps

This paper discusses the H _∞ control problem for a class of linear stochastic systems driven by both Brownian motion and Poisson jumps. The authors give the basic theory about stabilities for such systems, including internal stability and external stability, which enables to prove the bounded real lemma for the systems. By means of Riccati equations, infinite horizon linear stochastic state-feedback H _∞ control design is also extended to such systems.     

<Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript> disturbance attenuation for a class of time-delay Hamiltonian systems

This paper considers the problem of L ₂-disturbance attenuation for a class of time-delay port-controlled Hamiltonian systems. A γ-dissipative inequality is established by using a proper control law and a storage function. Then based on the Razumikhin stability theorem, a sufficient condition is proposed for the asymptotically stability of the closed-loop system. Finally, the authors investigate the case that there are time-invariant uncertainties belonging to some convex bounded polytypic domain and an L ₂ disturbance attenuation control law is proposed. Study of illustrative example with simulation shows that the presented method in this paper works very well in the disturbance attenuation of time-delay Hamiltonian systems.     

IMPROVED ROBUST H-INFINITY ESTIMATION FOR UNCERTAIN CONTINUOUS-TIME SYSTEMS

The design of full-order robust estimators is investigated for continuous-time polytopic uncertain systems. The main purpose is to obtain a stable linear estimator such that the estimation error system remains robustly stable with a prescribed H∞ attenuation level. Firstly, a simple alternative proof is given for an improved LMI representation of H∞ performance proposed recently. Based on the performance criterion which keeps the Lyapunov matrix out of the product of the system dynamic matrices, a sufficient condition for the existence of the robust estimator is provided in terms of linear matrix inequalities. It is shown that the proposed design strategy allows the use of parameterdependent Lyapunov functions and hence it is less conservative than the earlier results. A numerical example is employed to illustrate the feasibility and advantage of the proposed design.     

Simulating the supply disruption for the coordinated supply chain

There are many disruptive accidents in the supply chain operations system and achieving the coordination of supply chain is main objective for supply chain research. While disruptive accidents have increasingly influenced the coordinated operation of the supply chain, existing research literature on the supply chain coordination is setting in a stationary environment. The answer for how the disruptive accidents affect the coordinated supply chain is given in this paper. Based on the benchmark supply chain which is coordinated by the negative incentive mechanism, we study the impacts of supply disruption on the supply chain system by using simulation approach in which two different distribution function of random variable are used to express the supply disruption. Comparison between these two simulation results and possible coordination mechanism under the supply disruption are proposed. From the perspective of supply chain risk management, we provide the inspiration for the manager.     

H ∞ filtering for continuous-time systems with pointwise time-varying delay

The problem of H_∞filtering for continuous-time systems with pointwise time-varying delay is investigated in this paper.By applying an innovation analysis in Krein space,a necessary and sufficient condition for the existence of an H_∞filter is derived in two methods:One is the partial differential equation approach,the other is the reorganized innovation analysis approach.The former gives a solution to the proposed H_∞filtering problem in terms of the solution of a partial differential equation with boundary conditions.The later gives an analytical solution to the proposed H_∞filtering problem in terms of the solutions of Riccati and matrix differential equations.