Determining process model precision and generalization with weighted artificial negative events

Process mining encompasses the research area which is concerned with knowledge discovery from event logs. One common process mining task focuses on conformance checking, comparing discovered or designed process models with actual real-life behavior as captured in event logs in order to assess the “goodness” of the process model. This paper introduces a novel conformance checking method to measure how well a process model performs in terms of precision and generalization with respect to the actual executions of a process as recorded in an event log. Our approach differs from related work in the sense that we apply the concept of so-called weighted artificial negative events towards conformance checking, leading to more robust results, especially when dealing with less complete event logs that only contain a subset of all possible process execution behavior. In addition, our technique offers a novel way to estimate a process model’s ability to generalize. Existing literature has focused mainly on the fitness (recall) and precision (appropriateness) of process models, whereas generalization has been much more difficult to estimate. The described algorithms are implemented in a number of ProM plugins, and a Petri net conformance checking tool was developed to inspect process model conformance in a visual manner.

Simplified computation and generalization of the refined process structure tree

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

Mice behaviorally selected for high Pavlovian fear memory exhibit fear generalization, HPA-axis alterations and increased basal activity in cortico-limbic circuits

Biological factors underlying individual variability in fearfulness and anxiety have important implications for stress-related psychiatric illness including PTSD and major depression. Using an advanced intercross line (AIL) derived from C57BL/6 and DBA/2J mouse strains and behavioral selection over 3 generations, we established two lines exhibiting High or Low fear behavior after fear conditioning. Across the selection generations, the two lines showed clear differences in training and tests for contextual and conditioned fear. Before fear conditioning training, there were no differences between lines in baseline freezing to a novel context. However, after fear conditioning High line mice demonstrated pronounced freezing in a new context suggestive of poor context discrimination. Fear generalization was not restricted to contextual fear. High fear mice froze to a novel acoustic stimulus while freezing in the Low line did not increase over baseline. Enhanced fear learning and generalization are consistent with transgenic and pharmacological disruption of the hypothalamic-pituitary-adrenal axis (HPA-axis) (Brinks, 2009, Thompson, 2004, Kaouane, 2012). To determine whether there were differences in HPA-axis regulation between the lines, morning urine samples were collected to measure basal corticosterone. Levels of secreted corticosterone in the circadian trough were analyzed by corticosterone ELISA. High fear mice were found to have higher basal corticosterone levels than low line animals. Examination of hormonal stress response components by qPCR revealed increased expression of CRH mRNA and decreased mRNA for MR and CRHR1 in hypothalamus of high fear mice. These alterations may contribute to both the behavioral phenotype and higher basal corticosterone in High fear mice. To determine basal brain activity in vivo in High and Low fear mice we used manganese-enhanced magnetic resonance imaging (MEMRI). Analysis revealed a pattern of basal brain activity made up of amygdala, cortical and hippocampal circuits that was elevated in the High line. Ongoing studies also seek to determine the relative balance of excitatory and inhibitory tone in the amygdala and hippocampus and the neuronal structure of its neurons. While these heterogeneous lines are selected on fear memory expression, HPA-axis alterations and differences in hippocampal activity segregate with the behavioral phenotypes. These differences are detectable in a basal state strongly suggesting these are biological traits underlying the behavioral phenotype (Johnson et al, 2011).

A Literary Turn : Rethinking the Roles of Generalization and Theory in Anglo-American Moral Philosophy

This work investigates the role of narrative literature in late-20th century and contemporary Anglo-American moral philosophy. It aims to show the trend of reading narrative literature for purposes of moral philosophy from the 1970 s and early 80 s to the present day as a part of a larger movement in Anglo-American moral philosophy, and to present a view of its significance for moral philosophy overall. Chapter 1 provides some preliminaries concerning the view of narrative literature which my discussion builds on. In chapter 2 I give an outline of how narrative literature is considered in contemporary Anglo-American moral philosophy, and connect this use to the broad trend of neo-Aristotelian ethics in this context. In chapter 3 I connect the use of literature to the idea of the non-generalizability of moral perception and judgment, which is central to the neo-Aristotelian trend, as well as to a range of moral particularisms and anti-theoretical positions of late 20th century and contemporary ethics. The joint task of chapters 2 and 3 is to situate the trend of reading narrative literature for the purposes of moral philosophy in the present context of moral philosophy. In the following two chapters, 4 and 5, I move on from the particularizing power of narrative literature, which is emphasized by neo-Aristotelians and particularists alike, to a broader under-standing of the intellectual potential of narrative literature. In chapter 4 I argue that narrative literature has its own forms of generalization which are enriching for our understanding of the workings of ethical generalizations in philosophy. In chapter 5 I discuss Iris Murdoch s and Martha Nussbaum s respective ways of combining ethical generality and particularity in a philosophical framework where both systematic moral theory and narrative literature are taken seriously. In chapter 6 I analyse the controversy between contemporary anti-theoretical conceptions of ethics and Nussbaum s refutation of these. I present my suggestion for how the significance of the ethics/literature discussion for moral philosophy can be understood if one wants to overcome the limitations of both Nussbaum s theory-centred, equilibrium-seeking perspective, and the anti-theorists repudiation of theory. I call my position the inclusive approach .

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Generalization of Dynkin's Identity and Some Applications

Let X(t) be a right continuous temporally homogeneous Markov pro- cess, Tt the corresponding semigroup and A the weak infinitesimal genera- tor. Let g(t) be absolutely continuous and r a stopping time satisfying E.( S f I g(t) I dt) < oo and E.( f " I g'(t) I dt) < oo Then for f e 9iJ(A) with f(X(t)) right continuous the identity Exg(r)f(X(z)) - g(O)f(x) = E( 5 " g'(s)f(X(s)) ds) + E.( 5 " g(s)Af(X(s)) ds) is a simple generalization of Dynkin's identity (g(t) 1). With further restrictions on f and r the following identity is obtained as a corollary: Ex(f(X(z))) = f(x) + k! Ex~rkAkf(X(z))) + n-1E + (n ) )!.E,(so un-1Anf(X(u)) du). These identities are applied to processes with stationary independent increments to obtain a number of new and known results relating the moments of stopping times to the moments of the stopped processes.

Analysis,Insights and Generalization of a Fast Decentralized Relay Selection Mechanism

Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q >= 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.

Thermomechanical generalization of pin joints in finite plates

The understanding of thermoelastic behaviour of joints is significant in order to ensure the integrity of large and complex structures exposed to a thermal environment, particularly in fields such as aerospace and nuclear engineering. Thermomechanical generalization of partial contact behaviour of a pin joint under combined in-plane mechanical loading and on-axis unidirectional heat flow has already been established by the authors for the analytically simpler domains of large plates. This paper successfully extends the on-going investigation to a single pin in a finite rectangular isotropic plate as a two-dimensional abstraction from a practical situation of a multipin fastener joint. The finite element method is used to analyse the joint problem under on-axis thermomechanical loading and unified load-contact relationships are established for a class of loading conditions.

Generalization of Abrams' law

Considering cement based composites as chemically bonded ceramics (CBC) the consequent strength development with age is essentially a constant volume solidification process, such that the hydrated gel particles fill the space resulting in the compatible gel space ratios. Analysis has been done of the extensively used graphical method of mix design (British method of mix design) i.e., the relation between the compressive strength and the free water - cement ratio. By considering the strength (S) at w/c 0.5 (S-0.5) as the reference state to reflect the synergetic effects between constituents of concrete a generalized relationship obtained is of the form {S/S-0.5} = a + b {1/(w/c)}.

Thermomechanical generalization of partial contact in pin joints

Mechanical fasteners introduce structural weakness, still they are an essential constituent of most structures as they permit interchangeability of parts and flexible construction programs; Variable temperature operations of Aerospace and Nuclear structures make it imperative to investigate the thermoelastic behaviour of joints. This paper explores analytically similar mechanical and thermal parameters to generalise the thermomechanical behaviour of a pin joint in an isotropic Sheet for a class of configurations. This generalization enables virtually direct application of existing information regarding joints under pure mechanical loading to joints subjected to combined thermomechanical loading, thus reducing the efforts of both the analyst and the designer by an order of magnitude. Copyright (C) 1996 Published by Elsevier Science Ltd.

Generalization of the collision cone approach for motion safety in 3-D environments

Avoidance of collision between moving objects in a 3-D environment is fundamental to the problem of planning safe trajectories in dynamic environments. This problem appears in several diverse fields including robotics, air vehicles, underwater vehicles and computer animation. Most of the existing literature on collision prediction assumes objects to be modelled as spheres. While the conservative spherical bounding box is valid in many cases, in many other cases, where objects operate in close proximity, a less conservative approach, that allows objects to be modelled using analytic surfaces that closely mimic the shape of the object, is more desirable. In this paper, a collision cone approach (previously developed only for objects moving on a plane) is used to determine collision between objects, moving in 3-D space, whose shapes can be modelled by general quadric surfaces. Exact collision conditions for such quadric surfaces are obtained and used to derive dynamic inversion based avoidance strategies.

On improving the generalization of SVM classifier

The generalization performance of the SVM classifier depends mainly on the VC dimension and the dimensionality of the data. By reducing the VC dimension of the SVM classifier, its generalization performance is expected to increase. In the present paper, we argue that the VC dimension of SVM classifier can be reduced by applying bootstrapping and dimensionality reduction techniques. Experimental results showed that bootstrapping the original data and bootstrapping the projected (dimensionally reduced) data improved the performance of the SVM classifier.

Generalization of deviated linear cyclic pursuit

Earlier work on cyclic pursuit systems has shown that using heterogeneous gains for agents in linear cyclic pursuit, the point of convergence (rendezvous point) can be chosen arbitrarily. But there are some restrictions on this set of reachable points. The use of deviated cyclic pursuit, as discussed in this paper, expands this set of reachable points to include points which are not reachable by any known linear cyclic pursuit scheme. The limits on the deviations are determined by stability considerations. Such limits have been analytically obtained in this paper along with results on the expansion in reachable set and the latter has also been verified through simulations.

Global response sensitivity analysis using probability distance measures and generalization of Sobol's analysis

The study introduces two new alternatives for global response sensitivity analysis based on the application of the L-2-norm and Hellinger's metric for measuring distance between two probabilistic models. Both the procedures are shown to be capable of treating dependent non-Gaussian random variable models for the input variables. The sensitivity indices obtained based on the L2-norm involve second order moments of the response, and, when applied for the case of independent and identically distributed sequence of input random variables, it is shown to be related to the classical Sobol's response sensitivity indices. The analysis based on Hellinger's metric addresses variability across entire range or segments of the response probability density function. The measure is shown to be conceptually a more satisfying alternative to the Kullback-Leibler divergence based analysis which has been reported in the existing literature. Other issues addressed in the study cover Monte Carlo simulation based methods for computing the sensitivity indices and sensitivity analysis with respect to grouped variables. Illustrative examples consist of studies on global sensitivity analysis of natural frequencies of a random multi-degree of freedom system, response of a nonlinear frame, and safety margin associated with a nonlinear performance function. (C) 2015 Elsevier Ltd. All rights reserved.