Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

      Bioinformatics is one of the computer science and biology sub-subjects concerned with the processes applied to biological data, such as gathering, processing, storing, and analyzing it. Biological data (ribonucleic acid (RNA), deoxyribonucleic acid (DNA), and protein sequences) has many applications and uses in many fields (data security, data segmentation, feature extraction, etc.). DNA sequences are used in the cryptography field, using the properties of biomolecules as the carriers of the data. Messenger RNA (mRNA) is a single strand used to make proteins containing genetic information. The information recorded from DNA also carries messages from DNA to ribosomes in the cytosol. In this paper, a new encryption technique bas

Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascad

Currently no one can deny the importance of data protection, especially with the proliferation of hackers and theft of personal information in all parts of the world .for these reasons the encryption has become one of the important fields in the protection of digital information.
This paper adopts a new image encryption method to overcome the obstacles to previous image encryption methods, where our method will be used Duffing map to shuffled all image pixels ,after that the resulting image will be divided into a group of blocks for perform the shuffling process via Cross Chaotic Map.
Finally, an image called key image was created by using Quadratic number spirals which will be used to generate nu

Objective(s): The present study aims at studying the relationship between immunoglobulin IgG, IgA,
IgM , as well as to C-3 and C-4 in brain tumours patients immunity (meningioms and gliomas).
Methodology: Forty sera of brain tumour patients were included 20 glioma and 20 meningioma was
tested to determine the levels of IgM, IgG IgA, C-3 and C-4 by using single radial immune-diffusion
technique and compared with 20 apparently healthy blood donors.
Results: The study revealed a significant decreasing in IgG levels in glioma as compare to meningioma
and control. The concentration of two other serum immunoglobulins and complement in both
meningioma and glioma show no significant differences with those in control group.

Abstract

Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each

The bilateral sagittal split osteotomy (BSSO) is the most popular orthognathic procedure performed by maxillofacial surgeons to treat skeletal class II and class III and to correct mandibular asymmetries. The study aimed to evaluate the lingual splitting patterns and lateral bone cut end (LBCE) in bilateral sagittal split osteotomy (BSSO) and their relation with the ramal thickness and the presence of impacted third molars using cone beam computed tomography (CBCT). This prospective observational study included patients with mandibular prognathism who were treated with BSSO with or without Le Fort I osteotomy. Cone beam computed tomography was used to measure the ramal thickness preoperatively and to evaluate the LBCE, and the lingu

"Watermarking" is one method in which digital information is buried in a carrier signal;
the hidden information should be related to the carrier signal. There are many different types of
digital watermarking, including traditional watermarking that uses visible media (such as snaps,
images, or video), and a signal may be carrying many watermarks. Any signal that can tolerate
noise, such as audio, video, or picture data, can have a digital watermark implanted in it. A digital
watermark must be able to withstand changes that can be made to the carrier signal in order to
protect copyright information in media files. The goal of digital watermarking is to ensure the
integrity of data, whereas stegano

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff