Escape-Keyboard

2013 ◽  
Vol 5 (3) ◽  
pp. 42-61 ◽  
Author(s):  
Nikola Banovic ◽  
Koji Yatani ◽  
Khai N. Truong
Keyword(s):  
Theoretical Analysis ◽  
Upper Bound ◽  
Peak Performance ◽  
Free Text ◽  
Text Entry ◽  
User Performance ◽  
Mental Load ◽  
Iterative Design ◽  
Touch Screen Devices ◽  
Over Time

Mobile text entry methods traditionally have been designed with the assumption that users can devote full visual and mental attention on the device, though this is not always possible. The authors present their iterative design and evaluation of Escape-Keyboard, a sight-free text entry method for mobile touch-screen devices. Escape-Keyboard allows the user to type letters with one hand by pressing the thumb on different areas of the screen and performing a flick gesture. The authors then examine the performance of Escape-Keyboard in a study that included 16 sessions in which participants typed in sighted and sight-free conditions. Qualitative results from this study highlight the importance of reducing the mental load with using Escape-Keyboard to improve user performance over time. The authors thus also explore features to mitigate this learnability issue. Finally, the authors investigate the upper bound on the sight-free performance with Escape-Keyboard by performing theoretical analysis of the expert peak performance.

scholarly journals Detecting bursty terms in computer science research

2019 ◽  
Vol 122 (1) ◽  
pp. 681-699 ◽  
Author(s):  
E. Tattershall ◽  
G. Nenadic ◽  
R. D. Stevens
Keyword(s):  
Computer Science ◽  
Historical Data ◽  
Science Research ◽  
Detection Algorithm ◽  
Trend Detection ◽  
Free Text ◽  
Research Topics ◽  
Computer Science Research ◽  
Insight Into ◽  
Over Time

AbstractResearch topics rise and fall in popularity over time, some more swiftly than others. The fastest rising topics are typically called bursts; for example “deep learning”, “internet of things” and “big data”. Being able to automatically detect and track bursty terms in the literature could give insight into how scientific thought evolves over time. In this paper, we take a trend detection algorithm from stock market analysis and apply it to over 30 years of computer science research abstracts, treating the prevalence of each term in the dataset like the price of a stock. Unlike previous work in this domain, we use the free text of abstracts and titles, resulting in a finer-grained analysis. We report a list of bursty terms, and then use historical data to build a classifier to predict whether they will rise or fall in popularity in the future, obtaining accuracy in the region of 80%. The proposed methodology can be applied to any time-ordered collection of text to yield past and present bursty terms and predict their probable fate.

Constraints on Social Networks

2010 ◽  
Author(s):  
Sam G. B. Roberts
Keyword(s):  
Social Networks ◽  
Social Relationships ◽  
Human Evolution ◽  
Upper Bound ◽  
Brain Size ◽  
Network Approach ◽  
Cognitive Constraints ◽  
Hominin Evolution ◽  
Over Time ◽  
Size And Structure

In both modern humans and non-human primates, time and cognitive constraints place an upper bound on the number of social relationships an individual can maintain at a given level of intensity. Similar constraints are likely to have operated throughout hominin evolution, shaping the size and structure of social networks. One of the key trends in human evolution, alongside an increase in brain size, is likely to have been an increase in group size, resulting in a larger number of social relationships that would have to be maintained over time. The network approach demonstrates that relationships should not be viewed as dyadic ties between two individuals, but as embedded within a larger network of ties between network members. Together with relationships based on kinship, this may have allowed for larger groups to be maintained among hominins than would be possible if such networks were based purely on dyadic ties between individuals.

RingText: Dwell-free and hands-free Text Entry for Mobile Head-Mounted Displays using Head Motions

2019 ◽  
Vol 25 (5) ◽  
pp. 1991-2001 ◽  
Author(s):  
Wenge Xu ◽  
Hai-Ning Liang ◽  
Yuxuan Zhao ◽  
Tianyu Zhang ◽  
Difeng Yu ◽  
...  
Keyword(s):  
Free Text ◽  
Text Entry ◽  
Head Mounted Displays

Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection

2012 ◽  
Vol 20 (3) ◽  
pp. 349-393 ◽  
Author(s):  
Jun Sun ◽  
Wei Fang ◽  
Xiaojun Wu ◽  
Vasile Palade ◽  
Wenbo Xu
Keyword(s):  
Particle Swarm Optimization ◽  
Theoretical Analysis ◽  
Upper Bound ◽  
Optimization Problems ◽  
Empirical Studies ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Stochastic Simulations ◽  
Swarm Optimization ◽  
Bare Bones

Quantum-behaved particle swarm optimization (QPSO), motivated by concepts from quantum mechanics and particle swarm optimization (PSO), is a probabilistic optimization algorithm belonging to the bare-bones PSO family. Although it has been shown to perform well in finding the optimal solutions for many optimization problems, there has so far been little analysis on how it works in detail. This paper presents a comprehensive analysis of the QPSO algorithm. In the theoretical analysis, we analyze the behavior of a single particle in QPSO in terms of probability measure. Since the particle's behavior is influenced by the contraction-expansion (CE) coefficient, which is the most important parameter of the algorithm, the goal of the theoretical analysis is to find out the upper bound of the CE coefficient, within which the value of the CE coefficient selected can guarantee the convergence or boundedness of the particle's position. In the experimental analysis, the theoretical results are first validated by stochastic simulations for the particle's behavior. Then, based on the derived upper bound of the CE coefficient, we perform empirical studies on a suite of well-known benchmark functions to show how to control and select the value of the CE coefficient, in order to obtain generally good algorithmic performance in real world applications. Finally, a further performance comparison between QPSO and other variants of PSO on the benchmarks is made to show the efficiency of the QPSO algorithm with the proposed parameter control and selection methods.

scholarly journals QUESTIONING CONVENTIONS: ARE PRODUCT CONVENTIONS TRADING OFF THE USABILITY OF PRODUCTS FOR SHORT TERM USER SATISFACTION

2015 ◽  
Vol 3 (2) ◽  
pp. 47-58
Author(s):  
Bryan Gough Young ◽  
Andrew Wodehouse ◽  
Marion Sheridan
Keyword(s):  
User Satisfaction ◽  
Necessary Condition ◽  
User Centered Design ◽  
Short Term ◽  
Mental Load ◽  
Cognitive Approach ◽  
Substantial Impact ◽  
Product Interaction ◽  
Over Time ◽  
User Centered

Mapping conventions are a key aspect of user centered design as they present users with familiar interactions in unfamiliar products. Conventions evolve over time and are slow to be adopted, requiring a high percentage of acceptance within a society, ensuring that conventions exhibit a sufficient level of usability. However this paper argues that while usability is a necessary condition for good interactions it is not a sufficient one. Therefore user centered design which accents individuals bias towards conventions my in fact be hindering the innovation of product interactions. This paper argues that a cognitive approach should be adopted in order understand and reassess product interactions. An experiment was carried out that demonstrates the influence that simple mappings can have on cognitive load. The results showed that basic mappings of the types that are found throughout product conventions can have a substantial impact on mental load and subsequently product interaction.

scholarly journals User Generated SQL Queries Inform Evaluation of NSSP ESSENCE

2018 ◽  
Vol 10 (1) ◽  
Author(s):  
Aaron Kite-Powell ◽  
Michael Coletta ◽  
Jamie Smimble
Keyword(s):  
Execution Time ◽  
National Level ◽  
System Optimization ◽  
Free Text ◽  
Query Execution ◽  
The Mean ◽  
Execution Times ◽  
Text Query ◽  
Sql Query ◽  
Over Time

Objective: The objective of this work is to describe the use and performance of the NSSP ESSENCE system by analyzing the structured query language (SQL) logs generated by users of the National Syndromic Surveillance Program’s (NSSP) Electronic Surveillance System for the Early Notification of Community-based Epidemics (ESSENCE).Introduction: As system users develop queries within ESSENCE, they step through the user-interface to select data sources and parameters needed for their query. Then they select from the available output options (e.g., time series, table builder, data details). These activities execute a SQL query on the database, the majority of which are saved in a log so that system developers can troubleshoot problems. Secondarily, these data can be used as a form of web analytics to describe user query choices, query volume, query execution time, and develop an understanding of ESSENCE query patterns.Methods: ESSENCE SQL query logs were extracted from April 1, 2016 to August 23th, 2017. Overall query volume was assessed by summarizing volume of queries over time (e.g., by hour, day, and week), and by Site. To better understand system performance the mean, median, and maximum query execution times were summarized over time and by Site. SQL query text was parsed so that we could isolate, 1) Syndromes queried, 2) Sub-syndromes queried, 3) Keyword categories queried, and 4) Free text query terms used. Syndromes, sub-syndromes, and keyword categories were tabulated in total and by Site. Frequencies of free text query terms were analyzed using n-grams, wordclouds, and term co-occurrence relationships. Term co-occurrence network graphs were used to visualize the structure and relationships among terms.Results: There were a total of 354,101 SQL queries generated by users of ESSENCE between April 1, 2016 and August 23rd, 2017. Over this entire time period there was a weekly mean of 4,785 SQL queries performed by users. When looking at 2017 data through August 23rd this figure increases to a mean of 7,618 SQL queries per week for 2017, and since May 2017 the mean number of SQL queries has increased to 10,485 per week. The maximum number of user generated SQL queries in a week was 29,173. The mean, median, and maximum query execution times for all data was 0.61 minutes, 0 minutes, and 365 minutes, respectively. When looking at only queries with a free text component the mean query execution time increases slightly to 0.94 minutes, though the median is still 0 minutes. The peak usage period based on number of SQL queries performed is between 12:00pm and 3:00pm EST.Conclusions: The use of NSSP ESSENCE has grown since implementation. This is the first time the ESSENCE system has been used at a National level with this volume of data, and number of users. Our focus to date has been on successfully on-boarding new Sites so that they can benefit from use of the available tools, providing trainings to new users, and optimizing ESSENCE performance. Routine analysis of the ESSENCE SQL logs can assist us in understanding how the system is being used, how well it is performing, and in evaluating our system optimization efforts.

iText: Hands-free Text Entry on an Imaginary Keyboard for Augmented Reality Systems

2021 ◽  
Author(s):  
Xueshi Lu ◽  
Difeng Yu ◽  
Hai-Ning Liang ◽  
Jorge Goncalves
Keyword(s):  
Augmented Reality ◽  
Free Text ◽  
Text Entry

THE EFFECT OF CIVIL PROCEDURAL LAW IN TIME

2021 ◽  
Vol 11 (3) ◽  
pp. 132-152
Author(s):  
V.G. GOLUBTSOV
Keyword(s):  
Law Enforcement ◽  
Theoretical Analysis ◽  
Time And Space ◽  
Temporal Characteristics ◽  
Insufficient Attention ◽  
Procedural Law ◽  
The Law ◽  
Theory Of Law ◽  
The Moment ◽  
Over Time

The theoretical analysis of the features of the application of the norms of civil procedural law over time in the modern agenda is given, it seems undeservedly, insufficient attention. Despite the fact that the operation of legislation in time and space is the basis of theoretical constructions in law, and law enforcement constantly operates with these categories, in the theory of procedural law in this part there is no complete clarity, as well as there is no system of interrelated established views on a number of individual topical issues related to temporality. Not limited to the problem of reversibility/irreversibility of the operation of the law, which is generally accepted in the theory of law, the author addresses the logical and epistemological boundaries of the concept of “change of civil procedural law”, analyzes extraordinary cases of changes in legislation, examines the criterion “the moment of the commission of procedural actions”. In conclusion, the author notes that the same normative act of civil procedural law may have not one, but several temporal characteristics. Variants of this multiplicity may be different. However, in the science of civil procedural law they are not actually studied.

Sign in / Sign up

Export Citation Format

Share Document