Vagueness and Rough Location

This paper deals with the representation and the processing of information about spatial objects with indeterminate location like valleys or dunes (objects subject to vagueness). The indeterminacy of the location of spatial objects is caused by the vagueness of the unity condition provided by the underlying human concepts valley and dune. We propose the notion of rough, i.e., approximate, location for representing and processing information about indeterminate location of objects subject to vagueness. We provide an analysis of the relationships between vagueness of concepts, indeterminacy of location of objects, and rough approximations using methods of formal ontology. In the second part of the paper we propose an algebraic formalization of rough location, and hence, a formal method for the representation of objects subject to vagueness on a computer. We further define operations on those representations, which can be interpreted as union and intersection operations between those objects. The discussion of vagueness of concepts, indeterminacy of location, rough location and the relationships between these notions contributes to the theory about the ontology of geographic space. The formalization presented can provide the foundation for the implementation of vague objects and their location indeterminacy in GIS.     

On operations of soft sets

Soft set theory, proposed by Molodtsov, has been regarded as an effective mathematical tool to deal with uncertainties. In this paper, first we prove that certain De Morgan’s law hold in soft set theory with respect to different operations on soft sets. Then, we discuss the basic properties of operations on soft sets such as intersection, extended intersection, restricted union and restricted difference. Moreover, we illustrate their interconnections between each other. Also we define the notion of restricted symmetric difference of soft sets and investigate its properties. The main purpose of this paper is to extend the theoretical aspect of operations on soft sets.     

背景格的若干性质及其完备性证明*

背景在概念图理论中至关重要,其作用尤其体现在信息组织方面。借鉴形式概念分析的理论,用二元组表示形式背景,能够体现出形式背景的内涵与外延的统一。背景格是形式背景的一种组织形式,反映了形式背景之间的蕴涵关系,完备的背景格有着广阔的应用前景。介绍了背景格的定义及其构造方法,并给出了背景格的若干性质以及完备性证明。     

Contextualization as an independent abstraction mechanism for conceptual modeling

The notion of context appears in computer science, as well as in several other disciplines, in various forms. In this paper, we present a general framework for representing the notion of context in information modeling. First, we define a context as a set of objects, within which each object has a set of names and possibly a reference: the reference of the object is another context which “hides” detailed information about the object. Then, we introduce the possibility of structuring the contents of a context through the traditional abstraction mechanisms, i.e., classification, generalization, and attribution. We show that, depending on the application, our notion of context can be used as an independent abstraction mechanism, either in an alternative or a complementary capacity with respect to the traditional abstraction mechanisms. We also study the interactions between contextualization and the traditional abstraction mechanisms, as well as the constraints that govern such interactions. Finally, we present a theory for contextualized information bases. The theory includes a set of validity constraints, a model theory, as well as a set of sound and complete inference rules. We show that our core theory can be easily extended to support embedding of particular information models in our contextualization framework.     

利用OBDD编码的快速二值图算法(英文)

对利用有序二元判定图 OBDD 编码二值图像进行了研究,该方法可以节约大量的空间,并在此基础上,提出了各种二值图的算法,包括解码和集合运算(并、交、差、对称差、包含和互补)。实验结果表明这种基于OBDD 编码的方法比现有的二值图编码方法效率更高。     

An /spl omega/-automata approach to the representation of bilevel images

We use /spl omega/-automata (i.e., automata over infinite words) as a device for representing bilevel images. A major advantage of our approach, as opposed to using the conventional finite automata, lies in that /spl omega/-automata are capable of representing image objects of zero size, such as lines and points. To demonstrate the feasibility of our approach, we also show how a number of image processing operations, including shift, flip, rotation, complement, boundary, difference, union, intersection, and size, can be effectively carried out in the framework of /spl omega/-automata. In particular, the size of an image represented by an /spl omega/-automaton is measured based on the theory of Markov chains. In comparison with other automata-based image representation schemes reported in the literature, our approach is capable of supporting a richer set of operations, which can be performed on the automata directly and easily.     

Neighborhood and associative query answering

Cooperative query answering extends the classical notion of query answering to provide neighborhood and associated information. Neighborhood query answering relaxes the query and its answer via abstract representations. To integrate the abstraction view with the subsumption (is-a) and composition (part-of) views of type hierarchy, the notion of type abstraction hierarchy is introduced. To evaluate and control query relaxation, a nearness measure mechanism is provided. Associative query answering provides information conceptually related to, but not explicitly asked by the query. As object association is context sensitive, a DB-Pattern-KB framework is developed that couples domain-specific knowledge and participating objects in localized problem domains via virtual database patterns. Associative query answering can then be accomplished through tracing the behavior dependencies among cooperating objects in those problem domains. Such a framework allows related databases and knowledge bases to be linked dynamically in various contexts yet be maintained relatively independent of each other. The proposed approach has been implemented in the cooperative database system tested, CoBase, at UCLA. Our experience reveals that the proposed techniques are effective for cooperative query answering.This research is supported by DARPA contract N00174-91-C-0107.     

Using roles in Java

Using roles in object‐oriented design leads to a more natural representation of a given problem domain. Despite a lot of research into role–based systems, there is still a gap between conceptual representations of roles and the usage of roles in strongly typed object‐oriented programming languages such as C++ or Java. Since these languages associate classes and their instances exclusively and permanently, representing evolving objects that may take on different roles over time is difficult without special support: (i) entities must be reclassified any time they evolve and (ii) class hierarchies may grow exponentially if entities may take on several independent roles. This article shows how role hierarchies can be easily implemented in Java. It introduces the Java Role Package, which provides a set of classes to support handling of evolving objects without modifying the semantics of Java itself. Copyright © 2004 John Wiley & Sons, Ltd.     

Modeling vague spatial data warehouses using the VSCube conceptual model

Although many real world phenomena are vague and characterized by having uncertain location or vague shape, existing spatial data warehouse models do not support spatial vagueness and then cannot properly represent these phenomena. In this paper, we propose the VSCube conceptual model to represent and manipulate shape vagueness in spatial data warehouses, allowing the analysis of business scores related to vague spatial data, and therefore improving the decision-making process. Our VSCube conceptual model is based on the cube metaphor and supports geometric shapes and the corresponding membership values, thus providing more expressiveness to represent vague spatial data. We also define vague spatial aggregation functions (e.g. vague spatial union) and vague spatial predicates to enable vague SOLAP queries (e.g. intersection range queries). Finally, we introduce the concept of vague SOLAP and its operations (e.g. drill-down and roll-up). We demonstrate the applicability of our model by describing an application concerning pest control in agriculture and by discussing the reuse of existing models in the VSCube conceptual model.     

Closure of Boolean operations on geometric entities

Boolean operations akin to set interaction, union, and difference play an imporatant role in CAD/CAM. Geometric entities of practical interest (e.g. polygons or polyhedra) are not algebraically closed under the conventional set operators, and therefore algorithms cannot implement conventional set operations if they are to produce results that can be used in subsequent calculations. This paper demonstrates that closure raises delicate issues, and presents a correct mathematical approach based on the topological notion of regularity.     

Accountability of work activity in high-consequence work systems: human error in context

Organizational context is now accepted as a central concept in attempts to understand error in human–machine systems. However, accounts which emphasize the processes of everyday organizing, such as accountability and work activity, are needed in order to establish organizational requirements for design. In this article, we provide a framework for the consideration of organizational contexts of human error in high-consequence work systems, with a view to integrating empirical insights and supporting practical design work. We draw on computer-supported cooperative work conceptualizations of the process of everyday organizing, particularly the notion of “accountability for work activity” which is pivotal to our organizational account of error. The conceptual framework is characterized here as a set of dimensions which are expressive concerning the relationship between accountability and work activity in different contexts: (1) explicit–implicit; (2) global–local; (3) stable–transient and (4) dependent–independent. The framework is demonstrated with respect to everyday work practices in a radiology department and its analytical utility validated with respect to two documented aviation system failures. Applying the framework has enabled us to identify and define, in terms of the dimensions, a number of contexts for vulnerability in high-consequence systems: contexts for collusion, violation, deference, loss of control, buck passing and complacency. These are discussed in terms of requirements for error-tolerant design. In the final section of the article, links between the various contexts for vulnerability and the design process are explored.     

Continuous–discrete confidence interval observer – Application to vehicle positioning

In vehicle positioning applications, the confidence level in the position and velocity estimates can be even more significant than accuracy. In this study, a probabilistic interval method is proposed, which combines, through union and intersection operations, the information from a possibly uncertain predictor (the vehicle model) and measurement sensors. The proposed method is compared to Kalman filtering and to guaranteed interval estimation in the context of railway vehicles where security is the key objective.     

Utilization of data access and manipulation in conceptual schema definitions

The basic idea of this approach is to use data access and manipulation functions in data definition, such that testing a given individual data object on its conformance to data definition is done by running a (finally boolean) procedure against it. In essence, schema entries (i.e. definitions, declarations, etc.) are viewed as expressions of predicate logic where the individuals are obtained by the execution of data manipulation operations which include a rather general information selection technique or conceptual access method.Selection of information constructs in databases usually adopts a technique closely tailored to the specific “data model”. It is one of the intentions of this paper to demonstrate the common principles behind the variety of selection techniques by a uniform approach which comprises the selection features of most of the database management systems and makes them comparable.At the level of information structure a kind of “geography” is introduced into a database, which allows to distinguish the same information construct (record, file, segment, item, coset, tuple,…) in distinct information contexts or at distinct conceptual locations called “spots”. By definition, every spot (“construct in/with context”) exists only once in a given database. In combination with some basic operators a logical addressing mechanism has been designed, which follows the context of a construct to identify it within this very context. This algorithm turns out to be a general vehicle to locate a construct at a spot, independently of whether the database has a relational, network, hierarchical or any other appearance.The method of context directed addressing along with pertinent operators allows in a very general way—i.e. neither biased nor restricted to a “data model”—to define types of information constructs and of construct transitions as is required in a conceptual community schema. This is demonstrated through examples of schema entries with rather complex cross-consistency conditions and additional transition rules called persistency conditions. The examples also intend to give an idea of the minimum support to be expected from any future conceptual schema language.     

双极值模糊软集

提出了双极值模糊软集的概念,给出双极值模糊软集的补、并、交、"且"及"或"运算,并讨论了它们的性质。     

语言标记Vague集及其应用

为了解决不确定环境有时不能提供给Vague集的真、假隶属度以精确数字值的问题, 文中提出了语言标记Vague(Linguistic Label Vague,LLV)集.其论域对象的真、假隶属度均是 意义为模糊集的语言标记.文中还定义了LLV集的补、并、交和包含运算.作为应用,构造了LLV 决策表;获取了LLV决策规则;通过LLV集包含程度和相交程度度量了规则的强度,用LLV值 记分函数对强度排序.仿真结果表明:LLV集有时比Vague集更为现实地表示不精确信息.     

概念格的分布处理研究

概念格和形式背景是一一对应的，概念格的分布处理必然涉及到形式背景的处理．定义了形式背景问的横向和纵向合并运算，讨论了同域背景间的三种不同的关系，特别提出一种新颖的属性相似度方法来处理背景间的不一致关系，把不一致的形式背景转换为一致背景或独立背景；还定义了概念、概念格间的基本运算，并证明了纵向合并的子背景的概念格和子背景所对应的子概念格的并是同构的，这样就奠定了概念格分布处理的理论基础，为概念格的分布并行构造提供了依据．     

Logical foundations for representing object-oriented systems

Abstract

Object-oriented programming languages are designed for computing or simulating the behaviour of interacting objects, but their encapsulated contexts and procedural methods are not well suited to non-procedural techniques in theorem provers, optimizers, and automated design and analysis tools. Logic is the non-procedural system par excellence, but the predicate calculus notation for logic is awkward for representing and reasoning about encapsulated contexts. Conceptual graphs are a graphic system of logic that is better suited to O-O systems. First, they explicitly represent the contexts that are ignored or obscured in predicate calculus. Second, Peirce's rules of inference for reasoning with graphs are explicitly formulated in terms of contexts and the conditions for importing and exporting information from contexts. This article describes the context mechanisms of conceptual graphs, the rules of inference for reasoning with the graphs, and their use as a design language for object-oriented systems.     

A novel approach towards bipolar complex fuzzy sets and their applications in generalized similarity measures

The notions of the bipolar complex fuzzy set (BCFS) and complex bipolar fuzzy set (CBFS) have been already given, but these notions of BCFS and CBFS have the problem that they contradict the basic definition of the complex numbers which we discussed in this article, and then we defined the new definition of BCFS. Our defined notion of BCFS is more closed to bipolarity as compared with already existing BCFS and CBFS, and more accurate. BCFS is the fusion of bipolar fuzzy set (BFS) which a decision analyst needs to describe the positive and negative aspects of an object and complex fuzzy set (CFS) which a decision analyst needs to handle two-dimensional (two variables) information. When there is information of two variables with positive and negative aspects then a decision analyst needs BCFS to handle this information. In this article, we also interpreted some basic operations on BCFS like a complement, intersection, and union and explained them with the help of examples. Additionally, we defined the concept of type-1 partially BCFS and type-2 partially BCFS. Further, we interpreted some generalized trigonometric similarity measures such as generalized cosine similarity measure, generalized tangent similarity measure, generalized cotangent similarity measure, and generalized hybrid trigonometric similarity measure for BCFS. The weighted generalized trigonometric similarity measures are also presented in this article. After that, we applied these similarity measures (SMs) in two real-life applications (pattern recognition and medical diagnosis) to show the benefits and advantages of our proposed SMs. Finally, we did a comparison of our demonstrated SMs with some existing SMs to show the superiority, usefulness, and effectiveness of our proposed SMs.