Block-Ranking: Content Similarity Retrieval Based on Data Partition in Network Storage Environment

Author(s):  
Jingli Zhou ◽  
Ke Liu ◽  
Leihua Qin ◽  
Xuejun Nie
2008 ◽  
Vol 24 (4) ◽  
pp. 254-262 ◽  
Author(s):  
Tobias Gschwendner ◽  
Wilhelm Hofmann ◽  
Manfred Schmitt

In the present study we applied a validation strategy for implicit measures like the IAT, which complements multitrait-multimethod (MTMM) analyses. As the measurement method (implicit vs. explicit) and underlying representation format (associative vs. propositional) are often confounded, the validation of implicit measures has to go beyond MTMM analysis and requires substantive theoretical models. In the present study (N = 133), we employed such a model ( Hofmann, Gschwendner, Nosek, & Schmitt, 2005 ) and investigated two moderator constructs in the realm of anxiety: specificity similarity and content similarity. In the first session, different general and specific anxiety measures were administered, among them an Implicit Association Test (IAT) general anxiety, an IAT-spider anxiety, and an IAT that assesses speech anxiety. In the second session, participants had to deliver a speech and behavioral indicators of speech anxiety were measured. Results showed that (a) implicit and explicit anxiety measures correlated significantly only on the same specification level and if they measured the same content, and (b) specific anxiety measures best predicted concrete anxious behavior. These results are discussed regarding the validation of implicit measures.


2009 ◽  
Vol 20 (10) ◽  
pp. 2752-2765 ◽  
Author(s):  
Yang YIN ◽  
Zhen-Jun LIU ◽  
Lu XU
Keyword(s):  

2018 ◽  
Vol 7 (12) ◽  
pp. 472 ◽  
Author(s):  
Bo Wan ◽  
Lin Yang ◽  
Shunping Zhou ◽  
Run Wang ◽  
Dezhi Wang ◽  
...  

The road-network matching method is an effective tool for map integration, fusion, and update. Due to the complexity of road networks in the real world, matching methods often contain a series of complicated processes to identify homonymous roads and deal with their intricate relationship. However, traditional road-network matching algorithms, which are mainly central processing unit (CPU)-based approaches, may have performance bottleneck problems when facing big data. We developed a particle-swarm optimization (PSO)-based parallel road-network matching method on graphics-processing unit (GPU). Based on the characteristics of the two main stages (similarity computation and matching-relationship identification), data-partition and task-partition strategies were utilized, respectively, to fully use GPU threads. Experiments were conducted on datasets with 14 different scales. Results indicate that the parallel PSO-based matching algorithm (PSOM) could correctly identify most matching relationships with an average accuracy of 84.44%, which was at the same level as the accuracy of a benchmark—the probability-relaxation-matching (PRM) method. The PSOM approach significantly reduced the road-network matching time in dealing with large amounts of data in comparison with the PRM method. This paper provides a common parallel algorithm framework for road-network matching algorithms and contributes to integration and update of large-scale road-networks.


2017 ◽  
Vol E100.D (4) ◽  
pp. 785-792 ◽  
Author(s):  
Masataka ARAKI ◽  
Marie KATSURAI ◽  
Ikki OHMUKAI ◽  
Hideaki TAKEDA
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document