Titlebook: ;

genesis

啜泣

Indelible

Dirk Olbers,Jürgen Willebrand,Carsten Edenlevel features of apps are extracted by app feature extractor. App similarity computer computes the similarity score of two apps based on these features. A prototype system is implemented. The evaluation results demonstrate that the proposed cloud-based framework is highly scalable and effective for large-scale Android app repackaging detection.

Popcorn

Fluid Flow in Continental Margin Sedimentsestion links. We design a multi-level bloom filter to detect large flows and propose a flow scheduling algorithm based on VM migration (FSVMM) for data centers to optimize network performance. The FSVMM is evaluated with real trace data. Results show that the FSVMM can reduce the number of congestion links and improve user experience.

雇佣兵

Simulate

ZooKeeper+: The Optimization of Election Algorithm in Complex Network Circumstancehe evaluation, it takes not much overhead to realize the addition and deletion of servers and the recovery of crashed servers under various complex network circumstances, and it takes little more election time and initialization time of service to obtain the greater scalability.

Fabric

A Scalable Cloud-Based Android App Repackaging Detection Frameworklevel features of apps are extracted by app feature extractor. App similarity computer computes the similarity score of two apps based on these features. A prototype system is implemented. The evaluation results demonstrate that the proposed cloud-based framework is highly scalable and effective for large-scale Android app repackaging detection.

FIN

A Flow Scheduling Algorithm Based on VM Migration in Data Center Networksestion links. We design a multi-level bloom filter to detect large flows and propose a flow scheduling algorithm based on VM migration (FSVMM) for data centers to optimize network performance. The FSVMM is evaluated with real trace data. Results show that the FSVMM can reduce the number of congestion links and improve user experience.

ALERT

A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problemf constraint string in . as a substring and the length of . is maximized. A very simple dynamic programming algorithm to this problem is presented in this paper. The correctness of the new algorithm is demonstrated. The time and space complexities of the new algorithm are both .(.).

印第安人