Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kenrick J. Mock

dblp:m/KJMock · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2019
0000-0003-4587-6447ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSecurity and privacy · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Biometric security · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Human-computer interaction and pervasive computing
1 paper
Wearable and physiological sensing · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 77% Information retrieval · 23%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Biometric security
iris recognition
0.112012
Real-time continuous iris recognition for authentication using an eye tracker · CCS 2012
Mathematical optimization
discrete optimization
0.112005
Helicopter Routing for Maintaining Remote Sites in Alaska using a Genetic Algorithm · AAAI 2005
Mathematical optimization › combinatorial optimization
vehicle routing
0.112005
Helicopter Routing for Maintaining Remote Sites in Alaska using a Genetic Algorithm · AAAI 2005
Wearable and physiological sensing
eye tracking
0.012012
Real-time continuous iris recognition for authentication using an eye tracker · CCS 2012
Data mining › text mining › text classification
email classification
0.012001
An Experimental Framework for Email Categorization and Management · SIGIR 2001
Mathematical optimization › evolutionary computation
genetic algorithm
0.012005
Helicopter Routing for Maintaining Remote Sites in Alaska using a Genetic Algorithm · AAAI 2005

Methods — techniques the papers use, named apart from their topics

k-nearest neighbors · 0.3genetic algorithm · 0.1classification algorithms · 0.0
YearPublicationVenuePosition
2019 Experiences using Discord as Platform for Online Tutoring and Building a CS Community
abstract
This lightning talk describes our experience using Discord as a platform for online tutoring at the University of Alaska Anchorage (UAA) for the past two and a half semesters. Discord is a free online chat system that is accessible via a web browser, computer program, or mobile app. It competes with apps including Skype, Slack, and TeamSpeak. We initially pitched Discord to our students as a way to deliver online tutoring. However, once a critical mass of students joined the system they began to use it for socializing, finding study partners, and other community-building activities. Utilization has been much higher than other online communication tools we have implemented in the past. With approximately 250 majors there are currently 261 users subscribed to our server with users actively posting messages every day. Students have reported positive experiences with the platform. To further facilitate tutoring in the future we are developing a bot and web tools into the platform to make it easier to share and run snippets of code.
Kenrick J. Mock
SIGCSE1
2014 Machine-extracted eye gaze features: how well do they correlate to sight-reading abilities of piano players?
abstract
Skilled piano players are able to decipher and play a musical piece they had never seen before (a skill known as sight-reading). For a sample of 23 piano players of various abilities we consider the correlation between machine-extracted gaze path features and the overall human rating. We find that correlation values (between machine-extracted gaze features and overall human ratings) are statistically similar to correlation values between human-extracted task-related ratings (e.g., note accuracy, error rate) and overall human ratings. These high correlation values suggest that an eye tracking-enabled computer could help students assess their sight-reading abilities, and could possibly advise students on how to improve. The approach could be extended to any musical instrument. For keyboard players, a MIDI keyboard with the appropriate software to provide information about note accuracy and timing could complement feedback from an eye tracker to enable more detailed analysis and advice.
Bogdan Hoanca, Timothy C. Smith, Kenrick J. Mock
ETRA3
2012 Real-time continuous iris recognition for authentication using an eye tracker
abstract
The majority of today's authentication systems, including password and fingerprint scanners, are based on one-time, static authentication methods. A continuous, real-time authentication system opens up the possibility for greater security, but such a system must be unobtrusive and secure. In this work we studied whether a commercial eye tracker can be used for unobtrusive, continuous, real-time user authentication via iris recognition. In a user study, all 37 participants could be authenticated with 11% equal error rate (EER). For 14 of the 37 users, iris occlusion was sufficiently small to authenticate with 9% EER. When classified using a k-nearest neighbors algorithm and only the right iris, the same data set allowed 100% accuracy for k = 3. Although these error rates are too high for standalone use, iris recognition via an eye tracker might enable real-time continuous authentication when combined with other more reliable authentication means (e.g., a password). As eye trackers become widely available their capabilities for multiple factor, continuous authentication will become compelling.
Kenrick J. Mock, Bogdan Hoanca, Justin Weaver, Mikal Milton
CCS1
2011 Gaze-based password authentication through automatic clustering of gaze points
abstract
Researchers have proposed systems in which users utilize an eye tracker to enter passwords by merely looking at the proper symbols on the computer monitor in the appropriate order. This authentication method is immune to the practice of shoulder surfing: secretly observing the keystrokes of a legitimate user as he or she types a password on a keyboard. In this paper we describe the EyeDent system-in which users authenticate by looking at the symbols on an on-screen keyboard to enter their password. Existing eye-tracking based authentication systems require the user to dwell or press a trigger when looking at each symbol. Instead, in EyeDent, gaze points are automatically clustered to determine the user's selected symbols; this approach has the benefit of allowing users to authenticate at their natural speed, rather than with a fixed dwell time. Additionally, the absence of a visible trigger does not divulge the number of symbols in the password. Results from preliminary investigations indicate that quick (3 seconds for a 4 digit PIN) authentication is possible using this scheme, but more work is needed to account for calibration error, and to dynamically adapt system parameters to the characteristics of individual users.
Justin Weaver, Kenrick J. Mock, Bogdan Hoanca
SMC2
2006 Secure graphical password system for high traffic public areas
abstract
Graphical passwords are expected to be easier to recall, less likely to be written down and have the potential to provide a richer symbol space than text based passwords. For example, a user might authenticate by clicking a series of points on an image, selecting a series of tiles, or by drawing a series of lines on the screen [Davis et al. 2004]. An example of the tiled approach is the Real User Corporation's PassFaces™ system [Real User, 2005] illustrated in Figure 1. For both text and graphical password entry systems the user needs to carefully enter the password in case a malicious user is observing the session via "shoulder surfing." Although some authors assume that graphical passwords will be entered on a small screen with a reduced observation angle [Jansen 2004], and thus dismiss the likelihood of shoulder surfing, this assumption is not always true.
Bogdan Hoanca, Kenrick J. Mock
ETRA2
2005 Helicopter Routing for Maintaining Remote Sites in Alaska using a Genetic Algorithm
Nicholas L. Armstrong-Crews, Kenrick J. Mock
AAAI2
2001 An Experimental Framework for Email Categorization and Management
abstract
Many problems are difficult to adequately explore until a prototype exists in order to elicit user feedback. One such problem is a system that automatically categorizes and manages email. Due to a myriad of user interface issues, a prototype is necessary to determine what techniques and technologies are effective in the email domain. This paper describes the implementation of an add-in for Microsoft Outlook 2000 TM that intends to address two problems with email: 1) help manage the inbox by automatically classifying email based on user folders, and 2) to aid in search and retrieval by providing a list of email relevant to the selected item. This add-in represents a first step in an experimental system for the study of other issues related to information management. The system has been set up to allow experimentation with other classification algorithms and the source code is available online in an effort to promote further experimentation.
Kenrick J. Mock
SIGIR1
1999 Dynamic Email Organization via Relevance Categories
abstract
Many researchers have proposed classification systems that automatically classify email in order to reduce information overload. However, none of these systems are in use today. This paper examines some of the problems with classification technologies and proposes Relevance Categories as a method to avoid some of these problems. In particular, the dynamic nature of email categories, the cognitive overhead, required training categories, and the high costs of classification errors are hurdles for many classification algorithms. Relevance Categories avoid some of these problems through their simplicity; they are merely relevance-ranked lists of email messages that are similar to a set of query messages. by displaying messages as the result of a dynamic query in lieu of fixed categories, we hypothesize that users will be less sensitive to errors using the Relevance Categories scheme than to errors using a fixed categorization scheme. To study the effectiveness of the Relevance Categories concept, we devised a performance metric for relevance ranking and used it to test an inverted index implementation on the Reuter-21578 test collection. The promising test results indicate the need for further work.
Kenrick J. Mock
ICTAI1
1997 Information filtering via hill climbing, wordnet, and index patterns
Kenrick J. Mock, V. Rao Vemuri
Inf. Process. Manag.1