Whether viewed as a Rawlsian primary good or as the building material of an entire Infosphere, the notion of information plays a fundamental role in the development of CE. We analyze this notion from the monosemic perspective of lexical semantics (Ruhl 1989) and offer a definition that provides a

This Article is brought to you for free and open access by the Papers in the Biological Sciences at DigitalCommons@University of Nebraska- Lincoln.

A central operation in an incremental learning system is the specialization of an incorrect theory in order exclude incorrect inferences. In this paper, we discuss what properties are to be required from such theory revision operations. In particular, we examine what it should mean for a revision to be minimal. As a surprising result, the seemingly most natural criterion, requiring revisions to produce maximally general correct specializations, leads to a number of serious problems. We therefore propose an alternative interpretation of minimality based on the notion of base revision from theory contraction work, and formally define it as a set of base revision postulates. We then present a revision operator (Mbr) that meets these postulates, and shown that it produces the maximally general correct revision satisfying the postulates, i.e., the revisions produced by Mbr are indeed minimal in our sense. The operator is implemented and used in Krt, the knowledge revision tool of the Mobal ...

The water entry problem is considered from the point of view of analytic mechanics. It is usual practice to treat potential hydrodynamic problems involving motion of solid bodies within the frame of system dynamics. This is done whenever a finite number of generalized coordinates can

Abstract. We show that there is a bar–and–joint framework G(p) which has a configuration p in the plane such that the component of p in the space of all planar configurations of G has a cusp at p. At the cusp point, the mechanism G(p) turns out to be third–order rigid, in the sense that, every third–order flex must have a trivial first–order component. The existence of a third–order rigid framework that is not rigid calls into question the whole notion of higher–order rigidity. 1.

The Unified Modeling Language is an attempt to define a unified notation for Object-Oriented technology users. Since a notation without semantics is not precise enough, succeeding versions have improved the expressive power of UML. First, Object Constraint Language, permitting the description of invariants, pre and post conditions, was included in UML. More recently, Action Semantics has been approved by the Object Management Group to describe operations.

Artificial Intelligence (DAI) is raised. The thesis presents a testbed populated by simple trusting agents which substantiates the utility of the formalism. The formalism provides a step in the direction of a proper understanding and definition of human trust. A contribution of the thesis is its detailed

, the energy score admits a kernel representation in terms of negative definite functions, with links to inequalities of Hoeffding type, in both univariate and multivariate settings. Proper scoring rules for quantile and interval forecasts are also discussed. We relate proper scoring rules to Bayes factors

Reads, and Phantoms. This paper shows that these phenomena and the ANSI SQL definitions fail to properly characterize several popular isolation levels, including the standard Ioeking implementations of the levels covered. Ambiguity in the statement of the phenomena is investigated and a more formal

polymorphic worms. Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages our insight that for a real-world exploit to function properly, multiple invariant substrings must often be present in all variants of a payload; these substrings typically