Adaptive translational cueing motion algorithm using fuzzy based tilt coordination

Driving simulators have become useful research tools for the institution and laboratories which are studying in different fields of vehicular and transport design to increase road safety. Although classical washout filters are broadly used because of their short processing time, simplicity and ease of adjust, they have some disadvantages such as generation of wrong sensation of motions, false cue motions, and also their tuning process which is focused on the worst case situations leading to a poor usage of the workspace. The aim of this study is to propose a new motion cueing algorithm that can accurately transform vehicle specific force into simulator platform motions at high fidelity within the simulator’s physical limitations. This method is proposed to compensate wrong cueing motion caused by saturation of tilt coordination rate limit using an adaptive correcting signal based on added fuzzy logic into translational channel to minimize the human sensation error and exploit the platform more efficiently.

Adaptive washout algorithm based fuzzy tuning for improving human perception

The aim of this paper is to provide a washout filter that can accurately produce vehicle motions in the simulator platform at high fidelity, within the simulators physical limitations. This is to present the driver with a realistic virtual driving experience to minimize the human sensation error between the real driving and simulated driving situation. To successfully achieve this goal, an adaptive washout filter based on fuzzy logic online tuning is proposed to overcome the shortcomings of fixed parameters, lack of human perception and conservative motion features in the classical washout filters. The cutoff frequencies of highpass, low-pass filters are tuned according to the displacement information of platform, workspace limitation and human sensation in real time based on fuzzy logic system. The fuzzy based scaling method is proposed to let the platform uses the workspace whenever is far from its margins. The proposed motion cueing algorithm is implemented in MATLAB/Simulink software packages and provided results show the capability of this method due to its better performance, improved human sensation and exploiting the platform more efficiently without reaching the motion limitation.

Containing smartphone worm propagation with an influence maximization algorithm

In recent years, wide attention has been drawn to the problem of containing worm propagation in smartphones. Unlike existing containment models for worm propagation, we study how to prevent worm propagation through the immunization of key nodes (e.g.; the top k influential nodes). Thus, we propose a novel containment model based on an influence maximization algorithm. In this model, we introduce a social relation graph to evaluate the influence of nodes and an election mechanism to find the most influential nodes. Finally, this model provides a targeted immunization strategy to disable worm propagation by immunizing the top k influential nodes. The experimental results show that the model not only finds the most influential top k nodes quickly, but also effectively restrains and controls worm propagation.

A new color space based on K-medoids clustering for fire detection

Pixel color has proven to be a useful and robust cue for detection of most objects of interest like fire. In this paper, a hybrid intelligent algorithm is proposed to detect fire pixels in the background of an image. The proposed algorithm is introduced by the combination of a computational search method based on a swarm intelligence technique and the Kemdoids clustering method in order to form a Fire-based Color Space (FCS), in fact, the new technique converts RGB color system to FCS through a 3*3 matrix. This algorithm consists of five main stages:(1) extracting fire and non-fire pixels manually from the original image. (2) using K-medoids clustering to find a Cost function to minimize the error value. (3) applying Particle Swarm Optimization (PSO) to search and find the best W components in order to minimize the fitness function. (4) reporting the best matrix including feature weights, and utilizing this matrix to convert the all original images in the database to the new color space. (5) using Otsu threshold technique to binarize the final images. As compared with some state-of-the-art techniques, the experimental results show the ability and efficiency of the new method to detect fire pixels in color images.

K-Center: an approach on the multi-source identification of information diffusion

The global diffusion of epidemics, computer viruses, and rumors causes great damage to our society. It is critical to identify the diffusion sources and timely quarantine them. However, most methods proposed so far are unsuitable for diffusion with multiple sources because of the high computational cost and the complex spatiotemporal diffusion processes. In this paper, based on the knowledge of infected nodes and their connections, we propose a novel method to identify multiple diffusion sources, which can address three main issues in this area: 1) how many sources are there? 2) where did the diffusion emerge? and 3) when did the diffusion break out? We first derive an optimization formulation for multi-source identification problem. This is based on altering the original network into a new network concerning two key elements: 1) propagation probability and 2) the number of hops between nodes. Experiments demonstrate that the altered network can accurately reflect the complex diffusion processes with multiple sources. Second, we derive a fast method to optimize the formulation. It has been proved that the proposed method is convergent and the computational complexity is O(mn log α) , where α = α (m,n) is the slowly growing inverse-Ackermann function, n is the number of infected nodes, and m is the number of edges connecting them. Finally, we introduce an efficient algorithm to estimate the spreading time and the number of diffusion sources. To evaluate the proposed method, we compare the proposed method with many competing methods in various real-world network topologies. Our method shows significant advantages in the estimation of multiple sources and the prediction of spreading time.

Extension of bivariate means to weighted means of several arguments by using binary trees

ABSTRACTAveraging aggregation functions are valuable in building decision making and fuzzy logic systems and in handling uncertainty. Some interesting classes of averages are bivariate and not easily extended to the multivariate case. We propose a generic method for extending bivariate symmetric means to n-variate weighted means by recursively applying the specified bivariate mean in a binary tree construction. We prove that the resulting extension inherits many desirable properties of the base mean and design an efficient numerical algorithm by pruning the binary tree. We show that the proposed method is numerically competitive to the explicit analytical formulas and hence can be used in various computational intelligence systems which rely on aggregation functions.