Many classification problems with structured outputs can be regarded as a set of interrelated sub-problems where constraints dictate valid variable assignments. The standard approaches to these problems include either independent learning of individual classifiers for each of the sub-problems or joint learning of the entire set of classifiers with the constraints enforced during learning. We pr...

Efficiency analysis is commonly used to assess and compare the productivity of similar decision-making units (DMUs). In this research, we broaden the applicability of efficiency analysis to situations where each DMU comprises interconnected sub-DMUs (e.g., departments). Extant research espouses that embracing the connectedness between subDMUs (e.g., marketing–sales interface, marketing–R&D inte...

a r t i c l e i n f o a b s t r a c t We present a methodology to concurrently couple particle-based methods via a domain decomposition (DD) technique for simulating viscous flows. In particular, we select two resolutions of the smoothed particle hydrodynamics (SPH) method as demonstration. Within the DD framework, a simulation domain is decomposed into two (or more) overlapping sub-domains, ea...

<p>The new cobalt (II) complex, [Co<sub>12 </sub>(cpip)<sub>12</sub>(H<sub>2</sub>O)<sub>12</sub>].18.56H<sub>2</sub>O where H<sub>2</sub>cpip = 2-(carboxy-phenyl) amino-propanoic acid, was isolated as pink-like prism crystals from the reaction of Co(NO<sub>3</sub>)<sub>2</sub>.6H<sub>2&l...

We test state of the art dialogue systems for their behaviour in response to userinitiated sub-dialogues, i.e. interactions where a system question is responded to with a question or request from the user, who thus initiates a sub-dialogue. We look at sub-dialogues both within a single app (where the sub-dialogue concerns another topic in the original domain) and across apps (where the sub-dial...

In this paper, we study the problem of finding all connected and Berge-acyclic sub-hypergraphs contained in an input hypergraph with potential applications to substructure mining from relational data, where Berge acyclicity is a generalization of a tree and one of the most retricted notion of acyclicity for hypergraphs (Fagin, J. ACM, Vol.30(3), pp.514–550, 1983). As main results, we present ef...