The analysis of survival and reliability considered of topics and methods of vital statistics at the present time because of their importance in the various demographical, medical, industrial and engineering fields. This research focused generate random data for samples from the probability distribution Generalized Gamma: GG, known as: "Inverse Transformation" Method: ITM, which includes the distribution cycle integration function incomplete Gamma integration making it more difficult classical estimation so will be the need to illustration to the method of numerical approximation and then appreciation of the function of survival function. It was estimated survival function by simulation the way "Monte Carlo". The Entropy method used for the

the research goal is preparing a list of standard criteria and quality controls for information technology applications to serve the Holy Quran.

To achieve this goal, the researcher has built a list of criteria according to the following steps:

First - identify the key areas covered by the whole list which are:

1 – Standards of system building and implementing with the operating screens.

2 – Standards of display forms including audio and video presentation.

3 – Standards which are related to the program philosophy.

4 - Standards which are related to the program objectives.

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

In this paper, a least squares group finite element method for solving coupled Burgers' problem in   2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved.  The theoretical results  show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic

Background: The use of osseointegrated fixtures in dentistry has been demonstrated both histologically and clinically to be beneficial in providing long term oral rehabilitation in completely edentulous individual. Most patients suffer from denture instability; particularly with mandibular prosthesis, the use of dental implant will be benefit significantly from even a slight increase in retention. The concept of implanting two to four fixtures in a bony ridge to retain a complete denture prosthesis appealing therefore, as retention, stability and acceptable economic compromise to the expanse incurred with the multiple fixture supported fixed prosthesis. Materials and methods in this study the sample were eight patients selected from a hosp

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

     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

<p>Recently, reconfigurable intelligent surfaces have an increasing role to enhance the coverage and quality of mobile networks especially when the received signal level is very weak because of obstacles and random fluctuation. This motivates the researchers to add more contributions to the fields of reconfigurable intelligent surfaces (RIS) in wireless communications. A substantial issue in reconfigurable intelligent surfaces is the huge overhead for channel state information estimation which limits the system’s performance, oppressively. In this work, a newly proposed method is to estimate the angle of arrival and path loss at the RIS side and then send short information to the base station rather than huge overhe