Filters








172 Hits in 5.9 sec

Mosaic Warfare and Human–Machine Symbiosis

Timothy P. Grayson, Samuele Lilliu
2021 Scientific Video Protocols  
Here he illustrates the concept of Mosaic Warfare, in which individual warfighting platforms, just like ceramic tiles in a mosaic, are placed together to make a larger picture.  ...  He also discusses why super AI won't represent an existential threat in the foreseeable future, but rather an opportunity for an effective division of labour between humans and machines (or human-machine  ...  in one single place, and then process everything there and distribute it to the operators or whoever, instead adopting a sort of distributed approach where processing happens in many nodes.  ... 
doi:10.32386/scivpro.000024 fatcat:vm45z44i2ncwdivbz7ffjzgwwe

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs [article]

Laxman Dhulipala, Charlie McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun
2020 arXiv   pre-print
NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost.  ...  We experimentally study Sage using a 48-core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane  ...  algorithms for processing massive graphs with hundreds of billions of edges [37, 72, 85, 87 ] on a single machine.  ... 
arXiv:1910.12310v2 fatcat:kba4cfosrzgcbf3e2zzatvim7i

An analysis of the graph processing landscape

Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
2021 Journal of Big Data  
For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one of many digital representations.  ...  Extracting information from graphs involves processing all their elements globally, which can be done with single-machine systems (with varying approaches to hardware usage), distributed systems (either  ...  Mosaic [140] is a system for single heterogeneous machines with fast storage media (e.g., NVMe and SSDs) and massively-parallel co-processors (e.g., Xeon Phi) developed to enable the processing of trillion-edge  ... 
doi:10.1186/s40537-021-00443-9 pmid:33850687 pmcid:PMC8033100 fatcat:vnwcn2pwszhv3detnwcv6jrthu

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Laxman Dhulipala, Guy E. Blelloch, Julian Shun
2018 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18  
This paper shows that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes.  ...  However, today even the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) can fit in the memory of a single commodity multicore  ...  In this paper, we show that a wide range of fundamental graph problems can be solved quickly on this graph, often in minutes, on a single commodity shared-memory machine with a terabyte of RAM. 1 For example  ... 
doi:10.1145/3210377.3210414 dblp:conf/spaa/DhulipalaBS18 fatcat:kjoegz2o65ab3oppglhc4bl6fu

An analysis of the graph processing landscape [article]

Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
2021 arXiv   pre-print
The use-case of performing global computations over a graph, it is first ingested into a graph processing system from one of many digital representations.  ...  Extracting information from graphs involves processing all their elements globally, and can be done with single-machine systems (with varying approaches to hardware usage), distributed systems (either  ...  . • Mosaic [181] is a system for single heterogeneous machines with fast storage media (e.g., NVMe and SSDs) and massively-parallel coprocessors (e.g., Xeon Phi) developed to enable the processing of trillion-edge  ... 
arXiv:1911.11624v3 fatcat:t44dfa5cvfbk7exz4s2synm5z4

Single Machine Graph Analytics on Massive Datasets Using Intel Optane DC Persistent Memory [article]

Gurbinder Gill, Ramesh Peri Intel Corporation)
2020 arXiv   pre-print
To demonstrate the importance of these principles, we evaluate four existing shared-memory graph frameworks on large real-world web-crawls, using a machine with 6TB of Optane PMM.  ...  In this paper, we present key runtime and algorithmic principles to consider when performing graph analytics on extreme-scale graphs on large-memory platforms of this sort.  ...  INTRODUCTION Graph analytics systems must process graphs with tens of billions of nodes and trillions of edges.  ... 
arXiv:1904.07162v3 fatcat:ocdffoxm2vcdnniggqfzlwuhgm

Parallel non-divergent flow accumulation for trillion cell digital elevation models on desktops or clusters

Richard Barnes
2017 Environmental Modelling & Software  
The new algorithm works on one or many cores, or multiple machines, and can take advantage of large memories or cope with small ones.  ...  The largest dataset tested had two trillion (2*10^12) cells. With 48 cores, processing required 24 minutes wall-time (14.5 compute-hours).  ...  This algorithm is part of the RichDEM (https://github.com/r-barnes/richdem) terrain analysis suite, a collection of state of the art algorithms for processing large DEMs quickly.  ... 
doi:10.1016/j.envsoft.2017.02.022 fatcat:kksh3dh4tradvmsir56bqk7rk4

The Google Cloud Platform Difference [chapter]

S. P. T. Krishnan, Jose L. Ugia Gonzalez
2015 Building Your Next Big Thing with Google Cloud Platform  
. • Pregel: In 2009, Google created a system for large-scale graph processing. The principles of the system are useful for processing large-scale graphs on a cluster of commodity hardware.  ...  Moreover, other nice features include the ability to mount a PD to multiple VMs as read-only or a single VM in read-write mode. • Compute instances are hosted as virtual machines in IaaS.  ... 
doi:10.1007/978-1-4842-1004-8_1 fatcat:4ziyarcm4ffarb6q7r3excoqni

Nucleic acid nanostructures: bottom-up control of geometry on the nanoscale

Nadrian C Seeman, Philip S Lukeman
2004 Reports on progress in physics (Print)  
The specificity of interaction that enables DNA to function so successfully as genetic material also enables its use as a smart molecule for construction on the nanoscale.  ...  A variety of two-dimensional periodic arrays with specific patterns have been made.  ...  In theory, Wang tiles assemble into a mosaic, such as the one shown at the bottom of figure 24, according to the local rule that every edge in the mosaic is flanked by the same colour.  ... 
doi:10.1088/0034-4885/68/1/r05 pmid:25152542 pmcid:PMC4141725 fatcat:k6l5hjq3lzc5vgokxydr5ymb54

Web-scale computer vision using MapReduce for multimedia data mining

Brandyn White, Tom Yeh, Jimmy Lin, Larry Davis
2010 Proceedings of the Tenth International Workshop on Multimedia Data Mining - MDMKDD '10  
Experimental results for the k-means clustering and single Gaussian background subtraction algorithms are performed on a 410 node Hadoop cluster.  ...  becomes unmanageable for a single machine.  ...  These tasks are desirable to perform on web scale datasets (> 1TB of image data) and are currently limited by the computational capabilities of single machines.  ... 
doi:10.1145/1814245.1814254 fatcat:qqpbrpo7n5cengpmeu6lowt53m

The UCSC Kestrel parallel processor

A. Di Bias, D.M. Dahle, M. Diekhans, L. Grate, J. Hirschberg, K. Karplus, H. Keller, M. Kendrick, F.J. Mesa-Martinez, D. Pease, E. Rice, A. Schultz (+2 others)
2005 IEEE Transactions on Parallel and Distributed Systems  
The system design focuses on efficient high-throughput DNA and protein sequence analysis, but its programmability enables high performance on computational chemistry, image processing, machine learning  ...  Kestrel is a single-instruction stream, multipledata stream (SIMD) parallel processor with a 512-element linear array of 8-bit processing elements.  ...  ACKNOWLEDGMENTS The authors thank Ken Kennedy for valuable discussions and encouraging comments on several versions of this paper. This work was supported in part by US National Science  ... 
doi:10.1109/tpds.2005.12 fatcat:fkjyztff5falpp5owlrc2wviai

Computer and Information Science, Vol. 1, No. 4, November 2008, all in one file

Editor CIS
2008 Computer and Information Science  
A graph ( , ) G V E = can be partitioned into two disjoint subsets A and B, subject to , A B A B V φ ∩ = ∪ = , by simply removing edges connecting the two parts.  ...  In graph theoretic language, it is called the cut (Shi,2000,pp.888-905) : , ( , ) ( , ) u A v B cut A B w u v ∈ ∈ = (1) The optimal bipartitioning of a graph is the one that minimizes this cut value.  ...  ., for example, two characteristics of Narrow pulse signal pulse :the trans form of signal excitation is single short pulse shape leading edge, and spectrum include regions from direct current to microwave  ... 
doi:10.5539/cis.v1n4p0 fatcat:j5oetg3ex5fxboaobvd3erc6tu

Big data and extreme-scale computing

M Asch, T Moore, R Badia, M Beck, P Beckman, T Bidot, F Bodin, F Cappello, A Choudhary, B de Supinski, E Deelman, J Dongarra (+27 others)
2018 The international journal of high performance computing applications  
in a scalable manner to meet the highly diverse requirements for processing, communication, and buffering/storage of massive data workflows of many different scientific domains.  ...  logistics of wide-area, multistage workflows that will move back and forth across the computing continuum, between the multitude of distributed sensors, instruments and other devices at the networks edge  ...  Acknowledgments The authors would like to acknowledge David Rogers for his work on the illustrations, Sam Crawford for editing support and the creation of the Appendix, and Piotr Luszczek for technical  ... 
doi:10.1177/1094342018778123 fatcat:vwrrxmad4rhtppq6ioaz4h5q7a

Information Theoretic Metagenome Assembly Allows the Discovery of Disease Biomarkers in Human Microbiome

O. Ufuk Nalbantoglu
2021 Entropy  
Our algorithm infers fragments populating the most informative genetic variants in a single contig, named supervariant fragments.  ...  Our results support that a focus on metagenomics methods considering microbiome population genetics might be useful in discovering disease biomarkers with a great potential of translating to molecular  ...  In fact, the de Bruijn graph with score-weighted edges serves the same purpose with a feasible data-structure in practice.  ... 
doi:10.3390/e23020187 pmid:33540903 pmcid:PMC7913240 fatcat:uhmiwk3mwbhnnfo3vsjjjfnzdu

A review on computer vision based defect detection and condition assessment of concrete and asphalt civil infrastructure

Christian Koch, Kristina Georgieva, Varun Kasireddy, Burcu Akinci, Paul Fieguth
2015 Advanced Engineering Informatics  
Since the rate of creation and deployment of computer vision methods for civil engineering applications has been exponentially increasing, the main part of the paper presents a comprehensive synthesis  ...  First, in the pre-processing step image processing techniques are applied to extract potential crack features, such as edges (threshold-based approaches).  ...  In general, image stitching provides a feasible way of increasing the field of view that cannot be achieved by a single image.  ... 
doi:10.1016/j.aei.2015.01.008 fatcat:6rvl3hojqbddznjphjxq4tso5y
« Previous Showing results 1 — 15 out of 172 results