Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-to-word transducers.Comment: short version of this paper will be published in the proceedings of the 20th Conference on Developments in Language Theory (DLT 2016), Montreal, Canad

On the tree-transformation power of XSLT

XSLT is a standard rule-based programming language for expressing transformations of XML data. The language is currently in transition from version 1.0 to 2.0. In order to understand the computational consequences of this transition, we restrict XSLT to its pure tree-transformation capabilities. Under this focus, we observe that XSLT~1.0 was not yet a computationally complete tree-transformation language: every 1.0 program can be implemented in exponential time. A crucial new feature of version~2.0, however, which allows nodesets over temporary trees, yields completeness. We provide a formal operational semantics for XSLT programs, and establish confluence for this semantics

Causality and replication in concurrent processes

The replication operator was introduced by Milner for obtaining a simplified description of recursive processes. The standard interleaving semantics denotes the replication of a process P, written !P, a shorthand for its unbound parallel composition, operationally equivalent to the process P | P | …, with P repeated as many times as needed. Albeit the replication mechanism has become increasingly popular, investigations on its causal semantics has been scarce. In fact, the correspondence between replication and unbound parallelism makes it difficult to recover basic properties usually associated with these semantics, such as the so-called concurrency diamond. In this paper we consider the interleaving semantics for the operator proposed by Sangiorgi and Walker, and we show how to refine it in order to capture causality. Furthermore, we prove it coincident with the standard causal semantics for recursive process studied in the literature, for processes defined by means of constant invocations

Comparing ischaemic stroke in six European countries. The EuroHOPE register study.

BACKGROUND AND PURPOSE: The incidence of hospitalizations, treatment and case fatality of ischaemic stroke were assessed utilizing a comprehensive multinational database to attempt to compare the healthcare systems in six European countries, aiming also to identify the limitations and make suggestions for future improvements in the between-country comparisons. METHODS: National registers of hospital discharges for ischaemic stroke identified by International Classification of Diseases codes 433-434 (ICD-9) and code I63 (ICD-10), medication purchases and mortality were linked at the patient level in each of the participating countries and regions: Finland, Hungary, Italy, the Netherlands, Scotland and Sweden. Patients with an index admission in 2007 were followed for 1 year. RESULTS: In all, 64 170 patients with a disease code for ischaemic stroke were identified. The number of patients registered per 100 000 European standard population ranged from 77 in Scotland to 407 in Hungary. Large differences were observed in medication use. The age- and sex-adjusted all-cause case fatality amongst hospitalized patients at 1 year from stroke was highest in Hungary at 31.0% (95% confidence interval 30.5-31.5). Regional differences in age- and sex-adjusted 1-year case fatality within countries were largest in Hungary (range 23.6%-37.6%) and smallest in the Netherlands (20.5%-27.3%). CONCLUSIONS: It is feasible to link population-wide register data amongst European countries to describe incidence of hospitalizations, treatment patterns and case fatality of ischaemic stroke on a national level. However, the coverage and validity of administrative register data for ischaemic stroke should be developed further, and population-based and clinical stroke registers should be created to allow better control of case mix

The polypill in the primary prevention of cardiovascular disease: cost-effectiveness in the Dutch population

OBJECTIVES: The aim of the present study was to estimate the cost-effectiveness of the polypill in the primary prevention of cardiovascular disease. DESIGN: A health economic modeling study. SETTING: Primary health care in the Netherlands. PARTICIPANTS: Simulated individuals from the general Dutch population, aged 45-75 years of age. INTERVENTIONS: Opportunistic screening followed by prescription of the polypill to eligible individuals. Eligibility was defined as having a minimum 10-year risk of cardiovascular death as assessed with the SCORE function of alternatively 5%, 7.5%, or 10%. Different versions of the polypill were considered, depending on composition: 1) the Indian polycap, with three different types of blood pressure lowering drugs, a statin, and aspirin; 2) as 1) but without aspirin; 3) as 2) but with a double statin dose. In addition, a scenario of (targeted) separate antihypertensive and/or statin medication was simulated. PRIMARY OUTCOME MEASURES: Cases of acute myocardial infarction or stroke prevented, QALYs gained, and the costs per QALY gained. All interventions were compared with usual care. RESULTS: All scenarios were cost-effective with an incremental cost-effectiveness ratio between €7,900-12,300 per QALY compared with usual care. Most health gains were achieved with the polypill without aspirin and containing a double dose of statins. With a 10-year risk of 7.5% as threshold, this pill would prevent approximately 3.5% of all cardiovascular events. CONCLUSIONS: Opportunistic screening based on global cardiovascular risk assessment followed by polypill prescription to those with increased risk offers a cost-effective strategy. Most health gain is achieved by the polypill without aspirin and a double statin dose

Partial Homology Relations - Satisfiability in terms of Di-Cographs

Directed cographs (di-cographs) play a crucial role in the reconstruction of evolutionary histories of genes based on homology relations which are binary relations between genes. A variety of methods based on pairwise sequence comparisons can be used to infer such homology relations (e.g.\ orthology, paralogy, xenology). They are \emph{satisfiable} if the relations can be explained by an event-labeled gene tree, i.e., they can simultaneously co-exist in an evolutionary history of the underlying genes. Every gene tree is equivalently interpreted as a so-called cotree that entirely encodes the structure of a di-cograph. Thus, satisfiable homology relations must necessarily form a di-cograph. The inferred homology relations might not cover each pair of genes and thus, provide only partial knowledge on the full set of homology relations. Moreover, for particular pairs of genes, it might be known with a high degree of certainty that they are not orthologs (resp.\ paralogs, xenologs) which yields forbidden pairs of genes. Motivated by this observation, we characterize (partial) satisfiable homology relations with or without forbidden gene pairs, provide a quadratic-time algorithm for their recognition and for the computation of a cotree that explains the given relations

One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs

Dynamic Fault Trees (DFTs) are a prominent model in reliability engineering. They are strictly more expressive than static fault trees, but this comes at a price: their interpretation is non-trivial and leaves quite some freedom. This paper presents a GSPN semantics for DFTs. This semantics is rather simple and compositional. The key feature is that this GSPN semantics unifies all existing DFT semantics from the literature. All semantic variants can be obtained by choosing appropriate priorities and treatment of non-determinism.Comment: Accepted at Petri Nets 201

Generalized alignment-based trace clustering of process behavior

Process mining techniques use event logs containing real process executions in order to mine, align and extend process models. The partition of an event log into trace variants facilitates the understanding and analysis of traces, so it is a common pre-processing in process mining environments. Trace clustering automates this partition; traditionally it has been applied without taking into consideration the availability of a process model. In this paper we extend our previous work on process model based trace clustering, by allowing cluster centroids to have a complex structure, that can range from a partial order, down to a subnet of the initial process model. This way, the new clustering framework presented in this paper is able to cluster together traces that are distant only due to concurrency or loop constructs in process models. We show the complexity analysis of the different instantiations of the trace clustering framework, and have implemented it in a prototype tool that has been tested on different datasets.Peer ReviewedPostprint (author's final draft