Challenges and opportunities: from big data to knowledge in AI 2.0

Y Zhuang, F Wu, C Chen, Y Pan - Frontiers of Information Technology & …, 2017 - Springer
In this paper, we review recent emerging theoretical and technological advances of artificial
intelligence (AI) in the big data settings. We conclude that integrating data-driven machine …

Mosaic: Processing a trillion-edge graph on a single machine

S Maass, C Min, S Kashyap, W Kang… - Proceedings of the …, 2017 - dl.acm.org
Processing a one trillion-edge graph has recently been demonstrated by distributed graph
engines running on clusters of tens to hundreds of nodes. In this paper, we employ a single …

Understanding and optimizing asynchronous low-precision stochastic gradient descent

C De Sa, M Feldman, C Ré, K Olukotun - Proceedings of the 44th annual …, 2017 - dl.acm.org
Stochastic gradient descent (SGD) is one of the most popular numerical algorithms used in
machine learning and other domains. Since this is likely to continue for the foreseeable …

To push or to pull: On reducing communication and synchronization in graph computations

M Besta, M Podstawski, L Groner, E Solomonik… - Proceedings of the 26th …, 2017 - dl.acm.org
We reduce the cost of communication and synchronization in graph processing by analyzing
the fastest way to process graphs: pushing the updates to a shared state or pulling the …

Cloud-based approximate constrained shortest distance queries over encrypted graphs with privacy protection

M Shen, B Ma, L Zhu, R Mijumbi… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Constrained shortest distance (CSD) querying is one of the fundamental graph query
primitives, which finds the shortest distance from an origin to a destination in a graph with a …

Distributed shared persistent memory

Y Shan, SY Tsai, Y Zhang - Proceedings of the 2017 Symposium on …, 2017 - dl.acm.org
Next-generation non-volatile memories (NVMs) will provide byte addressability, persistence,
high density, and DRAM-like performance. They have the potential to benefit many …

Tapir: Embedding fork-join parallelism into LLVM's intermediate representation

TB Schardl, WS Moses, CE Leiserson - Proceedings of the 22nd ACM …, 2017 - dl.acm.org
This paper explores how fork-join parallelism, as supported by concurrency platforms such
as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR) …

Mobile big data: The fuel for data-driven wireless

X Cheng, L Fang, L Yang, S Cui - IEEE Internet of things …, 2017 - ieeexplore.ieee.org
In the past decade, the smart phone evolution has accelerated the proliferation of the mobile
Internet and spurred a new wave of mobile applications, leading to an unprecedented …

Big graph analytics platforms

D Yan, Y Bu, Y Tian, A Deshpande - Foundations and Trends® …, 2017 - nowpublishers.com
Due to the growing need to process large graph and network datasets created by modern
applications, recent years have witnessed a surging interest in developing big graph …

An empirical study of code smells in javascript projects

A Saboury, P Musavi, F Khomh… - 2017 IEEE 24th …, 2017 - ieeexplore.ieee.org
JavaScript is a powerful scripting programming language that has gained a lot of attention
this past decade. Initially used exclusively for client-side web development, it has evolved to …