724 research outputs found

    A Generalization of the {\L}o\'s-Tarski Preservation Theorem over Classes of Finite Structures

    Full text link
    We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo kk-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion for first-order logic corresponds to definability by k\exists^k\forall^* sentences. In this paper, we identify two properties of classes of finite structures that ensure the above correspondence. The first is based on well-quasi-ordering under the embedding relation. The second is a logic-based combinatorial property that strictly generalizes the first. We show that starting with classes satisfying any of these properties, the classes obtained by applying operations like disjoint union, cartesian and tensor products, or by forming words and trees over the classes, inherit the same property. As a fallout, we obtain interesting classes of structures over which an effective version of the {\L}o\'s-Tarski theorem holds.Comment: 28 pages, 1 figur

    Spectral Clustering with Jensen-type kernels and their multi-point extensions

    Full text link
    Motivated by multi-distribution divergences, which originate in information theory, we propose a notion of `multi-point' kernels, and study their applications. We study a class of kernels based on Jensen type divergences and show that these can be extended to measure similarity among multiple points. We study tensor flattening methods and develop a multi-point (kernel) spectral clustering (MSC) method. We further emphasize on a special case of the proposed kernels, which is a multi-point extension of the linear (dot-product) kernel and show the existence of cubic time tensor flattening algorithm in this case. Finally, we illustrate the usefulness of our contributions using standard data sets and image segmentation tasks.Comment: To appear in IEEE Computer Society Conference on Computer Vision and Pattern Recognitio

    O Mediterrâneo enquanto metáfora da mestiçagem: Novas leituras sobre o modelo europeu na América Latina dos anos 1920

    Get PDF
    After the First World War, we can observe in the Latin American society a strong transformation in the perception of the Europe as a civilization model. New movements in art and literature start to rethink the National Identities in Latin America and in the whole subcontinent born a criticism against the importation of European civility concepts. This process can be deeply analyzed in Mistral’s writings that shows us the continental transformation through the Mediterranean metaphor: between a Latin space and a space of miscegenation. In Mistral’s narratives, we can notice two kinds of analytical movements between North and South relations: when the writer talks about the European contrasts, she talks also about those of the American continent. In this context, the Old World, or its Southern part, shares its Historical experience with the New World to justify the positive perception of the New Latin American men: Multiethnic

    Nash equilibria in fisher market

    Get PDF
    Much work has been done on the computation of market equilibria. However due to strategic play by buyers, it is not clear whether these are actually observed in the market. Motivated by the observation that a buyer may derive a better payoff by feigning a different utility function and thereby manipulating the Fisher market equilibrium, we formulate the Fisher market game in which buyers strategize by posing different utility functions. We show that existence of a conflict-free allocation is a necessary condition for the Nash equilibria (NE) and also sufficient for the symmetric NE in this game. There are many NE with very different payoffs, and the Fisher equilibrium payoff is captured at a symmetric NE. We provide a complete polyhedral characterization of all the NE for the two-buyer market game. Surprisingly, all the NE of this game turn out to be symmetric and the corresponding payoffs constitute a piecewise linear concave curve. We also study the correlated equilibria of this game and show that third-party mediation does not help to achieve a better payoff than NE payoffs

    A Computational Framework for Boundary Representation of Solid Sweeps

    Full text link
    This paper proposes a robust algorithmic and computational framework to address the problem of modeling the volume obtained by sweeping a solid along a trajectory of rigid motions. The boundary representation (simply brep) of the input solid naturally induces a brep of the swept volume. We show that it is locally similar to the input brep and this serves as the basis of the framework. All the same, it admits several intricacies: (i) geometric, in terms of parametrizations and, (ii) topological, in terms of orientations. We provide a novel analysis for their resolution. More specifically, we prove a non-trivial lifting theorem which allows to locally orient the output using the orientation of the input. We illustrate the framework by providing many examples from a pilot implementation
    corecore