Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation  on a set  can always be represented by a digraph. Topology on a set  can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.

Let M be a n-dimensional manifold. A C1- map f : M  M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.

This paper aimed to determine the Optimal Reliable Frequency (ORF) that can maintain certain connection link between different transmitter/receiver stations laid over the Iraqi territory. Three different transmitting sites were chosen as tested stations located in the northern, central, and southern regions of Iraq. These sites are Mosul, Baghdad, and Basra, respectively. In this study, the years 2009 and 2014, which represent the minimum and maximum years of solar cycle 24, were chosen to examine the effect of low and high solar activity on the determined ORF. The datasets of the Best Usable Frequency (BUF) were calculated using the ASAPS international communication model. An analytical study was made on the generated BUF parameter data

The source and channel coding for wireless data transmission can reduce
distortion, complexity and delay in multimedia services. In this paper, a joint sourcechannel
coding is proposed for orthogonal frequency division multiplexing -
interleave division multiple access (OFDM-IDMA) systems to transmit the
compressed images over noisy channels. OFDM-IDMA combines advantages of
both OFDM and IDMA, where OFDM removes inter symbol interference (ISI)
problems and IDMA removes multiple access interference (MAI). Convolutional
coding is used as a channel coding, while the hybrid compression method is used as
a source coding scheme. The hybrid compression scheme is based on wavelet
transform, bit plane slicing, polynomi

Environmental controls, especially for temperature and humidity, are essential to maintain the safety, purity and effectiveness of drugs. The measurement of humidity can be particularly difficult and important in climatic and thermostatic chambers (warehouses, ovens, cold rooms, fridges, drying rooms, insulated boxes, etc.).
The old method of monitoring and qualification of climatic and thermostatic chambers requires placing a defined number of recorders, then programming and store them. After that, to examine the values recorded to revolve the status of the climatic and thermostatic chambers, if they are compliant or not-complaint at any time, so all that goes to waste time and efficiency of values.
We can do the monitoring and qu

Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu

In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.

In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

Given the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init