The research aims at Identifying family dialogue of kindergarten’s parents. 2)  Exploring the fears that kindergarteners suffer from. 3) Identifying family dialogue of kindergarteners’ parents and the fears of their children. To achieve the aim of the research, the researcher designed two scales: one for the family dialogue of kindergarteners’ parents, and the other for the fears of the kindergarten’s child. To identify the relationship between these two elements, the scale subjected to the consultation of a group of specialized expertise in educational and psychological sciences to certify the propriety of the items. The reliability of the scale of the family dialogue recorded (0.85). As for the scale of children’

This research aim at finding out the impact of using the strategy of shape V on the achievement of the students of the Department of Artistic Education in the subject of "Principles of scientific Research ". This strategy is one of the cognitive strategies used in this topic . To verify the aim of the research ,the two researchers have put the following null hypothesis:-There are no significant differences on the level of 0,05 among the average degrees of the students of the experimental group in their answers on the topics of the pre and post cognitive achievement tests of the subject of "principles of scientific Research " . The two researchers have adopted the experimental approach which consists of one group . the population of the r

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).