2,096,407 research outputs found

    Discrete logarithms in curves over finite fields

    Get PDF
    A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields

    Discrete-time variance tracking with application to speech processing

    Get PDF
    Two new discrete-time algorithms are presented for tracking variance and reciprocal variance. The closed loop nature of the solutions to these problems makes this approach highly accurate and can be used recursively in real time. Since the Least-Mean Squares (LMS) method of parameter estimation requires an estimate of variance to compute the step size, this technique is well suited to applications such as speech processing and adaptive filtering

    Using discrete-time hyperchaotic-based asymmetric encryption and decryption keys for secure signal transmission

    Get PDF
    In this paper, a framework for the synchronization of two non-identical discrete-time hyperchaotic systems, namely the 3D Baier-Klein and the 3D Hitzel-Zele maps, based on the use of hybrid output feedback concept and aggregation techniques, is employed to design a two-channel secure communication system. New sufficient conditions for synchronization are obtained by the use of Borne and Gentina practical criterion for stabilization study associated to the forced arrow form matrix for system description. The efficiency of the proposed approach to confidentially recover the transmitted message signal is shown via an application to the hyperchaotic Baier-Klein and Hitzel-Zele systems, considered as generators of asymmetric encryption and decryption keys

    Output feedback NN control for two classes of discrete-time systems with unknown control directions in a unified approach

    Get PDF
    10.1109/TNN.2008.2003290IEEE Transactions on Neural Networks19111873-1886ITNN

    Covering by discrete and closed discrete sets

    Get PDF
    Say that a cardinal number Îș\kappa is \emph{small} relative to the space XX if Îș<Δ(X)\kappa <\Delta(X), where Δ(X)\Delta(X) is the least cardinality of a non-empty open set in XX. We prove that no Baire metric space can be covered by a small number of discrete sets, and give some generalizations. We show a ZFC example of a regular Baire σ\sigma-space and a consistent example of a normal Baire Moore space which can be covered by a small number of discrete sets. We finish with some remarks on linearly ordered spaces.Comment: 12 pages, to appear on Topology and its Application
    • 

    corecore