Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the properties of minimal occurrences and design effective pruning techniques to prune non-closed episodes. An efficient mining algorithm Clo_episode is proposed to mine all closed episodes following a breadth-first sear...

The current study aims to test the value of mandibular size in sex estimation of a contemporary Greek population. The produced standards are expected to enhance identification of heavily decomposed remains in contemporary forensic settings. Data from 70 mandibles from a contemporary Greek collection have been analysed using discriminant function analysis. We selected individuals of less than 66...

We study natural semantic fragments of the π-calculus: depthbounded processes (there is a bound on the longest communication path), breadth-bounded processes (there is a bound on the number of parallel processes sharing a name), and name-bounded processes (there is a bound on the number of shared names). We give a complete characterization of the decidability frontier for checking if a π-calcul...

While SAT-based algorithms have largely displaced BDD-based verification techniques due to their typically higher scalability, there are classes of problems for which BDDbased reachability analysis is the only existing method for an automated solution. Nonetheless, reachability engines require a high degree of tuning to perform well on challenging benchmarks. In addition to clever partitioning ...

We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of the vertices induced by breadth-first search. For trees the resulting structure is uniquely determined up to isomorphism. We also show that the largest spec...

The standard result in patent policy, as demonstrated by Gilbert and Shapiro (1990), is that infinitely lived but very narrow patents are optimal as deadweight losses are minimised and spread through time but inventors can still recover their R&D expenditures. By extending their innovative environment to include timing as an important choice, we demonstrate that a finitely lived, but broader, p...

Real world problems are complex and therefore between and beyond disciplines. To solve them requires expertise across several disciplines. This paper argues that we need to teach students transdisciplinary collaboration as a competency demanded in future work places. We describe two learning strategies, “breadth-first” and “Long Tail”, to help develop these competencies in graduate students. An...

In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph traversal techniques). In particular, we address parallel implementations where the bottleneck is the number of messages between processors emitted at the peak iteration. First, we derive an expression for the expected degre...