Showing papers on "Class (philosophy) published in 2010"

3: Have You Noticed that Your Belly Button Lint Color is Related to the Color of Your Clothing?

Abstract: This chapter focuses on the interaction between pre-suppositions and implicatures triggered by factive verbs. It is concerned with cognitive factives, which is the class of factive verbs used primarily to indicate what information the subject has or how information is acquired or lost. Members of this class in English include "know", "realize", "discover", "notice", "recognize", "find out", "remember", "forget", "be aware", "be unaware", "admit", "intuit", and a subclass of sensory factives "sense", "see", "smell", "hear", "detect", "observe". The chapter considers naturally occurring data. It consists of examples occurring on world wide web located using Google search engine. The logic behind using internet rather than a more structured linguistic corpus is simple: first, author's goal is to show existence proofs; second, there is a huge difference of scale. In many cases the patterns author has searched for are quite rare, and existing linguistic corpora are not large enough to be useful. Keywords: cognitive factives; factive verbs; implicatures; linguistic corpus; sensory factives; world wide web

Diagrammatic logic applied to a parameterisation process

Abstract: This paper provides an abstract definition of a class of logics, called diagrammatic logics, together with a definition of morphisms and 2-morphisms between them. The definition of the 2-category of diagrammatic logics relies on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalisation of a parameterisation process. This process, which consists of adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process for recovering a model of the given specification from a model of the parameterised specification and an actual parameter is shown to be a 2-morphism of logics.

Extensional and Intensional Strategies

Abstract: This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional strategies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives.

Extensional and Intensional Strategies

Abstract: This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional stra tegies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives.

Classification by means of fuzzy analogy-related proportions — A preliminary report

Abstract: Boolean logic interpretations, as well as multiple-valued logic extensions, have been recently proposed for analogical proportions (ie statements of the form “a is to b as c is to d”), and for two other related formal proportions named reverse analogy (“what a is to b is the reverse of what c is to d”), and paralogy (“what a and b have in common c and d have it also”) These proportions relate items a, b, c, and d on the basis of their differences, or of their similarities This may provide a basis for proposing a plausible classification for an object d described in terms of a set of features, on the basis of three other already classified objects described on the same features, considering that if some proportion holds for a sufficiently large number of features, it may hold on the allocation of the classes as well This is the basis of a classification method which is tested on machine learning benchmarks for binary or multiple class problems with objects that have numerical features

Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction

Abstract: We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures Delta, we prove definability dichotomy theorems of the following form: for every first-order expansion Gamma of Delta, either Gamma has a quantifier-free Horn definition in Delta, or there is an element d of Gamma such that all non-empty relations in Gamma contain a tuple of the form (d,...,d), or all relations with a first-order definition in Delta have a primitive positive definition in Gamma. The results imply that several families of constraint satisfaction problems exhibit a complexity dichotomy: the problems are in P or NP-hard, depending on the choice of the allowed relations. As concrete examples, we investigate fundamental algebraic constraint satisfaction problems. The first class consists of all first-order expansions of (Q;+). The second class is the affine variant of the first class. In both cases, we obtain full dichotomies by utilising our general methods.

Hand-based gender classification

Abstract: For each of at least one digitally-imaged hand part, where each of the at least one digitally-imaged hand part corresponds to one of a plurality of hand parts, a set of feature parameters representing a geometry of the digitally-imaged hand part is computed. The set(s) of feature parameters for a set of one or more of the digitally-imaged hand parts is/are used to compute distances of the set of digitally-imaged hand parts from each of i) a first eigenspace corresponding to a male class, and ii) a second eigenspace corresponding to a female class. The computed distances are used to classify the gender of a hand as belonging to the male class or the female class.

Improved support vector data description

Abstract: Support vector data description is a data description method which can give the target data set a spherically shaped description. However, when the target data set contains two classes of objects, this data description method can treat the target data set as a whole and give only one description for the training data set. This paper presents an improved support vector data description, which could give each class of target objects in the target data set a hyper-spherically shaped boundary, if the target data set contains two classes of objects.

Whitehead's pointfree geometry and diametric posets

Abstract: This note is motivated by Whitehead’s researches in inclusion-based point-free geometry as exposed in An Inquiry Concerning the Principles of Natural Knowledge and in The concept of Nature. More precisely, we observe that Whitehead’s definition of point, based on the notions of abstractive class and covering, is not adequate. Indeed, if we admit such a definition it is also questionable that a point exists. On the contrary our approach, in which the diameter is a further primitive, enables us to avoid such a drawback. Moreover, since such a notion enables us to define a metric in the set of points, our proposal looks to be a good starting point for a foundation of the geometry metrical in nature (as proposed, for example, by L.M. Blumenthal).

Representing the structure of a data format using a class-based representation

Abstract: A method of operating a computing device to represent and explore content of a data storage, such as a binary file, using a format definition. The format definition comprises classes, with data members of one or more of the classes representing a layout data elements and their relationships in the data storage. The relationships among the data elements may be represented using inheritance. In the format definition, a class may derive from a base class providing reflection functionality. The reflection allows parsing instances of the class so that their data members and their values are accessed at runtime, using the base class. Results of the parsing are presented in a form that allows exploring the content of the data storage and modifying the parsing results. New data may be created that conforms to the modified results.

Inspection system and method of controlling same, and computer program

Abstract: PROBLEM TO BE SOLVED: To make it possible to know, when newly obtained data class is unknown, whether the data belong to unknown class or the existing class, by maintaining data group which belong to known classes, and already extracting a sufficient number of characteristics SOLUTION: The system acquires data group "A" belongs to an existing class which is divided into M (M≥1) classes, and acquires data "B" belonging to an unknown class Further, the system extracts sufficient N characteristics from the data group "A" and data "B" In space containing N characteristics, when it is assumed that the data group "A" belongs to classes different from classes that the data "B" belongs to, and that the total numbers of classes are M+1, the system projects the data group A and the data B onto dimension D in which distance between the M+1 classes is increased and dispersion in each class is reduced After the projection, the system determines a true class that the data B belongs to on the basis of the distance between the M classes that data in the data group "A" belongs to and the data "B" COPYRIGHT: (C)2010,JPO&INPIT

Pure Type Systems without Explicit Contexts

Abstract: We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free and bound variables even in pseudo-terms. Specifically we give the rules of the "Pure Type System" class of type theories in this style. We prove that the typing judgments of these systems correspond in a natural way with those of Pure Type Systems as traditionally formulated. I.e., our systems have exactly the same well-typed terms as traditional presentations of type theory. Our system can be seen as a type theory in which all type judgments share an identical, infinite, typing context that has infinitely many variables for each possible type. For this reason we call our system "Gamma_infinity". This name means to suggest that our type judgment "A : B" should be read as "Gamma_infinity |- A : B", with a fixed infinite type context called "Gamma_infinity".

CDT C++ Refactorings

Abstract: Refactoring existing code is a key element in almost all modern software development. Typically, this is performed using tools of an integrated development environment, since manual changes are slow and error prone. The "C/C++ Development Tooling" plug-in for Eclipse (CDT) lacks some important refactoring tools. We have already developed the "Introduce PImpl" refactoring in our semester thesis at the IFS in 2009 and our goal for this bachelor thesis is to further expand the refactoring abilities of CDT. Most C++ functions provide one or more declarations in separate (Header) files in addition to their definition. If the function signature must be changed the programmer has to edit code in these files and also the calling sites accordingly. This is annoying and increases the risk for mistakes. With our refactorings, the software developer specifies a single change that is properly applied to all the relevant parts of code. To get an easier start with the Eclipse framework we began with a rather simple refactoring called "Declare Function" that offers the possibility to create a function declaration within a header file based on the function's definition. It is the counterpart to the already existing "Implement Method" (sic) refactoring. Our main feature "Change Function Signature" allows changing the signature of a function with a very simple and yet powerful wizard. The user can add, remove or rearrange parameters, modify the return type and choose to apply those changes to its super- or subclass, instead of manually rewriting the definition, the declaration and all callers. Both our refactorings combined with "Implement Method" frees C++ developers from the burden of having to change code in multiple files, when extending or changing a class' interface.

Exploring the impacts of wiki collaborative technologies within the english writing environment

Abstract: ...................................................................................vii CHAPTER

Bavard's systolically extremal Klein bottles and three dimensional applications

Abstract: A compact manifold is called Bieberbach if it carries a flat Riemannian metric. Bieberbach manifolds satisfy an isosystolic inequality by a general and fundamental result of M. Gromov. In dimension 3, there exist four classes of non-orientable Bieberbach manifolds up to an affine diffeomorphism. In this paper, We prove the existence on each diffeomorphism class of non-orientable Bieberbach 3-manifolds of a two-parameter family of singular Riemannian metrics that are systolically extremal in their conformal class. The proof uses a one-parameter family of singular Riemannian metrics on the Klein bottle discovered by C. Bavard (\cite{bavard88}): each one of these metrics is extremal in its conformal class.

Relational transducers for declarative networking

Abstract: Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class that we define of "oblivious" transducers also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.