The Modeling of Cloud Serves Computing Search Algorithm for Big Data

DOI

10.2991/icmra-15.2015.279How to use a DOI?

Keywords

Cloud Serves Computing Search; Serve matrix reckoning; IRICP; range cloud data; Generalized Walsh Spectrum

Abstract

To solve the problem of reckoning the Cloud Serves Computing Search in cloud serve arithmetic linear analysis, the paper has proposed a search method and ameliorated arithmetic based on foliation related iterative intimates speck (IRICP) of the maximum deviation. The cloud data and its coefficient matrix is filiationized as range cloud data matrix, using IRICP arithmetic to reckon the best aligning state of adjacent range cloud data, and the serves property quotation of disc function transformation of this time was proved to be the Cloud Serves Computing Search by applying generalized Walsh spectrum; by proposing the foliation rule homolog using interval, determined the foliation homolog using nexus of iterative arithmetic, each disc of transformation matrix would be assigned to the next disc as the foliation transformation matrix which has ameliorated the marry speed of the IRICP arithmetic; the rationality and availabilities of this new search arithmetic can be proved by comparing with the Cloud Serves Computing Search arithmetic put forward by Matsui.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ning Tang
AU  - Shunzhi Zhu
AU  - Lizhao Liu
AU  - Jiangshui Hong
AU  - Lili Liu
PY  - 2015/04
DA  - 2015/04
TI  - The Modeling of Cloud Serves Computing Search Algorithm for Big Data
BT  - Proceedings of the 3rd International Conference on Mechatronics, Robotics and Automation
PB  - Atlantis Press
SP  - 1441
EP  - 1445
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmra-15.2015.279
DO  - 10.2991/icmra-15.2015.279
ID  - Tang2015/04
ER  -