Selection of Probabilistic Data Structures for SPV Wallet Filtering

Author(s):  
Adeela Faridi ◽  
Farheen Siddiqui
Author(s):  
Dennis Grewe ◽  
Naresh Nayak ◽  
Deeban Babu ◽  
Wenwen Chen ◽  
Sebastian Schildt ◽  
...  

2016 ◽  
Vol 1 (1) ◽  
Author(s):  
Benjamin Schiller ◽  
Clemens Deusser ◽  
Jeronimo Castrillon ◽  
Thorsten Strufe

2019 ◽  
Vol 4 (4) ◽  
pp. 131
Author(s):  
Misbah Syah Anwar Kesuma Jaya ◽  
Pandu Gumilang ◽  
Tresna Wati ◽  
Yohanes Philipus Andersen ◽  
Teti Desyani

Support System for Decision on the Selection of Prospective Civil Servants is still an error when making changes to the data that has been entered, so that it can cause data can not be updated. So it needs to be tested to find problems with this software. Tests conducted on this software use the Black Box method based on Equivalence Partition as a whole with regard to the use, benefits, and results found from the use of the software. Equivalence Partition-based Black Box method tests the quality of the application that will be carried out by software testing documentation with the discovery of errors in each form that is divided into three error models, including errors in Functions, Data Structures and Interfaces. This test provides results where we will find out whether the software This has an error or not, and this test can guarantee the quality of this software.


2020 ◽  
Vol 6 ◽  
pp. 1-11
Author(s):  
Rudina Ademi Shala ◽  
Boele De Raad ◽  
Aliriza Arënliu

In this study, we describe the taxonomy of personality descriptive trait terms in the Albanian language according to the psycho-lexical procedure, in two parts. In the first part the selection of trait terms from a standard Albanian dictionary took place, largely according to standard procedures. This resulted in a useful set of 607 personality relevant terms. In the second part this list of trait terms was administered to 497 participants to obtain self-ratings. During the rating process, participants could indicate their familiarity with the terms, leading to another reduction to a final set of 434 trait terms with self-ratings. Principal Components Analysis followed by Varimax rotation was applied both using raw data and using ipsatized data. Structures with one up to seven factors were discussed and represented in a hierarchy of factor solutions. As an aid to the interpretation of the factors, use was made of markers of the Big Five, selected from the full list of 434 terms. The most comprehensive and clearest structure was found with seven factors, which included the Big Five and both Negative Valence and Positive Valence.


2018 ◽  
Author(s):  
Juan P. A. Lopes ◽  
Fabiano S. Oliveira ◽  
Paulo E. D. Pinto

In recent years, probabilistic data structures have been extensively employed to handle large volumes of streaming data in a timely fashion. However, their use in algorithms on giant graphs has been poorly explored. We introduce the concept of probabilistic implicit graph representation, which can represent large graphs using much less memory asymptotically by allowing adjacency test to have a constant probability of false positives or false negatives. This is an extension from the concept of implicit graph representation, comprehensively studied by Muller and Spinrad. Based on that, we also introduce two novel representations using probabilistic data structures. The first uses Bloom filters to represent general graphs with the same space complexity as the adjacency matrix (outperforming it however for sparse graphs). The other uses MinHash to represent trees with lower space complexity than any deterministic implicit representation. Furthermore, we prove some theoretical limitations for the latter approach.


1977 ◽  
Vol 12 (8) ◽  
pp. 147-154 ◽  
Author(s):  
Stanley J. Rosenschein ◽  
Shmuel M. Katz
Keyword(s):  

1977 ◽  
Author(s):  
Stanley J. Rosenschein ◽  
Shmuel M. Katz
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document