pinecone/core-2020-05-10-deduplication huggingface dataset:
A comparison of equality in computer algebra and correctness in mathematical pedagogy

How do we recognize when an answer is “right”? This is a question that has bedevilled the use of computer systems in mathematics (as opposed to arithmetic) ever since their introduction. A computer system can certainly say that some answers are definitely wrong, in the sense that they are provably not an answer to the question posed. However, an answer can be mathematically right without being pedagogically right. Here we explore the differences and show that, despite the apparent distinction, it is possible to make many of the differences amenable to formal treatment, by asking “under which congruence is the pupil’s answer equal to the teacher’s?”
Unifying Math Ontologies: A tale of two standards

One of the fundamental and seemingly simple aims of mathematical knowledge management (MKM) is to develop and standardize formats that allow to “represent the meaning of the objects of mathematics”. The open formats OpenMath and MathML address this, but differ subtly in syntax, rigor, and structural viewpoints (notably over calculus). To avoid fragmentation and smooth out interoperability obstacles, effort is under way to align them into a joint format OpenMath/MathML 3. We illustrate the issues that come up in such an alignment by looking at three main areas: bound variables and conditions, calculus (which relates to the previous) and “lifted” n-ary operators
Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations

We present a specialised (polynomial-based) rule for the
propositional logic called the Independence Rule, which is useful to compute
the conservative retractions of propositional logic theories. In this
paper we show the soundness and completeness of the logical calculus
based on this rule, as well as other applications. The rule is defined by
means of a new kind of operator on propositional formulae. It is based
on the boolean derivatives on the polynomial ring F2[x].Junta de Andalucía Minerva Services in Mobility Platform Project WeTeVe (2C/040)Junta de Andalucía TIC 13
A deployment value model for intrusion detection sensors

The value of an intrusion detection sensor is often associated with its data
collection and analysis features. Experience tells us such sensors fall under a
range of different types and are diverse in their operational characteristics.
There is a need to examine some of these characteristics to appreciate the value
they add to intrusion detection deployments. This paper presents a model to
determine the value derived from deploying sensors, which serves to be useful to
analyse and compare intrusion detection deployments
Improved cryptanalysis of the Common Scrambling Algorithm Stream Cipher

This paper provides a fresh analysis of the widely-used Common Scrambling Algorithm Stream Cipher (CSA-SC). Firstly, a new representation of CSA-SC with a state size of only 89 bits is given, a significant reduction from the 103 bit state of a previous CSA-SC representation. Analysis of this 89-bit representation demonstrates that the basis of a previous guess-and-determine attack is flawed. Correcting this flaw increases the complexity of that attack so that it is worse than exhaustive key search. Although that attack is not feasible, the reduced state size of our representation makes it obvious that CSA-SC is vulnerable to several generic attacks, for which feasible parameters are given
Towards verifying correctness of wireless sensor network applications using Insense and Spin

The design and implementation of wireless sensor network applications often require domain experts, who may lack expertise in software engineering, to produce resource-constrained, concurrent, real-time software without the support of high-level software engineering facilities. The Insense language aims to address this mismatch by allowing the complexities of synchronisation, memory management and event-driven programming to be borne by the language implementation rather than by the programmer. The main contribution of this paper is all initial step towards verifying the correctness of WSN applications with a focus on concurrency. We model part of the synchronisation mechanism of the Insense language implementation using Promela constructs and verify its correctness using SPIN. We demonstrate how a previously published version of the mechanism is shown to be incorrect by SPIN, and give complete verification results for the revised mechanism.Preprin
Automatic Verification of Integer Array Programs

International audienceWe provide a verification technique for a class of programs working on integerarrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL\cite{lpar08} to specify pre- and post-conditions of programs and their parts. Effects of non-looping parts of code are computed syntactically on the level of SIL. Loop pre-conditions derived during the computation in SIL are converted into counter automata (CA). Loops are automatically translated---purely on the syntactical level---to transducers. Pre-condition CA and transducers are composed, and the composition over-approximated by flat automata with difference bound constraints, which are next converted back into SIL formulae, thus inferring post-conditions of the loops. Finally, validity of post-conditions specified by the user in may be checked as entailment is decidable for SIL
Equivalence checking of static affine programs using widening to handle recurrences

Acceptance rate 27%Designers often apply manual or semi-automatic loop and
data transformations on array and loop intensive programs to
improve performance.  The transformations should preserve the
functionality, however, and this paper presents an automatic
method for constructing equivalence proofs for the class of static affine
programs.  The equivalence checking is performed on a dependence
graph abstraction and uses a new approach based on widening to
handle recurrences.  Unlike transitive closure based   
approaches, this widening approach can also handle non-uniform
recurrences.  The implementation is publicly available and is
the first of its kind to fully support commutative operations.status: publishe
A UCD approach towards the design, development and assessment of accessible applications in a large scale European Integrated project

ÆGIS (Open Accessibility Everywhere: Groundwork, Infrastructure, Standards) is a user-centred project, involving several user groups (users with visual, hearing, motion, speech and cognitive impairments as well as application developers) throughout the design, development and assessment phases. In this paper the holistic UCD (User Centred Design) approach of the project is introduced. This approach ensures that the project's objectives to determine whether 3rd generation access techniques will provide a more accessible, more exploitable and deeply embeddable approach in mainstream ICT applications (desktop, rich Internet and mobile applications) are met, with the full support and involvement of a huge end-user group in every single step of the design, development and deployment of accessible mainstream ICT.status: publishe
Web user interface design strategy: Designing for device independence

Until recently, Web services were available only through a desktop web browser. Nowadays, methods of access move beyond the desktop computer towards ubiquitous access through portable devices. As a consequence, users have the chance to interact with a growing diversity of computing devices such as PDAs, smart phones, etc., with diverse characteristics that tend to replace conventional laptop and desktop computers. User interface designers, on the other hand, strive to design usable interfaces to cater for the diverse requirements of these devices. The design strategy proposed in this paper aims at assisting user interface designers in designing for diverse devices recommending a specific line of activities in the process of design. A case study of application of the proposed design strategy is presented, outlining its advantages
Designing Universally Accessible Networking Services for a Mobile Personal Assistant

At present, a tendency towards smaller computer sizes and at the same time increasingly inaccessible web content can be noted. Despite the worldwide recognized importance of Web accessibility, the lack of accessibility of web services has an increasingly negative impact on all users. In order to address this issue, W3C has released a recommendation on Mobile Web Best Practices, supplementary to the Web Content Accessibility Guidelines. This paper presents the design and prototype development of universally accessible networking services that fully comply with those standards. Validation and expert accessibility evaluation on the XHTML Basic prototypes present 100% compliance. The followed design process is presented in details, outlining general as well as specific issues and related solutions that may be of interest to other designers. The results will be further verified through user tests on implemented services
Interactive Accessible Notifications for Emergency Notification Systems

5th International Conference, UAHCI 2009, Held as Part of HCI International 2009, San Diego, CA, USA, July 19-24, 2009Notifications are critical when an emergency scenario is going to happen (e.g. a hurricane approaching); so the ability to transmit notifications to different kind of users is a crucial feature for Emergency Management Systems. In this work an ontology was developed by investigating different sources: accessibility guidelines, emergency response systems, communication devices and technologies, taking into account the different abilities of people to react to different alarms (e.g. mobile phone vibration as an alarm for deaf blind people). The knowledge codified in the proposed ontology could be used to enhance and promote the use of non-conventional interfaces for notifying emergency messages thus providing accessibility under different conditions and for different kind of users.This work is funded by the project UIA4SIGE (TSI2007-03394) supported by the [Spanish] Ministry of Education and by an agreement with the DGPCE of the [Spanish] Ministry of Interior.Publicad
Assistive tool for collaborative learning of conceptual structures

The final publication is available at link.springer.comThere is a demand for computational methods assisting learners to generate relevantassociations for current context. Many concepts in natural language have ambiguous meaningsimplying alternative ways to define associations for them. It is crucial to develop collaborativemethods that support free experiments with promising conceptual structures in learning.Methods for evaluating these structures in respect to the person’s needs are also required. Wepropose a new collaborative ideation scheme and based on that we have implemented anassistive tool for learning conceptual structures in a collaborative Web environment.Peer reviewe
Integrating accessibility and functional requirements

This conference paper was published in the series Lecture Notes in Computer Science [© Springer Verlag Berlin Heidelberg]. The final publication is available at http://www.springerlink.com/content/j386481078533rpq/Initial research on Web accessibility was focused on testing\ud
completed Web pages. More recently, the focus is moving to integrating\ud
accessibility features into coding tools such as Dreamweaver 8 and plugins\ud
notably LIFT. Thus accessibility is being considered slightly earlier in the\ud
development process. However, the state of Web accessibility is still\ud
disappointing even on websites that have followed the guidelines and or used\ud
evaluation and coding tools. We are proposing an approach to start considering\ud
accessibility much earlier. Our purpose is to address accessibility in the context\ud
of what is to be done and who will be participating. In this paper, we present\ud
views of Web developers about this approach. We then show (using a case\ud
study) how Web developers can elicit accessibility requirements alongside\ud
functional requirements and integrate the two to obtain conceptual models with\ud
explicit traces of accessibility requirements integrated with functional\ud
requirements. Finally we discuss lessons learnt from the case study and\ud
common benefits of the approach for Web accessibility and Web projects
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents

Bi-intuitionistic logic is a conservative extension of
  intuitionistic logic with a connective dual to implication, called
  exclusion. We present a sound and complete cut-free labelled sequent
  calculus for bi-intuitionistic propositional logic, BiInt,
  following S. Negri's general method for devising sequent calculi
  for normal modal logics. Although it arises as a natural
  formalization of the Kripke semantics, it is does not directly
  support proof search.  To describe a proof search procedure, we
  develop a more algorithmic version that also allows for
  counter-model extraction from a failed proof attempt.Fundação para a Ciência e a Tecnologia (FCT)RESCUE - no. PTDC/EIA/65862/2006TYPES - FP6 ISTCentro de matemática da Universidade do MinhoEstonian Science Foundation - grants no. 5567; 694
Existence and nonexistence of descriptive patterns

This paper was published in the series Lecture Notes in Computer Science [© Springer Berlin / Heidelberg] and the original\ud
publication is available at www.springerlink.comIn the present paper, we study the existence of descriptive\ud
patterns, i.e. patterns that cover all words in a given set through morphisms\ud
and that are optimal in terms of revealing commonalities of these\ud
words. Our main result shows that if patterns may be mapped onto words\ud
by arbitrary morphisms, then there exist infinite sets of words that do\ud
not have a descriptive pattern. This answers a question posed by Jiang,\ud
Kinber, Salomaa, Salomaa and Yu (International Journal of Computer\ud
Mathematics 50, 1994). Since the problem of whether a pattern is descriptive\ud
depends on the inclusion relation of so-called pattern languages,\ud
our technical considerations lead to a number of deep insights into the\ud
inclusion problem for and the topology of the class of terminal-free Epattern\ud
languages
A quadratic upper bound on the size of a synchronizing word in one-cluster automata

International audienceČerný’s conjecture asserts the existence of a synchronizing word of length at most (n-1)² for any synchronized n-state deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized n-state deterministic automaton satisfying the following additional property: there is a letter a such that for any pair of states p, q, one has p·a^r=q·a^s for some integers r, s (for a state p and a word w, we denote by p·w the state reached from p by the path labeled w). As a consequence, we show that for any finite synchronized prefix code with an n-state decoder, there is a synchronizing word of length O(n²). This applies in particular to Huffman codes
Performance analysis of priority queueing systems in discrete time

The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1
Metacommunication patterns in online communities

Published version of a chapter in the book: Online Communities and Social Computing. Also available from the publisher at http://dx.doi.org/10.1007/978-3-642-02774-1_26This paper discusses about contemporary literature on computer-mediated metacommunication and observes the phenomenon in two online communities. The results contribute by identifying six general-level patterns of how metacommunication refers to primary communication in online communities. A task-oriented, user-administrated, community (Wikipedia in Finnish) involved a remarkable number of specialized metacommunication genres. In a centrally moderated discussion-oriented community (Patientslikeme), metacommunication was intertwined more with primary ad hoc communication. We suggest that a focus on specialized metacommunication genres may appear useful in online communities. However, room for ad hoc (meta)communication is needed as well, as it provides a basis for user-initiated community development
Efficiently calculating evolutionary tree measures using SAT

We develop techniques to calculate important measures in evolutionary biology by encoding to CNF formulas and using powerful SAT solvers. Comparing evolutionary trees is a necessary step in tree reconstruction algorithms, locating recombination and lateral gene transfer, and in analyzing and visualizing sets of trees. We focus on two popular comparison measures for trees: the hybridization number and the rooted subtree-prune-and-regraft (rSPR) distance. Both have recently been shown to be NP-hard, and effcient algorithms are needed to compute\ud
and approximate these measures. We encode these as a Boolean formula such that two trees have hybridization number k (or rSPR distance k) if and only if the corresponding formula is satisfiable. We use state-of-the-art SAT solvers to determine if the formula encoding the measure has a satisfying assignment. Our encoding also provides a rich\ud
source of real-world SAT instances, and we include a comparison of several recent solvers (minisat, adaptg2wsat, novelty+p, Walksat, March KS and SATzilla).Postprint (author’s final draft
Combining Activity Theory and Grounded Theory for the Design of Collaborative Interfaces

In remote tabletop collaboration multiple users interact with the system and with each other. Thus, two levels of interaction human-computer interaction and human-human interaction exist in parallel. In order to improve remote tabletop systems for multiple users both levels have to be taken into account. This requires an in-depth analysis achieved by qualitative methods. This paper illustrates how a combination of Activity Theory and Grounded Theory can help researchers and designers to improve and develop better collaborative interfaces. Findings reported here are based on three video recordings that have been collected during a quasi-experiment
Using Google Analytics to evaluate the usability of e-commerce sites

This article was published in the series, Lecture Notes in Computer Science [© Springer-Verlag] and the definitive version is available at: http://dx.doi.org/10.1007/978-3-642-02806-9_81The success of an e-commerce site is, in part, related to how easy it is to use. This research investigated whether advanced web metrics, calculated using Google Analytics software, could be used to evaluate the overall usability of e-commerce sites, and also to identify potential usability problem areas. Web metric data are easy to collect but analysis and interpretation are time-consuming. E-commerce site managers therefore need to be sure that employing web analytics can effectively improve the usability of their websites. The research suggested specific web metrics that are useful for quickly indicating general usability problem areas and specific pages in an e-commerce site that have usability problems. However, what they cannot do is provide in-depth detail about specific problems that might be present on a page
Incorporating cognitive aspects in digital human modelling

The final publication is available at Springer via: https://doi.org/10.1007/978-3-642-02809-0_35.To build software which, at the press of a button, can tell you what cognition related hazards there are within an environment or a task, is probably well into the future if it is possible at all. However, incorporating existing tools such as task analysis tools, interface design guidelines and information about general cognitive limitations in humans, could allow for greater evaluative options for cognitive ergonomics. The paper will discuss previous approaches on the subject and suggest adding design and evaluative guiding in DHM that will help a user with little to no knowledge of cognitive science, design and evaluate a human-product interaction scenario
Realistic elbow flesh deformation based on anthropometrical data for ergonomics modeling

This is a conference paper. It was presented at the Second International Conference, ICDHM 2009. The original publication is available at: http://www.springerlink.com/content/g363t1131532u081/The human model for ergonomic simulation has improved in terms of its reliability and appearance and yet there seems to be less attention paid to create a realistic and accurate flesh deformation around the joint. This study, a part of ongoing research, proposes a combination of manual and automatic (3D body scanner) measurements to create a database for flesh deformation prediction i.e. flesh deformation area and cross section changes, around the elbow joint. The database consists of two race groups i.e., Caucasian and Asian (23 subjects, 11 males and 12 females), which were carefully chosen to represent a variety of height and body type. The prediction results for both flesh deformation area and cross section changes are discussed as well as their relevance for the next stage of the study
HADRIAN: fitting trials by digital human modelling

This is a conference paper. The original publication is available at www.springerlink.comAnthropometric data are often described in terms of percentiles and too often digital human models are synthesised from such data using a single percentile value for all body dimensions. The poor correlation between body dimensions means that products may be evaluated against models of humans that do not exist. Alternative digital approaches try to minimise this difficulty using pre-defined families of manikins to represent human diversity, whereas in the real world carefully selected real people take part in ‘fitting trials’. HADRIAN is a digital human modeling system which uses discrete data sets for individuals rather than statistical populations. A task description language is used to execute the evaluative capabilities of the underlying SAMMIE human modelling system as though a ‘real’ fitting trial was being conducted. The approach is described with a focus on the elderly and disabled and their potential exclusion from public transport systems