Results 1  10
of
253
Symmetry of Information: A Closer Look
"... Symmetry of information establishes a relation between the information that x has about y (denoted I(x: y)) and the information that y has about x (denoted I(y: x)). In classical information theory, the two are exactly equal, but in algorithmical information theory, there is a small excess quantity ..."
Abstract
 Add to MetaCart
), the relevant information can be packed in a very economical way, which leads to a tighter relation between I(x: y) and I(y: x) than the one provided in the classical symmetryofinformation theorem of Kolmogorov and Levin. We give here a simpler proof of this result. This result implies a van Lambalgen
A closer look at pki: Security and efficiency
 In proceedings of PKC ’07, LNCS series
, 2007
"... In this paper we take a closer look at the security and efficiency of publickey encryption and signature schemes in publickey infrastructures (PKI). Unlike traditional analyses which assume an “ideal” implementation of the PKI, we focus on the security of joint constructions that consider the cert ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
In this paper we take a closer look at the security and efficiency of publickey encryption and signature schemes in publickey infrastructures (PKI). Unlike traditional analyses which assume an “ideal” implementation of the PKI, we focus on the security of joint constructions that consider
A closer look at tracking human and computer interactions in webbased communications
 International Journal of Interactive Technology and Smart Education
, 2008
"... Keeping track of user’s communication activities in Webbased environments has always been considered a complex task. It requires tracking systems that are capable of efficiently tracking users ’ activities and producing tracking data that can be useful to various users. The objectives of this paper ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of this paper are twofold: (i) to present an approach for better observing the different levels of Human & Computer Interactions during a Computer Mediated Communication activity, and (ii) to present the technical aspects of a Webbased tracking system for communication tools such as discussion forums. Our
A closer look at lattice points in rational simplices
 Electronic J. Comb
, 1999
"... Abstract. We generalize Ehrhart’s idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an ndimensional polytope with n + 1 rational vertices, we use its description as the intersection of n + 1 halfspaces, which determine the facets of the simplex ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We give an elementary proof that the lattice point counts in the interior and closure of such a vectordilated simplex are quasipolynomials satisfying an Ehrharttype reciprocity law
STUDENTS ’ PROOF SCHEMES: A CLOSER LOOK AT WHAT CHARACTERIZES STUDENTS ’ PROOF CONCEPTIONS
"... The guiding theoretical principle in this study is the notion that the process of producing a mathematical proof can be viewed as similar to the process of solving a mathematical problem. Undergraduate students with different proof schemes were interviewed while attempting to construct proofs and th ..."
Abstract
 Add to MetaCart
The guiding theoretical principle in this study is the notion that the process of producing a mathematical proof can be viewed as similar to the process of solving a mathematical problem. Undergraduate students with different proof schemes were interviewed while attempting to construct proofs
Using machine learning to break visual human interaction proofs (HIPs
 Advances in Neural Information Processing Systems 17, Neural Information Processing Systems (NIPS’2004
, 2004
"... Machine learning is often used to automatically solve human tasks. In this paper, we look for tasks where machine learning algorithms are not as good as humans with the hope of gaining insight into their current limitations. We studied various Human Interactive Proofs (HIPs) on the market, because t ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
Machine learning is often used to automatically solve human tasks. In this paper, we look for tasks where machine learning algorithms are not as good as humans with the hope of gaining insight into their current limitations. We studied various Human Interactive Proofs (HIPs) on the market, because
Walton Final Proof.pdf
"... To understand the difficulty of defining the term 'culture' and appreciate the multidisciplinary and complex character of cultural studies. To get a sense of the way cultural studies (using the British context) has been Concepts The key concepts introduced in this chapter are: cultural s ..."
Abstract
 Add to MetaCart
the section 'The Culture and Civilization Tradition' below). Within cultural studies it is 'a network of representations texts, images, talk, codes of behaviour, and the narrative structures organizing these which shapes every aspect of social life' (viii). However, within this carefully
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
 In Computer Science Logic
, 1999
"... . We present a denition of untyped terms using a heterogeneous datatype, i.e. an inductively dened operator. This operator can be extended to a Kleisli triple, which is a concise way to verify the substitution laws for calculus. We also observe that repetitions in the denition of the monad as wel ..."
Abstract

Cited by 95 (18 self)
 Add to MetaCart
have been checked using the LEGO system. Keywords. Type Theory, inductive types, calculus, category theory. 1 Introduction The metatheory of substitution for calculi is interesting maybe because it seems intuitively obvious but becomes quite intricate if we take a closer look. [Hue92] states seven
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
 Proc. Calculemus 2005: 12 th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning
, 2006
"... To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close integration scheme which augments the decision procedures with lemmas about userdefined operators. We propose an even close ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
closer integration providing feedback about the state of the decision procedure in terms of entailed formulas for three reasons: First, to provide detailed proof objects for proof checking and archiving. Second, to analyze and improve the interaction between the decision procedure and the theorem prover
Tactics for Hierarchical Proof
"... Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Lowlevel, fullychecked mechanical proofs are large trees consisting of primitive logical inferences. Meanwhile, highlevel human inputs are lexically structured formal texts which include tactics desc ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Lowlevel, fullychecked mechanical proofs are large trees consisting of primitive logical inferences. Meanwhile, highlevel human inputs are lexically structured formal texts which include tactics
Results 1  10
of
253