All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 28 Next

Displaying 541 – 560 of 1507

Showing per page

Gate circuits in the algebra of transients

Janusz Brzozowski, Mihaela Gheorghiu (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0 s and 1 s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0 s and 1 s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...

Gate circuits in the algebra of transients

Janusz Brzozowski, Mihaela Gheorghiu (2010)

RAIRO - Theoretical Informatics and Applications


We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...

Generador de seqüències de test per circuits integrats NMOS.

Carles Ferrer Ramis, Jean Pierre Deschamps, Joan Oliver Malagelada, Jordi Carrabina Bordoll, Elena Valderrama Vallés (1987)

Qüestiió

El generador de secuencias de ensayo que se presenta en este artículo utiliza una descripción del circuito a nivel de transistor que representa las redes de transistores de enriquecimiento de las funciones lógicas NMOS mediante grafos no orientados. Para la generación de vectores de ensayo se emplea el algoritmo D, habiendo desarrollado un método enumerativo de búsqueda de caminos en la parte superior del grafo, a partir del camino mínimo que pasa por el flanco que representa el transistor afectado...

Generalised filtering.

Friston, Karl, Stephan, Klaas, Li, Baojuan, Daunizeau, Jean (2010)

Mathematical Problems in Engineering

Generalized information criteria for Bayes decisions

Domingo Morales, Igor Vajda (2012)

Kybernetika

This paper deals with Bayesian models given by statistical experiments and standard loss functions. Bayes probability of error and Bayes risk are estimated by means of classical and generalized information criteria applicable to the experiment. The accuracy of the estimation is studied. Among the information criteria studied in the paper is the class of posterior power entropies which include the Shannon entropy as special case for the power α = 1 . It is shown that the most accurate estimate is in this...

Generalized Kotov-Ushakov attack on tropical Stickel protocol based on modified tropical circulant matrices

Sulaiman Alhussaini, Craig Collett, Sergeĭ Sergeev (2024)

Kybernetika

After the Kotov-Ushakov attack on the tropical implementation of Stickel protocol, various attempts have been made to create a secure variant of such implementation. Some of these attempts used a special class of commuting matrices resembling tropical circulants, and they have been proposed with claims of resilience against the Kotov-Ushakov attack, and even being potential post-quantum candidates. This paper, however, reveals that a form of the Kotov-Ushakov attack remains applicable and, moreover,...

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

Imre Csiszár, František Matúš (2012)

Kybernetika

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily differentiable. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The effective domain of the value function is described by a conic core, a modification of the earlier concept of convex core. Minimizers...

Generalized Schauder frames

S.K. Kaushik, Shalu Sharma (2014)

Archivum Mathematicum

Schauder frames were introduced by Han and Larson [9] and further studied by Casazza, Dilworth, Odell, Schlumprecht and Zsak [2]. In this paper, we have introduced approximative Schauder frames as a generalization of Schauder frames and a characterization for approximative Schauder frames in Banach spaces in terms of sequence of non-zero endomorphism of finite rank has been given. Further, weak* and weak approximative Schauder frames in Banach spaces have been defined. Finally, it has been proved...

Currently displaying 541 – 560 of 1507