Entity

Time filter

Source Type

Xiamen, China

Jimei University , colloquially known as "Jídà" , is a public university located in Xiamen, Fujian, People's Republic of China. Wikipedia.


The Wiener index of a connected graph is defined as the sum of distances between all pairs of its vertices. In this paper, we characterize the trees which minimize and maximize the Wiener index among all trees with given number of vertices of even degree respectively. Source


The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. A vertex of a tree T with degree 3 or greater is called a branching vertex of T. In this paper, the lower bound and the upper bound of the Wiener index of an n-vertex tree with given number of branching vertices are obtained respectively. Source


Hong L.-X.,Jimei University
Advances in Information Sciences and Service Sciences | Year: 2012

The essay researches on the abnormal detection optimization issue for network. As for the diversity of abnormal phenomena in the Internet, the traditional support vector machine algorithm for network anomaly detection problem is difficult to detect network anomalies, in order to solve the problem, a support vector machine and genetic algorithm hybrid algorithm is proposed and used in network anomaly detection system. First, In the course of classification model, the algorithm uses the model of support vector machine, and uses genetic algorithm as for solving optimization issue of decision hyperplane. The hybrid algorithm could acquire coefficient of classification hyperplane, and according to the concrete number model, the chromosome builds reasonable comfortable function, using genetic algorithms to optimize the parameters of support vector machine to build genetic algorithm optimization support vector machine network anomaly detection model. Simulation results show that compared with traditional network intrusion detection algorithm, the improved algorithm can improve the accuracy of intrusion detection and the detection efficiency. Source


Lin H.,Jimei University
Match | Year: 2013

The Wiener index of a graph is defined as the sum of distances between all pairs of vertices of the graph. In this paper, we characterize the trees which maximize and minimize the Wiener index among all trees of given order that have only vertices of odd degrees. Source


Lin X.,Jimei University
Match | Year: 2012

The Wiener index of a graph is defined as the sum of distances between all pairs of vertices of the graph. In this paper, we bound the Wiener index in a connected graph in function of its order and circumference, the graphs which minimize and maximize the Wiener index among all graphs with given order and circumference are also characterized. Source

Discover hidden collaborations