Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
753
BI as an Assertion Language for Mutable Data Structures
, 2000
"... Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O'Hea ..."
Abstract
-
Cited by 191 (14 self)
- Add to MetaCart
Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O
Anaphora for everyone: Pronominal anaphora resolution without a parser
- In Proceedings of COLING-96 (16th International Conference on Computational Linguistics
, 1996
"... We present an algorithm for anaphora resolution which is a modified and extended version of that developed by (Lappin and Leass, 1994). In contrast to that work, our algorithm does not require in-depth, full, syntactic parsing of text. Instead, with minimal compromise in output quality, the modifica ..."
Abstract
-
Cited by 164 (11 self)
- Add to MetaCart
We present an algorithm for anaphora resolution which is a modified and extended version of that developed by (Lappin and Leass, 1994). In contrast to that work, our algorithm does not require in-depth, full, syntactic parsing of text. Instead, with minimal compromise in output quality
Identifying Enrichment Candidates in Textbooks
"... Many textbooks written in emerging countries lack clear and adequate coverage of important concepts. We propose a technological solution for algorithmically identifying those sections of a book that are not well written and could benefit from better exposition. We provide a decision model based on t ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
on the syntactic complexity of writing and the dispersion of key concepts. The model parameters are learned using a tune set which is algorithmically generated using a versioned authoritative web resource as a proxy. We evaluate the proposed methodology over a corpus of Indian textbooks which demonstrates its
Global Laser Enrichment
, 2010
"... PUBLIC VERSION GE-Hitachi Global Laser Enrichment LLC (GLE) hereby submits revision 2 of the GLE License Application. Enclosure 1 contains revised Request for Additional Information responses. Enclosure 2 contains revised chapters 1, 2, 3, 5, 7, and 11 of the GLE License Application. Enclosure 3 con ..."
Abstract
- Add to MetaCart
PUBLIC VERSION GE-Hitachi Global Laser Enrichment LLC (GLE) hereby submits revision 2 of the GLE License Application. Enclosure 1 contains revised Request for Additional Information responses. Enclosure 2 contains revised chapters 1, 2, 3, 5, 7, and 11 of the GLE License Application. Enclosure 3
To cite this version:
, 2014
"... al.. Template-based geometric transformations of a functionally enriched DMU into FE assem- ..."
Abstract
- Add to MetaCart
al.. Template-based geometric transformations of a functionally enriched DMU into FE assem-
Methods for Phosphopeptide Isolation/Enrichment
, 2008
"... Additional resources and features associated with this article are available within the HTML version: • Supporting Information • Access to high resolution figures • Links to articles and content related to this article • Copyright permission to reproduce figures and/or text from this article ..."
Abstract
- Add to MetaCart
Additional resources and features associated with this article are available within the HTML version: • Supporting Information • Access to high resolution figures • Links to articles and content related to this article • Copyright permission to reproduce figures and/or text from this article
Solving Recursive Domain Equations with Enriched Categories
, 1994
"... Both pre-orders and metric spaces have been used at various times as a foundation for the solution of recursive domain equations in the area of denotational semantics. In both cases the central theorem states that a `converging' sequence of `complete' domains/spaces with `continuous' ..."
Abstract
-
Cited by 28 (0 self)
- Add to MetaCart
' retraction pairs between them has a limit in the category of complete domains/spaces with retraction pairs as morphisms. The pre-order version was discovered first by Scott in 1969, and is referred to as Scott's inverse limit theorem. The metric version was mainly developed by de Bakker and Zucker
VERTICALLY ITERATED CLASSICAL ENRICHMENT
"... ABSTRACT. Lyubashenko has described enriched 2-categories as categories enriched over V-Cat, the 2-category of categories enriched over a symmetric monoidal V. This construction is the strict analogue for V-functors in V-Cat of Brian Day’s probicategories for V-modules in V-Mod. Here I generalize th ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
the strict version to enriched n-categories for k-fold monoidal V. The latter is defined as by Balteanu, Fiedorowicz, Schwänzl and Vogt but with the addition of making visible the coherent associators αi. The symmetric case can easily be recovered. This paper proposes a recursive definition of V
Results 1 - 10
of
753
