Abstract
The research aims to build a training program to develop some executive functions for kindergarten children. To achieve this goal, the two researchers built the program according to the following steps:
1. Determining the general objective of the program.
2. Determining the behavioral objectives of the program.
3. Determining the included content in the program.
4. Implementing the content of the activities of the program.
5. Evaluating the Program.
The program included (12) training activities, the training activities included several items: the title of the activity, the time of implementation of the activity, the general objective of the activity, the procedural behavioral objective, the means and tools u

New speaker identification test’s feature, extracted from the differentiated form of the wave file, is presented. Differentiation operation is performed by an operator similar to the Laplacian operator. From the differentiated record’s, two parametric measures have been extracted and used as identifiers for the speaker; i.e. mean-value and number of zero-crossing points.

Through this study, the following has been proven, if  is an algebraically paranormal operator acting on separable Hilbert space, then  satisfies the ( ) property and  is also satisfies the ( ) property for all . These results are also achieved for  ( ) property.    In addition, we prove that for a polaroid operator with finite ascent then after the property ( ) holds for  for all.

In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

      Detecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulate