Entity

Time filter

Source Type


Shao Z.,Sichuan University | Shao Z.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | Liang M.,Guangxi University | He J.,Guangxi Academy of science | Xu X.,Guangxi Academy of science
2011 International Conference on Computer and Management, CAMAN 2011 | Year: 2011

For a graph G, G → (a1, a2, · · ·, ar)v means that in every r-coloring of the vertices in G, there exists a monochromatic ai-clique of color i for some i∈{1, 2, · · ·, r}. The vertex Folkman number is defined as Fv(a1, a2, ···, ar; k) = min{|V(G)|: G → (a1, a2, ···, ar)v and Kk ⊈G}. In general, computing lower and upper bounds for vertex Folkman numbers is difficult. In this note, based on theoretical analysis and computation, we show that Fv(2, 3, 3;4) ≥ 19 and Fv(3, 3, 3;4) ≥ 24, and suggest a cyclic graph of order 91 which may give an upper bound for Fv(3, 3, 3;4). ©2011 IEEE. Source


Zhang H.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | Zhang H.,Sichuan University | Hu J.,Beijing Jiaotong University | Hu J.,Chengdu University of Technology | Shen Y.,University of Science and Technology of China
Journal of Computational Information Systems | Year: 2015

In order to verify the network traffic decline because by node breakdown, this paper proposes a new type of prediction algorithm (Prediction algorithm based on Discrete-Queue for FARIMA model, PDF). At first, the mathematic formula for queuing situation and average queue length in steady state is derived with queuing theory in this algorithm based on discrete time, and the prediction method is established by FARIMA Model. Then, a simulation was conducted to research on the relationships between average queue length and service rate. The result shows that it has good adaptability, and the standard deviation between prediction traffic and original traffic is 10.18. ©, 2015, Binary Information Press. All right reserved. Source


Zhang H.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | Zhang H.,Chengdu University of Technology | Zhang H.,Sichuan University | Shen Y.C.,University of Science and Technology of China | Hu J.,Chengdu University of Technology
Computing, Control, Information and Education Engineering - Proceedings of the 2015 2nd International Conference on Computer, Intelligent and Education Technology, CICET 2015 | Year: 2015

This paper puts forward a new network flow Prediction algorithm (Prediction algorithm based-FARIMA model for Discrete Time, PFDT) in view of the network node congestion or Link disconnected. The algorithm deduces the mathematical expressions of average queue length when the queue exists a failure node with the theory of discrete time and establishes the prediction model by FARIMA. The simulation results show that the algorithm has good adaptability and the standard deviation is 10.28 compared with the original. © 2015 Taylor & Francis Group, London. Source


Shang Z.-W.,Chongqing University | Zhang F.,Chongqing University | Lang F.-N.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | Yuan B.,Chongqing University | Li J.,Chongqing University
Chongqing Daxue Xuebao/Journal of Chongqing University | Year: 2011

Based on the dependency of the PDTDFB coefficients across the interscale and interdirection and the statistical properties of HMT for the correlation properties, a new HMT in PDTDFB domain was put forward. Compared with the other typical denoising methods, the experimental results demonstrate that the proposed method shows better performance in image denoising, especially in edge maintenance. Source


Zhang H.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | Zhang H.,Sichuan University | Shen Y.,University of Science and Technology of China | Li Z.,Key Laboratory of Pattern Recognition and Intelligent Information Processing | And 3 more authors.
Journal of Information and Computational Science | Year: 2015

Center nodes have a bigger load and burden with lots of routing in an Ad Hoc Network Model. Congestion of the nodes' packets has a great impact on network performance, especially in wireless networks. This paper proposes a multi-dimensional perception of adaptive routing algorithms based on the loading of MAC, in particular its utility. Through calculating the probabilities of packet arrival, distribution and intensity of interference, conicting nodes and adjusting the contracting strength of packets would optimize network performance. Our simulated experiments show that this algorithm improves the success rate of data transmission, reduces the delay of packet transmission and improves network throughputs. Copyright © 2015 Binary Information Press. Source

Discover hidden collaborations