Filters








3 Hits in 2.8 sec

GEFF: Graph Embedding for Functional Fingerprinting

Kausar Abbas, Enrico Amico, Diana Otero Svaldi, Uttara Tipnis, Duy Anh Duong-Tran, Mintao Liu, Meenusree Rajapandian, Jaroslaw Harezlak, Beau M. Ances, Joaquín Goñi
2020 NeuroImage  
Here we propose an embedding framework, GEFF (Graph Embedding for Functional Fingerprinting), based on group-level decomposition of FCs into eigenvectors.  ...  It has been well established that Functional Connectomes (FCs), as estimated from functional MRI (fMRI) data, have an individual fingerprint that can be used to identify an individual from a population  ...  INFORMATION Authors acknowledge financial support from NIH R01EB022574 (JG), NIH R01MH108467 (JG and JH), Indiana Alcohol Research Center P60AA07611 (JG), and Purdue Discovery Park Data Science Award "Fingerprints  ... 
doi:10.1016/j.neuroimage.2020.117181 pmid:32702487 fatcat:d767c65agbgu3heipfpbigw6me

GEFF: Graph Embedding for Functional Fingerprinting [article]

Kausar Abbas, Enrico Amico, Diana Otero Svaldi, Uttara Tipnis, Duy Anh Duong-Tran, Mintao Liu, Meenusree Rajapandian, Jaroslaw Harezlak, Beau M. Ances, Joaquín Goñi
2020 arXiv   pre-print
Here we propose an embedding framework, GEFF (Graph Embedding for Functional Fingerprinting), based on group-level decomposition of FCs into eigenvectors.  ...  It has been well established that Functional Connectomes (FCs), as estimated from functional MRI (fMRI) data, have an individual fingerprint that can be used to identify an individual from a population  ...  DISCUSSION In this paper, we proposed an embedding framework for FC fingerprinting called GEFF: Graph Embedding for Functional Fingerprinting.  ... 
arXiv:2001.06605v1 fatcat:udhprzlkaja5thok5ykuq3gbuu

Analysis of lightweight stream ciphers

Simon Fischer
2008
Finally, we investigate the algebraic structure of the initialization function of stream ciphers and provide a framework for key recovery attacks.  ...  They can be very suitable in environments with restricted resources, such as mobile devices or embedded systems.  ...  In general, finding a 2-neutral set is an NP-complete problem (the problem is equivalent to the Maximum Clique Problem from graph theory), but good heuristic algorithms for dense graphs exist, e.g. see  ... 
doi:10.5075/epfl-thesis-4040 fatcat:q6x5qdgrxbdf3k4lngro7atlsm