The haplotype association analysis has been proposed to capture the collective behavior of sets of variants by testing the association of each set instead of individual variants with the disease.Such an analysis typically involves a list of unphased multiple-locus genotypes with potentially sparse frequencies in cases and controls.It starts with inferring haplotypes from genotypes followed by a haplotype co-classification and marginal screening for disease-associated haplotypes.Unfortunately,phasing uncertainty may have a strong effects on the haplotype co-classification and therefore on the accuracy of predicting risk haplotypes.Here,to address the issue,we propose an alternative approach:In Stage 1,we select potential risk genotypes inste

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.

The main purpose of this paper is to introduce a some concepts in fibrewise totally topological space which are called fibrewise totally mapping, fiberwise totally closed mapping, fibrewise weakly totally closed mapping, fibrewise totlally perfect mapping fibrewise almost totally perfect mapping. Also the concepts as totally adherent point, filter, filter base, totally converges to a subset, totally directed toward a set, totally rigid, totally-H-set, totally Urysohn space, locally totally-QHC totally topological space are introduced and the main concept in this paper is fibrewise totally perfect mapping in totally top

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

studied, and its important properties and relationship with both closed and open Nano sets were investigated. The new Nano sets were linked to the concept of Nano ideal, the development of nano ideal mildly closed set and it has been studied its properties. In addition to the applied aspect of the research, a sample was taken from patients infected with viral hepatitis, and by examining the infected people and using closed and open (nano mildly. and nano ideal mildly) sets, the important symptoms that constitute the core of this dangerous examining the infected people and using closed and open (nano mildly. and nano ideal mildly) sets, the important symptoms that constitute the core of this dangerous disease.

In recent decades, tremendous success has been achieved in the advancement of chemical admixtures for Portland cement concrete. Most efforts have concentrated on improving the properties of concrete and studying the factors that influence on these properties. Since the compressive strength is considered a valuable property and is invariably a vital element of the structural design, especially high early strength development which can be provide more benefits in concrete production, such as reducing construction time and labor and saving the formwork and energy. As a matter of fact, it is influenced as a most properties of concrete by several factors including water-cement ratio, cement type and curing methods employed.
Because of acce

Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The result