Jon Bentley. Little languages. Communications of the ACM, 29(8):711--721, 1986.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....Verification Pattern Counting Phase 1 fit in memory Phase 2 Phase 3 Figure 3: Outline of STAMP Approach 1.33. Now the problem becomes finding the maximum summation of any subsequence of # # ## # ###### # # # . The maximum information gain problem can be then formulated as follows [2]. ### # ## # ########### # # ### ### # ## # ####### ######### where #### and #### are the maximum value of the summation of any subsequence ending exactly at # # and the maximum value of the summation of any subsequence ending either before or at # # , respectively. By choosing #### # # and #### ....

....can be easily solved by making one scan through the event sequence and maintaining two counters for each singular pattern to capture #### and #### at the current scanning position. The starting position and ending position of the corresponding subsequences can also be maintained simultaneously [2]. Since the number of MIG counters is #, and the main memory of a common computer is limited to a few hundred MBytes which could be far less than #, we need a mechanism to limit the number of MIG counters considered before the MIG counting procedure. 3.2 Segment based OIS Pruning To reduce ....

J. Bentley. Programing pearls. Communications of ACM, vol. 27, no. 2, 865-871, 1984.

....details from applications and the usefulness of a stub generator for automated code generation. We have simply applied these techniques to the realm of adaptation in pervasive computing. The application description language addresses some of the same issues as 4GLs [12] and little languages [3]. The latter are task specific languages that allow developers to express higher level semantics without worrying about low level details. Our description language is similar as it allows application developers to specify the adaptation capabilities of their applications at a higher level without ....

Bentley, J. Little languages. Communications of the ACM, 29(8):711-21, 1986.

....problem of identifying useful remote execution partitions of existing applications and have not performed any form of code migration or service composition. The declarative language we use to express an application s tactics addresses some of the same issues as 4GLs [12] and little languages [4]. The latter are task specific languages that allow developers to express higher level semantics without worrying about low level details. Our language is similar as it allows application developers to specify the remote execution capabilities of their applications at a higher level without ....

Bentley, J. Little languages. Communications of the ACM, 29(8):711--21, 1986.

....are used during the search process as described in [11] In this paper, we present two efficient likelihood computation techniques which are based on space partitioning techniques. In particular, we describe a fast likelihood computation algorithm using the k dimensional binary search tree [1, 6, 7]. In addition, we present a fast log likelihood calculation technique which is similar to the nearest neighbor search method as described in [9] Unlike the k dimensional binary search tree method, this method is based on dynamic partitioning of the search space. The basic idea of the so called ....

....3.1. k d Tree Method In this section, we present a static space partitioning technique which is based on a k dimensional binary search tree, called k d tree. The k d tree is a data structure which partitions space using hyperplanes where the hyperplanes are perpendicular to the coordinate axes [1]. To organize the L(s) densities of a HMM state s as a k d tree (with k = D) we construct the tree in a similar way as proposed in [6] A density (or strictly speaking the prototype vector of a density) is chosen to be the root node. Densities located on one side of a hyperplane passing through ....

J.L. Bentley: Multidimensional Binary Search Tree used for Associative Searching. Communications of the ACM, 18(9), pp. 509-517, September 1975.

....details from applications and the usefulness of a stub generator for automated code generation. We have simply applied these techniques to the realm of adaptation in pervasive computing. The application description language addresses some of the same issues as 4GLs [12] and little languages [3]. The latter are task specific languages that allow developers to express higher level semantics without worrying about low level details. Our description language is similar as it allows application developers to specify the adaptation capabilities of their applications at a higher level without ....

Bentley, J. Little languages. Communications of the ACM, 29(8):711--21, 1986.

....implementation of the eval apply interpreter resembles the SECD machine first presented in [Lan63] In section 4. 5 I describe a special compiler written to compile primitives from a HASKELL C hybrid language into C Examples of development and uses of such little languages are given in [Ben86] The associative arrays used to store type information for the primitive compiler are featured in [Ben85] The compiler was written in Perl [Wal88] a language containing all the features of awk (awk programs can be automatically translated into Perl. The suitability of awk for generating ....

Jon Bentley. Little languages. Communications of the ACM, 29(8):711--721, August 1986. 82

....researchers in artificial intelligence often use such logics to represent planning tasks, as in the Prodigy system [VCP 95] The new approach makes it easy to generate automatically a checker specialized to a given logic. Just as Jon Bentley has argued the need for little languages [Ben86] this generator provides a way to construct little checkers for little logics. We built such a checker generator tool called REVERE. The generated checkers are lightweight and quick, just as the logics are little in the sense of having limited connectives and restricted rules, but the ....

Jon Bentley. Little languages. Communications of the ACM, 29(8):711--721, 1986.

....was implemented, in which the vocabulary consisted of approximately 200,000 words; the finite automaton used 124Kbytes of memory; the spelling checker can process about 30,000 words per minute on a standard ibm compatible personal computer. Unlike the technique used by the Unix program spell [3, 9], finite automata can be used to implement spelling checkers for most languages. In a companion paper we show an application for debugging natural language vocabularies [6] In this paper we deal with the question of minimizing the size of a popular representation of finite automata, which we ....

Bentley, J. A spelling checker. Communications of the ACM, 28:456--462, 5, 1985.

....to be well understood, because of the relatively simple flow of control in such languages. Execution profilers for such languages often rely on sampling techniques [9, 11] others maintain runtime counts that record the total number of times each program statement is executed ( 12] see also [1]) With the increasing popularity of logic programming languages like Prolog, and the increasing volume of code being written in such languages, the need for profiling tools for such languages becomes important. However, in this case the situation is complicated by the complex flow of control, ....

J. Bentley, Profilers, Communications of the ACM 30, 7 (July 1987), 587-592.

....multiple domains must be solved, and jargons already exist for the domains, then it may be possible to solve the problem by composing the existing jargons, thereby eliminating entirely the cost and time of making yet more jargons. 7. Related Work Jargons are instances of little languages [Bentley86]. As such, they share the attributes of simplicity and ease ofuse that are the hallmarks of domain specific specialization. Unlike making a jargon, making a conventional little language entails all the steps of making a big language: syntax design, grammar specification, parsing, and execution. ....

Bentley, J. Little Languages, Communications of the ACM 29 (8), August 1986, 711-721.

....input logic allow us to generate a saturated set of formulas that we find easier to interpret than the sets generated by these more general systems. Finally, our approach makes it easy to generate specialized checkers automatically. Just as Jon Bentley has argued the need for little languages [2], our tool provides a way to construct little tools for little logics. 6 Summary and Future Directions Our approach was motivated by the need to debug protocols in the security domain. When someone presents a security protocol, there is always an uneasiness on our part. These are typical ....

J. Bentley. Little languages. Communications of the ACM, 29(8):711--721, 1986.

....researchers in artificial intelligence often use such logics to represent planning tasks, as in the Prodigy system [VCP 95] The new approach makes it easy to generate automatically a checker specialized to a given logic. Just as Jon Bentley has argued the need for little languages [Ben86] this generator provides a way to construct little checkers for little logics. We built such a checker generator tool called REVERE. The generated checkers are lightweight and quick, just as the logics are little in the sense of having limited connectives and restricted rules, but the ....

Jon Bentley. Little languages. Communications of the ACM, 29(8):711--721, 1986.

....order. Moreover, since the entire vocabulary can be kept in memory, even in a small computer, the queries are very fast (a few instructions per letter) The finite automaton representation compares well in speed and size against the bitvector hashing method used in the classic Unix spell tool [3]. In addition, the finite automaton is exact, and does not require ad hoc language specific affix stripping procedures. Finally, besides simple inclusion tests, the automaton allows also various kinds of word enumeration and pattern searching operations. This last feature is essential for many ....

J. Bentley. A spelling checker. Communications of the ACM, 28(5):456--462, 1985.

....Accept Off the Shelf Tools One component of a compilation problem is scanning the process of recognizing sequences of characters as instances of source language basic symbols. Scanning is also a component of the bibliographic search problem [1] the problem of correcting spelling errors in text [2], and many similar problems. Tools implementing solutions to such common problems are often available off theshelf . An implementor should employ such existing processors whenever possible in order to shorten the development time and improve the reliability of the final product. This means that ....

Bentley, J. A Spelling Checker. Communications of the ACM 28, 5 (May 1985), 456-- 462.

....was implemented, in which the vocabulary consisted of approximately 200,000 words; the finite automaton used 124Kbytes of memory; the spelling checker can process about 30,000 words per minute on a standard ibm compatible personal computer. Unlike the technique used by the Unix program spell [3, 9], finite automata can be used to implement spelling checkers for most languages. In a companion paper we show an application for debugging natural language vocabularies [6] In this paper we deal with the question of minimizing a certain type of automata, called binary automata, which we use to ....

J. Bentley. A spelling checker. Communications of the ACM, 28(5):456--62, 1985.

No context found.

Jon Bentley. Little languages. Communications of the ACM, 29(8):711--721, 1986.

No context found.

Bentley, J. Little Languages. Communications of the ACM, 29(8):711--721, 1986.

No context found.

Bentley, J. Little Languages. Communications of the ACM, 29(8):711--721, 1986. 25

No context found.

Bentley, J. Little Languages. Communications of the ACM, 29(8):711--721, 1986.

No context found.

Bentley, J. Little Languages. Communications of the ACM, 29(8):711--721, 1986. 25

No context found.

Bentley, J. Little languages. Communications of the ACM, 29(8):711-21, 1986.

No context found.

J.L. Bentley, Communications of the ACM, 18, (No. 9, 1975), pp 509-517.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC