In order to maintain good social order, we need set some traffic patrol police service platforms at the vital communication line and important position of the city. In this paper, we will use graph theory method to deal with the problem of traffic patrol police service platform’s site selection for a fixed unban area. When there are some emergency events happened in the fixed area, these traffic patrol police service platforms should make corresponding response and close vital communication line immediately. So we also need to establish a optimal mathematics model to obtain a reasonable arrangement for closing the vital communication line. Meanwhile, building a scientific index system will help us to measure whether these arrangements reasonable or not.

Two new methodologies are established based on existing frameworks. The Bayesian model take ages, intellectual capability, transportation into consideration to find the offender’s anchor point. The grid search model investigation start with the highest score grid cell first for investigation and proceed down the list of grid cells sorted by score, which implement searching according to simulated annealing program . Making use of two different models we generate an integrated model and test their reliability according to historical serial crime samples.

In wireless networks, implementing repeaters can improve network capacity and CCTSS systems can be used to mitigate interference. This paper discussed the selection of covering shapes in a given area, and presented an optimum scheme of channel assignment and PL allocation. Meanwhile, the 3-colour theorem and 4-colour theorem in graph theory will be given. At last, we introduce the application of 3-colour theorem and 4-colour theorem in the problem of repeaters’ site selection. By the relevant calculation, we can prove the application is reasonable.

No abstract

Identification of protein-coding regions is a hot research area at present. After using mapping methods to turn symbolic genomic sequences into numeric sequences, we need to do the transform to show the period-3 component of protein-coding regions. In this paper, we find twofast algorithms relying on discrete Fourier transform and the extension of Signal Noise Ratio to compute the period-3 component of protein-coding regions.