Sampling and Interpolating Sequences for Multiband-Limited Functions and Exponential Bases on Disconnected Sets.
Sampling of Band-Limited Vectors.
Sampling on the Sierpinski gasket.
Sampling theory for functions with fractal spectrum.
SAR image filtering in wavelet domain by subband depended shrink.
S-bases of proportional algebra.
Scalable PP-1 block cipher
A totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated...
Schur's Theorem on the Stability of Networks
A complex polynomial is called a Hurwitz polynomial if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical networks.In this article we prove Schur's criterion [17] that allows to decide whether a polynomial p(x) is Hurwitz without explicitly computing its roots: Schur's recursive algorithm successively constructs polynomials pi(x) of lesser degree by division with x - c, ℜ {c} < 0, such that pi(x) is Hurwitz if...
Secret sharing schemes for ports of matroids of rank 3
A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid. Namely, the minimal authorized subsets of an ideal secret sharing scheme are in correspondence with the circuits of a matroid containing a fixed point. In this case, we say that the access structure is a matroid port. It is known that, for an access structure, being a matroid port is not...
Secret sharing schemes on sparse homogeneous access structures with rank three.
Secure communications based on discrete time chaotic systems
Secure two-way on-line communication by using quasigroup enciphering with almost public key.
Segmentation of MRI data by means of nonlinear diffusion
The article focuses on the application of the segmentation algorithm based on the numerical solution of the Allen-Cahn non-linear diffusion partial differential equation. This equation is related to the motion of curves by mean curvature. It exhibits several suitable mathematical properties including stable solution profile. This allows the user to follow accurately the position of the segmentation curve by bringing it quickly to the vicinity of the segmented object and by approaching the details...
Self-tuning random early detection algorithm to improve performance of network transmission.
Semantic evaluation of the components of Ledley and Lusted's diagnostic model
Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means sA and sB , respectively. Both nodes have buffers with finite capacities. In this type of network, if the second...
Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
Fehr et al. (2010) proposed the first sender-equivocable encryption scheme secure against chosen-ciphertext attacks (NCCCA) and proved that NC-CCA security implies security against selective opening chosen-ciphertext attacks (SO-CCA). The NC-CCA security proof of the scheme relies on security against substitution attacks of a new primitive, the “crossauthentication code”. However, the security of the cross-authentication code cannot be guaranteed when all the keys used in the code are exposed. Our...
Sensitivity of computer support game algorithms of safe ship control
The paper investigates the sensitivity of safe ship control to inaccurate data from the ARPA anti-collision radar system and to changes in the process control parameters. The system structure of safe ship control in collision situations and computer support programmes exploring information from the ARPA anti-collision radar are presented. Sensitivity characteristics of the multistage positional non-cooperative and cooperative game and kinematics optimization control algorithms are determined through...
Serie de Lucas y criptografía.
Séries formelles rationnelles et reconnaissables