Design sampling plan was and still one of most importance subjects because it give lowest cost  comparing with others, time live statistical distribution should be known to give best estimators for  parameters of sampling plan and get best sampling plan.

Research dell with design sampling plan when live time distribution follow Logistic distribution with () as location and shape parameters, using these information can help us getting (number of groups, sample size) associated with reject or accept the Lot

Experimental results for simulated data shows the least number of groups and sample size needs to reject or accept the Lot with certain probability of

Multi-document summarization is an optimization problem demanding optimization of more than one objective function simultaneously. The proposed work regards balancing of the two significant objectives: content coverage and diversity when generating summaries from a collection of text documents.

     Any automatic text summarization system has the challenge of producing high quality summary. Despite the existing efforts on designing and evaluating the performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. In this work, the design of

Automatic document summarization technology is evolving and may offer a solution to the problem of information overload. Multi-document summarization is an optimization problem demanding optimizing more than one objective function concurrently. The proposed work considers a balance of two significant objectives: content coverage and diversity while generating a summary from a collection of text documents. Despite the large efforts introduced from several researchers for designing and evaluating performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. The design of gener

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

In this work, a joint quadrature for numerical solution of the double integral is presented. This method is based on combining two rules of the same precision level to form a higher level of precision. Numerical results of the present method with a lower level of precision are presented and compared with those performed by the existing high-precision Gauss-Legendre five-point rule in two variables, which has the same functional evaluation. The efficiency of the proposed method is justified with numerical examples. From an application point of view, the determination of the center of gravity is a special consideration for the present scheme. Convergence analysis is demonstrated to validate the current method.

     The concept of separation axioms constitutes a key role in general topology and all generalized forms of topologies. The present authors continued the study of gpα-closed sets by utilizing this concept, new separation axioms, namely gpα-regular and gpα-normal spaces are studied and established their characterizations. Also, new spaces namely gpα-T_k  for k = 0, 1, 2 are studied.

Drilling deviated wells is a frequently used approach in the oil and gas industry to increase the productivity of wells in reservoirs with a small thickness. Drilling these wells has been a challenge due to the low rate of penetration (ROP) and severe wellbore instability issues. The objective of this research is to reach a better drilling performance by reducing drilling time and increasing wellbore stability.

In this work, the first step was to develop a model that predicts the ROP for deviated wells by applying Artificial Neural Networks (ANNs). In the modeling, azimuth (AZI) and inclination (INC) of the wellbore trajectory, controllable drilling parameters, unconfined compressive strength (UCS), formation

Drilling deviated wells is a frequently used approach in the oil and gas industry to increase the productivity of wells in reservoirs with a small thickness. Drilling these wells has been a challenge due to the low rate of penetration (ROP) and severe wellbore instability issues. The objective of this research is to reach a better drilling performance by reducing drilling time and increasing wellbore stability.

In this work, the first step was to develop a model that predicts the ROP for deviated wells by applying Artificial Neural Networks (ANNs). In the modeling, azimuth (AZI) and inclination (INC) of the wellbore trajectory, controllable drilling parameters, unconfined compressive strength (UCS), formation

   The main aim of this paper is to use the notion  which was introduced in [1], to offered new classes of separation axioms in ideal spaces. So, we offered new type of notions of convergence in ideal spaces via the set. Relations among several types of separation axioms that offered were explained.

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com