AL-MANSOUR JOURNAL

Among the requirements of achieving an economic development in Iraq is consolidating efforts for ideal employment of labor forces and stopping unemployment according to details specified by the developing policy itself . That in turn reflects the ability of these policies to stop unemployment . This is done after a full identification of supply and demand on labor force and its reflections on the national income, and the effects of these factors on the cons-umption and saving, (or investment ).
This is to reach a better redistribution of labor forces according to the planning relationship between the expansion of employees and the development of production factors . Hence, the present research deals with the demographic reality, and the orientations of both employment and unemployment . Then, it is proposed a problem- treatment procedure represented by modifying the structure of both labor force and training programs.

In this paper linear array antenna is presented, with elements of rectangular micro strip antenna with corner feeding offering dual-band operation (890-960) MHz GSM and (1.71-1.88) GHz DCS bands. This design is suitable for mobile communication system (base-station). In this paper, a simple technique is used for obtaining dual frequency operation for a rectangular microstrip antenna such that the length of the element resonant at one frequency and the width at another frequency. This paper is divided into three parts, the first part is related with the design of rectangular microstrip antenna with corner feeding and its performance (impedance, directivity, radiation pattern), the second part is related with design of linear array with its feed network and transformers, while the third part is related to the calculation of the base station antenna coverage.

Nowadays, daily communications of all kinds over the Internet have become incredibly popular. However, message transmissions over the Internet still have to face all kinds of security problems. While aim of cryptography is protecting the content of messages, steganography is the technique for hiding additional information in cover data. In this paper an embedding method in video is proposed, in which the embedded data is reconstructed without knowing the original host video or any other information about the embedding process. The proposed method enables high rate of data embedding and is robust to compression method since it works in the DCT domain.
Embedding is based on AMELSBR method for compute embedded capacity per block per frame and the DCT coefficient parameter for embedding process. The selection of frame for embedding is done randomly also selection of block for actual embedding is done randomly to increase complexity and security , the embedded data was repeated before hiding in order to ensure robust extraction and reconstruction under any consideration.

This research is summarized to find out economical advantage, liable to be a guide and advisable to those who benefited of making decisions, in respect to execute or none execute of those proposed projects. The research contained two points, to study the economical advantage. First, primarily studying, is to study the probability the success of the projects or failure in general.
Second, detailed study, confirming possibility the success this projects or failure. In details, lengthy and accurately from all respects. Such preparation detailed study depend on the primarily study of which it will be positively , the execution to continue , but in case shown negatively , such detailed study must not be go on, consequently in such case , if the study indication is positive, the green light lead to execute the project , the contrary is the right.
Therefore according to mentioned above , the proposed typical proposal, to be helpful in order to make a decision in respect to planning projects before start to take decision that to avoid continuing works for execution , if it seems that its future results include law , and financial obligations which lead to problems and danger.

In this paper, a new approach was presented, this approach building automatic thesaurus in the software engineering subject.
The proposed approach depend on the data Mining ( that refers to the overall process of discovering patterns or building models from a given data set) for indexing all the terms that founded into abstracts of the university thesis , this done by:
●Association rule: - this algorithm was used into data mining to find large item set and it is as a tool of discovery rule in our approach we used it to compute the frequency of the words into text and determined the keywords.
●Clustering techniques: it's used to classification of patterns
(observation, data items, or feature vectors into groups).
This new approach introduce automatic thesaurus that can be used as an effective tools for information retrieval.

In this paper, we study the concept of minimal topological spaces and its relation with first countable space, we prove that if X is first countable completely regular space, then the following are equivalent.
• X is first countable and minimal completely regular space.
• X is first countable and completely regular – closed space.
A first countable and minimal Urysohn is semi regular and
Let be a collection of a topological spaces and , then X is first countable and Hausdorff – closed if and only if each x(n) is first countable and Hausdorff – closed

There are many methods for solving linear programming problems with unrestricted variables that gets the optimal solution of the problem where the values of variables are fractional numbers not integer numbers, But when there are conditions in the problem that requires the result is optimal integer solution, that is the resulted variables values was numerical integer, At that time we must turn to a method that we get from it the integer solution of the problem. That is the subject of the research where we will employ an algorithm of the method (Modify Surrogate Cutting Plane algorithm) to solve linear integer programming problems that to find integer solution of linear programming problems with unrestricted variables that after getting a view at linear Programming with unrestricted variables and Integer Programming.