Motion and Special Relativity in Complex Spaces

A natural extension of the Lorentz transformation to its complex version was constructed together with a parallel extension of the Minkowski M4 model for special relativity (SR) to complex C4 space-time. As the [signed] absolute values of complex coordinates of the underlying motion’s characterization in C4 one obtains a Newtonian-like type of motion whereas as the real parts of the complex motion’s description and of the complex Lorentz transformation, all the SR theory as modeled by M4 real space-time can be recovered. This means all the SR theory is preserved in the real subspace M4 of the space-time C4 while becoming simpler and clearer in the new complex model’s framework. Since velocities in the complex model can be determined geometrically, with no primary use of time, time turns out to be definable within the equivalent theory of the reduced complex C4 model to the C3 “para-space” model. That procedure allows us to separate time from the (para)space and consider all the SR theory as a theory of C3 alone. On the other hand, the complex time defined within the C3 theory is interpreted and modeled by the single separate C1 complex plane. The possibility for application of the C3 model to quantum mechanics is suggested. As such, the model C3 seems to have unifying abilities for application to different physical theories.

L-priorities Bloom Filter: A New Member of the Bloom Filter Family

A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.

Dm-KDE： dynamical kernel density estimation by sequences of KDE estimators with fixed number of components over data streams

In many data stream mining applications, traditional density estimation methods such as kemel density estimation, reduced set density estimation can not be applied to the density estimation of data streams because of their high computational burden, processing time and intensive memory allocation requirement. In order to reduce the time and space complexity, a novel density estimation method Dm-KDE over data streams based on the proposed algorithm m-KDE which can be used to design a KDE estimator with the fixed number of kernel components for a dataset is proposed. In this method, Dm-KDE sequence entries are created by algorithm m-KDE instead of all kemels obtained from other density estimation methods. In order to further reduce the storage space, Dm-KDE sequence entries can be merged by calculating their KL divergences. Finally, the probability density functions over arbitrary time or entire time can be estimated through the obtained estimation model. In contrast to the state-of-the-art algorithm SOMKE, the distinctive advantage of the proposed algorithm Dm-KDE exists in that it can achieve the same accuracy with much less fixed number of kernel components such that it is suitable for the scenarios where higher on-line computation about the kernel density estimation over data streams is required. We compare Dm-KDE with SOMKE and M-kernel in terms of density estimation accuracy and running time for various stationary datasets. We also apply Dm-KDE to evolving data streams. Experimental results illustrate the effectiveness of the pro- posed method.