Search results for " Computer"
showing 10 items of 6910 documents
Co-simulation and Formal Verification of Co-operative Drone Control With Logic-Based Specifications
2021
Abstract Unmanned aerial vehicle (UAV) co-operative systems are complex cyber-physical systems that integrate a high-level control algorithm with pre-existing closed implementations of lower-level vehicle kinematics. In model-driven development, simulation is one of the techniques that are usually applied, together with testing, in the analysis of system behaviours. This work proposes a method and tools to validate the design of UAV co-operative systems based on co-simulation and formal verification. The method uses the Prototype Verification System, an interactive theorem prover based on a higher-order logic language, and the Functional Mock-up Interface, a widely accepted standard for co-…
Querytogether : Enabling entity-centric exploration in multi-device collaborative search
2018
Collaborative and co-located information access is becoming increasingly common. However, fairly little attention has been devoted to the design of ubiquitous computing approaches for spontaneous exploration of large information spaces enabling co-located collaboration. We investigate whether an entity-based user interface provides a solution to support co-located search on heterogeneous devices. We present the design and implementation of QueryTogether, a multi-device collaborative search tool through which entities such as people, documents, and keywords can be used to compose queries that can be shared to a public screen or specific users with easy touch enabled interaction. We conducted…
The dual equivalence of equations and coequations for automata
2015
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…
Neural networks with non-uniform embedding and explicit validation phase to assess Granger causality
2015
A challenging problem when studying a dynamical system is to find the interdependencies among its individual components. Several algorithms have been proposed to detect directed dynamical influences between time series. Two of the most used approaches are a model-free one (transfer entropy) and a model-based one (Granger causality). Several pitfalls are related to the presence or absence of assumptions in modeling the relevant features of the data. We tried to overcome those pitfalls using a neural network approach in which a model is built without any a priori assumptions. In this sense this method can be seen as a bridge between model-free and model-based approaches. The experiments perfo…
Modality-specific dysfunctional neural processing of social-abstract and non-social-concrete information in schizophrenia
2021
Highlights • Social/non-social information processing in three modalities was investigated in SZ. • SZ showed reduced activation for social information only in gesture modality. • Reduced activation in SZ was observed for non-social information only in speech. • Neural Neural processing in bimodal condition is not different between patients and controls.
Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection
2013
In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…
Channel selection in Cognitive Radio Networks: A Switchable Bayesian Learning Automata approach
2013
We consider the problem of a user operating within a Cognitive Radio Network (CRN) which involves N channels each associated with a Primary User (PU). The problem consists of allocating a channel which, at any given time instant is not being used by a PU, to a Secondary User (SU). Within our study, we assume that a SU is allowed to perform “channel switching”, i.e., to choose an alternate channel S times (where S +1 ≤ N) if the previous choice does not lead to a channel which is vacant. The paper first presents a formal probabilistic model for the problem itself, referred to as the Formal Secondary Channel Selection (FSCS) problem, and the characteristics of the FSCS are then analyzed. Ther…
Review of Carruthers (2006): The Architecture of the Mind
2010
TREC: A tool kit for programming cognitive experiments in Applesoft BASIC
1987
A Formalism Supplementing Cognitive Semantics Based on Mereology
2007
ABSTRACT This paper is motivated by and aims to supplement Cognitive Semantics. Details of this latter prominent approach within contemporary linguistic research will not be discussed here. Rather, we focus on a formalization of the concept of Gestalt and provide a formal semantics that can be used to interpret a certain formal language (LM 0) with respect to a universe of structured wholes (Gestalts). Since a great deal of the analyses of linguistic organization that has been provided by Cognitive Semantics since the mid-1970s is based on the concept of Gestalt, the semantics unfolded in the following may be viewed as an attempt to provide a starting point for supplementing the yet informa…