In this paper, a large-scale human action recognition system is proposed which is built upon the combination of the rising big data processing technology Spark and the powerful Graphics Processing Unit (GPU) in order ...
详细信息
The password pattern has become a widely used mobile authentication method. However, there are still some potential security problems since the passwords are easy to be cracked by some malicious software. An important...
详细信息
A novel approach related to query expansion is proposed to improve image retrieval performance. The proposed approach investigates the problem that not all of the visual features extracted from images are appropriate ...
详细信息
In the classical computation theory, the language of a system features the computational behavior of the system but it does not distinguish the determinism and nondeterminism of actions. However, Milner found that the...
详细信息
With the extensive application of the knowledge base (KB), how to complete it is a hot topic on Semantic Web. However, many problems go with the big data, and the event matching is one of these problems, which is find...
With the extensive application of the knowledge base (KB), how to complete it is a hot topic on Semantic Web. However, many problems go with the big data, and the event matching is one of these problems, which is finding out the entities referring to the same things in the real world and also the key point in the extending process. To enrich the emergency knowledge base (E-SKB) we constructed before, we need to filter out the news from several web pages and find the same news to avoid data redundancy. In this paper, we proposed a hierarchy blocking method to reduce the times of comparisons and narrow down the scope by extracting the news properties as the blocking keys. The method transforms the event matching problem into a clustering problem. Experimental results show that the proposed method is superior to the existing text clustering algorithm with high precision and less comparison times.
With the rapid development of Internet technology, crowdsourcing, as a flexible, effective and low-cost problem-solving method, has begun to receive more and more attention. The use of crowdsourcing to evaluate the qu...
With the rapid development of Internet technology, crowdsourcing, as a flexible, effective and low-cost problem-solving method, has begun to receive more and more attention. The use of crowdsourcing to evaluate the quality of linked data has also become a research hotspot. This paper proposes the concept of Domain Specialization Test (DST), which uses domain professional testing tasks DSTs to evaluate the professionalism of workers, and combines the idea of Mini-batch Gradient Descent (MBGD) to improve the EM algorithm, and the MBEM algorithm is proposed to achieve efficient and accurate evaluation of task results. The experimental results show that the proposed method can screen out the appropriate workers for the linked data crowdsourcing task and improve the accuracy and iteration efficiency of the results.
Pythagorean fuzzy sets provide stronger ability than intuitionistic fuzzy sets to model uncertainty information and knowledge, but little effort has been paid to conflict analysis of Pythagorean fuzzy information syst...
详细信息
In order to improve fault forecasting model accuracy of back propagation neural network (BPNN), an improved prediction method of optimized BPNN based on Multilevel Genetic Algorithm (MGA) was proposed. We design new c...
详细信息
Path restoring is a path searching problem in the time-dependent road network with the time constraints of origin and destination. This paper proposes a path restoring algorithm to find the possible path that vehicles...
详细信息
Path restoring is a path searching problem in the time-dependent road network with the time constraints of origin and destination. This paper proposes a path restoring algorithm to find the possible path that vehicles may have been driving along. We mined the vehicle trajectories based on historical GPS data and then build a "popular" intersection graph based on its entropy and frequency. Then the restoring path is searched on the sub-graph of the popular intersection graph. The experiment result shows that the proposed algorithm increases 10% compared to that of using timedependent fastest path method.
Inter-organizational workflow nets(IWF-nets) can well model the interactions among multiple processes by sending/receiving messages. Compatibility and weak compatibility are crucial properties for *** latter guarantee...
详细信息
Inter-organizational workflow nets(IWF-nets) can well model the interactions among multiple processes by sending/receiving messages. Compatibility and weak compatibility are crucial properties for *** latter guarantees that a system is deadlock-free and livelock-free while the former also guarantees that it has no dead tasks. Our previous work proved that the(weak) compatibility problem is PSPACE-complete for safe IWF-nets. This paper defines a class of IWF-nets in which some simple circuits are allowed. Necessary and sufficient conditions are presented to decide compatibility and weak compatibility for this class, and they are dependent on the net structures only. Algorithms are developed based on these conditions. In addition, we show that the traditional net structures like siphon cannot be easily used to decide the(weak) compatibility of IWF-nets.
暂无评论