The problem of measuring similarity between sentences is crucial for many applications in Natural Language Processing (NLP). Most of the proposed approaches depend on similarity of words in sentences. This research considers semantic relations between words in calculating sentence similarity. This paper uses Discourse Representation Structure (DRS) of natural language sentences to measure similarity. DRS captures the structure and semantic information of sentences. Moreover, the estimation of similarity between sentences depends on semantic coverage of relations of the �first sentence in the other sentence. Experiments show that exploiting structural information achieves better results than traditional word-to- word approaches. Moreover, the proposed method outperforms similar approaches on a standard benchmark dataset.

Automated classification of malignant and benign breast cancer lesions using neural networks on digitized mammograms

ASGOP: An aggregated similarity-based greedy-oriented approach for relational DDBSs design

In this paper, a proposed algorithm that dynamically changes the neural network structure is presented. The structure is changed based on some features in the cascade correlation algorithm. Cascade correlation is an important algorithm that is used to solve the actual problem by artificial neural networks as a new architecture and supervised learning algorithm. This process optimizes the architectures of the network which intends to accelerate the learning process and produce better performance in generalization. Many researchers have to date proposed several growing algorithms to optimize the feedforward neural network architectures. The proposed algorithm has been tested on various medical data sets. The results prove that the proposed algorithm is a better method to evaluate the accuracy and flexibility resulting from it. View Full-Text

Zero-watermarking methods provide promising solutions and impressive performance
for copyright protection of images without changing the original images. In this paper, a novel
zero-watermarking method for color images is envisioned. Our envisioned approach is based on
multi-channel orthogonal Legendre Fourier moments of fractional orders, referred to as MFrLFMs. In this
method, a highly precise Gaussian integration method is utilized to calculate MFrLFMs. Then, based
on the selected accurate MFrLFMs moments, a zero-watermark is constructed. Due to their accuracy,
geometric invariances, and numerical stability, the proposed MFrLFMs-based zero-watermarking method
shows excellent resistance against various attacks. Performed experiments using the proposed watermarking
method show the outperformance over existing watermarking algorithms.

The TCP SYN flooding (half-open connection) attack is a type of DDoS attack, which denies
the services by consuming the server resources. This attack prevents legitimate users
from using their desired service. The SYN flooding attack exploits the normal TCP three-way
handshake by sending stream of SYN packets to the server with spoofed IP addresses. The
detection of this attack is hard since the internet routing infrastructure cannot differenti-
ate between legitimate and spoofed SYN packets. In this paper we present a new detection
method for the SYN flooding attack based on Multifractal Detrended Fluctuation Analysis
(MFDFA) in addition to an adaptive threshold, thus we can detect the abnormal behavior in
the TCP protocol time series.

Watermarking of digital images is a well-known technique that is widely used for
securing image contents. A successful watermarking method must be accurate,
reversible, resilient, and robust against various attacks. In this paper, we propose a
reversible and robust color image watermarking method. A new set of multi-channel
fractional-order polar harmonic transforms and their geometric invariants have been
derived. These highly accurate and geometrically invariant features are used in the
watermarking process. The binary watermark’s bits were scrambled using a 1D chaotic
sine map to increase the security level. A set of experiments were performed
to evaluate the proposed watermarking method, and its performance was compared
with recent color image watermarking methods having similar colors. The obtained
results showed high visual imperceptibility and superior robustness against geometric
and signal processing attacks.

In the age of Information Technology, the day-life required transmitting millions of images
between users. Securing these images is essential. Digital image encryption is a well-known
technique used in securing image content. In image encryption techniques, digital images are
converted into noise images using secret keys, where restoring them to their originals required
the same keys. Most image encryption techniques depend on two steps: confusion and diffusion.
In this work, a new algorithm presented for image encryption using a hyperchaotic system and
Fibonacci Q-matrix. The original image is confused in this algorithm, utilizing randomly generated
numbers by the six-dimension hyperchaotic system. Then, the permutated image diffused using
the Fibonacci Q-matrix. The proposed image encryption algorithm tested using noise and data cut
attacks, histograms, keyspace, and sensitivity. Moreover, the proposed algorithm’s performance
compared with several existing algorithms using entropy, correlation coefficients, and robustness
against attack. The proposed algorithm achieved an excellent security level and outperformed the
existing image encryption algorithms.