This study was conducted to determine the prevalence of PE in patients with V/Q scans interpreted as representing a very low probability (VLP) of PE (1-3 small segmental perfusion defects with a normal chest radiograph). An analysis of the entire data set obtained during the PIOPED study was performed. Of the total of 1,359 patients in whom the presence or absence of PE was confirmed, 80 ...

We present ASCA observations of LINERs without broad Hα emission in their optical spectra. The sample of “type 2” LINERs consists of NGC 404, 4111, 4192, 4457, and 4569. We have detected X-ray emission from all the objects except for NGC 404; among the detected objects are two so-called transition objects (NGC 4192 and NGC 4569), which have been postulated to be composite nuclei having both an ...

In this paper we study the automation of test derivation and execution in the area of conformance testing. The test scenarios are derived from multiple specification languages: LOTOS, Promela and SDL. A central theme of this study is the usability of batch-oriented and on-the-fly testing approaches. To facilitate the derivation from multiple formal description techniques and the different test ...

There are many opportunities and threats in the decision-making environment for managers, and an organization must use research and information systems to change, monitor, and anticipate this environment. Futurism reflects how tomorrow reality gives birth to tomorrow's reality is. The purpose of this research; Analyzing the role of futures studies in the existing patterns of critical factors of...

Let G be a finite abelian group, let 0 < α < 1, and let A ⊆ G be a random set of size |G|. We let μ(A) = max B,C:|B|=|C|=|A| |{(a, b, c) ∈ A×B × C : a = b+ c}|. The issue is to determine upper bounds on μ(A) that hold with high probability over the random choice of A. Mennink and Preneel [4] conjecture that μ(A) should be close to |A| (up to possible logarithmic factors in |G|) for α ≤ 1/2 and ...

We shall show that the union-closed families conjecture holds for a random union-closed family with high probability. This strengthens a recent result of Bruhn and Schaudt.

We present a new analysis of sparse oblivious subspace embeddings, based on the ”matrix Chernoff” technique. These are probability distributions over (relatively) sparse matrices such that for any d-dimensional subspace of R, the norms of all vectors in the subspace are simultaneously approximately preserved by the embedding with high probability–typically with parameters depending on d but not...

It has long been known that random regular graphs are with high probability good expanders. This was first established in the 1980s by Bollobás by directly calculating the probability that a set of vertices has small expansion and then applying the union bound. In this paper we improve on this analysis by relying on a simple high-level observation: if a graph contains a set of vertices with sma...