|
|
Creator | Title | Description | Subject | Date |
1 |
|
Henderson, Thomas C. | From motes to Java stamps: smart sensor network testbeds | We have proposed Smart Sensor Networks (S-Nets) as an architecture and set of distributed algorithms to extract, interpret and exploit networked sensor devices. Heretofore, the development of this approach has been done in simulation. In this paper, we describe two complementary implementations o... | Smart Sensor Networks; S-Nets | 2003-03-03 |
2 |
|
Panangaden, Prakash | Abstract interpretation and indeterminacy | We present a semantic theory that allows us to discuss the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then... | Semantics; Indeterminate operators | 1984 |
3 |
|
Gopalakrishnan, Ganesh | Bounded transaction model checking | Industrial cache coherence protocol models often have too many reachable states, preventing full reachability analysis even for small model instances (number of processors, addresses, etc.). Several partial search debugging methods are, therefore, employed, including lossy state compression using... | Model checking; Reachability analysis | 2006-02-27 |
4 |
|
Evans, David | Display of complex three dimensional finite element models | Complex three dimensional models can be displayed after an automatic generation of a finite element (panel) mapping. although this automatic generation algorithm fails at certain levels of model complexity, the elimination of these failures can be accomplished through user interaction. This report p... | Three dimensional models; Finite element models | 1978 |
5 |
|
Riloff, Ellen M. | Learning domain-specific information extraction patterns from the web | Many information extraction (IE) systems rely on manually annotated training data to learn patterns or rules for extracting information about events. Manually annotating data is expensive, however, and a new data set must be annotated for each domain. So most IE training sets are relatively small. C... | Information extraction; Domain-specific; Annotated training sets; MUC-4 | 2006 |
6 |
|
Henderson, Thomas C. | Reaction-diffusion patterns in smart sensor networks | We introduced the use of Turing?s reaction-diffusion pattern formation to support high-level tasks in smart sensor networks (S-Nets). This has led us to explore various biologically motivated mechanisms. In this paper we address some issues that arise in trying to get reliable, efficient patterns... | Reaction-diffusion; Pattern formation; Smart sensor networks; S-Nets | 2003-11-05 |
7 |
|
Gopalakrishnan, Ganesh | Decomposing the proof of correctness of pipelined microprocessors | We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction function using completion functions, one per unfinished instruction, each of which specify the effect (on the observables) of ... | Pipelined microprocessors; Proof of correctness | 1998 |
8 |
|
Henderson, Thomas C. | Multisensor knowledge systems | We describe an approach which facilitates and makes explicit the organization of the knowledge necessary to map multisensor system requirements onto an appropriate assembly of algorithms, processors, sensors, and actuators. We have previously introduced the Multisensor Kernel System and Logical Sen... | Multisensors; Multisensor Kernel System; Multisensor systems | 1986 |
9 |
|
Henderson, Thomas C. | Pattern formation in wireless sensor networks | Biological systems exhibit an amazing array of distributed sensor/actuator systems, and the exploitation of principles and practices found in nature will lead to more effective artificial systems. The retina is an example of a highly tuned sensing organ, and the human skin is comprised of a set o... | Pattern formation; Wireless sensor networks | 2008 |
10 |
|
Gopalakrishnan, Ganesh | Inspect: a runtime model checker for multithreaded C programs | We present Inspect, a runtime model checker for revealing concurrency bugs in multithreaded C programs. Inspect instruments a given program at all global interaction points, and with the help of a new scheduler, examines all relevant thread interleavings under dynamic partial order reduction (DPO... | Multithreaded C programs; Model checker; Inspect; Concurrency bugs | 2008 |
11 |
|
Gopalakrishnan, Ganesh | Performance studies of PV: an On-the-fly model-checker for LTL-X featuring selective caching and partial order reduction | We present an enumerative model-checker PV that uses a new partial order reduction algorithm called Twophase. This algorithm does not use the in-stack check to implement the proviso, making the combination of Twophase with on-the-fly LTL-X model-checking based on nested depth-first search, as well a... | Model-checker; PV; Performance; On-the-fly; Partial order reduction algorithm;' Twophase | 2001 |
12 |
|
Riloff, Ellen M. | Unified model of phrasal and sentential evidence for information extraction | Information Extraction (IE) systems that extract role fillers for events typically look at the local context surrounding a phrase when deciding whether to extract it. Often, however, role fillers occur in clauses that are not directly linked to an event word. We present a new model for event extract... | Information extraction; Phrasal evidence; Sentential evidence; Role fillers; Event extraction; Sentential event recognizer; Plausible roll-filler recognizer | 2009 |
13 |
|
Gopalakrishnan, Ganesh | Predicate abstraction for Murphi | Predicate abstraction is a technique used to prove properties in a finite or infinite state system. It employs decision procedures to abstract a concrete state system into a finite state abstraction system, which will then be model checked and refined. In this paper, we present an approach for im... | Predicate abstraction; Murphi | 2006 |
14 |
|
Gopalakrishnan, Ganesh | Precision on demand: an improvement in probabilistic hashing | In explicit state (enumerative) model checking, state vectors are often represented in a compressed form in order to reduce storage needs, typically employing fingerprints, bithashes, or state signatures. When using this kind of techniques, it could happen that the compressed image of a nonvisite... | Probabilistic hashing; Model checking | 2007 |
15 |
|
Brandt, Richard C. | Building databases for the computer-based memorization system | The Computer-Based Memorization System (CBMS) consists of eight games used by students to memorize groups of related facts that are stored in an associative network. The instructional design is built into the games. Designing and implementing associative networks for the CBMS is very different from... | Computer-Based Memorization System; CBMS | 1988 |
16 |
|
Henderson, Thomas C. | Monte Carlo sensor networks | Biswas et al. [1] introduced a probabilistic approach to inference with limited information in sensor networks. They represented the sensor network as a Bayesian network and performed approximate inference using Markov Chain Monte Carlo (MCMC). The goal is to robustly answer queries even under no... | Monte Carlo sensor networks; Markov Chain Monte Carlo; MCMC | 2005-01-20 |
17 |
|
Gopalakrishnan, Ganesh | Towards a formal model of shared memory consistency for intel itanium | We provide a simple formal model for ItaniumTM shared memory consistency [1, 2] covering a core set of instructions. Existing descriptions of Itanium shared memory consistency are based on an informal collection of ordering rules as well as several examples. Our operational model employs employs wid... | formal model; shared memory consistency; ItaniumTM; Itanium | 2001 |
18 |
|
Henderson, Thomas C.; Sikorski, Christopher | Computational sensor networks | We propose Computational Sensor Networks as a methodology to exploit models of physical phenomena in order to better understand the structure of the sensor network. To do so, it is necessary to relate changes in the sensed variables (e.g., temperature) to the aspect of interest in the sensor netw... | Computational sensor networks | 2007 |
19 |
|
Hansen, Charles D.; Henderson, Thomas C. | MKS: a multisensor kernel system | The multisensor kernel system (MKS) is presented as a means for multisensor integration and data acquisition. This system has been developed in the context of a robot work station equipped with various types of sensors utilizing three-dimensional laser range finder data and two-dimensional camera da... | Multisensor kernel system; Spatial proximity graphs | 1984 |
20 |
|
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E. | Formalizing the Java Memory Model for multithreaded program correctness and optimization | Standardized language level support for threads is one of the most important features of Java. However, defining and understanding the Java Memory Model (JMM) has turned out to be a big challenge. Several models produced to date are not as easily comparable as first thought. Given the growing inte... | Java Memory Model; JMM; Multithreaded program | 2002-04-02 |
21 |
|
Gopalakrishnan, Ganesh | A partial order reduction algorithm without the Proviso | This paper presents a partial order reduction algorithm, called Two phase, that preserves stutter free LTL properties. Two phase dramatically reduces the number of states visited compared to previous partial order reduction algorithms on most practical protocols. The reason can be traced to a step o... | Order reduction algorithm; Proviso step | 1998 |
22 |
|
Gopalakrishnan, Ganesh; Kirby, Robert Michael II | Runtime model checking of multithreaded C/C++ programs | We present inspect, a tool for model checking safety prop- erties of multithreaded C/C++ programs where threads in- teract through shared variables and synchronization primi- tives. The given program is mechanically transformed into an instrumented version that yields control to a centralized s... | Dynamic partial order reduction; Multithreaded; C/C++; Runtime model checking | 2007 |
23 |
|
Hansen, Charles D.; Hollerbach, John M. | Improved calibration Framework for electromagnetic tracking devices | Electromagnetic trackers have many favorable characteristics but are notorious for their sensitivity to magnetic field distortions resulting from metal and electronic equipment in the environment. We categorize existing tracker calibration methods and present an improved technique for reducing stati... | Electromagnetic tracking; Tracking devices | 2001 |
24 |
|
Gu, Jun | Structured, technology independent VLSI design | Rapid advancement in new semiconductor technologies has created a need for the design of existing integrated circuits using these new technologies. These new technologies are required to provide improved performance, smaller feature sizes and lower costs. The conversion of an integrated circuit fro... | VLSI design; semiconductor technologies | 1989 |
25 |
|
Thompson, Cynthia A. | A personalized system for conversational recommendations | Increased computing power and theWeb have made information widely accessible. In turn, this has encouraged the development of recommendation systems that help users find items of interest, such as books or restaurants. Such systems are more useful when they personalize themselves to each user?s p... | Adaptive Place Advisor; Recommendation systems | 2002-06-26 |