For a recent student conference, the authors developed a day-long design problem and competition suitable for engineering, mathematics, and science undergraduates. The competition ...
Joshua Holden, Richard Layton, Laurence D. Merkle,...
In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the...
Logical hidden Markov models (LOHMMs) upgrade traditional hidden Markov models to deal with sequences of structured symbols in the form of logical atoms, rather than flat characte...
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
The purpose of this note is to sharpen the results in Bouyssou and Pirlot (2005) giving an axiomatic characterization of concordance relations. We show how the conditions used in ...