FLIGHT CLASSIFICATION MODEL BASED ON TRANSITIVE CLOSURE ALGORITHM AND APPLICATION TO FLIGHT SEQUENCING PROBLEM

A new arrival and departure flight classification method based on the transitive closure algorithm （TCA） is proposed. Firstly, the fuzzy set theory and the transitive closure algorithm are introduced. Then four different factors are selected to establish the flight classification model and a method is given to calculate the delay cost for each class. Finally, the proposed method is implemented in the sequencing problems of flights in a terminal area, and results are compared with that of the traditional classification method（TCM）. Results show that the new classification model is effective in reducing the expenses of flight delays, thus optimizing the sequences of arrival and departure flights, and improving the efficiency of air traffic control.

Practical Method for Determining All the Minimum Solutions of Fuzzy Matrix Equation and Transitive Closure of Fuzzy Relation

In this paper,the new theory frame and practical methhod for determining all the minimum solutions of Fuzzy matrix equation and transitive closure of Fuzzy relation is described,and it has been carried out on the miero-computer quickly and accurately.

Water quality assessment for Ulansuhai Lake using fuzzy clustering and pattern recognition

Water quality assessment of lakes is important to determine functional zones of water use.Considering the fuzziness during the partitioning process for lake water quality in an arid area,a multiplex model of fuzzy clustering with pattern recognition was developed by integrating transitive closure method,ISODATA algorithm in fuzzy clustering and fuzzy pattern recognition.The model was applied to partition the Ulansuhai Lake,a typical shallow lake in arid climate zone in the west part of Inner Mongolia,China and grade the condition of water quality divisions.The results showed that the partition well matched the real conditions of the lake,and the method has been proved accurate in the application.

AN ALGORITHM FOR END-TO-END PERFORMANCE ANALYSIS OF NETWORK BASED ON TRAFFIC ENGINEERING

Based on traffic engineering, the network topology is described with network graph. An algorithm for the derivation of data communication capability in network links and the analysis of connectivity performance between node pairs is given through standardized transformation of the original descriptive matrix for the link performance, and resolution of transitive closure for adjacent-incident matrix of network in view of randomness of network events, which provides a feasible way for analysis and improvement of network performance.

FUZZY REASONING IN CYCLES

By the similarity between the syllogism in logic and a path proposition in graph theory,a new concept,fuzzy reasoning graph G has been given in this paper. Transitive closure has been studied and used to do reasoning related to self-loop in G,and an algorithm has been designed to cope with reasoning in other cycles in G. Both approaches are applicable and efficient.

AN ANALYSIS OF THE APPLICABILITY OF FUZZY CLUSTERING IN ESTABLISHING AN INDEX FOR THE EVALUATION OF METEOROLOGICAL SERVICE SATISFACTION

An evaluation index is a prerequisite for the scientific evaluation of a public meteorological service.This paper aims to explore a technical method for determining and screening evaluation indicators.Based on public satisfaction survey data obtained in Wafangdian,China in 2010,this study investigates the suitability of fuzzy clustering analysis method in establishing an evaluation index.Through quantitative analysis of multilayer fuzzy clustering of various evaluation indicators,correlation analysis indicates that if the results of clustering were identical for two evaluation indicators in the same sub-evaluation layer,then one indicator could be removed,or the two indicators merged.For evaluation indicators in different sub-evaluation layers,although clustering reveals attribute correlations,these indicators may not be substituted for one another.Analysis of the applicability of the fuzzy clustering method shows that it plays a certain role in the establishment and correction of an evaluation index.

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure arrayof an undirected graph.The time complexify of the parallel algorithm is O(n^3/p).If D,P andare known,it is shown that the problems to find all connected components, to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p^+ logp)time.

Discrete Morse Theory on Join of Digraphs

For given two digraphs,we can construct a larger digraph through join.The two digraphs that make up the join are called the factors of the join.In this paper,we give a necessary and sufficient condition that the function on the join determined by the discrete Morse functions on factors is a discrete Morse function.Moreover,we further prove the discrete Morse theory on join when the factors satisfy certain conditions.