Recognizing that conspicuous multiple sclerosis (MS) lesions have high intensities in both dual-echo T2 and PDweighted MR brain images, we show that it is possible to automatically determine a thresholding mechanism to locate conspicuous lesion pixels and also to identify pixels that suffer from reduced intensity due to partial volume effects. To do so, we first transform a T2-PD feature space ...

Message type or message cluster extraction is an important task in automatic application log analysis. When the message types that exist in a log file are defined, they form the basis for carrying out other automatic application log analysis tasks. In this paper we introduce a novel algorithm for carrying out this task. IPLoM, which stands for Iterative Partitioning Log Mining, works through a ...

We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. We show that this problem can be solved in O(n log l) time if l ∈ O(log n), and that this is optimal in the algebraic computation tree model (we show that the Ω(n log l) lower bound holds for all values of l up to O( √ ...

aim : the aim of this study was to determine whether there is relation between body mass index and symptoms of gastro-esophageal reflux disease in our community using logit, probit and complementary log-log models. background : the most frequent statistical tool to address the relationship among a dichotomous response and other covariates is logistic regression. however logistic regression is f...

In this paper we study the problem of on-line multicasting on directed graphs, and we demonstrate the competitiveness of a greedy algorithm in a worst case analysis. We prove that the greedy algorithm performs almost as well as any on-line algorithm: the greedy upper bound is very close to the lower bound of any on-line algorithm. First, we improve on the upper bound of the oo-line greedy algor...

At Eurocrypt ’03, Goh and Jarecki showed that, contrary to other signature schemes in the discrete-log setting, the EDL signature scheme has a tight security reduction, namely to the Computational Diffie-Hellman (CDH) problem, in the Random Oracle (RO) model. They also remarked that EDL can be turned into an off-line/on-line signature scheme using the technique of Shamir and Tauman, based on ch...

We develop eecient algorithms for low and intermediate level image processing on the scan line array processor, a SIMD machine consisting of a linear array of cells that processes images in a scan line fashion. For low level processing, we present algorithms for block DFT, block DCT, convolution, template matching, shrinking, and expanding which run in real-time. By real-time, we mean that, if ...