As an important aspect in video content analysis, event detection is still an open problem. In particular, the study on detecting interactive events in crowd scenes is still limited. In this paper, we investigate dete...
详细信息
Matchmaking is considered as one of the crucial factors to ensure pervasive discovery of web services. Current matchmaking methods are inadequate to semantic information with machine understandable, therefore intellig...
详细信息
Matchmaking is considered as one of the crucial factors to ensure pervasive discovery of web services. Current matchmaking methods are inadequate to semantic information with machine understandable, therefore intelligent service discovery can not be carried on. In this paper, we use fuzzy linguistic variables to represent the vague or imprecise data at abstract level. The match method performs two levels, first level is capability match by inputs and outputs interfaces based on description logic reasoning, and the second level is the fuzzy match with linguistic variables, thus the more reasonable results will be presented to the users for selection.
Utility services provided by cloud computing rely on virtual customer communities forming spontaneously and evolving continuously. Clarifying the explicit boundaries of these communities is thus essential to the quali...
详细信息
Heterogeneity is the natural feature in distributed networks. Different from the traditional disk array, the amount of data allocated on heterogenous peers may be not the same. To maximize the reliability of stored da...
详细信息
Heterogeneity is the natural feature in distributed networks. Different from the traditional disk array, the amount of data allocated on heterogenous peers may be not the same. To maximize the reliability of stored data objects in heterogeneous networks, the optimal allocation of erasure-coded fragments is a challenging problem constrained with heterogeneous peer availabilities and redundancy overhead. This paper examines this optimal problem considered MDS erasure codes applied into distributed storage networks. First, we model the reliability of an allocation with the weighted-k-out-of-s model and extend its properties to efficiently calculate the reliability of an allocation; then we reduce the reliability computation of a given allocation to linear computation cost based on the weighted k-out-of-s model. Then, we deduce the problem to integer partition problem and propose two order-based search algorithms. Our experiments show that our proposed algorithms can be applied to find the optimal allocations efficiently in various practical coding cases. Furthermore, we evaluate the performance of our proposed search algorithms with some practical storage settings, and then present experimental results including the reliability, redundancy overheads and allocation pattern for the optimal allocation driven by practical network traces.
Computation of the optical flow from a sequence of images remains open in the community of computer vision. Two classical models for this problem are the global smoothness algorithm proposed by Horn- Schunck and the o...
详细信息
Introduce the basic concept of best rational approximation and constructing procedure of the best rational approximation function in Laplace domain. By an illustrative example the design method of FOC based on best ra...
详细信息
Introduce the basic concept of best rational approximation and constructing procedure of the best rational approximation function in Laplace domain. By an illustrative example the design method of FOC based on best rational approximation is discussed. The performance comparison of transfer functions between the FOC obtained by best rational approximation method and conventional PID shows that it is effective to apply the method in design of FOC, which can guarantee maximum absolute error of amplitude frequency characteristic of approximation function in a given error tolerance.
Spike sorting is the essential step in analyzing recording spike signals for studying information processing mechanisms within the nervous system. Overlapping is one of the most serious problems in the spike sorting f...
详细信息
In order to solve how to enhance the discovery efficiency and coverage, based on DHT (Distributed Hash Table) and Small World Theory, we put forward a new algorithm of service discovery for mobile application. In trad...
详细信息
To improve the mobile applications under the banner of the Internet of Things, we propose and design a new kind of Web-based method of seamless migration. The method can ensure the media seamless migration fast, smoot...
详细信息
To improve the mobile applications under the banner of the Internet of Things, we propose and design a new kind of Web-based method of seamless migration. The method can ensure the media seamless migration fast, smoothly and correctly. Implemented method will better solve the migration of media on the application layer of mobile application. Tests have shown our suggested seamless migration strategies are effective. This method will serve universal Web-based mobile application.
The control of network congestion has become a hot spot in the study of Internet of Things transmission service. Considering the complicated and integrated network environment that the Internet of Things to face in th...
详细信息
The control of network congestion has become a hot spot in the study of Internet of Things transmission service. Considering the complicated and integrated network environment that the Internet of Things to face in the future, the paper comes up with control algorithm of self-adapting congestion based on semi-normal distribution, this algorithm has improved the original packet loss rate function, and conduct corresponding control over network situation categorized according to the length of queue. The result of experiment shows that the algorithm of self-adapting congestion control based on semi-normal distribution is adapt to the complicated changing congestion situation in Internet of Things.
暂无评论