Low Ambiguity in Strong , Total , Asso iative , One - Way

Áñôöóúúòò Èóûö Ae Blockin Blockin Blockinò Blockiný Ûûøø Ò ×ýñññøöö Ëëø¹¹××ó Blockin

Ca he Zhigang Hu and Margaret Martonosi Department of Ele tri al Engineering Prin eton University hzg,martonosi ee.prin eton.edu Stefanos Kaxiras Cir uits and Systems Resear h Lab Agere Systems kaxiras agere. om Abstra t Data a hes are widely used in general-purpose proessors as a means to hide long memory laten ies. Set-asso iativity in these a hes helps programs avoid performan e problems due...

GAMLS: A Generalized framework for Asso iative Modular Learning Systems

Low Ambiguity in Strong, Total, Associative, One-Way Functions

Rabi and Sherman [RS97] present a cryptographic paradigm based on associative, one-way functions that are strong (i.e., hard to invert even if one of their arguments is given) and total. Hemaspaandra and Rothe [HR99] proved that such powerful one-way functions exist exactly if (standard) one-way functions exist, thus showing that the associative one-way function approach is as plausible as prev...

Tight lower bounds on the ambiguity of strong, total, associative, one-way functions

We study the ambiguity, or "many-to-one"-ness, of two-argument, one-way functions that are strong (that is, hard to invert even if one of their arguments is given), total, and associative. Such powerful oneway functions are the basis of a cryptographic paradigm described by Rabi and Sherman (Inform. Process. Lett. 64(2) (1997) 239) and were shown by Hemaspaandra and Rothe (1. Comput. System Sci...

Gesture and its impact of resolving lexical ambiguity

The study aimed to shed light on the use of gesture in resolving lexical ambiguity employed by TEFL students. To this end, 60 intermediate Iranian learners, studying at Kish Way Language School in Iran were recruited. The participants were randomly put into two experimental groups and one control group. Both of the experimental groups received the same teaching approach, i.e. teaching homonyms ...