Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Michael B. Greenwald"'
Publikováno v:
ACM SIGPLAN Notices. 50:49-62
We propose a novel approach to the well-known view update problem for the case of tree-structured data: a domainspecific\ programming language in which all expressions denote bi-directional transformations on trees. In one direction, these transforma
Autor:
J. Nathan Foster, Michael B. Greenwald, Alan Schmitt, Benjamin C. Pierce, Christian Kirkegaard
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2007, 73 (4), pp.669-689. ⟨10.1016/j.jcss.2006.10.024⟩
Journal of Computer and System Sciences, 2007, 73 (4), pp.669-689. ⟨10.1016/j.jcss.2006.10.024⟩
Journal of Computer and System Sciences, Elsevier, 2007, 73 (4), pp.669-689. ⟨10.1016/j.jcss.2006.10.024⟩
Journal of Computer and System Sciences, 2007, 73 (4), pp.669-689. ⟨10.1016/j.jcss.2006.10.024⟩
Extended abstract in Database Programming Languages (DBPL) 2005; International audience; Increased reliance on optimistic data replication has led to burgeoning interest in tools and frameworks for synchronizing disconnected updates to replicated dat
Publikováno v:
Computer Networks. 50:2548-2563
Increases in scale, complexity, dependency and security for networks have motivated increased automation of activities such as network monitoring. We have employed technology derived from active networking research to develop a series of network moni
Publikováno v:
Performance Evaluation. 49:165-177
We consider direct techniques for measuring network-internal delays that rely on network routers as measurement nodes, and indirect techniques that rely on end-to-end measurements and infer delay distributions on the common internal paths. The direct
Publikováno v:
IEEE/ACM Transactions on Networking. 6:529-543
Checksum and cyclic redundancy check (CRC) algorithms have historically been studied under the assumption that the data fed to the algorithms was uniformly distributed. This paper examines the behavior of checksums and CRCs over real data from variou
Autor:
Michael B. Greenwald
Publikováno v:
Performance Evaluation. :19-40
This paper presents practical algorithms for implementing self-scaling histograms. We show that these algorithms can deal well with observations drawn from either continuous or discrete distributions, have fixed storage and low computational overhead
Autor:
Jonathan M. Smith, Michael B. Greenwald, Sotiris Ioannidis, Angelos D. Keromytis, Ben Maughan Laurie, Dale Rahn, Jason Wright
This chapter reports on our experiences with POSSE, a project studying “Portable Open Source Security Elements” as part of the larger DARPA effort on Composable High Assurance Trusted Systems. We describe the organization created to manage POSSE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03ed57553c11c3343d6c5d9f6ef05d07
https://doi.org/10.4018/978-1-59904-939-7.ch115
https://doi.org/10.4018/978-1-59904-939-7.ch115
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
Publikováno v:
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), 2007, ACM Transactions on Programming Languages and Systems, 29 (3), pp.17. ⟨10.1145/1232420.1232424⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2007, ACM Transactions on Programming Languages and Systems, 29 (3), pp.17. ⟨10.1145/1232420.1232424⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2007, ACM Transactions on Programming Languages and Systems, 29 (3), pp.17. ⟨10.1145/1232420.1232424⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2007, ACM Transactions on Programming Languages and Systems, 29 (3), pp.17. ⟨10.1145/1232420.1232424⟩
We propose a novel approach to the view-update problem for tree-structured data: a domain-specific programming language in which all expressions denote bidirectional transformations on trees. In one direction, these transformations---dubbed lenses --
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b15b2de334a1efd76186d1106460c050
https://inria.hal.science/inria-00484971
https://inria.hal.science/inria-00484971
Cooperative defensive systems communicate and cooperate in their response to worm attacks, but determine the presence of a worm attack solely on local information. Distributed worm detection and immunization systems track suspicious behavior at multi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::630fe580f4f4fc275fd201487316cb35
Publikováno v:
2007 Information Theory and Applications Workshop.
In a shared channel model for Internet links, bandwidth is shared by principled users who abide by communal principles for snaring and using bandwidth and unprincipled scofflaws who seek to commandeer as much of the bandwidth as possible to effect di