Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Edward L. Robertson"'
Autor:
Edward L. Robertson, Richard A. Martin
Publikováno v:
INCOSE International Symposium. 20:988-999
Misunderstandings related to “meta” often cause serious problems in systems engineering. This paper attempts to elucidate some of those misunderstandings, particularly as they apply to systems architectures. It examines how standards can provide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06a1ca5e3d109745ec6187c6081ab19d
https://doi.org/10.1002/j.2334-5837.2010.tb01119.x
https://doi.org/10.1002/j.2334-5837.2010.tb01119.x
Publikováno v:
Theory of Computing Systems. 44:590-619
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. We investigate the expressive power provided in this regard by structural recursion. In particular, we show that the combination of ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cb3fdf31766828cbf877db0dd6ce131
https://doi.org/10.1007/s00224-008-9110-5
https://doi.org/10.1007/s00224-008-9110-5
Autor:
Chris Giannella, Edward L. Robertson
Publikováno v:
Information Systems. 29:483-507
We examine the issue of how to measure the degree to which a functional dependency (FD) is approximate. The primary motivation lies in the fact that approximate FDs represent potentially interesting patterns existent in a table. Their discovery is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4451d50792b98cca72a7c206fa663ec1
https://doi.org/10.1016/j.is.2003.10.006
https://doi.org/10.1016/j.is.2003.10.006
Autor:
Edward L. Robertson, Chris Giannella
Publikováno v:
Information Processing Letters. 85:153-158
We consider the problem of defining a normalized approximation measure for multi-valued dependencies in relational database theory. An approximation measure is a function mapping relation instances to real numbers. The number to which an instance is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::213282cf63edf121e8a7122bc20b3889
https://doi.org/10.1016/s0020-0190(02)00365-4
https://doi.org/10.1016/s0020-0190(02)00365-4
Publikováno v:
Advanced Information Systems Engineering ISBN: 9783642216398
CAiSE
CAiSE
Enterprise Architecture (EA) is, by definition, an artificial construct. It includes conceptual objects and attributes created for human purposes. EA models, therefore, require an ontological foundation that goes beyond the 'furniture of the world' m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c65cec7b5ade9335f97fa405f46d1a8f
https://doi.org/10.1007/978-3-642-21640-4_29
https://doi.org/10.1007/978-3-642-21640-4_29
Publikováno v:
SERVICES I
Provenance that captures e-Science activity has long term value only if the right amount and kind of information is collected. In this paper, we propose a two-layer model for representing provenance information capable of representing both execution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a12d05ece06f2ae8f8e240cf2b502d0b
https://doi.org/10.1109/services-i.2009.54
https://doi.org/10.1109/services-i.2009.54
Autor:
Edward L. Robertson, Jeremy T. Engle
Publikováno v:
IDEAS
The task of searching a powerset lattice is part of many problem domains. In Approximate Functional Dependencies (AFDs) mining the algorithm used for searching lattices has been bottom-up breadth first search (BU-BFS). This paper introduces as part o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20383ce513ab173f83f2169b81922b59
https://doi.org/10.1145/1620432.1620439
https://doi.org/10.1145/1620432.1620439
Autor:
Jeremy T. Engle, Edward L. Robertson
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540705031
BNCOD
BNCOD
This paper examines algorithmic aspects of searching for approximate functional dependencies in a database relation. The goal is to avoid exploration of large parts of the space of potential rules. This is accomplished by leveraging found rules to ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6b3c35966ac8ce8d5bb5f68d137bcbf
https://doi.org/10.1007/978-3-540-70504-8_4
https://doi.org/10.1007/978-3-540-70504-8_4
Autor:
Edward L. Robertson, John A. Springer
Publikováno v:
On the Move to Meaningful Internet Systems: OTM 2008 Workshops ISBN: 9783540888741
OTM Workshops
OTM Workshops
In database systems, software engineering, and systems engineering, the concepts of constraints and views are commonly and effectively used. Considered distinct, they stand as well-established notions in each domain's body of knowledge. The focus of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efe8322afb5122f1b231e859a974f69e
https://doi.org/10.1007/978-3-540-88875-8_46
https://doi.org/10.1007/978-3-540-88875-8_46
Publikováno v:
Proceedings of the second workshop on Automated formal methods.
Entity-Relationship (ER) diagrams are an established way of doing data modeling. In this paper, we report our experience with exploring the use of PVS to formally specify and reason with ER data models. Working with a text-book example, we rely on PV
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::508c5bde8969893a74e80d023ba28ab0
https://doi.org/10.1145/1345169.1345170
https://doi.org/10.1145/1345169.1345170