All normalized anti-monotonic overlap graph measures are bounded

In graph mining, a frequency measure for graphs is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pattern miners relies critically on this property. We study the case where frequent subgraphs have to be found in one graph. Vanetik et al. (Data Min Knowl Disc 13(2):243?C260, 2006) already gave sufficient and necessary conditions for anti-monotonicity of graph measures depending only on the edge-overlaps between the instances of the pattern in a labeled graph. We extend these results to homomorphisms, isomorphisms and homeomorphisms on both labeled and unlabeled, directed and undirected graphs, for vertex- and edge-overlap. We show a set of reductions between the different morphisms that preserve overlap. As a secondary contribution, we prove that the popular maximum independent set measure assigns the minimal possible normalized frequency and we introduce a new measure based on the minimum clique partition that assigns the maximum possible normalized frequency. In that way, we obtain that all normalized anti-monotonic overlap graph measures are bounded from above and below. We also introduce a new measure sandwiched between the former two based on the polynomial time computable Lovász ??-function.     

On the adjoint-consistent formulation of interface conditions in goal-oriented error estimation and adaptivity for fluid–structure interaction

The numerical solution of fluid–structure-interaction problems poses a paradox in that most of the computational resources are consumed by the subsystem of least practical interest, viz., the fluid. Goal-oriented adaptive discretization methods provide a paradigm to bypass this paradox. Based on the solution of a dual problem, the contribution of local residuals to the error in a specific goal functional is estimated, and only the regions that yield a dominant contribution are refined. In the present work, we address a fundamental complication in the application of goal-oriented adaptivity to fluid–structure-interaction problems, namely, that the treatment of the interface conditions has nontrivial consequences for the properties of the dual problem. In the context of a linearized model problem, we consider two equivalent discretizations differing only on the formulation of the interface coupling terms. By means of an adjoint consistency analysis, we show that only one of these discretizations is adjoint consistent. Numerical experiments convey that the two discretizations behave very differently for the dual problem, and that the adjoint-consistent discretization yields more reliable error estimates. Based on the adjoint-consistent discretization, we finally present some h- and hp-adaptive results, confirming that tremendous savings in computational cost can be realized through the use of goal-oriented refinement strategies. The numerical experiments illustrate that the goal-oriented approach effectively equilibrates the error contributions of the fluid and structure subsystems, which is imperative for efficiently resolving the coupled fluid–structure-interaction problem, and which cannot be accomplished by uniform or residual-based refinement strategies.     

Packing spherical discrete elements for large scale simulations

We introduce a new geometric method to generate sphere packings with restricted overlap values. Sample generation is an important, but time-consuming, step that precedes a calculation performed with the discrete element method (DEM). At present, there does not exist any software dedicated to DEM which would be similar to the mesh software that exists for finite element methods (FEM). A practical objective of the method is to build very large sphere packings (several hundreds of thousands) in a few minutes instead of several days as the current dynamic methods do. The developed algorithm uses a new geometric procedure to position very efficiently the polydisperse spheres in a tetrahedral mesh. The algorithm, implemented into YADE-OPEN DEM (open-source software), consists in filling tetrahedral meshes with spheres. In addition to the features of the tetrahedral mesh, the input parameters are the minimum and maximum radii (or their size ratio), and the magnitude of authorized overlaps. The filling procedure is stopped when a target solid fraction or number of spheres is reached. Based on this method, an efficient tool can be designed for DEMs used by researchers and engineers. The generated packings can be isotropic and the number of contacts per sphere is very high due to its geometric procedure. In this paper, different properties of the generated packings are characterized and examples from real industrial problems are presented to show how this method can be used. The current C++ version of this packing algorithm is part of YADE-OPEN DEM [20] available on the web (https://yade-dem.org).     

Numerical simulations of particle migration in a viscoelastic fluid subjected to shear flow

Particle migration is a relevant transport mechanism whenever suspensions flow in channels with gap size comparable to particle dimensions (e.g. microfluidic devices). Several theoretical as well as experimental studies have been performed on this topic, showing that the occurring of this phenomenon and the migration direction are related to particle size, flow rate, and the nature of the suspending liquid.In this work we perform a systematic analysis on the migration of a single particle in a sheared viscoelastic fluid through 2D finite element simulations in a Couette planar geometry. To focus on the effects of viscoelasticity alone, inertia is neglected. The suspending medium is modeled as a Giesekus fluid.An ALE particle mover is combined with a DEVSS/SUPG formulation with a log-representation of the conformation tensor giving stable and convergent results up to high flow rates. To optimize the computational effort and reduce the remeshing and projection steps, needed as soon as the mesh becomes too distorted, a ‘backprojection’ of the flow fields is performed, through which the particle in fact moves along the cross-streamline direction only, and the mesh distortion is hence drastically reduced.Our results, in agreement with recent experimental data, show a migration towards the closest walls, regardless of the fluid and geometrical parameters. The phenomenon is enhanced by the fluid elasticity, the shear thinning and strong confinements. The migration velocity trends show the existence of a master curve governing the particle dynamics in the whole channel. Three different regimes experienced by the particle are recognized, related to the particle-wall distance. The existence of a unique migration behavior and its qualitative aspects do not change by varying the fluid parameters or the particle size.     

On the effect of wind direction and urban surroundings on natural ventilation of a large semi-enclosed stadium

Natural ventilation of buildings refers to the replacement of indoor air with outdoor air due to pressure differences caused by wind and/or buoyancy. It is often expressed in terms of the air change rate per hour (ACH). The pressure differences created by the wind depend - among others - on the wind speed, the wind direction, the configuration of surrounding buildings and the surrounding topography. Computational Fluid Dynamics (CFD) has been used extensively in natural ventilation research. However, most CFD studies were performed for only a limited number of wind directions and/or without considering the urban surroundings. This paper presents isothermal CFD simulations of coupled urban wind flow and indoor natural ventilation to assess the influence of wind direction and urban surroundings on the ACH of a large semi-enclosed stadium. Simulations are performed for eight wind directions and for a computational model with and without the surrounding buildings. CFD solution verification is conducted by performing a grid-sensitivity analysis. CFD validation is performed with on-site wind velocity measurements. The simulated differences in ACH between wind directions can go up to 75% (without surrounding buildings) and 152% (with surrounding buildings). Furthermore, comparing the simulations with and without surrounding buildings showed that neglecting the surroundings can lead to overestimations of the ACH with up to 96%.     

Activity labeling in process modeling: Empirical insights and recommendations

Few studies have investigated the factors contributing to the successful practice of process modeling. In particular, studies that contribute to the act of developing process models that facilitate communication and understanding are scarce. Although the value of process models is not only dependent on the choice of graphical constructs but also on their annotation with textual labels, there has been hardly any work on the quality of these labels. Accordingly, the research presented in this paper examines activity labeling practices in process modeling. Based on empirical data from process modeling practice, we identify and discuss different labeling styles and their use in process modeling praxis. We perform a grammatical analysis of these styles and use data from an experiment with process modelers to examine a range of hypotheses about the usability of the different styles. Based on our findings, we suggest specific programs of research towards better tool support for labeling practices. Our work contributes to the emerging stream of research investigating the practice of process modeling and thereby contributes to the overall body of knowledge about conceptual modeling quality.     

Preserving correctness during business process model configuration

A configurable process model captures a family of related process models in a single artifact. Such models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. This article proposes a formal foundation for individualizing configurable process models incrementally, while preserving correctness, both with respect to syntax and behavioral semantics. Specifically, assuming the configurable process model is behaviorally sound, the individualized process models are guaranteed to be sound. The theory is first developed in the context of Petri nets and then extended to a process modeling notation widely used in practice, namely Event-driven Process Chains.     

O3R: Ontology-based mechanism for a human-centered environment targeted at the analysis of navigation patterns

Web Usage Mining (WUM) is the application of data mining techniques over Web server logs in order to extract navigation usage patterns. The analysis of mining patterns for assessing the knowledge they reveal is a critical phase in WUM. The main challenges are: (a) mining algorithms yield a huge number of patterns and (b) there is a significant semantic gap between URLs and events performed by users. In this paper, we describe the pattern analysis mechanisms integrated in O3R (Ontology-based Rules Retrieval and Rummaging), a human-centered environment for the analysis of navigation rules. O3R explores the synergy of mechanisms for retrieving and analyzing patterns. Filtering and clustering allow users to retrieve subsets of patterns with specific characteristics, in order to deal with the large volume of patterns. Rummaging mechanisms are targeted at assessing the meaning and relevance of pattern with regard to the domain, and it is particularly suitable for exploratory analysis. The distinctive feature of O3R is that is dynamically associates meaning to patterns using the concepts and relationships of a domain ontology, as a means of reducing the gap between syntactic URLs and semantic events performed by users. The paper describes the mechanisms in detail, and explores their synergic integration in the O3R prototype. It also reports two case studies that evaluate the use of O3R for the analysis of navigation patterns of a learning site.     

Exploring sociality and engagement in play through game-control distribution

This study explores how distributing the controls of a video game among multiple players affects the sociality and engagement experienced in game play. A video game was developed in which the distribution of game controls among the players could be varied, thereby affecting the abilities of the individual players to control the game. An experiment was set up in which eight groups of three players were asked to play the video game while the distribution of the game controls was increased in three steps. After each playing session, the players’ experiences of sociality and engagement were assessed using questionnaires. The results showed that distributing game control among the players increased the level of experienced sociality and reduced the level of experienced control. The game in which the controls were partly distributed led to the highest levels of experienced engagement, because the game allowed social play while still giving the players a sense of autonomy. The implications for interaction design are discussed.