We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T-ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied. Abstract We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T- ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied.

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

In modern years, internet and computers were used by many nations all overhead the world in different domains. So the number of Intruders is growing day-by-day posing a critical problem in recognizing among normal and abnormal manner of users in the network. Researchers have discussed the security concerns from different perspectives. Network Intrusion detection system which essentially analyzes, predicts the network traffic and the actions of users, then these behaviors will be examined either anomaly or normal manner. This paper suggested Deep analyzing system of NIDS to construct network intrusion detection system and detecting the type of intrusions in traditional network. The performance of the proposed system was evaluated by using

Recent researches showed that DNA encoding and pattern matching can be used for the intrusion-detection system (IDS), with results of high rate of attack detection. The evaluation of these intrusion detection systems is based on datasets that are generated decades ago. However, numerous studies outlined that these datasets neither inclusively reflect the network traffic, nor the modern low footprint attacks, and do not cover the current network threat environment. In this paper, a new DNA encoding for misuse IDS based on UNSW-NB15 dataset is proposed. The proposed system is performed by building a DNA encoding for all values of 49 attributes. Then attack keys (based on attack signatures) are extracted and, finally, Raita algorithm is app

In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.

     Detection moving car in front view is difficult operation because of the dynamic background due to the movement of moving car and the complex environment that surround the car, to solve that, this paper proposed new method based on linear equation to determine the region of interest by building more effective background model to deal with dynamic background scenes. This method exploited the permitted region between cars according to traffic law to determine the region (road) that in front the moving car which the moving cars move on. The experimental results show that the proposed method can define the region that represents the lane in front of moving car successfully with precision over 94%and detection rate 86

            In this paper, the Normality set  will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of  .

This paper is concerned with the study of the fixed points of set-valued contractions on ordered metric spaces. The first part of the paper deals with the existence of fixed points for these mappings where the contraction condition is assumed for comparable variables. A coupled fixed point theorem is also established in the second part.