The Fourier plane encryption algorithm is subjected to a known-plaintext attack. The simulated annealing heuristic algorithm is used to estimate the key, using a known plaintext-ciphertext pair, which decrypts
the ciphertext ...
This paper analyses the advantages and
disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate human factors, both partitioning and ...
Over the last years, the effects of neutrality have attracted the attention of many researchers in the Evolutionary Algorithms (EAs) community. A mutation from one gene to another is considered as neutral if this modification ...
This paper discusses the theory and algorithmic design of the CADD (clustering algorithm based on object density and direction) algorithm. This algorithm seeks to harness the respective advantages of the k-means and DENCLUE ...
By use of matrix-based techniques it is shown how the space–bandwidth product (SBP) of a signal, as indicated by the location of the signal energy in the Wigner distribution function, can be tracked through any quadraticphase ...
This paper presents a novel algorithm for determining
the 3D location of a Mobile Tag (MT) using wireless Base
Stations (BSs) and Ultra Wide Band (UWB) one-way signaling.
The algorithm is designed for low power, rapid ...
Rainfall induced landslides are a major cause of disturbance to transport networks in many parts of the world. In slopes where the water table is some depth below the ground surface, negative pore water pressure (suctions) ...
DNA data embedding is a relatively recent area which aims at embedding arbitrary information in deoxyribonucleic acid (DNA) strands. One interesting application of DNA data embedding can be tracing pathways of genetic ...
This Chapter examines cash dividends and share repurchases in the United States during the period 1990 to 2008. In the extant literature a variety of classical statistical methodologies have been adopted, foremost among ...
In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms ...