Results 1 - 10
of
469
The protection of information in computer systems
"... This tutorial paper explores the mechanics of protecting computer-stored information from unauthorized use or modification. It concentrates on those architectural structures--whether hardware or software--that are necessary to support information protection. The paper develops in three main sectio ..."
Abstract
-
Cited by 824 (2 self)
- Add to MetaCart
This tutorial paper explores the mechanics of protecting computer-stored information from unauthorized use or modification. It concentrates on those architectural structures--whether hardware or software--that are necessary to support information protection. The paper develops in three main
Linear Objects: logical processes with built-in inheritance
, 1990
"... We present a new framework for amalgamating two successful programming paradigms: logic programming and object-oriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their ..."
Abstract
-
Cited by 206 (6 self)
- Add to MetaCart
their internal state during the computation; (ii) the structured representation of knowledge, generally obtained via inheritance graphs among classes of objects. We start with the approach, introduced in concurrent logic programming languages, which identifies objects with proof processes and object states
1970), “General semantics
- Synthese
"... We outline a vision for computational se-mantics in which formal compositional semantics is combined with a powerful, structured lexical semantics derived from distributional statistics. We consider how existing work (Lewis and Steedman, 2013) could be extended with a much richer lexical semantics u ..."
Abstract
-
Cited by 191 (0 self)
- Add to MetaCart
We outline a vision for computational se-mantics in which formal compositional semantics is combined with a powerful, structured lexical semantics derived from distributional statistics. We consider how existing work (Lewis and Steedman, 2013) could be extended with a much richer lexical semantics
Crowddb: answering queries with crowdsourcing.
- In SIGMOD,
, 2011
"... ABSTRACT Many data management problems are inherently vague and hard for algorithms to process. Take for example entity resolution, also known as record linkage, the process to resolve records for the same entity from heterogeneous sources. Properly resolving such records require not only the synta ..."
Abstract
-
Cited by 145 (11 self)
- Add to MetaCart
the syntactic structure of the data, but also contextual semantics that are hard for machines to understand. To properly perform such data management tasks requires human inputs for providing information that is missing from the structured data that machines can read, for performing computationally difficult
Reconfigurable Computing Systems
- Proceedings of the IEEE
, 2002
"... Reconfigurable computing is emerging as the new paradigm for satisfying the simultaneous demand for application performance and flexibility. The ability to customize the architecture to match the computation and the dataflow of the application has demonstrated significant performance benefits compar ..."
Abstract
-
Cited by 64 (0 self)
- Add to MetaCart
compared to general purpose architectures. Computer vision applications are one class of applications that have significant heterogeneity in their computation and communication structures. At the low level vision algorithms have regular, repetitive computations operating on large sets of image data
Computing architectural vulnerability factors for address-based structures
- In Proceedings of the International Symposium on Computer Architecture (ISCA
, 2005
"... Processor designers require estimates of the architectural vulnerability factor (AVF) of on-chip structures to make accurate soft error rate estimates. AVF is the fraction of faults from alpha particle and neutron strikes that result in user-visible errors. This paper shows how to use a performance ..."
Abstract
-
Cited by 43 (2 self)
- Add to MetaCart
model to calculate the AVF of address-based structures, using a data cache, a data translation buffer, and a store buffer as examples. We describe how to perform a detailed breakdown of lifetime components (e.g., fill-toread, read-to-evict) of bits in these structures into ACE (required
Fast Mapping of short sequences with mismatches, insertions and deletions using index structures. PLoS Comput Biol 5: e1000502
, 2009
"... With few exceptions, current methods for short read mapping make use of simple seed heuristics to speed up the search. Most of the underlying matching models neglect the necessity to allow not only mismatches, but also insertions and deletions. Current evaluations indicate, however, that very differ ..."
Abstract
-
Cited by 62 (16 self)
- Add to MetaCart
utilizes index structures in the form of enhanced suffix arrays. In a comparison with current methods for short read mapping, the presented approach shows significantly increased performance not only for 454 reads, but also for Illumina
Some Boston Metropolitan Examples
, 1997
"... publicly paper and electronic copies of this gocument in whole iart. ..."
Reading Psychology
, 2009
"... This study examined the ways in which 18 first-grade teachers and their students in 11 high-risk urban schools began to use literacy-focused technology. The goal of the study was to observe the technology in use by the students, to observe the classroom dynamics and teachers' instructional cho ..."
Abstract
- Add to MetaCart
struggling to make change. The Report of the National Reading Panel (National Institute of Child Health and Human Development, 2000), a review of scientifically based research on reading, discussed the potential of computer-aided learning technology in the classroom and noted that though there is intense
Results 1 - 10
of
469