Filters








51,766 Hits in 6.6 sec

Extracting Novel Facts from Tables for Knowledge Graph Completion (Extended version) [article]

Benno Kruit and Peter Boncz and Jacopo Urbani
2019 arXiv   pre-print
We propose a new end-to-end method for extending a Knowledge Graph (KG) from tables.  ...  Existing techniques tend to interpret tables by focusing on information that is already in the KG, and therefore tend to extract many redundant facts. Our method aims to find more novel facts.  ...  This makes them suitable sources for extending the coverage of Knowledge Graphs (KGs), which is a task known as KG completion. Problem.  ... 
arXiv:1907.00083v2 fatcat:svq5v2jp4jbljegm3qdouijlce

Extracting Novel Facts from Tables for Knowledge Graph Completion [chapter]

Benno Kruit, Peter Boncz, Jacopo Urbani
2019 Lecture Notes in Computer Science  
We propose a new end-to-end method for extending a Knowledge Graph (KG) from tables.  ...  Existing techniques tend to interpret tables by focusing on information that is already in the KG, and therefore tend to extract many redundant facts. Our method aims to find more novel facts.  ...  This makes them suitable sources for extending the coverage of Knowledge Graphs (KGs), which is a task known as KG completion. Problem.  ... 
doi:10.1007/978-3-030-30793-6_21 fatcat:ocfjoeu6nzfrnplfy7ibddhuv4

ProGS: Property Graph Shapes Language (Extended Version) [article]

Philipp Seifer, Ralf Lämmel, Steffen Staab
2021 arXiv   pre-print
Property graphs constitute data models for representing knowledge graphs.  ...  Borrowing ideas from the syntax and semantics definitions of SHACL, we design a shape language for property graphs, ProGS, which allows for formulating shape constraints on property graphs including their  ...  The key differences to RDF arise from the fact that edges in property graphs have identities.  ... 
arXiv:2107.05566v1 fatcat:iubms6jlcnakxd4ittoei2lpzm

A Survey on Visual Query Systems in the Web Era (extended version) [article]

Jorge Lloret-Gazo
2017 arXiv   pre-print
In this paper, we review VQSs from 1997 until now and try to determine whether they have been the solution for non expert users.  ...  The short answer is no because very few systems have in fact been used in real environments or as commercial tools.  ...  In [7] , queries are expressed on data warehouse schemas composed of tables. A typical schema consists of a fact table and several dimension tables related with the fact table.  ... 
arXiv:1708.00192v1 fatcat:bdg2tuubzbd6rp5hpwoxge2eey

OBDA Constraints for Effective Query Answering (Extended Version) [article]

Dag Hovland and Davide Lanti and Martin Rezk and Guohui Xiao
2016 arXiv   pre-print
To address this issue, we introduce two novel notions of OBDA constraints and show how to exploit them for efficient query answering.  ...  v . }. } Example 1 . 1 The ontology from Statoil captures the domain knowledge related to oil extraction activities.  ...  From Example 7, there is an organization constraint for the view wellbore forcing only one completion date for each "actual" wellbore.  ... 
arXiv:1605.04263v2 fatcat:dfwlu3kw6jdfhex5arippjq354

Context-aware, Adaptive and Scalable Android Malware Detection through Online Learning (extended version) [article]

Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu
2017 arXiv   pre-print
In order to perform accurate detection, a novel graph kernel that facilitates capturing apps' security-sensitive behaviors along with their context information from dependency graphs is proposed.  ...  Contrary to this fact, most of the prior works on Machine Learning based Android malware detection have assumed that the distribution of the observed malware characteristics (i.e., features) does not change  ...  CWLK, a novel graph kernel that facilitates capturing apps' security-sensitive behaviors along with their context information from dependency graphs is also proposed.  ... 
arXiv:1706.00947v2 fatcat:sduouh6iovhkxficotkgpwaycq

MaMaDroid: Detecting Android Malware by Building Markov Chains of Behavioral Models (Extended Version) [article]

Lucky Onwuzurike, Enrico Mariconti, Panagiotis Andriotis, Emiliano De Cristofaro, Gordon Ross, Gianluca Stringhini
2019 arXiv   pre-print
graph of an app as Markov chains.  ...  However, the constant evolution of the Android ecosystem, and of malware itself, makes it hard to design robust tools that can operate for long periods of time without the need for modifications or costly  ...  We wish to thank Yousra Aafer for sharing the DroidAPIMiner source code and Yanick Fratantonio for his comments on an early draft of the paper.  ... 
arXiv:1711.07477v2 fatcat:dpr26ovijreqrmkkdfeew6tvt4

Arabesque: A System for Distributed Graph Mining - Extended version [article]

Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos, Mohammed J. Zaki, Ashraf Aboulnaga
2015 arXiv   pre-print
However, these platforms do not represent a good match for distributed graph mining problems, as for example finding frequent subgraphs in a graph.  ...  simply compute outputs and decide whether the subgraph should be further extended.  ...  Acknowledgments We would like to thank Landon Cox for shepherding the paper, the SOSP reviewers for their valuable feedback, Ehab Abdelhamid for the GRAMI implementation, Nilothpal Talukder for some of  ... 
arXiv:1510.04233v1 fatcat:774mihqn4najngl7p3xsqqr7w4

Formulog: Datalog for SMT-Based Static Analysis (Extended Version) [article]

Aaron Bembenek
2020 arXiv   pre-print
Formulog extends the logic programming language Datalog with a first-order functional language and mechanisms for representing and reasoning about SMT formulas; a novel type system supports the construction  ...  Other heuristics might have helped our version complete on the two benchmarks it timed out on.  ...  Given an hour timeout, our implementation completed on eight of the ten benchmarks, with times ranging from five to 18 minutes (Table 1 ). In the median, we were 6.7× slower than Scuba.  ... 
arXiv:2009.08361v2 fatcat:5jcjczcvdnfxdf4wkil7jskzxm

A Methodology to Select Topology Generators for WANET Simulations (Extended Version) [article]

Michael O'Sullivan, Leonardo Aniello, Vladimiro Sassone
2019 arXiv   pre-print
By taking inspiration from the Quadrat Method [5] used to test the Complete Spatial Randomness hypothesis, we partition the topology area in d 2 smaller squares, each with sides D/d units long.  ...  From this point of view, our contribution is novel and complements existing research on comparing available TGs. System Model We consider a set T G with N T G topology generators (TG), i.e.  ... 
arXiv:1908.09577v1 fatcat:4psy3yxvcrcdnkaylk4da2dbxu

Scalable Byzantine Reliable Broadcast (Extended Version) [article]

Rachid Guerraoui and Petr Kuznetsov and Matteo Monti and Matej Pavlovic and Dragos-Adrian Seredinschi and Yann Vonlanthen
2020 arXiv   pre-print
During our analysis, we introduce a novel general technique we call adversary decorators.  ...  To the best of our knowledge, this is the first formal analysis of a probabilistic broadcast protocol in the Byzantine fault model.  ...  This follows from the above, and the fact that the correct processes in π's echo sample for m are identical in σ and σ .  ... 
arXiv:1908.01738v2 fatcat:tew2gp5odbgdrolwzzijs3avie

Efficient, Near Complete and Often Sound Hybrid Dynamic Data Race Prediction (extended version) [article]

Martin Sulzmann, Kai Stadtmüller
2020 arXiv   pre-print
By near complete we mean that the method is complete in theory but for efficiency reasons the implementation applies some optimizations that may result in incompleteness.  ...  The challenge is to remain efficient while being as sound and as complete as possible. Efficient means a linear run-time as otherwise the method unlikely scales for real-world programs.  ...  Follows from the fact that PWO E+E computes the event's lockset and vector clock.  ... 
arXiv:2004.06969v5 fatcat:ncrwfkf5arcgdc2sd4nnj5lng4

Towards the Systematic Testing of Virtual Reality Programs (extended version) [article]

Stevao A. Andrade, Fatima L. S. Nunes, Marcio E. Delamaro
2020 arXiv   pre-print
However, current software testing activities tend not to be completely effective when applied in specific software domains in Virtual Reality (VR) that has several new types of features such as images,  ...  Regarding the application of software testing techniques on VR projects, it was observed that only a small number of projects are concerned about developing test cases for VR projects, perhaps because  ...  All the information about the projects, the data used for plotting the tables and graphs, as well for the discussion, are available in the experiment repository 3 .  ... 
arXiv:2009.08930v1 fatcat:hxzt37z7qzhcjflc3szp6kl5hu

Synthesising Interprocedural Bit-Precise Termination Proofs (extended version) [article]

Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel, Björn Wachter
2015 arXiv   pre-print
We present a modular termination analysis for C programs using template-based interprocedural summarisation.  ...  Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination.  ...  2LS computes usable preconditions for termination This experiment was performed on benchmarks extracted from Debian packages and the linear algebra library CLapack.  ... 
arXiv:1505.04581v1 fatcat:4e6whaznabc5dimy5bhf4e2dre

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version) [article]

Axel Feldmann, Nikola Samardzic, Aleksandar Krastev, Srini Devadas, Ron Dreslinski, Karim Eldefrawy, Nicholas Genise, Chris Peikert, Daniel Sanchez
2021 arXiv   pre-print
The F1 hardware provides an explicitly managed memory hierarchy and mechanisms to decouple data movement from execution.  ...  F1 is the first system to accelerate complete FHE programs and outperforms state-of-the-art software implementations by gmean 5400x and by up to 17000x.  ...  , and Peter Li for help with the HDL toolchain setup; Shai Halevi, Wei Dai, Olli Saarikivi, and Madan Musuvathi for email correspondence.  ... 
arXiv:2109.05371v2 fatcat:i2577nw2mrafvkp75zokllu72q
« Previous Showing results 1 — 15 out of 51,766 results