Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: synchrony

Sortuj według:

Ogranicz wyniki do:

A comparison of algorithms for separation of synchronous subspaces

Almeida M., Bioucas-Dias J., Vigário R., Oja E.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2012

Vol. 60, nr 3

455-460

Independent Subspace Analysis (ISA) consists in separating sets (subspaces) of dependent sources, with different sets being independent of each other. While a few algorithms have been proposed to solve this problem, they are all completely general in the sense that they do not make any assumptions on the intra-subspace dependency. In this paper, we address the ISA problem in the specific context of Separation of Synchronous Sources (SSS), i.e., we aim to solve the ISA problem when the intra-subspace dependency is known to be perfect phase synchrony between all sources in that subspace. We compare multiple algorithmic solutions for this problem, by analyzing their performance on an MEG-like dataset.

From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations

Potop-Butucaru D., Sorel Y., Simone R. de, Talpin J.-P.

Fundamenta Informaticae

2011

Vol. 108, nr 1/2

91-118

We propose a generalmethod to characterize and synthesize correctness-preserving asynchronous wrappers for synchronous processes on a globally asynchronous locally synchronous (GALS) architecture. While a synchronous process may rely on the absence of a signal to trigger a reaction, sensing absence in an asynchronous environment may be unfeasible due to uncontrolled communication latencies. A simple and common solution is to systematically encode and send absence notifications, but it is unduly expensive at run-time. Instead, our approach is based on the theory of weakly endochronous systems, which defines the largest sub-class of synchronous systems where (possibly concurrent) asynchronous evaluation is faithful to the original (synchronous) specification. Our method considers synchronous processes or modules that are specified by synchronization constraints expressed in a high-level multi-clock synchronous reactive formalism. The algorithm uses a compact representation of the abstract synchronization configurations of the analyzed process and determines a minimal set of synchronization patterns generating by union all its possible reactions. A specification is weakly endochronous if and only if these generators do not need explicit absence information. In this case, the set of generators can directly be used to synthesize the concurrent asynchronous multi-rate wrapper of the process.