In this work, we prove by employing mapping Cone that the sequence and the subsequence of the characteristic-zero are exact and subcomplex respectively in the case of partition (6,6,4) .

In this work, We introduce the concepts of an FP-Extending, FP-Continuous and FP-Quasi-Continuous which are stronger than P-Extending, P-Continuous and P-Quasi-Continuous. characterizations and properties of FP-Extending, FP-Continuous and FP-Quasi-Continuous are obtained . A module M is called FP-Extending ( FP-Continuous, FP-Quasi-Continuous) if every submodule is P-Extending (P-Continuous, P-Quasi-Continuous) .

The significance of the work is to introduce the new class of open sets, which is said Ǥ- -open set with some of properties. Then clarify how to calculate the boundary area for these sets using the upper and lower approximation and obtain the best accuracy.

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

   The purpose of this paper is to study   new  types of open sets in bitopological spaces.    We shall introduce the concepts of  L- pre-open and L-semi-p-open sets

      In this work, the notion is defined by using    and some properties of this set are studied also,  and   Ù€ set are two concepts that are defined by using ; many examples have been cited to indicate that the reverse of the propositions and remarks is not achieved. In addition, new application example of nano was studied.

Catalytic reforming of naphtha occupies an important issue in refineries for obtaining high octane gasoline and aromatic compounds, which are the basic materials of petrochemical industries. In this study, a novel of design parameters for industrial continuous catalytic reforming reactors of naphtha is proposed to increase the aromatics and hydrogen productions. Improving a rigorous mathematical model for industrial catalytic reactors of naphtha is studied here based on industrial data applying a new kinetic and deactivation model. The optimal design variables are obtained utilizing the optimization process in order to build the model with high accuracy and such design parameters are then applied to get the best configuration of this pro

     The present study includes a theoretical treatment to derive the general equations of pumping threshold power ( ), laser output power (P_out), and laser device efficiency (ƞ) of the element-doped thin-disk laser (Yb³⁺) with a quasi-three-level pumping scheme in the continuous wave mode at a temperature of (299K^°). In this study, the host crystals (YAG) were selected as typical examples of this laser design in a Gaussian transverse mode. The numerical solution of these equations was made using Matlab software by selecting the basic parameters from the recently published scientific articles for the laser design of these crystal hosts. According to this simulation, this article studied the effect o

     In this paper the design of hybrid retina matching algorithm that is used in identification systems is considered. Retina based recognition is apparent as the most secure method for identification of an identity utilized to differentiate persons.

     The characteristics of Speeded up Robust Feature (SURF) and Binary Robust Invariant Scalable Key-Points (BRISK) algorithm have been used in order to produce a fast matching algorithm than the classical ones, those characteristics are important for real-time applications which usually need quick processing of a growing quantity of data. The algorithm is divided into three stages: retinal image processing and segmentation, extracting the lo

The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the