An Improved PSO-SVM Algorithm for License Plate Recognition
Weichao Jiao,
Junfei Dong
Issue:
Volume 1, Issue 1, May 2016
Pages:
1-4
Received:
7 March 2016
Accepted:
16 March 2016
Published:
10 April 2016
DOI:
10.11648/j.mcs.20160101.11
Downloads:
Views:
Abstract: Support vector machine is a machine learning algorithm with good performance, its parameters have an important influence on accuracy of classification, and parameters selection is becoming one of the main research areas of machine learning. This paper adopt support vector machine to recognize the characters of license plate. But in order to get good parameters of support vector machine, this paper has proposed a modified particles warm optimization algorithm to obtain the parameters of support vector machine. Experiments show that the proposed algorithm has higher recognition accuracy than others, the character recognition accuracy of training set is 99.95%, and character recognition accuracy of test set reaches 98.87%.
Abstract: Support vector machine is a machine learning algorithm with good performance, its parameters have an important influence on accuracy of classification, and parameters selection is becoming one of the main research areas of machine learning. This paper adopt support vector machine to recognize the characters of license plate. But in order to get goo...
Show More
A Matrix Representation of an n-Person 0-1 Game and Its 0-1 Tail Algorithm to Find (Strictly) Pure Nash Equilibria
Issue:
Volume 1, Issue 1, May 2016
Pages:
5-9
Received:
2 April 2016
Accepted:
11 April 2016
Published:
9 May 2016
DOI:
10.11648/j.mcs.20160101.12
Downloads:
Views:
Abstract: An n-person double action game, i.e., an n-person strategy game, i.e., every player has and only has two actions, is a typical and useful game. It has been proved that in an n-person double game, every player’s two actions can be denoted by 0 and 1. An n-person double action game, i.e., every player’s action set is denoted as {0,1}, is said to be an n-person 0-1 game. In this paper, we first give a matrix representation of an n-person 0-1 game and then give a new and simpler algorithm to find all the (strictly) pure Nash equilibria for an n-person 0-1 game, called 0-1 tail algorithm. Specially, this algorithm can be simplified if the game is symmetrical. Some examples are given to show the algorithm.
Abstract: An n-person double action game, i.e., an n-person strategy game, i.e., every player has and only has two actions, is a typical and useful game. It has been proved that in an n-person double game, every player’s two actions can be denoted by 0 and 1. An n-person double action game, i.e., every player’s action set is denoted as {0,1}, is said to be a...
Show More
High Altitude Platform Station Network and Channel Modeling Performance Analysis
Xiaoyang Liu,
Chao Liu,
Wanping Liu,
Xiaoping Zeng
Issue:
Volume 1, Issue 1, May 2016
Pages:
10-16
Received:
16 April 2016
Accepted:
28 April 2016
Published:
13 May 2016
DOI:
10.11648/j.mcs.20160101.13
Downloads:
Views:
Abstract: High altitude platform station (HAPS) is a wireless repeater in the air. It can play a dominant role in observations, remote sensing and communication. The structure and composition of formation of HAPS are studied in this paper. The performance of the wireless communication link are researched. The simulation results shows that the power of receiver is proportional to the received power and thermal noise power ratio.
Abstract: High altitude platform station (HAPS) is a wireless repeater in the air. It can play a dominant role in observations, remote sensing and communication. The structure and composition of formation of HAPS are studied in this paper. The performance of the wireless communication link are researched. The simulation results shows that the power of receiv...
Show More
to denote the prime divisor set of the various conjugacy class lengths of G and 
the maximum number of distinct prime divisors of a single conjugacy class length of G. It is a famous open problem that 
can be bounded by 
built on element orders is a tree. By usi...
Show More
except possibly when G is isomorphic to 
, where p is an odd prime and α is a field automorphism of odd prime order f. In the exceptional case, 
. Combining with our known result, we also prove that for a finite group G with 
is true.