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.

Modeling forward kinematics with neural networks allows for efficient handling of nonlinear relationships and realistic error correction in time-critical applications by relying on accurate training data. This paper presents a Multi-Layer Feed-Forward Neural Network (MLFFNN) to solve the forward kinematics of a 3-DOF robot. The proposed MLFFNN consists of 50 hidden neurons and was trained using 628319 samples to find only the position (x, y, z) of the end-effector. Data were generated by MATLAB, assuming an incremental motion of joints. The joint variables ( , , and ) are the inputs of the NN, which outputs the positions of the end effector (x, y, z) calculated using the Denavit-Hartenberg (DH) method. The results demonstrate that t

In this paper, a robust adaptive sliding mode controller is designed for a mobile platform trajectory tracking.  The mobile platform is an example of a nonholonomic mechanical system. The presence of holonomic constraints reduces the number of degree of freedom that represents the system model, while the nonholonomic constraints reduce the differentiable degree of freedom. The mathematical model was derived here for the mobile platform, considering the existence of one holonomic and two nonholonomic constraints imposed on system dynamics. The partial feedback linearization method was used to get the input-output relation, where the output is the error functions between the position of a certain point on the platform

Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

Marriage is a characteristic of the human race, as it is one of the oldest organization, asoldas human beign marrige is a legitimale relationsbip between male and female in the name of Allah "o mankind !Be dutiful to your lord, Who created you from a single person (Adam), and from him (Adam) He created his Wife (Eve), and from them both He created mang men and women
Marriage is a requirement of human life to ensure tle continuity and survival of the human species and established it in a legal, social and legitimate frame,according to certain criteria and conditions so that the individual earns psychological and social comfort in the name of Allah and Allah has made for you Azwaj ( mates or wives), sons and grand sons, and has bestowed

Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho