Search

The ever-increasing popularity of web service sharing communities have produced a considerable amount of web services that share similar functionalities but vary in Quality of Services (QoS) performances. To alleviate the heavy service selection burden on users, lightweight recommendation ideas, e.g., Collaborative Filtering (CF) have been developed to aid users to select their preferred services. However, existing CF methods often face two challenges. First, service QoS is often context-aware and hence depends on the spatial and temporal information of service invocations heavily. While it requires challenging efforts to integrate both spatial and temporal information into service recommendation decision-making process simultaneously. Second, the location-aware and time-aware QoS data often contain partial sensitive information of users, which raise an emergent privacy-preservation requirement when performing service recommendations. In view of above two challenges, in this paper, we integrate the spatial-temporal information of QoS data and Locality-Sensitive Hashing (LSH) into recommendation domain and bring forth a location-aware and time-aware recommendation approach considering privacy concerns. At last, a set of experiments conducted on well-known WS-DREAM dataset show the feasibility of our approach. [ABSTRACT FROM AUTHOR]

Aiming at the non-linear structure of massive multiple-input multiple-output (MIMO) channel data, this paper proposes a channel state information (CSI) compression feedback algorithm based on Laplacian Eigenmaps (LE) non-linear processing for massive MIMO uniform linear array. The spatial correlation of the channel array determines the Laplacian matrix, and the channel compression matrix is obtained by Laplacian matrix eigenvalue decomposition. The simulation results show that the proposed LE algorithm can reduce the feedback overhead, and its bit error rate (BER) performance is better than that of the discrete cosine transform (DCT) sparse compression algorithm. In addition, the proposed LE algorithm computational complexity is higher than DCT, and lower than principal component analysis (PCA) and Karhunen-Loeve transform (KLT) algorithms, but the LE algorithm can achieve higher feedback accuracy when the feedback overhead is slightly lower than DCT. [ABSTRACT FROM AUTHOR]