A visual embedding for the unsupervised extraction of abstract semantics

Vector-space word representations obtained from neural network models have been shown to enable semantic operations based on vector arithmetic. In this paper, we explore the existence of similar information on vector representations of images. For that purpose we define a methodology to obtain large, sparse vector representations of image classes, and generate vectors through the state-of-the-art deep learning architecture GoogLeNet for 20 K images obtained from ImageNet. We first evaluate the resultant vector-space semantics through its correlation with WordNet distances, and find vector distances to be strongly correlated with linguistic semantics. We then explore the location of images within the vector space, finding elements close in WordNet to be clustered together, regardless of significant visual variances (e.g., 118 dog types). More surprisingly, we find that the space unsupervisedly separates complex classes without prior knowledge (e.g., living things). Afterwards, we consider vector arithmetics. Although we are unable to obtain meaningful results on this regard, we discuss the various problem we encountered, and how we consider to solve them. Finally, we discuss the impact of our research for cognitive systems, focusing on the role of the architecture being used.This work is partially supported by the Joint Study Agreement no. W156463 under the IBM/BSC Deep Learning Center agreement, by the Spanish Government through Programa Severo Ochoa (SEV-2015-0493), by the Spanish Ministry of Science and Technology through TIN2015-65316-P project and by the Generalitat de Catalunya (contracts 2014-SGR-1051), and by the Core Research for Evolutional Science and Technology (CREST) program of Japan Science and Technology Agency (JST).Peer ReviewedPostprint (published version

Conceptual Role Semantics, the Theory Theory, and Conceptual Change

The purpose of the paper is twofold. I first outline a philosophical theory of concepts based on conceptual role semantics. This approach is explicitly intended as a framework for the study and explanation of conceptual change in science. Then I point to the close similarities between this philosophical framework and the theory theory of concepts, suggesting that a convergence between psychological and philosophical approaches to concepts is possible. An underlying theme is to stress that using a non-atomist account of concepts is crucial for the successful study of conceptual development and change—both for the explanation of individual cognitive development and for the study of conceptual change in science

Bridging symbolic computation and economics: a dynamic and interactive tool to analyze the price elasticity of supply

It is not possible to achieve the objectives and skills of a program in economics, at the secondary and undergraduate levels, without resorting to graphic illustrations. In this way, the use of educational software has been increasingly recognized as a useful tool to promote students' motivation to deal with, and understand, new economic concepts. Current digital technology allows students to work with a large number and variety of graphics in an interactive way, complementing the theoretical results and the so often used paper and pencil calculations. The computer algebra system Mathematica is a very powerful software that allows the implementation of many interactive visual applications. Thanks to the symbolic and numerical capabilities of Mathematica, these applications allow the user to interact with the graphical and analytical information in real time. However, Mathematica is a commercially distributed application which makes it difficult for teachers and students to access. The main goal of this paper is to present a new dynamic and interactive tool, created with Mathematica and available in the Computable Document Format. This format allows anyone with a computer to use, at no cost, the PES(Linear)-Tool, even without an active Wolfram Mathematica license. The PES(Linear)-Tool can be used as an active learning tool to promote better student activity and engagement in the learning process, among students enrolled in socio-economic programs. This tool is very intuitive to use which makes it suitable for less experienced users.Funding Agency Portuguese Foundation for Science and Technology UID/ECO/04007/2019info:eu-repo/semantics/publishedVersio

Designing products with a focus on self-explanatory assembly, a case study

Designing products with a focus on self-explanatory assembly can reduce the use of procedural instructions and the associated problems. This paper describes how different groups of students, in two different design-engineering courses designed or redesigned products in an attempt to make the assembly of the product self-explanatory. The design outcomes are discussed in relation to the design context and linked to existing theory on design for meaning

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE uses abstraction, meaning that details of the circuit behaviour are removed from the circuit model. A semantics for GSTE can be used to predict and understand why certain circuit properties can or cannot be proven by GSTE. Several semantics have been described for GSTE. These semantics, however, are not faithful to the proving power of GSTE-algorithms, that is, the GSTE-algorithms are incomplete with respect to the semantics. The abstraction used in GSTE makes it hard to understand why a specific property can, or cannot, be proven by GSTE. The semantics mentioned above cannot help the user in doing so. The contribution of this paper is a faithful semantics for GSTE. That is, we give a simple formal theory that deems a property to be true if-and-only-if the property can be proven by a GSTE-model checker. We prove that the GSTE algorithm is sound and complete with respect to this semantics

Re-verification of a Lip Synchronization Protocol using Robust Reachability

The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards. A symbolic algorithm for the analysis of the robustness of timed automata has been implemented. In this paper, we re-analyse an industrial case lip synchronization protocol using the new robust reachability algorithm. This lip synchronization protocol is an interesting case because timing aspects are crucial for the correctness of the protocol. Several versions of the model are considered: with an ideal video stream, with anchored jitter, and with non-anchored jitter

Re-verification of a Lip Synchronization Algorithm using robust reachability

The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards. A symbolic algorithm for the analysis of the robustness of timed automata has been implemented. In this paper we re-analyse an industrial case lip synchronization protocol using the new robust reachability algorithm.This lip synchronization protocol is an interesting case because timing aspect are crucial for the correctness of the protocol. Several versions of the model are considered, with an ideal video stream, with anchored jitter, and with non-anchored jitter

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP, in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.Comment: 39 pages and 16 pages appendix with proofs. This article has been accepted for publication in Theory and Practice of Logic Programming, Copyright Cambridge University Pres