Software and product designers use card sorting to understand item groups and relationships. In the usability community, a common method of formal statistical analysis for open card sort data is hierarchical cluster analysis, which results in a tree of the items sorted into distinct, nested clusters. Hierarchical cluster analysis is appropriate for highly structured settings, like software menu...

This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic ima...

We extend the ideas introduced in [33] for hierarchical multiscale decompositions of images. Viewed as a function f ∈L(Ω), a given image is hierarchically decomposed into the sum or product of simpler “atoms” uk, where uk extracts more refined information from the previous scale uk−1. To this end, the uk’s are obtained as dyadically scaled minimizers of standard functionals arising in image ana...

We present a unified game-based approach for branchingtime model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition graphs, as repeated sub-systems are described only once. Early work on model checking of hierarchical systems shows that one can do better than a naive algorithm that “flattens” the system and removes the hierarchy. Given ...

In this paper, we explore the problem of classification where class labels exhibit a hierarchical tree structure. Many multiclass classification algorithms assume a flat label space, where hierarchical structures are ignored. We take advantage of hierarchical structures and the interdependencies between labels. In our setting, labels are structured in a product and service hierarchy, with a foc...

We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on the...

The multicore revolution is underway. Classical algorithms have to be revisited in order to take hierarchical memory layout into account. In this paper, we aim at minimizing the number of cache misses paid during the execution of the matrix product kernel on a multicore processor, and we show how to achieve the best possible trade-off between shared and distributed caches.

We report the synthesis of a new hierarchical mesoporous TS-1 type zeolite by a simple steam-assisted crystallization method. This novel product exhibits high catalytic activity and a strongly prolonged lifetime in the selective oxidation of 2,3,6-trimethylphenol to trimethyl-p-benzoquinone.

Storage Management continues to play a key role in providing a complete solution to todays most challenging computational problems. This paper describes the current market trends and customer requirements driving Cray’s continued commitment to providing an integrated storage management solution. Product directions for the areas of network backup, archive and hierarchical storage management (HSM...

We report the synthesis of a new kind of uniform hollow zeolite microspheres with hierarchical macro-/meso-/microporosity by an efficient strategy combining bi-templating, steam-assisted crystallization and then a mild alkaline etching method. This novel product has a hollow architecture, highly crystallized zeolite shells and more importantly, high dye adsorption capabilities.