307,352 research outputs found
Logics of Finite Hankel Rank
We discuss the Feferman-Vaught Theorem in the setting of abstract model
theory for finite structures. We look at sum-like and product-like binary
operations on finite structures and their Hankel matrices. We show the
connection between Hankel matrices and the Feferman-Vaught Theorem. The largest
logic known to satisfy a Feferman-Vaught Theorem for product-like operations is
CFOL, first order logic with modular counting quantifiers. For sum-like
operations it is CMSOL, the corresponding monadic second order logic. We
discuss whether there are maximal logics satisfying Feferman-Vaught Theorems
for finite structures.Comment: Appeared in YuriFest 2015, held in honor of Yuri Gurevich's 75th
birthday. The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-23534-9_1
Aerospace Medicine and Biology: a Continuing Bibliography with Indexes (Supplement 328)
This bibliography lists 104 reports, articles and other documents introduced into the NASA Scientific and Technical Information System during September, 1989. Subject coverage includes: aerospace medicine and psychology, life support systems and controlled environments, safety equipment, exobiology and extraterrestrial life, and flight crew behavior and performance
Computability and analysis: the legacy of Alan Turing
We discuss the legacy of Alan Turing and his impact on computability and
analysis.Comment: 49 page
Forman-Ricci flow for change detection in large dynamic data sets
We present a viable solution to the challenging question of change detection
in complex networks inferred from large dynamic data sets. Building on Forman's
discretization of the classical notion of Ricci curvature, we introduce a novel
geometric method to characterize different types of real-world networks with an
emphasis on peer-to-peer networks. Furthermore we adapt the classical Ricci
flow that already proved to be a powerful tool in image processing and
graphics, to the case of undirected and weighted networks. The application of
the proposed method on peer-to-peer networks yields insights into topological
properties and the structure of their underlying data.Comment: Conference paper, accepted at ICICS 2016. (Updated version
Verification of Timed Automata Using Rewrite Rules and Strategies
ELAN is a powerful language and environment for specifying and prototyping
deduction systems in a language based on rewrite rules controlled by
strategies. Timed automata is a class of continuous real-time models of
reactive systems for which efficient model-checking algorithms have been
devised. In this paper, we show that these algorithms can very easily be
prototyped in the ELAN system. This paper argues through this example that
rewriting based systems relying on rules and strategies are a good framework to
prototype, study and test rather efficiently symbolic model-checking
algorithms, i.e. algorithms which involve combination of graph exploration
rules, deduction rules, constraint solving techniques and decision procedures
- …