195706110
A Scalable Peer-to-Peer Overlay for Applications with Time Constraints
With the development of Internet, p2p is increasingly receiving attention in research. Recently, a class of p2p applications with time constraints appear. These applications require a short time to locate the resource and(or) a low transit delay between the resource user and the resource holder, such as Skype, MSN. In this paper we propose a scalable p2p overlay for applications with time constraints. Our system provides supports for just two operations for uplayered p2p applications: (1) Given a resource key and the node's IP who holds the resource, it registers the resource information to the associated node in at most two overlay hops; and (2) Given a resource key and a time constraint(0 for no constraint), it returns if possible a path(one or two overlay hops) to the resource holder, and the transit delay of the path is lower than the time constraint. Results from theoretical analysis and simulations show that our system is viable and scalable.
18763296
A Scalable Peer-to-Peer Overlay for Applications with Time Constraints
With the development of Internet, p2p is increasingly receiving attention in research. Recently, a class of p2p applications with time constraints appear. These applications require a short time to locate the resource and(or) a low transit delay between the resource user and the resource holder, such as Skype, MSN. In this paper we propose a scalable p2p overlay for applications with time constraints. Our system provides supports for just two operations for uplayered p2p applications: (1) Given a resource key and the node's IP who holds the resource, it registers the resource information to the associated node in at most two overlay hops; and (2) Given a resource key and a time constraint(0 for no constraint), it returns if possible a path(one or two overlay hops) to the resource holder, and the transit delay of the path is lower than the time constraint. Results from theoretical analysis and simulations show that our system is viable and scalable.
17599458
Subsequence Similarity Search under Time Shifting
Time series data naturally arise in many application domains, and the similarity search for time series under dynamic time shifting is prevailing. But most recent research focused on the full length similarity match of two time series. In this paper a basic subsequence similarity search algorithm based on dynamic programming is proposed. For a given query time series, the algorithm can find out the most similar subsequence in a long time series. Furthermore two improved algorithms are also given in this paper. They can reduce the computation amount of the distance matrix for subsequence similarity search. Experiments on real and synthetic data sets show that the improved algorithms can significantly reduce the computation amount and running time compared to the basic algorithm
17435545
Improved spiral sense reconstruction using a multiscale wavelet model
SENSE has been widely accepted and extensively studied in the community of parallel MRI. Although many regularization approaches have been developed to address the ill-conditioning problem for Cartesian SENSE, fewer efforts have been made to address this problem when the sampling trajectory is non-Cartesian. For non-Cartesian SENSE using the iterative conjugate gradient method, ill- conditioning can degrade not only the signal-to-noise ratio, but also the convergence behavior. This paper proposes a regularization technique for non-Cartesian SENSE using a multiscale wavelet model. The technique models the desired image as a random field whose wavelet transform coefficients obey a generalized Gaussian distribution. The effectiveness of the proposed method has been validated by in vivo experiments.
31431918
Tight Bounds on the Estimation Distance Using Wavelet
Time series similarity search is of growing importance in many applications. Wavelet transforms are used as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time series data. This paper proposes the tight upper and lower bounds on the estimation distance using wavelet transform, and we show that the traditional distance estimation is only part of our lower bound. According to the lower bound, we can exclude more dissimilar time series than traditional method. And according to the upper bound, we can directly judge whether two time series are similar, and further reduce the number of time series to process in original time domain. The experiments have shown that using the upper and lower tight bounds can significantly improve filter efficiency and reduce running time than traditional method.
61155076
Opinion Mining
Описанл процедуру формування інтегрального показника об’єкта згідно з відгуками користувачів під час застосування методів оцінювання опінії текстової інформації у web-документах. Запропоновано використання лінгвістичних змінних та застосування вагових коефіцієнтів для достовірнішого результату оцінювання емоційного забарвлення текстової інформації. Ключові слова: опінія, емоційне забарвлення, об’єкт, інтегральний показник, лінгвістична змінна, ваговий коефіцієнт.
9847835
A Grid-Based System for the Multi-reservoir Optimal Scheduling in Huaihe River Basin
The up- and mid-stream of Huaihe River Basin is a complex system of reservoirs and river-ways. It is difficult for flood control and reservoir scheduling. It is ineffective to perform sequential computations for optimal scheduling of multi-reservoir due to the system complexity. In this paper, we implemented the multi-reservoir optimal scheduling algorithm in a Grid environment. Key components as multiple Protocols were developed within the layers of Grid architecture. The proposed Grid computing architecture provides an innovative design of multi-reservoir optimal scheduling system for increasing the accuracy of flood control and speedup of computing.