Today, data security is a major problem concerning organizations and indi- viduals. The confidentiality of information is associated with using reliable and robust encryption algorithms in systems. Cyber-attacks on data and systems have become prevalent and sophisticated, and are increasing rapidly; hence, the need for developing robust encryption algorithms is crucial nowadays. This paper proposes a new encryption algorithm using dynamic symmetric key cryptography to encrypt text files. It utilizes a secret key for encryption and decryption processes, where the key’s length is varied depending on the text size. This presented approach gives a trade-off between speed and security, making it suitable for various applications, such as secur

لقد انبثقت رؤيا حديثة في مسرح الثمانينات من القرن العشرين كان هدفها دحر حس الاسر الذي عاشه  انسان العصر الحديث وفي محاولة للارتقاء بارادته وحرية الاختيار نحو الانعتاق من محاولات المصادرة الفظة لها. وبالرغم من افتراض هذه الرؤيا انها ذات طابع سلبي, الا ان رؤيا الانتحار قدعدت بانها قادرة على ان تجعل في متناول يد الانسان احساسا طموحا بالتحكم على الاقل بنوع النهاية التي يكتبها لحياته. وقد انعكست هذة الرؤيا ال

Zernike Moments has been popularly used in many shape-based image retrieval studies due to its powerful shape representation. However its strength and weaknesses have not been clearly highlighted in the previous studies. Thus, its powerful shape representation could not be fully utilized. In this paper, a method to fully capture the shape representation properties of Zernike Moments is implemented and tested on a single object for binary and grey level images. The proposed method works by determining the boundary of the shape object and then resizing the object shape to the boundary of the image. Three case studies were made. Case 1 is the Zernike Moments implementation on the original shape object image. In Case 2, the centroid of the s

The study aimed to monitor the concept of reputation in the previous literature, its relationship to mental image and identity, and to reveal recent trends in its measurement Techniques.

    The study relied on a descriptive approach using library survey and comparative analysis, and the study reached following conclusions:

     Despite the beginning of the first signs of reputation In the fifties of the last century, however, Defining and standardizing the concept with clear and specific dimensions began in the 1990s and the beginning of the third millennium. The concept of reputation refers to the stakeholders’ overall evaluation of organizations, which reflects their perceptions of

Robots have become an essential part of modern industries in welding departments to increase the accuracy and rate of production. The intelligent detection of welding line edges to start the weld in a proper position is very important. This work introduces a new approach using image processing to detect welding lines by tracking the edges of plates according to the required speed by three degrees of a freedom robotic arm. The two different algorithms achieved in the developed approach are the edge detection and top-hat transformation. An adaptive neuro-fuzzy inference system ANFIS was used to choose the best forward and inverse kinematics of the robot. MIG welding at the end-effector was applied as a tool in this system, and the wel

Survival analysis is one of the types of data analysis that describes the time period until the occurrence of an event of interest such as death or other events of importance in determining what will happen to the phenomenon studied. There may be more than one endpoint for the event, in which case it is called Competing risks. The purpose of this research is to apply the dynamic approach in the analysis of discrete survival time in order to estimate the effect of covariates over time, as well as modeling the nonlinear relationship between the covariates and the discrete hazard function through the use of the multinomial logistic model and the multivariate Cox model. For the purpose of conducting the estimation process for both the discrete

Data compression offers an attractive approach to reducing communication costs using available bandwidth effectively. It makes sense to pursue research on developing algorithms that can most effectively use available network. It is also important to consider the security aspect of the data being transmitted is vulnerable to attacks. The basic aim of this work is to develop a module for combining the operation of compression and encryption on the same set of data to perform these two operations simultaneously. This is achieved through embedding encryption into compression algorithms since both cryptographic ciphers and entropy coders bear certain resemblance in the sense of secrecy. First in the secure compression module, the given text is p

the researchers pointed that the poet relied on several means in the form of poetic images, including analogy, and the metaphor with its various elements, The chromatic component has also been used in the formation of its poetic image,and resorted to the correspondence of the senses and the symbol of two types:Self-code, public code : And we find a variety of symbolic stems from different sources, from these symbols, what is religious, including what is historical and what is legendary, and such symbols, which resorted to the rare places of his poems confined to the myths contained in the Bible, His use of the general symbols was ineffective in the poetic picture, relying on the metaphor and metaphor.

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).