Displaying 1281 – 1300 of 1497

Showing per page

SURE shrinkage of Gaussian paths and signal identification*

Nicolas Privault, Anthony Réveillac (2012)

ESAIM: Probability and Statistics

Using integration by parts on Gaussian space we construct a Stein Unbiased Risk Estimator (SURE) for the drift of Gaussian processes, based on their local and occupation times. By almost-sure minimization of the SURE risk of shrinkage estimators we derive an estimation and de-noising procedure for an input signal perturbed by a continuous-time Gaussian noise.

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)

Annales de l'institut Fourier

In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an n -dimensional hypercube in the circuit switched, Δ -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...

Symmetric implicational restriction method of fuzzy inference

Yiming Tang, Wenbin Wu, Youcheng Zhang, Witold Pedrycz, Fuji Ren, Jun Liu (2021)

Kybernetika

The symmetric implicational method is revealed from a different perspective based upon the restriction theory, which results in a novel fuzzy inference scheme called the symmetric implicational restriction method. Initially, the SIR-principles are put forward, which constitute optimized versions of the triple I restriction inference mechanism. Next, the existential requirements of basic solutions are given. The supremum (or infimum) of its basic solutions is achieved from some properties of fuzzy...

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach...

T -extension as a method of construction of a generalized aggregation operator

Julija Lebedinska (2010)

Kybernetika

Generalized aggregation operators are the tool for aggregation of fuzzy sets. The apparatus was introduced by Takači in [11]. T -extension is a construction method of a generalized aggregation operator and we study it in the paper. We observe the behavior of a T -extension with respect to different order relations and we investigate properties of the construction.

Ternary wavelets and their applications to signal compression

Ghulam Mustafa, Falai Chen, Zhangjin Huang (2004)

International Journal of Applied Mathematics and Computer Science

We introduce ternary wavelets, based on an interpolating 4-point C^2 ternary stationary subdivision scheme, for compressing fractal-like signals. These wavelets are tightly squeezed and therefore they are more suitable for compressing fractal-like signals. The error in compressing fractal-like signals by ternary wavelets is at most half of that given by four-point wavelets (Wei and Chen, 2002). However, for compressing regular signals we further classify ternary wavelets into 'odd ternary' and 'even...

The (16,6,2) designs.

Assmus, E.F.jun., Salwach, Chester J. (1979)

International Journal of Mathematics and Mathematical Sciences

The accessibility of an access structure

Francesc Carreras, Antonio Magaña, Carlo Munuera (2006)

RAIRO - Theoretical Informatics and Applications

In secret sharing, different access structures have different difficulty degrees for acceding to the secret. We give a numerical measure of how easy or how difficult is to recover the secret, depending only on the structure itself and not on the particular scheme used for realizing it. We derive some consequences.

Currently displaying 1281 – 1300 of 1497