Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts on two arbitrary memory locations. Experience suggested that current operations, typically single-word compare-and-swap (CAS1), are not expressive enough to be used alone in an eÆcient manner. In this paper we build CAS2 from CAS1 and, in fact, build an arbitrary mul...

Shared objects are the means by which processes gather and exchange information about the state of a distributed system. Objects that disclose more information about the system—and thus provide a more centralized view—are therefore more desirable. In this paper, we propose the schedule reconstruction (SR) problem as a new metric for the disclosure power of shared memory objects. In schedule rec...

In English-to-Chinese machine translation, reordering mistakes are frequently caused by miss-located prepositional phrases(PP). In English, a PP is often located after its attached host, while in Chinese things are the opposite. Recent phrase-based MT approaches tend to ignore such syntax information. In our work, we propose two strategies to resolve the above problem: first, for MT that adopts...

Locks are typically used to ensure exclusive access to shared memory locations. Unfortunately, lock operations are expensive, so much work has been done on optimizing their performance for common access patterns. One such pattern found for e.g., is in networking applications, where there is a single thread dominating lock accesses. An important trivial case of this occurs when a single-threaded...

This paper concerns software support for non-blocking transactions in shared-memory multiprocessors. We present mechanisms that convert sequential transactions into lock-free or wait-free ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory locations accessed cannot be determined in advance. Our implementations automatically detect and resolve con...

this paper is an investigation of $l$-dual frames with respect to a function-valued inner product, the so called $l$-bracket product on $l^{2}(g)$, where g is a locally compact abelian group with a uniform lattice $l$. we show that several well known theorems for dual frames and dual riesz bases in a hilbert space remain valid for $l$-dual frames and $l$-dual riesz bases in $l^{2}(g)$.

In this paper, we give a beginners guide to the practicality of using dual-quaternions to represent the rotations and translations in character-based hierarchies. Quaternions have proven themselves in many fields of science and computing as providing an unambiguous, un-cumbersome, computationally efficient method of representing rotational information. We hope after reading this paper the reade...

BACKGROUND AND PURPOSE Dual-source CTA and black-blood MRA are recently developed techniques for evaluating carotid stenosis. The purpose of this study was to compare dual-source CTA with black-blood MRA and conventional TOF MRA in both detecting carotid stenosis by using DSA as a reference standard and demonstrating plaque morphology. MATERIALS AND METHODS Thirty patients with suspected caro...

a heyting algebra is a distributive lattice with implication and a dual $bck$-algebra is an algebraic system having as models logical systems equipped with implication. the aim of this paper is to investigate the relation of heyting algebras between dual $bck$-algebras. we define notions of $i$-invariant and $m$-invariant on dual $bck$-semilattices and prove that a heyting semilattice is equiva...

In this work, Pseudo-Random Bit Generation (PRBG) based on 2D chaotic mappings of logistic type is considered. The sequences generated with two Pseudorandom Bit Generators (PRBGs) of this type are statistically tested and the computational effectiveness of the generators is estimated. The role played by the symmetry and the geometrical properties of the underlying chaotic attractors is also exp...