Factorization Methods in Cryptosystems
Factorized mutual information maximization
We investigate the sets of joint probability distributions that maximize the average multi-information over a collection of margins. These functionals serve as proxies for maximizing the multi-information of a set of variables or the mutual information of two subsets of variables, at a lower computation and estimation complexity. We describe the maximizers and their relations to the maximizers of the multi-information and the mutual information.
Failure of random networks.
Families of nets of low and medium strength.
Fast and accurate methods of independent component analysis: A survey
This paper presents a survey of recent successful algorithms for blind separation of determined instantaneous linear mixtures of independent sources such as natural speech or biomedical signals. These algorithms rely either on non-Gaussianity, nonstationarity, spectral diversity, or on a combination of them. Performance of the algorithms will be demonstrated on separation of a linear instantaneous mixture of audio signals (music, speech) and on artifact removal in electroencephalogram (EEG).
Fast computation of Gauss sums and resolution of the root of unity ambiguity
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Fault diagnosis and fault tolerant control using set-membership approaches: Application to real case studies
This paper reviews the use of set-membership methods in fault diagnosis (FD) and fault tolerant control (FTC). Setmembership methods use a deterministic unknown-but-bounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between observed and predicted behaviour by using simple sets to approximate the exact set of possible behaviour (in the parameter or the state space). When an inconsistency is detected between the measured and predicted...
Fault location in EHV transmission lines using artificial neural networks
This paper deals with the application of artificial neural networks (ANNs) to fault detection and location in extra high voltage (EHV) transmission lines for high speed protection using terminal line data. The proposed neural fault detector and locator were trained using various sets of data available from a selected power network model and simulating different fault scenarios (fault types, fault locations, fault resistances and fault inception angles) and different power system data (source capacities,...
Filtering of signals transmitted in multichannel from Chandrasekhar and Riccati recursions.
In this paper two recursive algorithms are proposed and compared as a solution of the least mean-squared error linear filtering problem of a wide-sense stationary scalar signal from uncertain observations perturbed by white and coloured additive noises. Considering that the state-space model of the signal is not available and that the variables modelling the uncertainty are not independent, the proposed algorithms are derived by using covariance information. The difference between both algorithms...
Finding the conductors in circular networks from boundary measurements
Finite completion of comma-free codes. Part 1
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...
Finite Completion of comma-free codes Part 1
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...
Finite completion of comma-free codes. Part 2
This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
Finite Completion of comma-free codes Part 2
This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
Finite geometries, varieties and codes.
Finite vector spaces and certain lattices.
Finite-time consensus problem for multiple non-holonomic mobile agents
In this paper, the problem of finite time consensus is discussed for multiple non-holonomic mobile agents. The objective is to design a distributed finite time control law such that the controlled multiple non-holonomic mobile agents can reach consensus within any given finite settling time. We propose a novel switching control strategy with the help of time-rescalling technique and graph theory. The numerical simulations are presented to show the effectiveness of the method.
Flow control in connection-oriented networks: a time-varying sampling period system case study
In this paper congestion control problem in connection-oriented communication network with multiple data sources is addressed. In the considered network the feedback necessary for the flow regulation is provided by means of management units, which are sent by each source once every M data packets. The management units, carrying the information about the current network state, return to their origin round trip time RTT after they were sent. Since the source rate is adjusted only at the instant of...
Fluctuations of the empirical entropies of a chain of infinite order.