Subjective surfaces and Riemannian mean curvature flow of graphs.
Sulle entropie idempotenti a traccia shannoniana
Summarizing sensors data in vehicular ad hoc networks
This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...
Summarizing sensors data in vehicular ad hoc networks
This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...
Sur la complexité d'un problème de codage
Sur la minimisation d'une expression représentant une famille de fonctions booléennes
Sur les informations conditionnelles sans F-composabilité.
In the framework of Generalized Information Theory of J. Kampé de Fériet, a system of axioms for the conditional information is studied without assuming additivity.
Sur les mesures du degré de flou.
On caractérise toutes les entropies-floues qui sont des valuations des treillis P(X) des parties floues d'un ensemble fini X, on presente la construction de certaines entropies floues et on analyse leur caractère de valuation de treillis aiguisés Sh(g), g belonging to P(X).
Sur les sous-monoïdes très purs
Sur une théorie informationnelle de l'observation pour des événements de nature probabiliste
SURE shrinkage of gaussian paths and signal identification
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.
SURE shrinkage of Gaussian paths and signal identification*
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
In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an -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
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...
Synchronization of discrete-time chaotic systems in bandlimited channels.
Syntactical definitions of program and flow diagram
Syntéza sekvenčních obvodů s využitím obecných paměťových elementů
Synthesis of finite state machines for CPLDs
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...
Synthesis of probability transformers
Szegő quadrature and frequency analysis.