Filters








22 Hits in 7.2 sec

Knowledge Graphs [article]

Aidan Hogan, Eva Blomqvist, Michael Cochez, Claudia d'Amato, Gerard de Melo, Claudio Gutierrez, José Emilio Labra Gayo, Sabrina Kirrane, Sebastian Neumaier, Axel Polleres, Roberto Navigli, Axel-Cyrille Ngonga Ngomo (+6 others)
2021 arXiv   pre-print
After some opening remarks, we motivate and contrast various graph-based data models and query languages that are used for knowledge graphs.  ...  We provide an overview of prominent open knowledge graphs and enterprise knowledge graphs, their applications, and how they use the aforementioned techniques.  ...  Acknowledgements: We thank the attendees of the Dagstuhl Seminar on "Knowledge Graphs" for discussions that inspired and influenced this paper, and all those that make such seminars possible.  ... 
arXiv:2003.02320v5 fatcat:ab4hmm2f2bbpvobwkjw4xbrz4u

Survivable Monitoring in Dynamic Networks

G. Ateniese, C. Riley, C. Scheideler
2006 IEEE Transactions on Mobile Computing  
The features of our system include authenticating visitors, monitoring their traffic through the domain, and storing this information in a persistent, efficient, and searchable manner.  ...  Replace each node in the SPON data structure (Fig. 3 ) with a cluster of nodes connected in a complete graph; replace each edge with a full bipartite graph between the two node clusters.  ...  The information is searchable and available to system administrators.  ... 
doi:10.1109/tmc.2006.138 fatcat:irtvpuqeufaghn2ddv3oztk3wa

Stress Fractures of the Tibia after Jogging

Steller EP Unlu C
2014 Journal of Trauma and Treatment  
Based largely on markup meta-languages, such as the Standard General Markup Language (SGML) and the eXtensible Markup Language (XML), these efforts cover a wide range of industries, applications and functions  ...  XGMML (eXtensible Graph Markup and Modeling Language) is an XML application based on GML which is used for graph description.  ...  A Petri Net is a directed, bipartite graph in which nodes are either "places" (represented by circles) or "transitions" (represented by rectangles), invented by Carl Adam Petri.  ... 
doi:10.4172/2167-1222.s2-006 fatcat:73kmefkhtreindbb5grlmjlj4i

An FPGA-based system for tracking digital information transmitted via Peer-to-Peer protocols

Karl R. Schrader, Barry E. Mullins, Gilbert L. Peterson, Robert F. Mills
2010 International Journal of Security and Networks (IJSN)  
If the identifier is on the list, the control packet is saved for later forensic analysis.  ...  If the identifier is found on the list, the control packet is added to a log file for later forensic analysis.  ...  Barry Mullins, for providing the right balance of guidance to keep me on track and freedom to explore my ideas and bring them to fruition. In addition, I would also like to thank Dr.  ... 
doi:10.1504/ijsn.2010.037662 fatcat:z5urs75edbbiviqdz2nyulm5sa

CSITSS Proceedings 2020

2019 2019 4th International Conference on Computational Systems and Information Technology for Sustainable Solution (CSITSS)  
Fig 3 . 3 Framework of the searchable encryption method. [1] Fig 4. Reconstruction and Recovery phase of the algorithm.  ...  KMeans Runtimes on CoverType Dataset (Time in Seconds) Index 07070 FigFig 2 . 070702 Terms-Data security, Electronic Health Records (EHR), Cloud servers, Encryption.  ...  Product-based Neural Networks In this paper we have focused on the general architecture of ontology-based Information Retrieval used for Kannada.  ... 
doi:10.1109/csitss47250.2019.9031039 fatcat:yehi3bfgbva7xm74vp3a3i54pu

Low Complexity Recruitment for Collaborative Mobile Crowdsourcing Using Graph Neural Networks [article]

Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Yehia Massoud
2021 arXiv   pre-print
To cope with NP-hardness, we design a novel low-complexity CMCS recruitment approach relying on Graph Neural Networks (GNNs), specifically graph embedding and clustering techniques, to shrink the workers  ...  Simulation results applied on a real-world dataset illustrate the performance of both proposed CMCS recruitment approaches.  ...  [26] proposed a secure and efficient spatial task matching framework that utilizes multi-user searchable encryption and secure index technique. Abdullah et al.  ... 
arXiv:2106.00717v1 fatcat:mytjw4a2gjdu5c2eennod6wu74

Social networking data analysis tools & challenges

Androniki Sapountzi, Kostas E. Psannis
2018 Future generations computer systems  
The survey demonstrates challenges and future directions with a focus on text mining and the promising avenue of computational intelligence.  ...  Additionally, WordNet has been used in a searchable encryption scheme to support personalized search through user interest models [62] .  ...  Two of the future plans include the following (i) cloud computing techniques in order to compute network clusters efficiently and (ii) to improve centrality metrics for directed or bipartite graphs and  ... 
doi:10.1016/j.future.2016.10.019 fatcat:cqlp423pv5heplujb63qo7c6yq

Data Management in Industry 4.0: State of the Art and Open Challenges [article]

Theofanis P. Raptis, Andrea Passarella, Marco Conti
2019 arXiv   pre-print
This article surveys the recent literature on data management as it applies to networked industrial environments and identifies several open research challenges for the future.  ...  a first step, we extract important data properties (volume, variety, traffic, criticality) and identify the corresponding data enabling technologies of diverse fundamental industrial use cases, based on  ...  In [361] , the authors design a secure channel-free certificateless searchable public key encryption with multiple keywords scheme for IIoT.  ... 
arXiv:1902.06141v2 fatcat:4uvwquinx5h65dy4udx24bhrmm

Breaking and Building Encrypted Databases

Paul Allen Grubbs
2020
The leakage and its impact on security differs depending on the way the system is compromised. In this thesis, I investigate the performance-security tradeoffs made by encrypted databases.  ...  I conclude that many of the security claims made of encrypted databases are incorrect. Then, I examine the security impact of a concrete leakage shared by most encrypted databases.  ...  Then, it creates a bipartite graph in which each ciphertext is a node on the left-hand side and each possible plaintext is a node on the righthand side, and draws an edge between a left-hand node and a  ... 
doi:10.7298/1tvp-fr92 fatcat:wpmvmqfkarar7j74m5nhmdkhfu

Peer-to-peer information retrieval

Almer S. Tigelaar
2012 SIGIR Forum  
The owners and users of peers in the network should have at least some level of anonymity depending on the application.  ...  This also determines the shape of the rigid overlay network that forms: a bipartite graph with clients on one side, servers on the other side and the mediator in the middle.  ...  Finally, strict local indices, Figure 1d , either take the form of a small world graph or a random graph depending on whether they include some type of node clustering.  ... 
doi:10.1145/2422256.2422276 fatcat:u5n62556ezbrllenb7frlatiri

Subject Index to Volumes 1–75

2001 Information Processing Letters  
, 2583 5-coloring, 353, 1395 5-connectivity, 1926 5-pebble automaton, 857 (6, 2)-chordal bipartite graph, 2643 6-competitive, 3315 6-head deterministic two-way finite automation, 1371 6-queens solution  ...  minimum trees, 3864 points, 1217, 3864, 4122 problem, 1823, 2723, 3114 Steiner problem in directed graphs, 2723 graphs, 1537, 2172 Steiner problem on networks, 1823 set, 2352, 3181 subsets, 2352  ...  , 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245 ranked, 1610 alphabet, 1101 tree, 2211 ranking, 768, 1551, 1609, 1706, 1805, 1869, 1899, 2151, 2175  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

Secured System Architecture for the Internet of Things Using a Two Factor Authentication Protocol

Chuan Xiong, University, My, University, My
2020
Specifically for this thesis, the TFA solution will be deployed on a fleet management system for experimental and testing purposes.  ...  Hence, the existing security mechanisms are either not applicable in IoT systems or can no longer satisfy the security requirements for IoT systems.  ...  The underlying graph N of a Petri net is a directed, weighted, bipartite graph consisting of two kinds of nodes, called places and transitions, where arcs are either from a place to a transition or from  ... 
doi:10.20381/ruor-24508 fatcat:3kd64qgu3bhgbmd2ykmceyuthi

Social and temporal structures in everyday collaboration

Danyel Fisher, Paul Dourish
2004 Proceedings of the 2004 conference on Human factors in computing systems - CHI '04  
Within the secured world of PKI networks, all information must be transferred either by hand, or encrypted with a known key. These keys, though, are information themselves.  ...  The database is searchable both by time and by keyword.  ...  The bipartite graph maps NameVertexes to MessageVertexes; the folded graph maps NameVertexes to each other.  ... 
doi:10.1145/985692.985762 dblp:conf/chi/FisherD04 fatcat:cx2jwuz3uvaino7vsayjbdo2zm

Survivable monitoring in dynamic networks

G. Ateniese, C. Riley, C. Scheideler
Second IEEE International Information Assurance Workshop, 2004. Proceedings.  
The features of our system include authenticating visitors, monitoring their traffic through the domain, and storing this information in a persistent, efficient, and searchable manner.  ...  Replace each node in the SPON data structure (Fig. 3) with a cluster of nodes connected in a complete graph; replace each edge with a full bipartite graph between the two node clusters.  ...  The information is searchable and available to system administrators.  ... 
doi:10.1109/iwia.2004.1288036 dblp:conf/iwia/AtenieseRS04 fatcat:oomm42xhs5gc7moxrl6e7uxwja

Proceedings of the 2021 Joint Workshop of the German Research Training Groups in Computer Science. May 31–June 1, 2021

Joint Workshop Of The German Research Training Groups In Computer Science, Erlangen May 31–June 1, 2021, Felix Freiling
2021
the German Research and Training Groups (RTGs) funded by the Deutsche Forschungsgemeinschaft (DFG) in the field of computer science meet annually at Schloss Dagstuhl –– Leibniz Center for Informatics, one  ...  Still, we identify a class of two-colored complete bipartite graphs on which we can solve the Col-BM in polynomial time.  ...  We also provide a first understanding of the practical impact of information leakage by searchable encryption schemes, an SC mechanism for querying databases used in private ML.  ... 
doi:10.25593/opus4-fau-16426 fatcat:isoyq5lzdffxrdqzvkmfsnjgau
« Previous Showing results 1 — 15 out of 22 results