Generalized theory of uncertainty (GTU)—principal concepts and ideas

Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitantly, existing theories of uncertainty are based on probability theory. The generalized theory of uncertainty (GTU) departs from existing theories in essential ways. First, the thesis that information is statistical in nature is replaced by a much more general thesis that information is a generalized constraint, with statistical uncertainty being a special, albeit important case. Equating information to a generalized constraint is the fundamental thesis of GTU. Second, bivalence is abandoned throughout GTU, and the foundation of GTU is shifted from bivalent logic to fuzzy logic. As a consequence, in GTU everything is or is allowed to be a matter of degree or, equivalently, fuzzy. Concomitantly, all variables are, or are allowed to be granular, with a granule being a clump of values drawn together by a generalized constraint. And third, one of the principal objectives of GTU is achievement of NL-capability, that is, the capability to operate on information described in natural language. NL-capability has high importance because much of human knowledge, including knowledge about probabilities, is described in natural language. NL-capability is the focus of attention in the present paper. The centerpiece of GTU is the concept of a generalized constraint. The concept of a generalized constraint is motivated by the fact that most real-world constraints are elastic rather than rigid, and have a complex structure even when simple in appearance. The paper concludes with examples of computation with uncertain information described in natural language.     

混合关系中的函数依赖及其相关规则

在实际应用中有这样一类关系数据库,其中数据项在某个属性上的取值本身又是一个关系。讨论这种混合关系中的函数依赖及其相应的相关规则具有一定的理论意义和实际应用价值。给出这种混合关系的形式定义、混合关系中4种类型的函数依赖关系以及相应的4种类型的相关规则;并给出混合关系到一般关系的转换,通过这个转换说明了混合关系与普通关系的联系及其差别。给出一个实际应用中的例子,来说明混合关系中的函数依赖和相关规则的形式多样性。     

Monotonic and nonmonotonic gentzen deduction systems for L3-valued propositional logic

A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L₃-valued propositional logic, a multisequent is a triple Δ|Θ|Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. Correspondingly there is a sound and complete Gentzen deduction system G for multisequents which is monotonic. Dually, a comultisequent is a triple Δ : Θ : Γ, which is valid if there is an assignment v in which each formula in Δ has truth-value≠t, each formula in Θ has truth-value≠m, and each formula in Γ has truth-value≠f. Correspondingly there is a sound and complete Gentzen deduction system G⁻ for co-multisequents which is nonmonotonic.     

An efficient distributed algorithm for detection of knots and cycles in a distributed graph

Knot detection in a distributed graph is an important problem and finds applications in deadlock detection in several areas such as store-and-forward networks, distributed simulation, and distributed database systems. This paper presents an efficient distributed algorithm to detect if a node is part of a knot in a distributed graph. The algorithm requires 2e messages and a delay of 2(d+1) message hops to detect if a node in a distributed graph is in a knot (here, e is the number of edges in the reachable part of the distributed graph and d is its diameter). A significant advantage of this algorithm is that it not only detects if a node is involved in a knot, but also finds exactly which nodes are involved in the knot. Moreover, if the node is not involved in a knot, but is only involved in a cycle, then it finds the nodes that are in a cycle with that node. We illustrate the working of the algorithm with examples. The paper ends with a discussion on how the information about the nodes involved in the knot can be used for deadlock resolution and also on the performance of the algorithm.     

Stability analysis of PWM feedback control systems with PID regulators

Stability analysis is of great significance in those feedback control systems in which the power amplifier is operated as a pulse-modulator device, since under these circumstances the whole control system is highly non-linear. Stability in PWM feedback control systems with a proportional type regulator has been amply described in the literature. Only recently, however, have such studies been extended to include systems with a proportional-plus-integral regulator. In this paper the problem is considered for the case involving a PWM control system, where the regulator is a proportional-plus-integral-plus-derivative, the PWM modulator is of a very general type and the controlled process is of arbitrary order. The stability of the system is analysed by means of a discrete version of the second Lyapunov method ; this method in turn leads to an investigation of the positivity region of a quadratic form defined in the parameter space of the regulator. To improve the stability region obtained, a procedure is investigated whereby only a few parameters of the quadratic Lyapunov function need to be varied. The method proposed has proved extremely simple and flexible to apply, even in cases where the system is of arbitrary order.     

基于角色和范围的通用管理系统的设计与实现

用户管理系统是Web应用系统及大型软件系统的重要组成部分。在目前已有的用户管理系统中,角色只是权限的集合,不涉及管辖范围,是一个一维空间上的概念。该文提出一种二维角色的概念,是由权限和范围组成的二元对集合,是一个二维空间上的概念。构建一个基于二维角色的通用用户管理模型,设计一个通用用户管理系统,能满足现代Web应用系统和大型软件系统对用户授权的多层次和多空间的要求。     

Partial shape recognition: a landmark-based approach

A method of recognizing partially occluded objects is presented in which each object is represented by a set of landmarks. Given a scene consisting of partially occluded objects, a model object in the scene is hypothesized by matching the landmarks of the model with those in the scene. A measure of similarity between two landmarks is needed to perform this matching. A local shape measure, sphericity, is introduced. It is shown that any invariant function under a similarity transformation is a function of the sphericity. To match landmarks between the model and the scene, a table of compatibility is constructed. A technique, known as hopping dynamic programming, is described to guide the landmark matching through the compatibility table. The location of the model in the scene is estimated with a least-squares fit among the matched landmarks. A heuristic measure is then computed to decide if the model is in the scene     

多维QoS在基于MOM的QoS管理模型中的应用

服务质量QoS管理是满足分布式环境中端到端QoS需求的关键,而中间件是一种分布式系统中的主要交互平台.首先对中间件和QoS的相关概念进行介绍,在分析传统QoS管理模型的基础上,提出一种基于消息中间件(MOM)的QoS管理模型,重点分析多维QoS在该模型中的应用,最后结合一个实例说明多维QoS在实际系统中的应用.     

圆环面上纤维轨迹的计算机辅助设计

曲面上的曲线造型是计算机图形领域的一个新的研究热点,而且它们在纤维织物编织,三维服装裁剪以及复合材料的纤维缠绕轨迹设计等领域有十分广泛的应用,为了解决圆环面上纤维轨迹的计算机辅助设计问题,研究了圆环面上测地线的解析解以及拟测地线数值求解的具体算法并给出了其表达式,测地线是曲面上两点之间最短距离的曲线段,在一般曲面上没有解析解,但是在圆环面上却可求出其精确的解析解,但在曲面的边沿部分,测地线因不能实现自然的折返过渡,于是拟测地线就被引进到曲面上的曲线造型设计之中,在拟测地线分析研究基础上,给出了圆环面上拟测地线的方程及数值解法,通过其在一个实例中的应用结果证明,该方法可获得织物的纺织条纹以及缠绕物体的纤维轨迹。     

Fuzzy logic = computing with words

As its name suggests, computing with words (CW) is a methodology in which words are used in place of numbers for computing and reasoning. The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa. Thus, as an approximation, fuzzy logic may be equated to CW. There are two major imperatives for computing with words. First, computing with words is a necessity when the available information is too imprecise to justify the use of numbers, and second, when there is a tolerance for imprecision which can be exploited to achieve tractability, robustness, low solution cost, and better rapport with reality. Exploitation of the tolerance for imprecision is an issue of central importance in CW. In CW, a word is viewed as a label of a granule; that is, a fuzzy set of points drawn together by similarity, with the fuzzy set playing the role of a fuzzy constraint on a variable. The premises are assumed to be expressed as propositions in a natural language. In coming years, computing with words is likely to evolve into a basic methodology in its own right with wide-ranging ramifications on both basic and applied levels     

Two dimensional shape optimization using partial control and finite element method for compressible flows

The objective of this study is to determine the two dimensional shape of a body located in a compressible viscous flow, where the applied fluid force is minimized. The formulation to obtain the optimal shape is based on an optimal control theory. An optimal state is defined as a state, in which the performance function defined as the integration of the square sum of the applied fluid forces is minimized due to a reduction in the applied fluid forces. Compressible Navier–Stokes equations are treated as constraint equations. In other words, the body is considered to have a shape that minimizes the fluid forces under the constraint of the Navier–Stokes equations. The gradient of the performance function is computed using the adjoint variables. A weighted gradient method is used as the minimization algorithm. The volume of the body is assumed to be the same as that of the initial body. In the case of the algorithm used in this study, both the creation of a structured mesh around the surface of the body and the smoothing procedure are employed for the computation of gradient. In this study, a remeshing technique based on the structured mesh around the body changing its configuration in the iteration cycle is employed. For the correction to keep the volume constant, the surface coordinates are moved along the radial direction. For the discretization of both the state and adjoint equations, the efficient bubble function interpolation presented previously by the authors [18] is employed. The algorithm, which is known as the partial control algorithm, is applied to the numerical procedure to determine the movement of the coordinates. In the case of the gradient method, in order to avoid the convergence of the final shape to the local minimum shape, the new algorithm, which is called the partial control algorithm, is presented in this study. In numerical studies, the shape determination of a body in a uniform flow field is carried out in 2D domains. The initial shape of the body is assumed to be an elliptical cylinder. The shape is modified by minimizing the applied fluid forces. Finally, the desired shape of a body, whose performance function is reduced and converged to a constant value, is obtained. By carrying out a procedure that involves the use of the partial control algorithm, the desired shape of a body, whose performance function is reduced further, is obtained. Stable shape determination of a body in a compressible viscous flow is carried out by using the presented method. It is indicated that the optimal shape can be obtained by using the partial control algorithm.     

K(Knowledge)-net: building up and its dynamics

The essence of intelligence is to use certain abilities to obtain knowledge, to use that knowledge, and to operate with that knowledge. New knowledge learned by a human is often related to old existing knowledge, and sometimes we could have more conceptual knowledge based on old knowledge. So, the knowledge in the brain exists in a related structural form, and this structure is dynamic, and therefore is evolvable. Based on the understanding of the real process of learning by a human being, we discuss how to make a model to describe the dynamic structure of knowledge. This model is also a principle of artificial brain design. Most of the knowledge a child learns is from natural language and perception information, and we define this as semantic knowledge. The model to describe the process and structure of knowledge growing in a network form is called a K-net. It is a dynamic network with two main dynamics: one is new knowledge added, and the other is aggregating knowledge existing in the network with some probability. Under these very natural conditions, we found that the network is originally a simple random net, and then some characteristics of a complex network gradually appear when more new knowledge is added and aggregated. A more interesting phenomenon is the appearance of a random hierarchical structure. Does this mean emergence?     

Optimal number of minimal repairs with cumulative repair cost limit for a two-unit system with failure rate interactions

A discrete replacement model is presented that includes a cumulative repair cost limit for a two-unit system with failure rate interactions between the units. We assume a failure in unit 1 causes the failure rate in unit 2 to increase, whereas a failure in unit 2 causes a failure in unit 1, resulting in a total system failure. If unit 1 fails and the cumulative repair cost till to this failure is less than a limit L, then unit 1 is repaired. If there is a failure in unit 1 and the cumulative repair cost exceeds L or the number of failures equals n, the entire system is preventively replaced. The system is also replaced at a total failure, and such replacement cost is higher than the preventive replacement cost. The long-term expected cost per unit time is derived using the expected costs as the optimality criterion. The minimum-cost policy is derived, and existence and uniqueness are proved.     

Redundancy and data compression in recursive estimation

The problem of the existence of redundancy in the data in a recursive estimation problem is investigated. Given a certain data rate, should the estimator be run at the same rate? It is shown that under certain conditions there is redundancy in the data and the estimator can be run at a lower rate using compressed data with practically the same performance as when no data compression is utilized. It is also pointed out that, although at the higher rate there is redundancy in the data, the performance deteriorates noticeably when the data rate is lowered. Conditions for the existence of redundancy in the data and the procedure to remove it are presented. The procedure to compress the data is obtained such as to preserve the information in the sense of Fisher. The effect of data compression is a reduction in the computation requirements by a factor equal to the compression ratio. Such a reduction might be important in real-time applications in which the computing power is limited or too expensive. The application of this technique to the tracking of a reentry vehicle with a linearized filter is discussed in more detail and simulation results are presented.     

Distributed multi-join query processing in data grids

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.     

Attribute reduction based on evidence theory in incomplete decision systems

Attribute reduction is a basic issue in knowledge representation and data mining. This paper deals with attribute reduction in incomplete information systems and incomplete decision systems based on Dempster-Shafer theory of evidence. The concepts of plausibility reduct and belief reduct in incomplete information systems as well as relative plausibility reduct and relative belief reduct in incomplete decision systems are introduced. It is shown that in an incomplete information system an attribute set is a belief reduct if and only if it is a classical reduct and a plausibility consistent set must be a classical consistent set. In a consistent incomplete decision system, the concepts of relative reduct, relative plausibility reduct, and relative belief reduct are all equivalent. In an inconsistent incomplete decision system, an attribute set is a relative plausibility reduct if and only if it is a relative reduct, a plausibility consistent set must be a belief consistent set, and a belief consistent set is not a plausibility consistent set in general.     

From CSP models to Markov models

It is shown how a probabilistic dependability model of a safety-critical system can be derived from a trace-based functional model of the system. The functional model is a communicating sequential process (CSP) that includes command, failure, and repair events. The dependability model is a time homogeneous Markov process with transitions determined by these events. The method applies to deterministic systems that can be described in terms of a finite number of states and in which all event occurrences are stochastic with exponential time distribution. The derivation is carried out in two steps. An algorithmic determination is made of a finite automaton from the specification of the CSP process. The automaton is transformed into a Markov process. The Markov model for this system is used to determine the waiting time to terminal failure. The theory is applied to a larger and more realistic example: a gas burner system operating in the on-off mode. For this system, the waiting time to terminal failure is calculated, and the number of failures per year in a large population of identical, independently operated systems is estimated     

Visiting Byzantine Agreement underlying Ad Hoc environment

The Mobile Ad Hoc Network (MANET) has become more popular because the MANET is a self-organizing, self-configuring, and an instantly deployable multi-hop wireless network that responds to application needs without any fixed infrastructure. Moreover, the MANET is fault-tolerant and reliable. A mechanism is needed in the MANET that allows a set of nodes to agree on a common value. The distributed Byzantine Agreement (BA) problem is one of the most important issues in designing a fault-tolerant system. In many cases, reaching a common agreement among fault-free nodes in coping with the influence from faulty components is crucial in a fault-tolerant system. When a common agreement is achieved, all fault-free nodes in the system can produce stable results without any influence from the faulty components. In this study, the BA problem is visited in a MANET, in which the components are subject to a malicious fault. The proposed protocol can tolerate the maximum number of allowable faulty nodes using a minimum number of message exchange rounds. Each fault-free node can reach a common agreement value for the BA problem in a MANET. The text was submitted by the authors in English.     

基于多视点的需求工程方法

1 引言视点其实是集体工作的一个普遍特性:不同的人对于要协作完成的工作,很自然地,会从他们所处的角度有自己的不同于他人的看法。视点是指主体(agent)和主体的视图(view)。软件开发过程中,比如在建立或描述一个复杂的系统模型时,通常需要许多主体的参与。同时,也要求主体对系统相关信息的收集尽可能完全,特别是那些关系到系统成败的关键信息。视点技术在定义好的系统结构的基础上有机地分配给开发人员以不同的职责,从而使得不同的参与者都能够从一个适当的角度观察这个系统,即论域,得到各自的透视(perspective)或视图,例如安全视图、体系结构视图、     

A type system for logic programs

A theory for a type system for logic programs is developed which addressesthe question of well-typing, type inference, and compile-time and run-time type checking. A type is a recursively enumerable set of ground atoms, which is tuple-distributive. The association of a type to a program is intended to mean that only ground atoms that are elements of the type may be derived from the program. A declarative definition of well-typed programs is formulated, based on an intuitive approach related to the fixpoint semantics of logic programs. Whether a program is well typed is undecidable in general. We define a restricted class of types, called regular types, for which type checking is decidable. Regular unary logic programs are proposed as a specification language for regular types. An algorithm for type-checking a logic program with respect to a regular type definition is described, and its complexity is analyzed. Finally, the practicality of the type system is discussed, and some examples are shown. The type system has been implemented in FCP for FCP and is incorporated in the Logix system.