Peer-to-peer traffic recognition in cloud computing environment Tankai Gaozhonger Li Fengban because of the memory limit, the Peer-to-peer traffic recognition method can only deal with the small-scale data set. Moreover, the attribute characteristics of naive Bayesian classification are artificial selection, so the recognition rate is limited and lacks objectivity. Based on the above problem analysis, this paper puts forward naive Bayesian classification algorithm in cloud computing environment and improves the attribute reduction algorithm in cloud computing environment, and combines these two algorithms to realize the fine granularity recognition of the encrypted peer-to-peer traffic. The experimental results show that the method can ...
The management of cloud and over scale the challenge of high performance computing, as the third largest scientific research method besides experiment and theory, has been paid more and more attention. High-performance computing even partly reflects the level of comprehensive national strength, countries have invested heavily in the construction of large supercomputers, top 500 records are constantly refreshed. However, the increase of the scale of the calculation has brought new challenges to the system management of High-performance computing. 1. In the case of fixed resources, multi-user high-performance Computing System job scheduling is the pursuit of systems utilization and User Service quality balance, but it is difficult to guarantee, such as short ...
Application of improved SFLA algorithm in cloud computing resource scheduling Cocho in order to improve the efficiency of cloud computing task scheduling, an improved SFLA algorithm is used to implement task scheduling. In this paper, the Cloud computing task scheduling principle and scheduling strategy are analyzed, then the basic principles of the SFLA algorithm and the mathematical model are detailed, and the intelligent Swarm algorithm and adaptive SFLA Hybrid improved SFLA algorithm, and finally use the example simulation to verify the algorithm in the cloud computing scheduling performance, Compared with the traditional SFLA algorithm, the improved algorithm has faster convergence and higher accuracy in cloud computing scheduling.
Based on the cloud computing marketing Decision support System Zhang, Song Fogen Design and implement a cloud based marketing decision support system, and other management decision-making subsystem interaction, together constitute a complete modern enterprise management decision support system. The system's database adopts the distributed design, which makes the system have the ability of independently processing the local database, and can also read the data in the remote database. System Model Library contains a variety of marketing factors of the decision model, ...
The iterative MapReduce framework for evolutionary algorithm Jin Weijian Wang Branch MapReduce modular programming greatly reduces the implementation difficulty of the distributed algorithm, but also limits its application scope. This paper introduces the basic structure of mapreduce and the defects of its iterative algorithm, and proposes an iterative MapReduce computing framework which is suitable for evolutionary algorithm based on the research of MapReduce's computational framework on the basis of the inefficiency of mapreduce evolutionary algorithm. Describes the iterative m ...
With the continuous development of technology, 3G, the Internet of things and other technologies are maturing, combined with these technologies, FU-Hong introduced a technology to use WiFi cloud camera, began to play a pivotal role in the field of home security, to bring unpredictable changes to the world. The 14th session of the high fair just ended, we learned from the meeting that cloud computing as in recent years, "new technology", has slowly become a "top" project. Many exhibitors, research institutes and government agencies have focused more on the landing of cloud computing products. Cloud computing has begun to slowly blend into our lives and make a huge contribution to our wonderful Life ...
Cloud computing resource scheduling based on improved quantum genetic algorithm Liu Weining Hong Hongbing Liu for the efficient scheduling of resources under the cloud computing environment, the current research pays less attention to the service cost of cloud service providers, therefore, a cloud resource scheduling algorithm is proposed to improve the quantum genetic algorithm for the purpose of reducing the minimum service cost of cloud service providers. Because the chromosomes represented by binary quantum bits cannot describe the resource scheduling matrix, the algorithm converts the binary encoding of qubits into real coded and uses the rotation strategy and mutation operator to guarantee the convergence of the algorithm. Through the simulation experiment platform, this algorithm and genetic algorithm ...
Large-scale distributed solution of packet Dantzig Selector Liang of China University of Science and technology the main work of this paper includes: (1) using the Dantzig selector to solve the linear characteristics of the path piecewise, the Dasso algorithm to improve the Dantzig selector, The superiority of the improved algorithm is highlighted by comparing with the linear alternating direction multiplier method. (2) Overcome the difficulty of solving the constraint condition in the packet Dantzig selector, introduce the intermediate variable to simplify, and apply the alternating direction multiplier method (ADMM) and the alternating direction of linearization.
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.