Open Access. Powered by Scholars. Published by Universities.®

Data Storage Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

2014

Discipline
Institution
Keyword
Publication
Publication Type

Articles 301 - 303 of 303

Full-Text Articles in Data Storage Systems

Evaluation And Analysis Of Distributed Graph-Parallel Processing Frameworks, Yue Zhao, Kenji Yoshigoe, Mengjun Xie, Suijian Zhou, Remzi Seker, Jiang Bian Jan 2014

Evaluation And Analysis Of Distributed Graph-Parallel Processing Frameworks, Yue Zhao, Kenji Yoshigoe, Mengjun Xie, Suijian Zhou, Remzi Seker, Jiang Bian

Publications

A number of graph-parallel processing frameworks have been proposed to address the needs of processing complex and large-scale graph structured datasets in recent years. Although significant performance improvement made by those frameworks were reported, comparative advantages of each of these frameworks over the others have not been fully studied, which impedes the best utilization of those frameworks for a specific graph computing task and setting. In this work, we conducted a comparison study on parallel processing systems for large-scale graph computations in a systematic manner, aiming to reveal the characteristics of those systems in performing common graph algorithms with real-world …


Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral Jan 2014

Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of distance between any two m  n matrices. If the distance is 0 or m  n there is nothing interesting. When the distance happens to be a value t; 0 < t < m  n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.


Myspace, Inc. V. Graphon Corp.: Ignoring The Basic Premise That 101 Must Come Before 102 And 103, Emmanuel A. Fishelman Jan 2014

Myspace, Inc. V. Graphon Corp.: Ignoring The Basic Premise That 101 Must Come Before 102 And 103, Emmanuel A. Fishelman

Journal of Business & Technology Law

No abstract provided.