Human perception-based washout filtering using genetic algorithm

The Motion Cueing Algorithm (MCA) transforms longitudinal and rotational motions into simulator movement, aiming to regenerate high fidelity motion within the simulators physical limitations. Classical washout filters are widely used in commercial simulators because of their relative simplicity and reasonable performance. The main drawback of classical washout filters is the inappropriate empirical parameter tuning method that is based on trial-and-error, and is effected by programmers’ experience. This is the most important obstacle to exploiting the platform efficiently. Consequently, the conservative motion produces false cue motions. Lack of consideration for human perception error is another deficiency of classical washout filters and also there is difficulty in understanding the effect of classical washout filter parameters on generated motion cues. The aim of this study is to present an effortless optimization method for adjusting the classical MCA parameters, based on the Genetic Algorithm (GA) for a vehicle simulator in order to minimize human sensation error between the real and simulator driver while exploiting the platform within its physical limitations. The vestibular sensation error between the real and simulator driver as well as motion limitations have been taken into account during optimization. The proposed optimized MCA based on GA is implemented in MATLAB/Simulink. The results show the superiority of the proposed MCA as it improved the human sensation, maximized reference signal shape following and exploited the platform more efficiently within the motion constraints.

Privacy preserving collaborative filtering for KNN attack resisting

Privacy preserving is an essential aspect of modern recommender systems. However, the traditional approaches can hardly provide a rigid and provable privacy guarantee for recommender systems, especially for those systems based on collaborative filtering (CF) methods. Recent research revealed that by observing the public output of the CF, the adversary could infer the historical ratings of the particular user, which is known as the KNN attack and is considered a serious privacy violation for recommender systems. This paper addresses the privacy issue in CF by proposing a Private Neighbor Collaborative Filtering (PriCF) algorithm, which is constructed on the basis of the notion of differential privacy. PriCF contains an essential privacy operation, Private Neighbor Selection, in which the Laplace noise is added to hide the identity of neighbors and the ratings of each neighbor. To retain the utility, the Recommendation-Aware Sensitivity and a re-designed truncated similarity are introduced to enhance the performance of recommendations. A theoretical analysis shows that the proposed algorithm can resist the KNN attack while retaining the accuracy of recommendations. The experimental results on two real datasets show that the proposed PriCF algorithm retains most of the utility with a fixed privacy budget.