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.     

形式概念分析对粗糙集理论的表示及扩展

侧重于建立形式概念分析与粗糙集之间融合的理论基础.利用形式概念分析中名义梯级背景(nominal scale)的概念,对信息系统进行平面梯级(plain scaling)得到了衍生的形式背景.证明了粗糙集理论中的划分、上下近似、独立、依赖、约简等核心概念都可以在相应的衍生背景中进行表示.揭示了粗糙集理论在分析处理数据时的局限性,指出了利用梯级的方法可以扩展粗糙集理论.     

Counterpoint in the Visual Arts. A Perspective Based on my Graphical and Sculptural Work

Counterpoint is a concept which has its roots in music, where it refers, loosely speaking, to the simultaneous presence of musical lines which complement one another, at times converging and at other moments evolving into a relationship of contrast. In this paper I use the notion of counterpoint in a visual context. I conjecture that such an extended use is meaningful, and explain this for graphical work as well as for sculptures. I take the freedom to illustrate this with some of my own artwork.     

An approach to engineering the requirements of data warehouses

We focus exclusively on the issue of Requirements engineering for Data Warehouses (DW). Our position is that the information content of a DW is found in the larger context of the goals of an organization. We refer to this context as the organizational perspective. Goals identify the set of decisions that are relevant which in turn help in determining the information needed to support these. The organizational perspective is converted into the technical perspective, which deals with the set of decisions to be supported and the information required. The latter defines Data warehouse contents. To elicit the technical perspective, we use the notion of an informational scenario. It is a typical interaction between a DW system and the decision maker and consists of a sequence of pairs of the form, <information request, response>. We formulate an information request as a statement in an adapted form of SQL called Specification SQL. The proposals here are implemented in the form of an Informational Scenario Engine that processes informational scenarios and determines Data Warehouse Information Contents.     

Modelling of menu design in computerized work

The objective of the research was to propose and validate a theoretically meaningful link between three constructs of hierarchical menu design: menu dimension, task complexity, and user knowledge structure. Twenty-four subjects participated in a nested factorial experiment. The subjects performed a menu retrieval task using a hierarchical menu system constructed for use in the domain of utility boiler control. The dependent variables were time to respond and accuracy. The independent variables were menu dimension, task complexity and user knowledge structure. Four hypotheses were tested. The foundation of the hypotheses was based upon the premise that when task complexity is low, the short-term memory requirements of the menu retrieval task are low. Thus, the user's knowledge structure will not affect performance because it is not required for the chunking of visual information. The objectives of this research were met and are presented in the context of an information processing model for psychomotor tasks.     

Representational information: a new general notion and measure of information

In what follows, we introduce the notion of representational information (information conveyed by sets of dimensionally defined objects about their superset of origin) as well as an original deterministic mathematical framework for its analysis and measurement. The framework, based in part on categorical invariance theory [30], unifies three key constructs of universal science - invariance, complexity, and information. From this unification we define the amount of information that a well-defined set of objects R carries about its finite superset of origin S, as the rate of change in the structural complexity of S (as determined by its degree of categorical invariance), whenever the objects in R are removed from the set S. The measure captures deterministically the significant role that context and category structure play in determining the relative quantity and quality of subjective information conveyed by particular objects in multi-object stimuli.     

Contextualized mobile recommendation service based on interactive social network discovered from mobile users

Personal context is the most significant information for providing contextualized mobile recommendation services at a certain time and place. However, it is very difficult for service providers to be aware of the personal contexts, because each person’s activities and preferences are very ambiguous and depending on numerous unknown factors. In order to deal with this problem, we have focused on discovering social relationships (e.g., family, friends, colleagues and so on) between people. We have assumed that the personal context of a certain person is interrelated with those of other people, and investigated how to employ his neighbor’s contexts, which possibly have a meaningful influence on his personal context. It indicates that we have to discover implicit social networks which express the contextual dependencies between people. Thereby, in this paper, we propose an interactive approach to build meaningful social networks by interacting with human experts. Given a certain social relation (e.g., isFatherOf), this proposed systems can evaluate a set of conditions (which are represented as propositional axioms) asserted from the human experts, and show them a social network resulted from data mining tools. More importantly, social network ontology has been exploited to consistently guide them by proving whether the conditions are logically verified, and to refine the discovered social networks. We expect these social network is applicable to generate context-based recommendation services. In this research project, we have applied the proposed system to discover the social networks between mobile users by collecting a dataset from about two millions of users.     

Purpose based access control for privacy protection in relational database systems

In this article, we present a comprehensive approach for privacy preserving access control based on the notion of purpose. In our model, purpose information associated with a given data element specifies the intended use of the data element. A key feature of our model is that it allows multiple purposes to be associated with each data element and also supports explicit prohibitions, thus allowing privacy officers to specify that some data should not be used for certain purposes. An important issue addressed in this article is the granularity of data labeling, i.e., the units of data with which purposes can be associated. We address this issue in the context of relational databases and propose four different labeling schemes, each providing a different granularity. We also propose an approach to represent purpose information, which results in low storage overhead, and we exploit query modification techniques to support access control based on purpose information. Another contribution of our work is that we address the problem of how to determine the purpose for which certain data are accessed by a given user. Our proposed solution relies on role-based access control (RBAC) models as well as the notion of conditional role which is based on the notions of role attribute and system attribute.     

A theory of contexts in information bases

Although semantic data models provide expressive conceptual modeling mechanisms, they do not support context, i.e. providing controlled partial information on conceptual entities by viewing them from different viewpoints or in different situations. In this paper, we present a model for representing contexts in information bases along with a set of operations for manipulating contexts. These operations support context creation, update, copy, union, intersection, and difference. In particular, our operations of context union, intersection, and difference are different from those of set theory as they take into account the notion of context. However, they also satisfy the important properties of commutativity, associativity, and distributivity. Our model contributes to the efficient handling of information, especially in distributed, cooperative environments, as it enables (i) representing (possibly overlapping) partitions of an information base; (ii) partial representations of objects, (iii) flexible naming (e.g. relative names, synonyms and homonyms), (iv) focusing attention, and (v) combining and comparing different partial representations. This work advances towards the development of a formal framework intended to clarify several theoretical and practical issues related to the notion of context. The use of context in a cooperative environment is illustrated through a detailed example.     

Learning semantically-annotated routes for context-aware recommendations on map navigation systems

Modern technology has brought many changes to our everyday lives. Our need to be in constant touch with others has been met with the cellphone, which has become our companion and the convergence point of many technological advances. The combination of capabilities such as browsing the Internet and GPS reception has multiplied the services and applications based on the current location of the user. However, providing the user with these services has certain drawbacks. Although map navigation systems are the most meaningful way of displaying this information, the user still has to manually set up the filter in order to obtain a non-bloated visualization of the map and the available services. To tackle this problem, we present here a semantic multicriteria ant colony algorithm capable of learning the user's routes, including associated context information, and then predicting the most likely route a user is following, given his current location and context data. This knowledge could then be used as the basis for offering services related to his current (or most likely future) context data close to the path he is following. Our experimental results show that our algorithm is capable of obtaining consistent solutions sets even when multiple objective ontological terms are included in the process.     

Attribute selection with fuzzy decision reducts

Rough set theory provides a methodology for data analysis based on the approximation of concepts in information systems. It revolves around the notion of discernibility: the ability to distinguish between objects, based on their attribute values. It allows to infer data dependencies that are useful in the fields of feature selection and decision model construction. In many cases, however, it is more natural, and more effective, to consider a gradual notion of discernibility. Therefore, within the context of fuzzy rough set theory, we present a generalization of the classical rough set framework for data-based attribute selection and reduction using fuzzy tolerance relations. The paper unifies existing work in this direction, and introduces the concept of fuzzy decision reducts, dependent on an increasing attribute subset measure. Experimental results demonstrate the potential of fuzzy decision reducts to discover shorter attribute subsets, leading to decision models with a better coverage and with comparable, or even higher accuracy.     

Information-based complexity of uncertainty sets in feedbackcontrol

A notion of information-based complexity is introduced to characterize complexities of plant uncertainty sets in feedback control settings, and to understand relationships between identification and feedback control in dealing with uncertainty. This new complexity measure extends the Kolmogorov entropy to problems involving information acquisition (identification) and processing (control), and provides a tangible measure of “difficulty” of an uncertainty set of plants. In the special cases of robust stabilization for systems with either gain uncertainty or unstructured additive uncertainty, the complexity measures are explicitly derived     

Learning indistinguishability from data

 In this paper we revisit the idea of interpreting fuzzy sets as representations of vague values. In this context a fuzzy set is induced by a crisp value and the membership degree of an element is understood as the similarity degree between this element and the crisp value that determines the fuzzy set. Similarity is assumed to be a notion of distance. This means that fuzzy sets are induced by crisp values and an appropriate distance function. This distance function can be described in terms of scaling the ordinary distance between real numbers. With this interpretation in mind, the task of designing a fuzzy system corresponds to determining suitable crisp values and appropriate scaling functions for the distance. When we want to generate a fuzzy model from data, the parameters have to be fitted to the data. This leads to an optimisation problem that is very similar to the optimisation task to be solved in objective function based clustering. We borrow ideas from the alternating optimisation schemes applied in fuzzy clustering in order to develop a new technique to determine our set of parameters from data, supporting the interpretability of the fuzzy system.     

Cleaning the spurious links in data

Data quality problems can arise from abbreviations, data entry mistakes, duplicate records, missing fields, and many other sources. These problems proliferate when you integrate multiple data sources in data warehousing, federated databases, and global information systems. A newly discovered class of erroneous data is spurious links, where a real-world entity has multiple links that might not be properly associated with it. The existence of such spurious links often leads to confusion and misrepresentation in the data records representing the entity. Although the data set is well known for its high-quality bibliographic information, collecting and maintaining the data from diverse sources requires enormous effort. Errors, including spurious links, are inevitable. To solve this problem, we use context information to identify spurious links. First, we identify data records that contain potential spurious links. We then determine the set of attributes that constitute each record's context. Experiments with three real-world databases have demonstrated that our approach can accurately identify spurious links. Comparing context information between data records can help solve the data quality problem of spurious links-that is, multiple links between data entries and real-world entities.     

A logic for reasoning with inconsistency

Most known computational approaches to reasoning have problems when facing inconsistency, so they assume that a given logical system is consistent. Unfortunately, the latter is difficult to verify and very often is not true. It may happen that addition of data to a large system makes it inconsistent, and hence destroys the vast amount of meaningful information. We present a logic, called APC (annotated predicate calculus; cf. annotated logic programs of [4, 5]), that treats any set of clauses, either consistent or not, in a uniform way. In this logic, consequences of a contradiction are not nearly as damaging as in the standard predicate calculus, and meaningful information can still be extracted from an inconsistent set of formulae. APC has a resolution-based sound and complete proof procedure. We also introduce a novel notion of epistemic entailment and show its importance for investigating inconsistency in predicate calculus as well as its application to nonmonotonic reasoning. Most importantly, our claim that a logical theory is an adequate model of human perception of inconsistency, is actually backed by rigorous arguments.A preliminary report on this research appeared in LICS'89.Work of M. Kifer was supported in part by the NSF grants DCR-8603676, IRI-8903507.Work of E. L. Lozinskii was supported in part by Israel National Council for Research and Development under the grants 2454-3-87, 2545-2-87, 2545-3-89 and by Israel Academy of Science, grant 224-88.     

Nonterminal complexity of one-sided random context grammars

In the present paper, we study the nonterminal complexity of one-sided random context grammars. More specifically, we prove that every recursively enumerable language can be generated by a one-sided random context grammar with no more than ten nonterminals. An analogical result holds for thirteen nonterminals in terms of these grammars with the set of left random context rules coinciding with the set of right random context rules. Furthermore, we introduce the notion of a right random context nonterminal, defined as a nonterminal that appears on the left-hand side of a right random context rule. We demonstrate how to convert any one-sided random context grammar G to an equivalent one-sided random context grammar H with two right random context nonterminals. An analogical conversion is given in terms of (1) propagating one-sided random context grammars and (2) left random context nonterminals. In the conclusion, two open problems are stated.