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
ClustanGraphics聚類分析工具。提供了11種聚類算法。
Single Linkage (or Minimum Method, Nearest Neighbor)
Complete Linkage (or Maximum Method, Furthest Neighbor)
Average Linkage (UPGMA)
Weighted Average Linkage (WPGMA)
Mean Proximity
Centroid (UPGMC)
Median (WPGMC)
Increase in Sum of Squares (Ward s Method)
Sum of Squares
Flexible (ß space distortion parameter)
Density (or k-linkage, density-seeking mode analysis)
Instead of finding the longest common
subsequence, let us try to determine the
length of the LCS.
Then tracking back to find the LCS.
Consider a1a2…am and b1b2…bn.
Case 1: am=bn. The LCS must contain am,
we have to find the LCS of a1a2…am-1 and
b1b2…bn-1.
Case 2: am≠bn. Wehave to find the LCS of
a1a2…am-1 and b1b2…bn, and a1a2…am and
b b b
b1b2…bn-1
Let A = a1 a2 … am and B = b1 b2 … bn
Let Li j denote the length of the longest i,g g
common subsequence of a1 a2 … ai and b1 b2
… bj.
Li,j = Li-1,j-1 + 1 if ai=bj
max{ L L } a≠b i-1,j, i,j-1 if ai≠j
L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
In an electromagnetic cloak based on a transformation approach, reduced sets of
material properties are generally favored due to their easier implementation in reality,
although a seemingly inevitable drawback of undesired reflection exists in such cloaks.
Here we suggest using high-order transformations to create smooth moduli at the outer
boundary of the cloak, therefore completely eliminating the detrimental scattering
within the limit of geometric optics. We apply this scheme to a non-magnetic
cylindrical cloak and demonstrate that the scattered field is reduced substantially in a
cloak with optimal quadratic transformation as compared to its linear counterpart.
VHDL implementation of the twofish cipher for 128,192 and 256 bit keys.
The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.
Short description: A MAX-MIN Ant System (MMAS) implemented in the Hyper-Cube Framework for the application to Unconstrained Binary Quadratic Programming (UBQP).
Aim of the software: Educational (not high-performance) it shows how to implement a MMAS in the Hyper-Cube Framework.
