Reviewerly/exHarmony huggingface dataset:
Design of a blind quantization‐based audio watermarking scheme using singular value decomposition

Summary Watermarking is a mechanism in which owner of the audio file hides the watermark information into a audio for various applications. The identity of the owner of the audio file is hidden in the audio, which is known as watermark. In this article, a quantization‐based audio watermarking using singular value decomposition (SVD) is proposed. The original audio signal is converted into non overlapping two dimensional matrix blocks. The SVD is applied to each block. The watermark is embedded into audio signal by quantization of largest singular value of the block. The watermark is extracted blindly without using original audio signal. Experimental results show the watermark's high imperceptibility in the audio signal and good performance against Stirmark as well as traditional signal processing attacks. Compared with other audio watermarking methods, our method has higher embedding capacity and robust against various traditional signal processing attacks.
Using Multi-objective Optimization to Solve the Long Tail Problem in Recommender System

An improved algorithm for recommender system is proposed in this paper where not only accuracy but also comprehensiveness of recommendation items is considered. We use a weighted similarity measure based on non-dominated sorting genetic algorithm II (NSGA-II). The solution of optimal weight vector is transformed into the multi-objective optimization problem. Both accuracy and coverage are taken as the objective functions simultaneously. Experimental results show that the proposed algorithm improves the coverage while the accuracy is kept.
Using Episodic Memory for User Authentication

Passwords are widely used for user authentication, but they are often difficult for a user to recall, easily cracked by automated programs, and heavily reused. Security questions are also used for secondary authentication. They are more memorable than passwords, because the question serves as a hint to the user, but they are very easily guessed. We propose a new authentication mechanism, called “life-experience passwords (LEPs).” Sitting somewhere between passwords and security questions, an LEP consists of several facts about a user-chosen life event—such as a trip, a graduation, a wedding, and so on. At LEP creation, the system extracts these facts from the user’s input and transforms them into questions and answers. At authentication, the system prompts the user with questions and matches the answers with the stored ones. We show that question choice and design make LEPs much more secure than security questions and passwords, while the question-answer format promotes low password reuse and high recall. Specifically, we find that: (1) LEPs are 10 9 --10 14 × stronger than an ideal, randomized, eight-character password; (2) LEPs are up to 3 × more memorable than passwords and on par with security questions; and (3) LEPs are reused half as often as passwords. While both LEPs and security questions use personal experiences for authentication, LEPs use several questions that are closely tailored to each user. This increases LEP security against guessing attacks. In our evaluation, only 0.7% of LEPs were guessed by casual friends, and 9.5% by family members or close friends—roughly half of the security question guessing rate. On the downside, LEPs take around 5 × longer to input than passwords. So, these qualities make LEPs suitable for multi-factor authentication at high-value servers, such as financial or sensitive work servers, where stronger authentication strength is needed.
Specialized bibliographic service in the structure of the Russian state library (1918—2018)

December 16, 2018 marked the 100th anniversary of the formation of the Reference Bureau within the Library of the State Rumyantsev Museum. This date is quite rightly considered the birthday of the specialized bibliographic service of the Russian State Library (RSL). Practically from the first years, the specialized bibliographic division of the Library was considered as a complex unit integrating bibliographic service and compiling activity with the considerable elements of scientific-methodical, organizational-coordinating and even scientific-research work in the field of bibliography. Despite the repeated internal restructuring and renaming of division, this approach has continued for many decades. In 1926, the Reference Bureau joined the “super complex” of Scientific-bibliographic Department, which became the basis for more specialized bibliographic divisions, created there beginning with mid-1940s. Over the following years, the bibliographic service of the RSL has undergone numerous structural transformations (mergers and demergers) and has repeatedly changed its name. Analyzing the historical experience, we can distinguish three cross-cutting directions of bibliographic activities of the Library, conventionally designated as reference-, scientific- and recommendatory-bibliographic. To the 100th anniversary the Scientific Research Department of Bibliography of the RSL prepared the Retrospective Index “Bibliographic activities of the Russian State Library (1918—2018)”, reflecting the literature on bibliographic activities of the RSL and its publications on the problems of bibliographic science and practice.
Learning Pakistani Culture through The Namaz Emoji

Non-verbal communication is increasingly used in electronic messages. In the current digital era, emojis have become famous in non-verbal communication. They are used to convey feeling, emotion, and attitude, and they are considered substitutes for written language. Online communities use different kinds of emojis: Finnish communicators use culturally specific ones like `sauna', `stuck' (to a frozen pole), and `headbanger', while Hindus use religious emojis such as `Happy Diwali' on platforms like Facebook. Little research exists on both the use of emojis and the process of designing an emoji. Pakistan has a rich culture, with many illustratable ideas such as Namaz, or prayer, Eid celebration, hospitality, drinking tea, truck art, red wedding dress, generosity, and family loyalty, for example. For the approximately 35 million Pakistani users, there is not a single emoji that represents Pakistani culture on social media. To address this gap, this study utilized the design thinking methodology to design a Namaz emoji. The emoji was improved based on feedback during each stage of design thinking. The final version was tested among 294 participants. The results of this study revealed that most of the participants liked the concept of a Namaz emoji. As a theoretical contribution, we introduced the process of designing an emoji.
Towards the Incorporation of Proprioception in Evolutionary Robotics Controllers

The ability to sense the relative position of one's own body parts is referred to as proprioception. This sense allows humans to interact with their environment without direct observation. Evolutionary Robotics is a field of study that investigates the automatic development of robotic controllers and morphologies. This paper proposes the idea of providing robotic controllers with a form of proprioception. This was achieved by providing robotic controllers with simulated location information during execution. This study compared controllers with and without proprioception, both in simulation and the real world. The controllers with proprioception outperformed those without, in all trials.
The Long‐Term Robustness and Stability of Consensus Values as Composition Location Estimators for a Typical Geochemical Test Material in the Geo<i>PT</i> Proficiency Testing Programme

Re‐issuing the same test material, its true identity unknown to participants, in two rounds of the Geo PT proficiency testing programme 18 years apart has demonstrated remarkable similarity, and therefore stability, of consensus values independently estimated for over fifty measurands in each round. A comparison of the two data sets, Geo PT 5 (AMH‐1) from 1999 and Geo PT 41 (ORA‐1) from 2017, shows that corresponding consensus values, rigorously derived by current procedures for complete compatibility, are for the most part statistically indistinguishable when account is taken of their associated uncertainties. Inferences that may be drawn from this exceptional agreement include: (a) the consensus estimation procedure was robust and gave consistent results; (b) overall, the balance of the contributed data was unaffected by significant changes in: (i) the populations of laboratories participating, (ii) the proportions of laboratories producing results by different techniques, (iii) the manner in which systems were calibrated, or (iv) the aspirations of laboratories to attain higher quality results over time; and (c) unsurprisingly perhaps, that the test material itself had remained stable and unchanged during that time. Additionally, a statistical comparison of the original values for AMH‐1 with consensus values derived by current procedures demonstrates that they are also effectively indistinguishable.
Safer Program Behavior Sharing Through Trace Wringing

When working towards application-tuned systems, developers often find themselves caught between the need to share information (so that partners can make intelligent design choices) and the need to hide information (to protect proprietary methods or sensitive data). One place where this problem comes to a head is in the release of program traces, for example a memory address trace. A trace taken from a production server might expose details about who the users are or what they are doing, or it might even expose details of the actual computation itself (e.g. through a side channel). Engineers are often asked to make, by hand, "analogs" of their codes that would be free from such sensitive data or, may even try to describe behaviors at a high level with words. Both of these approaches lead to missed opportunities, confusion, and frustration. We propose a new problem for study, trace-wringing, that seeks to remove as much information from the trace as possible while still maintaining key characteristics of the original. We formalize this problem and show that, for a specific instance around memory traces, as little as a few thousand bits need to be shared. We demonstrate experimentally that the trace-wrung proxies behave similarly in the context of cache simulation but with bounded leakage, and examine the sensitivity of wrung traces to a class of attacks on AES encryption.
A Supervised Keyphrase Extraction System Based on Graph Representation Learning

Current supervised approaches for keyphrase extraction represent each candidate phrase with a set of hand-crafted features and machine learning algorithms are trained to discriminate keyphrases from non-keyphrases. Although the manually-designed features have shown to work well in practice, feature engineering is a labor-intensive process that requires expert knowledge and normally does not generalize well. To address this, we present SurfKE, an approach that represents the document as a word graph and exploits its structure in order to reveal underlying explanatory factors hidden in the data that may distinguish keyphrases from non-keyphrases. Experimental results show that SurfKE, which uses its self-discovered features in a supervised probabilistic framework, obtains remarkable improvements in performance over previous supervised and unsupervised keyphrase extraction systems.
Exploring Human-Robot Trust During Teaming in a Real-World Testbed

Project Aquaticus is a human-robot teaming competition on the water involving autonomous surface vehicles and human operated motorized kayaks. Teams composed of both humans and robots share the same physical environment to play capture the flag. In this paper, we present results from seven competitions of our half-court (one participant versus one robot) game. We found that participants indicated more trust in more aggressive behaviors from robots.
Using image processing on Erichsen cup test machine to calculate anisotropic property of sheet metal

Erichsen cup test is widely used to test sheet metal formability and ductility according to standard testing methods such as: ISO 8490, EN ISO 20482 and JIS Z-2247. During the Erichsen cup test, the sheet metal is pushed by a ball-shape punch in multi-axis forming until the specimen cracks. In this study, a CCD camera was mounted on top of the testing machine and a LED ring light was used to provide the light source. The forming videos were captured in real-time and sent to an image processing computer program. The OpenCV library was used to develop the sheet-metal-forming image analysis program. The image was first converted into grayscale. The threshold methods were used to separate bright and dark areas. Then, the fitellipse function was used to identify the ellipse shape and position. The lengths of major and minor axes of ellipse were measured and the ratio between minor and major axis was calculated. The tests were then repeated for 0, 45 clockwise, 45 anti-clockwise and 90 degree orientations of the metal sheet. The anisotropic values of the specimens were calculated from the ration between major-minor axis. The calculated anisotropic results from the image analysis of the known material were compared with the conventional tensile tests results. It was found that the ratio between major-minor axes at different orientations showed a few variations. However, the values of planar anisotropic and average anisotropic were in good agreement.
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order

Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-name etc.) was done at the meta-level, treating them as term rewriting systems. Levy’s call-by-push-value (CBPV) calculus provides a more powerful approach for reasoning, by treating CBPV terms as a common intermediate language which captures both call-by-value and call-by-name, and by allowing equational reasoning about changes to evaluation order between or within programs. We extend CBPV to additionally deal with call-by-need, which is non-trivial because of shared reductions. This allows the equational reasoning to also support call-by-need. As an example, we then prove that call-by-need and call-by-name are equivalent if nontermination is the only side-effect in the source language. We then show how to incorporate an effect system. This enables us to exploit static knowledge of the potential effects of a given expression to augment equational reasoning; thus a program fragment might be invariant under change of evaluation regime only because of knowledge of its effects.
Qualitative and Cognitive Analysis and Modeling Tool for Biological Data

This article describes a qualitative cognitive analysis and modeling tool (QCAM) for biological data collected using sensors such as a simple brain-wave sensor, while executing an actual task. However, these types of sensors are generally less accurate than devices designed for medical use. Sensors may be influenced by noise or personal differences between subjects. A qualitative approach is very effective for analyzing such data, because the authors can understand their essential features by focusing on qualitative changes, such as increasing, decreasing, and steady changes in the data, without quantifying it. Therefore, in addition to statistical analysis, QCAM provides qualitative analysis and modeling of data and allows us to verify the model by using qualitative reasoning. This article explains QCAM and describes experimental results obtained by using real driving data, a combination of movie data from a camera, acceleration data from a smart phone, and brain-wave data from a simple brain-wave sensor, that was obtained while a person drove a vehicle.
Fuzzy lattice operations on first-order terms over signatures with similar constructors: A constraint-based approach

Unification and generalization are operations on two terms computing respectively their greatest lower bound and least upper bound when the terms are quasi-ordered by subsumption up to variable renaming (i.e., t1⪯t2 iff t1=t2σ for some variable substitution σ). When term signatures are such that distinct functor symbols may be related with a fuzzy equivalence (called a similarity), these operations can be formally extended to tolerate mismatches on functor names and/or arity or argument order. We reformulate and extend previous work with a declarative approach defining unification and generalization as sets of axioms and rules forming a complete constraint-normalization proof system. These include the Reynolds-Plotkin term-generalization procedures, Maria Sessa's "weak" unification with partially fuzzy signatures and its corresponding generalization, as well as novel extensions of such operations to signatures with weaker functor similarities (i.e., with possibly different arities). One advantage of this approach is that it requires no modification of the conventional data structures for terms and substitutions. This and the fact that these declarative specifications are efficiently executable conditional Horn-clauses offers great practical potential for fuzzy information-handling applications.
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound

The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. While fully sufficient for many practical applications, the Wegman-Carter construction, however, is well-known to break if nonces are ever repeated, and provides only birthday-bound security if instantiated with a permutation. Those limitations inspired the community to severals recent proposals that addressed them, initiated by Cogliati et al.'s Encrypted Wegman-Carter Davies-Meyer (EWCDM) construction. This work extends this line of research by studying two constructions based on the sum of PRPs: (1) a stateless deterministic scheme that uses two hash functions, and (2) a nonce-based scheme with one hash-function call and a nonce. We show up to 2n/3-bit security for both of them if the hash function is universal. Compared to the EWCDM construction, our proposals avoid the fact that a single reuse of a nonce can lead to a break.
Automated Data Collection and Safety Analysis at Intersections Based on a Novel Video Processing System

A novel video-based system is presented which collects trajectories and motion parameters of all objects at intersections. First, a modified ViBe method is used to extract the foreground of moving objects. Then, an object-point-contour matching approach is developed for pairing, tracking, and generating trajectories. Finally, raw trajectories are corrected through post-processing and motion parameters are estimated after object classification. This system demonstrates better performance while tracking tardy and shadowed objects compared with previous studies. The accuracies of 86% and 91% are obtained for traffic counts and velocity validation, respectively. This paper also presents a sample safety analysis using traffic conflict technology to demonstrate the possible implementation for traffic management and safety analysis.
Geochemical characteristics of agricultural soils, Assiut governorate, Egypt

The geochemical investigation of agricultural soil is a great demand because of its help in the characterization of soil and its suitability for cultivation. The urbanization, cultivation, and industrial activities at Assiut Governorate have adversely impacted the chemical composition of soil, especially its content of heavy metals. The study area includes El-Madabgh sewage station and many big industries; cement, fertilizers, and pharmaceutical. The Nile Valley soils are very comparable in composition and composed mainly of SiO2, Al2O3, Fe2O3, CaO, MgO, and TiO2 which represent about 88% of its chemical composition. The chemical composition gave an indication about the mineralogical assemblage of soil; quartz, clay minerals, and calcite. The results pointed to the mixed source (geogenic and anthropogenic) of Fe, Co, Cu, Ni, Zn, Zr, and Cr and the anthropogenic source of As, Pb, and Cd (especially phosphatic fertilizers) in the studied soil. The studied soil chemistry affected mainly by the agricultural practices (application of fertilizers, pesticides, manure, and wastewater irrigation), industrial inputs, and atmospheric deposition. Generally, the Egyptian soil needs more geochemical studies to monitor its quality and enhance of its productivity.
Intelligent and semantic threshold schemes for security in cloud computing

Summary This article presents new methods of securing data with particular emphasis on their applications in Cloud Computing. Methods of hiding data dedicated to processes of its security will be illustrated by cryptographic techniques, particularly data splitting protocols. Cryptographic information sharing algorithms are a particularly important type of techniques allowing confidential or secret data to be secured. These algorithms have been enhanced with new classes of solutions, including semantic protocols of secret sharing. The innovation of this solution consists in the presentation of smart data securing algorithms that use techniques of the semantic sharing of secret information. The information subjected to the process of splitting and hiding can take various forms, including that of services. Because of this aspect, namely, the various forms of the secret, and the use of universal information hiding techniques, a particularly important aspect of the solutions presented here is the ability to use them in various areas of data security. One of such areas comprises Cloud Computing, which forms the leading subject of this publication. In this article, the authors describe intelligent cryptography techniques dedicated to security services data. The most important achievement is the introduction of a new class of data encryption protocols, such as semantic threshold schemes.
Figure Retrieval from Collections of Research Articles

In this paper, we introduce and study a new task of figure retrieval in which the retrieval units are figures of research articles and the task is to rank figures with response to a query. As a first step toward addressing this task, we focus on textual queries and represent a figure using text extracted from its article. We suggest and study the effectiveness of several retrieval methods for the task. We build a test collection by using research articles from the ACL Anthology corpus and treating figure captions as queries. While having some limitations, using this data set we were able to obtain some interesting preliminary results on the relative effectiveness of different representations of a figure and different retrieval methods, which also shed some light regarding possible types of information need, and potential challenges in figure retrieval.
A Machine Learning Approach to Detect Violent Behaviour from Video

The automatic classification of violent actions performed by two or more persons is an important task for both societal and scientific purposes. In this paper, we propose a machine learning approach, based a Support Vector Machine (SVM), to detect if a human action, captured on a video, is or not violent. Using a pose estimation algorithm, we focus mostly on feature engineering, to generate the SVM inputs. In particular, we hand-engineered a set of input features based on keypoints (angles, velocity and contact detection) and used them, under distinct combinations, to study their effect on violent behavior recognition from video. Overall, an excellent classification was achieved by the best performing SVM model, which used keypoints, angles and contact features computed over a 60 frame image input range.