The traditional method of doing business has been disrupted by socialmedia. In order to develop the enterprise, it is essential to forecast the level ofinteraction that a new post would receive from social media users...The traditional method of doing business has been disrupted by socialmedia. In order to develop the enterprise, it is essential to forecast the level ofinteraction that a new post would receive from social media users. It is possiblefor the user’s interest in any one social media post to be impacted by external factors or to dwindle as a result of changes in his behaviour. The popularity detectionstrategies that are user-based or population-based are unable to keep up with theseshifts, which leads to inaccurate forecasts. This work makes a prediction abouthow popular the post will be and addresses any anomalies caused by factors outside of the study. A novel improved PARAFAC (A-PARAFAC) method that istensor factorization-based has been presented in order to cope with the user criteria that will be used in the future to rate any project. We consolidated the information on the historically popular content, and we accelerated the computation bychoosing the top contents that were most like each other. The tensor is factorisedwith the application of the Adam optimization. It has been modified such that thebias is now included in the gradient function of A-PARAFAC, and the value ofthe bias is updated after each iteration. The prediction accuracy is improved by32.25% with this strategy compared to other state of the art methods.展开更多
The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific f...The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific flows by matching them against a set of dynamic rules. This basic process accelerates the processing of data, so that instead of processing singular packets repeatedly, corresponding actions are performed on corresponding flows of packets. In this paper, first, we address limitations on a typical packet classification algorithm like Tuple Space Search (TSS). Then, we present a set of different scenarios to parallelize it on different parallel processing platforms, including Graphics Processing Units (GPUs), clusters of Central Processing Units (CPUs), and hybrid clusters. Experimental results show that the hybrid cluster provides the best platform for parallelizing packet classification algorithms, which promises the average throughput rate of 4.2 Million packets per second (Mpps). That is, the hybrid cluster produced by the integration of Compute Unified Device Architecture (CUDA), Message Passing Interface (MPI), and OpenMP programming model could classify 0.24 million packets per second more than the GPU cluster scheme. Such a packet classifier satisfies the required processing speed in the programmable network systems that would be used to communicate big medical data.展开更多
文摘The traditional method of doing business has been disrupted by socialmedia. In order to develop the enterprise, it is essential to forecast the level ofinteraction that a new post would receive from social media users. It is possiblefor the user’s interest in any one social media post to be impacted by external factors or to dwindle as a result of changes in his behaviour. The popularity detectionstrategies that are user-based or population-based are unable to keep up with theseshifts, which leads to inaccurate forecasts. This work makes a prediction abouthow popular the post will be and addresses any anomalies caused by factors outside of the study. A novel improved PARAFAC (A-PARAFAC) method that istensor factorization-based has been presented in order to cope with the user criteria that will be used in the future to rate any project. We consolidated the information on the historically popular content, and we accelerated the computation bychoosing the top contents that were most like each other. The tensor is factorisedwith the application of the Adam optimization. It has been modified such that thebias is now included in the gradient function of A-PARAFAC, and the value ofthe bias is updated after each iteration. The prediction accuracy is improved by32.25% with this strategy compared to other state of the art methods.
文摘The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific flows by matching them against a set of dynamic rules. This basic process accelerates the processing of data, so that instead of processing singular packets repeatedly, corresponding actions are performed on corresponding flows of packets. In this paper, first, we address limitations on a typical packet classification algorithm like Tuple Space Search (TSS). Then, we present a set of different scenarios to parallelize it on different parallel processing platforms, including Graphics Processing Units (GPUs), clusters of Central Processing Units (CPUs), and hybrid clusters. Experimental results show that the hybrid cluster provides the best platform for parallelizing packet classification algorithms, which promises the average throughput rate of 4.2 Million packets per second (Mpps). That is, the hybrid cluster produced by the integration of Compute Unified Device Architecture (CUDA), Message Passing Interface (MPI), and OpenMP programming model could classify 0.24 million packets per second more than the GPU cluster scheme. Such a packet classifier satisfies the required processing speed in the programmable network systems that would be used to communicate big medical data.
