توظيف وسائل الاتصال الحديثة في تعليم اللغة العربية

The Arabic language is the language of the Holy Quran, which has become an immortal language because of the immortality of the Holy Quran as it says: "Surely We have revealed the Reminder and We will most surely be its guardian." It is one of the most widely spoken languages in the world, especially since the language is the means of communication among the peoples of the world. Communication and technological techniques in learning and teaching the Arabic language taking into account the elements of the educational process (student, teacher and curriculum), according to the requirements of the age, and the development of the mechanisms of teaching the Arabic language with modern technologies that keep up with the times and developments. The aim of the research is to explain the impact of modern means of communication on the teaching of the Arabic language according to several axes: definition of the language, definition of the language in Arabic and the strategy of its publication, the definition of the modern means of communication and their types in the teaching of the Arabic language. The analytical approach will be used in this study. The researcher concluded at the end of this study to prove that the Arabic language faces many challenges in light of the great progress of the modern means of communication and technical progress; and that there are many obstacles in the use of educational technology in the teaching of the Arabic language, which prevents the achievement of the objectives of education. Solutions to this problem are, thus, suggested so as to improve the Arabic language and maintain its position among the languages of the world.

Combinatorial Generation Algorithms for Subgraphs

The field of computer science has greatly benefitted from the advances in combina- torial algorithms in the last few decades. This is because the advent of high speed computers has made it possible to generate lists of combinatorial objects in a practi- cal amount of time. In areas such as genome science and data mining the problems are often vaguely defined, and researchers have to look for meaningful information in huge datasets. In this thesis, efficient generation algorithms for subgraphs such as bicliques and paths in cliques are developed. Cliques and bicliques are used to model various real-world problems encountered in bio-informatics, data mining and networks. We consider two variations of bicliques: pseudo-bicliques and c-isolated bicliques. Pseudo- bicliques relax the rigid connectivity requirement of bicliques to cater for missing and noisy data. On the other hand, the c-isolated bicliques enforce a restriction on the external connectivity of the vertices in a biclique to model cohesive communities. This thesis presents an algorithm based on reverse search to list all pseudo-bicliques in a graph G. The algorithm takes linear time on average to generate each pseudo- biclique. On the other hand, our generation algorithm for c-isolated bicliques exploit underlying properties of an isolated biclique to trim the input graph. Furthermore, the algorithm deploys the vertex cover enumeration algorithm based on fixed point tractability (FTP) and lists all isolated bicliques in linear time, in the case where c is constant. The performance of the proposed algorithms is evaluated on random graphs and real-world problems. The results are quite promising and confirm our theoretical findings. In this research work, we also explore another combinatorial object called a clique. A constant amortized time algorithm is proposed to generate all spanning paths and all paths in a clique in minimal change order (an ordering in which successive elements differ in a small way)