A fast finite difference method is proposed to solve the incompressible Navier-Stokes equations defined on a general domain. The method is based on the vorticity stream-function formulation and a fast Poisson solver defined on a general domain using the immersed interface method. The key to the new method is the fast Poisson solver for general domains and the interpolation scheme for the bounda...

As most data stream sources exhibit bursty data rates, data stream management systems must recurrently cope with load spikes that exceed the average workload to a considerable degree. To guarantee low-latency processing results, load has to be shed from the stream, when data rates overstress system resources. There exist numerous load shedding strategies to delete excess data. However, the cons...

[1] The long-term (1935–1999) monthly records of temperature, precipitation, stream flow, river ice thickness, and active layer depth have been analyzed in this study to examine Lena River hydrologic regime and recent change. Remarkable hydrologic changes have been identified in this study. During the cold season (October–April), significant increases (25–90%) in stream flow and decrease in riv...

Hearing one's own voice is important for regulating ongoing speech and for mapping speech sounds onto articulator movements. However, it is currently unknown whether attention mediates changes in the relationship between motor commands and their acoustic output, which are necessary as growth and aging inevitably cause changes to the vocal tract. In this study, participants produced vocalization...

In data stream applications, streams typically arise from a geographically distributed collection of producers and may be queried by consumers, which may be distributed as well. In such a setting, a query can be seen as a subscription asking to be informed of all tuples that satisfy a specific condition. We propose to support the publishing and querying of distributed data streams by a publish/...

This paper shows that a turbo-coded communication system can be made secure with a little bit of complexity cost. The classical permutation ciphers are revisited and analyzed. Firstly, the ideal stream permutation ciphers are shown to be asymptotically information-theoretically secure in the sense that the channel from plaintext to ciphertext has a vanished capacity, while the practical stream ...

In small-lot, multi-product, multi-level assembly systems, kitting (or accumulating) components required for assembly plays a crucial role in determining system performance, especially when the system operates in a stochastic environment. This paper analyzes the kitting process of a stochastic assembly system, treating it as an assembly-like queue. If components arrive according to Poisson proc...

We propose an alternative approach to branch resolution based on the earlier work on decoupled memory architectures. Branch decoupling is a technique to decouple a single instruction stream program into two streams. One stream is solely dedicated to resolving branches as early as possible (both the branch condition and the branch target). The resolved branch targets are consumed by the other co...

The solution of the prediction problem is presented for the finite possibilistic modelling [3,4,6,7]. A recurrent variant of finite possibilistic models is considered. In this variant, we define the regularization condition for constructing a quasi-optimal estimator of fuzzy transition operator (FTO). We construct the discrete recurrent extremal fuzzy process with possibilistic uncertainty, the...