Filters








34,664 Hits in 8.5 sec

Revisiting the Arguments for Edge Computing Research [article]

Blesson Varghese and Eyal de Lara and Aaron Ding and Cheol-Ho Hong and Flavio Bonomi and Schahram Dustdar and Paul Harvey and Peter Hewkin and Weisong Shi and Mark Thiele and Peter Willis
2021 arXiv   pre-print
This article argues that low latency, high bandwidth, device proliferation, sustainable digital infrastructure, and data privacy and sovereignty continue to motivate the need for edge computing research  ...  Acknowledgment The feedback provided by numerous academics and industry experts during consultation is acknowledged. The first author is supported by a Royal Society Short Industry Fellowship.  ...  Revisiting the Arguments for Edge Computing Research Bandwidth The network bandwidth bottleneck of the widearea network (WAN) to the cloud has been another argument in favor of edge computing [5] .  ... 
arXiv:2106.12224v1 fatcat:trv7tuytufbd3ord7hbj66pts4

Revisiting the Arguments for Edge Computing Research

Blesson Varghese, Eyal de Lara, Aaron Yi Ding, Cheol-Ho Hong, Flavio Bonomi, Schahram Dustdar, Paul Harvey, Peter Hewkin, Weisong Shi, Mark Thiele, Peter Willis
2021 IEEE Internet Computing  
T his article argues that low latency, high bandwidth, device proliferation, sustainable digital infrastructure, and data privacy and sovereignty continue to motivate the need for edge computing research  ...  Acknowledgment The feedback provided by numerous academics and industry experts during consultation is acknowledged. The first author is supported by a Royal Society Short Industry Fellowship.  ...  Revisiting the Arguments for Edge Computing Research Bandwidth The network bandwidth bottleneck of the widearea network (WAN) to the cloud has been another argument in favor of edge computing [5] .  ... 
doi:10.1109/mic.2021.3093924 fatcat:fullt6witjafhi7teum2tuivy4

Great Service! Fine-grained Parsing of Implicit Arguments [article]

Ruixiang Cui, Daniel Hershcovich
2021 arXiv   pre-print
More importantly, the scarcity of datasets annotating diverse implicit roles limits empirical studies into their linguistic nuances. For example, in the web review "Great service!"  ...  , the provider and consumer are implicit arguments of different types.  ...  Acknowledgments The authors thank Miryam de Lhoneux and the anonymous reviewers for their helpful feedback.  ... 
arXiv:2106.02561v2 fatcat:45lxqfiaszetpptjs75ork6cqu

More bounds on the diameters of convex polytopes [article]

David Bremner, Antoine Deza, William Hua, Lars Schewe
2009 arXiv   pre-print
Finding a good bound on the maximal edge diameter Δ(d,n) of a polytope in terms of its dimension d and the number of its facets n is one of the basic open questions in polytope theory BG.  ...  The conjecture is known to hold in small dimensions, i.e., for d ≤ 3 VK, along with other specific pairs of d and n (Table ).  ...  of the Shared Hierarchical Academic Research Computing Network (http://www.sharcnet.ca/).  ... 
arXiv:0911.4982v1 fatcat:qutd3e6m6rfw7fbxokbq4mitbu

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets

David Bremner, Lars Schewe
2011 Experimental Mathematics  
This implies that for all pairs (d,n) with n-d \leq 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n-d \leq 6.  ...  We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6.  ...  3) ∆(d, n) ≤ ∆(n − d, 2(n − d)) for all (d, n) This research was carried out while the authors were guests of the Hausdorff Research Institute for Mathematics, Bonn.  ... 
doi:10.1080/10586458.2011.564965 fatcat:4wk2f4b6unck7i5ynsp3pfvuji

Cost semantics for space usage in a parallel language

Daniel Spoonhower
2007 Proceedings of the 2007 workshop on Declarative aspects of multicore architectures - DAMP '07  
We describe a framework for better understanding scheduling policies for fine-grained parallel computations and their effect on space usage.  ...  Refinements of that semantics can be used to model the behavior of particular schedulers. We use the framework to show that different schedules can lead to asymptotic differences in space usage.  ...  The second edge denotes a possible last use of the argument. For strict functions, this second edge is redundant: there will be another edge leading to the argument when it is used.  ... 
doi:10.1145/1248648.1248655 dblp:conf/popl/Spoonhower07 fatcat:a5ibp3vxirewtcadqd5mkgodjq

Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial

Farley Soares OLIVEIRA, Hidefumi HIRAISHI, Hiroshi IMAI
2019 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Revisiting the Sekine-Imai-Tani top-down algorithm to compute the BDD of all spanning trees and the Tutte polynomial of a given graph, we explicitly analyze the Fixed-Parameter Tractable (FPT) time complexity  ...  with respect to its (proper) pathwidth, pw (ppw), and obtain a bound of O * (Bell min{pw +1,ppw} ), where Bell n denotes the n-th Bell number, defined as the number of partitions of a set of n elements  ...  We thank the two anonymous reviewers for their constructive comments and suggestions.  ... 
doi:10.1587/transfun.e102.a.1022 fatcat:qc6hgdmksfgqtewa23guijffti

More bounds on the diameters of convex polytopes

David Bremner, Antoine Deza, William Hua, Lars Schewe
2013 Optimization Methods and Software  
Dedicated to Professor Kees Roos on the occasion of his 70th birthday. Let (d, n) be the maximum possible diameter of the vertex-edge graph over all d-dimensional polytopes defined by n inequalities.  ...  The Hirsch bound holds for particular n and d if (d, n) ≤ n − d.  ...  Academic Research Computing Network (http://www.sharcnet.ca/).  ... 
doi:10.1080/10556788.2012.668906 fatcat:af63t3qdc5cx3loyknrkhbfyhm

Stochastic Search in a Forest Revisited

Jay Sethuraman, John N. Tsitsiklis
2007 Mathematics of Operations Research  
Section 2 presents the model and the problem formulation; Section 3 provides the proof of the main result; Section 4 discusses indexability and computational issues; and Section 5 deals with various extensions  ...  In this paper, we show that a short and simple proof is possible for a suitable generalization of the DRV model, using the approach of Tsitsiklis [2] for the classical multi-armed bandit problem.  ...  Acknowledgments: We thank Uri Rothblum for useful discussions about the problem.  ... 
doi:10.1287/moor.1070.0256 fatcat:ilgpwzjrmfa3xbh6wwzuwek6la

Supporting the analytical reasoning process in information visualization

Yedendra Babu Shrinivasan, Jarke J. van Wijk
2008 Proceeding of the twenty-sixth annual CHI conference on Human factors in computing systems - CHI '08  
The analyst can revisit a visualization state from both the navigation and knowledge views to review the analysis and reuse it to look for alternate views.  ...  The navigation view provides an overview of the exploration process by capturing the visualization states automatically.  ...  The project is supported by the VIEW programme of the Netherlands Organisation for Scientific Research (NWO) under research grant no. 643.100.502.  ... 
doi:10.1145/1357054.1357247 dblp:conf/chi/ShrinivasanW08 fatcat:dquuivxszjeffb5k6anoyo6rry

Page 2187 of Psychological Abstracts Vol. 79, Issue 5 [page]

1992 Psychological Abstracts  
—Presents an automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges.  ...  In principle, we could build a computer that has the same architecture as the mind. The first part of this book, chapters 1 through 7 discusses research aimed at this goal.  ... 

NP-hardness of the cluster minimization problem revisited

Artur B Adib
2005 Journal of Physics A: Mathematical and General  
The computational complexity of the "cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)].  ...  A geometric analog of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs.  ...  Acknowledgments I am indebted to Heather Partner for introducing me to the subject of computational complexity and reading the original manuscript.  ... 
doi:10.1088/0305-4470/38/40/001 fatcat:rhngbbjrw5aihokbycjjmubwaq

Cluster Editing with Locally Bounded Modifications Revisited [chapter]

Peter Damaschke
2013 Lecture Notes in Computer Science  
For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012) , at cost of a marginally  ...  We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.  ...  the Swedish Foundation for Strategic Research (SSF), "Data-driven secure business intelligence".  ... 
doi:10.1007/978-3-642-45278-9_38 fatcat:jecsuoqwvngg3nbprs4y647whq

YEASTRACT: providing a programmatic access to curated transcriptional regulatory associations in Saccharomyces cerevisiae through a web services interface

D. Abdulrehman, P. T. Monteiro, M. C. Teixeira, N. P. Mira, A. B. Lourenco, S. C. dos Santos, T. R. Cabrito, A. P. Francisco, S. C. Madeira, R. S. Aires, A. L. Oliveira, I. Sa-Correia (+1 others)
2010 Nucleic Acids Research  
The YEAst Search for Transcriptional Regulators And Consensus Tracking (YEASTRACT) information system (http://www.yeastract.com) was developed to support the analysis of transcription regulatory associations  ...  The authors are grateful to colleagues and friends from the yeast community for their encouragement and suggestions.  ...  ACKNOWLEDGEMENTS The information about yeast genes other than documented regulations, potential regulations and the transcription factor binding sites contained in YEASTRACT was gathered from SGD and the  ... 
doi:10.1093/nar/gkq964 pmid:20972212 pmcid:PMC3013800 fatcat:jb65f6v7wrc2vd3w22txirruwy

Computer Highlights Society Magazines

2022 Computer  
The IEEE Computer Society's lineup of 12 peer-reviewed technical magazines covers cutting-edge topics ranging from software design and computer graphics to Internet computing and security, from scientific  ...  Revisiting the Arguments for Edge Computing Research This article from the September/October 2021 issue of IEEE Internet Computing argues that low latency, high bandwidth, device proliferation, sustainable  ...  digital infrastructure, and data privacy and sovereignty continue to motivate the need for edge computing research even though its initial concepts were formulated more than a decade ago.  ... 
doi:10.1109/mc.2021.3126525 fatcat:si64i7c2fjgrvhm3xssahc7ryq
« Previous Showing results 1 — 15 out of 34,664 results