Filters








350 Hits in 5.9 sec

A Model and Survey of Distributed Data-Intensive Systems [article]

Alessandro Margara, Gianpaolo Cugola, Nicolò Felicioni, Stefano Cilloni
2022 arXiv   pre-print
Data is a precious resource in today's society, and is generated at an unprecedented and constantly growing pace.  ...  Each data-intensive system brings its specific choices in terms of data model, usage assumptions, synchronization, processing strategy, deployment, guarantees in terms of consistency, fault tolerance,  ...  A1 [25] is an in-memory database that resembles TAO and Trinity in terms of data model (typed graphs) and jobs (changes to graph entities and graph pattern matching queries).  ... 
arXiv:2203.10836v1 fatcat:xbg34nuzhndwjpv2asbbhtgvlu

Algorithm Engineering (Dagstuhl Seminar 13391)

Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner, Marc Herbstritt
2014 Dagstuhl Reports  
The algorithm engineering approach consists of a cycle of algorithm design, analysis, implementation, and experimental evaluation, with the aim of bridging the gap between theory and practice in the area  ...  There is an ACM Journal on Experimental Algorithmics and several annual conferences (WAE/ESA applied track since 1997, Alenex since 1998, and WEA/SEA since 2001) and the series of DIMACS implementation  ...  -Algorithm Engineering the work of the aggregate operator's processing steps. We provide an extensive study of the properties of the proposed aggregate operators and the new data structures.  ... 
doi:10.4230/dagrep.3.9.169 dblp:journals/dagstuhl-reports/GoldbergIJW13 fatcat:n75s6d7obngxbitr4rcxxadmxq

Biorheological Model on Flow of Herschel-Bulkley Fluid through a Tapered Arterial Stenosis with Dilatation

S. Priyadharshini, R. Ponalagusamy
2015 Applied Bionics and Biomechanics  
An analysis of blood flow through a tapered artery with stenosis and dilatation has been carried out where the blood is treated as incompressible Herschel-Bulkley fluid.  ...  The obtained velocity profiles have been compared with the experimental data and it is observed that blood behaves like a Herschel-Bulkley fluid rather than power law, Bingham, and Newtonian fluids.  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2015/406195 pmid:27041979 pmcid:PMC4745449 fatcat:4kqkle3kyfgnpexy3fa3htco6a

Volume-Adaptive Big Data Model for Relational Databases

2021 International Journal of Advanced Trends in Computer Science and Engineering  
In existing Database Management Systems (DBMS), data partitioning is automated which in the opinion of this paper does not give the best results since partitioning is an NP-hard problem in terms of algorithmic  ...  In this paper, the partitioning process is reviewed and a programmer-based partitioning strategy implemented for an application with a relational DBMS backend.  ...  In the experimental scenarios in this study, the interesting columns are suggested in the database design and the design does not in any way depend on the database engine for implementation.  ... 
doi:10.30534/ijatcse/2021/1131032021 fatcat:6tqlanaql5adhjrjzhv3pzrmjy

Graph Spanners: A Tutorial Review [article]

Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Richard Spence
2020 arXiv   pre-print
This tutorial review provides a guiding reference to researchers who want to have an overview of the large body of literature about graph spanners.  ...  As an additional contribution, we offer a list of open problems on graph spanners.  ...  [104] consider the semi-streaming model where at most a logarithmic number of passes over the graph stream are allowed.  ... 
arXiv:1909.03152v2 fatcat:vqme4ewuvbbd5ac5erinyykwsy

t-Spanners for metric space searching

Gonzalo Navarro, Rodrigo Paredes, Edgar Chávez
2007 Data & Knowledge Engineering  
Our key idea is to regard the t-spanner as an approximation to the complete graph of distances among the objects, and to use it as a compact device to simulate the large matrix of distances required by  ...  A t-spanner is a subgraph G ′ (V, E) of a graph G(V, A), such that E ⊆ A and G ′ approximates the shortest path costs over G within a precision factor t.  ...  In particular, for t-Spanner 1, we can obtain an edge model to implement the H 1 heuristic.  ... 
doi:10.1016/j.datak.2007.05.002 fatcat:t73cdcgftjcnvnuawrnxcb35ne

Simple parallel and distributed algorithms for spectral graph sparsification [article]

Ioannis Koutis
2014 arXiv   pre-print
significantly more efficient in terms of the total work.  ...  We describe a simple algorithm for spectral graph sparsification, based on iterative computations of weighted spanners and uniform sampling.  ...  Every graph contains a spanner with O(n log n) edges that can be computed efficiently in the CRCW PRAM model and the synchronous distributed model.  ... 
arXiv:1402.3851v2 fatcat:ha6oaa5kmjhuxdlcebqg4xy7ty

Distributed algorithms for lifetime maximization in sensor networks via Min–Max spanning subgraphs

Harri Haanpää, André Schumacher, Pekka Orponen
2009 Wireless networks  
We also present a simple distributed method for pruning a graph to its Relative Neighborhood Graph, which reduces the worst-case message complexity of MLS under natural assumptions on the path-loss.  ...  In our network simulations both MLS and BSPAN significantly outperform the recently proposed Distributed Min-Max Tree algorithm in terms of number of messages required. * Preliminary work has been  ...  Schumacher has been supported by the Helsinki Graduate School of Computer Science and Engineering. The MLS and BSPAN simulations were conducted in collaboration with Thorn Thaler.  ... 
doi:10.1007/s11276-009-0174-1 fatcat:oylp7unimzaq3a3f3c4ojup3fe

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners [article]

Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2019 arXiv   pre-print
We study a spectral generalization of classical combinatorial graph spanners to the spectral setting.  ...  We show that any set V has an Õ(d)-spectral spanner of size Õ(d) and this bound is almost optimal in the worst case. We use spectral spanners to study composable core-sets for spectral problems.  ...  The following algorithm gives an α-combinatorial spanner with n 1+O(1)/α edges: Start with an empty graph H. While there is an edge f = {u, v} in G where dist H (u, v) > α, add it to H.  ... 
arXiv:1807.11648v2 fatcat:pwngsm6lcfgjjb4flszoxygo5i

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners [chapter]

Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2020 Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms  
We study a generalization of classical combinatorial graph spanners to the spectral setting.  ...  Our algorithm is a spectral analogue of the classical greedy algorithm for finding (combinatorial) spanners in graphs.  ...  The following algorithm gives an α-combinatorial spanner with n 1+O(1)/α edges: Start with an empty graph H. While there is an edge f = {u, v} in G where dist H (u, v) > α, add it to H.  ... 
doi:10.1137/1.9781611975994.103 dblp:conf/soda/IndykMGR20 fatcat:l2fb6gilrzehjksjp5uqvhpaki

Communication-Optimal Distributed Dynamic Graph Clustering [article]

Chun Jiang Zhu, Tan Zhu, Kam-Yiu Lam, Song Han, Jinbo Bi
2018 arXiv   pre-print
their lower bounds, Ω(ns) and Ω(n+s), respectively, in the message passing and the blackboard models.  ...  We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models.  ...  In the message passing model, at each time point t each site S i first constructs a graph spanner Q τ i of the local graph G τ i (V, E τ i ) using a D 2 -CAMP for constructing graph spanners (Elkin 2011  ... 
arXiv:1811.06072v1 fatcat:5w6oqvitjzas5jdlj3hklols5a

Communication-Optimal Distributed Dynamic Graph Clustering

Chun Jiang Zhu, Tan Zhu, Kam-Yiu Lam, Song Han, Jinbo Bi
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
their lower bounds, Ω(ns) and Ω(n + s), respectively, in the message passing and the blackboard models.  ...  We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models.  ...  In the message passing model, at each time point t each site S i first constructs a graph spanner Q τ i of the local graph G τ i (V, E τ i ) using a D 2 -CAMP for constructing graph spanners (Elkin 2011  ... 
doi:10.1609/aaai.v33i01.33015957 fatcat:pvzm4e4mrjefjhcwlvnjg55s74

Peristaltic transport of two-layered blood flow using Herschel–Bulkley Model

C. Rajashekhar, G. Manjunatha, K. V. Prasad, B. B. Divya, Hanumesh Vaidya, Zhongmin Jin
2018 Cogent Engineering  
The present article investigates the peristaltic transport of a Herschel-Bulkley fluid in an axisymmetric tube.  ...  The present model reveals that the increase in flux against pressure C. Rajashekhar rise for a Newtonian fluid is less when compared with Herschel-Bulkley fluid.  ...  Acknowledgements The authors appreciate the constructive comments of the reviewers, which led to definite improvement in the article. Author details C.  ... 
doi:10.1080/23311916.2018.1495592 fatcat:eahuvifmwbfbffx6urhz6st5pe

Localized topology control for unicast and broadcast in wireless ad hoc networks

Wen-Zhan Song, Xiang-Yang Li, O. Frieder, Weu Zhao Wang
2006 IEEE Transactions on Parallel and Distributed Systems  
Our theoretical results are corroborated in the simulations.  ...  Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of [5n, 13n],  ...  For any internal node p of T , f T (p) = max pq∈T pq β under our energy model if an one-to-all communication model is used; and f T (p) = pq∈T pq β under our energy model if an one-to-one communication  ... 
doi:10.1109/tpds.2006.53 fatcat:2klyyw3dmjhrhfp754amo527ou

A Neighborhood-preserving Graph Summarization [article]

Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, Hamida Seba
2021 arXiv   pre-print
We introduce in this paper a new summarization method for large graphs. Our summarization approach retains only a user-specified proportion of the neighbors of each node in the graph.  ...  The experiments conducted on various real and synthetic graphs show that our compression reduces considerably the size of the graphs.  ...  Experimental Analysis In this section, we present an experimental analysis of our compression. First, we evaluate the approximation algorithms provided to compute the compression.  ... 
arXiv:2101.11559v1 fatcat:t26vio4dmreohaa5ohqwxsjhju
« Previous Showing results 1 — 15 out of 350 results