Results 1 - 10 of 11,665

Text Classification using String Kernels

by Huma Lodhi, Craig Saunders, John Shawe-Taylor, Nello Cristianini, Chris Watkins
"... We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguo ..."
Abstract - Cited by 495 (7 self) - Add to MetaCart
contiguously. The subsequences are weighted by anexponentially decaying factor of their full length in the text, hence emphasising those occurrences that are close to contiguous. A direct computation of this feature vector would involve a prohibitive amount of computation even for modest values of k, since

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
and analysis; and to Gerrit Wolf for help in analytic planning. This report was prepared in connection with research supported by the Office of Naval Research (Organizational Effectiveness Research Program,, and by the Manpower Administration, U. S. Department of Labor . Since grantees conducting research

Intrusion Detection using Sequences of System Calls

by Steven A. Hofmeyr, Stephanie Forrest, Anil Somayaji - Journal of Computer Security , 1998
"... A method is introducted for detecting intrusions at the level of privileged processes. Evidence is given that short sequences of system calls executed by running processes are a good discriminator between normal and abnormal operating characteristics of several common UNIX programs. Normal behavio ..."
Abstract - Cited by 396 (15 self) - Add to MetaCart
A method is introducted for detecting intrusions at the level of privileged processes. Evidence is given that short sequences of system calls executed by running processes are a good discriminator between normal and abnormal operating characteristics of several common UNIX programs. Normal

Toward a Conceptual Framework for Mixed-Method Evaluation Designs. Educational Evaluation and Policy Analysis

by Jennifer C. Greene, Valerie J. Caracelli, Wendy F. Graham , 1989
"... In recent years evaluators of educational and social programs have expanded their method-ological repertoire with designs that include the use of both qualitative and quantitative methods. Such practice, however, needs to be grounded in a theory that can meaningfully guide the design and implementat ..."
Abstract - Cited by 404 (3 self) - Add to MetaCart
analysis. Strategies for integrated data analysis are among the issues identified as priorities for further mixed-method work. The inevitable organizational, political, and interpersonal challenges of program evaluation mandate the use of multiple tools from evaluators ' full methodological reper

A Full Program Control Flow Representation for Real Programs

by He Zhu, Ian Watson - IN EUROPEAN CONFERENCE ON PARALLEL PROCESSING , 1997
"... This paper reports on constructing an exhaustive full program control flow framework for precise data flow analysis of real programs. We discuss the problem of ambiguous calling relations in the presence of function pointers. A flow insensitive analysis is suggested and implemented for real C ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper reports on constructing an exhaustive full program control flow framework for precise data flow analysis of real programs. We discuss the problem of ambiguous calling relations in the presence of function pointers. A flow insensitive analysis is suggested and implemented for real C

Value Locality and Load Value Prediction

by Mikko H. Lipasti, Christopher B. Wilkerson, John Paul Shen , 1996
"... Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently p ..."
Abstract - Cited by 391 (18 self) - Add to MetaCart
present in real-world programs, and describe how to effectively capture and exploit it in order to perform load value prediction. Temporal and spatial locality are attributes of storage locations, and describe the future likelihood of references to those locations or their close neighbors. In a similar

Prioritized sweeping: Reinforcement learning with less data and less time

by Andrew W. Moore, Christopher G. Atkeson - Machine Learning , 1993
"... We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochas-tic Markov systems. Incremental learning methods such asTemporal Di erencing and Q-learning have fast real time performance. Classical methods are slower, but more accurate, because they make full use of ..."
Abstract - Cited by 378 (6 self) - Add to MetaCart
We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochas-tic Markov systems. Incremental learning methods such asTemporal Di erencing and Q-learning have fast real time performance. Classical methods are slower, but more accurate, because they make full use

Full Abstraction for PCF

by Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - INFORMATION AND COMPUTATION , 1996
"... An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "history-free" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable i ..."
Abstract - Cited by 254 (16 self) - Add to MetaCart
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "history-free" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable

MetaML and Multi-Stage Programming with Explicit Annotations

by Walid Taha, Tim Sheard - Theoretical Computer Science , 1999
"... . We introduce MetaML, a practically-motivated, staticallytyped multi-stage programming language. MetaML is a "real" language. We have built an implementation and used it to solve multi-stage problems. MetaML allows the programmer to construct, combine, and execute code fragments in a ..."
Abstract - Cited by 301 (32 self) - Add to MetaCart
unsafe programs. A type system and semantics for full MetaML is still ongoing work. We argue that multi-...

ESP: Path-Sensitive Program Verification in Polynomial Time

by Manuvir Das, Sorin Lerner, Mark Seigle , 2002
"... In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the proper ..."
Abstract - Cited by 299 (4 self) - Add to MetaCart
the property-related behavior differs along the arms of the branch, we can design an algorithm that is accurate enough to verify the program with respect to the given property, without paying the potentially exponential cost of full pathsensitive analysis. We have implemented this “property simulation
Results 1 - 10 of 11,665