A 2D homogeneous Helmholtz case (u=sin(x)cos(y) with a square) with
％ two Dirichlet edges (x=1,y=1) and two Neumann edges (x=0,y=0)
％ by indirect symmetric BKM
This file contains a C++Builder 4 project called SimplyChaos-X ver 3.1 (SCX31).
SCX31 is an encryption tool. I designed it as my graduation paper work. SCX31 is a symmetric stream cipher built on chaos function, one time pad cipher and inspiration from Ground Effect (aviation). The key length can be up to 40 characters (320 bits).
An optimal neuron evolution algorithm for the restoration
of linearly distorted images is presented in this paper. The proposed
algorithm is motivated by the symmetric positive-definite quadratic programming
structure inherent in restoration. Theoretical analysis and experimental
results show that the algorithm not only significantly increases
the convergence rate of processing, hut also produces good restoration
results. In addition, the algorithm provides a genuine parallel processing
structure which ensures computationally feasible spatial domain image
restoration
this directory
contains the following:
* The acdc algorithm for finding the
approximate general (non-orthogonal)
joint diagonalizer (in the direct Least Squares sense) of a set of Hermitian matrices.
[acdc.m]
* The acdc algorithm for finding the
same for a set of symmetric matrices.
[acdc_sym.m](note that for real-valued matrices the Hermitian and symmetric cases are similar however, in such cases the Hermitian version
[acdc.m], rather than the symmetric version[acdc_sym] is preferable.
* A function that finds an initial guess
for acdc by applying hard-whitening
followed by Cardoso s orthogonal joint
diagonalizer. Note that acdc may also
be called without an initial guess,
in which case the initial guess is set by default to the identity matrix.
The m-file includes the joint_diag
function (by Cardoso) for performing
the orthogonal part.
[init4acdc.m]
The applet illustrates the behaviour of binary search trees, Searching and Sorting Algorithms, Self-adjusting Binary Search Trees, symmetric binary B-trees,聽Data structure and maintenance algorithms
a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate public/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.
Computes all eigenvalues and eigenvectors of a real symmetric matrix a,
! which is of size n by n, stored in a physical np by np array.
! On output, elements of a above the diagonal are destroyed.
! d returns the eigenvalues of a in its first n elements.
! v is a matrix with the same logical and physical dimensions as a,
! whose columns contain, on output, the normalized eigenvectors of a.
! nrot returns the number of Jacobi rotations that were required.
! Please notice that the eigenvalues are not ordered on output.
! If the sorting is desired, the addintioal routine "eigsrt"
! can be invoked to reorder the output of jacobi.
Abstract—In the future communication applications, users
may obtain their messages that have different importance levels
distributively from several available sources, such as distributed
storage or even devices belonging to other users. This
scenario is the best modeled by the multilevel diversity coding
systems (MDCS). To achieve perfect (information-theoretic)
secrecy against wiretap channels, this paper investigates the
fundamental limits on the secure rate region of the asymmetric
MDCS (AMDCS), which include the symmetric case as a special
case. Threshold perfect secrecy is added to the AMDCS model.
The eavesdropper may have access to any one but not more than
one subset of the channels but know nothing about the sources,
as long as the size of the subset is not above the security level.
The question of whether superposition (source separation) coding
is optimal for such an AMDCS with threshold perfect secrecy
is answered. A class of secure AMDCS (S-AMDCS) with an
arbitrary number of encoders is solved, and it is shown that linear
codes are optimal for this class of instances. However, in contrast
with the secure symmetric MDCS, superposition is shown to
be not optimal for S-AMDCS in general. In addition, necessary
conditions on the existence of a secrecy key are determined as a
design guideline.
