| Substructural Logical Specifications |
14 Nov 2012 |
318 pages |
| Authors:
Robert J Simmons; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
|
 | A logical framework and its implementation should serve as a flexible tool for specifying, simulating, and reasoning about formal systems. When the formal systems we are interested in exhibit state and concurrency, however, existing logical frameworks fall short of this goal. Logical frameworks based on a rewriting interpretation of substructural logics, ordered and linear logic in particular, can help. To this end, this dissertation introduces and demonstrates four methodologies for ... |
|
| Nanotechnology Research |
Oct 2012 |
36 pages |
| Authors:
Joseph E Van Nostrand; AIR FORCE RESEARCH LAB ROME NY INFORMATION DIRECTORATE
|
| This effort explored research and development, and deployment opportunities in the emerging disciplines of nanoscience, nanoengineering, and nanobioscience, for advanced computing architectures. The effort consisted of a multiyear, multidisciplinary effort focusing on research and development of nanocomputers systems utilizing alternative nanotechnology processing approaches that can deliver revolutionary computational capabilities crucial to maintaining technological progress. This research involved both modeling and simulations, as well as fabrication and test of prototype nanocomputing ... |
|
| A Theory of Structured Change |
29 Jun 2012 |
21 pages |
| Authors:
Martin Erwig; OREGON STATE UNIV CORVALLIS SCHOOL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
|
| This project has developed a theoretical framework for describing and reasoning about changes in software. The theory provides a basis for the implementation of tools to support software maintenance tasks in the presence of changes. Specific contributions include the choice calculus, a formalism for representing variation and changes in structured documents. The choice calculus offers laws and transformation rules that make variation representations flexible. A design theory for the choice ... |
|
| Logic and Lattices for Distributed Programming |
22 Jun 2012 |
18 pages |
| Authors:
Neil Conway; William R Marczak; Peter Alvaro; Joseph M Hellerstein; David Maier; CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
|
| In recent years there has been interest in achieving application level consistency criteria without the latency and availability costs of strongly consistent storage infrastructure. A standard technique is to adopt a vocabulary of commutative operations this avoids the risk of inconsistency due to message reordering. A more powerful approach was recently captured by the CALM theorem, which proves that logically monotonic programs are guaranteed to be eventually consistent. In logic ... |
|
| MELD: A Logical Approach to Distributed and Parallel Programming |
Mar 2012 |
36 pages |
| Authors:
Seth C Goldstein; Flavio Cruz; CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
|
| With the industry-wide shift to multi-core processors and the rise of large-scale clusters as the engines for web services, it is clear that the future is all about exploiting parallelism. Unfortunately, writing parallel or concurrent software has long been a notoriously difficult task for programmers. In particular, the goals of maintaining correctness while also achieving high performance are far more challenging in a parallel or concurrent environment compared with a ... |
|
| Extending Bayesian Logic Programs for Plan Recognition and Machine Reading |
MAY 2011 |
38 pages |
| Authors:
Sindhu V. Raghavan; TEXAS UNIV AT ARLINGTON DEPT OF COMPUTER SCIENCE
|
| Statistical relational learning (SRL) is the area of machine learning that integrates both first-order logic and probabilistic graphical models. The advantage of these formalisms is that they can handle both uncertainty and structured/relational data. As a result, they are widely used in domains like social network analysis, biological data analysis, and natural language processing. Bayesian Logic Programs (BLPs), which integrate both first-order logic and Bayesian networks are a powerful SRL ... |
|
| New Approaches for Difference Constraint Systems |
Oct 2010 |
7 pages |
| Authors:
K Subramani; WEST VIRGINIA UNIV RESEARCH CORP MORGANTOWN
|
| In this report we summarize our contributions over the period 2006-2010. The principal objective of our work is the design, development and analysis of fundamentally new techniques for the problem of solving conjunctions of difference constraints. This problem is well-known to be equivalent to the problem of checking whether a directed graph (network) with positive and negative weights on its edges has a negative cost cycle (NCCD). The NCCD problem ... |
|
| Security Primitives for Reconfigurable Hardware-Based Systems |
MAY 2010 |
36 pages |
| Authors:
Ted Huffmire; Timothy Levin; Thuy Nguyen; ynthia Irvine; Brett Brotherton; Gang Wang; Timothy Sherwood; Ryan Kastner; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| Computing systems designed using reconfigurable hardware are increasingly composed using a number of different Intellectual Property (IP) cores, which are often provided by third-party vendors that may have different levels of trust. Unlike traditional software where hardware resources are mediated using an operating system, IP cores have fine-grain control over the underlying reconfigurable hardware. To address this problem, the embedded systems community requires novel security primitives that address the realities ... |
|
| Enhanced Specification and Verification for Timed Planning |
28-Feb-2009 |
34 pages |
| Authors:
Jin S Dong; Xian Zhang; Jun Sun; NATIONAL UNIV OF SINGAPORE
|
| In this project, the PI introduced a specification language named Timed Planning, which is an extension of Timed CSP with the capability of stating more complicated timing behaviors for processes and events. They also developed a reasoning mechanism for Timed Planning based on Constraint Logic Programming. They model the Pearl Harbor Attack plan to demonstrate the capability of their approach for modeling time based military plans with critical timing constraints. ... |
|
| Floating-Point Numerical Function Generators Using EVMDDs for Monotone Elementary Functions |
Jan 2009 |
|
| Authors:
Shinobu Nagayama; Tsutomu Sasao; Jon T Butler; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
|
| This paper proposes a design method for floating-point numerical function generators (NFGs) using multi-valued decision diagrams (MDDs). Our method applies to monotone elementary functions in which real values are converted into integer values that are represented by edge-valued MDDs (EVMDDs). We show that EVMDDs use fewer nodes by one or two orders of magnitude than two other types of decision diagrams, MTBDDs and BMDs. EVMDDs produce fast and compact floating-point ... |
|
| Towards Trustable Embedded Systems: Hardware Threat Modeling for Integrated Circuits |
28-Oct-2008 |
21 pages |
| Authors:
Jia Di; ARKANSAS UNIV FAYETTEVILLE BOARD OF TRUSTEES
|
| As integrated circuits become more complex, it becomes easier to hide malicious logic constructs within a design. Security-conscious hardware designers require a way to detect such logic embedded in Third Party IP blocks used by their designs. The aim of this project was to develop a systematic way to detect attacks implemented in a design. Using the Java programming language, a tool capable of producing an attacker-centric threat model was ... |
|
| Exploration of a Research Roadmap for Application Development and Execution on Field-Programmable Gate Array (FPGA)-Based Systems |
Oct-2008 |
45 pages |
| Authors:
Tarek El-Ghazawi; Nahid Alam; Greg Stitt; Melissa Smith; Proshanta Saha; Saumil Merchant; Herman Lam; Ivan Gonzalez; Alan D George; Esam El-Araby; GEORGE WASHINGTON UNIV WASHINGTON DC
|
| FPGA-based reconfigurable computing (RC) technology has been widely used by the DoD community to exploit performance, power, area, cost, and versatility. Significant challenges, however, remain in application development tools and design methodologies. This study focuses on investigating key challenges and limitations of FPGA tools, and identifying and assessing potential solutions and research areas. The investigation included three major tasks: a) survey of use cases and the state of existing tools; ... |
|
| Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage |
01-Sep-2008 |
11 pages |
| Authors:
Paul Farrell; Simson L Garfinkel; Douglas White; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Meanwhile the value of these sets for eliminating the need to analyze "known goods" has decreased as hard drives have dramatically increased in storage capacity. This paper evaluates the use of Bloom filters (BFs) to distribute the National Software Reference ... |
|
| Normative Interaction Specifications for C2: A Comprehensive Type of Rule Models for Use in the Model Driven Architecture Framework |
21-May-2008 |
|
| Authors:
Francisco Loaiza; Steve Wartik; INSTITUTE FOR DEFENSE ANALYSES ALEXANDRIA VA
|
 | Modeling languages such as UML and IDEF1-X provide only partial coverage for the relations and constraints that apply to information within a given domain of interest. In most cases additional textual narratives are required to capture the full set of pertinent business rules. The Semantics of Business Vocabulary and Business Rules Specification (SBVR), an OMG adopted specification, offers an alternative to traditional information modeling with vastly more powerful capabilities and ... |
|
| Distributed System Security via Logical Frameworks (SeLF) |
14 JAN 2008 |
|
| Authors:
Lujo Bauer; Frank Pfenning; Michael Reiter; Kaustav Chaudhuri; Deepak Garg; Scott Garriss; Jon McCune; Ruy Ley-Wild; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
|
| We conducted a research program with the goal of advancing security in distributed systems via the application of logical frameworks. Our work targeted multiple facets of the life-cycle of a distributed system, ranging from design through execution, and from sound mechanism design through sound policy enforcement. It consisted of three major interconnected thrusts. First, we investigated how to exploit existing technologies to mechanically reason about security policies as specified in ... |
|
| Revising Distributed UNITY Programs is NP-Complete |
01-Jan-2008 |
14 pages |
| Authors:
Borzoo Bonakdarpour; Sandeep S Kulkarni; MICHIGAN STATE UNIV EAST LANSING DEPT OF COMPUTER SCIENCE/ENGINEERING
|
| We focus on automated revision techniques for adding Unity properties to distributed programs. We show that unlike centralized programs where multiple safety properties and one progress property can be added in polynomial-time, addition of a safety or a progress Unity property to distributed programs is significantly more difficult. Precisely, we show that such addition is NP-complete in the size of the given program's state space. We also propose an efficient ... |
|
| Language-Based Security for Malicious Mobile Code |
30 SEP 2007 |
19 pages |
| Authors:
Fred B. Schneider; CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE
|
| Classical operating system architecture provides support for only a limited class of coarse-grained security policies. Furthermore, system software has grown too large and complicated to be considered trustworthy. To address these shortcomings, we have explored the application of programming language technology, including advanced type-systems, proof systems, analyses, and compilers for realizing new classes of security policies and for reducing or relocating the trusted computing base. |
|
| Certified Binaries for Software Components |
SEP 2007 |
|
| Authors:
Sagar Chaki; James Ivers; Peter Lee; Kurt Wallnau; Noam Zeilberger; CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INST
|
| Proof-carrying code (PCC) and certifying model checking (CMC) are two established paradigms for obtaining objective confidence in the runtime behavior of a program. PCC enables the certification of low-level binary code against relatively simple (e.g., memory-safety) policies. In contrast, CMC provides a way to certify a richer class of temporal logic policies, but is typically restricted to high-level (e.g., source) code. In this report, an approach is presented to certify ... |
|
| Modifiability Tactics |
SEP 2007 |
|
| Authors:
Felix Bachmann; Len Bass; Robert Nord; CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INST
|
| An architectural tactic is a design decision that affects how well a software architecture addresses a particular quality attribute. This report describes how tactics are based on the parameters of quality attribute models. Tactics provide an architectural means of adjusting those parameters, which, in turn, can improve the quality-attribute-specific behavior of the resulting system. This report justifies the tactics for modifiability, using established concepts of coupling, cohesion, and cost motivations ... |
|
| Mixed-Initiative Development of Plans With Expressive Temporal Constraints |
14 JUN 2007 |
16 pages |
| Authors:
Martha E. Pollack; MICHIGAN UNIV ANN ARBOR DIV OF RESEARCH DEVELOPMENT AND ADMINISTRATION
|
| The overall objective of this project was die development of methods for efficiently finding solutions to problems that consist of sets of expressive constraints including both overconstrained and underconstrained situations. In either case, constraint management is necessary: in an overconstrained situation, it is necessary to determine how best to relax existing constraints so that a solution can be computed, while in an underconstrained situation, it is necessary to select good ... |
|
| A Linux Implementation of Temporal Access Controls |
01-Jun-2007 |
9 pages |
| Authors:
Cynthia E Irvine; Ken Chiang; Thuy D Nguyen; NAVAL POSTGRADUATE SCHOOL MONTEREY CA CENTER FOR INFORMATION SYSTEMS SECURITY STUDIES AND RESEARCH
|
| Control of access to information based upon temporal attributes can add another dimension to access control. To demonstrate the feasibility of operating system-level support for temporal access controls, the Time Interval File Protection System (TIFPS), a prototype of the Time Interval Access Control (TIAC) model, has been implemented by modifying Linux extended attributes to include temporal metadata associated both with files and users. The Linux Security Module was used to ... |
|
| Equational Abstractions |
01-Jan-2007 |
37 pages |
| Authors:
Jose Meseguer; Miguel Palomino; Narciso Marti-Oliet; ILLINOIS UNIV AT URBANA-CHAMPAIGN DEPT OF COMPUTER SCIENCE
|
| Abstraction reduces the problem of whether an infinite state system satisfies a temporal logic property to model checking that property on a finite state abstract version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the minimal quotient system together with a set of proof obligations that guarantee ... |
|
| Semantics and Pragmatics of Real-Time Maude |
01-Jan-2007 |
36 pages |
| Authors:
Peter C Olveczky; Jose Meseguer; OSLO UNIV (NORWAY) DEPT OF INFORMATICS
|
| At present, designers of real-time systems face a dilemma between expressiveness and automatic verification: if they can specify some aspects of their system in some automaton-based formalism, then automatic verification is possible; but more complex system components may be hard or impossible to express in such decidable formalisms. These more complex components may still be simulated; but there is then little support for their formal analysis. The main goal of ... |
|
| Reading to Learn |
30 JUN 2006 |
34 pages |
| Authors:
David J. Israel; Peter E. Clark; Phil Harrison; John Thompson; Rick Wojcik; Tom Jenkins; SRI INTERNATIONAL MENLO PARK CA
|
| One of the most important methods by which human beings learn is by reading, a task that includes integrating what was read with existing, prior knowledge. While in its full generality, the reading task is still too difficult a capability to be implemented in a computer, significant (if partial) approaches to the task are now feasible. Our goal in this project was to study issues and develop solutions for this ... |
|
| Observer Design for a Class of MIMO Nonlinear Systems (Preprint) |
JUN 2006 |
9 pages |
| Authors:
Hao Lei; Jianfeng Wei; Wei Lin; R.M. Kolacinski; CASE WESTERN RESERVE UNIV CLEVELAND OH DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES
|
| Under the boundedness and observability conditions, we present a globally convergent observer for a class of multi-output nonlinear systems which covers the block-triangular observer forms studied previously in the literature. The result presented in this paper incorporates and generalizes the earlier work on the observer design for single-output observable systems. Extensions to detectable systems and controlled systems are also considered. Examples are given to illustrated the validity of proposed method. ... |
|
| Information-Based Security Protocols for Ideal Agents |
10 FEB 2006 |
101 pages |
| Authors:
Hans-Pieter van Ditmarsch; OTAGO UNIV DUNEDIN (NEW ZEALAND)
|
| The objective to model check properties of protocols for card playing agents has been met. Beyond the objectives we are pleased to report that we have made a state-of-the-art comparison of epistemic model checkers. We have paid some attention to other protocols, namely different generalizations of card playing protocols. We applied model checking tools to a rather different protocol (that has the form of a riddle about natural numbers). We ... |
|
| SAT-Based Software Certification |
FEB 2006 |
|
| Authors:
Sagar Chaki; CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INST
|
| This report formalizes a notion of witnesses as the basis of certifying the correctness of software. The first part of the report is concerned with witnesses for the satisfaction of linear temporal logic specifications by infinite state programs and shows how such witnesses may be constructed via predicate abstraction and validated by generating and proving verification conditions. In addition, the first part of the report proposes the use of theorem ... |
|
| Steps Toward the Alignment of Complementary Lexical Resources and Knowledge Databases |
JAN 2006 |
19 pages |
| Authors:
INTERNATIONAL COMPUTER SCIENCE INST BERKELEY CA
|
|
| Representing Web Service Policies in OWL-DL |
2006 |
16 pages |
| Authors:
Vladimir Kolovski; Bijan Parsia; Yarden Katz; James Hendler; MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER STUDIES
|
| Recently, there have been a number of proposals for languages for expressing web service constraints and capabilities, with WS-Policy and WSPL leading the way. The proposed languages, although relatively inexpressive, suffer from a lack of formal semantics. In this paper, we provide a mapping of WS-Policy to the description logic fragment species of the Web Ontology Language (OWL-DL), and describe how standard OWL-DL reasoners can be used to check policy ... |
|
| Embedded Diagnostic/Prognostic Reasoning and Information Continuity for Improved Avionics Maintenance |
2006 |
11 pages |
| Authors:
Carl S. Byington; Patrick W. Kalgren; Robert Johns; Richard J. Beers; IMPACT TECHNOLOGIES LLC STATE COLLEGE PA
|
| The authors are developing enhanced onboard and at-wing diagnostic technologies applicable to both legacy and new avionics. The paper identifies onboard information sources and automated reasoning techniques that build upon existing Built-in-Test (BIT) results to improve fault isolation accuracy. Modular software and data elements that combine BIT with contextual information, component usage models, and novel reasoning techniques are described. In addition, the authors identify candidate avionics component applications to implement ... |
|
| Integrated Mission Specification and Task Allocation for Robot Teams - Part 1: Design and Implementation |
2006 |
9 pages |
| Authors:
Patrick Ulam; Yochiro Endo; Alan Wagner; Ronald Arkin; GEORGIA INST OF TECH ATLANTA COLL OF COMPUTING
|
| As the capabilities, range of missions, and the size of robot teams increase, the ability for a human operator to account for all the factors in these complex scenarios can become exceedingly difficult. Our previous research has studied the use of case-based reasoning (CBR) tools to assist a user in the generation of multi-robot missions. These tools, however, typically assume that the robots available for the mission are of the ... |
|
| Integrated Mission Specification and Task Allocation for Robot Teams - Part 2: Testing and Evaluation |
2006 |
7 pages |
| Authors:
Patrick Ulam; Yochiro Endo; Alan Wagner; Ronald Arkin; GEORGIA INST OF TECH ATLANTA COLL OF COMPUTING
|
| This work presents the evaluation of two mission specification and task allocation architectures. These architectures, described in part 1 of this paper, present novel means with which to integrate a case-based reasoning (CBR) mission planner with contract net protocol (CNP) based task allocation. In the first design, the CBR and runtime-CNP architecture, the case-based mission planner generates mission plans that support necessary behaviors for CNP-based task allocation and execution. In ... |
|
| Analyzing Tabular Requirements Specifications Using Infinite State Model Checking |
2006 |
11 pages |
| Authors:
Tevfik Bultan; Constance Heitmeyer; NAVAL RESEARCH LAB WASHINGTON DC INFORMATION TECHNOLOGY DIV
|
| This paper investigates the application of infinite state model checking to the formal analysis of requirements specifications in the SCR (Software Cost Reduction) tabular notation using Action Language Verifier (ALV). After reviewing the SCR method and tools and the Action Language, experimental results are presented of formally analyzing two SCR specifications using ALV. The application of ALV to verify or falsify (by generating counterexamples) the state and transition invariants of ... |
|
| Analysis of TLCharts for Weapon Systems Software Development |
DEC 2005 |
107 pages |
| Authors:
Kadir A. Demir; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| The success of formal specifications and reactive systems is highly dependant on the formal specification language being used. To date, the most common approach to this problem involves two activities: (i) the specification activity, where correctness properties are specified, and (ii) verification activity, where the system under review is proven to satisfy those properties. Typically, some form of temporal logic or regular expression language is used to specify the correctness ... |
|
| Aerospace Sensor Component and Subsystem Investigation and Innovation-2 Component Exploration and Development (ASCII-2 CED). Delivery Order 0005: Reconfigurable Processing With Bio-Inspired Embedded Systems On A Chip |
OCT 2005 |
56 pages |
| Authors:
Hoda S. Abdel-Aty-Zohdy; SYSTRAN FEDERAL CORP DAYTON OH
|
| The idea of exploring the multidimensional characteristics biocomputing deals with involves a multilevel protein logic interaction with hybrid analog and digital systems (bio/digital/analog systems). In the protein biocomputing world, all models are nonlinear exponential in nature. These nonlinear systems are linearized by boundary limited frequency, time response and dimensional ranges. The protein model and its correct development is probably the most difficult aspect for biocomputing issues. These future computing devices ... |
|
| Building Certified Libraries for PCC: Dynamic Storage Allocation |
31 AUG 2005 |
23 pages |
| Authors:
Dachuan Yu; Nadeem A. Hamid; Zhong Shao; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| Proof-Carrying Code (PCC) allows a code producer to provide to a host a program along with its formal safety proof. The proof attests a certain safety policy enforced by the code, and can be mechanically checked by the host. While this language-based approach to code certification is very general in principle, existing PCC systems have only focused on programs whose safety proofs can be automatically generated. As a result, many ... |
|
| Command and Control Autonomous UxV's |
JUN 2005 |
18 pages |
| Authors:
Chad Hawthorne; Dave Scheidt; JOHNS HOPKINS UNIV LAUREL MD APPLIED PHYSICS LAB
|
| The future unmanned battlespace will contain heterogeneous swarms of autonomous air and ground platforms. A significant hurdle in enabling a heterogeneous swarm is the ability to move the algorithms developed in simulation environments onto real-world unmanned vehicles (UxV's). The Applied Physics Lab has developed the Robotic Algorithm and Communications Environment (RACE), a platform independent behavior-based algorithm framework that supports air and ground vehicle hardware interfaces to enable swarms of unmanned ... |
|
| Systemic Operational Design: An Introduction |
26 MAY 2005 |
107 pages |
| Authors:
William T. Sorrells; Glen R. Downing; Paul J. Blakesley; David W. Pendall; Jason K. Walk; Richard D. Wallwork; ARMY COMMAND AND GENERAL STAFF COLL FORT LEAVENWORTH KS SCHOOL OF ADVANCED MILITARY STUDIES
|
| Systemic Operational Design (SOD) is an application of systems theory to operational art. It is an attempt to rationalize complexity through systemic logic employing a holistic approach that translates strategic direction and policy into operational level designs. SOD focuses upon the relationships between entities within a system to develop rationale for systemic behaviors that accounts for the logic of the system, facilitating a cycle of design, plan, act, and learn. ... |
|
| A Meta-Model Architecture for Fusing Battlefield Information |
MAY 2005 |
46 pages |
| Authors:
Patrick J. Driscoll; Steven J. Henderson; MILITARY ACADEMY WEST POINT NY DEPT OFSYSTEM ENGINEERING
|
| The principal contributions of this study are four-fold. First, we propose and illustrate a unifying meta-model architecture for fusing information in sensor-based decision support systems capable of delivering to the user strong inference results in support of tactical decision-making. Second, we demonstrate the feasibility of a completely automated system performing simulation. Third, we show that this architecture can readily accommodate several major network inference methods that are designed to handle ... |
|
| Model Problems in Technologies for Interoperability: Model-Driven Architecture |
MAY 2005 |
|
| Authors:
Grace A. Lewis; Lutz Wrage; CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INST
|
| Model-driven architecture (MDA) is a technology produced and maintained by the Object Management Group (OMG), an open membership, not-for-profit consortium that produces and maintains computer industry specifications for interoperable enterprise applications. This technical note examines two claims regarding the benefits of MDA: that it (1) reduces development time, and (2) allows the developer to focus on business logic rather than on details about target platform and architecture. Such advantages would ... |
|
| Sensor Integration and Context Detection in Intelligent Systems |
MAY 2005 |
11 pages |
| Authors:
Anton Vitko; Michal Savel; Dusan Kameniar; Jurisica Ladislav; SLOVAK TECHNICAL UNIV BRATISLAVA (CZECHOSLOVAKIA)
|
| Sensor data integration into a more information-rich structure that reflects both the system state of and the state of its environment i.e. context information is a subject of the intensive study in military applications. Endowing an object with the ability of grasping context information is one of the prior prerequisite of its autonomous operability. An autonomously operating system, be it a terrestrial mobile machine or UAV, is required to respond ... |
|
| Morphable Computer Architectures for Highly Energy Aware Systems |
OCT 2004 |
45 pages |
| Authors:
Peter Kogge; Vincent Freeh; Jay Brockman; Kanao Ghose; Nikzad Toomarian; NOTRE DAME UNIV IN DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
|
| To achieve a revolutionary reduction in overall power consumption, computing systems must be constructed out of both inherently low-power structures and power-aware or energy-aware hardware and software subsystems. Today's most prevalent practices involve simple frequency scaling and modes where subsystems are merely powered on or off as needed. The energy expended per computational event is not as adjustable, even when lower than peak performance is acceptable. This is true as ... |
|
| An Expressive Verification Framework for State/Event Systems |
01-Jun-2004 |
18 pages |
| Authors:
Edmund Clarke; Natasha Sharygina; Sagar Chaki; Joel Ouaknine; Orna Grumberg; Tayssir Touili; Helmut Veith; CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
|
| Specification languages for concurrent software systems need to combine practical algorithmic efficiency with high expressive power and the ability to reason about both states and events. We address this question by defining a new branching-time temporal logic SE-A(OMEGA) which integrates both state-based and action-based properties. SE-A(OMEGA) is universal, i.e., preserved by the simulation relation, and thus amenable to counterexample-guided abstraction refinement. We provide a model-checking algorithm for this logic, and ... |
|
| Stochastic Language Generation in a Dialogue System: Toward a Domain Independent Generator |
2004 |
11 pages |
| Authors:
Nathanael Chambers; James Allen; FLORIDA INSTITUTE FOR HUMAN AND MACHINE COGNITION INC PENSACOLA FL
|
| Until recently. surface generation in dialogue systems has served the purpose of simply providing a backend to other areas of research. The generation component of such systems usually consists of templates and canned text, providing inflexible, unnatural output. To make matters worse, the resources are typically specific to the domain in question and not portable to new tasks. In contrast, domain-independent generation systems typically require large grammars, full lexicons, complex ... |
|
| Benchmarking and Analysis of the SRC-6E Reconfigurable Computing System |
DEC 2003 |
149 pages |
| Authors:
Kendrick R. Macklin; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| This thesis evaluates the usefulness of the SRC-6E re- configurable computing system for a radar signal processing application and documents the process of creating and importing VHDL code to configure the user definable logic on the SRC-6E. A false-target radar-imaging algorithm was chosen and implemented on the SRC-6E. Data from alternative computational approaches to the same problem are compared to determine the effectiveness of SRC-6E solution. The results show that ... |
|
| From PM to Petaflops Computing, MIND: Scalable Embedded Computing through Advanced Processor in Memory |
21 MAY 2003 |
37 pages |
| Authors:
Thomas Sterling; CALIFORNIA INST OF TECH PASADENA JET PROPULSION LAB
|
|
| Programming High Performance Reconfigurable Computers (HPRC) |
JAN 2003 |
74 pages |
| Authors:
Gregory D. Peterson; CACI TECHNOLOGIES INC CHANTILLY VA
|
| The integration of High Performance Computing with Reconfigurable Computing offers great potential for increased performance and flexibility for a wide range of computing problems. High Performance Computing architectures and Reconfigurable Computing systems have independently demonstrated performance advantages for applications such as digital signal processing and pattern recognition. By exploiting the near hardware specific speed of Reconfigurable Computing systems incorporated into a computer cluster, there is potential for significant performance advantages ... |
|
| A Current Logical Framework: The Propositional Fragment |
2003 |
|
| Authors:
Kevin Watkins; Iliano Cervesato; Frank Pfenning; David Walker; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
|
| We present the propositional fragment CLF of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a logical point of ... |
|
| Design and Implementation of an Intelligent Primitive Driver |
2003 |
85 pages |
| Authors:
Jr Vinch Peter M.; FLORIDA UNIV GAINESVILLE CENTER FOR INTELLIGENT MACHINES AND ROBOTICS
|
| An Intelligent Primitive Driver (IPD) was designed to supplement the control of a Primitive Driver component that is defined in the Department of Defense Joint Architecture for Unmanned Systems (JAUS). Whereas the Primitive Driver component accepts and blindly executes wrench commands, the IPD uses various subsystems to provide it with the necessary information to make low-level decisions concerning vehicle control. The IPD is accessible by either an onboard autonomous control ... |
|
| Metareasoning for More Effective Human-Computer Dialogue |
31 DEC 2002 |
8 pages |
| Authors:
Don Perlis; Mike Anderson; MARYLAND UNIV COLLEGE PARK
|
| The research project explores specific meta-dialogue behaviors in terms of both how a system could be made to perform them, and to what extent they can increase overall system performance. We focus on two types of meta- dialogue capabilities: ability to detect and recover from anomalous dialogue patterns in simple exchanges, and on-line extensions or changes to working vocabulary. Our main method involves detailed representation of the dialogue context, separating ... |
|
Reports by Keyword(s)
COMPUTER LOGIC
