Reviewerly/exHarmony huggingface dataset:
Multimedia-Enabled Dot Codes as Communication Technologies

The author has been using new dot codes developed independently by Gridmark, Inc. and Apollo Japan and conducting school activities with original handmade teaching materials overlaid with these dot codes in collaboration with schoolteachers all over the world. In the chapter, just touching the “invisible” dot codes printed on the paper or symbol icons by using a sound pen clearly reproduces voices and sounds. By using a scanner pen connected to a tablet or PC, multimedia sources such as movies, web pages, and PowerPoint files, in addition to voices and sounds, can be reproduced on its screen. In this chapter, state-of-the-art dot code technology including a recently developed new application for a smart phone is outlined, and basic information regarding the creation of original handmade materials using dot codes and the use at both general and special needs schools is presented.
Direct merging of delta encoded files

Delta encoding represents a target file making use of a source file by replacing common substrings by pointer references. Two similar, yet different, models are introduced and investigated in this paper: the Compressed Transitive Delta Encoding (CTDE) and the Compressed Source Delta Encoding (CSDE) paradigms. In these models we are given two delta files and the goal is to construct a third delta file working directly on the given compressed forms. Formally, given a source file S and two differencing files Δ(S,T) and Δ(T,R), where Δ(X,Y) is used to denote the delta file of the target file Y with respect to the source file X, the objective of the CTDE problem is to be able to attain R. Unlike the traditional way which uses S to decompress Δ(S,T), in order to attain T, and then applies Δ(T,R) on T to obtain R, CTDE constructs a delta file Δ(S,R) working directly on the two given delta files Δ(S,T) and Δ(T,R), without any decompression or the use of the base file S. Thus, avoiding the storage of the redundant intermediate file T. An algorithm for solving CTDE is proposed and its compression performance is compared to the traditional "double delta decompression". Not only does it use constant space, as opposed to linear memory storage used by the traditional method, experiments show that the compression efficiency of the constructed delta file Δ(S,R) is usually better than both Δ(S,T) and Δ(T,R). The CSDE problem deals with a source file S and two differencing files Δ(S,T) and Δ(S,R), and the goal is still to be able to attain R. Although it is not always possible to construct the target file R by processing only the two input delta files, empirical experiments show that on typical real life data, usually about 99% of the file can be constructed using the proposed algorithm for the CSDE problem.
Image Recapture Prevention Using Secure Display Schemes on Polarized 3D System

Image recapture is one of the simplest methods of content leakage, but is very difficult to address with the rapid development and dissemination of digital devices. This paper proposes novel secure display schemes to prevent image recapture on a polarized 3D system without additional hardware. Using commercial polarized 3D characteristics, the secret image to be protected from recapturing is encrypted on a pixel-by-pixel basis and decrypted with polarized glasses (PGs). Moreover, the proposed secure display schemes allow for the restricted viewing of secret images that only authorized people may see or the selective viewing of secret images and public images that anyone may see. Quantitative and qualitative analyses of the experimental results show that the proposed schemes can prevent content leakage from recaptured still or time axis images via a digital camera because the secret image is statistically encrypted, similar to random noise. As such, the restricted viewing or the selective viewing is possible depending on the presence of PGs. Therefore, the proposed schemes not only prevent image recapture using digital devices but also implement a secure display using PGs.
Longest Increasing Subsequence under Persistent Comparison Errors

We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel (Noisy sorting without resampling, SODA 2008, pages 268–276, 2008) every comparison between two elements can return the wrong result with some fixed (small) probability p, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence. We present asymptotically tight upper and lower bounds on both the approximation factor and the running time. In particular, we present an algorithm that computes an $O(\log n)$-approximation in $O(n\log n)$ time, with high probability. This approximation relies on the fact that we can approximately sort (Geissmann et al. Optimal Sorting with Persistent Comparison Errors, ArXiv e-prints 1804.07575, 2018) n elements in $O(n\log n)$ time such that the maximum dislocation of an element is $O(\log n)$. For the lower bounds, we prove that (i) there is a set of sequences, such that on a sequence picked randomly from this set every algorithm must return an ${\Omega }(\log n)$-approximation with high probability, and (ii) any $\log n$-approximation algorithm for longest increasing subsequence requires ${\Omega }(n \log n)$ comparisons, even in the absence of errors.
Signal processing on graphs: structure preserving maps

Signal processing on graphs using adjacency matrix (as opposed to more traditional graph Laplacian) results in an algebraic framework for graph signals and shift invariant filters. This can be seen as an example of the algebraic signal processing theory. In this study, the authors examine the concepts of homomorphism and isomorphism between two graphs from a signal processing point of view and refer to them as GSP isomorphism and GSP homomorphism, respectively. Collectively, they refer to these concepts as structure preserving maps (SPMs). The fact that linear combination of signals and linear transforms on signals are meaningful operations has implications on the GSP isomorphism and GSP homomorphism, which diverges from the topological interpretations of the same concepts (i.e. graph isomorphism and graph homomorphism). When SPMs exist between two graphs, signals and filters can be mapped between them while preserving spectral properties. They examine conditions on adjacency matrices for such maps to exist. They also show that isospectral graphs form a special case of GSP isomorphism and that GSP isomorphism and GSP homomorphism is intrinsic to resampling and downsampling process.
Using Augmented Reality Technologies to Enhance Students' Engagement and Achievement in Science Laboratories

This article aims to explore the impact of AR on the learning outcomes of college freshmen and their knowledge about the biology lab course. In a study, a basic biology lab course app was developed using AR technology. The students used this app to prepare for a basic biology lab course, and carry on self-learning without the help of instructors. The results showed that by integrating AR technology into the instruction, the students took on a more positive autonomous learning attitude; they were able to gain a better grasp of the basic biology lab knowledge through the interactive operation as well as cooperative learning. In addition, the students were found to have learned the importance of scientific knowledge with this interactive technology. The basic biology lab course app developed in the study offered the benefits of autonomous learning, situational simulation and interactive experience.
An Algorithm for a Matrix-Based Enigma Encoder from a Variation of the Hill Cipher as an Application of 2 × 2 Matrices

We present an algorithm for a matrix-based Enigma-type encoder based on a variation of the Hill Cipher as an application of 2 × 2 matrices. In particular, students will use vector addition and 2 × 2 matrix multiplication by column vectors to simulate a matrix version of the German Enigma Encoding Machine as a basic example of cryptography. The ideal assumed background is a rudimentary familiarity of matrix multiplication and vector addition, but students who have successfully completed introductory linear algebra, number theory, and discrete mathematics will find this example accessible. Making this connection between these two systems provides a rich field for the introduction of the concepts mentioned above.
Impossibility on Tamper-Resilient Cryptography with Uniqueness Properties

In this work, we show negative results on the tamper-resilience of a wide class of cryptographic primitives with uniqueness properties, such as unique signatures, verifiable random functions, signatures with unique keys, injective one-way functions, and encryption schemes with a property we call unique-message property. Concretely, we prove that for these primitives, it is impossible to derive their (even extremely weak) tamper-resilience from any common assumption, via black-box reductions. Our proofs exploit the simulatable attack paradigm proposed by Wichs (ITCS ’13), and the tampering model we treat is the plain model, where there is no trusted setup.
Design Freedom

Against the backdrop of increasing recognition of the social and cultural pillar of sustainable development, this chapter advances the notion of design freedom as a conceptual and methodological tool for deepening our commitments towards participatory and emancipatory design. Drawing from Sen's development as freedom approach, design freedom is broadly defined as a process that identifies opportunities for people to ameliorate their life conditions. In addition to enabling sustainability, design freedom is also a transformative process in and of itself, expanding opportunities of all participants in the process. As such, it augments the subfield of design methods adding processual consideration to its instrumental orientation. The chapter offers an illustration of the potential of design freedom as research and action approach by presenting a case study of co-design with the Pinoleville Pomo Nation tribe in California. This design freedom project identified and fostered three key capacities for community flourishing: distributed agency, expressive materials, and effective form.
The Rise of Darknet Markets in the Digital Age

The last decade saw the rapid development and growth of online markets of illegal goods, known as darknet markets or cryptomarkets. This chapter explores recent trends in the development and evolution of these markets. In particular, the chapter analyzes specific mechanisms used by participants of darknet commerce to establish trust, build reputation, provide quality assurance, minimize fraud risks, and overcome potential violations of contracts. These mechanisms include a wide variety of different tools, such as clients' ratings of purchases, comments on transactions, vendors' track records, anonymous user forums, and online chat rooms that facilitate sharing and distribution of information about marketplaces. As this chapter shows, a distinctive feature of trust building in cryptomarkets is the widespread use of third parties, such as administrators of marketplaces and operators of forums. By providing escrow services and conflict-resolution mechanisms, they serve as “centers of trust” and guarantors against fraudulent activities.
Kekuatan Perlekatan Tarik Komposit Resin Pada Permukaan Enamel Dengan dan Tanpa Perlakuan Fluor

Background: Several studies showed that treatment of fluoride in enamel has an important role in the prevention of caries in patients with a history of high risk caries. Enamel are often exposed to fluoride forms a new bond (fluoroapatite) which is stable and difficult to dissolve in acidic conditions. And it affects in the adhesion strength of a composite restorative materials. Objective: To prove the difference tensile strength attachment surface tooth enamel with fluoride treatment and no fluoride treatment. Materials and Methods: 14 samples of bovine teeth were divided into two groups, each group consisting of 7 samples. After preparation, sample immersed in artificial saliva with pH 4.6 for three hours. Group I sample with fluoride treatment, group II sample without fluoride treatment, both groups then immersed in artificial saliva with pH 7 for 14 days. Then samples were inserted into plunger and withdrawn with the autograph engine. Data were analyzed using Independent t-test (p &lt;0.05). Results: Treatment of fluoride that generates a new bond (fluoroapatite) that is resistant to acidic conditions. This led to reducing of enamel dissolution by acid etching so that decrease the porosity ofenamel that causes the attachment strength of the composite againts enamel is reduced. Conclusions: The strength of the composite tensile adhesion to enamel with fluoride treatment is lower than the enamel without fluoride treatments. Keywords: Enamel, fluoride, high risk caries, tensile strength, composite
Merging plans with incomplete knowledge about actions and goals through an agent-based reputation system

Managing transition plans is one of the major problems of people with cognitive disabilities. Therefore, finding an automated way to generate such plans would be a helpful tool for this community. In this paper we have specifically proposed and compared different alternative ways to merge plans formed by sequences of actions of unknown similarities between goals and actions executed by several operator agents which cooperate between them applying such actions over some passive elements (node agents) that require additional executions of another plan after some time of use. Such ignorance of the similarities between plan actions and goals would justify the use of a distributed recommendation system that would provide an useful plan to be applied for a certain goal to a given operator agent, generated from the known results of previous executions of different plans by other operator agents. Here we provide the general framework of execution (agent system), and the different merging algorithms applied to this problem. The proposed agent system would act as an useful cognitive assistant for people with intelectual disabilities such as autism.
Computer Analysis of Texts in Social Networks, Its Method and Tools

Texts in virtual social networks differ cardinally from those of reviewed and edited publications, as being in fact the materials of non-moderated chat dialog having all the syntactic features, and in many cases, they are hypertexts with, as analysis subjects, quite relative boundaries. Instead of texts the virtual discourse, an object of new type is analyzed. In these conditions, the linguistic analysis is transformed into preliminary linguistic processing the texts and analysis of texts into the analysis of networks participants' interactions. Weak sides of linguistic processing both primary and pervasive are shown concerning the texts in social networks. Many problems appear when analyzing the texts as non-structured big data. A changing of used linguistic tools is linked with the reorientation onto new research customers: companies seeing the business interest in that, state structures, and even onto criminal structures using result of analysis for composing the texts aimed for manipulation of the consciousness.
Let the right ones in: Supporting patrons as content creators with LibGuides and LibGuides CMS

With flexible access and permission features, LibGuides and LibGuides CMS offer an adaptable platform for hosting patron-created content. This paper highlights how librarians at Georgia Southern University opened their LibGuides CMS platform to host faculty and student projects and portfolios. Employing similar techniques, libraries can host a wide range of patron-created content while protecting library-managed guides and assets, controlling access to patron-created content, and protecting patron privacy. This paper provides a detailed overview of access and permission features available in LibGuides and LibGuides CMS, presents two case studies, and offers considerations and best practices for hosting patron-created content.
π

Compiler construction is considered an intimidating discipline in Computer Science and related courses. This is perhaps captured quite graphically by the cover of the standard book on the subject, the so-called "Dragon book", by Alfred V. Aho, Jeffrey D. Ullman and later on with Ravi Sethi and Monica S. Lam. There are "red", "green" and "purple dragon" editions, but the Dragon, representing how burdensome people think of the subject, is always there. The aim of this paper is to introduce π, a formal semantic framework for compiler construction together with program validation and its implementation in the Maude language that aims at easing the process of compiler construction in a rigorous way.
Block kernel nonnegative matrix factorization for face recognition

Nonnegative matrix factorization (NMF) is a linear approach for extracting localized feature of facial image. However, NMF may fail to process the data points that are nonlinearly separable. The kernel extension of NMF, named kernel NMF (KNMF), can model the nonlinear relationship among data points and extract nonlinear features of facial images. KNMF is an unsupervised method, thus it does not utilize the supervision information. Moreover, the extracted features by KNMF are not sparse enough. To overcome these limitations, this paper proposes a supervised KNMF called block kernel NMF (BKNMF). A novel objective function is established by incorporating the intra-class information. The algorithm is derived by making use of the block strategy and kernel theory. Our BKNMF has some merits for face recognition, such as highly sparse features and orthogonal features from different classes. We theoretically analyze the convergence of the proposed BKNMF. Compared with some state-of-the-art methods, our BKNMF achieves superior performance in face recognition.
Bayes Performance of Batch Data Mining Based on Functional Dependencies

Batch processes and phenomena in traffic video data processing, such as traffic video image processing and intelligent transportation, are commonly used. The application of batch processing can increase the efficiency of resource conservation. However, owing to limited research on traffic video data processing conditions, batch processing activities in this area remain minimally examined. By employing database functional dependency mining, we developed in this study a workflow system. Meanwhile, the Bayesian network is a focus area of data mining. It provides an intuitive means for users to comply with causality expression approaches. Moreover, graph theory is also used in data mining area. In this study, the proposed approach depends on relational database functions to remove redundant attributes, reduce interference, and select a property order. The restoration of selective hidden naive Bayesian (SHNB) affects this property order when it is used only once. With consideration of the hidden naive Bayes (HNB) influence, rather than using one pair of HNB, it is introduced twice. We additionally designed and implemented mining dependencies from a batch traffic video processing log for data execution algorithms.
Transpiling Programming Computable Functions to Answer Set Programs

Programming Computable Functions (PCF) is a simplified programming language which provides the theoretical basis of modern functional programming languages. Answer set programming (ASP) is a programming paradigm focused on solving search problems. In this paper we provide a translation from PCF to ASP. Using this translation it becomes possible to specify search problems using PCF.
An Introduction to Storage Facilities

Library storage facilities provide an economical solution to the growing conflict between space and information access that institutions of higher education are facing all across the world. While there has been a renewed interest in storage facilities, they have been employed successfully in the United States and Europe for almost 100 years. The growing demand for easily accessible electronic resources does not negate the responsibility for libraries to ensure future access to physical materials that are not reliant on computer-mediated access. Depending on the specific requirements and the opportunities for collaboration, there are several options for storage facility models, providing a range of options in terms of shared funding, shared resources, and shared services.
Design and Implementation of Stereoscopic Image Generation

In this paper, we proposed the design and implementation of a new stereoscopic image generation system. In the conventional system, the smoothness of depth map can reduce the incidence of image holes, but cause geometric distortions of the image depth. To solve the problems, the depth map is first refined to increase the accuracy of image depth and the quality of images. Next, we derive a hardware-oriented method for 3D warping and improve hole-filling procedures to enhance the performance of image. Finally, the circuit design is presented according to the proposed stereoscopic image generation system to achieve real-time applications. The experimental results demonstrate that the proposed system can improve by 10–27% when compared to existing methods.
Synthesizing Set Functions

Set functions are a feature of functional logic programming to encapsulate all results of a non-deterministic computation in a single data structure. Given a function f of a functional logic program written in Curry, we describe a technique to synthesize the definition of the set function of f. The definition produced by our technique is based on standard Curry constructs. Our approach is interesting for three reasons. It allows reasoning about set functions, it offers an implementation of set functions which can be added to any Curry system, and it has the potential of changing our thinking about the implementation of non-determinism, a notoriously difficult problem.
FMS: Functional Programming as a Modelling Language

In this paper we introduce the Functional Modelling System (FMS). The system introduces the Functional Modelling Language (FML), which is a modelling language for NP-complete search problems based on concepts of functional programming. Internally, we translate FML specifications to an Answer Set Program to obtain models. We give a general overview of the new FML language, and how this language is handled in the system. We give a step-by-step walkthrough of the system, pointing out what features are in place, and what improvements are still possible.
Order on types based on monotone comparative statics

This paper introduces a novel concept of orders on types by which the so-called monotone comparative statics is valid in all supermodular games with incomplete information. We fully characterize this order in terms of what we call common optimism, providing a sense in which our order has a sharp epistemic interpretation. We say that type ti′ is higher than type ti in the order of the common optimism if ti′ is more optimistic about state than ti; ti′ is more optimistic that all players are more optimistic about state than ti; and so on, ad infinitum. First, we show that whenever the common optimism holds, monotone comparative statics hold in all supermodular games. Second, we show the converse. We construct an “optimism-elicitation game” as a single supermodular game with the property that whenever the common optimism fails, monotone comparative statics fails as well.