The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
(This technology is called implicit authentication, and is currently an active topic of research.)
identifies Alice’s swipes as a stranger’s swipes 20% of the time). Being rejected frequently and not satisfied by the security of her application, Alice decides to modify it such that FAR and FRR decrease to less than 1% and 2%, respectively. So she adds a window of n swipes. Any swipe rejected by the classifier increases the rejection counter by one, and the counter is set to zero every six swipes if the phone is not already locked. Her application locks the cellphone as soon as the rejection counter reaches a threshold.
Find the smallest possible length of swipes for the window and a suitable threshold. Show calculations or the code you have used to compute your results (No need to prove the mini- mality of window size).
-----------