One basic property of the boosting algorithm is its ability to reduce the training error, subject to the critical assumption that the base learners generatèweak' (or more appropriately, `weakly accurate') hypotheses that are better that random guessing. We exploit analogies between regression and classiication to give a characterization on what base learners generate weak hypotheses, by introdu...

We introduce some modifications to the widely deployed Kerberos authentication protocol. The principle’s secretkey will be independent of the user password to overcome the weak passwords chosen by the network principal that are susceptible to password guessing attacks, the main drawback of the Kerberos protocol. Instead, the Kerberos Distribution Center saves a profile for every instance in its...

We apply visualization and modeling methods for convective and diffusive flows to public school mathematics test scores from Texas. We obtain plots that show the most likely future and past scores of students, the effects of random processes such as guessing, and the rate at which students appear in and disappear from schools. We show that student outcomes depend strongly upon economic class, a...

In [2], Chung et al. introduced the Guessing Secrets game. In [4] the authors introduce a variant of this game in which for each question the reference secret is chosen at random (with uniform distribution) by Responder. In this paper we investigate another variant in which Responder is required to answer truthfully to questions of the form How many secrets are there in X?, where X is a subset ...

A singled out game for two players A and B is analysed. In this game, both players are trying to correctly guess answers to yes/no questions; the first player to answer n questions correctly wins the game. Player B has an advantage of knowing A’s answer before having to announce his own guess. We find the best strategy for both players and give formulas for winning probabilities. We also provid...

Low-level attacks often rely on guessing absolute or relative memory addresses. Layout randomization aims to thwart such attacks. In this paper, we study layout randomization in a setting in which arrays and functions can be stored in memory. Our results relate layout randomization to language-level protection mechanisms, namely to the use of abstract locations (rather than integer addresses). ...

Guessing occurs on forced-choice (FC) tests for which responses cannot be based on relevant knowledge. Its importance is in inverse relation to the level of knowledge being measured, so that it becomes an increasing component of test scores as the level of knowledge decreases. It is also used as a benchmark to detect simulated impairment. This investigation examined the role of guessing in a 2-...