In this paper we introduce a public resource named BACO (Base de Co-Ocorrências), a very large textual database built from the WPT03 collection, a publicly available crawl of the whole Portuguese web in 2003. BACO uses a generic relational database engine to store 1.5 million web documents in raw text (more than 6GB of plain text), corresponding to 35 million sentences, consisting of more than ...

The transportation sector is a complex system. Collecting transportation activity and the associated emissions data is extremely expensive and time-consuming. Grey Relational Analysis provides a viable alternative to overcome data insufficiency and gives insights for decision makers into such a complex system. In this paper, we achieved three major goals: (i) we explored the inter-relationships...

Conversational encounters are permeable to network effects but not entirely so, for conversation is internally structured by sequential constraints and dependencies that limit the latitude people have to act on their relational commitments. The author analyzes the effects of hierarchical (superior-subordinate) and horizontal (friendship and co-working) networks on “participation shifts”—transit...

Large relational datasets are prevalent in many fields. We propose an unsupervised component model for relational data, i.e., for heterogeneous collections of categorical co-occurrences. The co-occurrences can be dyadic or n-adic, and over the same or different categorical variables. Graphs are a special case, as collections of dyadic cooccurrences (edges) over a set of vertices. The model is s...

Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indic...

This paper presents a new implementation of the co-VAT algorithm. We assume we have an m× n matrix D, where the elements of D are pair-wise dissimilarities betweenm row objectsOr and n column objectsOc. The union of these disjoint sets are (N = m + n) objects O. Clustering tendency assessment is the process by which a data set is analyzed to determine the number(s) of clusters present. In 2007,...

In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields|for example|encodings of initial algebras, nal co-algebras and abstract datatypes, with corresponding proof princ...

We propose a simple order-theoretic generalization, possibly non monotone, of settheoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows structural operational semantics to describe simultaneously the finite/terminating and infinite/diverging behaviors of programs. This is illustrated on gramma...

Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indic...