Complete and interpretable conformance checking of business processes

This article presents a method for checking the conformance between an event log capturing the actual execution of a business process, and a model capturing its expected or normative execution. Given a business process model and an event log, the method returns a set of statements in natural language describing the behavior allowed by the process model but not observed in the log and vice versa. The method relies on a unified representation of process models and event logs based on a well-known model of concurrency, namely event structures. Specifically, the problem of conformance checking is approached by folding the input event log into an event structure, unfolding the process model into another event structure, and comparing the two event structures via an error-correcting synchronized product. Each behavioral difference detected in the synchronized product is then verbalized as a natural language statement. An empirical evaluation shows that the proposed method scales up to real-life datasets while producing more concise and higher-level difference descriptions than state-of-the-art conformance checking methods.

A necessary and sufficient condition for acyclic graphs

This letter gives a new necessary and sufficient condition to determine whether a directed graph is acyclic.

Growth of Mycobacterium smegmatis in minimal and complete media

The growth patterns of Mycobacterium smegmatis SN2 in a minimal medium and in nutrient broth have been compared. The growth was monitored by absorbancy (Klett readings), colony forming units, wet weight and content of DNA, RNA and protein. During the early part of the growth cycle, the bacteria had higher wet weight and macromolecular content in nutrient broth than in minimal media. During the latter half of the growth cycle however, biosynthesis stopped much earlier in nutrient broth and the bacteria had a much lower content of macromolecules than in the minimal medium. In both the media, a general pattern of completing biosynthesis rapidly in the initial phase and a certain amount of cell division at a later time involving the distribution of preformed macromolecules was seen. The possible adaptive significance of this observation has been discussed.

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).

The complete validated mitochondrial genome of the silver gemfish Rexea solandri (Cuvier, 1832) (Perciformes, Gempylidae)

The silver gemfish Rexea solandri is an important economic resource but vulnerable to overfishing in Australian waters. The complete mitochondrial genome sequence is described from 1.6 million reads obtained via next generation sequencing. The total length of the mitogenome is 16,350 bp comprising 2 rRNA, 13 protein-coding genes, 22 tRNA and 2 non-coding regions. The mitogenome sequence was validated against sequences of PCR fragments and BLAST queries of Genbank. Gene order was equivalent to that found in marine fishes.

Complete cytogenetic response and major molecular response as surrogate outcomes for overall survival in first-line treatment of chronic myelogenous leukemia: A case study for technology appraisal on the basis of surrogate outcomes evidence

Objectives In 2012, the National Institute for Health and Care Excellence assessed dasatinib, nilotinib, and standard-dose imatinib as first-line treatment of chronic phase chronic myelogenous leukemia (CML). Licensing of these alternative treatments was based on randomized controlled trials assessing complete cytogenetic response (CCyR) and major molecular response (MMR) at 12 months as primary end points. We use this case study to illustrate the validation of CCyR and MMR as surrogate outcomes for overall survival in CML and how this evidence was used to inform National Institute for Health and Care Excellence’s recommendation on the public funding of these first-line treatments for CML. Methods We undertook a systematic review and meta-analysis to quantify the association between CCyR and MMR at 12 months and overall survival in patients with chronic phase CML. We estimated life expectancy by extrapolating long-term survival from the weighted overall survival stratified according to the achievement of CCyR and MMR. Results Five studies provided data on the observational association between CCyR or MMR and overall survival. Based on the pooled association between CCyR and MMR and overall survival, our modeling showed comparable predicted mean duration of survival (21–23 years) following first-line treatment with imatinib, dasatinib, or nilotinib. Conclusions This case study illustrates the consideration of surrogate outcome evidence in health technology assessment. Although it is often recommended that the acceptance of surrogate outcomes be based on randomized controlled trial data demonstrating an association between the treatment effect on both the surrogate outcome and the final outcome, this case study shows that policymakers may be willing to accept a lower level of evidence (i.e., observational association).

Colony - Complete

Digital image

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

First complete genome sequence of a capsicum chlorosis tospovirus isolate from Australia with an unusually large S RNA intergenic region

The first complete genome sequence of capsicum chlorosis virus (CaCV) from Australia was determined using a combination of Illumina HiSeq RNA and Sanger sequencing technologies. Australian CaCV had a tripartite genome structure like other CaCV isolates. The large (L) RNA was 8913 nucleotides (nt) in length and contained a single open reading frame (ORF) of 8634 nt encoding a predicted RNA-dependent RNA polymerase (RdRp) in the viral-complementary (vc) sense. The medium (M) and small (S) RNA segments were 4846 and 3944 nt in length, respectively, each containing two non-overlapping ORFs in ambisense orientation, separated by intergenic regions (IGR). The M segment contained ORFs encoding the predicted non-structural movement protein (NSm; 927 nt) and precursor of glycoproteins (GP; 3366 nt) in the viral sense (v) and vc strand, respectively, separated by a 449-nt IGR. The S segment coded for the predicted nucleocapsid (N) protein (828 nt) and non-structural suppressor of silencing protein (NSs; 1320 nt) in the vc and v strand, respectively. The S RNA contained an IGR of 1663 nt, being the largest IGR of all CaCV isolates sequenced so far. Comparison of the Australian CaCV genome with complete CaCV genome sequences from other geographic regions showed highest sequence identity with a Taiwanese isolate. Genome sequence comparisons and phylogeny of all available CaCV isolates provided evidence for at least two highly diverged groups of CaCV isolates that may warrant re-classification of AIT-Thailand and CP-China isolates as unique tospoviruses, separate from CaCV.

Complete genome sequence and integrated protein localization and interaction map for alfalfa dwarf virus, which combines properties of both cytoplasmic and nuclear plant rhabdoviruses

Summary We have determined the full-length 14,491-nucleotide genome sequence of a new plant rhabdovirus, alfalfa dwarf virus (ADV). Seven open reading frames (ORFs) were identified in the antigenomic orientation of the negative-sense, single-stranded viral RNA, in the order 3′-N-P-P3-M-G-P6-L-5′. The ORFs are separated by conserved intergenic regions and the genome coding region is flanked by complementary 3′ leader and 5′ trailer sequences. Phylogenetic analysis of the nucleoprotein amino acid sequence indicated that this alfalfa-infecting rhabdovirus is related to viruses in the genus Cytorhabdovirus. When transiently expressed as GFP fusions in Nicotiana benthamiana leaves, most ADV proteins accumulated in the cell periphery, but unexpectedly P protein was localized exclusively in the nucleus. ADV P protein was shown to have a homotypic, and heterotypic nuclear interactions with N, P3 and M proteins by bimolecular fluorescence complementation. ADV appears unique in that it combines properties of both cytoplasmic and nuclear plant rhabdoviruses.

Jumping numbers of a simple complete ideal in a two-dimensional regular local ring

The multiplier ideals of an ideal in a regular local ring form a family of ideals parametrized by non-negative rational numbers. As the rational number increases the corresponding multiplier ideal remains unchanged until at some point it gets strictly smaller. A rational number where this kind of diminishing occurs is called a jumping number of the ideal. In this manuscript we shall give an explicit formula for the jumping numbers of a simple complete ideal in a two dimensional regular local ring. In particular, we obtain a formula for the jumping numbers of an analytically irreducible plane curve. We then show that the jumping numbers determine the equisingularity class of the curve.

Complete genome sequence and intracellular protein localization of Datura yellow vein nucleorhabdovirus

A limited number of plant rhabdovirus genomes have been fully sequenced, making taxonomic classification, evolutionary analysis and molecular characterization of this virus group difficult. We have for the first time determined the complete genome sequence of 13,188 nucleotides of Datura yellow vein nucleorhabdovirus (DYVV). DYVV genome organization resembles that of its closest relative, Sonchus yellow net virus (SYNV), with six ORFs in antigenomic orientation, separated by highly conserved intergenic regions and flanked by complementary 3′ leader and 5′ trailer sequences. As is typical for nucleorhabdoviruses, all viral proteins, except the glycoprotein, which is targeted to the endoplasmic reticulum, are localized to the nucleus. Nucleocapsid (N) protein, matrix (M) protein and polymerase, as components of nuclear viroplasms during replication, have predicted strong canonical nuclear localization signals, and N and M proteins exclusively localize to the nucleus when transiently expressed as GFP fusions. As in all nucleorhabdoviruses studied so far, N and phosphoprotein P interact when co-expressed, significantly increasing P nuclear localization in the presence of N protein. This research adds to the list of complete genomes of plant-infecting rhabdoviruses, provides molecular tools for further characterization and supports classification of DYVV as a nucleorhabdovirus closely related to but with some distinct differences from SYNV.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.