• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,804
Next 10 →

A task-analytic approach to the automated design of graphic presentations

by Stephen M. Casner - ACM Transactions on Graphics , 1991
"... BOZ is an automated graphic design and presentation tool that designs graphics based on an analysis of the task for which a graphic is intended to support. When designing a graphic, BOZ aims to optimize two ways in which graphics help expedite human performance of information-processing tasks: (1) a ..."
Abstract - Cited by 165 (1 self) - Add to MetaCart
BOZ is an automated graphic design and presentation tool that designs graphics based on an analysis of the task for which a graphic is intended to support. When designing a graphic, BOZ aims to optimize two ways in which graphics help expedite human performance of information-processing tasks: (1

Automated Extraction and Parameterization of Motions in Large Data Sets

by Lucas Kovar - ACM Transactions on Graphics , 2004
"... Large motion data sets often contain many variants of the same kind of motion, but without appropriate tools it is difficult to fully exploit this fact. This paper provides automated methods for identifying logically similar motions in a data set and using them to build a continuous and intuitively ..."
Abstract - Cited by 183 (2 self) - Add to MetaCart
Large motion data sets often contain many variants of the same kind of motion, but without appropriate tools it is difficult to fully exploit this fact. This paper provides automated methods for identifying logically similar motions in a data set and using them to build a continuous and intuitively

Exploratory and confirmatory factor analysis: Understanding concepts and applications

by Bruce Thompson , 2004
"... provides a concise (162 pages of text) and basic overview of two disciplines of assessing structure: exploratory factor analysis (EFA) and confirmatory factor analysis (CFA). As Thompson explains, the book was written ‘‘to strike a happy medium between accuracy and completeness versus over-whelming ..."
Abstract - Cited by 239 (0 self) - Add to MetaCart
wanting a more detailed discussion of principal axis factor analysis (PAF). The book consists of 12 chapters. Chapter 1 provides a very brief introduction to both EFA and CFA. The purposes of factor-analytic methods are succinctly presented, and the importance of theory when employing CFA is emphasized

Generalized Symbolic Execution for Model Checking and Testing

by Sarfraz Khurshid, Corina S. Pasareanu, Willem Visser , 2003
"... Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based ap ..."
Abstract - Cited by 232 (52 self) - Add to MetaCart
Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based

Generic Global Placement and Floorplanning

by Hans Eisenmann, Frank M. Johannes , 1998
"... We present a new force directed method for global placement. Besides the well-known wire length dependent forces we use additional forces to reduce cell overlaps and to consider the placement area. Compared to existing approaches, the main advantage is that the algorithm provides increased flexibili ..."
Abstract - Cited by 203 (5 self) - Add to MetaCart
We present a new force directed method for global placement. Besides the well-known wire length dependent forces we use additional forces to reduce cell overlaps and to consider the placement area. Compared to existing approaches, the main advantage is that the algorithm provides increased

Automated Detection of Vulnerabilities in Privileged Programs by Execution Monitoring

by Calvin Ko, George Fink, Karl Levitt - In Proceedings of the 10th Annual Computer Security Applications Conference , 1994
"... We present a method for detecting exploitations of vulnerabilities in privileged programs by monitoring their execution using audit trials, where the monitoring is with respect to specifications of the security-relevant behavior of the programs. Our work is motivated by the intrusion detection parad ..."
Abstract - Cited by 143 (5 self) - Add to MetaCart
We present a method for detecting exploitations of vulnerabilities in privileged programs by monitoring their execution using audit trials, where the monitoring is with respect to specifications of the security-relevant behavior of the programs. Our work is motivated by the intrusion detection

Automating Recursive Type Definitions in Higher Order Logic

by Thomas Melham - Current Trends in Hardware Verification and Automated Theorem Proving , 1988
"... : The expressive power of higher order logic makes it possible to define a wide variety of types within the logic and to prove theorems that state the properties of these types concisely and abstractly. This paper contains a tutorial introduction to the logical basis for such type definitions. Examp ..."
Abstract - Cited by 81 (6 self) - Add to MetaCart
. Examples are given of the formal definitions in logic of several simple types. A method is then described for systematically defining any instance of a certain class of commonly-used recursive types. The automation of this method in HOL, an interactive system for generating proofs in higher order logic

Analytic Methods for the Logic of Proofs

by Marcelo Finger
"... The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this closeness with S4 and contain rules whose analycity is not immediately evident. We study possible formulations of analytic tab ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this closeness with S4 and contain rules whose analycity is not immediately evident. We study possible formulations of analytic

Tree-sequent methods for subintuitionistic predicate logics, in: Automated reasoning with analytic tableaux and related methods

by Ryo Ishigaki, Kentaro Kikuchi - Lecture Notes in Comput. Sci. 4548 , 2007
"... Abstract. Subintuitionistic logics are a class of logics dened by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After pro ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Subintuitionistic logics are a class of logics dened by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After

Spatial Reasoning with Propositional Logics

by Brandon Bennett - Principles of Knowledge Representation and Reasoning: Proceedings of the 4th International Conference (KR94 , 1994
"... I present a method for reasoning about spatial relationships on the basis of entailments in propositional logic. Formalisms for representing topological and other spatial information (e.g. [2] [10] [11]) have generally employed the 1st-order predicate calculus. Whilst this language is much more expr ..."
Abstract - Cited by 111 (16 self) - Add to MetaCart
I present a method for reasoning about spatial relationships on the basis of entailments in propositional logic. Formalisms for representing topological and other spatial information (e.g. [2] [10] [11]) have generally employed the 1st-order predicate calculus. Whilst this language is much more
Next 10 →
Results 1 - 10 of 2,804
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University