This poster describes our initial work in applying assurance cases to the requirements engineering processes necessary in building interoperable medical device systems. 1998 ACM Subject Classification D.2.9 Management, K.6.3 Software Management, K.6.4 System Management

We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set X in a metric space, it is proved the existence of an almost periodic sequence {ψk}k∈Z such that {ψk; k ∈ Z} = X and ψk = ψk+lq(k), l ∈ Z for all...

In this paper, we propose a novel model for Document Representation in an attempt to address the problem of huge dimensionality and vector sparseness that are commonly faced in Text Classification tasks. The proposed model consists of representing text documents in the space of training documents at a first stage. Afterward, the generated vectors are projected in a new space where the number of...

In this paper, we propose a scheme for solving the k-mutual exclusion problem in a distributed system, which is a generalization of the quorum based scheme for solving the distributed mutual exclusion problem. The proposed scheme uses a set of weighted quorums as the underlying structure, which can be constructed from any quorum system by applying the technique of k-decomposition. The notion of...

We propose a rank-k variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation (1-SVD) in Frank-Wolfe with a top-k singular-vector computation (k-SVD), which can be done by repeatedly applying 1-SVD k times. Our algorithm has a linear convergence rate when the objective function is smooth and str...

We seek to perform efficient queries for the predecessor among n values stored in k sorted arrays. Evading the Ω(n log k) lower bound from merging k arrays, we support predecessor queries in O(logn) time after O(n log( k logn )) construction time. By applying Ben-Or’s technique, we establish that this is optimal for strict predecessor queries, i.e., every data structure supporting O(logn)-time ...

one of the common problems in reflection seismic records in the land is the existence of surface waves with high amplitude and low frequency which cause the most important parts of reflective signals to be masked. therefore, it is necessary to attenuate them by processing and acquisition methods. as it is impossible to attenuate the surface waves completely, and sometimes it is likely to damage...