We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...

background and aim: carcinoma of the uterine cervix is a significant cause of mortality because of malignancy in women. radiotherapy is a major treatment modality for invasive cervical cancer with good treatment outcome in early-stage patients. however, substantial treatment failures still occur in the advanced-stage patients. in this case report a long term follow up of a 58 years old woman wi...

By studying recurrence time statistics for chaotic systems, we identify two different types of recurrences and develop scaling laws relating the mean recurrence time to the information dimension of the chaotic attractor. We then design two novel and simple ways of using the recurrence time statistics for analyzing transient as well as nonstationary time series. We show that the methods are capa...

Given a set of time series, our goal is to identify prototypes that cover the maximum possible amount of occurring subsequences regardless of their order. This scenario appears in the context of the automotive industry, where the goal is to determine operational profiles that comprise frequently recurring driving behavior patterns. This problem can be solved by clustering, however, standard dis...

In music analysis it is a common requirement to search a musical score for occurrences of a particular musical motif and its variants. This tedious and time-consuming task can be carried out by computer, using one of several models to specify which variants are to be included in the search. The question arises: just how many variants must be explicitly considered? The answer has a profound effe...