Browsing Computer Science by Type "Conference Paper"
Now showing items 21-40 of 44
-
Large Aperiodic Semigroups
(World Scientific Publishing, 2015-11-01)We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ... -
Learning Filters for the 2D Wavelet Transform
(IEEE, 2018)We propose a new method for learning filters for the 2D discrete wavelet transform. We extend our previous work on the 1D wavelet transform in order to process images. We show that the 2D wavelet transform can be represented ... -
Learning Trustworthy Web Sources to Derive Correct Answers and Reduce Health Misinformation in Search
(ACM, 2022-07)When searching the web for answers to health questions, people can make incorrect decisions that have a negative effect on their lives if the search results contain misinformation. To reduce health misinformation in search ... -
Long-term Average Cost in Featured Transition Systems
(ACM, 2016-09)A software product line is a family of software products that share a common set of mandatory features and whose individual products are differentiated by their variable (optional or alternative) features. Family-based ... -
Measuring Behaviour Interactions between Product-Line Features
(IEEE, 2015-05)We suggest a method for measuring the degree to which features interact in feature-oriented software development. To this end, we extend the notion of simulation between transition systems to a similarity measure and lift ... -
Merging Features in Featured Transition Systems
(CEUR, 2015-09)Featured Transition Systems (FTSs) is a popular representation for software product lines: an entire product line is compactly represented as a single transition-machine model, in which feature-specific behaviour is guarded ... -
Morse: Reducing the Feature Interaction Explosion Problem Using Subject Matter Knowledge as Abstract Requirements
(IEEE, 2018-08)The feature interaction problem appears in many different kinds of complex systems, especially systems whose elements are created or maintained by separate entities - for example, a modern automobile that incorporates ... -
Most Complex Non-returning Regular Languages
(Springer, 2017-07-03)A regular language L is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of ... -
Most Complex Regular Right-Ideal Languages
(Springer, 2014)A right ideal is a language L over an alphabet Sigma that satisfies the equation L = L Sigma*. We show that there exists a sequence (Rn vertical bar n >= 3) of regular right-ideal languages, where R-n has n left quotients ... -
Patterns of Search Result Examination: Query to First Action.
(ACM, 2019-11-03)To determine key factors that affect a user's behavior with search results, we conducted a controlled eye-tracking study of users completing search tasks using both desktop and mobile devices. We focus our investigation ... -
Personalizing Persuasive Strategies in Gameful Systems to Gamification User Types
(Association for Computing Machinery, 2018-04-21)Persuasive gameful systems are effective tools for motivating behaviour change. Research has shown that tailoring these systems to individuals can increase their efficacy; however, there is little knowledge on how to ... -
The Positive and Negative Influence of Search Results on People's Decisions about the Efficacy of Medical Treatments
(ACM, 2017-10-01)People regularly use web search engines to investigate the efficacy of medical treatments. Search results can contain documents that present incorrect information that contradicts current established medical understanding ... -
A Positive-definite Cut-cell Method for Strong Two-way Coupling Between Fluids and Deformable Bodies
(Association for Computing Machinery, 2017-07-28)We present a new approach to simulation of two-way coupling between inviscid free surface fluids and deformable bodies that exhibits several notable advantages over previous techniques. By fully incorporating the dynamics ... -
Recommender Systems for Personalized Gamification
(ACM, 2017-07-09)Gamification has been used in a variety of application domains to promote behaviour change. Nevertheless, the mechanisms behind it are still not fully understood. Recent empirical results have shown that personalized ... -
Representing hierarchical state machine models in SMT-LIB
(ACM, 2016-05)We motivate and present a proposal for how to represent the syntax of behavioural models written in extended finite-state machine languages with hierarchical states (e.g., the Statecharts family) in SMT-LIB. By including ... -
Scrappy: Using Scrap Material as Infill to Make Fabrication More Sustainable
(ACM Press, 2021-05-06)We present a software system for fused deposition modelling 3D printing that replaces infill material with scrap to reduce material and energy consumption. Example scrap objects include unused 3D prints from prototyping ... -
A Study of Immediate Requery Behavior in Search
(Association for Computing Machinery, 2018-03-11)When search results fail to satisfy users' information needs, users often reformulate their search query in the hopes of receiving better results. In many cases, users immediately requery without clicking on any search ... -
Subtle and Personal Workspace Requirements for Visual Search Tasks on Public Displays
(ACM Press, 2017-05-06)We explore how users approach and define personal space on large, public displays. Our results show that users of public displays use one of two strategies for visual search tasks: minimizers create a small window and work ... -
Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
(IEEE, 2015-05)Product line (PL) engineering promotes the de- velopment of families of related products, where individual products are differentiated by which optional features they include. Modelling and analyzing requirements models ... -
Syntactic Complexities of Some Classes of Star-Free Languages
(Springer, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...