A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Synthesizing entity matching rules by examples
2017
Proceedings of the VLDB Endowment
Preserved Fulltext
Entity matching (EM) is a critical part of data integration. We study how to synthesize entity matching rules from positive-negative matching examples. ...
The rules in the form of GBF are more concise than traditional EM rules represented in Disjunctive Normal Form (DNF). ...
Rule-Based Entity Matching. Declarative EM rules are normally desirable to end users. ...
doi:10.14778/3149193.3149199
fatcat:2sekwu3kzbakndo2otlaymeqem
Extracting Meaningful Entities from Human-generated Tactical Reports
2015
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Traditionally, tools did not exploit human generated, textual reports, leaving analysts to manually map dots on the map into meaningful entities using background knowledge about adversary equipment, organization ...
Tactical reports typically feature short sentences with simple grammar, but also tend to include jargon and abbreviations, do not follow grammatical rules, and are likely to have spelling errors. ...
Tactical reports are generally short and concise. However, the conciseness is a product of mutual understanding, shared knowledge and shared context, among the parties involved. ...
doi:10.1016/j.procs.2015.09.153
fatcat:wqyxb6tda5hnxpuer6u32z6wjq
Automatic Inference of Structural Changes for Matching across Program Versions
2007
29th International Conference on Software Engineering (ICSE'07)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
rules. ...
To overcome these limitations, our approach represents structural changes as a set of high-level change rules, automatically infers likely change rules and determines method-level matches based on the ...
Conciseness: the measure of how concisely a set of rules explains matches, represented as a M/R ratio = |M| |Rules| . ...
doi:10.1109/icse.2007.20
dblp:conf/icse/KimNG07
fatcat:ovti5xuttnct7p5c3jsjixcbuq
Mining Source Code for Structural Regularities
2010
2010 17th Working Conference on Reverse Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In general, tool support for mining regularities tends to discover a huge amount of rules, making interpretation of the results hard and time-consuming. ...
We propose an automated approach, based on association rule mining, to discover the structural regularities that govern the source code of a software system. ...
entity is involved (either as a match to a rule, or as a deviation). ...
doi:10.1109/wcre.2010.12
dblp:conf/wcre/LozanoKMA10
fatcat:bupgicfzqneppd2xw3pjbm56lu
Class Diagram Restructuring with GROOVE
2013
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We show that the visual rule formalism enables the required restructuring to be formulated in a very concise manner. ...
First we apply the rule SELECTSUBCLASS (Fig. 3) . Similar to PULLUPDIRECT, it matches Entitys that have a superclass and a Property. ...
The generalizations that link the Entitys to the superclass are removed, as well as the properties themselves. ...
doi:10.4204/eptcs.135.10
fatcat:xzqpmiywwvga7b2o5x5p2x6bj4
Declarative Access Control for WebDSL: Combining Language Integration and Separation of Concerns
2008
2008 Eighth International Conference on Web Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We would like to thank William Cook for the discussions on domain-specific language design for web applications in general and access control in particular. ...
A generic rule can use a wildcard for the name of the element and/or the parameters of the element. Such a rule applies to elements to which it matches. ...
The generic rule is placed inside a rule set named admin. ...
doi:10.1109/icwe.2008.15
dblp:conf/icwe/GroenewegenV08
fatcat:vtyxpea2zjg23fkxkxf6e3b2h4
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Users can therefore access the database by applying structured rules instead of using atomic operations provided before. ...
result, the development of graph transformation tools is eased by providing a mapping of specific graph languages to the Query and Transformation Language, instead of developing interpreters or code generators ...
Hexagons represent operators which denote modifications of the matched graph entities. Here, the entity assigned to the third NodeVariable is deleted and removed from the match. ...
doi:10.1007/978-3-540-89020-1_27
fatcat:6fagheilivfabjdqmbyqpcu5hu
Enabling Efficient Cyber Threat Hunting With Cyber Threat Intelligence
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2010.13637v1 fatcat:bcdleeshwbhklpyfueenem45bm
Built upon system auditing frameworks, ThreatRaptor provides (1) an unsupervised, light-weight, and accurate NLP pipeline that extracts structured threat behaviors from unstructured OSCTI text, (2) a concise ...
The return rule specifies the attributes of the matched events for return. ...
EFFHUNTER further filters out edges whose associated IOC relations do not match any rules. ...
arXiv:2010.13637v2
fatcat:2dt52vj7a5fhbbwkb33jwwx7mu
Schema polynomials and applications
2008
Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The simplicity and conciseness of a schema depends critically on the idioms available to express the schema. ...
We demonstrate how the schema factorization framework can be used to generate relational, object-oriented, and faceted physical schemas, allowing a wider exploration of physical schema alternatives than ...
The general theme of simplicity, though, suggests that more concise representations of the same schema are better. ...
doi:10.1145/1352431.1352482
fatcat:7eu4efs7mremnnkuswdzmze3qe
Schema polynomials and applications
2008
Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The simplicity and conciseness of a schema depends critically on the idioms available to express the schema. ...
We demonstrate how the schema factorization framework can be used to generate relational, object-oriented, and faceted physical schemas, allowing a wider exploration of physical schema alternatives than ...
The general theme of simplicity, though, suggests that more concise representations of the same schema are better. ...
doi:10.1145/1353343.1353394
dblp:conf/edbt/RossS08
fatcat:gearj7atb5etvltggzsqcgvtii
Towards 2D Traceability in a Platform for Contract Aware Visual Transformations with Tolerated Inconsistencies
2006
International Enterprise Distributed Object Computing Conference, Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such transformations can be generated automatically from the contracts but tend to be optimized subtly by a transformation expert. ...
The rule matches all cm nodes connected to an rm node by means of an m2m link of type CM2RM. ...
Once a match against this structure has been found, the rule asserts that the name of the class in the conceptual model should always be the same as the name of the entity in the robustness model. ...
doi:10.1109/edoc.2006.61
dblp:conf/edoc/GorpAJ06
fatcat:dqk7q7idc5dqjdfheutxgmldyu
An Administrative Model for Relationship-Based Access Control
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Relationship-based access control (ReBAC) originated in the context of social network systems and recently is being generalized to be suitable for general computing systems. ...
To the best of our knowledge, it is the first comprehensive administrative model for a ReBAC model suitable for general computing systems. ...
A principal-matching policy is a list of principal-matching rules. It may contain at most one rule containing , and that rule, if present, must appear last. ...
doi:10.1007/978-3-319-20810-7_4
fatcat:fkzd32xqjbh5hhvcdy3twxo3me
Identifying and Summarizing Systematic Code Changes via Rule Inference
2013
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
as logic rules. ...
To enable programmers to reason about program differences at a high-level, this article proposes a rule-based program differencing approach that automatically discovers and represents systematic changes ...
ACKNOWLEDGMENTS The authors thank Wei Wu and Hoan Nguyen for their help with the evaluation of the API-matching tool. ...
doi:10.1109/tse.2012.16
fatcat:nmf3zzrvgbg5zm72aqule2losy
GovWILD
2012
Proceedings of the 21st international conference companion on World Wide Web - WWW '12 Companion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Data fusion: The last integration step fuses previously matched and grouped representations of entities to concise tuples in order to lower the complexity of queries spanning multiple entities. ...
Further, we have incorporated some general information sites to augment person and legal entity data. ...
doi:10.1145/2187980.2188039
dblp:conf/www/BohmFHLMNEHHS12
fatcat:ecdrgymhdzbzvknlltu3uhecqa
Conditional Bigraphs
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In standard bigraphs, the applicability of a rewrite rule is determined completely by a local match and does not allow any non-local reasoning, i.e. contextual conditions. ...
We introduce conditional bigraphs that add conditions to rules and show how these fit into the matching framework for standard bigraphs. An implementation is provided, along with a set of examples. ...
In bigraphs there is no general method to declare an entity as unique. ...
doi:10.1007/978-3-030-51372-6_1
fatcat:i7rp3mlmdnaohdo7ez5uggkoau
« Previous
Showing results 1 — 15 out of 29,094 results