130 research outputs found

    Quantitative Regular Expressions for Arrhythmia Detection Algorithms

    Full text link
    Motivated by the problem of verifying the correctness of arrhythmia-detection algorithms, we present a formalization of these algorithms in the language of Quantitative Regular Expressions. QREs are a flexible formal language for specifying complex numerical queries over data streams, with provable runtime and memory consumption guarantees. The medical-device algorithms of interest include peak detection (where a peak in a cardiac signal indicates a heartbeat) and various discriminators, each of which uses a feature of the cardiac signal to distinguish fatal from non-fatal arrhythmias. Expressing these algorithms' desired output in current temporal logics, and implementing them via monitor synthesis, is cumbersome, error-prone, computationally expensive, and sometimes infeasible. In contrast, we show that a range of peak detectors (in both the time and wavelet domains) and various discriminators at the heart of today's arrhythmia-detection devices are easily expressible in QREs. The fact that one formalism (QREs) is used to describe the desired end-to-end operation of an arrhythmia detector opens the way to formal analysis and rigorous testing of these detectors' correctness and performance. Such analysis could alleviate the regulatory burden on device developers when modifying their algorithms. The performance of the peak-detection QREs is demonstrated by running them on real patient data, on which they yield results on par with those provided by a cardiologist.Comment: CMSB 2017: 15th Conference on Computational Methods for Systems Biolog

    Pattern Matching in Link Streams: a Token-based Approach

    Get PDF
    International audienceLink streams model the dynamics of interactions in complex distributed systems as sequences of links (interactions) occurring at a given time. Detecting patterns in such sequences is crucial for many applications but it raises several challenges. In particular, there is no generic approach for the specification and detection of link stream patterns in a way similar to regular expressions and automata for text patterns. To address this, we propose a novel automata framework integrating both timed constraints and finite memory together with a recognition algorithm. The algorithm uses structures similar to tokens in high-level Petri nets and includes non-determinism and concurrency. We illustrate the use of our framework in real-world cases and evaluate its practical performances

    Efficient Online Timed Pattern Matching by Automata-Based Skipping

    Full text link
    The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log ww and a specification A\mathcal{A} (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log ww, when restricted to the interval, satisfies the specification A\mathcal{A}. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle the problem of online timed pattern matching, towards embedded applications where it is vital to process a vast amount of incoming data in a timely manner. Specifically, we start with the Franek-Jennings-Smyth (FJS) string matching algorithm---a recent variant of the BM algorithm---and extend it to timed pattern matching. Our experiments indicate the efficiency of our FJS-type algorithm in online and offline timed pattern matching

    LNCS

    Get PDF
    We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated

    LNCS

    Get PDF
    We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring

    Relation between the frequency of CD34+ bone marrow derived circulating progenitor cells and the number of diseased coronary arteries in patients with myocardial ischemia and diabetes

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Bone marrow-derived circulating progenitor cells (BM-CPCs) in patients with coronary heart disease are impaired with respect to number and mobilization. However, it is unknown whether the mobilization of BM-CPCs depends on the number of diseased coronary arteries. Therefore, in our study, we analysed the correlation between the diseased coronary arteries and the frequency of CD34/45+ BM-CPCs in peripheral blood (PB) in patients with ischemic heart disease (IHD).</p> <p>Methods</p> <p>The frequency of CD34/45<sup>+ </sup>BM-CPCs was measured by flow cytometry in 120 patients with coronary 1 vessel (IHD1, n = 40), coronary 2 vessel (IHD2, n = 40), coronary 3 vessel disease (IHD3, n = 40) and in a control group of healthy subjects (n = 40). There was no significant difference of the total number of cardiovascular risk factors between IHD groups, beside diabetes mellitus (DM), which was significantly higher in IHD3 group compared to IHD2 and IHD1 groups.</p> <p>Results</p> <p>The frequency of CD34/45<sup>+ </sup>BM-CPCs was significantly reduced in patients with IHD compared to the control group (CD34/45<sup>+</sup>; p < 0.001). The frequency of BM-CPCs was impaired in patients with IHD3 compared to IHD1 (CD34/45<sup>+</sup>; p < 0.001) and to IHD2 (CD34/45<sup>+</sup>; p = 0.001). But there was no significant difference in frequency of BM-CPCs between the patients with IHD2 and IHD1 (CD34/45<sup>+</sup>; p = 0.28). In a subgroup we observed a significant negative correlation between levels of hemoglobin AIc (HbAIc) and the frequency of BM-CPCs (CD34/45<sup>+</sup>; p < 0.001, r = -0.8).</p> <p>Conclusions</p> <p>The frequency of CD34/45<sup>+ </sup>BM-CPCs in PB is impaired in patients with IHD. This impairment may augment with an increased number of diseased coronary arteries. Moreover, the frequency of CD34/45<sup>+ </sup>BM-CPCs in ischemic tissue is further impaired by diabetes in patients with IHD.</p

    Serum procalcitonin and CRP levels in non-alcoholic fatty liver disease: a case control study

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Both C reactive protein (CRP) and procalcitonin (PCT) are well known acute phase reactant proteins. CRP was reported to increase in metabolic syndrome and type-2 diabetes. Similarly altered level of serum PCT was found in chronic liver diseases and cirrhosis. The liver is considered the main source of CRP and a source of PCT, however, the serum PCT and CRP levels in non-alcoholic fatty liver disease (NAFLD) were not compared previously. Therefore we aimed to study the diagnostic and discriminative role of serum PCT and CRP in NAFLD.</p> <p>Methods</p> <p>Fifty NAFLD cases and 50 healthy controls were included to the study. Liver function tests were measured, body mass index was calculated, and insulin resistance was determined by using a homeostasis model assessment (HOMA-IR). Ultrasound evaluation was performed for each subject. Serum CRP was measured with nephalometric method. Serum PCT was measured with Kryptor based system.</p> <p>Results</p> <p>Serum PCT levels were similar in steatohepatitis (n 20) and simple steatosis (n 27) patients, and were not different than the control group (0.06 ± 0.01, 0.04 ± 0.01 versus 0.06 ± 0.01 ng/ml respectively). Serum CRP levels were significantly higher in simple steatosis, and steatohepatitis groups compared to healthy controls (7.5 ± 1.6 and 5.2 ± 2.5 versus 2.9 ± 0.5 mg/dl respectively p < 0.01). CRP could not differentiate steatohepatitis from simple steatosis. Beside, three patients with focal fatty liver disease had normal serum CRP levels.</p> <p>Conclusion</p> <p>Serum PCT was within normal ranges in patients with simple steatosis or steatohepatitis and has no diagnostic value. Serum CRP level was increased in NAFLD compared to controls. CRP can be used as an additional marker for diagnosis of NAFLD but it has no value in discrimination of steatohepatitis from simple steatosis.</p

    Screening and diagnostic breast MRI: how do they impact surgical treatment? Insights from the MIPA study

    Get PDF
    Objectives: To report mastectomy and reoperation rates in women who had breast MRI for screening (S-MRI subgroup) or diagnostic (D-MRI subgroup) purposes, using multivariable analysis for investigating the role of MRI referral/nonreferral and other covariates in driving surgical outcomes. Methods: The MIPA observational study enrolled women aged 18–80 years with newly diagnosed breast cancer destined to have surgery as the primary treatment, in 27 centres worldwide. Mastectomy and reoperation rates were compared using non-parametric tests and multivariable analysis. Results: A total of 5828 patients entered analysis, 2763 (47.4%) did not undergo MRI (noMRI subgroup) and 3065 underwent MRI (52.6%); of the latter, 2441/3065 (79.7%) underwent MRI with preoperative intent (P-MRI subgroup), 510/3065 (16.6%) D-MRI, and 114/3065 S-MRI (3.7%). The reoperation rate was 10.5% for S-MRI, 8.2% for D-MRI, and 8.5% for P-MRI, while it was 11.7% for noMRI (p ≤ 0.023 for comparisons with D-MRI and P-MRI). The overall mastectomy rate (first-line mastectomy plus conversions from conserving surgery to mastectomy) was 39.5% for S-MRI, 36.2% for P-MRI, 24.1% for D-MRI, and 18.0% for noMRI. At multivariable analysis, using noMRI as reference, the odds ratios for overall mastectomy were 2.4 (p < 0.001) for S-MRI, 1.0 (p = 0.957) for D-MRI, and 1.9 (p < 0.001) for P-MRI. Conclusions: Patients from the D-MRI subgroup had the lowest overall mastectomy rate (24.1%) among MRI subgroups and the lowest reoperation rate (8.2%) together with P-MRI (8.5%). This analysis offers an insight into how the initial indication for MRI affects the subsequent surgical treatment of breast cancer. Key Points: • Of 3065 breast MRI examinations, 79.7% were performed with preoperative intent (P-MRI), 16.6% were diagnostic (D-MRI), and 3.7% were screening (S-MRI) examinations. • The D-MRI subgroup had the lowest mastectomy rate (24.1%) among MRI subgroups and the lowest reoperation rate (8.2%) together with P-MRI (8.5%). • The S-MRI subgroup had the highest mastectomy rate (39.5%) which aligns with higher-than-average risk in this subgroup, with a reoperation rate (10.5%) not significantly different to that of all other subgroups

    Moving Beyond Mimicry: Developing Hybrid Spaces in Indian Business Schools

    Get PDF
    This article analyses the identity work of Indian management educators and scholars as they seek to establish, maintain and revise a sense of self in the context of business school globalization. We show how globalization, combined with the historical legacy of colonialism, renders Indian scholars precarious in their interactions with Western business schools. Based on a qualitative interview study, we explore how Indian business school scholars perform their identities in the context of neo-colonial relations, which are characterised by the dominance of English language and a pressure to conform to research norms set by globally-ranked journals. Drawing on postcolonial theory, our argument focuses on mimicry as a distinctive form of identity work that involves maintaining difference between Western and non-Western identities by 'Othering' Indian scholars, while simultaneously seeking to transform them. We draw attention to ambivalence within participants' accounts, which we suggest arises because the authority of Western scholarship relies on maintaining non-Western scholars in a position of alterity or 'not quite-ness'. We suggest that hybridity offers an opportunity to disrupt and question current practices of business school globalization and facilitate scholarly engagement that reflects more diverse philosophical positions and worldviews
    corecore