The dilaton in Weyl-Scale induced gravitational theory is regarded as a candidate of dark energy. When the potential of dilaton field is taken as the form Wσ ＋ σ^2e^-βσ2, that there exist attractor solutions to t...The dilaton in Weyl-Scale induced gravitational theory is regarded as a candidate of dark energy. When the potential of dilaton field is taken as the form Wσ ＋ σ^2e^-βσ2, that there exist attractor solutions to the canonical dilatonic dark energy model and the phontam model, and these attractors correspond to an equation of state ω = -1 and a cosmic density parameter Ωσ = 1, which are important features for a dark energy model and can fit with the current observations. We find a sufficient condition of the existence of a late time de Sitter attractor. The attractor behaviors, the evolutions of the state parameter ω and the cosmic density parameter Ω, the evolution of X （σ/σ0） and Y （σ/σ0^2） with respect to N（ln a）are shown numerically.展开更多
The clustering of trajectories over huge volumes of streaming data has been rec- ognized as critical for many modem applica- tions. In this work, we propose a continuous clustering of trajectories of moving objects ov...The clustering of trajectories over huge volumes of streaming data has been rec- ognized as critical for many modem applica- tions. In this work, we propose a continuous clustering of trajectories of moving objects over high speed data streams, which updates online trajectory clusters on basis of incremental line- segment clustering. The proposed clustering algorithm obtains trajectory clusters efficiently and stores all closed trajectory clusters in a bi- tree index with efficient search capability. Next, we present two query processing methods by utilising three proposed pruning strategies to fast handle two continuous spatio-temporal queries, threshold-based trajectory clustering queries and threshold-based trajectory outlier detections. Finally, the comprehensive experi- mental studies demonstrate that our algorithm achieves excellent effectiveness and high effi- ciency for continuous clustering on both syn- thetic and real streaming data, and the propo- sed query processing methods utilise average 90% less time than the naive query methods.展开更多
基金supported by the National Natural Science Foundation of China (Grant Nos.10573012, 10575068)the Science Foundation of Shanghai Municipal Commission of Science and Technology (Grant No.04dz05905)
文摘The dilaton in Weyl-Scale induced gravitational theory is regarded as a candidate of dark energy. When the potential of dilaton field is taken as the form Wσ ＋ σ^2e^-βσ2, that there exist attractor solutions to the canonical dilatonic dark energy model and the phontam model, and these attractors correspond to an equation of state ω = -1 and a cosmic density parameter Ωσ = 1, which are important features for a dark energy model and can fit with the current observations. We find a sufficient condition of the existence of a late time de Sitter attractor. The attractor behaviors, the evolutions of the state parameter ω and the cosmic density parameter Ω, the evolution of X （σ/σ0） and Y （σ/σ0^2） with respect to N（ln a）are shown numerically.
基金supported by the National Natural Science Foundation of China under Grants No.61172049,No.61003251the National High Technology Research and Development Program of China(863 Program)under Grant No.2011AA040101the Doctoral Fund of Ministry of Education of Chinaunder Grant No.20100006110015
文摘The clustering of trajectories over huge volumes of streaming data has been rec- ognized as critical for many modem applica- tions. In this work, we propose a continuous clustering of trajectories of moving objects over high speed data streams, which updates online trajectory clusters on basis of incremental line- segment clustering. The proposed clustering algorithm obtains trajectory clusters efficiently and stores all closed trajectory clusters in a bi- tree index with efficient search capability. Next, we present two query processing methods by utilising three proposed pruning strategies to fast handle two continuous spatio-temporal queries, threshold-based trajectory clustering queries and threshold-based trajectory outlier detections. Finally, the comprehensive experi- mental studies demonstrate that our algorithm achieves excellent effectiveness and high effi- ciency for continuous clustering on both syn- thetic and real streaming data, and the propo- sed query processing methods utilise average 90% less time than the naive query methods.
